Cryptographically secure random numbers in Elm

04 Mar 2016 in , , ,

Elm comes with a nice purely-functional random number generator in the standard library. In fact, it’s a port of the Haskell’s System.Random.

Not only this random number generator implementation is deterministic (that is, given the same initial seed it will produce the same random sequence), it is also strictly purely-functional (just like everything in Elm, actually).

Read more »

Latest blog posts