Limits RegistryPUBLIC RECORD
Limits RegistryGeorges Gonthier led a team at Microsoft Research-INRIA that in 2012 completed a full formalization of the Feit-Thompson theorem — originally a roughly 255-page proof from 1963 — in the Coq proof assistant, producing about 170,000 lines of formal proof code checked automatically by machine, at the time one of the largest formalized mathematical proofs ever completed. The project took about six years and helped establish formal proof assistants as viable for verifying genuinely deep, research-level mathematics.
The question, scope, and sources behind this Registry record.
Georges Gonthier led a team at Microsoft Research-INRIA that in 2012 completed a full formalization of the Feit-Thompson theorem — originally a roughly 255-page proof from 1963 — in the Coq proof assistant, producing about 170,000 lines of formal proof code checked automatically by machine, at the time one of the largest formalized mathematical proofs ever completed. The project took about six years and helped establish formal proof assistants as viable for verifying genuinely deep, research-level mathematics.
Every finite group of odd order is solvable (the Feit-Thompson theorem, originally proved in 1963), here machine-verified line by line in a formal proof assistant.
Change a parameter to stress-test whether a proposed result is still inside the published specification. This is an audit aid, not a proof checker.
This record has no editable parameters. Read the formal question and assumptions before challenging it.
Current frontiers derived from accepted Claims.
An observed or demonstrated result; no opposing bound is implied.
The frontier is not sacred
Most progress starts with a disagreement that survives contact with evidence. If you can push the known lower bound up or pull the upper bound down, show us the work.
≥ when you have shown that at least this value is achievable.≤ when you have shown that anything above this value is impossible.No vibes. State the value, define the scope, and link the paper, proof, code, or reproduction that lets another person check it. Editors review every challenge before the public record changes.
Challenge this recordAssertions tied to evidence, attribution, and review.
The frontier as it changed over time.
Only accepted Claims matching the current specification contribute to the displayed bounds. Strict inequalities remain open; contradictory Claims require editorial review.
1 accepted Claim, with 1 linked evidence records.
Permanent ID limitsregistry.com/limits/LR-FEIT-THOMPSON-FORMALIZATION
No active verified bounties are linked to this Limit.
View verified bounty tracker ↗No accepted machine-checked reproductions are recorded for this Limit.
Limits Registry. LR-FEIT-THOMPSON-FORMALIZATION. Formal verification of the Feit-Thompson (Odd Order) Theorem. 2026.