AI solves a 'holy grail' problem from probability theory 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. 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. More 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.” Among 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.” On supporting science journalism If 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. Just 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. Mathematical Connections 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. Percolation 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