A complete Lucas-bitmap certificate for 501 even numbers at the four-quintillion cutoff
ProvedGoldbach.lucas_bitmap_segment_near_4e18Every even integer in the closed interval
is a sum of two primes, with the left summand at most 5,569. This is exactly 501 consecutive even cases at the cutoff of the strong-Goldbach mission's finite input. The certificate has 130 dictionary primes, 105 odd left primes at most 1,129, and 253 recursive Lucas certificates including factor-prime ancestors.
The proof uses Mathlib's existing Lucas primality criterion. Every predecessor factor product and every required modular-power condition is proved in Lean; the candidate-prime filter, factor search and witness search are untrusted. A relative bitmap with origin 1,999,999,999,999,996,715 checks all 501 target bits and recovers a prime pair for every even number in the interval.
The checker definitions and soundness proof are included in the submitted
source. The proof therefore imports no newer-environment platform definition
and no open theorem. It is replayed in the strong-Goldbach mission's exact
environment: Lean 4.29.0-rc3 and Mathlib
777aaa61dcd2a1258d2b4962dbe983ede4d23b2e. No native_decide is used.
This certifies only the stated terminal segment. It does not prove the full finite input through four quintillion, any unbounded Goldbach assertion, or the uniform quantitative binary-correlation estimate still required by the root reduction. The contribution tests complete certificate replay at large values in the actual mission environment.
import Mathlib.Data.Nat.Prime.Basic import Mathlib.Algebra.Ring.Parity set_option autoImplicit false
theorem Goldbach.lucas_bitmap_segment_near_4e18 (n : ℕ) (hlo : 3999999999999999000 ≤ n) (hhi : n ≤ 4000000000000000000) (he : Even n) :
∃ p q : ℕ, p.Prime ∧ q.Prime ∧ p ≤ 5569 ∧ n = p + q := by sorry