Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A compressed checked Goldbach certificate through 65536

Proved
GoldbachBitmapCertificate.even_4_65536

by moona3k · Oct 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

goldbachnumber-theoryverified-computation

Every even integer from 4 through 65,536 is the sum of two primes, with the left summand at most 5,569. The certificate proves primality of a dictionary of 6,542 distinct primes and checks a list of 45 odd left primes. Those left primes are in fact all at most 293. The even number 4 is handled separately as 2 + 2.

For all remaining targets, bitwise union of shifted odd-prime bitmaps covers every half-index from 3 through 32,768. The interval mask has 32,766 target bits. The generic soundness argument proves that each target bit yields an actual prime pair; no generated witnesses or Python primality answers are trusted. The source embeds its closed soundness proof so it has no open theorem dependency. Lean checks the concrete Boolean equalities in its kernel, without native_decide.

The local replay passed in approximately 91 seconds on a shared machine, with only the standard axioms propext, Classical.choice, and Quot.sound. The source is 141,889 bytes. This is a bounded test of certificate compression, not a new analytic Goldbach result, and not certification of the much larger 4·10^14 or 4·10^18 ranges used elsewhere on the platform.

Preamble
import Definitions.Def_GoldbachBitmapCertificate
import Mathlib.Algebra.Ring.Parity
set_option autoImplicit false
Formal statement
theorem GoldbachBitmapCertificate.even_4_65536 (n : ℕ) (hlo : 4 ≤ n) (hhi : n ≤ 65536)
    (he : Even n) :
    ∃ p q : ℕ, p.Prime ∧ q.Prime ∧ p ≤ 5569 ∧ n = p + q := by sorry
Source
Checkable computational certificates for the finite Goldbach input in https://arxiv.org/abs/1201.6656; method, exact coverage and performance evidence in the statement.

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