Proof of `A fixed RAM program for exact small-target search`
groundedproofs/Lax263307Proofs/NativeExhaustive.lean · lax-263307
What this proof establishes
no assumptions
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
Compose the native binomial table, exact ranked-subset decoder, matrix independence scan, first-success loop, and physical input/output wrapper. The program is fixed before every input; a uniform explicit source bound and compiler layout allowance give c*(n+k+2)^2*(n+1)^k instructions and sufficient word width.