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 Consecutive dominoes in a square, n = 27Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
01 · P95World #1 · currently +3

Consecutive dominoes in a square · n = 27

Published best known119
→
Verified here118
Relative improvement+0.840336%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The existing exact verifier accepts the certificate; an independent integer-rectangle check verifies every boundary and pairwise separation. The side decreases by a full unit from the then-published 119 to 118. Submission 2026-10-27T06:56:41.879Z predates Friedman's 2026-11-08 update. Later publication of the same value under Yanis Gomes does not revoke this historical result or establish that the account and external author are the same person.

Compiled by Erich Friedman (Consecutive Dominoes in Squares); found by Matthew Sun (June 2026). The published value is cited without reconstructing its configuration; the starter is the site's ordinary shelf packing, not the external record.

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

Consecutive dominoes in a square · n = 30

Published best known139
→
Verified here138
Relative improvement+0.719424%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The existing exact verifier accepts the certificate; an independent integer-rectangle check verifies every boundary and pairwise separation. The side decreases by a full unit from the then-published 139 to 138. Submission 2026-10-27T07:27:24.996Z predates Friedman's 2026-11-08 update. Later publication of the same value under Yanis Gomes does not revoke this historical result or establish that the account and external author are the same person.

Compiled by Erich Friedman (Consecutive Dominoes in Squares); found by Matthew Sun (June 2026). The published value is cited without reconstructing its configuration; the starter is the site's ordinary shelf packing, not the external record.

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

Consecutive dominoes in a square · n = 31

Published best known146
→
Verified here145
Relative improvement+0.684932%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The existing exact verifier accepts the certificate; an independent integer-rectangle check verifies every boundary and pairwise separation. The side decreases by a full unit from the then-published 146 to 145. Submission 2026-10-27T06:36:47.075Z predates Friedman's 2026-11-08 update. Later publication of the same value under Yanis Gomes does not revoke this historical result or establish that the account and external author are the same person.

Compiled by Erich Friedman (Consecutive Dominoes in Squares); found by Matthew Sun (June 2026). The published value is cited without reconstructing its configuration; the starter is the site's ordinary shelf packing, not the external record.

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

Consecutive dominoes in a square · n = 34

Published best known167
→
Verified here166
Relative improvement+0.598802%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The existing exact verifier accepts the certificate; an independent integer-rectangle check verifies every boundary and pairwise separation. The side decreases by a full unit from the then-published 167 to 166. Submission 2026-10-27T07:42:35.990Z predates Friedman's 2026-11-08 update. Later publication of the same value under Yanis Gomes does not revoke this historical result or establish that the account and external author are the same person.

Compiled by Erich Friedman (Consecutive Dominoes in Squares); found by Matthew Sun (June 2026). The published value is cited without reconstructing its configuration; the starter is the site's ordinary shelf packing, not the external record.

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

Consecutive dominoes in a square · n = 36

Published best known182
→
Verified here181
Relative improvement+0.549451%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The existing exact verifier accepts the certificate; an independent integer-rectangle check verifies every boundary and pairwise separation. The side decreases by a full unit from the then-published 182 to 181. Submission 2026-10-27T06:56:58.853Z predates Friedman's 2026-11-08 update. Later publication of the same value under Yanis Gomes does not revoke this historical result or establish that the account and external author are the same person.

Compiled by Erich Friedman (Consecutive Dominoes in Squares); found by Matthew Sun (June 2026). The published value is cited without reconstructing its configuration; the starter is the site's ordinary shelf packing, not the external record.

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

Consecutive dominoes in a square · n = 38

Published best known197
→
Verified here196
Relative improvement+0.507614%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The existing exact verifier accepts the certificate; an independent integer-rectangle check verifies every boundary and pairwise separation. The side decreases by a full unit from the then-published 197 to 196. Submission 2026-10-27T06:43:34.307Z predates Friedman's 2026-11-08 update. Later publication of the same value under Yanis Gomes does not revoke this historical result or establish that the account and external author are the same person.

Compiled by Erich Friedman (Consecutive Dominoes in Squares); found by Matthew Sun (June 2026). The published value is cited without reconstructing its configuration; the starter is the site's ordinary shelf packing, not the external record.

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.
07 · P12Historical honour · no current points

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

Published best known[0.085860123235459322002145865519, 0.085860123235459322002145865521]
→
Verified here0.086009769
Relative improvement+0.17429%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 0.086009769 clears the conservative published upper endpoint 0.085860123235459322002145865521. Two source-only local starts were checked against all pairs and walls; the best numerically feasible refined radius is about 0.085860127770187. Matching container symmetries and circle permutations leaves maximum displacement 0.08486, with 8 near-contact pairs removed and 50 added, supporting a changed arrangement. Local search is a diagnostic against simple polishing, not 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

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.

condor #338

[0.085860123235459322002145865519, 0.085860123235459322002145865521]→0.085861206+0.001261%

AI · OpenAI: GPT-6 Astra

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

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

Published best known[0.087245798944625048419650008581, 0.087245798944625048419650008583]
→
Verified here0.087330501
Relative improvement+0.097084%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 0.087330501 clears the conservative published upper endpoint 0.087245798944625048419650008583. Two source-only local starts were checked against all pairs and walls; the best numerically feasible refined radius is about 0.087245799108573. Matching container symmetries and circle permutations leaves maximum displacement 0.1253, with 22 near-contact pairs removed and 41 added, supporting a changed arrangement. Local search is a diagnostic against simple polishing, not 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-circle packing in a 2:1 rectangle, n = 50Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
09 · P12World #1 · currently +3

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

Published best known[0.100284574942278589507736509305, 0.100284574942278589507736509307]
→
Verified here0.100355834
Relative improvement+0.071057%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 0.100355834 clears the conservative published upper endpoint 0.100284574942278589507736509307. Two source-only local starts were checked against all pairs and walls; the best numerically feasible refined radius is about 0.10028457494228. Matching container symmetries and circle permutations leaves maximum displacement 0.03302, with 5 near-contact pairs removed and 12 added, supporting a changed arrangement. Local search is a diagnostic against simple polishing, not 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-11) for this row. It does not mark this row proved

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

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

Published best known[0.101004283938801899632894910957, 0.101004283938801899632894910959]
→
Verified here0.101052887
Relative improvement+0.04812%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 0.101052887 clears the conservative published upper endpoint 0.101004283938801899632894910959. Two source-only local starts were checked against all pairs and walls; the best numerically feasible refined radius is about 0.1010042839388. Matching container symmetries and circle permutations leaves maximum displacement 0.1115, with 12 near-contact pairs removed and 25 added, supporting a changed arrangement. Local search is a diagnostic against simple polishing, not 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-11) for this row. It does not mark this row proved

Current verifiable construction for Packing circles of radius 1,2,…,n into a circle, n = 114Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
11 · P06World #1 · currently +3

Packing circles of radius 1,2,…,n into a circle · n = 114

Published best known[748.71798398835, 748.71798398845]
→
Verified here748.44765249
Relative improvement+0.036106%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 748.44765249 is below the conservative published lower endpoint 748.71798398835. Two local refinements from Packomania's public coordinates remain near 748.71798398872, with every pair and boundary rechecked. Matching the distinct radii and container symmetries leaves maximum displacement 1.816 in normalized container units, supporting a changed arrangement rather than coordinate rounding. Public record chronology identifies the initial site construction; later last-digit variants are not separately certified. No global optimality is claimed.

Packomania's ccin ratio table and public coordinates (Eckard Specht); the source precision is preserved and the coordinates are conservatively repaired to the site's nine-place grid

Current verifiable construction for Packing circles of radius 1,2,…,n into a square, n = 57Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
12 · P13World #1 · currently +3

Packing circles of radius 1,2,…,n into a square · n = 57

Published best known[476.35774828805, 476.35774828815]
→
Verified here476.186836137
Relative improvement+0.035879%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 476.186836137 is below the conservative published lower endpoint 476.35774828805. Two local refinements from Packomania's public coordinates remain near 476.35774828844, with every pair and boundary rechecked. Matching the distinct radii and container symmetries leaves maximum displacement 0.9809 in normalized container units, supporting a changed arrangement rather than coordinate rounding. Public record chronology identifies the initial site construction; later last-digit variants are not separately certified. No global optimality is claimed.

Packomania's csqn table, compiled by Eckard Specht, keeps the best known packings of circles with radii 1, 2, …, N in a square; its ratio column is the square's side when the smallest radius is 1, which is this problem's score. The table cites André Müller (2025-12) for this row. It does not mark this row proved