Random Number Generator
Generate random numbers, dice rolls, and coin flips with history.
Understanding Random Number Generation
Random number generation is fundamental to computing, mathematics, statistics, gaming, and cryptography. True randomness comes from physical phenomena — radioactive decay, atmospheric noise, or thermal fluctuations — which are inherently unpredictable. Computers, being deterministic machines, cannot produce true randomness on their own. Instead, they use pseudorandom number generators (PRNGs) — algorithms that produce sequences of numbers that appear random but are actually determined by an initial value called a seed.
The distinction between true and pseudorandom numbers matters in different contexts. For casual applications like games, simulations, or deciding where to eat lunch, pseudorandom numbers from Math.random() are perfectly adequate. For cryptographic applications like generating encryption keys, tokens, or passwords, you need cryptographically secure pseudorandom number generators (CSPRNGs) like the Web Crypto API's getRandomValues().
PRNG Algorithms
Several algorithms power pseudorandom number generation. The Mersenne Twister (MT19937) is the most widely used PRNG, offering a period of 2^19937 − 1 and good statistical properties. Linear Congruential Generators (LCGs) are simpler and faster but have known weaknesses. Xorshift generators offer excellent speed with reasonable quality. JavaScript's Math.random() typically uses xorshift128+ in modern browsers, providing adequate randomness for non-security applications.
Dice Probability
Understanding dice probability is essential for tabletop gaming and probability theory. A fair D6 has a 1/6 (16.67%) chance of landing on any face. When rolling multiple dice, probabilities become more complex — rolling 2D6, the most likely sum is 7 (probability 6/36 = 16.67%), while 2 and 12 each have only 1/36 (2.78%) probability. In tabletop RPGs, the D20 is iconic: a "natural 20" has exactly a 5% probability, making critical hits exciting but uncommon.
Random Numbers in Statistics
Statistical sampling relies on random number generation to select representative subsets from populations. Simple random sampling, stratified sampling, and Monte Carlo simulations all require high-quality random numbers. The quality of randomness directly affects the validity of statistical conclusions. Researchers use seed-based generators for reproducibility — setting the same seed produces the same sequence, allowing experiments to be exactly replicated.
Cryptographic Random Numbers
Cryptographic applications require randomness that an adversary cannot predict. The Web Crypto API's crypto.getRandomValues() provides cryptographically secure random numbers by combining hardware entropy sources with algorithmic processing. This is essential for generating session tokens, encryption keys, nonces, and initialization vectors. Using Math.random() for security-sensitive operations is a well-known vulnerability.