Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2.1's decoder at an arbitrary payload base

Proved
LinearSetReconciliation327.Main.pinsketch_decoding_at

by djwj233 · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

decoderlinear-set-reconciliationpinsketchword-ram

If the payload of a t×wt \times wt×w syndrome yyy is staged at word base β\betaβ in an otherwise zero memory, then Proposition 2.1's decoder — run through the copy-in/run/copy-out layer — halts within positiveDecoderBudget(t,w)+24⌈t/8⌉+40\mathrm{positiveDecoderBudget}(t,w) + 24\lceil t/8\rceil + 40positiveDecoderBudget(t,w)+24⌈t/8⌉+40 steps and outputs the decoding of the sparse vector xxx from the pinning syndromes y=pin(x)y = \mathrm{pin}(x)y=pin(x): a base-relative form of Proposition 2.1's decoding conjunct, in which the payload sits at an arbitrary word address rather than at word 000.

Preamble
import Definitions.Def_LinearSetReconciliation327_Main_Basic
import Definitions.Def_LinearSetReconciliation327_Main_Pinsketch
import Definitions.Def_LinearSetReconciliation327_Main_DecoderModel
import Definitions.Def_LinearSetReconciliation327_Main_DecoderTables
import Definitions.Def_LinearSetReconciliation327_Main_DecoderProgram
import Definitions.Def_LinearSetReconciliation327_Main_P21RunStmt
Formal statement
namespace LinearSetReconciliation327.Main

variable {F : Type} [Field F] [DecidableEq F] [Algebra (ZMod 2) F] {N t w : ℕ}

theorem pinsketch_decoding_at (b : Module.Basis (Fin w) (ZMod 2) F) (ι : ℕ → F)
    (y : Fin (t * w) → ZMod 2) (β : ℕ) (s : RAMState)
    (hN : 1 ≤ N) (ht : 1 ≤ t) (htN : t ≤ N) (h0 : ∀ i < N, ι i ≠ 0)
    (hinj : Set.InjOn ι (Set.Iio N)) (hpc : s.pc = 0)
    (hpayload : ∀ j < wordsOf (8 * w) (t * w), s.mem (β + j) = packMem (8 * w) y j)
    (hpayloadWord : ∀ j < wordsOf (8 * w) (t * w), s.mem (β + j) < 2 ^ (8 * w))
    (hzero : ∀ a, (a < β ∨ β + wordsOf (8 * w) (t * w) ≤ a) → s.mem a = 0)
    (hβL : wordsOf (8 * w) (t * w) ≤ β)
    (hβfit : β + 2 * wordsOf (8 * w) (t * w) < 2 ^ (8 * w)) :
    ∃ s', HaltsWithin (programOfStatement (pinsketchRunStmt t w β))
        (detEnv (8 * w) (detStd t N b ι))
        (((positiveDecoderBudget t w + (24 * wordsOf (8 * w) (t * w) + 40) : ℕ) : ℝ)) s s' ∧
      decoderPost (N := N) b ι y s' := by sorry

end LinearSetReconciliation327.Main
Source
arXiv:2611.11409 (Liu, Xu, Yang, Zhou, *Linear Set Reconciliation with O(d) Additive Redundancy*), §2.2 (pinsketch syndromes and the decoder) and §2.1 (word-RAM model), Proposition 2.1 (decoding conjunct); extracted from the verified development `Solutions/Sol_p21_copyrun.lean`.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me