Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.4 — Fixed linear tests

Proved
GenericGroupWE.Main.lemma_3_4

by mikedeng1 · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

complexity-theorycryptographygeneric-groupsp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Let m>0m>0m>0, let p≥mp\ge mp≥m be prime, and let M1,…,MkM_1,\ldots,M_kM1​,…,Mk​ be linearly independent m×mm\times mm×m matrices over Fp\mathbb F_pFp​. Suppose every nonzero combination has rank at least the real number RRR. Fix coefficients (α,β,γ)∈Fp×Fpm×Fpk(\alpha,\beta,\gamma)\in\mathbb F_p\times\mathbb F_p^m\times\mathbb F_p^k(α,β,γ)∈Fp​×Fpm​×Fpk​ before the random encryption coordinates are sampled. The exact conditional encryption law satisfies

Pr⁡[α[1]+∑iβiXi+∑jγjYj=[0]]≤m−R+p−1\Pr[\alpha[1]+\textstyle\sum_i\beta_iX_i+\sum_j\gamma_jY_j=[0]]\le m^{-R}+p^{-1}Pr[α[1]+∑i​βi​Xi​+∑j​γj​Yj​=[0]]≤m−R+p−1

for every nonzero coefficient vector and either bit. For message one the bound improves to p−1p^{-1}p−1. The zero coefficient vector gives probability one for either bit.

Differences from the source:

  • generalization: a false SAT instance, its rank-gap basis, and a supplied prime p>=2^m → any linearly independent matrix family with the same rank lower bound, and p>=m; reason: the proof uses only rank, basis independence and the distinct residues 1,...,m
  • encoding: finite indexed families, prime-field residues, and an encoded group equality test → Fin-indexed ZMod families and the corresponding scalar equality to zero; reason: zero-based finite carriers preserve the instances, and injectivity of every encoding makes the scalar and group equality events identical, so averaging over the encoding is redundant for this test
Preamble
import Definitions.Def_GenericGroupWE_Main_Scheme
Formal statement
namespace GenericGroupWE.Main
open scoped BigOperators

theorem lemma_3_4 (m : ℕ) (hm : 0 < m) (p : PrimeOrder) (B : MatrixBundle m p)
    (hp : m ≤ p.val)
    (hlin : LinearIndependent (ZMod p.val) B.matrices) (R : ℝ)
    (hrank : ∀ a : Fin B.k → ZMod p.val, B.combination a ≠ 0 →
      R ≤ (B.combination a).rank)
    (α : ZMod p.val) (β : Fin m → ZMod p.val) (γ : Fin B.k → ZMod p.val) :
    ((α = 0 ∧ β = 0 ∧ γ = 0) → ∀ message,
      fixedTestProbability B hm α β γ message = 1) ∧
    ((¬ (α = 0 ∧ β = 0 ∧ γ = 0)) →
      (∀ message, fixedTestProbability B hm α β γ message ≤
        (m : ℝ)^(-R) + (p.val : ℝ)⁻¹) ∧
      fixedTestProbability B hm α β γ true ≤ (p.val : ℝ)⁻¹) := by sorry

end GenericGroupWE.Main
Source
Hair and Sahai, Witness Encryption via Prime-Order Generic Groups, STOC 2027 submission #47 (PDF built 2026-11-02; SHA-256 0b7f14e2db9bb3e199883ab907f854b7b5884c7c9f3d1e4c306bb71e89b659cb), https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/47.pdf, Lemma 3.4, PDF p. 9 (printed p. 8).
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 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