Correctness of the tester input and parameter program
ProvedExpandingCodes.Computation.TesterFrontend.program_stopscoding-theorycomplexity-theoryexpanding-codes-polynomial-stretch
Let , , and let be a binary word of length . Supply the canonical encoding of followed by the bits of , and suppose satisfies the tester-envelope conditions.
The tester frontend starts in its specified initial store and has an execution satisfying
Here is the defined frontend clock. The core predicate records the canonical field, auxiliary degree, word encoding and bounded workspace used by the Gram construction. The first two buffer heads equal one, and every buffer retains its bottom marker. This is the initialization interface for deterministic rank testing.
Preamble
import Definitions.Def_ExpandingCodes_PolynomialStretch_BinaryRuntime set_option autoImplicit false open scoped Classical open NKtLB
Formal statement
theorem ExpandingCodes.Computation.TesterFrontend.program_stops (d n M : ℕ) (hd : 4 ≤ d) (hn : 2 ≤ n)
(inp : Inputs) (y : ExpandingCodes.PolynomialStretch.Word (ExpandingCodes.PolynomialStretch.rowCount d n)) (hi : inp.input=ExpandingCodes.PolynomialStretch.sizeInput n++ExpandingCodes.PolynomialStretch.wordBits y)
(hcover : ExpandingCodes.PolynomialStretch.TesterEnvelopeCovers d n M) :
∃ t e,t ≤ ExpandingCodes.Computation.TesterFrontend.time d n M ∧
(ExpandingCodes.Computation.TesterFrontend.program d).Stops inp ((ExpandingCodes.Computation.TesterPrefix.initialStore d).toCfg (ExpandingCodes.Computation.TesterFrontend.program d).entry) t e ∧
ExpandingCodes.Computation.TesterGram.Core d (ExpandingCodes.PolynomialStretch.fieldExponent d n) (ExpandingCodes.PolynomialStretch.fieldExponent_pos d n) (ExpandingCodes.PolynomialStretch.auxiliaryDegree (ExpandingCodes.PolynomialStretch.fieldSize d n) d) M
(fun z => decide (y z≠0)) e.store ∧
e.output=[] ∧ e.bufferHead 0=1 ∧ e.bufferHead 1=1 ∧
(∀ b,ExpandingCodes.Computation.TapeArrays.BottomMarked e.store b) := 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.TesterFrontend. Supporting formal implementation contract, rather than a verbatim statement in the paper. Exact local source: ExpandingCodes/Computation/TesterFrontend.lean, declaration ExpandingCodes.Computation.TesterFrontend.program_stops; source file SHA256 409ef568c314d742c163f97640cf36e887e6e4e2e632549ed442249c01726fcd. The public construction is at https://prove2.me/missions/Expanding_Codes_with_Polynomial_Stretch.