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 breakthroughs76
Pending candidates63
Problem families15
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

Shows the strongest certified result per sub-problem, ordered by conservative relative gain at certification time. Current world #1 points depend on live record standings.

Current verifiable construction for Lighting a unit square, n = 21Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
01 · P51World #1 · currently +3

Lighting a unit square · n = 21

Published best known[172.658, 172.659)
→
Verified here184.439329
Relative improvement+6.822887%
Verified contributor
Gaozx1#151
Solution method
AI · Z.ai: GLM 5.3 Flash
Verified

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark

Earlier certifications (5)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

NUE_13 #31

[172.658, 172.659)→184.439282+6.82286%

Human

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark ↗
今天 #84

[172.658, 172.659)→184.009074+6.573694%

Human

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark ↗
Current verifiable construction for Lighting a unit square, n = 28Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
02 · P51Historical honour · no current points

Lighting a unit square · n = 28

Published best known[252.447, 252.448)
→
Verified here268.113242
Relative improvement+6.205334%
Verified contributor
游侠#116
Solution method
AI · OpenAI: GPT-5.6 Sol
Verified

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark

Earlier certifications (3)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

邱仲普 #72

[252.447, 252.448)→267.937821+6.135846%

AI · MoonshotAI: Kimi K3

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark ↗
Current verifiable construction for Lighting a unit square, n = 20Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
03 · P51Historical honour · no current points

Lighting a unit square · n = 20

Published best known[165.272, 165.273)
→
Verified here174.495297
Relative improvement+5.580038%
Verified contributor
游侠#116
Solution method
AI · OpenAI: GPT-5.6 Sol
Verified

Review: The credited historical answer was fetched and independently checked by integer interval branch-and-bound over the whole square. Its certified intensity lower bound clears the complete three-decimal truncated source interval; this is not a finite-sampling estimate.

The external P51 benchmark and publication interval reviewed on 2026-09-05

Earlier certifications (3)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

Current verifiable construction for Lighting a unit square, n = 27Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
04 · P51Historical honour · no current points

Lighting a unit square · n = 27

Published best known[242.055, 242.056)
→
Verified here252.044246
Relative improvement+4.12642%
Verified contributor
游侠#116
Solution method
AI · OpenAI: GPT-5.6 Sol
Verified

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark

Earlier certifications (3)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

邱仲普 #72

[242.055, 242.056)→251.883491+4.060007%

AI · MoonshotAI: Kimi K3

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark ↗
Current verifiable construction for Lighting a unit square, n = 18Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
05 · P51Historical honour · no current points

Lighting a unit square · n = 18

Published best known[141.556, 141.557)
→
Verified here147.340063
Relative improvement+4.085325%
Verified contributor
游侠#116
Solution method
AI · OpenAI: GPT-5.6 Sol
Verified

Review: The credited historical answer was fetched and independently checked by integer interval branch-and-bound over the whole square. Its certified intensity lower bound clears the complete three-decimal truncated source interval; this is not a finite-sampling estimate.

The external P51 benchmark and publication interval reviewed on 2026-09-05

Earlier certifications (4)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

iqy #106

[141.556, 141.557)→147.338946+4.084536%

AI · MoonshotAI: Kimi K3

Review: The credited historical answer was fetched and independently checked by integer interval branch-and-bound over the whole square. Its certified intensity lower bound clears the complete three-decimal truncated source interval; this is not a finite-sampling estimate.

The external P51 benchmark and publication interval reviewed on 2026-09-05 ↗
Current verifiable construction for Lighting a unit square, n = 19Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
06 · P51Historical honour · no current points

Lighting a unit square · n = 19

Published best known[152.854, 152.855)
→
Verified here158.868263
Relative improvement+3.933966%
Verified contributor
邱仲普#72
Solution method
AI · MoonshotAI: Kimi K3
Verified

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark

Earlier certifications (3)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

Current verifiable construction for Lighting a unit square, n = 30Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
07 · P51Historical honour · no current points

Lighting a unit square · n = 30

Published best known[285.345, 285.346)
→
Verified here294.494986
Relative improvement+3.206278%
Verified contributor
游侠#116
Solution method
AI · OpenAI: GPT-5.6 Sol
Verified

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark

Earlier certifications (4)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

邱仲普 #72

[285.345, 285.346)→294.382627+3.166902%

AI · MoonshotAI: Kimi K3

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark ↗
Current verifiable construction for Lighting a unit square, n = 35Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
08 · P51Historical honour · no current points

Lighting a unit square · n = 35

Published best known[347.195, 347.196)
→
Verified here357.333806
Relative improvement+2.919909%
Verified contributor
今天#84
Solution method
Human
Verified

Review: The credited historical answer was fetched and independently checked by integer interval branch-and-bound over the whole square. Its certified intensity lower bound clears the complete three-decimal truncated source interval; this is not a finite-sampling estimate.

The external P51 benchmark and publication interval reviewed on 2026-09-05

Earlier certifications (3)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

Current verifiable construction for Lighting a unit square, n = 26Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
09 · P51Historical honour · no current points

Lighting a unit square · n = 26

Published best known[234.759, 234.760)
→
Verified here239.67203
Relative improvement+2.092362%
Verified contributor
游侠#116
Solution method
AI · OpenAI: GPT-5.6 Sol
Verified

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark

Earlier certifications (4)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

邱仲普 #72

[234.759, 234.760)→239.538939+2.03567%

AI · MoonshotAI: Kimi K3

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark ↗
今天 #84

[234.759, 234.760)→239.463706+2.003623%

Human

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark ↗
Current verifiable construction for Lighting a unit square, n = 34Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
10 · P51Historical honour · no current points

Lighting a unit square · n = 34

Published best known[337.906, 337.907)
→
Verified here344.23623
Relative improvement+1.873069%
Verified contributor
今天#84
Solution method
Human
Verified

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark

Earlier certifications (5)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

游侠 #116

[337.906, 337.907)→344.235704+1.872913%

AI · OpenAI: GPT-5.6 Sol

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark ↗
hadsajnc #146

[337.906, 337.907)→344.088056+1.829218%

Human

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark ↗
Current verifiable construction for Lighting a unit square, n = 10Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
11 · P51Historical honour · no current points

Lighting a unit square · n = 10

Published best known[62.408, 62.409)
→
Verified here63.54872
Relative improvement+1.826211%
Verified contributor
215590053#88
Solution method
Human
Verified

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark

Earlier certifications (6)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

hadsajnc #146

[62.408, 62.409)→63.548691+1.826164%

Human

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark ↗
今天 #84

[62.408, 62.409)→63.548718+1.826208%

Human

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark ↗
Current verifiable construction for Lighting a unit square, n = 15Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
12 · P51Historical honour · no current points

Lighting a unit square · n = 15

Published best known[113.191, 113.192)
→
Verified here114.941985
Relative improvement+1.546032%
Verified contributor
hadsajnc#146
Solution method
Human
Verified

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark

Earlier certifications (6)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

今天 #84

[113.191, 113.192)→114.941974+1.546023%

Human

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark ↗
215590053 #88

[113.191, 113.192)→114.941977+1.546025%

Human

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark ↗
Current verifiable construction for Lighting a unit square, n = 25Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
13 · P51Historical honour · no current points

Lighting a unit square · n = 25

Published best known[225.100, 225.101)
→
Verified here228.046741
Relative improvement+1.308631%
Verified contributor
游侠#116
Solution method
AI · OpenAI: GPT-5.6 Sol
Verified

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark

Earlier certifications (3)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

邱仲普 #72

[225.100, 225.101)→227.942881+1.262492%

AI · MoonshotAI: Kimi K3

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark ↗
Current verifiable construction for Lighting a unit square, n = 24Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
14 · P51Historical honour · no current points

Lighting a unit square · n = 24

Published best known[215.573, 215.574)
→
Verified here218.349474
Relative improvement+1.287481%
Verified contributor
游侠#116
Solution method
AI · OpenAI: GPT-5.6 Sol
Verified

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark

Earlier certifications (3)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

邱仲普 #72

[215.573, 215.574)→218.304698+1.26671%

AI · MoonshotAI: Kimi K3

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark ↗
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.
15 · P22World #1 · currently +3

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+

Current verifiable construction for Lighting a unit square, n = 33Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
16 · P51Historical honour · no current points

Lighting a unit square · n = 33

Published best known[330.595, 330.596)
→
Verified here334.037191
Relative improvement+1.040905%
Verified contributor
Sigmoid with Codex#71
Solution method
AI · OpenAI: GPT-5.6 Sol
Verified

Review: The credited historical answer was fetched and independently checked by integer interval branch-and-bound over the whole square. Its certified intensity lower bound clears the complete three-decimal truncated source interval; this is not a finite-sampling estimate.

The external P51 benchmark and publication interval reviewed on 2026-09-05

Current verifiable construction for Unit circles in a minimum-area triangle, n = 47Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
17 · P66Historical honour · no current points

Unit circles in a minimum-area triangle · n = 47

Published best known[183.09423, 183.09424)
→
Verified here181.356482386744450603
Relative improvement+0.9491%
Verified contributor
Sigmoid with Codex#71
Solution method
AI · OpenAI: GPT-5.6 Sol
Verified

Review: The external table reports 183.09423+, while the exact site certificate 181.356482386744450603 lies strictly below the lower bound of that truncation interval regardless of the unpublished digits.

The then-current best-known value in Erich Friedman's equal-circle-in-a-triangle table

Current verifiable construction for Unit circles in a minimum-area triangle, n = 49Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
18 · P66World #1 · currently +3

Unit circles in a minimum-area triangle · n = 49

Published best known[189.655099261701514905174226831805, 189.655099261701514905174226831866]
→
Verified here187.956369504086608742
Relative improvement+0.895694%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: Exact integer verification checks all unit-circle distances, triangle containment and area, obtaining 187.956369504086608742. The triangle shape and layout differ from the external source and earlier public site construction, and the gain exceeds source precision. Submission UUID and construction hash are pinned. Global optimality is not claimed.

Graham–Lubachevsky equilateral-triangle construction, still listed by Friedman's current table as best known among arbitrary triangles; public numerical data was recovered algebraically and quantized to the nine-decimal grid here. External comparisons use a rigorous rational enclosure of the continuous area 84 + 61√3, not the outward-repaired site certificate. Improving that grid certificate is not by itself a literature breakthrough

Earlier certifications (1)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

Current verifiable construction for Consecutive dominoes in a square, n = 28Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
19 · P95World #1 · currently +3

Consecutive dominoes in a square · n = 28

Published best known126
→
Verified here125
Relative improvement+0.793651%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: Exact verification checks all consecutive-size dominoes for n = 28: the k-th piece is k by 2k, every integer-coordinate axis-aligned rectangle lies in a square of side 125, and all interiors are disjoint. Matthew Sun's construction in Friedman's table has exact integer side 126; the page was retrieved again on 2026-10-27 and its SHA-256 agrees with revision b788af5. This improves the side by one full unit, independently checked with integer rectangle tests, not decimal truncation or a container-unit conversion. This certifies improvement over that external source, not global optimality.

Matthew Sun (June 2026), Friedman's consecutive dominoes table at b788af5ef087b3a32259684155d5d7116c5160e9.

Current verifiable construction for Lighting a unit square, n = 16Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
20 · P51Historical honour · no current points

Lighting a unit square · n = 16

Published best known[124.553, 124.554)
→
Verified here125.436726
Relative improvement+0.708709%
Verified contributor
游侠#116
Solution method
AI · OpenAI: GPT-5.6 Sol
Verified

Review: The credited historical answer was fetched and independently checked by integer interval branch-and-bound over the whole square. Its certified intensity lower bound clears the complete three-decimal truncated source interval; this is not a finite-sampling estimate.

The external P51 benchmark and publication interval reviewed on 2026-09-05

Earlier certifications (2)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

Current verifiable construction for Consecutive dominoes in a square, n = 32Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
21 · P95World #1 · currently +3

Consecutive dominoes in a square · n = 32

Published best known153
→
Verified here152
Relative improvement+0.653595%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: Exact verification checks all consecutive-size dominoes for n = 32: the k-th piece is k by 2k, every integer-coordinate axis-aligned rectangle lies in a square of side 152, and all interiors are disjoint. Matthew Sun's construction in Friedman's table has exact integer side 153; the page was retrieved again on 2026-10-27 and its SHA-256 agrees with revision b788af5. This improves the side by one full unit, independently checked with integer rectangle tests, not decimal truncation or a container-unit conversion. This certifies improvement over that external source, not global optimality.

Matthew Sun (June 2026), Friedman's consecutive dominoes table at b788af5ef087b3a32259684155d5d7116c5160e9.

Current verifiable construction for Lighting a unit square, n = 17Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
22 · P51Historical honour · no current points

Lighting a unit square · n = 17

Published best known[133.907, 133.908)
→
Verified here134.776663
Relative improvement+0.648701%
Verified contributor
邱仲普#72
Solution method
AI · MoonshotAI: Kimi K3
Verified

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark

Earlier certifications (3)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

Current verifiable construction for Consecutive dominoes in a square, n = 33Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
23 · P95World #1 · currently +3

Consecutive dominoes in a square · n = 33

Published best known160
→
Verified here159
Relative improvement+0.625%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: Exact verification checks all consecutive-size dominoes for n = 33: the k-th piece is k by 2k, every integer-coordinate axis-aligned rectangle lies in a square of side 159, and all interiors are disjoint. Matthew Sun's construction in Friedman's table has exact integer side 160; the page was retrieved again on 2026-10-27 and its SHA-256 agrees with revision b788af5. This improves the side by one full unit, independently checked with integer rectangle tests, not decimal truncation or a container-unit conversion. This certifies improvement over that external source, not global optimality.

Matthew Sun (June 2026), Friedman's consecutive dominoes table at b788af5ef087b3a32259684155d5d7116c5160e9.

Current verifiable construction for Unit circles in a minimum-area triangle, n = 50Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
24 · P66Historical honour · no current points

Unit circles in a minimum-area triangle · n = 50

Published best known[194.49896, 194.49897)
→
Verified here193.3181016005745782485
Relative improvement+0.607128%
Verified contributor
Sigmoid with Codex#71
Solution method
AI · OpenAI: GPT-5.6 Sol
Verified

Review: The external table reports 194.49896+, while the exact site certificate 193.3181016005745782485 lies strictly below the lower bound of that truncation interval regardless of the unpublished digits.

The then-current best-known value in Erich Friedman's equal-circle-in-a-triangle table

Current verifiable construction for Unit circles in a minimum-area triangle, n = 41Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
25 · P66World #1 · currently +3

Unit circles in a minimum-area triangle · n = 41

Published best known[160.08329, 160.08330)
→
Verified here159.4407489094115075765
Relative improvement+0.401379%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: Exact integer verification checks all unit-circle distances, triangle containment and area, obtaining 159.4407489094115075765. The triangle shape and layout differ from the external source and earlier public site construction, and the gain exceeds source precision. Submission UUID and construction hash are pinned. Global optimality is not claimed.

Yanis Gomes (October 2026), Friedman revision e68d36c dated 2026-10-18.

Current verifiable construction for Lighting a unit square, n = 29Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
26 · P51Historical honour · no current points

Lighting a unit square · n = 29

Published best known[282.856, 282.857)
→
Verified here283.920489
Relative improvement+0.375981%
Verified contributor
游侠#116
Solution method
AI · OpenAI: GPT-5.6 Sol
Verified

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark

Earlier certifications (2)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

Current verifiable construction for Lighting a unit square, n = 32Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
27 · P51Historical honour · no current points

Lighting a unit square · n = 32

Published best known[317.203, 317.204)
→
Verified here318.204745
Relative improvement+0.315489%
Verified contributor
游侠#116
Solution method
AI · OpenAI: GPT-5.6 Sol
Verified

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark

Earlier certifications (2)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

Current verifiable construction for Lighting a unit square, n = 5Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
28 · P51Historical honour · no current points

Lighting a unit square · n = 5

Published best known[22.213, 22.214)
→
Verified here22.252208
Relative improvement+0.172%
Verified contributor
Tmrg#34
Solution method
AI · OpenAI: GPT-5.6 Sol
Verified

Review: The credited historical answer was fetched and independently checked by integer interval branch-and-bound over the whole square. Its certified intensity lower bound clears the complete three-decimal truncated source interval; this is not a finite-sampling estimate.

The external P51 benchmark and publication interval reviewed on 2026-09-05

Earlier certifications (2)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

Current verifiable construction for Lighting a unit square, n = 31Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
29 · P51Historical honour · no current points

Lighting a unit square · n = 31

Published best known[305.298, 305.299)
→
Verified here305.8207
Relative improvement+0.170882%
Verified contributor
游侠#116
Solution method
AI · OpenAI: GPT-5.6 Sol
Verified

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark

Earlier certifications (3)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

邱仲普 #72

[305.298, 305.299)→305.683836+0.126052%

AI · MoonshotAI: Kimi K3

Review: This player's pinned historical submission was retrieved and reverified by integer interval branch-and-bound over the whole square. Its exact score clears the external publication benchmark used by the prior review. UUID and construction SHA-256 are pinned. Later improvements update the showcase without another award for the same player and instance. This is neither a global optimality proof nor a claim to know unpublished digits of the external configuration.

Friedman's table rechecked on 2026-09-06; the previously reviewed three-decimal publication benchmark ↗
Current verifiable construction for Sum of radii in the unit circle, n = 47Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
30 · P92Historical honour · no current points

Sum of radii in the unit circle · n = 47

Published best known6.32779
→
Verified here6.33258684
Relative improvement+0.075727%
Verified contributor
今天#84
Solution method
AI · DeepSeek: DeepSeek V4.1 Flash
Verified

Review: The submission was retrieved and re-verified in exact integers: every circle lies in the unit disc and no two overlap, with radius sum 6.33258684, above the upper edge 6.327795 of the source's rounding interval by 0.00479184, more than 479 times the source's last-place unit 0.00001. The site's reconstruction of the source figure, locally optimised, stops at 6.3277948, in line with the printed value, so this is a better construction rather than a finer evaluation of the published one. Submission UUID and construction SHA-256 are pinned. Not a proof of global optimality.

Erich Friedman's Circles in Circles maximum-total-perimeter table, rechecked on 2026-09-29 and byte-identical to the site's archive; Jonathan Viquerat's September 2026 five-decimal value 6.32779, read as rounded to [6.327785, 6.327795]

Current verifiable construction for Unit circles in a minimum-area triangle, n = 48Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
31 · P66Historical honour · no current points

Unit circles in a minimum-area triangle · n = 48

Published best known[184.75052, 184.75053)
→
Verified here184.614248542190787528
Relative improvement+0.07376%
Verified contributor
Sigmoid with Codex#71
Solution method
AI · OpenAI: GPT-5.6 Sol
Verified

Review: The external table reports 184.75052+, while the exact site certificate 184.614248542190787528 lies strictly below the lower bound of that truncation interval regardless of the unpublished digits.

The then-current best-known value in Erich Friedman's equal-circle-in-a-triangle table

Current verifiable construction for Sum of radii in the unit circle, n = 45Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
32 · P92Historical honour · no current points

Sum of radii in the unit circle · n = 45

Published best known6.18800
→
Verified here6.192192712
Relative improvement+0.067675%
Verified contributor
今天#84
Solution method
AI · DeepSeek: DeepSeek V4.1 Flash
Verified

Review: The submission was retrieved and re-verified in exact integers: every circle lies in the unit disc and no two overlap, with radius sum 6.192192712, above the upper edge 6.188005 of the source's rounding interval by 0.004187712, more than 418 times the source's last-place unit 0.00001. The site's reconstruction of the source figure, locally optimised, stops at 6.187996093, in line with the printed value, so this is a better construction rather than a finer evaluation of the published one. Submission UUID and construction SHA-256 are pinned. Not a proof of global optimality.

Erich Friedman's Circles in Circles maximum-total-perimeter table, rechecked on 2026-09-29 and byte-identical to the site's archive; Jonathan Viquerat's September 2026 five-decimal value 6.18800, read as rounded to [6.187995, 6.188005]

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

Spreading points in a right triangle · n = 79

Published best known[0.092749672, 0.092749676]
→
Verified here0.092808874
Relative improvement+0.063826%
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.092749675936786, versus this submission's 0.092808874. 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 Sum of radii in the regular pentagon, n = 21Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
34 · P94Historical honour · no current points

Sum of radii in the regular pentagon · n = 21

Published best known[3.08715, 3.08716)
→
Verified here3.088531256
Relative improvement+0.044418%
Verified contributor
qiboqi#280
Solution method
AI · OpenAI: GPT-6 Luna
Verified

Review: Exact verification checks containment and every circle pair. The score 3.088531256 exceeds the source interval's upper edge 3.08716. 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-18T06:34:43.161Z (944f92e3-80d0-4f39-a85e-80f44f431856); 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.

Richard Wang, Friedman's cirRpen table at c20fd4e865e7e88eabbec63c4ce74b988a3a9d8f (2026-10-16).

Current verifiable construction for Sum of radii in the unit circle, n = 48Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
35 · P92Historical honour · no current points

Sum of radii in the unit circle · n = 48

Published best known6.40862
→
Verified here6.411391162
Relative improvement+0.043163%
Verified contributor
今天#84
Solution method
AI · DeepSeek: DeepSeek V4.1 Flash
Verified

Review: The submission was retrieved and re-verified in exact integers: every circle lies in the unit disc and no two overlap, with radius sum 6.411391162, above the upper edge 6.408625 of the source's rounding interval by 0.002766162, more than 276 times the source's last-place unit 0.00001. The site's reconstruction of the source figure, locally optimised, stops at 6.40861798, in line with the printed value, so this is a better construction rather than a finer evaluation of the published one. Submission UUID and construction SHA-256 are pinned. Not a proof of global optimality.

Erich Friedman's Circles in Circles maximum-total-perimeter table, rechecked on 2026-09-29 and byte-identical to the site's archive; Jonathan Viquerat's September 2026 five-decimal value 6.40862, read as rounded to [6.408615, 6.408625]

Current verifiable construction for Unit circles in a minimum-area triangle, n = 37Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
36 · P66Historical honour · no current points

Unit circles in a minimum-area triangle · n = 37

Published best known[144.93603, 144.93604)
→
Verified here144.877235000371301433
Relative improvement+0.040566%
Verified contributor
Sigmoid with Codex#71
Solution method
AI · OpenAI: GPT-5.6 Sol
Verified

Review: The external table reports 144.93603+, while the exact site certificate 144.877235000371301433 lies strictly below the lower bound of that truncation interval regardless of the unpublished digits.

The then-current best-known value in Erich Friedman's equal-circle-in-a-triangle table

Current verifiable construction for Sum of radii in the regular pentagon, n = 37Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
37 · P94Historical honour · no current points

Sum of radii in the regular pentagon · n = 37

Published best known[4.14946, 4.14947)
→
Verified here4.150872849
Relative improvement+0.033808%
Verified contributor
qiboqi#280
Solution method
AI · DeepSeek: DeepSeek V4.1 Flash 1017
Verified

Review: Exact verification checks containment and every circle pair. The score 4.150872849 exceeds the source interval's upper edge 4.14947. 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:31:04.592Z (35e90a39-abcf-4d07-9c91-8eb4c3046d9c); 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.

Joost de Winter, Friedman's cirRpen table at c20fd4e865e7e88eabbec63c4ce74b988a3a9d8f (2026-10-16).

Current verifiable construction for Sum of radii in the unit circle, n = 44Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
38 · P92Historical honour · no current points

Sum of radii in the unit circle · n = 44

Published best known6.11393
→
Verified here6.11598768
Relative improvement+0.033574%
Verified contributor
今天#84
Solution method
AI · DeepSeek: DeepSeek V4.1 Flash
Verified

Review: The submission was retrieved and re-verified in exact integers: every circle lies in the unit disc and no two overlap, with radius sum 6.11598768, above the upper edge 6.113935 of the source's rounding interval by 0.00205268, more than 205 times the source's last-place unit 0.00001. The site's reconstruction of the source figure, locally optimised, stops at 6.11393115, in line with the printed value, so this is a better construction rather than a finer evaluation of the published one. Submission UUID and construction SHA-256 are pinned. Not a proof of global optimality.

Erich Friedman's Circles in Circles maximum-total-perimeter table, rechecked on 2026-09-29 and byte-identical to the site's archive; Jonathan Viquerat's September 2026 five-decimal value 6.11393, read as rounded to [6.113925, 6.113935]

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

Sum of radii in the regular pentagon · n = 34

Published best known[3.97647, 3.97648)
→
Verified here3.977640276
Relative improvement+0.029178%
Verified contributor
zzzcy#308
Solution method
AI · OpenAI: GPT-6 Astra
Verified

Review: Exact verification checks containment and every circle pair. The score 3.977640276 exceeds the source interval's upper edge 3.97648. 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:10:33.738Z (18e9a7e5-7c96-48ef-8be8-e5d9436ca515); 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.

Richard Wang, Friedman's cirRpen table at c20fd4e865e7e88eabbec63c4ce74b988a3a9d8f (2026-10-16).

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

Sum of radii in the regular pentagon · n = 50

Published best known[4.86154, 4.86155)
→
Verified here4.862887127
Relative improvement+0.027504%
Verified contributor
zzzcy#308
Solution method
AI · OpenAI: GPT-6 Astra
Verified

Review: Exact verification checks containment and every circle pair. The score 4.862887127 exceeds the source interval's upper edge 4.86155. 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:08:59.353Z (06486ef7-bf72-45f8-94ed-af9cd59cafe8); 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 Sum of radii in the regular pentagon, n = 43Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
41 · P94World #1 · currently +3

Sum of radii in the regular pentagon · n = 43

Published best known[4.49633, 4.49634)
→
Verified here4.497460336
Relative improvement+0.024917%
Verified contributor
zzzcy#308
Solution method
AI · OpenAI: GPT-6 Astra
Verified

Review: Exact verification checks containment and every circle pair. The score 4.497460336 exceeds the source interval's upper edge 4.49634. 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:10:42.748Z (e4c2adf5-c2e6-41ae-afbf-91e01cfbeb41); 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.

Richard Wang, Friedman's cirRpen table at c20fd4e865e7e88eabbec63c4ce74b988a3a9d8f (2026-10-16).

Current verifiable construction for Sum of radii in the unit circle, n = 49Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
42 · P92Historical honour · no current points

Sum of radii in the unit circle · n = 49

Published best known6.47331
→
Verified here6.474803193
Relative improvement+0.02299%
Verified contributor
今天#84
Solution method
AI · DeepSeek: DeepSeek V4.1 Flash
Verified

Review: The submission was retrieved and re-verified in exact integers: every circle lies in the unit disc and no two overlap, with radius sum 6.474803193, above the upper edge 6.473315 of the source's rounding interval by 0.001488193, more than 148 times the source's last-place unit 0.00001. The site's reconstruction of the source figure, locally optimised, stops at 6.473314965, in line with the printed value, so this is a better construction rather than a finer evaluation of the published one. Submission UUID and construction SHA-256 are pinned. Not a proof of global optimality.

Erich Friedman's Circles in Circles maximum-total-perimeter table, rechecked on 2026-09-29 and byte-identical to the site's archive; Jonathan Viquerat's September 2026 five-decimal value 6.47331, read as rounded to [6.473305, 6.473315]

Current verifiable construction for Sum of radii in the unit circle, n = 46Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
43 · P92Historical honour · no current points

Sum of radii in the unit circle · n = 46

Published best known6.26015
→
Verified here6.261387886
Relative improvement+0.019694%
Verified contributor
今天#84
Solution method
AI · DeepSeek: DeepSeek V4.1 Flash
Verified

Review: The submission was retrieved and re-verified in exact integers: every circle lies in the unit disc and no two overlap, with radius sum 6.261387886, above the upper edge 6.260155 of the source's rounding interval by 0.001232886, more than 123 times the source's last-place unit 0.00001. The site's reconstruction of the source figure, locally optimised, stops at 6.260153261, in line with the printed value, so this is a better construction rather than a finer evaluation of the published one. Submission UUID and construction SHA-256 are pinned. Not a proof of global optimality.

Erich Friedman's Circles in Circles maximum-total-perimeter table, rechecked on 2026-09-29 and byte-identical to the site's archive; Jonathan Viquerat's September 2026 five-decimal value 6.26015, read as rounded to [6.260145, 6.260155]

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

Sum of radii in the regular pentagon · n = 39

Published best known[4.26611, 4.26612)
→
Verified here4.266929454
Relative improvement+0.018974%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: Exact verification checks containment and every circle pair. The score 4.266929454 exceeds the source interval's upper edge 4.26612. 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-26T22:14:17.581Z (b0de66f0-7ede-4981-9186-2a7b05b17ca7); 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).

Earlier certifications (1)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

qiboqi #280

[4.26611, 4.26612)→4.266582747+0.010847%

AI · DeepSeek: DeepSeek V4.1 Flash 1017

Review: Exact verification checks containment and every circle pair. The score 4.266582747 exceeds the source interval's upper edge 4.26612. 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:31:44.691Z (34b606dc-ab5a-4ae0-8ec4-903da28b0518); 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 = 67Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
45 · P16World #1 · currently +3

Spreading points in a right triangle · n = 67

Published best known[0.101656407, 0.101656411]
→
Verified here0.101672983
Relative improvement+0.016302%
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.101656410685817, versus this submission's 0.101672983. 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 Sum of radii in the unit circle, n = 50Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
46 · P92Historical honour · no current points

Sum of radii in the unit circle · n = 50

Published best known6.53814
→
Verified here6.538814808
Relative improvement+0.010168%
Verified contributor
Tmrg#34
Solution method
AI · OpenAI: GPT-5.6 Sol
Verified

Review: The submission was retrieved and re-verified in exact integers: every circle lies in the unit disc and no two overlap, with radius sum 6.538814808, above the upper edge 6.53815 of the source's truncation interval by 0.000664808. The source's new figure, rebuilt and optimised without a cap, reaches only 6.538140455, and the site's earlier certified construction is 6.53847458, so this is a different and better construction. Submission UUID and construction SHA-256 are pinned. Not a proof of global optimality.

Joost de Winter's 6.53814+ in Erich Friedman's Circles in Circles maximum-total-perimeter table, revision 948f738 of 2026-10-01, read as the truncation [6.53814, 6.53815)

Earlier certifications (1)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

今天 #84

6.53486→6.53847458+0.055236%

AI · DeepSeek: DeepSeek V4.1 Flash

Review: The submission was retrieved and re-verified in exact integers: every circle lies in the unit disc and no two overlap, with radius sum 6.53847458, above the upper edge 6.534865 of the source's rounding interval by 0.00360958, more than 360 times the source's last-place unit 0.00001. The site's reconstruction of the source figure, locally optimised, stops at 6.534856438, in line with the printed value, so this is a better construction rather than a finer evaluation of the published one. Submission UUID and construction SHA-256 are pinned. Not a proof of global optimality.

Erich Friedman's Circles in Circles maximum-total-perimeter table, rechecked on 2026-09-29 and byte-identical to the site's archive; Jonathan Viquerat's September 2026 five-decimal value 6.53486, read as rounded to [6.534855, 6.534865] ↗
Current verifiable construction for Sum of radii in the unit circle, n = 43Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
47 · P92Historical honour · no current points

Sum of radii in the unit circle · n = 43

Published best known6.04710
→
Verified here6.047611212
Relative improvement+0.008371%
Verified contributor
今天#84
Solution method
AI · DeepSeek: DeepSeek V4.1 Flash
Verified

Review: The submission was retrieved and re-verified in exact integers: every circle lies in the unit disc and no two overlap, with radius sum 6.047611212, above the upper edge 6.047105 of the source's rounding interval by 0.000506212, more than 50 times the source's last-place unit 0.00001. The site's reconstruction of the source figure, locally optimised, stops at 6.047099045, in line with the printed value, so this is a better construction rather than a finer evaluation of the published one. Submission UUID and construction SHA-256 are pinned. Not a proof of global optimality.

Erich Friedman's Circles in Circles maximum-total-perimeter table, rechecked on 2026-09-29 and byte-identical to the site's archive; Jonathan Viquerat's September 2026 five-decimal value 6.04710, read as rounded to [6.047095, 6.047105]

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

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

Published best known[0.074650064653203468911088811073, 0.074650064653203468911088811075]
→
Verified here0.074656018
Relative improvement+0.007975%
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.0746500646532039, versus this submission's 0.074656018. 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 (2010-08-10) for this row. It does not mark this row proved

Current verifiable construction for Equal circles in regular polygons, m = 6 · n = 32Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
49 · P82World #1 · currently +3

Equal circles in regular polygons · m = 6 · n = 32

Published best known[0.142897923361, 0.142897923363]
→
Verified here0.142908786
Relative improvement+0.007602%
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.142897923361914, versus this submission's 0.142908786. 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=6, n=32. Eckard Specht, program chx , 2020. Coordinates imported from the public archive, normalized, decimalized and exactly verified by MinMax Arena. The web-table target and grid certificate are separate.

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

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

Published best known[0.094253176330946132819167496309, 0.094253176330946132819167496311]
→
Verified here0.094258979
Relative improvement+0.006156%
Verified contributor
condor#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.0942531763309471, versus this submission's 0.094258979. 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 Equal circles in regular polygons, m = 5 · n = 84Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
51 · P82World #1 · currently +3

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

Published best known[0.085582245061, 0.085582245063]
→
Verified here0.085585804
Relative improvement+0.004158%
Verified contributor
condor#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.0855822450624038, versus this submission's 0.085585804. 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=84. 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 Equal-circle packing in a 2:1 rectangle, n = 98Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
52 · P12World #1 · currently +3

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

Published best known[0.072953911558221449942068202613, 0.072953911558221449942068202615]
→
Verified here0.072956792
Relative improvement+0.003948%
Verified contributor
condor#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.0729539137019705, versus this submission's 0.072956792. 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 (2010-08-10) for this row. It does not mark this row proved

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

Spreading points in a right triangle · n = 97

Published best known[0.083053857, 0.083053861]
→
Verified here0.083057101
Relative improvement+0.003901%
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.0830538600234432, versus this submission's 0.083057101. 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 Equal circles in regular polygons, m = 6 · n = 64Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
54 · P82World #1 · currently +3

Equal circles in regular polygons · m = 6 · n = 64

Published best known[0.102994077926, 0.102994077928]
→
Verified here0.102996845
Relative improvement+0.002687%
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.102994077927285, versus this submission's 0.102996845. 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=6, n=64. Eckard Specht, program chx , 2020. 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 = 68Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
55 · P16World #1 · currently +3

Spreading points in a right triangle · n = 68

Published best known[0.100821638, 0.100821642]
→
Verified here0.100823641
Relative improvement+0.001983%
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.100821641235024, versus this submission's 0.100823641. 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 Claudia Orquídea López Soto (2011-02-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 = 84Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
56 · P16World #1 · currently +3

Spreading points in a right triangle · n = 84

Published best known[0.08973367, 0.089733674]
→
Verified here0.089735308
Relative improvement+0.001821%
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.0897336733173229, versus this submission's 0.089735308. 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 Equal-circle packing in a 2:1 rectangle, n = 99Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
57 · P12World #1 · currently +3

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

Published best known[0.072722189838708902296193015799, 0.072722189838708902296193015801]
→
Verified here0.07272326
Relative improvement+0.001472%
Verified contributor
condor#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.0727221898387089, versus this submission's 0.07272326. 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 (2010-08-02) for this row. It does not mark this row proved

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

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

Published best known[0.085860123235459322002145865519, 0.085860123235459322002145865521]
→
Verified here0.085861206
Relative improvement+0.001261%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6 Astra
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.085860127770187, versus this submission's 0.085861206. 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 (2010-08-10) for this row. It does not mark this row proved

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

Spreading points in a right triangle · n = 99

Published best known[0.082104661, 0.082104665]
→
Verified here0.082105532
Relative improvement+0.001056%
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.0821046647304108, versus this submission's 0.082105532. 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 = 98Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
60 · 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.
61 · 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.
62 · 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.
63 · 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.
64 · 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-circle packing in a 2:1 rectangle, n = 43Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
65 · P12World #1 · currently +3

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

Published best known[0.111127536806771415133434209993, 0.111127536806771415133434209995]
→
Verified here0.111128039
Relative improvement+0.000452%
Verified contributor
condor#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.111127536806773, versus this submission's 0.111128039. 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 David W. Cantrell (2010-08-02) for this row. It does not mark this row proved

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.
66 · P82World #1 · currently +3

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.
67 · 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.
68 · 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 Equal-circle packing in a 2:1 rectangle, n = 74Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
69 · P12World #1 · currently +3

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

Published best known[0.083415658368313294043850229337, 0.083415658368313294043850229339]
→
Verified here0.083415857
Relative improvement+0.000238%
Verified contributor
condor#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.0834156583683133, versus this submission's 0.083415857. 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 Equal-circle packing in a 2:1 rectangle, n = 57Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
70 · P12World #1 · currently +3

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

Published best known[0.095307426822987297251292693015, 0.095307426822987297251292693017]
→
Verified here0.095307613
Relative improvement+0.000195%
Verified contributor
condor#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.0953074268229878, versus this submission's 0.095307613. 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 David W. Cantrell (2010-08-30) for this row. It does not mark this row proved

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

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

Published best known[0.095707426403254254068587403303, 0.095707426403254254068587403305]
→
Verified here0.09570761
Relative improvement+0.000192%
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.0957074264032557, versus this submission's 0.09570761. 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 The most separated family of subspaces, d = 5, n = 19Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
72 · P64Historical honour · no current points

The most separated family of subspaces · d = 5, n = 19

Published best known[1.1761278309, 1.1761278310]
→
Verified here1.176128991
Relative improvement+0.000099%
Verified contributor
邱仲普#72
Solution method
AI · OpenAI: GPT-5.6 Sol
Verified

Review: A later, stronger snapshot of the same player and instance (originally certified at 1.17612899). The bases were reverified by exact rational orthogonal projection and still clear the table's ten-place round-down interval. It updates the showcase without a repeat award.

Rechecked on 2026-10-02: Cohn's public Grassmannian table is unchanged since the 2026-09-05 review

Earlier certifications (1)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

邱仲普 #72

[1.1761278309, 1.1761278310]→1.17612899+0.000099%

AI · MoonshotAI: Kimi K3

Review: The historical bases were reverified through exact rational orthogonal projectors. The minimum squared chordal distance exceeds the entire ten-decimal downward-truncated source interval. A small percentage is not an automatic rejection; the benchmark is the actual published value, not a degraded nine-place reconstruction.

The external P64 benchmark and publication interval reviewed on 2026-09-05 ↗
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.
73 · 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.
74 · 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.
75 · 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 most separated family of subspaces, d = 5, n = 20Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
76 · P64Historical honour · no current points

The most separated family of subspaces · d = 5, n = 20

Published best known[1.1619417514, 1.1619417515]
→
Verified here1.161941835
Relative improvement+0.000007%
Verified contributor
邱仲普#72
Solution method
AI · OpenAI: GPT-5.6 Sol
Verified

Review: A later, stronger snapshot of the same player and instance (originally certified at 1.161941835). The bases were reverified by exact rational orthogonal projection and still clear the table's ten-place round-down interval. It updates the showcase without a repeat award.

Rechecked on 2026-10-02: Cohn's public Grassmannian table is unchanged since the 2026-09-05 review

Earlier certifications (1)

These snapshots preserve the original scores, benchmark sources, and contributors. Historical honours remain permanently; live points apply only to an eligible current holder and do not stack across multiple reviews.

邱仲普 #72

[1.1619417514, 1.1619417515]→1.161941835+0.000007%

AI · MoonshotAI: Kimi K3

Review: The historical bases were reverified through exact rational orthogonal projectors. The minimum squared chordal distance exceeds the entire ten-decimal downward-truncated source interval. A small percentage is not an automatic rejection; the benchmark is the actual published value, not a degraded nine-place reconstruction.

The external P64 benchmark and publication interval reviewed on 2026-09-05 ↗