Proof of `Packed implicit parity systems for deterministic computations`
groundedproofs/Lax119563Proofs/Reduction/PackedMain.lean · lax-119563
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
The system is (the compiled code-ordered verifier program), with the packed width and ; its correctness and the bounds on locations and schemas are . The machine is the composition of the preprocessor (: it reads and writes the input as records of symbols carrying and the flags , in time ) and the machine of the packed generator (): a generator in the stack language whose loops over blocks and registers run up to runtime values, analysed with growth classes on two scales ( times a factor for the input length and the register values, and for the linear quantities), in time .