Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix E — in characteristic 2 the even syndromes are squares: s2i(w)=si(w)2s_{2i}(w) = s_i(w)^2s2i​(w)=si​(w)2

Proved
FuzzyExtractors.EditSketch.appendix_E_syn_sq

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

bch-codesfinite-fieldsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1syndrome

Let KKK be a finite field of characteristic 222 and let w⊆K∗w \subseteq K^*w⊆K∗ be the support of a binary word. Write si(w)=∑x∈wxis_i(w) = \sum_{x \in w} x^isi​(w)=∑x∈w​xi for its iii-th power-sum syndrome. Then for every i≥0i \ge 0i≥0

s2i(w)=si(w)2.s_{2i}(w) = s_i(w)^2 .s2i​(w)=si​(w)2.

This is the case q=2q = 2q=2 of the redundancy observed in Appendix E, c(αi)q=c(αiq)c(\alpha^i)^q = c(\alpha^{iq})c(αi)q=c(αiq): since the coefficients of a binary word satisfy cx2=cxc_x^2 = c_xcx2​=cx​ and squaring is additive in characteristic 222, the even-indexed syndromes are determined by the odd-indexed ones. This is why PinSketch (Construction 6) publishes only s1,s3,…,s2t−1s_1, s_3, \dots, s_{2t-1}s1​,s3​,…,s2t−1​.

Formalization Note. The paper states the identity for general qqq and a general word (cx)∈GF(q)n(c_x) \in GF(q)^n(cx​)∈GF(q)n; only the binary case, with the word given by its support, is stated here. The field GF(2μ)GF(2^\mu)GF(2μ) is any finite field of characteristic 222.

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

theorem appendix_E_syn_sq {K : Type} [Field K] [Fintype K] [CharP K 2]
    (w : Finset Kˣ) (i : ℕ) :
    syn (2 * i) w = syn i w ^ 2 := by sorry

end FuzzyExtractors.EditSketch
Source
Dodis, Ostrovsky, Reyzin & Smith, Fuzzy Extractors, arXiv:cs/0602007v4, Appendix E, p. 43 ("we have c(α^i)^q = Σ_{x≠0} c_x^q x^{iq} = c(α^{iq})")
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