Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

A prime in (x, x+4⋅1018)(x,\,x+4\cdot 10^{18})(x,x+4⋅1018) for 1026≤x≤T−4⋅101810^{26} \le x \le T - 4\cdot 10^{18}1026≤x≤T−4⋅1018

Open
WeakGoldbach.prime_in_4e18_window_1e26_to_8875e30

by jjosh · Sep 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

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 xxx with 1026≤x≤T−B10^{26} \le x \le T - B1026≤x≤T−B there exists a prime ppp with x<p<x+Bx < p < x + Bx<p<x+B.

This is the segment of the window-covering claim beyond the reach of the x/(2.8⋅107)x/(2.8\cdot 10^{7})x/(2.8⋅107) short-interval bound, so it is the part that specifically requires the Helfgott–Platt prime-ladder computation up to TTT.

Formalization Note Combined with the elementary segment x≤Bx \le Bx≤B (Bertrand) and the middle segment B≤x≤1026B \le x \le 10^{26}B≤x≤1026 (short-interval gaps), this completes the cover of x≤T−Bx \le T - Bx≤T−B.

Preamble
import Mathlib
Formal statement
namespace WeakGoldbach

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

end WeakGoldbach
Source
H. A. Helfgott and D. J. Platt, Numerical verification of the ternary Goldbach conjecture up to 8.875e30, 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