Reinhardt's Maximum-Perimeter Polygon Problem for n=16, 32, and 64
A convex polygon is called small if its diameter is at most one. Reinhardt proved the universal perimeter bound $\operatorname{perim}(P)\le U_n:=2n\sin(π/(2n))$, and the bound is attained whenever $n$ has a nontrivial odd divisor. The remaining power-of-two cases have resisted exact solution beyond $n=8$. We give computer-assisted proofs of the first three cases, $n=16,32,64$, and in each case prove uniqueness of the maximizing congruence class. The proof architecture is common to all three cases: pass to the difference body $P-P$; encode its reconstruction by a sign code; prove that every global maximizer is saturated, so all difference-body vertices lie on the unit circle; localize every competitive configuration near the regular angle vector; exhaustively screen the sign codes using exact arithmetic; eliminate all nonwinning dihedral orbits; and prove uniqueness inside the winning code by strong convexity and a quantitative KKT argument. The exact certificates cover $2^{15}$ normalized codes for $n=16$, $2^{31}$ normalized codes for $n=32$, and all $2^{64}$ half-codes for $n=64$, leaving respectively $16$, $96$, and $896$ survivors before orbit elimination. The accompanying source package contains the verifiers, recorded outputs, hashes, and separate computational cross-checks.