Edition of Saturday 14 November 2026

Semver Trick

Comments on “Semver Trick”

Claim-checked. Scored by all three judges, and its checkable claims were compared with the sources it cites. How far stories are checked

David Tolnay's GitHub write-up describes the "semver trick" for Rust crates: after publishing a breaking release such as libc 0.3, maintainers ship a final 0.2 release that depends on 0.3 and re-exports unchanged types, so c_void is the same type in both. Downstream crates could then upgrade in any order without major bumps. The history cited, including Servo's 52-library, three-month upgrade, was not independently verified. The trick does not help with non-sealed trait changes, public dependencies that don't use it, or minimum rustc bumps.

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. 9 of 123 with a score of 0.67. The panel rated it highest on new information (0.92) and technical depth (0.85), lowest on audience breadth (0.54). Placed No. 9, No. 15 by score alone: the placement terms moved other stories past it.

AI judgeJudge 2claude-haiku-5-5
Practical, well-substantiated explanation of a Rust/Cargo versioning technique with concrete code examples; relevant to library builders, though niche and not in the recent story list.
AI judgeJudge 3gpt-5.6-luna
A technically detailed, practical explanation of a Rust dependency-compatibility technique, with concrete code, historical motivation, limitations, and reproducible examples. It is highly relevant to Rust library maintainers, though its audience is narrower than general tech.

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.67total under rubric v2.3

Judges’ mean answer per question, on a scale from 0 to 1. Questions marked minus count against the score.
  • Significance0.56
  • Reader interest0.73
  • Audience breadth0.54
  • Practical relevance0.76
  • Substantiated0.77
  • Technical depth0.85
  • New information0.92
  • Counts against: Promotional0.04
  • Counts against: Overclaim0.10

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.550.500.620.560.12+0.24+0.134
Reader interestWould a well-informed senior engineer or tech founder want to read this today, and likely pass it on?0.600.800.780.730.20+0.26+0.189
Audience breadthHow many people who build technology does it concern?0.510.670.450.540.22+0.13+0.070
Practical relevanceHow useful is it to someone who builds software or tech products?0.650.800.820.760.17+0.22+0.166
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.790.670.860.770.19+0.05+0.039
Technical depthHow technically substantive is it?0.950.750.840.850.20+0.05+0.042
New informationDoes it contain information absent from the stories covered in the last 7 days (list provided)?0.890.900.960.920.07+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.050.050.010.040.04−0.19−0.007
OverclaimDo the headline or conclusions claim more than the body supports?0.130.150.030.100.12−0.11−0.011
Sum of contributions+0.668
Claim-check penalty0.000
Total, as published0.668

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

Claim check

Claim check: 4 no source given · 4 couldn’t check. Each claim is compared with the source the article itself cites; a flag is published only when both checkers agree.

  1. Couldn’t checkDate

    The upgrade of libc from 0.1 to 0.2 in 2015 was known as the "libcpocalypse".

    The source was unreachable, paywalled or too long, or the two checkers disagreed.

    The article says

    “The upgrade of libc from 0.1 to 0.2 in 2015 was known as the "libcpocalypse”

    The source says

    No passage could be compared.

    Source cited by the article: crates.io/crates/libc

  2. No source givenNumber

    Pre-1.0 Serde upgrades from 0.7 to 0.8 to 0.9 to 1.0 required ecosystem-wide effort.

    The article gives no link or citation for it.

    The article says

    “Another frequent culprit was pre-1.0 Serde, with the upgrades from 0.7 to 0.8 to 0.9 to 1.0 requiring ecosystem-wide effort”

    The source says

    No source to compare with.

  3. Couldn’t checkNumber

    During the most recent libcpocalypse, Servo coordinated an upgrade of 52 libraries over three months.

    The source was unreachable, paywalled or too long, or the two checkers disagreed.

    The article says

    “During the most recent libcpocalypse, Servo found themselves coordinating an upgrade of 52 libraries over a period of three months”

    The source says

    No passage could be compared.

    Source cited by the article: github.com/servo/servo/issues/8608

  4. Couldn’t checkNumber

    It was discovered that EVFILT_AIO should have been defined as uint32_t rather than int32_t to match NetBSD header files.

    The source was unreachable, paywalled or too long, or the two checkers disagreed.

    The article says

    “it is discovered that EVFILT_AIO should have been defined as uint32_t rather than int32_t to match how it is used elsewhere in NetBSD header files”

    The source says

    No passage could be compared.

    Source cited by the article: github.com/rust-lang/libc/pull/506

  5. No source givenCausal conclusion

    The difficulty of past upgrades was caused by the large number of crates using types from these libraries in their public API.

    The article gives no link or citation for it.

    The article says

    “The cause of the difficulty was the large number of crates using types from these libraries in their public API”

    The source says

    No source to compare with.

  6. No source givenCausal conclusion

    With the semver trick, users of libc can upgrade from 0.2 to 0.3 at their leisure, in any order, without bumping their own major version.

    The article gives no link or citation for it.

    The article says

    “users of libc can upgrade from 0.2 to 0.3 at their leisure, in any order, without needing to bump their own semver major version”

    The source says

    No source to compare with.

  7. No source givenGeneralization

    The semver trick can be generalized to many different breaking change situations.

    The article gives no link or citation for it.

    The article says

    “With some care and creativity, the technique above can be generalized to lots of different breaking change situations”

    The source says

    No source to compare with.

  8. Couldn’t checkGeneralization

    Adding a new method to a widely used non-sealed trait is not helped by the semver trick.

    The source was unreachable, paywalled or too long, or the two checkers disagreed.

    The article says

    “Adding a new method to a widely used trait that is not sealed”

    The source says

    No passage could be compared.

    Source cited by the article: rust-lang-nursery.github.io/api-guidelines/future-proofing.html

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 15 Nov 2026, 20:44 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 “Semver Trick”

More on Rubric

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