The published Polymath8b argument establishes an unconditional recurring prime gap at most 246; the twin-prime target remains out of reach.
Peer-reviewed historical result.
The exact passages cited in OpenMath. Each passage identifies how its wording was recorded.
The published Polymath8b argument establishes an unconditional recurring prime gap at most 246; the twin-prime target remains out of reach.
Passage ID: prime-gaps:entry:polymath:v1
Source item: polymath
Source record: prime-gaps:source:polymath:v1
Explicit citations in versioned problem publications. A citation records a use; it does not confer proof or independent verification.
Problem publication v7
Source assessment
Open
Twin primes remain unresolved
H₁ = 2 remains unresolved despite finite upper bounds.
Observed Oct 13, 2026
Source assessment
Proved
Unconditional H₁ ≤ 246
Published Polymath8b bound.
Observed Oct 13, 2026
Source assessment
Partly resolved
Bounded gaps established; twin primes remain unresolved
H₁ = 2 remains unresolved despite finite upper bounds.
Observed Oct 13, 2026
Further reading
Read the setting and notation before comparing the results.
Recorded authorship
D. H. J. Polymath
No AI contribution is asserted by this source record.
OpenMath source records preserve exact citations. Observation dates order these records; they do not establish the latest upstream paper or proof.
Variants of the Selberg sieve, and bounded intervals containing many primes
OpenMath supplies original paraphrases and links; no proof text is republished.
Source terms ↗