Predictable can be useful
A pseudorandom generator expands an initial state into a sequence using a deterministic algorithm. The same seed repeats the same sequence, which is helpful for simulations, reproducible examples, and debugging.
Try a deliberately simple generator
This demonstration uses a 32-bit linear congruential generator: state = (1664525 × state + 1013904223) modulo 2³². Outputs are unsigned integers from 0 to 4,294,967,295. Seeds are normalized to 32 bits. This algorithm is predictable and unsuitable for secrets or fair adversarial draws.
Cryptographic PRNGs are different
A cryptographically secure pseudorandom generator is designed to make future outputs hard to predict. All other RandomKit selection tools use Web Crypto instead of this teaching algorithm.
Does pseudorandom mean insecure?
No. Simple PRNGs may be predictable, while cryptographic PRNGs are designed to withstand prediction. The security depends on the algorithm, entropy, and implementation.