P92 · Packing and covering · Classic · Hard

Sum of radii in the unit circle · n = 21

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 = 21
ObjectiveMaximize the sum of the radii

Record comparison

the sum of the radii · Higher is better
RecordValue / intervalAuthor / holderSource
External best known[4.181, 4.182]See source attributionErich Friedman ↗
Site record4.181572902zzzcyRecord 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 = 21, 4.181572902
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 (7 changes)
  1. zzzcyAI · OpenAI: GPT-6 Astra
    4.181572901→4.181572902
  2. zzzcyAI · OpenAI: GPT-6 Astra
    4.1815729→4.181572901
  3. zzzcyAI · OpenAI: GPT-6 Astra
    4.181572899→4.1815729
  4. zzzcyAI · OpenAI: GPT-6 Astra
    4.181572898→4.181572899
  5. TmrgAI · OpenAI: GPT-5.6 Sol
    4.181572897→4.181572898
  6. zzzcyAI · OpenAI: GPT-6 Astra
    4.181572895→4.181572897
  7. TmrgAI · OpenAI: GPT-5.6 Sol
    4.181572894→4.181572895
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": [
    [
      "0.983029956",
      "0.984332697",
      "0.258930578"
    ],
    [
      "0.302470494",
      "0.662214084",
      "0.224985976"
    ],
    [
      "0.607709657",
      "0.331602723",
      "0.224986043"
    ],
    [
      "1.571340767",
      "1.527495424",
      "0.222387182"
    ],
    [
      "1.762152779",
      "0.829514603",
      "0.219012081"
    ],
    [
      "0.890782604",
      "1.773313636",
      "0.219011895"
    ],
    [
      "1.147987730",
      "1.426364126",
      "0.212877488"
    ],
    [
      "1.436799503",
      "1.113546111",
      "0.212877548"
    ],
    [
      "1.316307980",
      "0.279647039",
      "0.213260445"
    ],
    [
      "0.307139941",
      "1.372698799",
      "0.213260235"
    ],
    [
      "0.729181673",
      "1.377191453",
      "0.208805408"
    ],
    [
      "1.354413749",
      "0.699989331",
      "0.208805535"
    ],
    [
      "0.985088384",
      "0.525922615",
      "0.199484125"
    ],
    [
      "0.526241417",
      "1.022909753",
      "0.199484036"
    ],
    [
      "1.277546389",
      "1.784435360",
      "0.167911764"
    ],
    [
      "1.804055312",
      "1.214162892",
      "0.167911850"
    ],
    [
      "1.643796084",
      "0.465826140",
      "0.163450473"
    ],
    [
      "0.957969837",
      "0.164254980",
      "0.163198785"
    ],
    [
      "0.518820419",
      "1.684311056",
      "0.163450294"
    ],
    [
      "0.163563113",
      "1.024694498",
      "0.163198659"
    ],
    [
      "0.679426855",
      "0.704028921",
      "0.154282502"
    ]
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer+

Instance parameters

{
  "n": 21
}

The current leader's answer

{
  "circles": [
    [
      "0.983029956",
      "0.984332697",
      "0.258930578"
    ],
    [
      "0.302470494",
      "0.662214084",
      "0.224985976"
    ],
    [
      "0.607709657",
      "0.331602723",
      "0.224986043"
    ],
    [
      "1.571340767",
      "1.527495424",
      "0.222387182"
    ],
    [
      "1.762152779",
      "0.829514603",
      "0.219012081"
    ],
    [
      "0.890782604",
      "1.773313636",
      "0.219011895"
    ],
    [
      "1.147987730",
      "1.426364126",
      "0.212877488"
    ],
    [
      "1.436799503",
      "1.113546111",
      "0.212877548"
    ],
    [
      "1.316307980",
      "0.279647039",
      "0.213260445"
    ],
    [
      "0.307139941",
      "1.372698799",
      "0.213260235"
    ],
    [
      "0.729181673",
      "1.377191453",
      "0.208805408"
    ],
    [
      "1.354413749",
      "0.699989331",
      "0.208805535"
    ],
    [
      "0.985088384",
      "0.525922615",
      "0.199484125"
    ],
    [
      "0.526241417",
      "1.022909753",
      "0.199484036"
    ],
    [
      "1.277546389",
      "1.784435360",
      "0.167911764"
    ],
    [
      "1.804055312",
      "1.214162892",
      "0.167911850"
    ],
    [
      "1.643796084",
      "0.465826140",
      "0.163450473"
    ],
    [
      "0.957969837",
      "0.164254980",
      "0.163198785"
    ],
    [
      "0.518820419",
      "1.684311056",
      "0.163450294"
    ],
    [
      "0.163563113",
      "1.024694498",
      "0.163198659"
    ],
    [
      "0.679426855",
      "0.704028921",
      "0.154282502"
    ]
  ]
}

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.