Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Stateless, constant time, random-access permutation iteration #1

Open
flyingmutant opened this issue Jul 27, 2022 · 0 comments
Open

Stateless, constant time, random-access permutation iteration #1

flyingmutant opened this issue Jul 27, 2022 · 0 comments
Labels
enhancement New feature or request help wanted Extra attention is needed

Comments

@flyingmutant
Copy link
Owner

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?
@flyingmutant flyingmutant added enhancement New feature or request help wanted Extra attention is needed labels Jul 27, 2022
@flyingmutant flyingmutant mentioned this issue Jul 28, 2022
Open
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement New feature or request help wanted Extra attention is needed
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@flyingmutant