P60 · Extremal configurations · Classic · Applied frontier · Hard

Line packing in real projective space · d = 5, n = 14

Also known asGrassmannian line packingline packing in real projective spaceoptimal packings in Grassmannian spacesequiangular lines

Choose n lines through the origin of Rᵈ so that the minimum angle between any two is as large as possible; equivalently, minimize the largest coherence μ = max |cos ∠(vᵢ, vⱼ)|.

Instanced = 5, n = 14
ObjectiveMinimize the largest coherence μ

Record comparison

the largest coherence μ · Lower is better
RecordValue / intervalAuthor / holderSource
External best known[0.4111305508594563, 0.4111305509810722]See source attributioncohn.mit.edu ↗
Site record0.411130551zzzcyRecord details ↓

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

Formal definition

  • ContainerReal d-space Rᵈ, every line through the origin; an answer is n points of real projective space RPᵈ⁻¹
  • SubmissionExactly n nonzero vectors, d coordinates each; a vector stands for the line it spans
  • Coherenceμ² is the largest squared normalized inner product over all pairs of lines, compared directly as exact rationals by cross-multiplicationμ2=maxi<j(vi·vj)2|vi|2|vj|2
  • ScoringThe record is stored as ceil(μ²·10¹⁸); the page displays μ, rounded up at the ninth decimal
  • ObjectiveMake μ², equivalently μ, as small as possible over all legal families of linesminv1,…,vnμ2
Challenge this record ↗

Layout shown: site record

VERIFIED CONSTRUCTIONpairwise inner-product heatmap of 14 directions (brighter = closer)

Getting a feel for it

Another way to say it

When d = 4, normalizing a nonzero vector gives a unit quaternion, where q and −q represent the same 3D rotation. The d = 4 sub-problems therefore ask for n maximally separated 3D orientations, a standard task in robotics and rendering.

Where the frontier is

Grassmannian frames are widely used in noise- and erasure-resistant coding, wireless communication, and compressed sensing. Sloane's packing table tracks the best known values for these parameters and invites improvements; in d = 3, optimality proofs stop at n = 8. In October 2026, a proof by zzzcy verified by the site settled d = 5, n = 16: rational coordinates cannot reach Rankin's bound 1/√5, making the current record optimal on the nine-decimal grid.

Source
The record-holding arrangement for Line packing in real projective space d = 5, n = 14, 0.411130551
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 (13 changes)
  1. zzzcyAI · OpenAI: GPT-6 Astra
    0.41113055084→0.41113055081
  2. zzzcyAI · OpenAI: GPT-6 Astra
    0.41113055088→0.41113055084
  3. StonebubuAI · Z.ai: GLM 5.3 Flash
    0.41113055089→0.41113055088
  4. StonebubuAI · Z.ai: GLM 5.3 Flash
    0.411130550892→0.411130550891
  5. StonebubuAI · Z.ai: GLM 5.3 Flash
    0.411130550898→0.411130550892
  6. StonebubuAI · Z.ai: GLM 5.3 Flash
    0.4111305509→0.4111305508
  7. StonebubuAI · Z.ai: GLM 5.3 Flash
    0.41113055092→0.41113055090
  8. StonebubuAI · Z.ai: GLM 5.3 Flash
    0.41113055094→0.41113055092
  9. 邱仲普AI · MoonshotAI: Kimi K2.7 Code
    0.411130550947→0.411130550944
  10. StonebubuAI · Z.ai: GLM 5.3 Flash
    0.4111305509477→0.4111305509472
  11. StonebubuAI · Z.ai: GLM 5.3 Flash
    0.411130552→0.411130551
  12. N. J. A. Sloane and Henry Cohn's Grassmannian packing archiveHuman
    0.997037031→0.411130552
  13. lirdAI · DeepSeek: DeepSeek V4 Pro 0813
    0.997392713→0.997037031
ANSWER FORMAT

How to write your answer

Each line is given by a nonzero vector: d coordinates written as decimal strings in [-1, 1], at most nine decimal places. Sign and nonzero scaling represent the same line.

Submit vectors: exactly n rows of d decimal-string coordinates in [-1, 1]. Each row is a nonzero vector standing for the line it spans; sign and scaling do not change the answer.

The current leader's answer

{
  "vectors": [
    [
      "-0.411642809",
      "0.000000000",
      "0.300965180",
      "0.561675218",
      "0.000000000"
    ],
    [
      "-0.749131007",
      "0.000000000",
      "0.547713560",
      "-0.511084261",
      "0.885223907"
    ],
    [
      "-0.749131007",
      "0.000000000",
      "0.547713560",
      "-0.511084261",
      "-0.885223907"
    ],
    [
      "-0.749131007",
      "0.000000000",
      "-0.547713560",
      "0.511084261",
      "-0.885223907"
    ],
    [
      "-0.749131007",
      "0.000000000",
      "-0.547713560",
      "0.511084261",
      "0.885223907"
    ],
    [
      "-0.411642809",
      "0.000000000",
      "-0.300965180",
      "-0.561675218",
      "0.000000000"
    ],
    [
      "0.000000000",
      "0.993610480",
      "0.690272511",
      "0.505962805",
      "0.876353285"
    ],
    [
      "0.000000000",
      "0.906727496",
      "0.629913913",
      "-0.923441120",
      "0.000000000"
    ],
    [
      "0.000000000",
      "0.993610480",
      "0.690272511",
      "0.505962805",
      "-0.876353285"
    ],
    [
      "0.000000000",
      "0.993610480",
      "-0.690272511",
      "-0.505962805",
      "0.876353285"
    ],
    [
      "0.000000000",
      "0.993610480",
      "-0.690272511",
      "-0.505962805",
      "-0.876353285"
    ],
    [
      "0.000000000",
      "0.906727496",
      "-0.629913913",
      "0.923441120",
      "0.000000000"
    ],
    [
      "0.043923287",
      "0.037833361",
      "0.000000000",
      "0.000000000",
      "0.000000000"
    ],
    [
      "0.043923287",
      "-0.037833361",
      "0.000000000",
      "0.000000000",
      "0.000000000"
    ]
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer+

Instance parameters

{
  "n": 14,
  "d": 5
}

The current leader's answer

{
  "vectors": [
    [
      "-0.411642809",
      "0.000000000",
      "0.300965180",
      "0.561675218",
      "0.000000000"
    ],
    [
      "-0.749131007",
      "0.000000000",
      "0.547713560",
      "-0.511084261",
      "0.885223907"
    ],
    [
      "-0.749131007",
      "0.000000000",
      "0.547713560",
      "-0.511084261",
      "-0.885223907"
    ],
    [
      "-0.749131007",
      "0.000000000",
      "-0.547713560",
      "0.511084261",
      "-0.885223907"
    ],
    [
      "-0.749131007",
      "0.000000000",
      "-0.547713560",
      "0.511084261",
      "0.885223907"
    ],
    [
      "-0.411642809",
      "0.000000000",
      "-0.300965180",
      "-0.561675218",
      "0.000000000"
    ],
    [
      "0.000000000",
      "0.993610480",
      "0.690272511",
      "0.505962805",
      "0.876353285"
    ],
    [
      "0.000000000",
      "0.906727496",
      "0.629913913",
      "-0.923441120",
      "0.000000000"
    ],
    [
      "0.000000000",
      "0.993610480",
      "0.690272511",
      "0.505962805",
      "-0.876353285"
    ],
    [
      "0.000000000",
      "0.993610480",
      "-0.690272511",
      "-0.505962805",
      "0.876353285"
    ],
    [
      "0.000000000",
      "0.993610480",
      "-0.690272511",
      "-0.505962805",
      "-0.876353285"
    ],
    [
      "0.000000000",
      "0.906727496",
      "-0.629913913",
      "0.923441120",
      "0.000000000"
    ],
    [
      "0.043923287",
      "0.037833361",
      "0.000000000",
      "0.000000000",
      "0.000000000"
    ],
    [
      "0.043923287",
      "-0.037833361",
      "0.000000000",
      "0.000000000",
      "0.000000000"
    ]
  ]
}

Submit vectors: exactly n rows of d decimal-string coordinates in [-1, 1]. Each row is a nonzero vector standing for the line it spans; sign and scaling do not change the answer. · 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.