OpenAI's 'Astra' Claims Ten Advances on Open Math Problems With Lean-Verified Proofs

OpenAI presented Astra by releasing ten results it says advance long-open questions across mathematics and theoretical computer science, spanning disproofs, improved cryptography bounds, and other novel findings. Crucially, OpenAI attached machine-checkable Lean certificates, which supporters argued elevate the work above hype: 'machine-checkable Lean certificates prove this is legit, not hype,' one widely shared X post said, citing resolved Erdős problems and a disproved Connes rigidity conjecture.

The results ignited r/singularity, where a thread on a 'leaked paper attributed to OpenAI' claiming the first construction of a nonsofic group drew 903 upvotes, and a companion 'ten advances in mathematics' post drew 831 upvotes. Ethan Mollick signaled he was waiting for the verdict of a level-headed, AI-aware math professor — capturing the cautious-but-curious mood among experts.

The community also flagged cost: one estimate put the token spend for solving ten problems at roughly $2,000, and Karpathy-style discussions probed how to generalize evaluation beyond toy prompts. That framing matters because it situates Astra in an emerging debate about whether frontier models can do genuinely novel research versus expensive search over known techniques.

Skeptics urge restraint until formal peer review: Lean verification confirms a proof is valid but not that the problem was truly 'open' at the claimed difficulty, nor that the model reasoned rather than retrieved. The 'leaked'/'attributed to' hedging in community coverage underscores that OpenAI's exact claims and methodology weren't fully public at disclosure. What to watch: independent mathematician confirmation, publication of the actual Lean artifacts, and whether the results survive scrutiny from the number-theory and group-theory communities.