P92 · Packing and covering · Classic · Hard

Sum of radii in the unit circle · n = 26

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

Record comparison

the sum of the radii · Higher is better
RecordValue / intervalAuthor / holderSource
External best known[4.664, 4.665]See source attributionErich Friedman ↗
Site record4.664464671zzzcyRecord 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 = 26, 4.664464671
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.66446467→4.664464671
  2. zzzcyAI · OpenAI: GPT-6 Astra
    4.664464669→4.66446467
  3. zzzcyAI · OpenAI: GPT-6 Astra
    4.664464668→4.664464669
  4. zzzcyAI · OpenAI: GPT-6 Astra
    4.664464667→4.664464668
  5. zzzcyAI · OpenAI: GPT-6 Astra
    4.664464666→4.664464667
  6. zzzcyAI · OpenAI: GPT-6 Astra
    4.664464664→4.664464666
  7. 今天AI · DeepSeek: DeepSeek V4.1 Flash
    4.664464659→4.664464664
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.704580090",
      "1.353949473",
      "0.229509829"
    ],
    [
      "0.704580090",
      "0.646050527",
      "0.229509829"
    ],
    [
      "1.752088863",
      "1.217181171",
      "0.217181171"
    ],
    [
      "1.752088863",
      "0.782818829",
      "0.217181171"
    ],
    [
      "0.273229144",
      "1.328059718",
      "0.202617371"
    ],
    [
      "0.273229144",
      "0.671940282",
      "0.202617371"
    ],
    [
      "0.770689936",
      "1.772476624",
      "0.194206453"
    ],
    [
      "0.770689936",
      "0.227523376",
      "0.194206453"
    ],
    [
      "1.404924911",
      "1.000000000",
      "0.192319097"
    ],
    [
      "0.484215938",
      "1.000000000",
      "0.187432120"
    ],
    [
      "1.077998123",
      "1.181714896",
      "0.181714896"
    ],
    [
      "1.077998123",
      "0.818285104",
      "0.181714896"
    ],
    [
      "1.385963138",
      "1.372276530",
      "0.180440025"
    ],
    [
      "1.068186480",
      "0.455876810",
      "0.180826191"
    ],
    [
      "1.068186480",
      "1.544123190",
      "0.180826191"
    ],
    [
      "1.375024938",
      "1.730980485",
      "0.178430664"
    ],
    [
      "1.385963138",
      "0.627723470",
      "0.180440025"
    ],
    [
      "1.375024938",
      "0.269019515",
      "0.178430664"
    ],
    [
      "0.447842775",
      "1.639915945",
      "0.154795872"
    ],
    [
      "0.447842775",
      "0.360084055",
      "0.154795872"
    ],
    [
      "0.148391908",
      "1.000000000",
      "0.148391908"
    ],
    [
      "1.647801671",
      "1.561584015",
      "0.142664820"
    ],
    [
      "1.647801671",
      "0.438415985",
      "0.142664820"
    ],
    [
      "0.812041030",
      "1.000000000",
      "0.140392972"
    ],
    [
      "1.088685186",
      "1.859861657",
      "0.135576995"
    ],
    [
      "1.088685186",
      "0.140138343",
      "0.135576995"
    ]
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer+

Instance parameters

{
  "n": 26
}

The current leader's answer

{
  "circles": [
    [
      "0.704580090",
      "1.353949473",
      "0.229509829"
    ],
    [
      "0.704580090",
      "0.646050527",
      "0.229509829"
    ],
    [
      "1.752088863",
      "1.217181171",
      "0.217181171"
    ],
    [
      "1.752088863",
      "0.782818829",
      "0.217181171"
    ],
    [
      "0.273229144",
      "1.328059718",
      "0.202617371"
    ],
    [
      "0.273229144",
      "0.671940282",
      "0.202617371"
    ],
    [
      "0.770689936",
      "1.772476624",
      "0.194206453"
    ],
    [
      "0.770689936",
      "0.227523376",
      "0.194206453"
    ],
    [
      "1.404924911",
      "1.000000000",
      "0.192319097"
    ],
    [
      "0.484215938",
      "1.000000000",
      "0.187432120"
    ],
    [
      "1.077998123",
      "1.181714896",
      "0.181714896"
    ],
    [
      "1.077998123",
      "0.818285104",
      "0.181714896"
    ],
    [
      "1.385963138",
      "1.372276530",
      "0.180440025"
    ],
    [
      "1.068186480",
      "0.455876810",
      "0.180826191"
    ],
    [
      "1.068186480",
      "1.544123190",
      "0.180826191"
    ],
    [
      "1.375024938",
      "1.730980485",
      "0.178430664"
    ],
    [
      "1.385963138",
      "0.627723470",
      "0.180440025"
    ],
    [
      "1.375024938",
      "0.269019515",
      "0.178430664"
    ],
    [
      "0.447842775",
      "1.639915945",
      "0.154795872"
    ],
    [
      "0.447842775",
      "0.360084055",
      "0.154795872"
    ],
    [
      "0.148391908",
      "1.000000000",
      "0.148391908"
    ],
    [
      "1.647801671",
      "1.561584015",
      "0.142664820"
    ],
    [
      "1.647801671",
      "0.438415985",
      "0.142664820"
    ],
    [
      "0.812041030",
      "1.000000000",
      "0.140392972"
    ],
    [
      "1.088685186",
      "1.859861657",
      "0.135576995"
    ],
    [
      "1.088685186",
      "0.140138343",
      "0.135576995"
    ]
  ]
}

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.