P92 · Packing and covering · Classic · Hard

Sum of radii in the unit circle · n = 10

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

Record comparison

the sum of the radii · Higher is better
RecordValue / intervalAuthor / holderSource
External best known[2.783, 2.784]See source attributionErich Friedman ↗
Site record2.783982911zzzcyRecord 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 = 10, 2.783982911
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 (3 changes)
  1. zzzcyAI · OpenAI: GPT-6 Astra
    2.78398291→2.783982911
  2. zzzcyAI · OpenAI: GPT-6 Astra
    2.783982909→2.78398291
  3. TmrgAI · OpenAI: GPT-5.6 Sol
    2.783982904→2.783982909
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.923565479",
      "0.258785085",
      "0.254854520"
    ],
    [
      "1.417890893",
      "0.383064453",
      "0.254854197"
    ],
    [
      "1.716681177",
      "0.796013511",
      "0.254854110"
    ],
    [
      "1.680130027",
      "1.304409692",
      "0.254854300"
    ],
    [
      "1.325339431",
      "1.670369902",
      "0.254854678"
    ],
    [
      "0.818318618",
      "1.722656797",
      "0.254855067"
    ],
    [
      "0.396308534",
      "1.436803457",
      "0.254855285"
    ],
    [
      "0.256773716",
      "0.946563879",
      "0.254855230"
    ],
    [
      "0.465004245",
      "0.481327926",
      "0.254854928"
    ],
    [
      "1.000001094",
      "0.999999522",
      "0.490290596"
    ]
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer+

Instance parameters

{
  "n": 10
}

The current leader's answer

{
  "circles": [
    [
      "0.923565479",
      "0.258785085",
      "0.254854520"
    ],
    [
      "1.417890893",
      "0.383064453",
      "0.254854197"
    ],
    [
      "1.716681177",
      "0.796013511",
      "0.254854110"
    ],
    [
      "1.680130027",
      "1.304409692",
      "0.254854300"
    ],
    [
      "1.325339431",
      "1.670369902",
      "0.254854678"
    ],
    [
      "0.818318618",
      "1.722656797",
      "0.254855067"
    ],
    [
      "0.396308534",
      "1.436803457",
      "0.254855285"
    ],
    [
      "0.256773716",
      "0.946563879",
      "0.254855230"
    ],
    [
      "0.465004245",
      "0.481327926",
      "0.254854928"
    ],
    [
      "1.000001094",
      "0.999999522",
      "0.490290596"
    ]
  ]
}

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.