Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.6 — the fixed-verifier system is a gap reduction to block-sparse linear systems

Proved
LatticePrepro.FixedSystem.isGapReduction

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. Let:

  • VVV be a quadratic verifier over Fp\mathbb{F}_pFp​ with instance length nnn, SSS assignment coordinates and language L(V)⊆{0,1}nL(V)\subseteq\{0,1\}^nL(V)⊆{0,1}n;
  • RRR be a moment representation over KKK, with moment parameter rrr, DDD blocks per evaluation table and block size bbb, whose soundness produces coefficient functions on Ω\OmegaΩ;
  • E0=0,E1,…,ES∈KE_0=0,E_1,\dots,E_S\in KE0​=0,E1​,…,ES​∈K be an encoding tuple (E1,…,ESE_1,\dots,E_SE1​,…,ES​ linearly independent over Fp\mathbb{F}_pFp​).

Let Av=bxAv=b_xAv=bx​ be the fixed-verifier system of Construction 4.5. It has NNN evaluation tables, N⋅DN\cdot DN⋅D blocks of size bbb, and the matrix AAA does not depend on xxx. Let g∈Ng\in\mathbb{N}g∈N satisfy

2 g N<r.2\,g\,N<r.2gN<r.

Then:

  1. Completeness. For every x∈L(V)x\in L(V)x∈L(V) there is a binary vector vvv with Av=bxAv=b_xAv=bx​ and at most one nonzero coordinate in each block.
  2. Soundness. For every x∉L(V)x\notin L(V)x∈/L(V), every vvv over Fp\mathbb{F}_pFp​ with Av=bxAv=b_xAv=bx​ has Hamming weight wt⁡(v)>g⋅N⋅D\operatorname{wt}(v)>g\cdot N\cdot Dwt(v)>g⋅N⋅D.

So x↦bxx\mapsto b_xx↦bx​ reduces L(V)L(V)L(V) to the block-sparse linear-system problem with gap ggg (Definition 3.10).

This is Theorem 4.6 of the paper; in its notation, N,g,r,DN,g,r,DN,g,r,D are σ,Γ,κ,Dtab\sigma,\Gamma,\kappa,D_{\mathrm{tab}}σ,Γ,κ,Dtab​. Theorem 4.8 applies it with the explicit moment representation of Appendix A.

Formalization Note The conclusion is (fixedSystem V R ε).IsGapReduction V.Language g, where ε is the encoding tuple and NNN is Fintype.card V.TblIdx. The paper also assumes g≥1g\ge1g≥1 and g<bg<bg<b, which make the target a (N⋅D,b,g)(N\cdot D,b,g)(N⋅D,b,g)-BSLSP instance in the sense of Definition 3.10; the Lean statement does not need them. KKK is not required to be finite. The time bound of the paper is not formalized. The verifier is given by quadratic gate equations rather than a Boolean circuit (compare Claim 3.15).

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.isGapReduction {g : ℕ} (hg : 2 * g * Fintype.card V.TblIdx < R.r) :
    (fixedSystem V R ε).IsGapReduction V.Language g := 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}); Lean: LatticePrepro/Reduction/Soundness.lean, LatticePrepro.FixedSystem.isGapReduction
Human review
  • Endorsed by Shuze Chen · Nov 15, 2026

    Confirmed by the moderator at approval.

  • Endorsed by WizardOfMenlo · Nov 15, 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