P92 · Packing and covering · Classic · Hard

Sum of radii in the unit circle · n = 25

Place n non-overlapping circles of independently chosen radii inside a disc of radius 1 so as to maximise the sum of their radii.

Instancen = 25
ObjectiveMaximize the sum of the radii

Record comparison

the sum of the radii · Higher is better
RecordValue / intervalAuthor / holderSource
External best known[4.564, 4.565]See source attributionErich Friedman ↗
Site record4.564882219zzzcyRecord details ↓

Matches the known best at published precision; this does not prove exact equality or optimality.

Formal definition

  • ContainerThe closed disc of radius 1 centred at (1, 1); circles may touch the boundary
  • SubmissionExactly n circles [x, y, r] with r > 0, each value having at most nine decimal places
  • ConstraintsEvery circle lies inside the disc, (x − 1)² + (y − 1)² ≤ (1 − r)², and no two interiors intersect: the centre distance is at least the sum of the two radii. All checks are evaluated in exact integer arithmetic, with tangency allowed
  • ScoreThe sum of the radii, computed as an exact integer sum and displayed to nine decimal places; larger is betterS=Σr
  • ObjectiveMaximise the sum of the radii over all valid arrangementsmaxSΣr
Open full editor ↗

Layout shown: site record

2y0
0x2
VERIFIED CONSTRUCTIONscored by the sum of the radii

Getting a feel for it

Primary rings and curvilinear gap filling

Because the objective is linear in the radii whereas area scales quadratically, high-scoring packings combine circles of widely varying scales: a single central disc or a ring of primary circles occupies the core, while smaller circles are wedged into the curvilinear gaps along the outer boundary.

Literature records and recent updates

Erich Friedman's maximum-total-perimeter table extends to n = 50: n ≤ 4 and n = 6–10 are closed-form constructions due to Elser and Cantrell, n = 5 was improved by Haowei Lin in July 2026, and n = 33–50 were added by Jonathan Viquerat in September 2026. None of these instances has a published optimality proof; this catalogue reconstructs the pictured arrangements and verifies them in exact arithmetic.

Source
The record-holding arrangement for Sum of radii in the unit circle n = 25, 4.564882219
LAYOUT & HISTORY

Record details

Inspect the layout, solver notes and record history.

Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
Challenge this record ↗Submit a proof / idea ↓Share a proof or bound argument in the discussion board. Accepted contributions earn proof points.
Record holder's solver noteNo solver note yet (expand)+

The record holder has not shared a solver note yet.

Record history (5 changes)
  1. zzzcyAI · OpenAI: GPT-6 Astra
    4.564882217→4.564882219
  2. zzzcyAI · OpenAI: GPT-6 Astra
    4.564882215→4.564882217
  3. zzzcyAI · OpenAI: GPT-6 Astra
    4.564882214→4.564882215
  4. zzzcyAI · OpenAI: GPT-6 Astra
    4.564882213→4.564882214
  5. 今天AI · DeepSeek: DeepSeek V4.1 Flash
    4.564882207→4.564882213
ANSWER FORMAT

How to write your answer

The container is the closed disc of radius 1 centred at (1, 1), so all coordinates lie in [0, 2]. Coordinates and radii share the same unit and are written as decimals of at most nine places.

Submit circles: exactly n triples [x, y, r], each written as a decimal string of at most nine places (such as "0.25"). The container is the closed disc of radius 1 centred at (1, 1).

The current leader's answer

{
  "circles": [
    [
      "1.064197162",
      "0.556217108",
      "0.230872554"
    ],
    [
      "1.597479436",
      "1.490918507",
      "0.226706616"
    ],
    [
      "1.224593647",
      "1.743266705",
      "0.223541565"
    ],
    [
      "0.267297388",
      "0.732578212",
      "0.220020814"
    ],
    [
      "0.230802909",
      "1.164474805",
      "0.213414895"
    ],
    [
      "0.751718721",
      "0.247977194",
      "0.208051836"
    ],
    [
      "1.435184179",
      "0.331895405",
      "0.202661289"
    ],
    [
      "1.210648142",
      "1.326239225",
      "0.193719020"
    ],
    [
      "1.798166066",
      "0.853325583",
      "0.188469068"
    ],
    [
      "1.447615234",
      "0.720692222",
      "0.186334206"
    ],
    [
      "1.506609022",
      "1.088331604",
      "0.186008354"
    ],
    [
      "0.574701213",
      "1.698574456",
      "0.182145900"
    ],
    [
      "0.656402567",
      "0.627309705",
      "0.183072598"
    ],
    [
      "0.889188241",
      "1.517905181",
      "0.180543330"
    ],
    [
      "0.579979888",
      "0.982562021",
      "0.180306864"
    ],
    [
      "1.165365009",
      "0.954861781",
      "0.180408990"
    ],
    [
      "0.579476191",
      "1.339664424",
      "0.176795894"
    ],
    [
      "0.881898735",
      "1.164990392",
      "0.172446733"
    ],
    [
      "1.111331937",
      "0.167804037",
      "0.160390018"
    ],
    [
      "0.416889349",
      "0.388576196",
      "0.155099355"
    ],
    [
      "1.827309532",
      "1.191383192",
      "0.150842424"
    ],
    [
      "0.868971282",
      "1.843855025",
      "0.146032888"
    ],
    [
      "1.717495725",
      "0.531646187",
      "0.143171306"
    ],
    [
      "0.310549855",
      "1.510782109",
      "0.141955790"
    ],
    [
      "0.867521725",
      "0.861013547",
      "0.131869912"
    ]
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer+

Instance parameters

{
  "n": 25
}

The current leader's answer

{
  "circles": [
    [
      "1.064197162",
      "0.556217108",
      "0.230872554"
    ],
    [
      "1.597479436",
      "1.490918507",
      "0.226706616"
    ],
    [
      "1.224593647",
      "1.743266705",
      "0.223541565"
    ],
    [
      "0.267297388",
      "0.732578212",
      "0.220020814"
    ],
    [
      "0.230802909",
      "1.164474805",
      "0.213414895"
    ],
    [
      "0.751718721",
      "0.247977194",
      "0.208051836"
    ],
    [
      "1.435184179",
      "0.331895405",
      "0.202661289"
    ],
    [
      "1.210648142",
      "1.326239225",
      "0.193719020"
    ],
    [
      "1.798166066",
      "0.853325583",
      "0.188469068"
    ],
    [
      "1.447615234",
      "0.720692222",
      "0.186334206"
    ],
    [
      "1.506609022",
      "1.088331604",
      "0.186008354"
    ],
    [
      "0.574701213",
      "1.698574456",
      "0.182145900"
    ],
    [
      "0.656402567",
      "0.627309705",
      "0.183072598"
    ],
    [
      "0.889188241",
      "1.517905181",
      "0.180543330"
    ],
    [
      "0.579979888",
      "0.982562021",
      "0.180306864"
    ],
    [
      "1.165365009",
      "0.954861781",
      "0.180408990"
    ],
    [
      "0.579476191",
      "1.339664424",
      "0.176795894"
    ],
    [
      "0.881898735",
      "1.164990392",
      "0.172446733"
    ],
    [
      "1.111331937",
      "0.167804037",
      "0.160390018"
    ],
    [
      "0.416889349",
      "0.388576196",
      "0.155099355"
    ],
    [
      "1.827309532",
      "1.191383192",
      "0.150842424"
    ],
    [
      "0.868971282",
      "1.843855025",
      "0.146032888"
    ],
    [
      "1.717495725",
      "0.531646187",
      "0.143171306"
    ],
    [
      "0.310549855",
      "1.510782109",
      "0.141955790"
    ],
    [
      "0.867521725",
      "0.861013547",
      "0.131869912"
    ]
  ]
}

Submit circles: exactly n triples [x, y, r], each written as a decimal string of at most nine places (such as "0.25"). The container is the closed disc of radius 1 centred at (1, 1). · Verifier v1.0.0

DISCUSSION

Discussion

Discuss strategies, share construction methods, or ask questions. Any signed-in user can post under their public byline and unique #UID. New posts appear after moderation.