Google Deepmind's AlphaProof Nexus solves decades-old math problems for a few hundred dollars

Background

The central fact is not just that AlphaProof Nexus solved hard math problems, but that it did so in a formally verified way. The article contrasts Google DeepMind’s system with OpenAI’s natural-language approach, highlighting two different philosophies in AI reasoning:

• one prioritizes natural-language mathematical argumentation
• the other prioritizes formal proof verification through Lean

That distinction matters because mathematics is unusually sensitive to small logical errors. A natural-language proof may sound convincing while still containing a gap; a Lean-verified proof must pass a compiler-like check at every step.

Key Points

Nine open Erdős problems solved

The headline achievement is the autonomous solution of nine open Erdős problems. Because Erdős problems are associated with serious combinatorial and number-theoretic difficulty, the result signals more than benchmark performance. It suggests the system can contribute to live mathematical research rather than merely solve curated exercises.

Two problems resisted humans for 56 years

The most dramatic detail is that two of the solved problems had stumped mathematicians for 56 years. This sharpens the claim from “capable” to “historically significant.” If accurate, AlphaProof Nexus is not only accelerating known methods but also reaching problems that remained untouched across generations of human work.

Very low inference cost

The article emphasizes “a few hundred dollars per problem” in inference costs. That is important because it changes the economics of experimentation. A system that can attempt serious research-level problems at such low marginal cost creates the possibility of scaling mathematical search in a way human labor cannot.

This does not mean every attempt is cheap in aggregate, however, because low per-problem cost must be weighed against the low hit rate.

Formal verification via Lean

The strongest technical point is the use of the Lean compiler to verify every proof step automatically. This gives the system a major advantage in trustworthiness:

• proofs are not accepted on stylistic persuasiveness
• each intermediate step must satisfy a formal checker
• the output is therefore closer to mathematical certainty than ordinary language-based reasoning

This likely explains why the article frames AlphaProof Nexus against OpenAI’s approach. The competition is not only about solving problems, but about what counts as a reliable solution.

Success rate remains just 2.5 percent

The article tempers the excitement with a critical limitation: the overall success rate is only 2.5 percent. This is a severe constraint. It means the system is impressive in peak performance but weak in consistency.

A 2.5 percent success rate implies:

• the system fails on the overwhelming majority of attempts
• broad claims about general mathematical intelligence would be premature
• the cost per successful outcome may be much higher when failed runs are included

So while the solved problems are remarkable, the low success rate suggests AlphaProof Nexus is currently better understood as a high-variance research instrument than a dependable all-purpose theorem prover.

Significance

The article points to a deeper shift in AI mathematics: formal systems may outperform natural-language systems where correctness matters most. In many domains, sounding right is enough to be useful. In mathematics, that is not enough. By grounding proof generation in Lean, AlphaProof Nexus addresses the core weakness of language-model reasoning: unverifiable confidence.

At the same time, the 2.5 percent figure prevents overstatement. The article presents a system that is simultaneously:

• extraordinary in best-case results
• limited in average-case reliability

That tension is the real takeaway. The breakthrough is not that AI has “solved mathematics,” but that machine-verified proof search can occasionally surpass decades of human effort at surprisingly low direct cost.

Broader Implication from the Article’s Framing

The comparison with OpenAI suggests a competitive divide in AI research strategy:

1. Natural-language mathematical reasoning aims for flexibility and accessibility.
2. Formal verification-first reasoning aims for rigor and certainty.

The article clearly favors the second as the more consequential development in this context. Since AlphaProof Nexus is being credited with solving open problems rather than merely generating plausible arguments, the implication is that formalism may be the more fruitful path for frontier mathematical discovery.

Final Assessment

The article presents AlphaProof Nexus as a proof of concept for autonomous, low-cost, formally verified mathematical discovery. Its nine solved Erdős problems, especially the two unresolved for 56 years, show genuine research-level power. But the 2.5 percent success rate is a major reminder that this is not yet robust or general. The achievement is therefore best viewed as a narrow but real breakthrough: not reliable enough to replace mathematicians, yet strong enough to alter expectations about what AI can already do in pure mathematics.