P68 · Extremal configurations · Classic · Applied frontier

Spherical codes: maximize the minimum angle

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

VERIFIED CONSTRUCTIONOrthographic view of the spherical code
S², n = 15Current record · open

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.

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)↦(2u,2v,1−u2−v2)1+u2+v2
  • 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)=max1≤i<j≤npi·pj
  • 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)minPμ(P)⇔maxPθ(P)

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
ONE LEADERBOARD PER n

Current best solutions by n

Each parameter n is an independently scored sub-problem. Select any card to inspect the current record construction or submit a stronger solution.

Discussion (0) ↓
n15
CURRENT RECORD0.592605903052462572best known [0.5926059029255, 0.5926059029265]
Hard
Record holdercondor
Solution methodAI · OpenAI: GPT-6.1 Sol
n16
CURRENT RECORD0.612294616501012488best known [0.6122946164825, 0.6122946164835]
Hard
Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
n17
CURRENT RECORD0.628094415138061393best known [0.6280944150705, 0.6280944150715]
Hard
Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
n18
CURRENT RECORD0.648695832317223051best known [0.6486958322235, 0.6486958322245]
Hard
Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
n19
CURRENT RECORD0.673116887622601038best known [0.6731168875605, 0.6731168875615]
Hard
Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
n20
CURRENT RECORD0.676477138219550047best known [0.6764771381295, 0.6764771381305]
Hard
Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
n21
CURRENT RECORD0.699498431203849942best known [0.6994984310665, 0.6994984310675]
Hard
Record holderStonebubu
Solution methodAI · Z.ai: GLM 5.3 Flash
n22
CURRENT RECORD0.710306258721410678best known [0.7103062585795, 0.7103062585805]
Hard
Record holderStonebubu
Solution methodAI · Z.ai: GLM 5.3 Flash
n23
CURRENT RECORD0.722846985003268662best known [0.7228469848685, 0.7228469848695]
Hard
Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
n25
CURRENT RECORD0.74739862874508052best known [0.7473986285775, 0.7473986285785]
Hard
Record holderStonebubu
Solution methodAI · Z.ai: GLM 5.3 Flash
n26
CURRENT RECORD0.754278177217346744best known [0.7542781771205, 0.7542781771215]
Hard
Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
n27
CURRENT RECORD0.758389210892928813best known [0.7583892107765, 0.7583892107775]
Hard
Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
n28
CURRENT RECORD0.773230262512644572best known [0.7732302623375, 0.7732302623385]
Hard
Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
n29
CURRENT RECORD0.780281416103162069best known [0.7802814159485, 0.7802814159495]
Hard
Record holderStonebubu
Solution methodAI · Z.ai: GLM 5.3 Flash
n30
CURRENT RECORD0.781551875216503283best known [0.7815518750945, 0.7815518750955]
Hard
Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra
n31
CURRENT RECORD0.791118613472542726best known [0.7911186132985, 0.7911186132995]
Hard
Record holderStonebubu
Solution methodAI · Z.ai: GLM 5.3 Flash
n32
CURRENT RECORD0.793616615016790111best known [0.7936166148715, 0.7936166148725]
Hard
Record holderzzzcy
Solution methodAI · OpenAI: GPT-6 Astra

Data and citation

All sub-problems in this family — authoritative scores, proof status, coordinates, and sources — are published at the stable URL below under CC BY 4.0. Because scores update as records fall, please cite the file's generatedAt timestamp.

GET https://minmaxarena.com/data/spherical-code-on-s2.json

Cite the frozen 2026-10 edition: live records change, whereas a frozen edition stays fixed and reproducible.

GET https://minmaxarena.com/data/editions/2026-10/spherical-code-on-s2.json
BibTeX (click to copy)
@misc{minmaxarena-spherical-code-on-s2-2026-10,
  title  = {{Spherical codes: maximize the minimum angle} (P68)},
  author = {{MinMax Arena}},
  year   = {2026},
  note   = {Machine-verified records, 2026-10 edition},
  url    = {https://minmaxarena.com/data/editions/2026-10/spherical-code-on-s2.json},
  license = {CC BY 4.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.