A complete Lucas-bitmap Goldbach certificate for 501 even numbers at the 4e14 cutoff
ProvedGoldbachBitmapCertificate.lucas_segment_near_4e14Every even integer in the closed interval
is a sum of two primes, with the left summand at most 5,569. There are exactly 501 target even numbers. The certificate uses 110 dictionary primes and 76 odd left primes, which are actually all at most 827.
Primality of the dictionary entries is proved using 254 recursively generated Lucas certificates, including the needed prime factors of each predecessor. Each factor-list product is checked in the Lean kernel. Mathlib's fast modular-arithmetic tactic produces kernel-checked proofs of the Lucas power conditions. The candidate-prime filter, factor search, witness search and Python modular answers are all untrusted; only the resulting Lean proofs establish primality. The method uses Mathlib's existing Lucas theorem.
The right-prime bitmap is based at the half-index 199,999,999,996,715. The target
mask begins at relative index 2,785 and contains 501 bits. This nonzero origin
keeps bitmap size proportional to the segment width and permitted left-prime
range, rather than to the absolute numerical cutoff. The general bitmap
soundness proof is embedded in the submitted source, so no open theorem is
assumed. All target bits and all left-prime conditions are checked, without
native_decide.
This is a complete proof for the stated segment and a feasibility test at the
five-primes mission's cutoff. It does not certify the remaining even integers
up to that cutoff, the larger 4·10^18 finite input, or strong Goldbach.
import Definitions.Def_GoldbachBitmapCertificate import Mathlib.Algebra.Ring.Parity set_option autoImplicit false
theorem GoldbachBitmapCertificate.lucas_segment_near_4e14 (n : ℕ) (hlo : 399999999999000 ≤ n) (hhi : n ≤ 400000000000000) (he : Even n) :
∃ p q : ℕ, p.Prime ∧ q.Prime ∧ p ≤ 5569 ∧ n = p + q := by sorry