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

Proof of `A fixed RAM program for the moment-coordinate catalog`

groundedproofs/Lax263307Proofs/NativeCatalog.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 Pascal, subset-decoding and mask-packing loops append exactly the catalog entries. Physical input/output and compilation preserve this order. Both executed instructions and sufficient word width are bounded by one fixed cubic polynomial in n, r and the number of catalog entries.