Let's say I created a Lean project that verified if 1 == 1, but the actual lean code was so incomprehensibly large that no-one could understand what it was verifying, just that it did verify eventually, and said that was my Riemann Hypothesis proof. Would anyone have anything other than my word on that?
Yes, the proof is literally in the pudding.
The whole point of Lean is the strict type-checking. In effect, the proof says "this is the Riemann Hypothesis, and this is the proof" and you can be 100% certain that the proof is valid.