|
|
|
|
|
|
by camel-cdr
410 days ago
|
|
|
I'm not sure which PRNG is used here, but some PRNGs have regularities in the lower bits. This is e.g. the case for classical LCGs and the xoroshiro*+ family of PRNGs: > If, however, one has to generate only 64-bit floating-point numbers (by extracting the upper 53 bits) xoshiro256+ is a slightly (≈15%) faster generator with analogous statistical properties. For general usage, one has to consider that its lowest bits have low linear complexity and will fail linearity tests (https://prng.di.unimi.it/) > When m = 2k there is a further problem. The period of the bth bit of an LCG (where bits are numbered from the right, starting at one) is 2b , thus although the period is 2k, only the high bits are good and the lower order bits exhibit a clear repeating pattern. (https://www.pcg-random.org/pdf/hmc-cs-2014-0905.pdf) |
|
|