SP1 zkVM · verified in your browser

Shuffle a list. Prove it happened.

The program sorts your names, hashes them with the presentation date to get a seed, then Fisher–Yates shuffles. The page checks the proof in WebAssembly — you do not have to trust the server’s shuffle.

Items

Blank rows are dropped. Typed order does not matter; the program sorts alphabetically, then derives the seed from the date and that list.