Field noteOct 26, 20261 min read1 source

Bitter Lessoned in Automated Theorem Proving (13 minute read)

In one minute

John Loeber published a first-person account of building an automated theorem prover around a private Lean4 fork.

What changed: Loeber adds a first-person account of building a private Lean4 theorem prover and argues that reasoning models plus formal verification make automated proof search newly viable.

The system used a custom harness to generate proof strategies, coordinate subagents, manage distributed compute and API limits, search cached lemmas, and generate counterexamples with parallel C++ programs.

Loeber writes that GPT-5.5 could produce novel theorem work but was slow and often generated incorrect or incoherent statements. He says GPT-5.6 Sol improved proof strategies, and GPT-6 Astra improved them again. His project produced a few hundred thousand lines of Lean while working on the degree-57 Moore graph problem and the Hadwiger Conjecture.

The October 22, 2026 essay argues that base-model progress rapidly reduced the value of his specialized proof-search engineering. It also reports claims about an unreleased OpenAI model, a 4,000-problem run, and mathematical results by others. The essay does not provide independently inspectable evidence for those claims, the reported compute cost, or the correctness and novelty of the cited proofs.

Evidence / sources

  1. 1essays.johnloeber.com/p/34-bitter-lessoned-in-automated-theorem
All Field Notes

Next reads

Read next

Open the graph
  1. 01topicHarness EngineeringExplore the harness-engineering topic hub.
  2. 02topicAgent RuntimeExplore the agent-runtime topic hub.
  3. 03archiveField NotesOpen the latest editorial analysis.
  4. 04source ledgerSource LedgerInspect the public source evidence graph.
Who read this page?Machine requests, hidden until opened

Loading the privacy-safe route aggregate...

Open the JSON contract