Proof of `The complete finite game-to-clique construction`
groundedproofs/Lax253009Proofs/GameToClique.lean · lax-253009
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.
Description
Choose l so that l*epsilon exceeds one, then choose the uniform CNA/FAF parameters and a sampling multiplier. The local-test verifier has free-bit/soundness ratio 1/l. Apply the proved randomized transfer, retaining its explicit polynomial vertex bound.