BREAKTHROUGH REVIEW

Breakthrough review

Submissions that exceed a published record enter the Pending queue first. Passing the arena verifier is only the first step; an entry moves to Verified only after source, metric convention, rounding precision, and construction checks are complete.

Verified breakthroughs131
Pending candidates112
Problem families16
CLAIM POLICY

Certification standards

  1. 01Traceable external benchmarkThere must be a public source and an explicit comparison value. An internal baseline generated by this site does not count as an external record.
  2. 02Verified complete constructionThe complete answer is rescored by the submission verifier. Each certification snapshot is pinned to that exact score and contributor and does not transfer when the record changes hands.
  3. 03Rule out precision artefactsTruncated and rounded literature values are expanded to their most conservative interval, accounting for coordinate precision, solver tolerances, and reconstruction error. Last-digit tweaks within uncertainty bounds remain candidates; certification requires either a proof or a margin beyond all identified uncertainties.

Certifications permanently record historical achievements. For live standings, holding the current site #1 earns 1 point and a certified world #1 adds +3 points; an internal takeover removes both, while an external advance removes the world #1 bonus. Historical certifications do not stack points.

VERIFIED ACHIEVEMENTS

Verified breakthroughs

Newest certifications first; same-day results are ordered by improvement. Each sub-problem shows its strongest certified result. World #1 points depend on current records.

Current verifiable construction for Spreading points in a right triangle, n = 98Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
85 · P16World #1 · currently +3

Spreading points in a right triangle · n = 98

Published best known[0.082580099, 0.082580103]
→
Verified here0.082580733
Relative improvement+0.000763%
Verified contributor
matrixfang#330
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The original submission re-verifies exactly. The source table and coordinates were downloaded again. Two source-only local refinements (original radius and an inward-relaxed radius) give a best diagnostic value about 0.082580102676825, versus this submission's 0.082580733. Symmetry-aware point matching shows changed contacts and improvement beyond publication precision, rather than repair of a rounded site exhibit. Optimisation results are diagnostic, not an upper bound or a global optimality proof.

Spreading n points here is packing n equal circles in the triangle (the points are the centres, d = 2r/(1 − (2+√2)r)); Packomania's crt table, compiled by Eckard Specht, keeps the best known packings and their coordinates, and cites Eckard Specht (2009–2010) for this row. The table does not mark it proved. The equivalence was pointed out by Tmrg, a user of this site, in a discussion

Current verifiable construction for Spreading points in a right triangle, n = 77Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
86 · P16World #1 · currently +3

Spreading points in a right triangle · n = 77

Published best known[0.094155922, 0.094155926]
→
Verified here0.094156561
Relative improvement+0.000674%
Verified contributor
matrixfang#330
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The original submission re-verifies exactly. The source table and coordinates were downloaded again. Two source-only local refinements (original radius and an inward-relaxed radius) give a best diagnostic value about 0.0941559255561153, versus this submission's 0.094156561. Symmetry-aware point matching shows changed contacts and improvement beyond publication precision, rather than repair of a rounded site exhibit. Optimisation results are diagnostic, not an upper bound or a global optimality proof.

Spreading n points here is packing n equal circles in the triangle (the points are the centres, d = 2r/(1 − (2+√2)r)); Packomania's crt table, compiled by Eckard Specht, keeps the best known packings and their coordinates, and cites David W. Cantrell (2010-10-26) for this row. The table does not mark it proved. The equivalence was pointed out by Tmrg, a user of this site, in a discussion

Current verifiable construction for Equal-circle packing in a 2:1 rectangle, n = 73Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
87 · P12World #1 · currently +3

Equal-circle packing in a 2:1 rectangle · n = 73

Published best known[0.083864941158572615084386635525, 0.083864941158572615084386635527]
→
Verified here0.08386548
Relative improvement+0.000643%
Verified contributor
Joost de Winter#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The original submission re-verifies exactly. The source table and coordinates were downloaded again. Two source-only local refinements (original radius and an inward-relaxed radius) give a best diagnostic value about 0.0838649411585729, versus this submission's 0.08386548. Symmetry-aware point matching shows changed contacts and improvement beyond publication precision, rather than repair of a rounded site exhibit. Optimisation results are diagnostic, not an upper bound or a global optimality proof.

Packomania's crc table, compiled by Eckard Specht, keeps the best known packings of equal circles in a 1 × 0.5 rectangle; this problem's 2 × 1 rectangle is that one doubled, so the radius is twice the table's. The table cites Eckard Specht (1999–2010) for this row. It does not mark this row proved

Current verifiable construction for Sum of radii in the regular pentagon, n = 33Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
88 · P94World #1 · currently +3

Sum of radii in the regular pentagon · n = 33

Published best known[3.91731, 3.91732)
→
Verified here3.917344046
Relative improvement+0.000614%
Verified contributor
zzzcy#308
Solution method
AI · OpenAI: GPT-6 Astra
Verified

Review: Exact verification checks containment and every circle pair. The score 3.917344046 exceeds the source interval's upper edge 3.91732. Symmetry matching and local refinement of the source figure give a different, weaker layout. This construction first appears in the site's public record history under this author at 2026-10-18T13:11:39.648Z (ae73d854-c2ff-4a61-9d8e-3aba510a5b06); this review pins their later strongest reviewed submission. Other last-digit variants do not receive duplicate certification. Local optimisation is diagnostic, not an optimality proof.

Jonathan Viquerat, Friedman's cirRpen table at c20fd4e865e7e88eabbec63c4ce74b988a3a9d8f (2026-10-16).

Current verifiable construction for Spreading points in a right triangle, n = 93Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
89 · P16World #1 · currently +3

Spreading points in a right triangle · n = 93

Published best known[0.084928596, 0.0849286]
→
Verified here0.084929073
Relative improvement+0.000557%
Verified contributor
matrixfang#330
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The original submission re-verifies exactly. The source table and coordinates were downloaded again. Two source-only local refinements (original radius and an inward-relaxed radius) give a best diagnostic value about 0.0849285991192518, versus this submission's 0.084929073. Symmetry-aware point matching shows changed contacts and improvement beyond publication precision, rather than repair of a rounded site exhibit. Optimisation results are diagnostic, not an upper bound or a global optimality proof.

Spreading n points here is packing n equal circles in the triangle (the points are the centres, d = 2r/(1 − (2+√2)r)); Packomania's crt table, compiled by Eckard Specht, keeps the best known packings and their coordinates, and cites David W. Cantrell (2010-10-26) for this row. The table does not mark it proved. The equivalence was pointed out by Tmrg, a user of this site, in a discussion

Current verifiable construction for Equal circles in regular polygons, m = 5 · n = 62Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
90 · P82Historical honour · no current points

Equal circles in regular polygons · m = 5 · n = 62

Published best known[0.099194901496, 0.099194901498]
→
Verified here0.099195312
Relative improvement+0.000414%
Verified contributor
Joost de Winter#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The original submission re-verifies exactly. The source table and coordinates were downloaded again. Two source-only local refinements (original radius and an inward-relaxed radius) give a best diagnostic value about 0.0991949014973062, versus this submission's 0.099195312. Symmetry-aware point matching shows changed contacts and improvement beyond publication precision, rather than repair of a rounded site exhibit. Optimisation results are diagnostic, not an upper bound or a global optimality proof.

Packomania (compiled by Eckard Specht), m=5, n=62. Eckard Specht, program cpt , 2023. The site cites the table's value and author; the configuration is not imported. The table does not mark this row proved.

Current verifiable construction for Spreading points in a right triangle, n = 96Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
91 · P16World #1 · currently +3

Spreading points in a right triangle · n = 96

Published best known[0.083466737, 0.083466741]
→
Verified here0.08346707
Relative improvement+0.000394%
Verified contributor
matrixfang#330
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The original submission re-verifies exactly. The source table and coordinates were downloaded again. Two source-only local refinements (original radius and an inward-relaxed radius) give a best diagnostic value about 0.0834667533916269, versus this submission's 0.08346707. Symmetry-aware point matching shows changed contacts and improvement beyond publication precision, rather than repair of a rounded site exhibit. Optimisation results are diagnostic, not an upper bound or a global optimality proof.

Spreading n points here is packing n equal circles in the triangle (the points are the centres, d = 2r/(1 − (2+√2)r)); Packomania's crt table, compiled by Eckard Specht, keeps the best known packings and their coordinates, and cites Eckard Specht (2009–2010) for this row. The table does not mark it proved. The equivalence was pointed out by Tmrg, a user of this site, in a discussion

Current verifiable construction for Spreading points in a right triangle, n = 88Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
92 · P16World #1 · currently +3

Spreading points in a right triangle · n = 88

Published best known[0.087562502, 0.087562506]
→
Verified here0.087562786
Relative improvement+0.00032%
Verified contributor
matrixfang#330
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The original submission re-verifies exactly. The source table and coordinates were downloaded again. Two source-only local refinements (original radius and an inward-relaxed radius) give a best diagnostic value about 0.087562505947547, versus this submission's 0.087562786. Symmetry-aware point matching shows changed contacts and improvement beyond publication precision, rather than repair of a rounded site exhibit. Optimisation results are diagnostic, not an upper bound or a global optimality proof.

Spreading n points here is packing n equal circles in the triangle (the points are the centres, d = 2r/(1 − (2+√2)r)); Packomania's crt table, compiled by Eckard Specht, keeps the best known packings and their coordinates, and cites Eckard Specht (2011-03-18) for this row. The table does not mark it proved. The equivalence was pointed out by Tmrg, a user of this site, in a discussion

Current verifiable construction for Spreading points in a right triangle, n = 54Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
93 · P16World #1 · currently +3

Spreading points in a right triangle · n = 54

Published best known[0.114780098, 0.114780102]
→
Verified here0.114780207
Relative improvement+0.000091%
Verified contributor
matrixfang#330
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The original submission re-verifies exactly. The source table and coordinates were downloaded again. Two source-only local refinements (original radius and an inward-relaxed radius) give a best diagnostic value about 0.114780101843662, versus this submission's 0.114780207. Symmetry-aware point matching shows changed contacts and improvement beyond publication precision, rather than repair of a rounded site exhibit. Optimisation results are diagnostic, not an upper bound or a global optimality proof.

Spreading n points here is packing n equal circles in the triangle (the points are the centres, d = 2r/(1 − (2+√2)r)); Packomania's crt table, compiled by Eckard Specht, keeps the best known packings and their coordinates, and cites Eckard Specht (2009–2010) for this row. The table does not mark it proved. The equivalence was pointed out by Tmrg, a user of this site, in a discussion

Current verifiable construction for Spreading points in a right triangle, n = 64Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
94 · P16World #1 · currently +3

Spreading points in a right triangle · n = 64

Published best known[0.104179398, 0.104179402]
→
Verified here0.104179419
Relative improvement+0.000016%
Verified contributor
matrixfang#330
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The original submission re-verifies exactly. The source table and coordinates were downloaded again. Two source-only local refinements (original radius and an inward-relaxed radius) give a best diagnostic value about 0.104179401422913, versus this submission's 0.104179419. Symmetry-aware point matching shows changed contacts and improvement beyond publication precision, rather than repair of a rounded site exhibit. Optimisation results are diagnostic, not an upper bound or a global optimality proof.

Spreading n points here is packing n equal circles in the triangle (the points are the centres, d = 2r/(1 − (2+√2)r)); Packomania's crt table, compiled by Eckard Specht, keeps the best known packings and their coordinates, and cites David W. Cantrell (2010-10-26) for this row. The table does not mark it proved. The equivalence was pointed out by Tmrg, a user of this site, in a discussion

Current verifiable construction for Spreading points in a right triangle, n = 73Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
95 · P16World #1 · currently +3

Spreading points in a right triangle · n = 73

Published best known[0.096965878, 0.096965882]
→
Verified here0.096965897
Relative improvement+0.000015%
Verified contributor
matrixfang#330
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The original submission re-verifies exactly. The source table and coordinates were downloaded again. Two source-only local refinements (original radius and an inward-relaxed radius) give a best diagnostic value about 0.0969658812523922, versus this submission's 0.096965897. Symmetry-aware point matching shows changed contacts and improvement beyond publication precision, rather than repair of a rounded site exhibit. Optimisation results are diagnostic, not an upper bound or a global optimality proof.

Spreading n points here is packing n equal circles in the triangle (the points are the centres, d = 2r/(1 − (2+√2)r)); Packomania's crt table, compiled by Eckard Specht, keeps the best known packings and their coordinates, and cites David W. Cantrell (2011-03-09) for this row. The table does not mark it proved. The equivalence was pointed out by Tmrg, a user of this site, in a discussion

Current verifiable construction for The smallest triangle in a disc, n = 14Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
96 · P22Historical honour · no current points

The smallest triangle in a disc · n = 14

Published best known[0.0758572510609005, 0.0758572510609015]
→
Verified here0.0767158855873489425
Relative improvement+1.131908%
Verified contributor
zzzcy#308
Solution method
AI · OpenAI: GPT-6 Astra
Verified

Review: The submission was retrieved and re-verified in exact integers: all 14 points lie in the radius-one disc and the area of each of the 364 triples was computed; the smallest is 0.0767158855873489425, above the upper edge 0.0758572510609015 of the source interval by 0.000858635 (about 1.13%). Source recheck on 2026-10-08: MathWorld's disc row is unchanged by its 2026-10-02 update; Friedman's original circle page, archived in 2011 and 2019, gives 0.0758+, consistent with it; no newer disc literature was found. The source construction (7 points on the circle, 7 inside, mirror-symmetric), re-optimised without a cap, reaches only 0.0758572510609; this answer has 8 points on the circle and 6 inside, a different and better construction. The site's earlier record only matched the source value, so this is not a copy. Submission UUID and construction SHA-256 are pinned. Not a proof of global optimality.

Friedman and Cantrell's (2007) H14 ≥ 0.02414611295141071 for the unit-area disc in MathWorld's Heilbronn Triangle Problem table (page updated 2026-10-02), multiplied by pi for the site's radius-one disc and read at published precision; Friedman's original circle page (archived) lists the same construction as 0.0758+