\section{Verification}\label{sec:verification} Only the proof of the statement marked $\dagger$, Lemma~\ref{lem:torquepoly}, includes computations. The computations on which some of the cited results of \cite{Tom26} rest are described and checked in \cite[\S12]{Tom26}. Table~\ref{tab:verif} lists the computations of this paper, the software on which they depend, and the computer checks of the hand proofs. The software is SymPy, FLINT through python-flint and mpmath, in Python; the supplementary material gives the versions. NumPy and SciPy are used only in floating-point steps that propose certificates or approximate values, which are then checked in exact arithmetic. The programs, their outputs and the checksums of all files are in the supplementary material. \begin{table}[ht] \centering \footnotesize \begin{tabular}{@{}>{\raggedright\arraybackslash}p{2.6cm}>{\raggedright\arraybackslash}p{5.6cm}>{\raggedright\arraybackslash}p{6.6cm}@{}} \toprule statement & computation and trusted software & checks\\ \midrule Lemma~\ref{lem:torquepoly}\cert & resultant (SymPy); factorization over $\Q$ (FLINT); root counts by Sturm sequences and signs at the ends of the intervals in exact rational arithmetic (SymPy) & the root counts again by Descartes' rule of signs with bisection, in a separate implementation; an enclosure of $\xi_1$ in ball arithmetic from the interval of $s_1$ meets the interval of the root of $\Xi$; the displayed coefficients of $\Xi$ are compared with the computed ones\\ Theorem~\ref{thm:36} & hand proof & the twenty equations of the system of \cite{AK12} vanish on the nine sets $\cC'(\zeta_1,\zeta_2)$ of \S\ref{sec:curves} and their images under $(23)$ and $(34)$, $27$ sets in all, carried to $(1,4,4,4,4)$ by the exchange of bodies $1$ and $5$ (SymPy)\\ Lemma~\ref{lem:d3a} & hand proof & the weighted rows recomputed from the equations; the identities of the proof checked in SymPy; all leading solutions lifted in exact arithmetic over $\Q(\zeta_{12})$ to order $7$, with a nonzero obstruction at order $3$, $4$ or $6$ at all but the $72$ balanced ones\\ \S\ref{ss:branches}, Lemma~\ref{lem:d3b} & hand proof & the $18$ weighted rows vanish identically on the $36$ branches; $\gamma\mapsto\tilde Y_\gamma(0)$ is the stated bijection (SymPy, exact in $\Q(\zeta_{12})$)\\ Theorem~\ref{thm:d6B} & hand proof & the weighted rows recomputed from the equations by two programs; the identities (I0)--(I3) and the rank in exact arithmetic (SymPy); the leading solutions and the obstructions of orders $3$ to $6$ at all $5184$ leading solutions, computed modulo a prime that splits completely in their field of definition, where a nonzero value proves that the obstruction does not vanish, and compared with the closed forms\\ Propositions~\ref{prop:values} and~\ref{prop:P1values} & hand proof & the values of $f$, $\varphi$ and $f_1$, $g$ on the types, for every labelling that satisfies the conditions used, in exact rational arithmetic, with the minima over the closures of the parameter ranges\\ Lemma~\ref{lem:P1d5} & hand proof & a branching over the alternatives of the relations of the place, in which every closed node carries a dual certificate verified in exact rational arithmetic\\ \bottomrule \end{tabular} \caption{The computation used in the proofs, and the checks of the hand proofs.}\label{tab:verif} \end{table}