The Secret Project to Settle Controversial Maths Proof with a Computer

The Secret Project to Settle Controversial Maths Proof with a Computer

New Scientist – Robots
New Scientist – RobotsApr 10, 2026

Why It Matters

Resolving the ABC conjecture would cement a major theoretical breakthrough and influence fields like cryptography, where number‑theoretic insights drive security protocols.

Key Takeaways

  • Two independent computer projects target verification of Mochizuki's ABC proof
  • One project ran in secrecy for over two years
  • Mochizuki's 500‑page proof remains largely unverified by peers
  • Computer validation could finally end the decade‑long controversy
  • Confirmation would impact number theory and modern cryptography

Pulse Analysis

The ABC conjecture, first articulated in the 1980s, links the sizes of three integers a, b, c that satisfy a + b = c to the product of their distinct prime factors. Though its statement is deceptively simple, a proof would ripple through Diophantine analysis, elliptic curves, and the distribution of prime numbers. Shinichi Mochizuki’s 2012 claim of a proof—spanning 500 pages of novel "inter-universal" theory—triggered both awe and skepticism, as the mathematical community struggled to parse its unconventional framework.

In recent months, two parallel computational initiatives have emerged to cut through the interpretive bottleneck. One, operating covertly for over two years, has built a suite of formal verification tools that translate Mochizuki’s arguments into machine‑checkable logic. The other, publicly announced, leverages high‑performance symbolic algebra systems to test critical lemmas and boundary cases. By automating the validation process, these projects aim to provide an objective, reproducible assessment that bypasses the need for every specialist to master the intricate new language.

If either effort succeeds, the ramifications extend beyond academic closure. A confirmed ABC proof would tighten bounds used in algorithms for integer factorization and elliptic‑curve cryptography, potentially reshaping security standards. Moreover, the methodological breakthrough—applying large‑scale formal verification to deep, abstract mathematics—could set a precedent for tackling other long‑standing conjectures. The mathematics world watches closely, aware that a computational verdict may finally resolve one of its most polarizing debates.

The secret project to settle controversial maths proof with a computer

Comments

Want to join the conversation?

Loading comments...