Proof of `Polynomial circuit simulation of a verifier`
groundedproofs/Lax429075Proofs/CircuitMachine.lean · lax-429075
What this proof establishes
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
In the paper
- page 3 of this submission's paper
Description
Unroll the bounded verifier and emit its gate clauses with polynomially bounded loops.