{"slug": "ai-solves-a-holy-grail-problem-from-probability-theory", "title": "AI solves a 'holy grail' problem from probability theory", "summary": "Anthropic released a proof of the long-standing percolation theory conjecture on GitHub, generated by a large language model, just days after Fields Medalist Hugo Duminil-Copin wrote on August 30, 2026 that it was \"only a matter of time before the most famous conjecture in our field ... also falls to the bulldozers.\" Mathematician Benedikt Jahnel of the Technical University of Braunschweig said the result evoked \"ambivalent feelings,\" mixing joy that the conjecture was proven with disillusionment that the final step came from an AI. Percolation theory, which dates to 1957 work by Simon Ralph Broadbent and John Michael Hammersley, concerns the threshold value p_c above which a network can contain an infinite connected cluster.", "body_md": "How does a coherent structure emerge from many small random occurrences? For instance, at what point are there enough openings in a sponge for a liquid to flow through? Such questions are critical to a long-standing puzzle of percolation theory, a subfield of probability theory focused on the permeability of networks.\n\nMore specifically, for years, mathematicians have sought to better understand a threshold that applies to these networks: above this threshold, the odds are high that a particular network is comprised of infinite open connections, while below it, those odds are low. Better characterizing of this transition has been considered a holy grail for the field. As mathematician Benedikt Jahnel of the Technical University of Braunschweig in Germany has puts it, “If someone manages to solve this problem, they’ll probably receive a Fields Medal.”\n\nAmong the many experts who have attempted to find this threshold is French mathematician Hugo Duminil-Copin, who himself received a Fields Medal in 2022 for his work on phase transitions in statistical physics—a topic connected to probability theory. But when it came to the percolation theory conjecture, he, like all the rest, failed. And on August 30, 2026, Duminil-Copin expressed concern in an essay on the new blog Proofs and Prompts that AI would [__likely beat humans__](https://proofsandprompts.com/2026/08/30/care-for-a-little-more-ai/) to the punch, writing that it would be “only a matter of time before the most famous conjecture in our field ... also falls to the bulldozers.”\n\n## On supporting science journalism\n\nIf you're enjoying this article, consider supporting our award-winning journalism by [subscribing](https://www.scientificamerican.com/getsciam/). By purchasing a subscription you are helping to ensure the future of impactful stories about the discoveries and ideas shaping our world today.\n\nJust days after he posted those words, exactly that seems to have happened: the [__artificial intelligence company Anthropic released a proof of the conjecture__](https://github.com/anthropics/formal-math/commit/795efb86f191735c5481675763537cfb4ff37e55) generated by a large language model. “The result evoked ambivalent feelings,” Jahnel tells me. Alongside joy that the conjecture had finally been proven, there was a certain disillusionment that the final, crucial step came from an AI.\n\n**Mathematical Connections**\n\n[__Percolation theory emerged in 1957__](https://www.cambridge.org/core/journals/mathematical-proceedings-of-the-cambridge-philosophical-society/article/abs/percolation-processes/C00CC4943F48228F8AC8031092FE84EC), when mathematicians Simon Ralph Broadbent and John Michael Hammersley investigated how different liquids flow through a porous medium. To do this, they modeled the medium as a network in which nodes correspond to holes and edges correspond to the cracks through which liquid moves. You can imagine this as a gigantic system of interconnected pipes that can each be opened and closed.\n\nPercolation theory is concerned with questions of which points are connected and which are not. More specifically, mathematicians want to find out whether a point (often assumed to be the origin) is part of an infinitely extended, connected cluster. Think again of a gigantic system of pipes, each of which is open or closed with a certain probability. If the probability, *p,* that an individual pipe is open is low, the probability that the point at the origin belongs to an infinite cluster of connected pipes, *θ*(*p*), is zero. On the other hand, if the probability, *p,* is high that a particular pipe is open, *θ*(*p*) takes on a larger value. Depending on the network’s geometry, there is a threshold value, *p*<sub>c</sub>*,* above which the probability *θ*(*p*) is greater than zero. That all means that the opening probability, *p*<sub>c</sub>*,* marks a transition between a network of limited connectivity and one where infinite connection can exist.\n\nUnfortunately, these *p**<sub>c</sub>* values are extremely difficult to calculate. In 1980 [__mathematician Harry Kesten succeeded__](https://projecteuclid.org/journals/communications-in-mathematical-physics/volume-74/issue-1/The-critical-probability-of-bond-percolation-on-the-square-lattice/cmp/1103907931.full) in finding one for a two-dimensional square lattice, showing that a probability of <sup>1</sup>⁄<sub>2</sub> marks the boundary between an unconnected and a connected system. But to date, only a few such percolation thresholds have been found. Hardly anyone assumes that exact values for *p**<sub>c</sub>* can be determined.\n\nArguably the most important question in percolation theory concerns the transition from a system with only finite clusters to one with infinite clusters. In one- and two-dimensional square lattices, mathematicians have long known that this transition is continuous. The probability *θ*(*p*) for a point in an infinitely large cluster does not increase abruptly from zero to a finite number but rather rises continuously with *p* from zero to one. The same can be demonstrated for generalizations of square grids in high dimensions. In these grids the points have many neighbors, allowing for statistical averaging that is not valid in lower dimensions. And [__when such networks are considered in eleven dimensions or higher__](https://arxiv.org/abs/1506.07977), a continuous transition occurs.\n\n[__The great puzzle of percolation theory__](https://arxiv.org/html/1712.04651v1) has been determining what this transition looks like for square lattices in the other dimensions: How does *θ*(*p*) change in dimensions 3, 4, 5,..., 10 as *p* increases? [__As Anthropic’s AI model has now shown__](https://github.com/anthropics/formal-math/commit/795efb86f191735c5481675763537cfb4ff37e55), the transition in these cases is also continuous, confirming what the mathematical community had suspected for decades.\n\n**The Future of Mathematics**\n\nSeeing work that could, in his opinion, garner a human a Fields Medal solved by an AI [__raises many questions__](https://www.scientificamerican.com/article/25-winners-of-maths-nobel-prize-decry-the-ai-invasion-of-their-discipline/), Jahnel says. For instance, [__will such prizes exist in the future__](https://x.com/ChrSzegedy/status/2078624857223536824)—and, if so, who will receive them? “Fields Medals have often, though not always, been awarded for proving theorems,” he adds. “Whether a human being will ever make it onto such a list again is questionable.”\n\nPerhaps these awards need to be reimagined—[__along with mathematics itself__](https://www.scientificamerican.com/article/mathematicians-confront-the-ai-apocalypse/). “Mathematicians no longer base their self-confidence and their *raison d’être* on proving conjectures,” Jahnel says, “but mathematics encompasses so much more,” including formulating conjectures, translating proofs and insights into the human world and incorporating them into textbooks.\n\nDuminil-Copin made a similar point [__in his essay__](https://proofsandprompts.com/2026/08/30/care-for-a-little-more-ai/): “A mathematical question is much more than a theorem waiting to be proved ... it is a lighthouse in the night: it illuminates and guides mathematicians in their wanderings, both esthetic and scientific.”\n\nUnderstanding, Duminil-Copin argued, is not gained solely through theorems and proofs but also through setbacks. In his own career, his attempts to find the holy grail of percolation theory led to other insights, for example. The hope is that these discoveries will not be lost with increasing use of AI models in mathematics.\n\n*This article originally appeared in* Spektrum der Wissenschaft *and was reproduced with permission. It was translated from the original German version with the assistance of artificial intelligence and reviewed by our editors*.", "url": "https://wpnews.pro/news/ai-solves-a-holy-grail-problem-from-probability-theory", "canonical_source": "https://www.scientificamerican.com/article/ai-solves-a-holy-grail-problem-from-probability-theory/", "published_at": "2026-09-30 15:51:22+00:00", "updated_at": "2026-09-30 16:21:49.438044+00:00", "lang": "en", "topics": ["artificial-intelligence", "large-language-models", "ai-research", "machine-learning"], "entities": ["Anthropic", "Hugo Duminil-Copin", "Benedikt Jahnel", "Technical University of Braunschweig", "Proofs and Prompts", "Simon Ralph Broadbent", "John Michael Hammersley", "GitHub"], "also_reported_by": [], "alternates": {"html": "https://wpnews.pro/news/ai-solves-a-holy-grail-problem-from-probability-theory", "markdown": "https://wpnews.pro/news/ai-solves-a-holy-grail-problem-from-probability-theory.md", "text": "https://wpnews.pro/news/ai-solves-a-holy-grail-problem-from-probability-theory.txt", "jsonld": "https://wpnews.pro/news/ai-solves-a-holy-grail-problem-from-probability-theory.jsonld"}}