# splitmix: Fast Splittable PRNG

Pure Haskell implementation of SplitMix described in

Guy L. Steele, Jr., Doug Lea, and Christine H. Flood. 2014. Fast splittable pseudorandom number generators. In Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications (OOPSLA '14). ACM, New York, NY, USA, 453-472. DOI: https://doi.org/10.1145/2660193.2660195

The paper describes a new algorithm *SplitMix* for *splittable*
pseudorandom number generator that is quite fast: 9 64 bit arithmetic/logical
operations per 64 bits generated.

*SplitMix* is tested with two standard statistical test suites (DieHarder and
TestU01, this implementation only using the former) and it appears to be
adequate for "everyday" use, such as Monte Carlo algorithms and randomized
data structures where speed is important.

In particular, it **should not be used for cryptographic or security applications**,
because generated sequences of pseudorandom values are too predictable
(the mixing functions are easily inverted, and two successive outputs
suffice to reconstruct the internal state).

[Skip to Readme]

Versions | 0, 0.0.1 |
---|---|

Change log | Changelog.md |

Dependencies | base (>=4.5 && <4.12), deepseq (>=1.3.0.1 && <1.5), random (==1.1.*), time (>=1.4.0.1 && <1.9) [details] |

License | BSD-3-Clause |

Author | |

Maintainer | Oleg Grenrus <oleg.grenrus@iki.fi> |

Category | System |

Bug tracker | https://github.com/phadej/splitmix#issues |

Source repo | head: git clone https://github.com/phadej/splitmix.git |

Uploaded | by phadej at Wed May 16 09:15:18 UTC 2018 |

Distributions | LTSHaskell:0, NixOS:0.0.1, Stackage:0.0.1 |

Downloads | 346 total (23 in the last 30 days) |

Rating | (no votes yet) [estimated by rule of succession] |

Your Rating | |

Status | Docs available [build log] Last success reported on 2018-05-16 [all 1 reports] Hackage Matrix CI |

## Downloads

- splitmix-0.0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)