3 ms·
Huh. I wonder why they don't use one of those random-access PRNGs like PRNS, which is basically a hash of a counter. Maybe not good enough in the speed-quality
by 01HNNWZ0MV43FF 2y ago
Huh. I wonder why they don't use one of those random-access PRNGs like PRNS, which is basically a hash of a counter. Maybe not good enough in the speed-quality space?
- PartiallyTyped 2y agoNot all PRNGs are created equal; eg linear congruent ones take many steps until values of initial seeds that are close to each other become decorrelated. Eg try java’s random prng library, and generate a few booleans with two seeds very close to each other. Then try apache common’s merseine twister prng.
- 01HNNWZ0MV43FF 2y agoI was thinking of this one. I don't think it's an LCG but I don't know much about randomness. http://marc-b-reynolds.github.io/shf/2016/04/19/prns.html http://marc-b-reynolds.github.io/shf/2016/04/19/prns.html