Kissing Number Problem: Exact Values and AI Records

Quick answer: The kissing number in dimension n is the largest number of non-overlapping equal spheres that can all touch one central sphere. It is known exactly only in dimensions 1, 2, 3, 4, 8 and 24: 2, 6, 12, 24, 240 and 196,560. In other dimensions only bounds are known. AI systems keep raising lower bounds: in dimension 11, AlphaEvolve reached 593 in 2025 and a 2026 preprint (EinsteinArena) reported 604, while the upper bound is 868.

Put a coin on a table. How many identical coins can you arrange around it, all touching it? The answer is 6. Now do it with oranges in space: how many can touch one orange? That question started a famous argument between Isaac Newton and David Gregory in 1694, and it is still being fought, now with AI.

What Is the Kissing Number?

In \(n\)-dimensional space, the kissing number \(K(n)\) is the maximum number of non-overlapping unit spheres that can touch a central unit sphere. “Kissing” is the billiards term for balls that just touch.

Dimension \(n\)Kissing number \(K(n)\)Status
12Exact (two neighbors on a line)
26Exact (coins around a coin)
312Exact (Schütte and van der Waerden, 1953)
424Exact (Oleg Musin, 2003 preprint; published 2008)
8240Exact (Odlyzko–Sloane and, independently, Levenshtein, 1979)
24196,560Exact (same, 1979)
11\(604 \le K(11) \le 868\)Open; 604 from a 2026 preprint

Newton vs. Gregory

In three dimensions, 12 spheres fit around one with noticeable gaps, so it looks as if a 13th might squeeze in. Gregory thought 13 might be possible; Newton said 12. Newton was right, but a rigorous proof had to wait until 1953.

Why Dimensions 8 and 24 Are Special

In these two dimensions, extraordinarily symmetric arrangements exist: the \(E_8\) lattice and the Leech lattice. They are so efficient that upper and lower bounds meet exactly (proved in 1979). Later, Maryna Viazovska used related structures in her Fields Medal-winning proof about sphere-packing density in 8 and 24 dimensions, a different problem.

AI vs. Humans: The Recent Records

DateResultWho
2022 (publicized 2025)Lower bounds 510 (dimension 10), 592 (dimension 11) and 1,932 (dimension 14), first posted July 2022Mikhail Ganzhinov (Aalto University), using highly symmetric arrangements
May 2025Dimension 11 lower bound raised from 592 to 593Google DeepMind’s AlphaEvolve
June 2026Dimension 11 lower bound raised to 604EinsteinArena (AI-assisted, preprint)
September 2026Improvements in 19 selected dimensions between 25 and 55, for example \(K(25) \ge 197{,}580\) (later reported raised to 197,583 by another group)A multi-agent AI system (“Qiushi Engine”), preprint

These are lower bounds: explicit arrangements that prove at least that many spheres fit. They do not settle the exact answer, which also needs a matching upper bound.

Why It Matters

Sphere arrangements in high dimensions are the math behind error-correcting codes used in phones, Wi-Fi and deep-space communication: each “sphere” is a codeword with room around it for noise.

Common Misconceptions

“AI solved the kissing number problem.” AI found better arrangements in some dimensions. Exact values are still known in only six dimensions.

Watch: The Kissing Number Problem in Video

If you learn better by watching, these videos are worth your time.

Kissing Numbers (Numberphile). A friendly introduction to the problem and its history.
Every Unsolved Math problem that sounds Easy (ThoughtThrill). Includes the kissing number problem among other easy-sounding open problems.

Check Your Understanding

Five quick questions to see how much of this has stuck. Pick an answer and press Submit; you will see a short explanation either way.

Answer each question and press Submit to see your result right away.

1. What is the kissing number in 2 dimensions?
Found a bug? Let us know!
2. What is the kissing number in 3 dimensions?
Found a bug? Let us know!
3. In which dimensions is the kissing number known exactly?
Found a bug? Let us know!
4. What is the best known lower bound for K(11) as of 2026?
Found a bug? Let us know!
5. What does a new lower bound show?
Found a bug? Let us know!

Frequently Asked Questions

What is the kissing number?

In n dimensions, it is the largest number of equal non-overlapping spheres that can all touch one central sphere of the same size.

What is the kissing number in 3D?

It is 12. Newton and Gregory argued about whether 13 might fit in 1694; Schütte and van der Waerden proved 12 is the maximum in 1953.

Has AI solved the kissing number problem?

No. AI systems have raised lower bounds, such as 593 (2025) and then 604 (2026) in dimension 11, and found better constructions in many higher dimensions, but exact values are known only in dimensions 1, 2, 3, 4, 8 and 24.

Why are dimensions 8 and 24 special?

They have exceptionally symmetric arrangements, the E8 lattice and the Leech lattice, which let mathematicians prove the exact kissing numbers 240 and 196,560.

Keep Exploring

Sources and Further Reading

Related to This Article

What people say about "Kissing Number Problem: Exact Values and AI Records - Effortless Math"?

No one replied yet.

Leave a Reply