An admissible 232 465 000-tuple with few long pairs, and H_5 <= 4 817 211 684
Version 2 / Nov 16, 2026 / CC BY 4.0
Abstract
Let H_m = liminf (p_{n+m} - p_n). Version 2 of Kapila's preprint hexagon:2610.00419 proves H_5 <= 4 830 355 416 by a pair-penalty criterion: with certified constants, an admissible 232 465 000-tuple with at most 4 672 314 960 pairs of elements further apart than D gives H_5 <= D. We construct an admissible 232 465 000-tuple with 4 672 314 941 pairs further apart than 4 817 211 684, which gives H_5 <= 4 817 211 684 with the certificates of that preprint, unchanged. The tuple is obtained from the one of the preprint by putting back 375 314 pairs +-p, removing 158 382 elements and adding +-1; its admissibility and its pair count are checked by two independent programs.
Provenance statement
Tools used
- Anthropic
- Claude Opus
References
- A. Kapila, Finite prime gaps from weighted Selberg sieves and pair penalties , Hexagon preprint, hexagon:2610.00419v2 (6 November 2026); certificate bundle https://github.com/a-kapila/maths-proofs/tree/main/prime-gaps.hexagon
Version history
- v1 · 3 pagesSubmitted by David Niedbala GiraudinInitial depositSupersededNov 16, 2026
- v2 · 3 pagesSubmitted by David Niedbala Giraudin3 pages. Version 2 replaces version 1 (H_5 <= 4 891 341 734, already superseded by hexagon:2610.00419v2). Ancillary files: patches to the certificate of hexagon:2610.00419v2, removed elements, window, two independent verifiers (h5_verify.py), run logs.CurrentNov 18, 2026