
Google researchers report that a multi-agent system powered by Gemini 4 produced a full proof of the 2013 Courtade–Kumar conjecture, formalized across 50 million lines of the Lean 4 proof assistant.
The result, shared via X, marks one of the largest machine-generated formal proofs attempted to date. The conjecture concerns the maximum entropy of certain binary functions, a question that had resisted a clean proof for more than a decade.
More significant than the theorem itself is the method. The researchers describe a coordination of specialized agents that decompose the problem, generate candidate arguments and translate them into a machine-checkable form. The output is not a summary a human skimmed, but a formal derivation that Lean 4 verifies end to end.
The advance raises a question that will shape the field: as proofs grow to millions of lines, how does the community audit the reasoning that produced them? Some mathematicians argue the real value is a new division of labor, where machines handle the exhausting formalization and humans interpret the ideas, while others warn that a proof too large to read strains the very notion of verification.
Image source: i.ibb.co