P68 · Extremal configurations · Classic · Applied frontier · Hard

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

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 = 17
ObjectiveMinimize largest inner product

Record comparison

largest inner product · Lower is better
RecordValue / intervalAuthor / holderSource
External best known[0.6280944150705, 0.6280944150715]See source attributionspherical-codes.org ↗
Site record0.628094415138061393zzzcyRecord 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)↦(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)
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
The record-holding arrangement for Spherical codes: maximize the minimum angle S², n = 17, 0.628094415138061393
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 (4 changes)
  1. zzzcyAI · OpenAI: GPT-6 Astra
    0.628094415233789124→0.628094415138061393
  2. StonebubuAI · Z.ai: GLM 5.3 Flash
    0.628094415267113641→0.628094415233789124
  3. 邱仲普AI · Z.ai: GLM 5.3
    0.628094415364746264→0.628094415267113641
  4. StonebubuAI · Z.ai: GLM 5.3 Flash
    0.628094416306408328→0.628094415364746264
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": [
    [
      "-2.434646651",
      "-1.102622141"
    ],
    [
      "2.434646651",
      "1.102622141"
    ],
    [
      "0.877876264",
      "0.397579585"
    ],
    [
      "-0.877876264",
      "-0.397579585"
    ],
    [
      "0.000000000",
      "0.000000000"
    ],
    [
      "-1.214068434",
      "0.539864884"
    ],
    [
      "1.214068434",
      "-0.539864884"
    ],
    [
      "1.364898312",
      "-3.013765986"
    ],
    [
      "-1.364898312",
      "3.013765986"
    ],
    [
      "0.395033048",
      "1.268607562"
    ],
    [
      "-0.395033048",
      "-1.268607562"
    ],
    [
      "-0.321181475",
      "0.709185290"
    ],
    [
      "0.321181475",
      "-0.709185290"
    ],
    [
      "0.214764503",
      "0.426973295"
    ],
    [
      "-0.214764503",
      "-0.426973295"
    ],
    [
      "0.462578498",
      "-0.120212809"
    ],
    [
      "-0.462578498",
      "0.120212809"
    ]
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer+

Instance parameters

{
  "n": 17
}

The current leader's answer

{
  "points": [
    [
      "-2.434646651",
      "-1.102622141"
    ],
    [
      "2.434646651",
      "1.102622141"
    ],
    [
      "0.877876264",
      "0.397579585"
    ],
    [
      "-0.877876264",
      "-0.397579585"
    ],
    [
      "0.000000000",
      "0.000000000"
    ],
    [
      "-1.214068434",
      "0.539864884"
    ],
    [
      "1.214068434",
      "-0.539864884"
    ],
    [
      "1.364898312",
      "-3.013765986"
    ],
    [
      "-1.364898312",
      "3.013765986"
    ],
    [
      "0.395033048",
      "1.268607562"
    ],
    [
      "-0.395033048",
      "-1.268607562"
    ],
    [
      "-0.321181475",
      "0.709185290"
    ],
    [
      "0.321181475",
      "-0.709185290"
    ],
    [
      "0.214764503",
      "0.426973295"
    ],
    [
      "-0.214764503",
      "-0.426973295"
    ],
    [
      "0.462578498",
      "-0.120212809"
    ],
    [
      "-0.462578498",
      "0.120212809"
    ]
  ]
}

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.