Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.6 (soundness, weight form) — a solution below the weight threshold certifies membership

Proved
LatticePrepro.FixedSystem.mem_language_of_solves

by WizardOfMenlo · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

coding-theorycvp-ncp-preprocessinghardness-of-approximationlatticespreprocessing

Let ppp be a prime, KKK a field that is an Fp\mathbb{F}_pFp​-algebra, and Ω\OmegaΩ an extension field of KKK. Elements of Fp\mathbb{F}_pFp​ and KKK are viewed in Ω\OmegaΩ through the algebra maps. Consider the fixed-verifier system Av=bxAv=b_xAv=bx​ of Construction 4.5 for a quadratic verifier VVV with language L(V)⊆{0,1}nL(V)\subseteq\{0,1\}^nL(V)⊆{0,1}n, a moment representation RRR over KKK (moment parameter rrr, DDD blocks per evaluation table, coefficient functions on Ω\OmegaΩ), and an encoding tuple. Let x∈{0,1}nx\in\{0,1\}^nx∈{0,1}n and let v∈FpColv\in\mathbb{F}_p^{\mathrm{Col}}v∈FpCol​ satisfy all equations of the system for xxx. If

2 wt⁡(v)<r⋅D,2\,\operatorname{wt}(v)<r\cdot D,2wt(v)<r⋅D,

then x∈L(V)x\in L(V)x∈L(V). Here wt⁡\operatorname{wt}wt is the Hamming weight.

This is the core of the soundness part of Theorem 4.6. The paper's proof assumes a solution of weight below rD/2rD/2rD/2 (in its notation κDtab/2\kappa D_{\mathrm{tab}}/2κDtab​/2) and exhibits an accepting computation on xxx. Theorem 4.6 follows: if 2gN<r2gN<r2gN<r for the number NNN of tables, then every solution of weight at most g⋅N⋅Dg\cdot N\cdot Dg⋅N⋅D is below the threshold.

Formalization Note "vvv satisfies the equations" is the predicate Solves V R ε x v, which is equivalent to Av=bxAv=b_xAv=bx​ for the linear map of fixedSystem. DDD is R.numBlocks, the number of blocks of a single table, not of the whole system.

Preamble
import Mathlib
import Definitions.Def_LatticePrepro_Basic_Blocks
import Definitions.Def_LatticePrepro_Reduction_LinearSystem
import Definitions.Def_LatticePrepro_Moments_Basic
import Definitions.Def_LatticePrepro_Moments_Representation
import Definitions.Def_LatticePrepro_Verifier_Quadratic
import Definitions.Def_LatticePrepro_Reduction_FixedSystem

open LatticePrepro
open Finsupp
open LatticePrepro.FixedSystem
variable {p : ℕ} [Fact p.Prime] {K : Type} [Field K] [Algebra (ZMod p) K]
    {Ω : Type} [Field Ω] [Algebra (ZMod p) Ω] [Algebra K Ω] [IsScalarTower (ZMod p) K Ω]
    (V : QuadraticVerifier p) (R : MomentRepresentation p K Ω) (ε : EncodingTuple p K V.S)
Formal statement
theorem LatticePrepro.FixedSystem.mem_language_of_solves {x : Fin V.n → Bool} {v : Col V R → ZMod p}
    (hv : Solves V R ε x v) (hw : 2 * hammingNorm v < R.r * R.numBlocks) : x ∈ V.Language := by sorry
Source
G. Fenzi, G. Weissenberg, Nearly Optimal Hardness for CVP and NCP with Preprocessing (STOC 2027 submission #847; IACR ePrint 2026/2634, https://eprint.iacr.org/2026/2634), Theorem 4.6 (\label{thm:fixed-verifier-reduction}), soundness part (weight form); Lean: LatticePrepro/Reduction/Soundness.lean, LatticePrepro.FixedSystem.mem_language_of_solves

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