Daniel Litt
31.7K posts

Daniel Litt
@littmath
Assistant professor (of mathematics) at the University of Toronto. "Tireless math ronin." Algebraic geometry, number theory, etc. He/him.





Also, very exciting news! Another math problem (potentially) solved, this time, one posed by @littmath! Last wednesday in a last try with GPT-5.5 pro before 5.6 pro came out, I got an interesting partial on this problem. This prompted me the next day to use GPT 5.6 sol pro, which essentially autonomously worked through the remaining parts and managed to complete the solution by drawing on somewhat obscure techniques. I messaged Daniel with my findings and thoughts, particularly on the exposition and digestability to make sure this proof contributes something genuinely meaningful to the world. And, I believe this task is quite succesful. Though the main crux of the argument relies on these Raynaud bundles, nonetheless the connection is nontrivial and new in this specific application! The remaining work is now to digest the proof. As the subject expert Daniel had some great insights and feedback which I have tried hardest to include. It's my belief that this proof taught us about a new and exciting tool and angle to handle such problems! Particularly suprising to me is that with sufficient steering, the output of GPT-5.6 sol pro is remarkably incredible, and upon further inquiries, it seems to genuinely be able to present the underlying geometry of the problem and abstract from it to reason through the complete construction. Exciting times! I definitely see a very very clear improvement from GPT-5.5 pro in math, and it seems 10 times more trustworthy in its output, and its exposition in these proofs also improved a ton. #post-50" target="_blank" rel="nofollow noopener">problemsilike.com/forum/thread/1…











Yesterday, we made GPT-5.6 Sol Ultra generally available. Today, we're sharing that it produced a proof of the 50-year-old Cycle Double Cover Conjecture using 64 subagents in just under one hour. We're sharing the prompt and proof below. We're excited to see what you all do with Ultra!



Yesterday, we made GPT-5.6 Sol Ultra generally available. Today, we're sharing that it produced a proof of the 50-year-old Cycle Double Cover Conjecture using 64 subagents in just under one hour. We're sharing the prompt and proof below. We're excited to see what you all do with Ultra!

The internet gave every single person on Earth access to all of MIT's lectures for free and I think most of us would agree that it hasn't made us that much smarter. I don't think the main problems and solutions here are technological.



You can grab an academic journal in almost any field, read two random articles from 1976 and two random articles from 2026, and immediately see how much worse it's become.




