Proof of `A uniform RAM program for the rounded ellipsoid update`
groundedproofs/Lax263307Proofs/NativeRoundedStep.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
Compile the complete reader/update/writer command. The native magnitude and word guards are bounded by a cubic polynomial in n+h+k; its instruction bound is polynomial of degree twelve in those same input parameters.