Skip to main content
London Tutorsby KnowledgeDottCom

17 November 2026 · London Tutors

AI Teams Settle a 2013 Maths Puzzle About Messages Sent Through Noise — and a Computer Checked the Proof

Google Research reports that teams of AI agents working with mathematicians have proved the 2013 Courtade–Kumar conjecture — and the whole argument has been checked by computer in the Lean proof assistant.

AI Teams Settle a 2013 Maths Puzzle About Messages Sent Through Noise — and a Computer Checked the Proof

Imagine sending a message through a crackly radio channel, where every bit of it can flip by accident. If you are only allowed to keep one single bit of the message — one yes-or-no answer — what is the cleverest thing to keep? A conjecture from 2013 said the answer is surprisingly boring: just copy one of the original bits, unchanged. Now, researchers working with teams of AI agents say they have proved it — and a computer has checked every step of the proof.

The puzzle is called the Courtade–Kumar conjecture, after the researchers who posed it in 2013. It is a question in information theory, the mathematics of how messages survive noise. It asks which single-bit summary of a random string of bits preserves the most information after the string passes through a noisy channel. The conjecture says no clever combination can beat the simplest possible method: the "dictator" function, which just outputs one raw input bit.

In a post on 13 November 2026, Google Research described how researchers from Google, the Chinese University of Hong Kong, the University of Southern California and Carnegie Mellon University proved the conjecture in full generality, working with a multi-agent AI system called Antigravity's /teamwork, running the Gemini 4 Argon model. The system split the long argument between specialist agents — some drafting solutions, others hunting for flaws — and used the Lean 4 proof assistant to verify each step automatically. The proof itself appeared as a preprint on 21 September 2026 (arXiv:2609.24931), and the machine-checked formalisation runs to about 50 million lines of Lean code. An independent audit confirmed that count, while noting that only around 239,000 of those lines are proof a person could read — the rest is computer-generated certificate data that the Lean kernel checks mechanically.

As with any big claim, the fine print matters. The work has not been peer-reviewed, and other mathematicians published independent proofs of the same conjecture within a day of the preprint, so this was a race with several finishers. Google also says the same system produced a machine-checked formalisation of the famous Weil conjectures, but it has published no code for that claim yet, so nobody outside the company can check it. The Courtade–Kumar formalisation, by contrast, is public and has been independently rebuilt and checked.

For students, the story shows two things: that a simple-sounding question can stay open for thirteen years, and that mathematics now has a new kind of teamwork — people, AI agents and proof-checking computers, each doing the part they are best at. If your child loves puzzles, patterns and logical thinking, you can find a maths tutor to stretch them, post a tutoring request and compare tutors, or join group lessons for extra challenge.

Book your first lesson in maths and explore puzzles, patterns and problem-solving together: Book your first lesson

Sources:

  • Chen, Z. et al., "A Proof of the Most Informative Boolean Function Conjecture", arXiv:2609.24931, 21 September 2026 (preprint, not peer-reviewed).
  • Google Research, "Advancing science & engineering with Antigravity's /teamwork", by Vahab Mirrokni, 13 November 2026, via Tech Bytes: https://www.techbytes.app/posts/advancing-science-and-engineering-with-antigravitys-teamwork/
  • Sysnote, "Google's /teamwork math claims, checked: 99.5% of the 50 million Lean lines are certificates, and the Weil formalization isn't public", 14 November 2026: https://sysnote.net/news/google-s-teamwork-math-claims-checked-99-5-of-the-50-million-lean-lines-are-cert

Curious about maths? Post a request on London Tutors and compare verified maths tutors — online, in person or in a group class.

Ready to find the right tutor?

Browse verified tutors, compare profiles, and book a trial lesson — free to sign up.

Find a tutor — sign up free

Related guides