Edition of Tuesday 27 October 2026

Ploom, find thread bugs in Python by trying every interleaving

Comments on “Ploom, find thread bugs in Python by trying every interleaving”

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

Ploom is a Python library for finding thread bugs by running a test under a controlled scheduler that systematically tries every ordering of its modeled operations. It stops at the first failure, saves the schedule as a JSON trace, and can replay that exact order.

Read the original at github.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. 101 of 124 with a score of 0.57. The panel rated it highest on new information (0.95) and technical depth (0.82), lowest on audience breadth (0.41).

Every answer behind this is in the table under Score.

Score

0.57total under rubric v2.2

Judges’ mean answer per question, on a scale from 0 to 1. Questions marked minus count against the score.
  • Significance0.47
  • Reader interest0.66
  • Audience breadth0.41
  • Practical relevance0.71
  • Substantiated0.79
  • Technical depth0.82
  • New information0.95
  • Counts against: Promotional0.15
  • 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)
Significance0.490.350.560.470.21+0.24+0.112
Reader interest0.590.600.780.660.19+0.26+0.171
Audience breadth0.410.400.420.410.02+0.13+0.053
Practical relevance0.740.600.780.710.18+0.22+0.155
Substantiated0.900.600.880.790.30+0.05+0.040
Technical depth0.930.700.820.820.23+0.05+0.041
New information0.920.950.990.950.07+0.05+0.048
Promotional0.110.250.080.150.17−0.19−0.028
Overclaim0.340.200.040.190.30−0.11−0.021
Sum of contributions+0.571
Claim-check penalty0.000
Total, as published0.571

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 #101 on Rubric, 27 Oct 2026
<a href="https://rubric.hrih.si/editions/2026-10-27/101/"><img src="https://rubric.hrih.si/badge/2026-10-27/101.svg" alt="Ranked #101 on Rubric, 27 Oct 2026" width="252" 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 27 Oct 2026, 05:46 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. This one was scored under rubric v2.2; How ranking works describes the current 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 “Ploom, find thread bugs in Python by trying every interleaving”

More on Rubric

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

  1. Score 0.79

    Zlib 1.4