P67 variable circles in a fixed-perimeter rectangle: n = 3–9
Complete interval branch-and-bound over all contact orders leaves a single feasible contact graph, whose continuous optimum is isolated via interval Newton (with closed-form radical expressions for n = 3, 4, 5, 7, 8). A branch tree over integer grid offsets further proves that the current site records achieve the maximum possible sum of radii on the nine-decimal grid.
P63 optimal quadrature on the torus: n = 8, 13, 21, 34
An auxiliary function with non-negative Fourier coefficients establishes the continuous lower bound, attained exactly by Fibonacci-type lattices. At n = 8 the optimal lattice lies directly on the nine-decimal grid; for n = 13, 21, and 34, a localisation theorem combined with finite integer enumeration proves that the current site records are the exact grid minima.
P65 erasure-robust measurement directions: four rows
For d = 3, the vertex diagonals of the regular icosahedron (n = 6) and dodecahedron (n = 10) achieve the continuous optimum; at d = 4, n = 8, the continuous optimum is the square of a root of an degree-8 polynomial. For d = 3, n = 8, the certificate proves that the current site record is the maximum achievable score on the nine-decimal grid.
P60 sixteen lines in five dimensions
Rankin’s bound shows that the coherence is at least 1/√5, which is attainable over the reals; the proof establishes that no rational configuration can attain equality and that the current site record is optimal on the nine-decimal grid.
P61 five complex lines in three dimensions
Five complex lines in ℂ³ have coherence at least (√13 − 1)/6, attained by the canonical configuration in the Game of Sloanes archive. The core of the proof is a two-million-node rational Bernstein polynomial certificate covering the entire phase domain.
Submitting a proof
Proofs can be posted in any problem’s discussion section, or emailed if they include large computer-assisted certificates. Each newly adopted proof argument earns a permanent +2 proof award.