Alphabeta MathHow statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
False: the prover must run in polynomial time
Statement
An IP prover must run in polynomial time.
Refutation
Given: the interactive-protocol convention.
The verifier's polynomial running time bounds each message length and the number of rounds.
A prover strategy in Interactive-proof transcripts, rounds, and prover strategies is an arbitrary response function, explicitly with no computability or time restriction. Therefore the asserted requirement is false.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · one level
1 result within one dependency step of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Goldreich, Foundations of Complexity Theory, §11.2 (standard reference, not scraped)