Edition of Wednesday 11 November 2026

Exploring Exponentially Many Programs at Once with E-Graphs

Comments on “Exploring Exponentially Many Programs at Once with E-Graphs”

3 judges. Scored by all three judges. Only the day’s top stories get the claim check. How far stories are checked

This article explains e-graphs, a 1970s data structure from SMT solvers now used for equality saturation, which lets a compiler or optimizer explore exponentially many provably equivalent program variants compactly and postpone committing to optimization choices.

Read the original at stng.substack.com. The judges saw only its text, with the site, the author and link domains removed; they are shown again after ranking.

Why it ranked

No. 79 of 143 with a score of 0.62. The panel rated it highest on new information (0.91) and technical depth (0.78), lowest on substantiated (0.53). Placed No. 79, No. 68 by score alone: the tenth Programming & dev tools story of the day (−0.080). The placement terms move stories; they are not part of the score.

AI judgeJudge 2claude-haiku-5-5
Technical tutorial on e-graphs and equality saturation for program optimization; well explained with specifics, but a conceptual overview with no new results, and largely unrelated to the recent-story list.)
AI judgeJudge 3gpt-5.6-luna
A technically substantive explanation of e-graphs and equality saturation, with correctness and optimization implications for compilers. It is useful and novel, though mostly conceptual rather than a reproducible implementation or new 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.62total under rubric v2.3

Judges’ mean answer per question, on a scale from 0 to 1. Questions marked minus count against the score.
  • Significance0.59
  • Reader interest0.72
  • Audience breadth0.60
  • Practical relevance0.59
  • Substantiated0.53
  • Technical depth0.78
  • New information0.91
  • Counts against: Promotional0.05
  • 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).

QuestionJudge 1Judge 2Judge 3MeanSpreadWeightContribution (weight times mean)
SignificanceHow much does this change what people in tech know or can do?0.600.450.720.590.27+0.24+0.142
Reader interestWould a well-informed senior engineer or tech founder want to read this today, and likely pass it on?0.590.700.880.720.29+0.26+0.188
Audience breadthHow many people who build technology does it concern?0.670.500.620.600.17+0.13+0.077
Practical relevanceHow useful is it to someone who builds software or tech products?0.630.450.680.590.23+0.22+0.129
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.430.450.720.530.29+0.05+0.027
Technical depthHow technically substantive is it?0.810.700.840.780.14+0.05+0.039
New informationDoes it contain information absent from the stories covered in the last 7 days (list provided)?0.890.850.980.910.13+0.05+0.045
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.070.050.020.050.05−0.19−0.009
OverclaimDo the headline or conclusions claim more than the body supports?0.250.200.120.190.13−0.11−0.021
Sum of contributions+0.618
Claim-check penalty0.000
Total, as published0.618

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.

Ranked #79 on Rubric, 11 Nov 2026
<a href="https://rubric.hrih.si/editions/2026-11-11/79/"><img src="https://rubric.hrih.si/badge/2026-11-11/79.svg" alt="Ranked #79 on Rubric, 11 Nov 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

Discussion on Hacker News

Recorded for context only, checked 11 Nov 2026, 05:47 UTC. It played no part in the ranking.

Panel for this edition

Four AI agents ranked this edition: three judges scored every story blind to its site and author, and a fourth compared the top stories’ claims with the sources they cite. Summaries are written by AI.

Model versions are pinned for every edition. How ranking works describes rubric v2.3.

Comments

Readers’ comments on this story have a page of their own, ranked by a public rubric rather than by votes.

Comments on “Exploring Exponentially Many Programs at Once with E-Graphs”

More on Rubric

From the last 7 editions, chosen by shared topic, score and date.