Lax Lean Archive

Proof of `Polynomial time for CNF verification`

groundedproofs/Lax429075Proofs/VerifierTime.lean · lax-429075

What this proof establishes

no assumptions

lem✓Lax429075.VerifierTime

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

In the paper

  • page 2 of this submission's paper

Description

Decode the pair, evaluate the formula against the certificate, and clear the work stacks. The finite stack program takes at most 100(n+1)4100(n+1)^4 steps on every input, including malformed encodings.