yes, nonsofic groups exist: this statement is one of many new beautiful results proved by Astra, our next major model.
We're releasing 10 such Astra proofs, complete with lean certificates and CoT walkthroughs for each of them. The results are wide-ranging, from von Neumann algebras (disproof of Connes' Rigidity Conjecture) to better bounds for high dimensional sphere packing, for circuit complexity, for monochromatic triangles in multicolored graphs, and more.
More thoughts here: https://t.co/8SjXONeh38
One of the major pains of academia is having to click through labyrinths of webpages to submit papers.
Now, thanks to @Josephmrich (and AI), problem solved!
His tool is called PaperPush and is available at https://t.co/pdakRf4KIe
It's super easy to use!
1/🧵
We’re giving scientists, mathematicians, and engineers free access to our frontier models—starting with 10,000 researchers and expanding to 100,000 through 2027.
ChatGPT for Academic Researchers is built to accelerate discovery across disciplines.
Terence Tao posted his ChatGPT session trying to understand the Jacobian conjecture counterexample. It's so lovely reading a slice of how his mind works, the connections he's making, etc.
https://t.co/wu6CcAk3V6
The International Math Olympiad (IMO) 2026, the hardest math contest for high schoolers, just ended.
I ran Fable (high), Sol (xhigh), K3 (max) and Axiom against it and all got a perfect score of 42/42 (repo below if you want to check their solutions):
— Claude Fable 5 was the solved it in 1 attempt, and was the fastest.
— GPT 5.6 Sol took 1 more attempts, and was cheapest.
— Kimi K3 did it but took 4 more attempts, and took a LOT of tokens.
— Axiom Math actually proved everything in Lean.
P3 and P6 were the hardest followed by P2, judging by attempts + num tokens.
Students had 9hrs to solve these 6 problems, and Fable and Sol were under 4hrs.
The frontier of AI has officially moved well past IMO math.