Random Number & List Picker
Cryptographically secure random number generator, name picker, list shuffler, and coin/dice roller. Private, unbiased browser-side randomness.
Random draws occur when you click a button, entirely in browser memory. Existing site assets may load independently of these calculations.
How to use the Random Number & List Picker
- 1
Choose a mode and enter your range or list.
- 2
Select duplicates or removal, then generate a draw.
- 3
Review the local result or copy it without signing in.
How secure random selection works
Choosing an arbitrary name from a list sounds easy until someone asks whether every entry had a fair chance. A good picker must do more than display a surprising number. It needs a clear sample space, a selection rule, and a way to avoid accidental mathematical bias. QuickFix Tools uses the browser’s Web Crypto interface for each draw. The result is generated on the device where you press the button. The entered names, numerical ranges and coin selections are processed in local memory by this feature, without sending the tool inputs to an application server.
True randomness versus pseudorandomness
Physical or true randomness comes from an unpredictable real-world phenomenon, such as carefully measured electronic noise. A pseudorandom generator instead computes a sequence from an internal state. Ordinary JavaScript Math.random() is not designed for security-sensitive selection, even if it looks unpredictable in everyday use. crypto.getRandomValues() supplies cryptographically secure pseudorandom values from the browser's cryptographic source. Its algorithm and entropy management depend on the platform. That is a stronger foundation for a giveaway or sample draw, but it would be inaccurate to call every output a measured physical random event.
Web Crypto also does not make a raffle independently auditable. A participant must still trust the page that is running, the browser environment, the list of entries and the person initiating the draw. For a regulated prize competition, follow local rules and retain a documented, verifiable process. The picker is a convenience tool, not a substitute for legally required oversight.
Avoiding modulo bias
A common mistake is to take a large random integer and simply compute its remainder after division by the number of possibilities. Unless the source range divides evenly into the target range, some outcomes then occur slightly more often than others. This tool uses rejection sampling. It draws a cryptographic value, discards values outside the largest evenly divisible portion of the source range, and accepts a result only when each possible outcome has the same mathematical probability. That method applies to numbers, dice faces, coins and the positions selected in a shuffled list.
Numbers with and without replacement
Suppose you want five numbers between 1 and 100. Allowing duplicates means each number is selected independently, so repeated values are possible. Disallowing duplicates means each chosen number is removed from the current draw and cannot appear twice. Every eligible number remains equally likely on each step, but the available set shrinks as numbers are chosen. Both modes are fair for their stated rules; neither is automatically better. Use replacement for repeated independent simulations and no replacement for unique ticket numbers, employee assignments or draws where the same ticket cannot win twice.
When unique selection is enabled, requesting eleven different numbers from a range containing only ten is impossible. The form reports that contradiction instead of silently returning repeats. Likewise, a reversed range or fractional bound is not interpreted as if it were valid. Clear validation helps make outcomes reproducible as a process even though the individual random values will vary.
Fair name picking and giveaways
Enter one eligible raffle ticket, student name or prize entry per line. Blank lines are ignored and surrounding spaces are removed. When you enable removal, each input row can be selected only once in that draw; otherwise the same row can appear in multiple picks. Duplicate written names are still separate entries. For instance, if “Alex” appears twice and “Sam” appears once, Alex has two tickets. To give each person one equal chance, clean up duplicate names before drawing. A random picker cannot identify whether different spellings refer to the same person.
For online giveaways, finalize and document eligibility before choosing winners. Explain whether multiple entries are permitted, whether you need alternates, and what happens if a selected entry is invalid. A screenshot of the winner card can show the result, but it does not prove that the underlying list was complete or unchanged. For classroom use, this tool also works for choosing presenters, allocating turns, distributing reading prompts or generating discussion pairs. Keep the selection method consistent across students if equal opportunity matters.
List shuffling and sampling
A shuffle does not remove entries or choose winners. Instead, it returns all the entered lines in a new order. This implementation uses Fisher–Yates: start at the end, choose an eligible earlier position uniformly, swap, and repeat. Because each selection uses rejection-sampled Web Crypto values, the permutations are not intentionally weighted toward particular positions. Unlike repeatedly sorting with a random comparator, Fisher–Yates is a well-understood algorithm that preserves the complete list. Use it for a reading queue, speaking order, practice problems or randomized survey prompts.
Statistical sampling needs extra care. If you want a simple random sample without replacement, start with a list where each observation has one entry and choose unique winners. If your dataset intentionally contains repeated values, the picker treats their rows as separate observations. This tool does not implement stratified sampling, weighting, sampling clusters, or scientific confidence intervals. Those methods require additional design decisions about the population and inclusion probabilities.
Dice, coins and interpreting streaks
Each D6 result is an integer from one through six, and each D20 result is from one through twenty. A coin flip returns Heads or Tails with the same intended probability. A run of five heads is possible in a fair sequence, just as repeated high dice rolls are possible. Short sequences rarely show perfectly balanced results. Do not reroll merely because an outcome looks surprising; that would change the selection process after observing it. For games, decide when a reroll is permitted before making the initial roll.
Privacy, accessibility and responsible use
The random-number, picker, shuffle and game calculations run entirely in your browser. This feature does not upload its entered values, request a remote randomness API, create tracking cookies, or store the drawn lists on a server. The browser may still fetch general page resources and the site may have other features governed by the published privacy notice. Avoid entering sensitive personal records on shared devices, and close the tab or clear your input when finished. The generated values can be copied with a button, but clipboard permissions depend on your browser and security context.
Buttons and labeled form fields support keyboard use, and results appear in live regions for assistive technologies. Animation is limited and respects reduced-motion preferences. Long lists may take more screen space, so review all entries before trusting an outcome. If the browser does not provide secure cryptographic randomness, the picker reports an error instead of falling back to the weaker Math.random() method. Fairness begins with transparent rules and correct sampling; it does not promise a particular winner.