Correctness of the sampler initialization program
ProvedExpandingCodes.Computation.SamplerAssembly.prelude_stopscoding-theorycomplexity-theoryexpanding-codes-polynomial-stretch
Let , , and . Let injectively place the sampler's 80-register workspace in a bank of registers. Give the machine the canonical unary encoding of and arbitrary remaining input tapes. Suppose satisfies the sampler-envelope conditions for .
Starting from its specified initial store, the sampler frontend reaches exactly its specified initialization store and satisfies
The clock is the defined frontend time. The readiness predicate includes the size parameters, canonical field environment, random tables and register bounds needed by the row-writing phase. This separates initialization from the sampler's subsequent row and layer loops.
Preamble
import Definitions.Def_ExpandingCodes_PolynomialStretch_BinaryRuntime set_option autoImplicit false open scoped Classical open NKtLB
Formal statement
theorem ExpandingCodes.Computation.SamplerAssembly.prelude_stops {R : ℕ} (r : Fin 80 → Fin R) (hr : Function.Injective r)
(d n k : ℕ) (hd : 1 ≤ d) (hk : 0<k) (hn : 2 ≤ n) (hnk : k ≤ n)
(inp : Inputs) (hi : inp.input=ExpandingCodes.PolynomialStretch.sizeInput n) (M : ℕ) (hM : ExpandingCodes.PolynomialStretch.SamplerEnvelopeCovers d k n M) :
∃ t e,t ≤ ExpandingCodes.Computation.SamplerAssembly.preludeTime d n M ∧
(ExpandingCodes.Computation.SamplerAssembly.samplerFrontendProgram r hr d k).Stops inp ((ExpandingCodes.Computation.SamplerAssembly.initialStore R 2).toCfg (ExpandingCodes.Computation.SamplerAssembly.samplerFrontendProgram r hr d k).entry) t e ∧
e.store=ExpandingCodes.Computation.SamplerAssembly.preludeStore r hr d n k inp ∧ ExpandingCodes.Computation.SamplerAssembly.RuntimeReady r d n k inp M e.store ∧ e.output=[] := by sorry
Source
Algorithmic supporting lemma for Section 2 of Isaac M Hair and Amit Sahai, Expanding Codes with Polynomial Stretch; the explicit tape-machine implementation is formalized in ExpandingCodes.Computation.SamplerAssembly. Supporting formal implementation contract, rather than a verbatim statement in the paper. Exact local source: ExpandingCodes/Computation/SamplerAssembly.lean, declaration ExpandingCodes.Computation.SamplerAssembly.prelude_stops; source file SHA256 4a05e86060667bfd347b86e8c15ff03a21a6d9a7162509564a5e7e8c0af229b1. The public construction is at https://prove2.me/missions/Expanding_Codes_with_Polynomial_Stretch.