Why this matters
Not all random number generators are created equal. The `Math.random()` function built into JavaScript uses a pseudorandom algorithm that is fast but predictable — given the internal state, an attacker can reconstruct past outputs and predict future ones. For security-sensitive applications like lottery draws, cryptographic token generation, or statistical sampling where bias must be eliminated, you need a source of entropy that cannot be reverse-engineered. The Web Crypto API's `crypto.getRandomValues()` provides exactly that by drawing from the operating system's cryptographic random number generator, which is seeded by hardware entropy sources.
This tool uses `crypto.getRandomValues()` with rejection sampling to eliminate the modulo bias that affects naive implementations. Modulo bias occurs when the range size does not evenly divide into the maximum random value, causing some numbers to appear slightly more often than others. Rejection sampling solves this by discarding and redrawing values that fall into the biased range, ensuring a perfectly uniform distribution across your specified minimum and maximum. The result is numbers that are both cryptographically secure and statistically unbiased.
Feature overview
| Feature | Description | Practical Use |
|---|---|---|
| Crypto-grade RNG | Uses crypto.getRandomValues | Security-sensitive draws |
| Rejection sampling | Eliminates modulo bias | Statistically fair results |
| Unique only toggle | Prevents duplicate values | Lottery numbers, sampling |
| Sort ascending | Orders results | Clean lottery-style output |
| Up to 10,000 numbers | Bulk generation | Test data, Monte Carlo |
| Range up to 4.2 billion | Uint32 limit | Most practical ranges covered |
How to use it
Enter the minimum and maximum values that define your desired range.
Set the count of numbers you want to generate — up to 10,000 per click.
Toggle 'Unique only' to prevent any number from appearing more than once in the results.
Toggle 'Sort ascending' to order the output from smallest to largest.
Click Generate, then copy individual numbers or the entire result set with one click.
Testing your result
To verify the randomness quality, generate a large batch of numbers in a known range and check the distribution. For example, generate 10,000 numbers between 1 and 10 with uniqueness turned off, then count how many times each value appears. In a truly uniform distribution, each value should appear roughly 1,000 times with a standard deviation of about 31. If any value deviates by more than three standard deviations from the expected count, the generator may have a bias issue — though with crypto-grade randomness this is extremely unlikely. You can also verify the unique-only mode by generating N numbers from a range of size N and confirming no duplicates appear.
Common mistakes
Requesting more unique numbers than the range contains — the tool clamps the count, but you should set realistic expectations.
Using `Math.random()` in your own code and assuming it is suitable for security purposes, when it is not.
Forgetting that the range is inclusive on both ends, so setting min to 1 and max to 10 includes both 1 and 10.
Using the output directly as a password or token — while the entropy source is strong, a dedicated password generator provides better formatting.
Edge cases and options
The tool handles ranges up to approximately 4.2 billion, which is the maximum value of a 32-bit unsigned integer. For most practical purposes — lottery draws, sampling, test data — ranges in the thousands or millions are more than sufficient. When unique-only mode is enabled and you request more numbers than the range contains, the count is automatically clamped to the range size. Results above 200 numbers are displayed in a scrollable text block to maintain page responsiveness. For batches approaching the 10,000 limit, the generation is still fast because the crypto API returns random values in bulk.
Real-world use cases
Running a fair raffle or giveaway by generating unique, sorted numbers in the ticket range.
Producing lottery-style number draws with the unique and sort toggles for a clean presentation.
Generating large sets of random test data for database seeding or load testing.
Selecting a random sample from a population for survey research or quality assurance audits.
Frequently asked questions
Q: How is randomness generated?
A: Each number is drawn from crypto.getRandomValues with rejection sampling. This eliminates the modulo bias that affects naive implementations and produces a perfectly uniform distribution across the specified range.
Q: What is the maximum range I can use?
A: The tool handles ranges up to roughly 4.2 billion, which is the Uint32 limit. For practical purposes, ranges in the thousands or millions work instantly.
Q: What does the unique-only toggle do?
A: It guarantees no value appears twice in the result. If you request more unique numbers than the range contains, the count is automatically clamped to the range size.
Q: Can I generate lottery numbers with this tool?
A: Yes. Set the range (for example 1 to 49), request 6 numbers, and enable both the unique-only and sort-ascending toggles for a clean lottery-style draw.
Q: How many numbers can I generate at once?
A: Up to 10,000 per click. Results above 200 are shown in a scrollable text block to keep the page responsive.
Q: Are these numbers safe for passwords or security tokens?
A: The entropy source is cryptographically secure, identical to what a dedicated password generator uses. For password creation specifically, a dedicated password generator from the security suite provides better formatting and character mix.
Start using it now
Try the Quick Random Number tool. See also Random Name Picker and Dice Roller for related randomization tools.
