These proofs really are quite huge. The proof is 1.3GB, ~15M lines of code:
mkdir -p riemann_proof && cd riemann_proof
# fetch parts 01–14
for i in {01..14}; do
curl -fSL -o lean.tar.gz.part$i https://alpo.ge/lean.tar.gz.part$i || { echo "failed: part$i"; break; }
done
# join and decompress (creates ./lean)
cat lean.tar.gz.part{01..14} > lean.tar.gz
tar xzf lean.tar.gz
# size, file count, line counts
du -sh lean | cut -f1 | xargs printf '%s on disk (lean folder)\n'
find lean -name '*.lean' | wc -l | xargs printf '%s .lean files\n'
find lean -name '*.lean' -print0 | xargs -0 cat | wc -l | xargs printf '%s lines total\n'
find lean -name '*.lean' -print0 | xargs -0 cat | grep -cv '^[[:space:]]*$' | xargs printf '%s non-blank lines\n'And the human "book" is 250k pages (!)...
In a sense that is not surprising. If there were a short proof to a famous 150 year old maths problem it would likely have been found by now.
Presumably as LLMs work their way through the rapidly shrinking list of Millenium Prize problems, it will be the case that none of them have concise enough solutions that they would have ever been solved by a human unaided.
Isn't there a way to reduce this? What's the reason for such a massive size? Are there "already proven" proof libraries in Lean that the LLM is not using like reinventing the libc from scratch?
Yikes. I'm definitely not taking this one for granted until this has been reviewed thoroughly. That's a lot of room for shenanigans/bugs.
And presumably you need hundreds of GBs of RAM to compile it. Would be nice if someone with a beefy machine could confirm?
Could a math proof really need 15M lines to write out? I don't buy it.
why a lean proof is so big? it needs to be compiled and tested with a lot of cases or what may it be?
Yeah, this smells like BS. A "proof" that no one will understand within the next 1-2 years, and even then it's questionable that anyone could ever seriously hold 250k pages in their mind, and that no single mistake or oversight has slipped in. This is a haystack with an unknown amount of needles in it, and gaining certainty that that amount is zero, is a whole other task.
Whoa.
One real problem with depending on Lean is that if there are any real bugs, then sufficiently-large swarms of agents are guaranteed to eventually come up with proofs that depend on the bug.