Further human + AI + proof assistant work on Knuth's "Claude Cycles" problem

TL;DR Highlight

A post sharing the process of solving the 'Claude Cycles' problem posed by mathematician Donald Knuth through collaboration between human experts, AI (LLMs), and formal proof assistants like Lean — demonstrating the real potential of AI to contribute meaningfully to mathematical research.

Who Should Read

Developers and researchers curious about how far AI can be used in mathematical reasoning or formal verification. Especially those interested in proof assistants like Lean or Coq, or AI for mathematics.

Core Mechanics

This post covers a collaborative approach using human mathematicians + LLMs (large language models) + formal proof assistants (e.g., Lean) to solve a mathematical problem called 'Claude Cycles' posed by legendary computer scientist Donald Knuth.
While the original tweet is inaccessible due to JavaScript being disabled, community comments and context indicate it reports further progress beyond previous work, showing that this kind of human-AI collaboration is producing real results in pure mathematics research.
LLMs are characterized as strong at 'broad but shallow search' — meaning that when an expert sets the direction, LLMs excel at rapidly exploring a wide possibility space and proposing candidate ideas.
Formal proof assistants like Lean and Coq are software tools that allow mathematical proofs to be written in a machine-verifiable form. Using these tools to verify proof ideas suggested by AI can reliably filter out errors.
Some in the community predicted that in the future, applying AlphaGo-style reinforcement learning (RL) to Lean's syntax tree will prove more powerful than LLMs, since RL on the Lean syntax tree enables reasoning over much longer time scales.
There was an observation that a professional mathematician's toolkit consists of roughly 10 core tricks, and if these tricks could be encoded as latent vectors (abstract representations inside AI models), AI could greatly accelerate mathematical research.
Overall, a sober assessment also coexists: AI handles 'repetitive expert-level tasks' well when guided by specialists, but still has blind spots when it comes to truly difficult and complex problems.

Evidence

"A witty comment went viral suggesting that 'AI will win a Fields Medal (the highest honor in mathematics) before it takes on the role of a McDonald's manager.' The argument is that while mathematics may seem like using a brain as a hammer to tighten a screw, LLMs' strength in 'broad and shallow search' actually makes them a good fit for mathematical research. There was also a prediction that AlphaGo-style reinforcement learning applied to Lean's syntax tree will become the dominant approach instead of LLMs, as RL-based methods can search over much longer time scales and are better suited for complex proofs. A realistic comment noted that it's unsurprising AI performs well when guided by experts — AI handles experts' 'lazy work' effectively, but still has blind spots on truly hard problems. One comment said it was hard to tell whether the thread participants were bots or humans, a meta-observation reflecting how deeply AI has become involved in mathematics community discussions, making it difficult to distinguish who is real. There were also comments wondering 'if anyone would tackle P≠NP this way,' and practical questions like 'what does this mean for ordinary people?' — reflecting that this type of research still largely remains within specialist communities."

How to Apply

"When mathematical proof or algorithm correctness verification is needed, you can build a two-stage pipeline: generate draft proof ideas with an LLM, then verify them using a proof assistant like Lean or Coq to mechanically catch errors. Rather than trying to solve complex math problems with an LLM alone, design a role-sharing structure where a domain expert (or expert-level prompt) sets the direction and the LLM explores candidate paths — this yields far more reliable results. If you're interested in the AlphaGo-style RL + formal proof tool combination, use DeepMind's AlphaProof or related papers as references and experiment with reinforcement learning agents in the Lean environment. This field is currently advancing rapidly."

Terminology

proof assistantA tool that allows mathematical proofs to be written in a form that computers can verify. Examples include Lean, Coq, and Isabelle; they mechanically catch logical errors in human-written proofs.

LeanA formal proof language and proof assistant developed by Microsoft Research and others. It allows mathematical theorems to be written like a programming language and verified by a computer.

latent vectorA compressed numerical array representation of a concept or pattern inside an AI model. For example, a mathematical trick like 'addition' encoded as a specific vector within the model's internal representation.

AlphaGo style RLThe reinforcement learning approach used by Google DeepMind in the Go-playing AI AlphaGo. It learns optimal strategies on its own through massive amounts of self-play, and can be applied to mathematical proof search as well.

Claude CyclesThe name of a mathematical problem posed by computer scientist Donald Knuth. The specific problem content is difficult to confirm due to inaccessibility of the original source, but it is presumed to be a combinatorics or graph theory problem that Knuth defined in relation to AI (Claude).

Fields MedalThe most prestigious award in mathematics, often called the Nobel Prize of math. It is awarded every four years to mathematicians under the age of 40.