Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Local prime ladders in the 492700 Helfgott–Platt computation blocks

Open
WeakGoldbach.helfgott_platt_block_ladders

by suzukasan · Oct 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

finite-certificatesgoldbachnumber-theoryprimes

Put H=2⋅1018H=2\cdot10^{18}H=2⋅1018 and W=254109=18014398509481984000000000W=2^{54}10^9=18014398509481984000000000W=254109=18014398509481984000000000. For each integer 0≤b<4927000\le b<4927000≤b<492700, there is a finite increasing sequence of primes p0,…,pkp_0,\ldots,p_kp0​,…,pk​ satisfying

bW<p0≤bW+H,pi<pi+1<pi+2H(0≤i<k),bW<p_0\le bW+H,\qquad p_i<p_{i+1}<p_i+2H\quad(0\le i<k),bW<p0​≤bW+H,pi​<pi+1​<pi​+2H(0≤i<k), pk≤(b+1)W<pk+H.p_k\le(b+1)W<p_k+H.pk​≤(b+1)W<pk​+H.

This is the local computational certificate for one of the intervals in the Helfgott–Platt verification. The intervals have exactly the width and count reported in Section 4, and their total length is the target endpoint TTT. The endpoint conditions allow consecutive blocks to be joined without a gap of size 2H2H2H.

The theorem is an open certificate obligation. No actual certificate data are supplied here. The source reports mixed Proth-prime and general-prime rungs, with independent Proth and ECPP checks; it does not supply a Lean proof. The strict internal gap is the search condition in Section 3. The strict final margin follows from the reported distance at most HHH, since equality would make the final prime the even integer (b+1)W−H>2(b+1)W-H>2(b+1)W−H>2.

Preamble
import Mathlib.Data.Nat.Prime.Basic
Formal statement
theorem WeakGoldbach.helfgott_platt_block_ladders (b : ℕ) (hb : b < 492700) :
    ∃ (k : ℕ) (p : ℕ → ℕ),
      (∀ i, i ≤ k → Nat.Prime (p i)) ∧
      (b*18014398509481984000000000 < p 0 ∧
        p 0 ≤ b*18014398509481984000000000 + 2*10^18) ∧
      (∀ i, i < k → p i < p (i+1) ∧ p (i+1) < p i + 4*10^18) ∧
      (p k ≤ (b+1)*18014398509481984000000000 ∧
        (b+1)*18014398509481984000000000 < p k + 2*10^18) := by sorry
Source
H. A. Helfgott and D. J. Platt, Numerical Verification of the Ternary Goldbach Conjecture up to 8.875e30, arXiv:1305.3062v2, Section 3 (prime ladder algorithm, pp. 2) and Section 4 (width 2^54*10^9, endpoint distances 2*10^18, and 492700 intervals, p. 3). https://arxiv.org/pdf/1305.3062. This theorem isolates the reported local computations as an unproved certificate obligation; it does not claim to reproduce or verify the missing data.

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