OpenAI's Astra Solves 10 Open Math Problems for Around $2,000 in Compute
OpenAI announced that an internal version of its upcoming Astra model produced solutions to ten open problems spanning fields including group theory, quantum complexity, lattice cryptography, and combinatorics. Notable results include a construction establishing the existence of non-sofic groups, a disproof of Connes's rigidity conjecture, and a superexponential lower bound resolving a longstanding Erdős problem. The total computational cost of finding all ten solutions amounted to roughly $2,000 at standard API rates. Each proof was formalized as a machine-checkable Lean certificate, which independently verifies the logical validity of the arguments, addressing concerns about reliability of AI-generated proofs. Human researchers collaborated with the model to prepare manuscripts, and the verified proof files have been made publicly available on GitHub.
This is an AI-generated summary. ShortSingh links to the original source for the complete article.
Discussion (0)
Log in to join the discussion and vote.
Log in