BREAKTHROUGH REVIEW

Breakthrough review

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

Verified breakthroughs131
Pending candidates112
Problem families16
CLAIM POLICY

Certification standards

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

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

VERIFIED ACHIEVEMENTS

Verified breakthroughs

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

Current verifiable construction for Lighting a unit square, n = 31Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
121 · 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 Lighting a unit square, n = 20Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
122 · 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 = 18Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
123 · 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 = 35Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
124 · 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 = 33Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
125 · 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 Lighting a unit square, n = 16Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
126 · 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 Lighting a unit square, n = 5Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
127 · 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 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.
128 · 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 = 50Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
129 · 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 = 48Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
130 · 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 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.
131 · 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