Andrew Kensler's permute(), a function for stateless, constant-time pseudorandom-order array iteration
0 comments · compsci
- Comments2
0 comments · compsci
Story details from Lobsters ↗ · linked article on andrew-helmer.github.io.
Andrew Kensler's permute(), a function for stateless, constant-time pseudorandom-order array iteration was first seen on Lobsters · Hottest on Nov 11, 2026. Since then it has appeared in 53 checks on 2 different days. Its best position was #10 of 25, reached on Nov 12, 08:21 UTC. It dropped off the list after Nov 12, 23:51 UTC.
Position on Lobsters · Hottest at every check (lower is better).
Best rank per day (UTC).
Platform metric as reported by Lobsters.
A few top-level comments from Lobsters, shortened. Read the full thread on Lobsters.
I knew of [cycle-walking](https://en.wikipedia.org/wiki/Cycle_walking) but this is my first time seeing a hash function designed for it. It took me a while to see why Kensler's hash stays invertible even when you mask off some of the bits: - Multiplication does not allow high-order bits to affect low-order bits. So…
A lot of these things can be explained in a simple and general way algebraically. E.g. if x is a nilpotent operator (the nth iterate x^n eventually becomes the 0 operator) the geometric series 1/(1+x) = 1 - x + x^2 + ... truncates to a finite sum, so the operator 1+x is invertible with that as its inverse. This makes…
Archived daily, weekly and monthly lists that include this entry.
Not at the moment. It was last on the list on Nov 12, 23:51 UTC, after 2 days of trending.
#10 on Lobsters · Hottest, on Nov 12, 08:21 UTC. Trendoday checks this list every 30 minutes.
It was first seen on Nov 11, 2026 and has been on the list on 2 days (53 checks) since.