Infinitely many small prime gaps of 180 or less

We show that infinitely many pairs of consecutive primes differ by at most 180, assuming a recently proposed estimate for exponential sums over finite fields. The previous bound under the same hypothesis was 182; the best bound known without it is 186. The improvement comes from a sieve inequality that yields a gap smaller than the diameter of the underlying tuple of shifts. The final inequality holds with a margin of about one part in a million, so the deduction is verified in the Lean 4 proof assistant: Lean checks that four explicitly stated exponential sum bounds, together with an explicit list of numerical inequalities, imply the theorem. Three of the four bounds are results of Deligne type from the literature; the fourth is not yet an established theorem. The numerical inequalities are supported by rigorous interval computations and accompanying error analyses.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-22
DOI
https://doi.org/10.5281/zenodo.24430218
Primary Topic
Analytic Number Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Infinitely many small prime gaps of 180 or less

Theodoros Yianni, Sahibzada Allahyar
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
preprint

Infinitely many small prime gaps of 180 or less

Theodoros Yianni, Sahibzada Allahyar
preprint en

Abstract

We show that infinitely many pairs of consecutive primes differ by at most 180, assuming a recently proposed estimate for exponential sums over finite fields. The previous bound under the same hypothesis was 182; the best bound known without it is 186. The improvement comes from a sieve inequality that yields a gap smaller than the diameter of the underlying tuple of shifts. The final inequality holds with a margin of about one part in a million, so the deduction is verified in the Lean 4 proof assistant: Lean checks that four explicitly stated exponential sum bounds, together with an explicit list of numerical inequalities, imply the theorem. Three of the four bounds are results of Deligne type from the literature; the fourth is not yet an established theorem. The numerical inequalities are supported by rigorous interval computations and accompanying error analyses.

Zenodo (CERN European Organization for Nuclear Research)
Royal Holloway University of London (GB)
Analytic Number Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon