Mathematician says Lean code of Riemann hypothesis proof has passed nanoda checkHistory·OpenAI models solve open math problems
The Lean code passed the kernel check with no "sorry" and no additional axioms, but under Clay Mathematics Institute rules the work must go through formal publication and at least two years of verification.
Sources 1
A run of the nanoda kernel in paranoid mode on the Lean formalization of the Riemann hypothesis proof was completed by Andrew Sutherland, mathematician Bartosz Naskręcki reported on 21 November. According to him, the code contains neither a "sorry" — the placeholder for an unproven statement in Lean — nor any additional axioms. Naskręcki rates the probability that the proof is correct as very high. The claim of a proof produced by Anthropic employee Levent Alpöge together with the Claude model was made public on 20 November, US time. The Lean code is posted in 14 archives on Alpöge's personal site, with the posting running to more than 250 thousand pages. There had been no independent confirmation from the mathematical community as of the morning of 21 November. Under Clay Mathematics Institute rules, the work must go through formal publication and at least two years of verification. Skeptical mathematicians pointed to the absence of such confirmation by the community.