Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Construction 6, step 4 — if dis(w,w′)≤t\mathrm{dis}(w, w') \le tdis(w,w′)≤t then supp(v)=w△w′\mathrm{supp}(v) = w \triangle w'supp(v)=w△w′

Proved
FuzzyExtractors.EditSketch.construction_6_step_4

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

bch-codesp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1pinsketchsecure-sketch

Let KKK be a finite field of characteristic 222, t≥0t \ge 0t≥0, and w,w′,v⊆K∗w, w', v \subseteq K^*w,w′,v⊆K∗. Suppose ∣w△w′∣≤t|w \triangle w'| \le t∣w△w′∣≤t, ∣v∣≤t|v| \le t∣v∣≤t, and vvv has the odd syndromes computed in step 2 of PinSketch's recovery:

∑x∈vx2j+1=∑x∈w′x2j+1−∑x∈wx2j+1(0≤j<t).\sum_{x \in v} x^{2j+1} = \sum_{x \in w'} x^{2j+1} - \sum_{x \in w} x^{2j+1} \qquad (0 \le j < t).x∈v∑​x2j+1=x∈w′∑​x2j+1−x∈w∑​x2j+1(0≤j<t).

Then

v=w△w′.v = w \triangle w'.v=w△w′.

This is the correctness claim of step 4 of Construction 6: the set recovered by syndrome decoding is the symmetric difference, so w=w′△vw = w' \triangle vw=w′△v.

Formalization Note. Indices are 0-based: entry jjj is the paper's σ2j+1\sigma_{2j+1}σ2j+1​, for the paper's σ1,σ3,…,σ2t−1\sigma_1, \sigma_3, \dots, \sigma_{2t-1}σ1​,σ3​,…,σ2t−1​. Subtraction is in KKK, where it coincides with addition.

Preamble
import Mathlib
import Definitions.Def_FuzzyExtractors_EditSketch_Basic
Formal statement
namespace FuzzyExtractors.EditSketch

theorem construction_6_step_4 {K : Type} [Field K] [Fintype K] [DecidableEq K]
    [CharP K 2] (t : ℕ) (w w' v : Finset Kˣ) (hdis : symmDiffDis w w' ≤ t) (hv : v.card ≤ t)
    (hsyn : ∀ j : Fin t,
      syn (2 * (j : ℕ) + 1) v = syn (2 * (j : ℕ) + 1) w' - syn (2 * (j : ℕ) + 1) w) :
    v = symmDiff w w' := by sorry

end FuzzyExtractors.EditSketch
Source
Dodis, Ostrovsky, Reyzin & Smith, Fuzzy Extractors, arXiv:cs/0602007v4, Construction 6 (PinSketch), recovery step 4, p. 23
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

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