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.
Shuffled list
Read from the proof’s public values, not from a server field.
- Program
- Program ID
- Date
- Seed
- Inputs
Scan on your phone
The QR encodes a link to this page. Your phone fetches the proof and verifies it locally against the program ID and the list above.