The coin-flipping that counts the Internet – how the HyperLogLog algorithm works
Comments on “The coin-flipping that counts the Internet – how the HyperLogLog algorithm works”
3 judges. Scored by all three judges. Only the day’s top stories get the claim check. How far stories are checked
The article explains the HyperLogLog algorithm, which estimates the number of unique visitors to a website using a tiny amount of memory instead of storing every visitor's ID.
Why it ranked
No. 65 of 143 with a score of 0.58. The panel rated it highest on new information (0.92) and audience breadth (0.73), lowest on significance (0.46). Placed No. 65, No. 115 by score alone: the fourth Data story of the day (−0.020). The placement terms move stories; they are not part of the score.
- AI judgeJudge 2claude-haiku-5-5
- A clear, well-explained tutorial on the HyperLogLog cardinality algorithm with concrete examples; useful data-engineering background, though well-known and not news.
- AI judgeJudge 3gpt-5.6-luna
- A clear, technically meaningful explanation of HyperLogLog’s hashing, bucketing, variance reduction, and practical uses. It is broadly relevant to data systems, though simplified examples and the generic accuracy claim limit substantiation and depth.
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.58total under rubric v2.3
- Significance0.46
- Reader interest0.67
- Audience breadth0.73
- Practical relevance0.58
- Substantiated0.49
- Technical depth0.71
- New information0.92
- Counts against: Promotional0.06
- Counts against: Overclaim0.23
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.47 | 0.30 | 0.62 | 0.46 | 0.32 | +0.24 | +0.111 |
| Reader interestWould a well-informed senior engineer or tech founder want to read this today, and likely pass it on? | 0.52 | 0.70 | 0.78 | 0.67 | 0.26 | +0.26 | +0.173 |
| Audience breadthHow many people who build technology does it concern? | 0.86 | 0.60 | 0.72 | 0.73 | 0.26 | +0.13 | +0.095 |
| Practical relevanceHow useful is it to someone who builds software or tech products? | 0.56 | 0.55 | 0.62 | 0.58 | 0.07 | +0.22 | +0.127 |
| 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.42 | 0.40 | 0.64 | 0.49 | 0.24 | +0.05 | +0.024 |
| Technical depthHow technically substantive is it? | 0.76 | 0.70 | 0.66 | 0.71 | 0.10 | +0.05 | +0.035 |
| New informationDoes it contain information absent from the stories covered in the last 7 days (list provided)? | 0.89 | 0.90 | 0.98 | 0.92 | 0.09 | +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.08 | 0.06 | 0.03 | −0.19 | −0.011 |
| OverclaimDo the headline or conclusions claim more than the body supports? | 0.19 | 0.15 | 0.34 | 0.23 | 0.19 | −0.11 | −0.025 |
| Sum of contributions | +0.575 | ||||||
| Claim-check penalty | 0.000 | ||||||
| Total, as published | 0.575 | ||||||
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-11-11/65/"><img src="https://rubric.hrih.si/badge/2026-11-11/65.svg" alt="Ranked #65 on Rubric, 11 Nov 2026" width="245" height="28"></a>Also covered by
No other coverage was clustered with this story.
Elsewhere
Elsewhere: HN 3 pts, not on front page
Recorded for context only, checked 11 Nov 2026, 05:47 UTC. It played no part in the ranking.