I haven’t seen people talk about this at all, so thought I’d share this article about it. For those depressed that no one will actually understand the RH Proof: we have another, entirely human proof which means there are humans who understand it. It might have been overshadowed, but assuming it ends up working out (I have heard there have been some problems found, hopefully they are surmountable) then I think it will be the far more impactful result.



An analogy for the CS people: Generating the proof/term is in NP, but (type) checking the proof/term is in P.
(All analogies are flawed, and this one is no exception.)
LLMs and static type systems are a near-perfect marriage, since the type checker serve as a fast, perfectly accurate oracle. The fact that dependent type systems and constructive mathematics are basically the same thing means LLMs get better at maths much faster than things with worse oracles.