Pinsketch decoder, stage 4 strengthened: the verifier's memory frame above the decoder scratch
ProvedLinearSetReconciliation327.Main.pinsketch_decoder_verifier_frameStrengthening of Proposition 2.1's verification stage with the memory frame the published interface dropped. Let be a basis of over , an injection on , the stored sketch, the Frobenius expansion of its payload, and a memory that is CandidateReady (the candidate support is stored as an output list at decoderOutputBase t, the saved syndrome is stored at decoderSavedBase t, and the metadata slots carry the saved base, , the output base, the verification base , the ROOTSEARCH flag and the candidate count). Then the compiled verification stage verificationFinalProcedure halts in at most steps with decoderPost — the decoding disjunct of Proposition 2.1 — and it changes no word outside verifierWritable V (2t); equivalently, it changes no word at or above . This is exactly the MemoryFrame conjunct of the accepted verifierProcedure_spec, which the published stage theorem kept out of its postcondition.
import Definitions.Def_LinearSetReconciliation327_Main_DecoderLemmas set_option autoImplicit false open Finset
theorem LinearSetReconciliation327.Main.pinsketch_decoder_verifier_frame
{F : Type} [Field F] [DecidableEq F] [Algebra (ZMod 2) F] {N t w : ℕ}
(b : Module.Basis (Fin w) (ZMod 2) F) (ι : ℕ → F) (y : Fin (t * w) → ZMod 2) (e : ℕ → F)
(P : Program) (E : RAMEnv) (pc : ℕ) (m : ℕ → ℕ)
(hAt : At P pc (Stmt.compile verificationFinalProcedure pc))
(hN : 1 ≤ N) (ht : 1 ≤ t) (hw : 1 ≤ w) (hW : E.W = 8 * w) (hdet : E.det = detStd t N b ι)
(hEnd : decoderAllocEnd t < 2 ^ E.W) (hNw : N < 2 ^ w)
(h0 : ∀ i < N, ι i ≠ 0) (hinj : Set.InjOn ι (Set.Iio N))
(hodd : ∀ k : Fin t, e (2 * k.val) = payloadField b y k)
(heven : ∀ a : ℕ, 0 < a → e (2 * a - 1) = e (a - 1) ^ 2)
(hReady : CandidateReady b ι t N e m) :
Sem P E pc (pc + 432) (boundaryState pc m)
(fun k z => k ≤ (170 * t + 117) * t + 172 * t + 149 ∧ decoderPost (N := N) b ι y z ∧
MemoryFrame (verifierWritable (decoderVerifyBase t) (2 * t)) m z.mem) := by sorry