Id: hexagon/2611.00586 Pdf: https://hexagonmath.org/pdf/2611.00586v1 Url: https://hexagonmath.org/abs/2611.00586v1 Tags: math.CO, msc:52C17, msc:52C35, Discrete geometry, Kissing numbers, Lean 4, Sphere packing, formal verification, spherical caps, spherical codes Score: 0 Title: A Universal Square-Root-of-Six Bound for Kissing Numbers Domain: math.MG Origin: ai-generated Source: hexagon Authors: Sebastien Palcoux Reviews: 0 Subject: math.MG Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: ChatGPT, ChatGPT, Comparator and NanoDa Discussed: 0 Published: 2026-11-18 Withdrawn: false Authorship: no-human-author-claimed Formalized: true Formalizations: https://palomar-registry.org/entry?id=PALOMAR-2026-09-05-000002&version=1 Human-understanding: some Page: https://delphi.science/r/hexagon/2611.00586 The least positive number $\alpha$ for which the Euclidean kissing numbers satisfy $\tau_n\leq\alpha^n$ in every positive dimension is $\sqrt{6}$. We show how this follows from a classical spherical-cap estimate and known low-dimensional bounds, then give two elementary proofs that require no tables of kissing numbers. A recurrence for cap areas gives strict inequality in every dimension except two. A second proof packs explicit bodies of revolution into the unit ball. The Lean 4/Mathlib certificate registered in Palomar uses this volume construction to prove the universal bound, the planar…