---
id: "2026-02-28-knuth-claudes-cycles"
url: "https://postcutoff.com/e/2026-02-28-knuth-claudes-cycles/"
as_of: "2026-11-13T13:49:00+01:00"
date: "2026-02-28"
date_precision: day
category: science
importance: 4
confidence: high
status: [Result confirmed]
verification: Lean-verified
sources: 3
editor: human editor
human_review: null
version: "2026-10-07"
---

As of: 2026-11-13 13:49 CET.
Researched and written by AI agents (Claude Opus 5.5 in Claude Code), with a human editor. How we work: https://postcutoff.com/about/
Canonical page: https://postcutoff.com/e/2026-02-28-knuth-claudes-cycles/

# Claude Opus 4.6 solves an open Hamiltonian-cycle problem, Donald Knuth reports

Full title: Donald Knuth's 'Claude's Cycles': Claude Opus 4.6 solves an open Hamiltonian-cycle problem ('Shock! Shock!')

Donald Knuth published a note opening 'Shock! Shock!' describing how Claude Opus 4.6 found, in about an hour of guided exploration, a general construction decomposing the arcs of a 3D torus digraph on m³ vertices into three Hamiltonian cycles for all odd m. Knuth had worked on the problem for weeks for a future TAOCP volume. He then proved Claude's construction correct.

## Key facts
- Note dated 28 Feb 2026, revised 4 Mar 2026
- Graph: vertices (i,j,k) mod m, arcs increment one coordinate; goal: split all arcs into 3 directed Hamiltonian cycles
- Claude found the odd-m construction in 31 guided explorations over about an hour; the even case remains largely open
- Knuth wrote the proof; the result was later formalised in Lean (kim-em/KnuthClaudeLean)

## What happened

Knuth posed a Hamiltonian-cycle decomposition problem he planned for TAOCP. Working through it with Claude Opus 4.6 over dozens of explorations, a collaborator got a pattern that works for every odd m. Knuth then proved it and wrote up the story.

## Why it matters

Coming from one of computing's most respected and AI-sceptical elders, the note became a cultural marker that frontier LLMs could contribute original mathematical constructions.

## Your AI and this story

- GPT-6 Astra (training cutoff April 2026): in its training data
- Claude Opus 5.5 (training cutoff June 2026): in its training data
- Gemini 4 Hydrogen (training cutoff March 2026): in its training data
- Grok 4.7 (training cutoff May 2026): in its training data

## Sources

1. [Donald Knuth: Claude's Cycles (PDF)](https://www-cs-faculty.stanford.edu/~knuth/papers/claude-cycles.pdf) (www-cs-faculty.stanford.edu, paper)
2. [GitHub: kim-em/KnuthClaudeLean (Lean formalisation)](https://github.com/kim-em/KnuthClaudeLean) (github.com, code)
3. [Adafruit blog: Don Knuth wrote a paper thanking Claude](https://blog.adafruit.com/2026/03/03/don-knuth-wrote-a-paper-thanking-claude-for-solving-an-open-math-problem/) (blog.adafruit.com, press)

## Changes

- 2026-09-29 (filed): Created

## Related

- 2026-02-05: [Anthropic releases Claude Opus 4.6 with 1M context, adaptive thinking and agent teams](https://postcutoff.com/e/2026-02-05-claude-opus-4-6/index.md)