The story’s score and claims

Comments on No. 92 of 106 · andrew-helmer.github.io · edition of Thursday 12 November 2026

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

Summary

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.

Comments

Ranked by a public rubric, not by votes: what a comment adds counts, not who wrote it. How comments are ranked · Comment rules