Random Number Generator
Generate secure random integer or decimal numbers inside custom ranges using CSPRNG.
Configure numeric bounds and click generate
Unbiased Random Number Generation & CSPRNG Science
PRNG vs CSPRNG: What is the security difference?
Standard random functions (like Math.random()) are Pseudo-Random Number Generators (PRNGs) based on arithmetic formulas. They are deterministic: if an attacker gains the internal state, they can predict all future sequences. A Cryptographically Secure Pseudo-Random Number Generator (CSPRNG), such as window.crypto.getRandomValues, integrates hardware entropy inputs (mouse movements, keystroke timings, CPU thermal noise) to ensure absolute unpredictability.
How are random fractions mapped to custom intervals without bias?
Simple calculations like Math.floor(rand * range) can lead to modulo bias where certain numbers in a set have a slightly higher probability of selection. SuperUtility resolves this by scaling random 32-bit unsigned integers from standard OS hardware entropy onto normal decimals and verifying that they map cleanly inside the targeted interval.
About SuperUtility Random Number Generator
SuperUtility provides a highly secure and completely unbiased Random Number Generator. Whether you need a single index integer (like a lottery draw or roll), custom float decimals (like physics coefficients), or non-repeating sets of sorted ranges, our tool handles it seamlessly in real-time.
You can specify the exact minimum and maximum bounds, set decimal precision from 0 to 5 places, generate lists of numbers at once, toggle duplicate prevention, and arrange outputs in ascending, descending, or shuffled layouts. Plus, with our modern layout tokens, you can copy individual numbers or export the entire list to your clipboard with a single click.
Frequently Asked Questions
Why is CSPRNG better than typical software Math.random()?
Standard computer algorithms (like Javascript's built-in Math.random()) are pseudo-random number generators (PRNG). They use fixed seed values that can be predicted after observing past sequences. SuperUtility uses your browser's native Cryptographically Secure Pseudo-Random Number Generator (CSPRNG), which polls physical OS entropy noise, making it mathematically unpredictable and secure for security keys.
What is a modulo bias and how do you prevent it?
When mapping large random 32-bit integers onto custom ranges (like Min to Max), developers often use a standard modulo formula. This creates a statistical defect called modulo bias, where certain numbers have a slightly higher probability of selection. SuperUtility resolves this by utilizing unbiased scaling and rejection sampling to guarantee a perfectly equal distribution of choices.
Can I generate a sequence of non-repeating numbers?
Yes! By turning off the "Allow Duplicates" toggle, SuperUtility uses a local rejection loop to filter out repeating values, allowing you to generate things like raffle grids or lottery pools without repeats.
Is there a limit to how many numbers I can generate?
To prevent browser page crashes and memory leaks, we limit bulk generation to a high-speed batch size of 100 numbers per click, executing instantly with sub-millisecond response rates.
Random Number Range Examples
Standard Integer Sequences
Ideal for board games, lottery draws, and sampling indices:
// Range: 1 to 100 | Count: 5 | Allow Duplicates: No Generated Array (Sorted Ascending): [ 14, 27, 43, 81, 95 ]
High Precision Decimals (Float)
Perfect for statistical calculations, scientific simulations, or A/B testing splits:
// Range: 0.0 to 1.0 | Decimals: 3 | Count: 3 Generated Floats: [ 0.187, 0.543, 0.812 ]