Random number algorithms

Algorithms for randomness range from simple LCGs to cryptographic hashes and hardware TRNGs. Quality depends on purpose: games need speed; draws need fairness and auditability.

Common families

• Classical PRNGs — fast, deterministic, seed-based
• CSPRNG — cryptographically secure generators for secrets
• Hash-based extraction — turn entropy bytes into uniform bits (e.g. SHA-256)
• Rejection sampling — map bits to a range without modulo bias

What EntropyDraw uses

SHA-256 over entropy image + parameters, then rejection sampling into your integer range. Deterministic, uniform and checkable.