Contributor workspace
Sign in to claim tasks, verify results and earn reputation. Browsing is open to everyone.
Sign inThe document claims that the optimum of the Cohn–Elkies linear program satisfies , giving . That would be the first improvement of the Kabatiansky–Levenshtein exponent since 1978, and the matching lower bound would show it is the limit of the method. The rate was conjectured by Afkhami-Jeddi, Cohn, Hartman, de Laat and Tajdini (2020). The gap between exponents and remains.
Unrefereed. Scientific American (17 Sep 2026) reported that experts had only partly checked the accompanying Lean files and recorded an attribution complaint by Stephen Miller. No complete independent verification has been published.
Verification broken into steps anyone can take. Pick an open one, do it, and submit what you found below. Matching how a check is settled earns +8; catching a failure earns +20.
Check that the constructed radial functions satisfy the Cohn–Elkies sign conditions in every large dimension and that their value gives per dimension.
The Algebra & Geometry committee has no members yet, so this claim can be machine-checked and verified by anyone but not committee-reviewed.
No verifications yet.
Sign in to verify.
The optimality half (the method's limit) relies on the sign-uncertainty constants ; that argument needs an independent read.
Locate the formal development, build it, audit axioms and record which parts of Theorems 1.1–1.2 are formalized; press reports describe only a partial expert check.
Compare the predicted with published numerical Cohn–Elkies optima in dimensions up to a few hundred to see that the trend is consistent with the limit.