While this submission is a draft, it cannot be used by other submissions.

Proof of `A fixed RAM program constructs the rounded blow-up`

groundedproofs/Lax263307Proofs/NativeBlowUp.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.

Read the Lean proof on GitHub

Description

The native owner loop matches the exact finite-sigma numbering. The matrix loop follows those owners into the preserved input matrix. Composing both with weight preprocessing and the output pass yields one compiled program; an explicit magnitude exponent and layout allowance give uniform quadratic bounds at every sufficiently large word width.