Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pinsketch decoder: the decoding conjunct of Proposition 2.1

Proved
LinearSetReconciliation327.Main.pinsketch_decoder_conjunct

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

pinsketchset-reconciliationword-ram

This is the third conjunct of Proposition 2.1: the explicit decoder exists and is polynomial-time.

For every N≥1N \ge 1N≥1, every t≤Nt \le Nt≤N, every field FFF of characteristic two, every www with N<2wN < 2^{w}N<2w and every basis bbb of FFF over Z2\mathbb{Z}_2Z2​ with www coordinates, and every injective sequence (ι0,…,ιN−1)(\iota_0,\dots,\iota_{N-1})(ι0​,…,ιN−1​) of nonzero elements of FFF, there are a word width WWW and a field-data table det such that:

  1. WidthOK W N 8 w holds and twt wtw words fit in 2W2^{W}2W memory cells;
  2. for every packed syndrome y∈(Z2w)ty \in (\mathbb{Z}_2^{w})^{t}y∈(Z2w​)t, the word-RAM program pinsketchDecoderProgram, started from decoderStart W y [], halts within
20000 (t+w+1)620000\,\bigl(t+w+1\bigr)^{6}20000(t+w+1)6

steps in a state satisfying decoderPost, i.e. it outputs a ttt-light vector with syndrome yyy when one exists, and rejects only when none exists.

This is the whole decoder guarantee of Proposition 2.1, obtained by composing the four stage contracts (read, key solver, root search, verifier) and the glue lemmas that sequence them. It is the node any later result about the Pinsketch decoder can cite.

Formalization Note pinsketchDecoderProgram is a concrete Program (a published definition), not an existentially quantified object; WidthOK and wordsOf are the word-RAM width/space predicates, and the time bound is the paper's O((t+w+1)6)O((t+w+1)^{6})O((t+w+1)6) with the explicit constant 200002000020000.

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 Theorems.Thm_LinearSetReconciliation327_Main_pinsketch_syndrome_recovery
import Theorems.Thm_LinearSetReconciliation327_Main_pinsketch_decoder_read
import Theorems.Thm_LinearSetReconciliation327_Main_pinsketch_decoder_key_solver
import Theorems.Thm_LinearSetReconciliation327_Main_pinsketch_decoder_root_search
import Theorems.Thm_LinearSetReconciliation327_Main_pinsketch_decoder_verifier

set_option autoImplicit false

open Finset
Formal statement
theorem LinearSetReconciliation327.Main.pinsketch_decoder_conjunct
    {F : Type} [Field F] [Algebra (ZMod 2) F] {N t w : ℕ}
    (b : Module.Basis (Fin w) (ZMod 2) F) (ι : ℕ → F)
    (hN : 1 ≤ N) (htN : t ≤ N) (h0 : ∀ i < N, ι i ≠ 0) (hinj : Set.InjOn ι (Set.Iio N)) :
    ∃ (W : ℕ) (det : ℕ → ℕ), WidthOK W N 8 (w : ℝ) ∧ wordsOf W (t * w) ≤ 2 ^ W ∧
      ∀ y : Fin (t * w) → ZMod 2, ∃ s',
        HaltsWithin pinsketchDecoderProgram (detEnv W det) (20000 * ((t : ℝ) + w + 1) ^ 6)
          (decoderStart W y []) s' ∧ decoderPost (N := N) b ι y s' := by sorry
Source
arXiv:2611.11409, Section 2.2, Proposition 2.1 (decoding conjunct), and Dodis, Ostrovsky, Reyzin, Smith, Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data, SIAM J. Comput. 38(1), 2008, Section 6.3

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