\section{Scalar boundary classification for the order-\texorpdfstring{$6p$}{6p} proof}\label{app:6p-scalar} This appendix completes Lemma~\ref{lem:6p-prefix}. The six relation symbols and their four defining tests are in Section~\ref{sec:6p-rules}. The tables enumerate all rows and the common parameters allowed by Lemma~\ref{lem:6p-diagonal}. They are evaluations of the displayed marker rule, not imported computational certificates. \subsection{Residue zero: a short boundary calculation}\label{app:6p-r0} Let $d=d_p-\varepsilon$. The columns $d,\ldots,p-1$ have three visits. By \eqref{eq:6p-bulk}, their internal edges are equalities, sometimes with the common value fixed. Write their common bit as $x$. There are at most four exceptional initial bits. The next table lists the boundary relations on $(f_0,f_1),\ldots,(f_{d-1},x)$, followed after the semicolon by the wrap relation $(x,f_0)$. It follows directly from \eqref{eq:6p-visits} and \eqref{eq:6p-four-tests}; it is valid for all $p$ in the indicated residue, including $5,7$. \begin{center}\small \begin{tabular}{ccc|ll}\toprule $p\bmod6$&$i$&$q$&lower boundary&upper boundary\\\midrule 5&0&1&$\OO;\UU$&$\EE\ \OO;\UU$\\ 5&0&2&$\UU;\ZZ$&$\RelA\ \EE;\ZZ$\\ 5&1&1&$\EE;\OO$&$\EE\ \DD;\OO$\\ 5&1&2&$\DD;\EE$&$\RelA\ \ZZ;\EE$\\ 5&2&1&$\EE;\DD$&$\EE\ \UU;\DD$\\ 5&2&2&$\ZZ;\EE$&$\ZZ\ \EE;\EE$\\\midrule 1&0&1&$\RelA\ \EE\ \DD;\EE$&$\RelA\ \EE\ \RelA\ \EE;\EE$\\ 1&0&2&$\EE\ \ZZ\ \ZZ;\UU$&$\EE\ \ZZ\ \EE\ \DD;\UU$\\ 1&1&1&$\RelA\ \EE\ \OO;\EE$&$\RelA\ \EE\ \OO\ \OO;\EE$\\ 1&1&2&$\EE\ \RelA\ \EE;\ZZ$&$\EE\ \RelA\ \EE\ \UU;\ZZ$\\ 1&2&1&$\OO\ \EE\ \UU;\OO$&$\OO\ \EE\ \RelA\ \EE;\OO$\\ 1&2&2&$\EE\ \RelA\ \EE;\DD$&$\EE\ \RelA\ \EE\ \ZZ;\DD$\\\bottomrule \end{tabular} \end{center} Only four bulk fixed-bit facts are needed in reading the table: \[ \begin{array}{c|ccc|c} p\bmod6&i&q&\text{edge }j&\text{consequence}\\\hline 5&2&1&2&x=1\\ 5&1&2&1\text{ (lower)}&x=0\\ 1&0&1&4&x=1\\ 1&2&2&3\text{ (lower)}&x=0. \end{array} \] Each is a bulk edge even at the smallest admissible prime; its symbol is $\OO$ or $\ZZ$ by \eqref{eq:6p-bulk}. For $p\equiv5,q=1$, the first two row choices force every bit to 1. The third has $x=1$: the lower boundary forces $f_0=x$, whereas the upper permits $f_0=f_1\le x$. Its only nonconstant word therefore has zeros exactly at $0,1$. For $p\equiv1,q=1$, the second and third rows force all bits to 1. In row zero, $x=1$; the lower boundary forces $f_1=f_2\ge x$, while the upper leaves $f_1=f_2$ free and fixes $f_0=f_3=x$. Its only nonconstant word has zeros exactly at $1,2$. For $q=2$, all rows force the zero word. For example, the upper boundary in residue one, row zero, fixes $f_0=f_1=f_2=f_3=0$ and requires $f_3\ge x$, so $x=0$. Row one fixes $x=f_0=f_1=0$ and $f_2=f_3\le x$; row two fixes $f_2=f_3=x=0$ and $x\ge f_0=f_1$. The lower cases follow from the displayed fixed bits and equalities. In residue five the $\ZZ$ or wrap relation, together with the indicated bulk fixed bit in the one necessary case, gives the same conclusion. Thus no lower word is nonconstant, and precisely the support stated in Lemma~\ref{lem:6p-prefix} survives at the upper boundary. \subsection{Residue two: one extra position}\label{app:6p-r2} The preceding offset is exactly $6p$: all markers vanish and $h=0$. For $q=0$ or 1, every edge is $\EE$, excluding a nonconstant word. At the upper offset only $P_{0,0}$ is 1. Every edge except the two touching column zero is $\EE$. Their symbols are \[ \begin{array}{cc|cc} q&i&(f_0,f_1)&(f_{p-1},f_0)\\\hline 0&0&\EE&\EE\\ 0&1&\UU&\EE\\ 0&2&\EE&\DD\\ 1&0&\DD&\UU\\ 1&1,2&\EE&\EE. \end{array} \] A cycle of equalities with at most one one-way inequality is constant. Only $q=1,i=0$ has two relaxed edges. Writing $x=f_1=\cdots=f_{p-1}$, both require $x\le f_0$. Its sole nonconstant solution is $f_0=1,x=0$, giving $S=\{0\}$. \subsection{Residue three: fixed equality components}\label{app:6p-r3} Here $h=1$. The lower prefix has two visits per column; the upper adds a third visit at column zero only. On the interior edges $j=1,\ldots,p-2$, the two-visit patterns in \eqref{eq:6p-bulk} apply. For $q=1$, the interior is entirely $\EE$ and the two boundary edges are equalities except possibly one $\UU$ or $\DD$. This follows by inserting the third visit in \eqref{eq:6p-four-tests}; it changes at most one of the two boundary relations for this value of $q$. Thus the word is constant at both boundaries. For $q=0,2$, contract the interior $\EE$ edges. Every resulting component either has its bit fixed by $\OO$ (for $q=0$) or $\ZZ$ (for $q=2$), or touches an endpoint $f_1$ or $f_{p-1}$. To see this directly, in \eqref{eq:6p-bulk} successive $\RelA$ edges are six positions apart, and the intervening equality block contains a fixed-bit edge. Only the two truncated end blocks can lack one. Let $x=f_1,y=f_{p-1},z=f_0$. The endpoint conditions and the two boundary relations are listed below. An asterisk leaves the endpoint free before boundary relations are imposed. \begin{center}\small \begin{tabular}{ccc|cc|cc|cc}\toprule &&&\multicolumn{2}{c|}{interior}&\multicolumn{2}{c|}{lower}&\multicolumn{2}{c}{upper}\\ $p\bmod6$&$i$&$q$&$x$&$y$&$(z,x)$&$(y,z)$&$(z,x)$&$(y,z)$\\\midrule 5&0&0&1&$*$&$\OO$&$\OO$&$\OO$&$\EE$\\ 5&1&0&$*$&1&$\EE$&$\OO$&$\EE$&$\OO$\\ 5&2&0&1&1&$\EE$&$\DD$&$\UU$&$\DD$\\ 5&0&2&0&0&$\RelA$&$\ZZ$&$\RelA$&$\ZZ$\\ 5&1&2&0&0&$\ZZ$&$\DD$&$\ZZ$&$\RelA$\\ 5&2&2&$*$&$*$&$\ZZ$&$\ZZ$&$\ZZ$&$\ZZ$\\\midrule 1&0&0&$*$&1&$\OO$&$\OO$&$\OO$&$\OO$\\ 1&1&0&1&1&$\RelA$&$\UU$&$\RelA$&$\RelA$\\ 1&2&0&1&$*$&$\OO$&$\OO$&$\OO$&$\OO$\\ 1&0&2&0&$*$&$\EE$&$\UU$&$\EE$&$\UU$\\ 1&1&2&0&0&$\ZZ$&$\ZZ$&$\ZZ$&$\ZZ$\\ 1&2&2&$*$&0&$\EE$&$\ZZ$&$\DD$&$\EE$\\\bottomrule \end{tabular} \end{center} For instance, the third row at the upper boundary says $x=y=1$ and $z\le x$, $y\ge z$, leaving $z$ free. The ninth row has the same freedom. Every other $q=0$ row forces $x=y=z=1$. Every $q=2$ row forces $x=y=z=0$; in the last upper row, $y=z=0$ and $z\ge x$ force $x=0$ as well. The fixed interior components then fix all remaining bits. All entries are consequences of the two-visit bulk pattern and the two endpoint substitutions; each endpoint is either separated from the fixed interior by a $\RelA$ edge or connected to a fixed-bit edge after at most two interior edges. There are already three interior edges at $p=5$, so these endpoint tests apply at $p=5,7$ as well. We obtain only constant words at the lower boundary, and at the upper boundary the sole nonconstant word is $f_0=0$, all other bits 1, in row $i=p\bmod3$. \subsection{Residue one: free triples and a boundary contradiction}\label{app:6p-r1} The common parameter is $q=2$, $h=3$. First suppose $p\ge11$, so the upper prefix has five visits in the first $p-4$ columns and four visits in the last four; the lower prefix has five four-visit columns at its end. Away from those last columns, \eqref{eq:6p-triplebulk} gives constant triples. The complete exceptional tail is described by the six relations on edges $p-6,p-5,\ldots,p-1$, with the last edge wrapping to column zero: \begin{center}\small \begin{tabular}{cc|ll}\toprule $p\bmod6$&$i$&lower tail&upper tail\\\midrule 5&0&$\EE\ \EE\ \OO\ \EE\ \EE\ \ZZ$&$\EE\ \UU\ \OO\ \EE\ \EE\ \ZZ$\\ 5&1&$\OO\ \EE\ \EE\ \ZZ\ \EE\ \EE$&$\EE\ \EE\ \EE\ \ZZ\ \EE\ \EE$\\ 5&2&$\DD\ \ZZ\ \EE\ \EE\ \OO\ \DD$&$\RelA\ \ZZ\ \EE\ \EE\ \OO\ \DD$\\ 1&0&$\ZZ\ \EE\ \EE\ \OO\ \EE\ \UU$&$\EE\ \DD\ \EE\ \OO\ \EE\ \UU$\\ 1&1&$\EE\ \OO\ \EE\ \EE\ \ZZ\ \EE$&$\EE\ \OO\ \EE\ \EE\ \ZZ\ \EE$\\ 1&2&$\UU\ \EE\ \ZZ\ \EE\ \EE\ \OO$&$\RelA\ \EE\ \ZZ\ \EE\ \EE\ \OO$\\\bottomrule \end{tabular} \end{center} Every lower row contains $\OO\ \EE\ \EE\ \ZZ$ or $\ZZ\ \EE\ \EE\ \OO$ as a consecutive subword. It forces the same bit to be both 1 and 0. The four inactive upper rows contain the same contradiction. In the active upper row for $p\equiv5$, the tail forces zeros outside the free interval $[2,p-7]$: its $\ZZ$ propagates through the tail to column zero, and the first bulk equality fixes column one as well. The free edges are $j\equiv1\pmod3$, yielding the triples starting at $2,5,\ldots,p-9$. In the active upper row for $p\equiv1$, its $\OO$, $\DD$ and wrap $\UU$ force ones outside $[3,p-8]$. The bulk free edges are $j\equiv2\pmod3$, yielding the triples starting at $3,6,\ldots,p-10$. In either case all free triples can be chosen independently. The one constant word is discarded. This proves the exact supports and $2^{\lambda_p}-1$ count directly. For $p=5,7$, $e_p=2$. To leave no unreported small case, here are the full cyclic relation words, starting at edge zero: \begin{center}\small \begin{tabular}{cc|ll}\toprule $p$&$i$&lower word&upper word\\\midrule 5&0&$\RelA\ \OO\ \EE\ \EE\ \ZZ$&$\RelA\ \EE\ \EE\ \EE\ \ZZ$\\ 5&1&$\EE\ \DD\ \ZZ\ \EE\ \EE$&$\EE\ \RelA\ \ZZ\ \EE\ \EE$\\ 5&2&$\EE\ \EE\ \EE\ \OO\ \DD$&$\EE\ \EE\ \UU\ \OO\ \DD$\\ 7&0&$\EE\ \EE\ \RelA\ \EE\ \OO\ \EE\ \UU$&$\EE\ \EE\ \RelA\ \EE\ \OO\ \EE\ \UU$\\ 7&1&$\RelA\ \EE\ \EE\ \UU\ \EE\ \ZZ\ \EE$&$\RelA\ \EE\ \EE\ \RelA\ \EE\ \ZZ\ \EE$\\ 7&2&$\EE\ \RelA\ \EE\ \ZZ\ \EE\ \EE\ \OO$&$\EE\ \RelA\ \EE\ \EE\ \DD\ \EE\ \OO$\\\bottomrule \end{tabular} \end{center} Contracting the equalities gives only constants or inconsistency at the lower boundary. At the upper boundary the only additional words are $00011$ in row 2 for $p=5$, and $0111000$ in row 1 for $p=7$; these specify supports $\{3,4\}$ and $\{1,2,3\}$. For example, the first exceptional upper word has $f_0=f_1=f_2$, $f_3=f_4=1$, and only the inequalities $f_2\le f_3$, $f_4\ge f_0$. The other has two free edges around the equal triple $f_1=f_2=f_3$, with every other bit fixed to zero.