upvote
Five years ago very few proofs (outside of logic) were formalized.

Proof assistants existed for 50 years - they are not new. But it's REALLY hard to formalize something which is not just logic.

Even just logic is not trivial. Russel's Principia Mathematica needed 360 pages before it can prove 1+1=2.

reply
prove that (Russell's definition of 1 as a set) (Russell's definition of + in terms of set operations) (Russell's definition of 1 as a set) = (Russell's definition of 2 as a set), that is

He did not prove one apple and one apple make two apples, he proved that his complicated definitions of arithmetic using sets were not completely broken.

reply
For whatever reason, the LLMs currently generate very long proofs of results. For example, they often rephrase earlier arguments rather than citing them, or repeat their own arguments. (I've experienced these myself.)

It'll just take some work to simplify this.

From Alpoge himself: "My intuition insists it will be massively simplified, likely immediately.”

reply
This is true for code, even frontier models, they will often not use a library, or not modify the library but rewrite an almost identical function(s), etc. It's very interesting and needs constant vigilance
reply
Sounds like a massively parallel search of all possible paths since they have so much compute now
reply
judging by claudes review because it actually rebuilds and proves a bunch of stuff in mathlib that wasn't sufficiently formalized, but were required dependencies.
reply
I suspect it includes a lot of formalization of existing, peer-reviewed mathematics. Including these bloats the code but makes the verification more self-contained (less AI-written unverified inputs to lean).
reply