Proved
Historical bounds recorded in the paper ↗
Zhang, Maynard and Stadlmann bounded-gap results.
Observed Oct 13, 2026
Bound · version 1
Earlier version 1. View current version 3 →
For every real X, there are consecutive primes p < q with p ≥ X and q − p ≤ 70000000; in other words H₁ ≤ 70000000.
An unconditional upper bound on the recurring gap, attributed to Zhang; it does not imply every gap is this small.
Proved
Zhang, Maynard and Stadlmann bounded-gap results.
Observed Oct 13, 2026
In this problem · publication v1 · Selected context
Bound · Proved
Scope: The cited mathematical result bounds recurring consecutive-prime gaps by 70,000,000.
Limit: The target H₁ = 2 is not established.
No overlap is counted as an additional resolved part.
Relationship not independently reviewed. This concerns its use in this problem.
The preliminary draft states H₁ ≤ 212 and explains the analytic and exact rational calculations. Its appendix reports a formal deduction with analytic and variational hypotheses.
paraphrase · OpenMath supplies original paraphrases and links; no proof text is republished.
François Charton · Letong Hong · Kenny Lau · Ken Ono · Guillaume Remy · Ho Chung Siu · Ashvin A. Swaminathan · Jesse Thorner · Yunzhou Xie · Preprint · Publication date Sep 3, 2026
Public manuscript or exposition; publication does not imply independent OpenMath review.
Source revision: 2026-09-03. Observed Oct 13, 2026.
The nine authors supply the mathematics, building on Julia Stadlmann and earlier sieve work. AxiomProver is credited with generating a formal deduction; this is not a claim that the model independently discovered the mathematical bound.
Source updated Sep 3, 2026.
Statement versions and problem publication versions are separate. A new publication can update context or sources while retaining the same statement.
Assessments retained in these publication records. Earlier statement versions retain their own source histories.
Proved
Zhang, Maynard and Stadlmann bounded-gap results.
Observed Oct 13, 2026 · Source passage →