pcg-random

Haskell bindings to the PCG random number generator.

PCG is a family of simple fast space-efficient statistically good algorithms for random number generation. Unlike many general-purpose RNGs, they are also hard to predict.

This library implements bindings to the standard C implementation. This includes the standard, unique, fast and single variants in the pcg family. There is a pure implementation that can be used as a generator with the random package as well as a faster primitive api that includes functions for generating common types.

The generators in this module are suitable for use in parallel but make sure threads don't share the same generator or things will go horribly wrong.

pcg-random

Haskell bindings to the PCG random number generator http://www.pcg-random.org.

PCG is a family of simple fast space-efficient statistically good algorithms for random number generation. Unlike many general-purpose RNGs, they are also hard to predict.

Implements the standard multiple stream generator as well as the fast, single and unique variants.

The api is very similar to mwc-random but the pcg generator appears to be slightly faster. There is also a pure interface via the random libray.