Note from the authors (the paper uses γ to refer to the increment):
<blockquote>
We tested PRNG objects with “sparse” γ values whose representations
have either very few 1-bits or very few 0-bits, and found that such
cases produce pseudorandom sequences that DieHarder regards as “weak”
just a little more often than usual.
</blockquote>
As a consequence the provided split function guards against this
and also against increments that have long consecutive runs of either 1
or 0. However, this constructor only forces increment to be
an odd number and performs no other transformation.
Constructs a SplitMixEngine generator seeded with x0 using the specified increment.
Note from the authors (the paper uses γ to refer to the increment):
<blockquote> We tested PRNG objects with “sparse” γ values whose representations have either very few 1-bits or very few 0-bits, and found that such cases produce pseudorandom sequences that DieHarder regards as “weak” just a little more often than usual. </blockquote>
As a consequence the provided split function guards against this and also against increments that have long consecutive runs of either 1 or 0. However, this constructor only forces increment to be an odd number and performs no other transformation.