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
n = 15Current record · open

Choose n points on the unit sphere S² to maximize their minimum central angle. Since arccos is decreasing, the verifier equivalently minimizes the largest pairwise inner product.

Formal definition

  • ContainerThe unit sphere S² in three-dimensional Euclidean space
  • SubmissionExactly n stereographic pairs [u,v] in [-20,20]²
  • Map[u,v] maps exactly to (2u,2v,1-u²-v²)/(1+u²+v²)
  • ObjectiveMaximize the minimum angle, equivalently minimize the largest pairwise inner product. Exact rationals are compared by cross-multiplication and scored as ceil(max dot · 10¹⁸)

Getting a feel for it

Where it is used

Antenna beams, spacecraft attitude sampling, spherical quadrature and molecular self-assembly all need directions that stay far apart. Adding one point often forces the entire symmetric structure to reorganize.

Why a latitude-longitude grid loses

The sphere has no boundary, but it cannot be tiled by identical small neighborhoods. Pentagonal and hexagonal defects and competing local contact graphs are unavoidable. 'Uniformly distributed' names the goal; realizing it is the problem.

Only open rows remain

spherical-codes.org marks n≤14 and n=24 as proved, so the arena does not offer them as challenges. Only the unproved rows n=15…23 and 25…32 remain, each with a complete exhibited construction.

Source
ONE LEADERBOARD PER n

Current best solutions by n

Each n is an independent record with a page of its own. Open any of them to inspect the current construction, then challenge it.

Discussion (0) ↓
n15
CURRENT RECORD0.592605903917030326best known 0.592605903917030326
Matches the best known
Answer sourceHenry Cohn's spherical-code archive
Solution methodPublished reference construction
View problem
n16
CURRENT RECORD0.612294617317424783best known 0.612294617317424783
Matches the best known
Answer sourceHenry Cohn's spherical-code archive
Solution methodPublished reference construction
View problem
n17
CURRENT RECORD0.628094416306408328best known 0.628094416306408328
Matches the best known
Answer sourceHenry Cohn's spherical-code archive
Solution methodPublished reference construction
View problem
n18
CURRENT RECORD0.648695833340777714best known 0.648695833340777714
Matches the best known
Answer sourceHenry Cohn's spherical-code archive
Solution methodPublished reference construction
View problem
n19
CURRENT RECORD0.673116888100906243best known 0.673116888100906243
Matches the best known
Answer sourceHenry Cohn's spherical-code archive
Solution methodPublished reference construction
View problem
n20
CURRENT RECORD0.676477138764880265best known 0.676477138764880265
Matches the best known
Answer sourceHenry Cohn's spherical-code archive
Solution methodPublished reference construction
View problem
n21
CURRENT RECORD0.699498431941467854best known 0.699498431941467854
Matches the best known
Answer sourceHenry Cohn's spherical-code archive
Solution methodPublished reference construction
View problem
n22
CURRENT RECORD0.710306259356231474best known 0.710306259356231474
Matches the best known
Answer sourceHenry Cohn's spherical-code archive
Solution methodPublished reference construction
View problem
n23
CURRENT RECORD0.72284698595527336best known 0.72284698595527336
Matches the best known
Answer sourceHenry Cohn's spherical-code archive
Solution methodPublished reference construction
View problem
n25
CURRENT RECORD0.747398629631187568best known 0.747398629631187568
Matches the best known
Answer sourceHenry Cohn's spherical-code archive
Solution methodPublished reference construction
View problem
n26
CURRENT RECORD0.754278177789361401best known 0.754278177789361401
Matches the best known
Answer sourceHenry Cohn's spherical-code archive
Solution methodPublished reference construction
View problem
n27
CURRENT RECORD0.758389211722986307best known 0.758389211722986307
Matches the best known
Answer sourceHenry Cohn's spherical-code archive
Solution methodPublished reference construction
View problem
n28
CURRENT RECORD0.773230263147002607best known 0.773230263147002607
Matches the best known
Answer sourceHenry Cohn's spherical-code archive
Solution methodPublished reference construction
View problem
n29
CURRENT RECORD0.780281416834226978best known 0.780281416834226978
Matches the best known
Answer sourceHenry Cohn's spherical-code archive
Solution methodPublished reference construction
View problem
n30
CURRENT RECORD0.781551875763660801best known 0.781551875763660801
Matches the best known
Answer sourceHenry Cohn's spherical-code archive
Solution methodPublished reference construction
View problem
n31
CURRENT RECORD0.791118613964637913best known 0.791118613964637913
Matches the best known
Answer sourceHenry Cohn's spherical-code archive
Solution methodPublished reference construction
View problem
n32
CURRENT RECORD0.793616615466546398best known 0.793616615466546398
Matches the best known
Answer sourceHenry Cohn's spherical-code archive
Solution methodPublished reference construction
View problem

Data and citation

Every sub-problem in this family — authoritative scores, proof status, coordinates and sources — lives at the stable address below, published under CC BY 4.0. Scores move as records fall, so cite the generatedAt timestamp the file carries.

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

The first frozen edition is published at the start of next month; until then, cite with the date you accessed it.

BibTeX (click to copy)
@misc{minmaxarena-spherical-code-on-s2,
  title  = {{Spherical codes: maximize the minimum angle} (P68)},
  author = {{MinMax Arena}},
  year   = {2026},
  note   = {Machine-verified records, accessed 2026-08-29},
  url    = {https://minmaxarena.com/problems/spherical-code-on-s2},
  license = {CC BY 4.0}
}
DISCUSSION

Discussion

Talk strategy, share methods, ask why you are stuck. Posts carry your public byline, the same name your records use; the #number after it is the account's signup ordinal, so a name cannot be worn by someone else. The floor is earned: break a record once, anywhere, and it is yours for good. New posts appear after an automated review.

No threads yet. Be the first to talk about this problem?