Every problem here was open when it entered the pool.
Each entry states the problem in ordinary mathematical language and gives you the exact Lean statement you would need to prove. Nothing is paraphrased, so what you read is what gets checked.
Green's open problem 42 · Conjectures.io
Geometry
Withdrawn
Green's open problem 42
Can the Cohn-Elkies scheme be used to prove the optimal bound for circle-packings in 2 dimensions?
Withdrawn 6 Aug 2026
SOURCE_MISMATCH + EXPLOITABLE + SOLVED (SatisfiesCohnElkiesScheme omits continuity of f, so f 0 may be set at a single null point independently of fHat f 0 and any positive bound is attainable; submission aa57d955 exhibited a Gaussian modified only at the origin)
[CoEl03] Cohn, Henry, and Noam Elkies. "New upper bounds on sphere packings I." Annals of Mathematics (2003): 689-714.
[Vi17] Viazovska, Maryna S. "The sphere packing problem in dimension 8." Annals of mathematics (2017): 991-1015.
[CKM17] Cohn, H., Kumar, A., Miller, S., Radchenko, D., & Viazovska, M. (2017). The sphere packing problem in dimension 24. Annals of mathematics, 185(3), 1017-1033.
[Sa21] Sardari, Naser Talebizadeh. "Higher Fourier interpolation on the plane." arXiv preprint arXiv:2102.08753 (2021).
Something wrong with this formalization?
A statement that does not faithfully capture the original conjecture is the one real risk here, so we would rather hear about it early - before someone spends weeks on it.
Our channel is in the Bittensor Discord server. Join the server first, then open the channel to send your report.