I cannot verify these claims myself as I'm not a mathematician, but from what I've read elsewhere, but a lot of mathematics is predicated on the RH being assumed true yet unproven.
As others have mentioned, it was proven using a theorem prover called LEAN which can validate that the proof is valid, which I imagine works in the same way that a compiler processes human-written software to prove that the program that was written is valid.
I think the proof itself is probably not very useful if it's not human readable, and while it seems like mathematicians have accepted it already, there is a small chance that it could always be invalidated if there's a bug in the LEAN compiler or its libraries. Hopefully it can be reduced from machine-written code into something more intelligible. And maybe the techniques can be studied and incorporated into future proofs.