Returns a new bit generator with the state jumped
The state of the returned big generator is jumped as-if
2**(128 * jumps) random numbers have been generated.
Number of times to jump the state of the bit generator returned
New instance of generator jumped iter times
The jump step is computed using a modified version of Matsumoto’s
implementation of Horner’s method. The step polynomial is precomputed
to perform 2**128 steps. The jumped state has been verified to match
the state produced using Matsumoto’s original code.
Matsumoto, M, Generating multiple disjoint streams of
pseudorandom number sequences. Accessed on: May 6, 2020.
Hiroshi Haramoto, Makoto Matsumoto, Takuji Nishimura, François
Panneton, Pierre L’Ecuyer, “Efficient Jump Ahead for F2-Linear
Random Number Generators”, INFORMS JOURNAL ON COMPUTING, Vol. 20,
No. 3, Summer 2008, pp. 385-390.