Research log — five-dimensional kissing number
Status (accessed 2026-08-17)
The kissing number is open. The published range is still
and the value is widely expected to be 40. No accepted paper, arXiv preprint, or living table consulted tonight improves either endpoint.
Sources checked tonight
| Source | What it says | When |
|---|---|---|
| Tao constants | , conjectural value 40 | fetched 2026-08-17 |
| Cohn, kissing-number table | dim 5: lower 40, upper 44, ratio 1.100 | crawled 2026-08-17 |
| Boyvalenkov–Dodunekov–Musin, arXiv:1507.03631 | first open case; story | 2012/2015 survey |
| Mittelmann–Vallentin, arXiv:0902.1105v3 / Exp. Math. 19 (2010) | , hence | the published upper bound |
| Bachoc–Vallentin, JAMS 21 (2008) | 3-point SDP, | precursor of MV |
| Cohn–Rajagopal, arXiv:2412.00937v3 / DCG 2026 | “appears to be 40… best upper bound 44”; four 40-point geometries | 4 Mar 2026 |
| Szöllősi, MRL 30 (2023) | third 40-point configuration | 2023 |
| MathWorld / Wikipedia tables | 40 / 44 “as of August 2026” | fetched 2026-08-17 |
| Cohn table refs for later dimensions (de Laat–Leijenhorst 2024, Cohn–Li 2024, …) | new lower bounds in dims and better SDP in some high dims; dim 5 untouched | 2024–26 |
Odlyzko–Sloane 1979 is the continuum LP number . Coxeter 1963 is 48. The lower bound is Korkine–Zolotareff 1873 (40 roots: permutations of ).
Independent checks (this folder)
compute/verify_configs.py— PASS. are 40-point kissing codes. Pair histograms match Cohn–Rajagopal Table 2.1 on the nose, including the non- angles .compute/levenshtein.py— PASS. from the BDM formula.compute/extend_d5.py— PASS. , so is maximal.compute/d4_equator.py— PASS. via ; 24-cell hole graph has independence number 8 and exactly three MIS (Cohn’s three cross-polytopes).compute/verify_certificates.py— PASS. Rebuilds Gegenbauer from the recurrence and checks the two duals incompute/certs/restricted_delsarte.json.compute/integer_d5.py— PASS. Integer distributions: 42/43/44 empty; 41 only with 20 antipodes.
What we certified
Restricted exact duals and one geometric lemma. None of these changes the unrestricted range .
1. 24-cell lemma
A kissing code in that contains an isometric copy of the 24-cell has at most 40 points. Proof: the 24-cell is equatorial; extra points lie at ; each open hemisphere contributes at most extra points, via the exact polynomial . Consequently is impossible in this class, and the two 24-cell-containing 40-point codes and are maximal.
This is the kind of fact experts use when they build and by filling holes of the 24-cell. We did not find it stated as a bound on 41–44, so we wrote out the Rankin step and checked the discrete hole graph. It is a restricted obstruction, not an unrestricted bound.
2. Leech-angle Delsarte dual
Any spherical code in whose distinct inner products lie in
(the exact angle set of Leech’s ) has size at most
hence at most 43. The dual is the Gegenbauer combination with coefficients
Replay: compute/verify_certificates.py. This excludes in the
class. It does not exclude 44 for -type angles
(the corresponding interpolating dual has value ).
3. -angle codes
For :
- real Delsarte gives , by the dual ;
- integer pair-counts kill 42, 43, 44, and force any 41-point distribution to contain 20 antipodal pairs;
- those 40 points are an equal-length subset of a simply-laced root system of rank , hence a copy of , which cannot be extended.
So is impossible in the class. The root-system step is classical (Cartan–Killing: the only 40-root equal-length system in rank is ); the integer slice and the exact dual of bound 42 are computed here.
4. has no extra equatorial point
On the inequalities cut a polytope of maximal squared norm .
What we did not beat
- The unrestricted upper bound 44. No continuum Delsarte or exact Bachoc–Vallentin dual below 44 was produced. A floating 3-point SDP would have been residue even if we had rerun one.
- The unrestricted lower bound 40. No exact 41-point spherical code. Algebraic ansätze (cube+axes, plus holes, completion) top out at 40. Numerical 41st-point slacks against and are .
- Maximality of and as spherical codes (they do not contain a 24-cell, so the lemma does not apply).
- An exact SOS certificate of Mittelmann–Vallentin’s .
How to replay
sh compute/run_all.sh
The duals alone:
compute/.venv/bin/python compute/verify_certificates.py
Expected last lines: D5_inner_products: certified=True bound=42 … excludes=[43, 44]
and L5_inner_products: certified=True bound=239925/5456 … excludes=[44].
2026-08-27 — record still
Opened tonight:
- https://teorth.github.io/optimizationproblems/constants/29a.html — , conjectural value 40. Upper bound cited is Mittelmann–Vallentin.
- https://cohn.mit.edu/kissing-numbers/ — dim 5 lower 40, upper 44, ratio 1.100, citations [9] Korkine–Zolotareff and [17] Mittelmann–Vallentin. Later-dimension news (Cohn–Li, de Laat– Leijenhorst, Ma et al. 2511.13391, …) does not touch dim 5.
- https://arxiv.org/abs/2412.00937 — v3 (4 Mar 2026): “appears to be 40… best upper bound that has been proved is 44”. Four 40-point geometries.
- https://arxiv.org/abs/0902.1105 — , hence . Still the published upper bound.
- https://arxiv.org/abs/1507.03631 — survey story .
- https://arxiv.org/abs/2301.08272 — Szöllősi , third 40-point code.
- https://doi.org/10.5281/zenodo.18449600 — unaffiliated note claiming a degree-36 Cohn–Kumar number . Not a paper; not an exact dual; unrestricted Delsarte is already . Lead only.
2026-08-27 — what we certified this run
Still no change to the unrestricted range .
5. Polar maximality of the four 40-point codes
compute/q1/polar_vertices.json, replayed by replay_max_vertex.py
(Fraction GE, not the Cramer path in polar.c). For each of
the polar is bounded and .
Python and C enumerations agree on the vertex counts. Consequently
none of these four codes admits a 41st kissing point. This is a
statement about those four codes, not about .
6. Integer Delsarte on excludes 44
compute/q1/integer_q5_44.json: integer points in
a box containing the real AABB by 15, zero Delsarte-feasible. Tables
match delsarte.py; 's own histogram passes. So
is impossible for inner products in
. Real Delsarte is still
; this is integrality, not a dual below 44.
still has integer hits at
(compute/q1/integer_restricted.json).
Replay:
sh problems/kissing-5d/compute/q1/run_all.sh
2026-08-27 — record still (q2)
Opened tonight:
- https://teorth.github.io/optimizationproblems/constants/29a.html — , conjectural value 40. Upper bound cited is Mittelmann–Vallentin. No later endpoint.
- https://cohn.mit.edu/kissing-numbers/ — dim 5 lower 40, upper 44, ratio 1.100, citations [9] Korkine–Zolotareff and [17] Mittelmann–Vallentin. Later-dimension news (Cohn–Li, Ho 2603.10425, Ma et al. 2511.13391, Takhanov et al. 2606.18984, Sun–Wang 2607.20359) does not touch dim 5.
- https://arxiv.org/abs/0902.1105 — , hence . Still the published upper bound.
- https://arxiv.org/abs/2412.00937 — v3 (4 Mar 2026), title now “Variations on five-dimensional sphere packings”: “appears to be 40… best upper bound that has been proved is 44”. Four 40-point geometries. No size 41.
- https://arxiv.org/abs/1507.03631 — survey story .
- https://arxiv.org/abs/2301.08272 — Szöllősi .
- https://arxiv.org/abs/math/0608426 — Bachoc–Vallentin, before Mittelmann–Vallentin.
- https://doi.org/10.5281/zenodo.18449600 — the unaffiliated Cohn–Kumar note is retracted (removed 5 Feb 2026). Not a paper; not an exact dual. Lead only.
2026-08-27 — what we certified this run (q2)
Still no change to the unrestricted range .
7. Finite exact graphs with no 41-clique
compute/q2/t5_clique.json: Szöllősi remainder, 355 vertices, 607171 nodes, no 41-clique. The five basis vectors of the 360-point pool are universal; a 41-set in the full pool needs a 36-clique in this remainder, which was not settled (t5_36_residue.json).compute/q2/sphere_d2.json: 200 half-integer points of squared norm 2, no 41-clique. Contains and .compute/q2/q5cap_clique.json: 320-point -cap orbit, no 41-clique.
8. No unrestricted dual below 44
compute/q2/unrestricted_dual.json: numerical continuum Delsarte
at degree . Exact duals exist
(best in the search ). None has bound .
Replay:
sh problems/kissing-5d/compute/q2/run_all.sh
2026-08-27 — record still (q3)
Opened tonight:
- https://teorth.github.io/optimizationproblems/constants/29a.html — , range , conjectural value 40. Upper bound cited is Mittelmann–Vallentin. No later endpoint.
- https://cohn.mit.edu/kissing-numbers/ — dim 5 lower 40, upper 44, ratio 1.100, citations [9] Korkine–Zolotareff and [17] Mittelmann–Vallentin. Later-dimension news on the same table does not touch dim 5.
- https://arxiv.org/abs/0902.1105 — , hence . Still the published upper bound.
- https://arxiv.org/abs/2412.00937 — v3 (4 Mar 2026): “appears to be 40… best upper bound that has been proved is 44”. Four 40-point geometries. No size 41.
- https://arxiv.org/html/0902.1105v3 — same number, table of SDP bounds for .
- https://arxiv.org/abs/math/0501493 — Pfender, improved Delsarte via a diagonally-dominant kernel . Improves kissing bounds in dims 10, 16, 17, 25, 26; does not give an exact dual below 44 in dim 5.
- https://doi.org/10.5281/zenodo.18449599 — unaffiliated note claiming a Cohn–Kumar number . Retracted sibling of doi:10.5281/zenodo.18449600. Not a paper; not an exact dual. Lead only.
- https://arxiv.org/abs/math/0501493 — Pfender, Improved Delsarte bounds for spherical codes in small dimensions. The extra function is a diagonally-dominant kernel , not a Gegenbauer polynomial. Improves kissing numbers in dimensions 10, 16, 17, 25, 26. Does not produce an exact dual below 44 in dimension 5.
2026-08-27 — what we certified this run (q3)
Still no change to the unrestricted range .
9. : no 41-set with
compute/q3/complete_slices.json. Every extra of squared-norm 2 in
kisses at most 36 of the 40 roots. A 41-set
therefore uses at least five extras, and the extras' missed-root
union satisfies . Complete generation of every
-superset of an actual missed set, (that is
down to 33), finds no extras-clique of size . So this 1480-point
graph has no 41-clique that contains 33 or more -type points.
The slice is unfinished.
10. No unrestricted dual below 44
compute/q3/dual_gap.json. Continuum Delsarte is .
A dual allowed to be positive on has numerical value
, but that gap is not a geometric lemma (the four
published 40-point codes all have an angle in ) and the
rational polynomials did not pass Sturm. Not a certificate.
Replay:
sh problems/kissing-5d/compute/q3/run_all.sh
2026-08-27 — record still (q4 dual)
Opened tonight:
- https://teorth.github.io/optimizationproblems/constants/29a.html — , range , conjectural value 40. Upper bound cited is Mittelmann–Vallentin. No later endpoint.
- https://cohn.mit.edu/kissing-numbers/ — dim 5 lower 40, upper 44, ratio 1.100, citations [9] Korkine–Zolotareff and [17] Mittelmann–Vallentin. Dim 6 is now 72 / 77 (de Laat–Leijenhorst– de Muinck Keizer); dim 5 is untouched.
- https://arxiv.org/abs/0902.1105 — , hence . Still the published upper bound. HTML https://ar5iv.labs.arxiv.org/html/0902.1105v3 for the formula and Table 1.
- https://arxiv.org/abs/math/0608426 — Bachoc–Vallentin, . HTML https://ar5iv.labs.arxiv.org/html/math/0608426v4 : Theorem 3.2 for , Remark 3.4 monomial form , Corollary 3.5 for , Theorem 4.2 for the dual, §5 Putinar with .
- https://arxiv.org/abs/2412.00937 — v3 still “appears to be 40… best upper bound that has been proved is 44”.
- https://doi.org/10.5281/zenodo.18449600 — unaffiliated note claiming a Cohn–Kumar number . Retracted. Unrestricted Delsarte is already . Lead only, not a citation.
2026-08-27 — what we certified this run (q4 dual)
Still no change to the unrestricted range .
Exact over (compute/q4/bv.py) replay the paper
identities. No exact Putinar / SOS dual with value . The
dictionary LP number at and the floating SDP values
near 40 are residue. Best certified unrestricted dual is still
Levenshtein 48.
Replay:
python3 problems/kissing-5d/compute/q4/bv.py
python3 problems/kissing-5d/compute/q4/dual_exact.py
python3 problems/kissing-5d/compute/q4/verify.py
2026-08-27 — leftover graphs (q4)
Opened again (and re-fetched the arXiv sources):
- https://teorth.github.io/optimizationproblems/constants/29a.html — still , conjectural value 40.
- https://cohn.mit.edu/kissing-numbers/ — dim 5 lower 40, upper 44, refs [9] Korkine–Zolotareff and [17] Mittelmann–Vallentin. Dim 6 is 72 / 77; dim 5 is untouched.
- https://arxiv.org/abs/0902.1105 — , HTML https://ar5iv.labs.arxiv.org/html/0902.1105v3 Table 1. Range of possible values limited from to .
- https://arxiv.org/abs/2412.00937 — v3 still “appears to be 40… best upper bound that has been proved is 44”.
Still no change to the unrestricted range.
11. : no 41-set with
compute/q4/n1_complete_k12.json, n1_dfs_k16.json, n1_dfs_k18.json,
replay_unions_k13.json, analyze_stars.json, verify_n1.rs. The ten
octads are the coordinate-stars. Seed-unions through
have no extras-clique of size (n1_dfs.c,
unions). The slice is unfinished.
12. 36-clique still residue
compute/q4/t5_omega.json: Cadical and Glucose return no 36-clique;
no stored DRAT. t5_share30_c.json through t5_share24_c.json:
share 30 down to 24 empty.
Replay:
sh problems/kissing-5d/compute/q4/run_all.sh
python3 problems/kissing-5d/compute/q4/analyze_stars.py
python3 problems/kissing-5d/compute/q4/n1_check.py
rustc -O -o /tmp/verify_n1 problems/kissing-5d/compute/q4/verify_n1.rs && /tmp/verify_n1
2026-08-27 — record still (q5)
Opened tonight:
- https://teorth.github.io/optimizationproblems/constants/29a.html — , range , conjectural value 40. Upper bound cited is Mittelmann–Vallentin. No later endpoint.
- https://cohn.mit.edu/kissing-numbers/ — dim 5 lower 40, upper 44, ratio 1.100, citations [9] Korkine–Zolotareff and [17] Mittelmann–Vallentin. Dim 6 is 72 / 77; dim 5 is untouched.
- https://arxiv.org/abs/0902.1105 — , hence . Still the published upper bound.
- https://arxiv.org/abs/2412.00937 — v3 (4 Mar 2026): “appears to be 40… best upper bound that has been proved is 44”. HTML https://ar5iv.labs.arxiv.org/html/2412.00937v3.
- https://arxiv.org/abs/math/0608426 — Bachoc–Vallentin, before Mittelmann–Vallentin.
Re-opened the same five URLs later on 2026-08-27 (q5). Endpoints unchanged: Tao still ; Cohn table dim 5 still 40 / 44, ratio 1.100, dim 6 is 72 / 77; Mittelmann–Vallentin ; Cohn–Rajagopal v3 still “appears to be 40… best upper bound that has been proved is 44”. No later accepted improvement of either endpoint.
2026-08-27 — record still (q6)
Opened tonight:
- https://teorth.github.io/optimizationproblems/constants/29a.html — , range , conjectural value 40. Upper bound cited is Mittelmann–Vallentin. No later endpoint.
- https://cohn.mit.edu/kissing-numbers/ — dim 5 lower 40, upper 44, ratio 1.100, citations [9] Korkine–Zolotareff and [17] Mittelmann–Vallentin. Later-dimension news (Cohn–Li, Ho 2603.10425, Ma et al. 2511.13391, Takhanov et al. 2606.18984, Sun–Wang 2607.20359) does not touch dim 5. Dim 6 is 72 / 77.
- https://arxiv.org/abs/0902.1105 — , hence . Still the published upper bound. HTML https://ar5iv.labs.arxiv.org/html/0902.1105v3 Table 1: range of possible values limited from to .
- https://arxiv.org/abs/2412.00937 — v3 (4 Mar 2026): “the kissing number in five dimensions appears to be 40, although the best upper bound that has been proved is 44”. Four 40-point geometries. No size 41.
- https://arxiv.org/abs/math/0608426 — Bachoc–Vallentin, before Mittelmann–Vallentin.
- https://arxiv.org/abs/1507.03631 — survey story .
- https://arxiv.org/abs/math/0501493 — Pfender kernel. Improves kissing bounds in dims 10, 16, 17, 25, 26. Does not give an exact dual below 44 in dim 5.
2026-08-27 — record still (q7)
Opened tonight:
- https://teorth.github.io/optimizationproblems/constants/29a.html — , range , conjectural value 40. Upper bound cited is Mittelmann–Vallentin. No later endpoint.
- https://cohn.mit.edu/kissing-numbers/ — dim 5 lower 40, upper 44, ratio 1.100, citations [9] Korkine–Zolotareff and [17] Mittelmann–Vallentin. Dim 6 is 72 / 77. Later-dimension news (Cohn–Li, Ho 2603.10425, Ma et al. 2511.13391, Takhanov et al. 2606.18984, Sun–Wang 2607.20359, Bianchi et al. 2606.10402) does not touch dim 5.
- https://arxiv.org/abs/0902.1105 — , hence . Still the published upper bound. HTML https://ar5iv.labs.arxiv.org/html/0902.1105v3 Table 1: range of possible values limited from to .
- https://arxiv.org/abs/2412.00937 — v3 (4 Mar 2026), title “Variations on five-dimensional sphere packings”: “the kissing number in five dimensions appears to be 40, although the best upper bound that has been proved is 44”. Four 40-point geometries. No size 41.
- https://arxiv.org/abs/math/0608426 — Bachoc–Vallentin, before Mittelmann–Vallentin.
- https://arxiv.org/abs/1507.03631 — survey story .
python3 scripts/arxiv_fetch.py on 0902.1105v3, 2412.00937v3,
math/0608426v4, 1507.03631: metadata matches; RESEARCH already had
stubs for the first three.
2026-08-27 — record still (q8)
Opened tonight:
- https://teorth.github.io/optimizationproblems/constants/29a.html — , range , conjectural value 40. Upper bound cited is Mittelmann–Vallentin. No later endpoint.
- https://cohn.mit.edu/kissing-numbers/ — dim 5 lower 40, upper 44, ratio 1.100, citations [9] Korkine–Zolotareff and [17] Mittelmann–Vallentin. Dim 6 is 72 / 77. Later-dimension news does not touch dim 5.
- https://arxiv.org/abs/0902.1105 — , hence . Still the published upper bound.
- https://arxiv.org/abs/2412.00937 — v3 (4 Mar 2026): “the kissing number in five dimensions appears to be 40, although the best upper bound that has been proved is 44”. Four 40-point geometries. No size 41.
python3 scripts/arxiv_fetch.py on 0902.1105 and 2412.00937:
stubs already present.
2026-08-29 — wrap, record still
Opened again before the q8 wrap:
- https://teorth.github.io/optimizationproblems/constants/29a.html — , range , conjectural value 40.
- https://cohn.mit.edu/kissing-numbers/ — dim 5 lower 40, upper 44, ratio 1.100.
- https://arxiv.org/abs/0902.1105 — , hence .
- https://arxiv.org/abs/2412.00937 — v3 (4 Mar 2026), authors Henry Cohn and Isaac Rajagopal: appears to be 40, proved upper bound 44. No size 41.
No stored verified leftover DRAT from the type- or hunts. Incomplete search; not a move of either endpoint.