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 = 43Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
37 · P12World #1 · currently +3

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

Published best known[0.111127536806771415133434209993, 0.111127536806771415133434209995]
→
Verified here0.11112873
Relative improvement+0.001074%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 0.11112873 clears the conservative published upper endpoint 0.111127536806771415133434209995. Two source-only local starts were checked against all pairs and walls; the best numerically feasible refined radius is about 0.11112753680677. Matching container symmetries and circle permutations leaves maximum displacement 0.007128, with 12 near-contact pairs removed and 4 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-02) 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.111127536806771415133434209993, 0.111127536806771415133434209995]→0.111128039+0.000452%

AI · OpenAI: GPT-6.1 Sol

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

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

Published best known[0.104530388091175692588349823739, 0.104530388091175692588349823741]
→
Verified here0.104531506
Relative improvement+0.001069%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 0.104531506 clears the conservative published upper endpoint 0.104530388091175692588349823741. Two source-only local starts were checked against all pairs and walls; the best numerically feasible refined radius is about 0.10453038809118. Matching container symmetries and circle permutations leaves maximum displacement 0.0372, with 7 near-contact pairs removed and 18 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 circles in regular polygons, m = 6 · n = 95Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
39 · P82Historical honour · no current points

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

Published best known[0.085401704333, 0.085401704342]
→
Verified here0.085402533
Relative improvement+0.00097%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 0.085402533 clears the conservative published upper endpoint 0.085401704342. Two source-only local starts were checked against all pairs and walls; the best numerically feasible refined radius is about 0.085401706328934. Matching container symmetries and circle permutations leaves maximum displacement 0.02227, with 6 near-contact pairs removed and 19 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=95. 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.085401704341 and its radius.txt 0.085401704334; they agree to nine decimals, and the comparison window covers both.

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

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

Published best known[0.089648390876, 0.08964839094]
→
Verified here0.089648861
Relative improvement+0.000524%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 0.089648861 clears the conservative published upper endpoint 0.08964839094. Two source-only local starts were checked against all pairs and walls; the best numerically feasible refined radius is about 0.089648452428751. Matching container symmetries and circle permutations leaves maximum displacement 0.09398, with 7 near-contact pairs removed and 18 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=89. 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.089648390877 and its radius.txt 0.089648390939; they agree to nine decimals, and the comparison window covers both.

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

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

Published best known[0.089885244873, 0.089885244875]
→
Verified here0.089885662
Relative improvement+0.000464%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

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

Packomania (compiled by Eckard Specht), m=5, n=76. 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 = 68Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
42 · P12World #1 · currently +3

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

Published best known[0.086402531473385728267242717167, 0.086402531473385728267242717169]
→
Verified here0.086402894
Relative improvement+0.00042%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 0.086402894 clears the conservative published upper endpoint 0.086402531473385728267242717169. Two source-only local starts were checked against all pairs and walls; the best numerically feasible refined radius is about 0.086402531473386. Matching container symmetries and circle permutations leaves maximum displacement 0.03266, 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'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 = 74Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
43 · P12Historical honour · no current points

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

Published best known[0.083415658368313294043850229337, 0.083415658368313294043850229339]
→
Verified here0.083416007
Relative improvement+0.000418%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 0.083416007 clears the conservative published upper endpoint 0.083415658368313294043850229339. Two source-only local starts were checked against all pairs and walls; the best numerically feasible refined radius is about 0.083415658368313. Matching container symmetries and circle permutations leaves maximum displacement 0.03195, with 2 near-contact pairs removed and 14 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

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.083415658368313294043850229337, 0.083415658368313294043850229339]→0.083415857+0.000238%

AI · OpenAI: GPT-6.1 Sol

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 = 56Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
44 · P12World #1 · currently +3

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

Published best known[0.095707426403254254068587403303, 0.095707426403254254068587403305]
→
Verified here0.095707714
Relative improvement+0.0003%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 0.095707714 clears the conservative published upper endpoint 0.095707426403254254068587403305. Two source-only local starts were checked against all pairs and walls; the best numerically feasible refined radius is about 0.095707426403254. Matching container symmetries and circle permutations leaves maximum displacement 0.01759, with 10 near-contact pairs removed and 9 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

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.

Joost de Winter #338

[0.095707426403254254068587403303, 0.095707426403254254068587403305]→0.09570761+0.000192%

AI · OpenAI: GPT-6.1 Sol

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 Equal circles in regular polygons, m = 5 · n = 94Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
45 · P82World #1 · currently +3

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

Published best known[0.081226027423, 0.081226027425]
→
Verified here0.08122619
Relative improvement+0.0002%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

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

Packomania (compiled by Eckard Specht), m=5, n=94. Paolo Amore, Circle packing in regular polygons , Phys. Fluids 35 , 027130 (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 = 95Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
46 · P12World #1 · currently +3

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

Published best known[0.074082674926603509994936117233, 0.074082674926603509994936117235]
→
Verified here0.074082757
Relative improvement+0.000111%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 0.074082757 clears the conservative published upper endpoint 0.074082674926603509994936117235. Two source-only local starts were checked against all pairs and walls; the best numerically feasible refined radius is about 0.074082677375908. Matching container symmetries and circle permutations leaves maximum displacement 0.01488, with 8 near-contact pairs removed and 8 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-04) 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 = 182Left: the sub-problem's current record construction. Right: the pinned score and contributor from the certified breakthrough.
47 · P06Historical honour · no current points

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

Published best known[1500.63202640285, 1500.63202640295]
→
Verified here1500.6309406
Relative improvement+0.000072%
Verified contributor
condor#338
Solution method
AI · OpenAI: GPT-6.1 Sol
Verified

Review: The exact certificate 1500.6309406 is below the conservative published lower endpoint 1500.63202640285. Two local refinements from Packomania's public coordinates remain near 1500.6320264036, with every pair and boundary rechecked. Matching the distinct radii and container symmetries leaves maximum displacement 0.1233 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-circle packing in a 2:1 rectangle, n = 85Left: 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 = 85

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

Review: The exact certificate 0.078713512 clears the conservative published upper endpoint 0.078713466124604292987915660893. Two source-only local starts were checked against all pairs and walls; the best numerically feasible refined radius is about 0.078713466125424. Matching container symmetries and circle permutations leaves maximum displacement 0.03255, with 21 near-contact pairs removed and 29 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-04) for this row. It does not mark this row proved