| ▲ | itsthecourier 4 hours ago | |||||||
why a lean proof is so big? it needs to be compiled and tested with a lot of cases or what may it be? | ||||||||
| ▲ | killerstorm 4 hours ago | parent | next [-] | |||||||
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. | ||||||||
| ▲ | pretzellogician 2 hours ago | parent | prev | next [-] | |||||||
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.” | ||||||||
| ||||||||
| ▲ | wasabi991011 3 hours ago | parent | prev | next [-] | |||||||
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). | ||||||||
| ▲ | ht-syseng 4 hours ago | parent | prev [-] | |||||||
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. | ||||||||