| $3.8075$ | [Sta25] | Stadlmann: $H\_m = O(\exp(3.8075\,m))$, deduced from an exponent of distribution $\tfrac12 + \tfrac1{40}$ for the primes in arithmetic progressions to smooth moduli, improving Polymath's $\tfrac12 + \tfrac7{300}$. The new ingredient is a modification of the $q$-van der Corput process. |tracked since 2026-09-02 — no movement seen yet
Lower bound, last-listed row
| $0$ | Trivial | No positive lower bound is known, and none is expected: see below. |tracked since 2026-09-02 — no movement seen yet
Cite this rowBounds Ledger — Exponent for bounded gaps between many primes (88b)
upper bound: $3.8075$ (tracked since 2026-09-02 — no movement seen yet)
lower bound: $0$ (tracked since 2026-09-02 — no movement seen yet)
Mirrored from teorth/optimizationproblems@2c1968c. These are the last-listed rows of that constant's bounds table — a listing position, not a statement that this bound is the strongest or most recent. A snapshot at that sha, not a live read.
https://u00dxk2.github.io/bounds-ledger/c/88b.html