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

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

Published best known[0.082675955280458478509993165587, 0.082675955280458478509993165589]
→
Verified here0.082676003
Relative improvement+0.000058%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 0.082676003 clears the conservative published upper endpoint 0.082675955280458478509993165589. Two source-only local starts were checked against all pairs and walls; the best numerically feasible refined radius is about 0.082675955280458. Matching container symmetries and circle permutations leaves maximum displacement 0.1663, with 36 near-contact pairs removed and 44 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 (1999–2010) for this row. It does not mark this row proved

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

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

Published best known[551.96174627795, 551.96174627805]
→
Verified here551.961451436
Relative improvement+0.000053%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 551.961451436 is below the conservative published lower endpoint 551.96174627795. Two local refinements from Packomania's public coordinates remain near 551.96174627848, with every pair and boundary rechecked. Matching the distinct radii and container symmetries leaves maximum displacement 0.1264 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

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

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

Published best known[919.85237399075, 919.85237399085]
→
Verified here919.851975765
Relative improvement+0.000043%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 919.851975765 is below the conservative published lower endpoint 919.85237399075. Two local refinements from Packomania's public coordinates remain near 919.85237399153, with every pair and boundary rechecked. Matching the distinct radii and container symmetries leaves maximum displacement 0.07958 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

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

Equal circles in regular polygons · m = 8 · n = 41

Published best known[0.131274622861, 0.131274622863]
→
Verified here0.131274675
Relative improvement+0.00004%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 0.131274675 clears the conservative published upper endpoint 0.131274622863. Two source-only local starts were checked against all pairs and walls; the best numerically feasible refined radius is about 0.13127462286529. Matching container symmetries and circle permutations leaves maximum displacement 0.04965, with 2 near-contact pairs removed and 2 added, supporting a changed arrangement. Local search is a diagnostic against simple polishing, not a global optimality proof.

Packomania (compiled by Eckard Specht), m=8, n=41. Eckard Specht, program coc , 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 Packing circles of radius 1,2,…,n into a circle, n = 54Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
53 · P06World #1 · currently +3

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

Published best known[247.53347072865, 247.53347072875]
→
Verified here247.533398379
Relative improvement+0.000029%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 247.533398379 is below the conservative published lower endpoint 247.53347072865. Two local refinements from Packomania's public coordinates remain near 247.53347072925, with every pair and boundary rechecked. Matching the distinct radii and container symmetries leaves maximum displacement 0.268 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 = 74Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
54 · P13World #1 · currently +3

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

Published best known[700.07037936745, 700.07037936755]
→
Verified here700.070209207
Relative improvement+0.000024%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 700.070209207 is below the conservative published lower endpoint 700.07037936745. Two local refinements from Packomania's public coordinates remain near 700.07037936591, with every pair and boundary rechecked. Matching the distinct radii and container symmetries leaves maximum displacement 0.1529 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

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

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

Published best known[1285.02343179275, 1285.02343179285]
→
Verified here1285.023161894
Relative improvement+0.000021%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 1285.023161894 is below the conservative published lower endpoint 1285.02343179275. Two local refinements from Packomania's public coordinates remain near 1285.0234317931, with every pair and boundary rechecked. Matching the distinct radii and container symmetries leaves maximum displacement 0.06424 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 Equal circles in regular polygons, m = 6 · n = 84Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
56 · P82Historical honour · no current points

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

Published best known[0.090914418972, 0.090914418977]
→
Verified here0.090914433
Relative improvement+0.000015%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 0.090914433 clears the conservative published upper endpoint 0.090914418977. Two source-only local starts were checked against all pairs and walls; the best numerically feasible refined radius is about 0.090914419721265. Matching container symmetries and circle permutations leaves maximum displacement 0.007488, with 4 near-contact pairs removed and 17 added, supporting a changed arrangement. Local search is a diagnostic against simple polishing, not a global optimality proof.

Packomania (compiled by Eckard Specht), m=6, n=84. 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. The table prints 0.090914418976 and its radius.txt 0.090914418973; they agree to nine decimals, and the comparison window covers both.

Current verifiable construction for Equal-circle packing in a 2:1 rectangle, n = 71Left: 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 = 71

Published best known[0.084786483236749812260700356137, 0.084786483236749812260700356139]
→
Verified here0.084786494
Relative improvement+0.000013%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 0.084786494 clears the conservative published upper endpoint 0.084786483236749812260700356139. Two source-only local starts were checked against all pairs and walls; the best numerically feasible refined radius is about 0.084786483236751. Matching container symmetries and circle permutations leaves maximum displacement 0.02713, with 0 near-contact pairs removed and 16 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 (2011-03-19) 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 = 81Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
58 · P06World #1 · currently +3

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

Published best known[450.85434636925, 450.85434636935]
→
Verified here450.854302774
Relative improvement+0.00001%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 450.854302774 is below the conservative published lower endpoint 450.85434636925. Two local refinements from Packomania's public coordinates remain near 450.85434636948, with every pair and boundary rechecked. Matching the distinct radii and container symmetries leaves maximum displacement 0.138 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 = 98Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
59 · P13World #1 · currently +3

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

Published best known[1060.87139067085, 1060.87139067095]
→
Verified here1060.871358342
Relative improvement+0.000003%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 1060.871358342 is below the conservative published lower endpoint 1060.87139067085. Two local refinements from Packomania's public coordinates remain near 1060.8713906713, with every pair and boundary rechecked. Matching the distinct radii and container symmetries leaves maximum displacement 0.07437 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

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

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

Published best known[920.08786490575, 920.08786490585]
→
Verified here920.087837345
Relative improvement+0.000003%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 920.087837345 is below the conservative published lower endpoint 920.08786490575. Two local refinements from Packomania's public coordinates remain near 920.08786490608, with every pair and boundary rechecked. Matching the distinct radii and container symmetries leaves maximum displacement 0.0849 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