https://guide.aelve.com/haskell/feed/category/tm1w57n32016-05-12T17:53:31Zmoukx96r2016-05-12T17:53:31Z<h1> <span class="item-name">mersenne-random-pure64</span> (<a href="https://hackage.haskell.org/package/mersenne-random-pure64">Hackage</a>) </h1><h2>Pros</h2><ul></ul><h2>Cons</h2><ul></ul>a75p6jif2016-05-12T15:19:00Z<h1> <span class="item-name">pcg-random</span> (<a href="https://hackage.haskell.org/package/pcg-random">Hackage</a>) </h1><p>An implementation of the <a href="http://www.pcg-random.org/">PCG</a> family of generators.</p> <h2>Pros</h2><ul><p><li>Claimed to be faster than the Mersenne twister, and harder to predict (Mersenne twister <a href="https://jazzy.id.au/2010/09/22/cracking_random_number_generators_part_3.html">can be predicted</a> after just 624 outputs).</li></p></ul><h2>Cons</h2><ul></ul>xxywmwms2016-04-14T10:16:01Z<h1> <span class="item-name">tf-random</span> (<a href="https://hackage.haskell.org/package/tf-random">Hackage</a>) </h1><h2>Pros</h2><ul></ul><h2>Cons</h2><ul></ul>pk8l1up22016-04-14T10:15:08Z<h1> <span class="item-name">cryptonite</span> (<a href="https://hackage.haskell.org/package/cryptonite">Hackage</a>) </h1><p>A collection of cryptography-related functions; listed here because it implements <a href="https://en.wikipedia.org/wiki/Salsa20">ChaCha</a>, a cryptographically secure (<a href="https://en.wikipedia.org/wiki/Cryptographically_secure_pseudorandom_number_generator">CSPRNG</a>) random number generator.</p> <h2>Pros</h2><ul><p><li>Cryptographically secure.</li></p></ul><h2>Cons</h2><ul><p><li>Low-level; only knows how to generate random bytes, not ints or strings.</li></p><p><li>The package takes long to build and the random number generator is only a small part of it.</li></p></ul>etv8fjco2016-04-14T10:14:43Z<h1> <span class="item-name">mwc-random</span> (<a href="https://hackage.haskell.org/package/mwc-random">Hackage</a>) </h1><h2>Pros</h2><ul><p><li>Very fast!</li></p></ul><h2>Cons</h2><ul><p><li>Less convinient to use than System.Random as it operates on top of PrimMonad (ie. you need IO or ST to use it). No pure interface available.</li></p></ul>jgrt3qkm2016-04-14T10:14:34Z<h1> <span class="item-name">MonadRandom</span> (<a href="https://hackage.haskell.org/package/MonadRandom">Hackage</a>) </h1><h2>Pros</h2><ul></ul><h2>Cons</h2><ul></ul>rmkssnwr2016-04-14T10:14:27Z<h1> <span class="item-name">random-fu</span> (<a href="https://hackage.haskell.org/package/random-fu">Hackage</a>) </h1><p>A powerful library with:</p> <ul> <li>random numbers/variables</li> <li>list shuffling and random choice</li> <li>various <a href="https://en.wikipedia.org/wiki/Probability_distribution">probability distributions</a></li> <li>cumulative distribution functions</li> <li>a monadic interface</li> </ul> <p>Can use different randomness sources (<code>/dev/random</code> and <code>/dev/urandom</code>, <code>StdGen</code>, the Mersenne twister generator).</p> <h2>Pros</h2><ul><p><li>Supports different <a href="https://en.wikipedia.org/wiki/Probability_distribution">distributions</a>.</li></p><p><li>Provides a monadic interface.</li></p></ul><h2>Cons</h2><ul><p><li>Can be harder to use than other, simpler libraries.</li></p></ul><h2>Ecosystem</h2><p><a href="https://hackage.haskell.org/package/ks-test">ks-test</a> (Kolmogorov distribution), <a href="https://hackage.haskell.org/package/random-extras">random-extras</a> (weighted shuffling and sampling, card shuffling, etc)</p> eonhwwzz2016-04-14T10:14:10Z<h1> <span class="item-name">random</span> (<a href="https://hackage.haskell.org/package/random">Hackage</a>) </h1><p>The default random generator library. Simple to use, doesn't have many features.</p> <h2>Pros</h2><ul><p><li>Convinient to use</li></p></ul><h2>Cons</h2><ul><p><li>Very slow</li></p></ul><h2>Ecosystem</h2><p><a href="https://hackage.haskell.org/package/random-derive">random-derive</a> (automatically derive instances of <code>Random</code>)</p>