How you could have invented muon from memory
Comments on “How you could have invented muon from memory”
3 judges. Scored by all three judges. Only the day’s top stories get the claim check. How far stories are checked
This Hrih News entry is a long, interactive research essay titled "How you could have invented muon from memory," by Lucas Tononro, that walks readers through deriving the Muon optimizer step by step from basic gradient descent.
Why it ranked
No. 75 of 110 with a score of 0.59. The panel rated it highest on technical depth (0.94) and new information (0.92), lowest on significance (0.52). Placed No. 75, No. 64 by score alone: the 28th AI & machine learning story of the day (−0.080). The placement terms move stories; they are not part of the score.
- AI judgeJudge 2claude-haiku-5-5
- Tutorial deriving the Muon optimizer from gradient descent; technically deep and on-topic for AI training, but a pedagogical piece with no new news and a narrow audience.
- AI judgeJudge 3gpt-5.6-luna
- A deeply technical, self-contained derivation of Muon’s matrix optimization rationale, including spectral geometry, momentum, polar factors, and Newton–Schulz approximation. It is highly useful to ML practitioners, though specialized and primarily pedagogical rather than a new research result.
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.59total under rubric v2.3
- Significance0.52
- Reader interest0.67
- Audience breadth0.54
- Practical relevance0.56
- Substantiated0.66
- Technical depth0.94
- New information0.92
- Counts against: Promotional0.04
- Counts against: Overclaim0.19
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) |
|---|---|---|---|---|---|---|---|
| SignificanceHow much does this change what people in tech know or can do? | 0.54 | 0.35 | 0.68 | 0.52 | 0.33 | +0.24 | +0.125 |
| Reader interestWould a well-informed senior engineer or tech founder want to read this today, and likely pass it on? | 0.57 | 0.60 | 0.85 | 0.67 | 0.28 | +0.26 | +0.175 |
| Audience breadthHow many people who build technology does it concern? | 0.56 | 0.50 | 0.55 | 0.54 | 0.06 | +0.13 | +0.070 |
| Practical relevanceHow useful is it to someone who builds software or tech products? | 0.51 | 0.50 | 0.68 | 0.56 | 0.18 | +0.22 | +0.124 |
| SubstantiatedHow well is it backed? Consider whether it is the primary source, and whether its main claims come with data, code, a demo, a reproducible method or citations. | 0.63 | 0.50 | 0.86 | 0.66 | 0.36 | +0.05 | +0.033 |
| Technical depthHow technically substantive is it? | 0.99 | 0.85 | 0.97 | 0.94 | 0.14 | +0.05 | +0.047 |
| New informationDoes it contain information absent from the stories covered in the last 7 days (list provided)? | 0.90 | 0.90 | 0.96 | 0.92 | 0.06 | +0.05 | +0.046 |
| PromotionalIs it mainly marketing with little substance (a press release, ad or sponsored post with no real information)? A launch post that carries real news is not promotional. | 0.05 | 0.05 | 0.01 | 0.04 | 0.04 | −0.19 | −0.007 |
| OverclaimDo the headline or conclusions claim more than the body supports? | 0.34 | 0.15 | 0.08 | 0.19 | 0.26 | −0.11 | −0.021 |
| Sum of contributions | +0.593 | ||||||
| Claim-check penalty | 0.000 | ||||||
| Total, as published | 0.593 | ||||||
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-29/75/"><img src="https://rubric.hrih.si/badge/2026-10-29/75.svg" alt="Ranked #75 on Rubric, 29 Oct 2026" width="245" height="28"></a>Also covered by
No other coverage was clustered with this story.
Elsewhere
Elsewhere: HN 1 pts, not on front page
Recorded for context only, checked 29 Oct 2026, 05:47 UTC. It played no part in the ranking.