upvote
I postulate: "there is no machine that can produce brass springs".

A party interested in proving me wrong wheels in a machine draped in a cloth. They reach under the cloth to turn it on. It whirs and a short while later ejects a brass spring.

No matter what kind of machine is under the cloth, my theory has been proven false. I should reveal the machine under the cloth only if I'm interested in knowing how the machine works, but either way there is clearly a machine that can produce brass springs.

Now we have a sequence of Lean statements that satisfies the Riemann hypothesis, the fact that you can do it at all is the part we're interested in, and it's the part that proves it. If you want to know why, you can read all 17 million lines.

reply
The proof is written in a programming language called Lean. Very roughly, Lean is set up so that proofs are functions and theorems are types in this language. Verifying that the proof is correct essentially amounts to compiling the program and confirming that it doesn't have any type errors. Several people have compiled the program successfully, so we believe it's correct.

The biggest concern that people have is that there might be a bug in the type checker that the proof is exploiting. But a) it's been compiled with multiple independently-implemented compilers, which are are unlikely to have the same bugs, and b) some of those compilers have themselves been proven to contain no bugs. So, it is exceedingly likely that the proof is legitimate.

Now, whether we can understand the proof is an open question...

reply
You can mechanically show that it is internally consistent, and large parts of this are based on a library of rules and constraints that have been used in many other proof formulations so it's not like there's a hidden "when 1 = 0" in there somewhere. But, I share your skepticism until further human review.
reply
You can run through all the steps of the proof and if you can use any of them to prove something like "true = false" then you know you found a Lean bug.
reply
The same idea as how you can know a Rust program is memory safe.

You look for any unsafe blocks, and then run the type checker.

reply
the vibe checkers are checking the vibe code exactly right around the biggest ipo ever. i dunno man ive watched everyone get a little bit of AI psychosis (for lack of a better word) at this point and ive seen web apps drift into unmanageable states that are no longer understood. 17 million lines of code? lol
reply
deleted
reply