Remix.run Logo
▲ rdlw 3 hours ago

What assumptions could it change? The model should not be able to alter the definition of the RH, and if you want to prove to yourself that that definition is accurate, you just have to read through it and build a mental model of the Lean code: https://github.com/bhgomes/lean-riemann-hypothesis

Then if it constructs a valid proof in Lean, how could it be reward hacking? I suppose it could have found a Lean compiler bug, or a mistake in the formalization of the hypothesis. I would expect that those problems would be found and fixed reasonably quickly, and we would need to see if the proof could be fixed. Other than that, I suppose it could find a contradiction in ZFC, but that would be an even more incredible result than proving RH.

I don't really see the possibility for reward hacking with the stipulation that the proof is ultimately verified by compiling the Lean program.