A good choice for a fast random number generator in Haskell

Question

I have a precedent where I want to test a program for gambling. The random numbers that I need should be in a very small area (from 1 to 9), and there is no real need. I found out that the standard Haskell generator is too slow for me, so does anyone have any better ideas?

Answer 1

I found out about the Xorshift random gene that fits my needs perfectly. I am going to implement it in Haskell and implement it online.

Done: Xorshift loads into a hacker, and I need some improvement.

Answer 2

The mersenne-random-pure64 package runs very fast, like mwc-random .