Formalizing the Enormous Theorem
Comments on “Formalizing the Enormous Theorem”
3 judges. Scored by all three judges. Only the day’s top stories get the claim check. How far stories are checked
Axiom Math announced a complete, computer-checked formalization in the Lean proof assistant of the Classification of Finite Simple Groups, nicknamed "the enormous theorem," whose original proof spans roughly 15,000 pages.
Why it ranked
No. 32 of 155 with a score of 0.65. The panel rated it highest on new information (0.96) and significance (0.85), lowest on practical relevance (0.46). The judges disagreed most on reader interest (spread 0.41), so the story is marked contested.
- AI judgeJudge 2claude-haiku-5-5
- Major formalization milestone with detailed Lean and AI-agent process content and a new group-theory result; mostly pure mathematics, so practical relevance to builders is modest, though the AI-agent coordination and proof-checking methods interest tech readers.}
- AI judgeJudge 3gpt-5.6-luna
- A landmark computer-checked formalization with substantial technical detail, reproducible Lean artifacts, discovered errata, and a new group-theory result. It is highly relevant to formal methods, AI-assisted engineering, and mathematical computing, though practical software impact is indirect.
Each judge wrote its line after answering the rubric, with the site and the author still hidden. Every answer behind this is in the table under Score.
Score
0.65total under rubric v2.2Contestedjudges differ by 0.41 on reader interest
- Significance0.85
- Reader interest0.78
- Audience breadth0.52
- Practical relevance0.46
- Substantiated0.81
- Technical depth0.81
- New information0.96
- Counts against: Promotional0.18
- Counts against: Overclaim0.21
Each judge’s answer per question (0–1), their mean and spread, and what the question adds to the score (weight × mean).
| Question | Judge 1 | Judge 2 | Judge 3 | Mean | Spread | Weight | Contribution (weight times mean) |
|---|---|---|---|---|---|---|---|
| Significance | 0.78 | 0.80 | 0.98 | 0.85 | 0.20 | +0.24 | +0.204 |
| Reader interest | 0.56 | 0.80 | 0.97 | 0.78 | 0.41 , above the contested threshold | +0.26 | +0.202 |
| Audience breadth | 0.51 | 0.50 | 0.54 | 0.52 | 0.04 | +0.13 | +0.067 |
| Practical relevance | 0.41 | 0.35 | 0.62 | 0.46 | 0.27 | +0.22 | +0.102 |
| Substantiated | 0.78 | 0.80 | 0.86 | 0.81 | 0.08 | +0.05 | +0.041 |
| Technical depth | 0.83 | 0.70 | 0.91 | 0.81 | 0.21 | +0.05 | +0.041 |
| New information | 0.93 | 0.95 | 0.99 | 0.96 | 0.06 | +0.05 | +0.048 |
| Promotional | 0.10 | 0.25 | 0.18 | 0.18 | 0.15 | −0.19 | −0.034 |
| Overclaim | 0.22 | 0.30 | 0.12 | 0.21 | 0.18 | −0.11 | −0.023 |
| Sum of contributions | +0.647 | ||||||
| Claim-check penalty | 0.000 | ||||||
| Total, as published | 0.647 | ||||||
Spread is the highest minus the lowest judge answer. marks a spread above 0.40: the judges disagree, and the story is marked contested.
The badge for this ranking, for the author's page or anyone's: one line of HTML, and it links back here.
<a href="https://rubric.hrih.si/editions/2026-10-28/32/"><img src="https://rubric.hrih.si/badge/2026-10-28/32.svg" alt="Ranked #32 on Rubric, 28 Oct 2026" width="245" height="28"></a>Also covered by
Elsewhere
Elsewhere: HN 12 pts, not on front page
Recorded for context only, checked 28 Oct 2026, 06:47 UTC. It played no part in the ranking.