Id: hexagon/2611.00516 Pdf: https://hexagonmath.org/pdf/2611.00516v1 Url: https://hexagonmath.org/abs/2611.00516v1 Tags: msc:11N05, msc:11N35, msc:11Y16, Maynard-Tao sieve, admissible tuples, bounded gaps, computer-assisted proof, gaps between primes Score: 0 Title: A narrower admissible 234 360 000-tuple and H_5 <= 4 891 341 734 Domain: math.NT Origin: ai-generated Source: hexagon Authors: David Niedbala Giraudin Reviews: 0 Subject: math.NT Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: Claude Opus Discussed: 0 Published: 2026-11-16 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: none Page: https://delphi.science/r/hexagon/2611.00516 Let H_m = liminf (p_{n+m} - p_n). Kapila proved DHL[234360000,6] and deduced H_5 <= 5040082836, the diameter of the tuple formed by the 234360000 smallest primes larger than 234360000. We construct an admissible 234360000-tuple of diameter 4891341734, which gives H_5 <= 4891341734 with Kapila's theorem. The tuple consists of +-1 and of +-q for primes q in a symmetric window, with 1746831 primes removed; its admissibility is checked by two independent programs.