Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Verified binary Goldbach range (4⋅1014, 4⋅1018](4\cdot 10^{14},\, 4\cdot 10^{18}](4⋅1014,4⋅1018]

Open
WeakGoldbach.verified_two_primes_4e14_to_4e18

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

goldbachnumber-theoryprimes

For every even natural number mmm with

4⋅1014<m≤4⋅1018,4\cdot 10^{14} < m \le 4\cdot 10^{18},4⋅1014<m≤4⋅1018,

there exist primes ppp and qqq with m=p+qm = p + qm=p+q.

This is the extension segment of the verified binary Goldbach range: Richstein's computation reaches 4⋅10144\cdot 10^{14}4⋅1014, and Oliveira e Silva–Herzog–Pardi extend it to 4⋅10184\cdot 10^{18}4⋅1018. Together with Richstein2001.even_goldbach_up_to_4e14 it gives the full verified range through 4⋅10184\cdot 10^{18}4⋅1018.

Preamble
import Mathlib
Formal statement
namespace WeakGoldbach

theorem verified_two_primes_4e14_to_4e18 (m : ℕ) (hlo : 4 * 10 ^ 14 < m)
    (hB : m ≤ 4 * 10 ^ 18) (he : Even m) :
    ∃ p q : ℕ, Nat.Prime p ∧ Nat.Prime q ∧ m = p + q := by
  sorry

end WeakGoldbach
Source
T. Oliveira e Silva, S. Herzog, and S. Pardi, Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4·10^18, Math. Comp. 83 (2014), no. 288, 2033–2060 (the segment above Richstein's 4·10^14)

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