Edition of Thursday 12 November 2026

Andrew Kensler's permute(), a function for stateless, constant-time pseudorandom-order array iteration

Comments on “Andrew Kensler's permute(), a function for stateless, constant-time pseudorandom-order array iteration”

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

Andrew Kensler's permute() function, introduced in his Correlated Multi-Jittered Sampling paper, maps an index to a pseudorandom position in an array without storing any state, in constant time and memory. It works by building an invertible hash on power-of-two domains and cycle-walking to fit arbitrary lengths.

Read the original at andrew-helmer.github.io. 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. 92 of 106 with a score of 0.57. The panel rated it highest on technical depth (0.90) and new information (0.81), lowest on significance (0.47). The judges disagreed most on overclaim (spread 0.47), so the story is marked contested. Placed No. 92, No. 90 by score alone: the 13th 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
Clear, technically deep tutorial on a stateless constant-time permutation technique with working code; useful to builders but a niche, long-known method with no new findings.}
AI judgeJudge 3gpt-5.6-luna
A technically detailed, code-backed tutorial explaining stateless random permutation, cycle-walking, complexity, and practical tradeoffs. It is broadly useful to programmers, though constant-time wording overstates an average-case property and evidence is secondary rather than fully reproducible.

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.57total under rubric v2.3Contestedjudges differ by 0.47 on overclaim

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.48
  • Practical relevance0.69
  • Substantiated0.61
  • Technical depth0.90
  • New information0.81
  • Counts against: Promotional0.03
  • Counts against: Overclaim0.38

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.480.300.620.470.32+0.24+0.112
Reader interestWould a well-informed senior engineer or tech founder want to read this today, and likely pass it on?0.470.720.780.660.31+0.26+0.171
Audience breadthHow many people who build technology does it concern?0.570.400.480.480.17+0.13+0.063
Practical relevanceHow useful is it to someone who builds software or tech products?0.630.720.720.690.09+0.22+0.152
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.710.450.680.610.26+0.05+0.031
Technical depthHow technically substantive is it?0.990.850.860.900.14+0.05+0.045
New informationDoes it contain information absent from the stories covered in the last 7 days (list provided)?0.900.600.930.810.33+0.05+0.041
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.040.030.010.030.03−0.19−0.005
OverclaimDo the headline or conclusions claim more than the body supports?0.360.150.620.380.47 , above the contested threshold−0.11−0.041
Sum of contributions+0.568
Claim-check penalty0.000
Total, as published0.568

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

Also covered by

No other coverage was clustered with this story.

Elsewhere

Elsewhere: HN —

Recorded for context only, checked 12 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 “Andrew Kensler's permute(), a function for stateless, constant-time pseudorandom-order array iteration”

More on Rubric

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