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.
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...
You look for any unsafe blocks, and then run the type checker.