LecturaInvestigaciónRadarMarco de inversión
Iniciar sesión / Registrarse
← Volver a la lectura
NoticiasEstructural1 min de lecturaEditorial de DisconfirmAI

Independent mathematicians verify AI proof of Riemann hypothesis, error chance near zero

Independent researchers have successfully compiled the Lean code for the AI-generated Riemann hypothesis proof. Experts state the probability of logical errors is approximately zero, though a final semantic check remains.

2026-11-21 05:00 GMT+8

Mathematicians are now almost certain that the AI-created proof of the Riemann hypothesis is valid. Anthropic mathematician Levent Alpöge claimed to have used the company’s Claude AI model to solve the problem, which was first posed in 1859 and suggests a hidden pattern underlies the distribution of prime numbers.

Alpöge initially checked the work by writing out the proof using the programming language Lean; if a Lean-coded proof compiles error-free, this is usually taken as confirmation that the logic and math in each step is correct. Independent researchers, including Andrew Sutherland, a mathematician at M.I.T., have now separately compiled Alpöge’s result in Lean without issues.

“The Lean proof has been compiled and independently re-checked by the Lean kernel with only the three standard axioms,” Sutherland says. “Honestly the chance that anything is fishy here is approximately zero.”

However, some questions remain regarding whether the proof addresses the exact statement of the Riemann hypothesis or establishes a subtly different point. Researchers are still making sure that nowhere in the proof was there a hack, dodge or shortcut that changed the meaning of the initial hypothesis or any other mathematical rules or truths. This process, called a “comparator run,” typically takes a matter of hours.

Fuentes

Iniciar sesión / Registrarse
LecturaInvestigaciónRadarMarco de inversión
scientificamerican.com
Scientific American
↗
Continuar investigando →