Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Construction 4.5 — the fixed-verifier system has at most (S+1)2(S+1)^2(S+1)2 evaluation tables

Proved
LatticePrepro.QuadraticVerifier.card_tblIdx_le

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

coding-theorycvp-ncp-preprocessinghardness-of-approximationlatticespreprocessing

Let VVV be a quadratic verifier (over any Fp\mathbb{F}_pFp​) with instance length nnn and SSS assignment coordinates. The evaluation tables of the fixed-verifier system are indexed by

  • the product indices: pairs (i,j)(i,j)(i,j) with 0≤j<i≤S0\le j<i\le S0≤j<i≤S, together with (0,0)(0,0)(0,0);
  • the auxiliary indices: iii with n+1<i≤Sn+1<i\le Sn+1<i≤S.

Their number N=∣TblIdx∣N=|\mathrm{TblIdx}|N=∣TblIdx∣ satisfies

N≤(S+1)2.N\le(S+1)^2.N≤(S+1)2.

In Construction 4.5 the paper counts 1+(S+12)+(S−n−1)1+\binom{S+1}{2}+(S-n-1)1+(2S+1​)+(S−n−1) evaluation tables and records the bound (S+1)2(S+1)^2(S+1)2. The bound is used in Theorem 4.8 to choose the moment parameter so that the hypothesis 2gN<r2gN<r2gN<r of Theorem 4.6 holds. It also bounds the number of columns.

Formalization Note TblIdx is the sum type ProdIdx ⊕ AuxIdx of subtypes of {0,…,S}2\{0,\dots,S\}^2{0,…,S}2 and {0,…,S}\{0,\dots,S\}{0,…,S} (as Fin (S + 1)), and NNN is its Fintype.card.

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 LatticePrepro.QuadraticVerifier
variable {p : ℕ} (V : QuadraticVerifier p)
Formal statement
theorem LatticePrepro.QuadraticVerifier.card_tblIdx_le : Fintype.card V.TblIdx ≤ (V.S + 1) ^ 2 := 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), Construction 4.5 (\label{con:fixed-verifier}), bound on the number of evaluation tables; Lean: LatticePrepro/Reduction/FixedSystem.lean, LatticePrepro.QuadraticVerifier.card_tblIdx_le

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