Ten Problems, One Common Thread
Astra's headline result is the first explicit construction of a non-sofic group, closing a question mathematician Mikhail Gromov opened in 1999 [2]. It also produced a disproof of Fields Medalist Alain Connes's 1980 rigidity conjecture. Eight more advances round out the list: the first improvement to the general upper bound on high-dimensional sphere-packing density since 1978, three problems from the Erdos catalogue, a quantum parallel repetition theorem, new circuit complexity lower bounds, and a hardness result for the closest vector problem that bears on lattice-based cryptography [3]. OpenAI says the internal, unreleased model produced all ten results for roughly $2,000 in compute [1].



