Proof of `Small-value projection games for every registered NP language`
groundedproofs/Lax253009Proofs/SmallValueNP.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
The explicit registered-machine simulation supplies Cook–Levin, and the fixed-alphabet soundness amplifier preserves a polynomial bound in input length.