Generate high quality pseudorandom numbers purely using a Mersenne Twister http://code.haskell.org/~dons/code/mersenne-random-pure64/
|Version on this page:||0.2.2.0|
|LTS Haskell 15.14:||[email protected]:1|
|Stackage Nightly 2020-06-01:||[email protected]:1|
|Latest on Hackage:||[email protected]:1|
Module documentation for 0.2.2.0
The Mersenne twister is a pseudorandom number generator developed by Makoto Matsumoto and Takuji Nishimura that is based on a matrix linear recurrence over a finite binary field. It provides for fast generation of very high quality pseudorandom numbers. The source for the C code can be found here:
This library provides a purely functional binding to the 64 bit classic mersenne twister, along with instances of RandomGen, so the generator can be used with System.Random. The generator should typically be a few times faster than the default StdGen (but a tad slower than the impure 'mersenne-random' library based on SIMD instructions and destructive state updates.