Proved
Historical bounds recorded in the paper ↗
Zhang, Maynard and Stadlmann bounded-gap results.
Observed Oct 13, 2026
Replaces an earlier source assessment. Version history ↓
Bound · version 2
Gaps at most 70,000,000, infinitely often
Earlier version 2. View current version 3 →
Statement
For every real X, there are consecutive primes p < q with p ≥ X and q − p ≤ 70000000; in other words .
Assumptions
- Consecutive positive primes.
- No additional conjectural hypothesis in the cited mathematical result.
Scope
An unconditional upper bound on the recurring gap, attributed to Zhang; it does not imply every gap is this small.
Explanation
Bounds & computations · 1
Compare the quantity and hypotheses within each group. A finite check, conditional theorem and proposed improvement cover different scopes.
| Result | Value | Conditions |
|---|---|---|
| Gaps at most 70,000,000, infinitely often → Proved Selected source date: | ≤ 70,000,000 | Unconditional bound for gaps between consecutive primes occurring infinitely often. |
Evidence
Source reports
Connections
In this problem · publication v3 · Selected context
How small can prime gaps be? →
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.
In this problem · publication v6
How small can prime gaps be? →
Bound · Proved
Scope: Zhang established the first finite recurring-gap bound in 2013.
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.
Sources
A new bound for small gaps between primes →
- Theorem 1.1; introduction’s prior bounds; Appendix A, Formal certificate by AxiomProver → · Original passage ↗
Recorded wording
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.
Revision & attribution
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.
History
Statement versions
Statement versions and problem publication versions are separate. A new publication can update context or sources while retaining the same statement.
Assessment history · 1
Assessments retained in these publication records. Earlier statement versions retain their own source histories.
Proved
Historical bounds recorded in the paper ↗
Zhang, Maynard and Stadlmann bounded-gap results.
Observed Oct 13, 2026 · Source passage →
Replaces an earlier source assessment; see the original source for its history.
Record details
- Claim ID
- claim-prime-gaps-bound-70000000
- Statement version
- 2
- SHA-256
- 494a322e208f39b2ecf3d2c16c195886b4a38c7a88b2626c21bdcad222d0819c