HackerPapers

arXiv:2608.31126math.NT

Bounded gaps between primes

Julia Stadlmann

Abstract

Polymath8b proved that $H_1 = \liminf (p_{n+1}-p_n) \leq 246$. In this paper we show how the Bombieri-Vinogradov theorem can be combined with newer equidistribution estimates for smooth moduli to obtain the improved bound $H_1 \leq 240$.

arXiv comments
Journal reference
DOI
Subjects
math.NTNumber Theory

On Hacker News

Linked by 3 identifiable commenters in 3 comments across 3 threads, from Sep 2026 to Sep 2026. Found in 1 HN submission from Sep 2026 to Sep 2026. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments3 threads

    • Reminds me, kinda, to when Astra was launched and OpenAI announced an improvement to the bounded prime gap. Which BTW, Prof. Julia Stadlmann had published an independent result only a few days earlier Stadlmann improved it from 246 to 240, OpenAI later claimed 186 I think? Maybe…

      ggcrView on HNParent context

  1. Prime Gaps at Most 186 1 comment
    • Context - according to Wikipedia [0], just a few days ago someone posted a proof of a bound of 240 [1]. [0] https://en.wikipedia.org/wiki/Twin_prime [1] https://arxiv.org/abs/2608.31126

      ks2048View on HNParent context

  2. GPT-6 Astra 1 comment
    • Just two days ago, a preprint by Julia Stadlmann went up on arXiv [0] improving the prime gap from 246 to 240. Now OpenAI announces Astra has shown a gap of 186 [1]. That must really blow. [0] https://arxiv.org/abs/2608.31126 [1]…

      Cu3PO42View on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.