\documentclass[11pt]{amsart} \usepackage[margin=1.1in]{geometry} \usepackage{amsmath,amssymb,amsthm} \usepackage[hidelinks]{hyperref} \newtheorem{theorem}{Theorem} \newtheorem{corollary}{Corollary} \newtheorem{lemma}{Lemma} \theoremstyle{remark} \newtheorem{remark}{Remark} \begin{document} \sloppy \title{An admissible $232\,465\,000$-tuple with few long pairs, and $H_5\le 4\,817\,211\,684$} \author{David Niedbala Giraudin} \address{Independent researcher, Meaux, France} \urladdr{\href{https://orcid.org/0009-0009-1526-1178}{https://orcid.org/0009-0009-1526-1178}} \date{18 November 2026} \subjclass[2020]{11N05, 11N35, 11Y16} \keywords{gaps between primes, admissible tuples, Maynard--Tao sieve} \begin{abstract} Let $H_m=\liminf_{n\to\infty}(p_{n+m}-p_n)$. Version~2 of Kapila's preprint hexagon:2610.00419 proves $H_5\le 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\le 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\le 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 $\pm p$, removing $158\,382$ elements and adding $\pm1$; its admissibility and its pair count are checked by two independent programs. \end{abstract} \maketitle \section{Result} For $m\ge1$ let $H_m=\liminf_{n\to\infty}(p_{n+m}-p_n)$, where $p_n$ is the $n$-th prime. A set of integers is \emph{admissible} if for every prime $p$ it misses at least one residue class modulo $p$; for a set of $K$ elements it suffices to check the primes $p\le K$. For a finite set $\mathcal H$ and $D>0$ let $B_D(\mathcal H)$ be the number of pairs $\{h,h'\}\subset\mathcal H$ with $|h-h'|>D$. Version~2 of \cite{K2} (6 November 2026) proves $H_2\le19\,844$, $H_3\le1\,357\,780$, $H_4\le82\,234\,788$ and $H_5\le4\,830\,355\,416$. For $m=5$ its final step \cite[Proposition~10.2 and Section~11]{K2} reads: an admissible tuple $\mathcal H$ of $K=232\,465\,000$ elements gives $H_5\le D$ if \begin{equation}\label{eq:crit} \rho\,\frac{K}{k}\,q_- - 5(1-\beta_-) - B_D(\mathcal H)\,C_+>0, \end{equation} with $k=232\,500\,000$, $\rho=151\,320\,927\,303\,522\,335/2^{59}$ and the certified endpoints $q_-=19.04804762745624$, $\beta_-=0.00014210693394371$, $C_+=1.491020798040\cdot10^{-14}$ printed in \cite[Section~11.1]{K2}. With these exact rationals, \eqref{eq:crit} holds if and only if $B_D(\mathcal H)\le 4\,672\,314\,960$. The certificates of \cite{K2} are used as stated; only the tuple is new. The same certificates were applied to other tuples in \cite{GH}, which gives $H_5\le4\,827\,554\,952$ (and smaller tuples for $m=2,3,4$). \begin{theorem}\label{thm:tuple} There is an admissible tuple $\mathcal H$ of $232\,465\,000$ elements, contained in $[-2\,427\,786\,701,\,2\,391\,510\,637]$, with $B_D(\mathcal H)=4\,672\,314\,941$ for $D=4\,817\,211\,684$. \end{theorem} \begin{corollary} With the certificates of \cite{K2}, $H_5\le 4\,817\,211\,684$. \end{corollary} \begin{proof} Theorem~\ref{thm:tuple} and \eqref{eq:crit}: the left-hand side equals $2.958\ldots\cdot10^{-13}>0$ for $B_D=4\,672\,314\,941$. \end{proof} Version~1 of the present note gave $H_5\le4\,891\,341\,734$ with the statement $\mathrm{DHL}[234\,360\,000,6]$ of version~1 of \cite{K2}; that bound had already been improved by version~2 of \cite{K2}. \section{The tuple} Let $L=2\,432\,107\,459$. The certificate of \cite[Section~12.3]{K2} gives, for every prime $10^7
|\mathcal H|$ need no check. \end{proof} The classes $c_p$ are the residues $r_p$ after step~1, except for the $1\,917\,107$ primes for which $r_p\in\{1,p-1\}$ (this class contains $1$ or $-1$); for these, $c_p$ is the smallest $c\ge2$ whose class contains no element of $\mathcal H$, computed by the verification program. Admissibility is only required for $\mathcal H$ itself, not for the whole parent set, which leaves more classes empty than in \cite{K2}; the residues of step~1 were chosen among the classes empty in $\mathcal H$, and an element was removed in step~2 when it was the only element of such a class. \section{Verification} \texttt{h5\_verify.py} reads the data files of the certificate bundle of \cite{K2} (its residue file and three patch files; none of its programs is run), checks the SHA-256 of \cite[Section~12.3]{K2}, applies the changes above, computes the classes $c_p$ for the primes with $r_p\in\{1,p-1\}$ (all $1\,917\,107$ are found), and runs two verifiers. \begin{itemize} \item Verifier A (Python, \texttt{numpy}) rebuilds $\mathcal H$ with its own sieve, checks its cardinality, checks for each of the $11\,915\,259$ primes $10^7