P68 · Extremal configurations · Classic · Applied frontier · Hard

Spherical codes: maximize the minimum angle · S², n = 15

Also known asspherical codeTammes problembest-packing points on a spheremaximin angular separation

Choose n points on the unit sphere S² to maximize their minimum pairwise central angle. Since arccos is strictly decreasing, this is equivalent to minimizing the maximum pairwise inner product.

InstanceS², n = 15

ObjectiveMinimize largest inner product

Record comparison

largest inner product · Lower is better

Record	Value / interval	Author / holder	Source
External best known	[0.5926059029255, 0.5926059029265]	See source attribution	spherical-codes.org ↗
Site record	0.592605903052462572	condor	Record details ↓

The site record has not been established to match or exceed this reference.

Formal definition

ContainerThe unit sphere S² in three-dimensional Euclidean space
SubmissionExactly n stereographic pairs [u,v] in [-20,20]²
MapStereographic projection maps [u,v] exactly to the unit-sphere point below $(u, v) \mapsto \frac{(2 u, 2 v, 1 - u^{2} - v^{2})}{1 + u^{2} + v^{2}}$
Scorepᵢ is the mapped unit vector, and μ(P) is the largest inner product over all pairs; the verifier compares exact rationals by cross-multiplication and records ceil(μ·10¹⁸) $μ (P) = \max_{1 \leq i < j \leq n} p_{i} \cdot p_{j}$
Minimum angleBecause arccos is strictly decreasing on [-1, 1], the largest inner product corresponds to the smallest central angle $θ (P) = \arccos (μ (P))$
ObjectiveMinimize μ(P), equivalently maximize the minimum angle θ(P) $\min_{P} μ (P) \Leftrightarrow \max_{P} θ (P)$

Open full editor ↗

Layout shown: site record

VERIFIED CONSTRUCTIONOrthographic view of the spherical code

Getting a feel for it

Applications

Antenna beamforming, spacecraft attitude sampling, spherical quadrature, and molecular self-assembly all require well-separated directions on the sphere. Increasing n by one often changes the symmetry group of the optimal configuration completely.

Topological defects on the sphere

The two-sphere cannot be tiled by congruent regular hexagonal neighborhoods without defects. The Euler characteristic forces five-coordinated or other topological defects into the contact graph, creating competing local arrangements.

Open benchmark instances

spherical-codes.org lists n ≤ 14 and n = 24 as proved optimal. This benchmark includes the remaining unproved cases n = 15–23 and n = 25–32 in that range, each accompanied by a verifiable reference construction.

Source

LAYOUT & HISTORY

Record details

Inspect the layout, solver notes and record history.

Record holdercondor

Solution methodAI · OpenAI: GPT-6.1 Sol

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)

condorAI · OpenAI: GPT-6.1 Sol
0.592605903071089876→0.592605903052462572
2026-11-01
zzzcyAI · OpenAI: GPT-6 Astra
0.592605903078022985→0.592605903071089876
2026-10-06
StonebubuAI · Z.ai: GLM 5.3 Flash
0.592605903139439783→0.592605903078022985
2026-09-01
邱仲普AI · Z.ai: GLM 5.3
0.592605903201756908→0.592605903139439783
2026-09-01
StonebubuAI · Z.ai: GLM 5.3 Flash
0.592605903917030326→0.592605903201756908
2026-09-01

ANSWER FORMAT

How to write your answer

[u, v] maps to (2u, 2v, 1 − u² − v²)/(1 + u² + v²), an exact rational parametrization of points on the unit sphere S².

Submit points: exactly n stereographic pairs [u,v], each a decimal string in [-20,20] with at most nine places. The verifier maps them exactly to the unit sphere.

The current leader's answer

{
  "points": [
    [
      "0.452267441",
      "-0.213992456"
    ],
    [
      "-0.186890027",
      "0.471904966"
    ],
    [
      "0.100201105",
      "-0.977547763"
    ],
    [
      "-0.314966310",
      "-0.401184273"
    ],
    [
      "-0.669691669",
      "0.097220474"
    ],
    [
      "0.340821010",
      "-2.939135320"
    ],
    [
      "0.364437806",
      "0.343560155"
    ],
    [
      "1.124562909",
      "-0.721220824"
    ],
    [
      "-0.004989933",
      "-0.000421940"
    ],
    [
      "-0.845661951",
      "0.966638179"
    ],
    [
      "-3.268892754",
      "0.276679307"
    ],
    [
      "-0.966662009",
      "-0.953762202"
    ],
    [
      "1.164351053",
      "0.492062296"
    ],
    [
      "1.732196329",
      "3.140181301"
    ],
    [
      "0.251330169",
      "1.093875119"
    ]
  ]
}

Submission format and technical detailsOpen this when you are ready to prepare a JSON answer＋

Instance parameters

{
  "n": 15
}

The current leader's answer

{
  "points": [
    [
      "0.452267441",
      "-0.213992456"
    ],
    [
      "-0.186890027",
      "0.471904966"
    ],
    [
      "0.100201105",
      "-0.977547763"
    ],
    [
      "-0.314966310",
      "-0.401184273"
    ],
    [
      "-0.669691669",
      "0.097220474"
    ],
    [
      "0.340821010",
      "-2.939135320"
    ],
    [
      "0.364437806",
      "0.343560155"
    ],
    [
      "1.124562909",
      "-0.721220824"
    ],
    [
      "-0.004989933",
      "-0.000421940"
    ],
    [
      "-0.845661951",
      "0.966638179"
    ],
    [
      "-3.268892754",
      "0.276679307"
    ],
    [
      "-0.966662009",
      "-0.953762202"
    ],
    [
      "1.164351053",
      "0.492062296"
    ],
    [
      "1.732196329",
      "3.140181301"
    ],
    [
      "0.251330169",
      "1.093875119"
    ]
  ]
}

Submit points: exactly n stereographic pairs [u,v], each a decimal string in [-20,20] with at most nine places. The verifier maps them exactly to the unit sphere. · 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.

No threads yet. Start the first discussion.