3 ms·
Counterpoint, even if you only have 256 bits of entropy (which is common for many widely used PRNGs), you can prove that there's bias due to the pigeon hole pri
by adgjlsfhk1 2y ago
Counterpoint, even if you only have 256 bits of entropy (which is common for many widely used PRNGs), you can prove that there's bias due to the pigeon hole principal, but finding a shuffle that is under-represented is computationally impossible.
- pvillano 2y agoI can say, infalsifiably, it will be computationally possible eventually
- SAI_Peregrinus 2y agoEventually, but long after the Sun has expanded into a red giant and burned the surface of the Earth off.
- deleted 2y ago[deleted]