Random List Generator & Shuffler

The tool uses the Fisher-Yates shuffle algorithm powered by crypto.getRandomValues() from the Web Crypto API. Fisher-Yates is the gold standard for unbiased shuffling — it ensures every permutation of N items has exactly 1/N! probability. Combined with cryptographically secure random numbers from the browser's native entropy source, the result is mathematically verifiable fairness. This is the same approach used by online casinos and security-critical applications.

No. Every shuffle is performed entirely in your browser using the Web Crypto API. Your data is never sent to any server, stored in any database, transmitted over any network, or logged anywhere. The tool works fully offline after the initial page load. Participant names, email addresses, and any other data you paste remain exclusively on your device.

Math.random() generates pseudo-random numbers using a deterministic algorithm (typically xorshift128+). Given enough observations, outputs can be predicted. crypto.getRandomValues() generates cryptographically secure random numbers using the browser's native entropy source (OS-level CSPRNG). It is designed for security-critical applications, is significantly harder to predict, and is the recommended choice for any application requiring unbiased randomization like prize draws and audits.

Yes. Paste your participant list, enter the number of winners, and click Shuffle. The tool uses crypto.getRandomValues() with Fisher-Yates shuffle — the same standard used by online casinos. Winners are selected from the top of the shuffled list, ensuring every participant has an equal chance. The entire process runs locally with no uploads, keeping participant data private.

The tool handles 500,000+ rows smoothly. For datasets exceeding 25,000 rows, processing automatically offloads to a dedicated Web Worker, keeping the browser fully responsive. The Fisher-Yates algorithm runs in O(N) time regardless of list size. A shuffle animation runs for datasets under 100,000 rows; for larger datasets, the animation is skipped to prioritize performance.

Yes. The tool combines two mathematically rigorous techniques: Fisher-Yates shuffle guarantees every possible ordering is equally likely, and crypto.getRandomValues() provides cryptographically secure random numbers sourced from the operating system's entropy pool. This is the same level of randomness used in security protocols and online gaming. It is significantly more robust than Math.random()-based shufflers.

Fisher-Yates (also known as the Knuth shuffle) is an algorithm for generating a random permutation of a finite sequence. It works by iterating through the array from the last element to the first, swapping each element with a randomly selected element from the unshuffled portion. The algorithm runs in O(N) time, uses O(1) additional memory, and guarantees every permutation of N items has exactly 1/N! probability — the definition of a fair shuffle.

Yes. Toggle the Remove Duplicates option to automatically deduplicate your list before shuffling. This is useful for giveaway entries where participants might appear multiple times. The statistics panel shows how many duplicates were removed. Deduplication uses Set-based O(N) processing that runs before the shuffle to maintain overall performance.

Yes. After shuffling, you can copy the results to clipboard, download as a .txt file, or download as a .csv file. The CSV format wraps each item in quotes for compatibility with spreadsheet applications. You can also toggle Add Numbering to prefix each line with its rank number for clear presentation.

Yes. The tool handles any line-based text content including names, email addresses, numeric IDs, product SKUs, mixed content, and long strings. File upload supports .txt and .csv files. The O(N) Fisher-Yates algorithm processes 500,000+ items efficiently regardless of content type. All data stays local in your browser.

All modern browsers (Chrome, Firefox, Safari, Edge, Brave, Opera) support the Web Crypto API. In the rare case it is unavailable, the tool gracefully falls back to a Math.random()-based Fisher-Yates with a clear notification. We recommend using a modern browser for cryptographically secure shuffling.

After shuffling the entire list with the Fisher-Yates algorithm, the tool selects the first N entries as winners, where N is the number you specified in the Draw Winners field. Because the shuffle is cryptographically unbiased, every item has exactly the same probability of appearing in any position — including the winner positions.