Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6.1 — Polylogarithmic rank gap for supplied primes

Proved
GenericGroupWE.Main.theorem_6_1

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

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

For every c>0c>0c>0, there is a deterministic polynomial-time witness-preserving rank reduction. From a Boolean circuit φ\varphiφ it first computes a matrix order mmm, independently of the prime. Given any supplied prime p≥2mp\ge2^mp≥2m, it returns an ordered linearly independent basis M1,…,MkM_1,\ldots,M_kM1​,…,Mk​ of a matrix space over Fp\mathbb F_pFp​. Every satisfying witness efficiently yields coefficients and factors with

∑jajMj=uvT≠0,v∈{0,1}m.\sum_j a_jM_j=uv^T\ne0,\qquad v\in\{0,1\}^m.j∑​aj​Mj​=uvT=0,v∈{0,1}m.

If φ\varphiφ is unsatisfiable, every nonzero basis combination has rank at least (log⁡2m)c(\log_2m)^c(log2​m)c. Order, basis and conversion have polynomial Turing bounds in the encoded instance and log⁡p\log plogp, with exponents permitted to depend on ccc. In addition ∣φ∣≤m|\varphi|\le m∣φ∣≤m.

Differences from the source:

  • generalization: Theorem 6.1 states m=poly(|phi|) → the conclusion also includes |phi|<=m; reason: the proof pads N to at least the encoded input length and equation (33) gives m>N, as required in §7
  • generalization: ordinary acyclic Boolean circuit instances → the published raw circuit evaluator, with missing or forward references reading zero; reason: ordinary circuits are included; total evaluation is still compiled gate by gate without any fan-out restriction
  • encoding: polynomial-time algorithms on encoded data → a single CookLevin polynomial-step implementation for each length-faithful encoded map; reason: the time predicate bounds actual Turing steps; clocks also bound rounds and state length
  • encoding: the basis map is specified for primes p>=2^m, witness conversion for satisfying witnesses, and m=poly(|phi|) → total order, basis and witness maps with unary order output, unconstrained outside those promises except for being well-formed bundles and certificates; reason: an implementation can test the promise in polynomial time and return the empty basis or the zero certificate otherwise, so no source instance changes; unary output of a polynomial-time map is exactly m=poly(|phi|)
Preamble
import Definitions.Def_GenericGroupWE_Main_Reductions
Formal statement
namespace GenericGroupWE.Main

theorem theorem_6_1 :
    ∀ c : ℝ, 0 < c → ∃ r : RankReduction MIPRE.SAT.Circuit,
      r.PolyTime circuitBits ∧
      ∀ C : MIPRE.SAT.Circuit, (circuitBits C).length ≤ r.order C ∧
        ∀ p : PrimeOrder, 2^(r.order C) ≤ p.val →
          LinearIndependent (ZMod p.val) (r.basis C p).matrices ∧
          (∀ w : Bits, SatisfiesCircuit C w → (r.witness C p w).Valid) ∧
          ((¬ ∃ w : Bits, SatisfiesCircuit C w) →
            ∀ a : Fin (r.basis C p).k → ZMod p.val,
              (r.basis C p).combination a ≠ 0 →
              (Real.logb 2 (r.order C : ℝ))^c ≤ ((r.basis C p).combination a).rank) := 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, Theorem 6.1, PDF p. 24 (printed p. 23).
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