Verifiable shuffle
A full Fisher–Yates shuffle, with every index drawn from fresh randomness and the rejection rule that keeps it unbiased. The receipt lets anyone replay the same permutation.
Try it here
The tool below is set to this mode already.
Entries
More options
What people use it for
- Randomising a running order, a playlist or a set of questions.
- Assigning slots where the method has to be written down, not described.
- Anything a spreadsheet's RANDOM() would do, but with a record behind it.
Why it holds up
Fisher–Yates with rejection sampling gives every permutation the same chance; taking the next sample instead of folding a biased one keeps it that way. The receipt carries the bits, so the shuffle can be recomputed independently.
Questions people ask
- Which shuffle algorithm is this?
- Fisher-Yates, from the last position down, with each index drawn by rejection sampling so that every permutation is equally likely. The specification writes it out step by step.
- Can someone recompute my shuffle?
- Yes. The receipt carries the bits that produced it, and the reference implementation reproduces the same permutation from them without access to this site.
- How is this different from a spreadsheet's random sort?
- A spreadsheet sort is unverifiable after the fact: nothing records what the random values were or when they were produced. Here both are on the receipt.
What the receipt proves
Every draw is committed before it happens and recorded afterwards. The receipt holds the commitment, the randomness, its source and the result, and anyone with the link can check that they fit together.