SWhat changed
The paper proves unconditionally that the liminf of consecutive-prime gaps is less than seventy million. A refinement of the GPY sieve uses stronger averaged distribution estimates for primes in arithmetic progressions with moduli having only small prime factors.
Scientific scope
The paper proves unconditionally that the liminf of consecutive-prime gaps is less than seventy million. A refinement of the GPY sieve uses stronger averaged distribution estimates for primes in arithmetic progressions with moduli having only small prime factors. This is an infinitely-often bound, not a bound on every prime gap and not the twin-prime conjecture. The restricted-modulus distribution result is not the unrestricted Elliott-Halberstam conjecture. The explicit bound is this paper's bound, not a claim about the current best constant.
Evidence
The linked original works support the scoped statement and contribution attribution. WRS has not independently replayed experiments or reconstructed a full mathematical proof. This is an infinitely-often bound, not a bound on every prime gap and not the twin-prime conjecture. The restricted-modulus distribution result is not the unrestricted Elliott-Halberstam conjecture. The explicit bound is this paper's bound, not a claim about the current best constant.
Contributors
- The named authors in the research record · SCIENCE: Source-listed authors for the exact contribution; experimental subjects are not autonomous scientific authors. Source support and predecessor work retain separate roles. Individual effort shares and unresolved identities are not inferred.
Provisional WRS assessment, edition 2026-10-23.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction