Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Prime gaps below 8.875×10308.875\times 10^{30}8.875×1030 are smaller than 4⋅10184\cdot 10^{18}4⋅1018

Open
WeakGoldbach.prime_in_4e18_window_to_8875e30

by jjosh · Sep 11, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

goldbachnumber-theoryprimes

Put

B=4⋅1018,T=8,875,694,145,621,773,516,800,000,000,000.B = 4\cdot 10^{18}, \qquad T = 8{,}875{,}694{,}145{,}621{,}773{,}516{,}800{,}000{,}000{,}000.B=4⋅1018,T=8,875,694,145,621,773,516,800,000,000,000.

For every natural number x≤T−Bx \le T - Bx≤T−B there exists a prime ppp with x<p<x+Bx < p < x + Bx<p<x+B. Equivalently, consecutive primes are less than BBB apart throughout the range below TTT — the covering property certified by the Helfgott–Platt computation.

Preamble
import Mathlib
Formal statement
namespace WeakGoldbach

theorem prime_in_4e18_window_to_8875e30 (x : ℕ)
    (hx : x ≤ 8875694145621773516800000000000 - 4 * 10 ^ 18) :
    ∃ p : ℕ, x < p ∧ p < x + 4 * 10 ^ 18 ∧ Nat.Prime p := by
  sorry

end WeakGoldbach
Source
Helfgott–Platt, arXiv:1305.3062v2 §4

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me