Local prime ladders in the 492700 Helfgott–Platt computation blocks
OpenWeakGoldbach.helfgott_platt_block_laddersPut and . For each integer , there is a finite increasing sequence of primes satisfying
This is the local computational certificate for one of the intervals in the Helfgott–Platt verification. The intervals have exactly the width and count reported in Section 4, and their total length is the target endpoint . The endpoint conditions allow consecutive blocks to be joined without a gap of size .
The theorem is an open certificate obligation. No actual certificate data are supplied here. The source reports mixed Proth-prime and general-prime rungs, with independent Proth and ECPP checks; it does not supply a Lean proof. The strict internal gap is the search condition in Section 3. The strict final margin follows from the reported distance at most , since equality would make the final prime the even integer .
import Mathlib.Data.Nat.Prime.Basic
theorem WeakGoldbach.helfgott_platt_block_ladders (b : ℕ) (hb : b < 492700) :
∃ (k : ℕ) (p : ℕ → ℕ),
(∀ i, i ≤ k → Nat.Prime (p i)) ∧
(b*18014398509481984000000000 < p 0 ∧
p 0 ≤ b*18014398509481984000000000 + 2*10^18) ∧
(∀ i, i < k → p i < p (i+1) ∧ p (i+1) < p i + 4*10^18) ∧
(p k ≤ (b+1)*18014398509481984000000000 ∧
(b+1)*18014398509481984000000000 < p k + 2*10^18) := by sorry