Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The same statement in the form actually used by an attacker: on those

Proved
SingularModuli.precomputed_table_returns_one

by raver1975 · Sep 17, 2026 · Mathlib c5ea003 (Lean v4.30.0)

aether-catalogcryptography

The same statement in the form actually used by an attacker: on those semiprimes every table entry returns the useless value 1 (when H does not vanish at the entry).

theorem SingularModuli.precomputed_table_returns_one(H : Polynomial ℤ) (T : Finset ℤ) (M : ℕ)
    (hT : ∀ t ∈ T, H.eval t ≠ 0) :
    ∃ p q : ℕ, p.Prime ∧ q.Prime ∧ p ≠ q ∧ M < p ∧ M < q ∧
      ∀ t ∈ T, evalGcd H t (p * q) = 1 := by sorry

Formalization Note Transplanted verbatim from the Aether Catalog source Cryptography/SingularModuli/PrecomputationBarrier.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.

Preamble
-- Thm stub generated from Cryptography/SingularModuli/PrecomputationBarrier.lean
import Mathlib
import Definitions.Def_Cryptography_SingularModuli_GcdCriterion
import Definitions.Def_Cryptography_SingularModuli_PrecomputationBarrier
import Definitions.Def_Cryptography_SingularModuli_RootCount

/-!
# Singular Moduli Factoring, Step 7: the circularity bottleneck, made a theorem

The useful evaluation points for `H_D` are the roots of `H_D` mod `p` — a set
*defined in terms of the unknown factor* `p`.  The natural way to try to escape
the `√N` search is precomputation: fix once and for all a table `T` of
evaluation points (and a family of discriminants), and hope that some entry of
the table hits a root modulo one of the factors of whatever `N` arrives.

This file proves that this is impossible, in the strongest form:

* `card_catchable_le_sum_log` — a table of `k` evaluation points can ever be
  useful for at most `∑_{t ∈ T} log₂ |H(t)|` primes.  That is a bound depending
  only on the *bit size of the table*, not on `N`;
* `infinite_uncaught_primes` — hence infinitely many primes are invisible to any
  fixed table;
* `precomputed_table_fails` — for every fixed table `T` and every bound `M`
  there are distinct primes `p, q > M` such that **every** entry of the table
  returns `gcd = 1` on `N = pq`: the precomputed attack learns nothing at all;
* `finite_family_table_fails` — the same for a finite family of discriminants
  used simultaneously.

Interpretation: the structured set cannot be enumerated in advance, only
searched, and `SqrtBarrier.lean` prices that search at `√N/(4h)`.  This is the
formal content of "barrier 6" for singular moduli factoring.
-/

open SingularModuli

open Polynomial Finset FactoringBarriers

/-! ## A table catches only logarithmically many primes -/






/-! ## No precomputed table factors anything -/
Formal statement
theorem SingularModuli.precomputed_table_returns_one(H : Polynomial ℤ) (T : Finset ℤ) (M : ℕ)
    (hT : ∀ t ∈ T, H.eval t ≠ 0) :
    ∃ p q : ℕ, p.Prime ∧ q.Prime ∧ p ≠ q ∧ M < p ∧ M < q ∧
      ∀ t ∈ T, evalGcd H t (p * q) = 1 := by sorry
Source
https://github.com/paulklemstine/Lean/blob/53c2925a02/Catalog/Cryptography/SingularModuli/PrecomputationBarrier.lean#L132

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