Stateless, constant time, random-access permutation iteration
Open
flyingmutant
opened this issue 2 years ago
•
0 comments
See permute() for an explanation of the design. Main problem is that I am not aware of simple, fast, high-quality (passing 2^42+ of PractRand) permutations of n bits, for all n in 1..64.
NASAM does the trick for 64 bits, but what about other cases?