P93 sum of radii in a triangle: n = 1–11 and 15
A computer-assisted proof by zzzcy (written with AI assistance): the continuous problem is reduced to finitely many contact triangulations and solved, after which a localisation theorem and exact rational certificates rule out any higher score on the nine-decimal grid. Every certificate was replayed by the site’s independent checker. Across all twelve instances, the current site record is the exact grid optimum, and the record holders remain unchanged (+2 proof award).
P05 squares in a circle: n = 3, 5, 6, 7
The-Anh Vu-Le formalised in Lean 4 with Mathlib the minimum enclosing circle for 1 to 7 unit squares. Citing his public repository, the site marks n = 3, 5, 6, and 7 as proven optimal (n = 4 was already archived).
Discussions and mailbox: nine instances
Covers the gapless full-tiling area bound for P89 n = 4, 8, 16, 18 and P91 n = 12, 27, the axis-projection bound for P90 n = 1, the centroid identity for P82 (m = 6, n = 3), and the two-strip width-tightening proof for P17 n = 6.
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.