upvote
Genuine question: if I make 250k pages of lean that compiles, how do we know what it proved?

If it was as trivial as stating the expression and compiling then there would be easy verification and consensus as soon as it compiles on multiple kernels?

reply
The result proved is not 250k pages. The theorem should be much smaller and a formal version of RH.
reply
Among those who have experience with lean there is consensus that it is correct and the Riemann theorem is proven.
reply
The "there is a consensus" standard of proof isn't strong when it comes to maths. People are generally looking for a rigorous argument why something must be true.
reply
> The "there is a consensus" standard of proof isn't strong when it comes to maths.

Says who? I don't mean that in a rude way, it's a genuine question. Is that the opinion of the community of mathematicians who are capable of understanding these type of proofs, or software engineers who believe nothing can be true unless you can read the code yourself and understand it?

reply
I'll try to make it simpler: code compiles = the proof of the encoded statement is correct, by definition. Whether the encoded statement and the one you have posed are the same -- at 250k pages that remains to be seen.
reply
No. The lean statement itself is maybe half a page (I don’t know the exact amount but in this order). Checking that the lean statement is the GRH is elementary. The 250K pages are a ‘path’ from the statement (GRH) to the axioms encoded in Lean. The fact that is ‘compiles’ means the path is correct.
reply
Yep, fair point. Someone else has posted a link to the GRH statement. It's complete gibberish to me but for someone qualified checking half a page of code should be straightforward.
reply