OpenAI announced solving mathematical problems including an improved sphere packing bound. Sphere packing—finding the optimal density of non-overlapping equal-sized balls in space—is a fundamental problem with applications to error-correcting codes. Dimensions 8 and 24 are special cases where optimal packings (E8 and Leech lattices) have been proven, while most other dimensions remain unsolved.