The Mersenne Twister

? Has a colossal period of 2¹⁹⁹³⁷-1 iterations, which is far more than the number needed to generate the number of possible unique sequences of card decks (approx. 2²²⁵ compared to the Mersenne Twister's 2¹⁹⁹³⁷ ).
? Accepts a seed of up to 19,968 bits. Other sites think a 2016 bit seed is overkill, we go much farther with 19,968 bits.
? Has a very high order of dimensional equidistribution. In fact, it is proven to be equidistributed in 623 dimensions (for 32-bit values). Note that this means, by default, that there is negligible serial correlation between successive values in the output sequence.
? Runs faster than all but the least statistically desirable generators.
? Is statistically random in all the bits of its output.
The above is why, as people have learned about the Mersenne Twister PRNG, that it has increasingly been accepted as the random number generator of choice for all statistical simulations and generative modeling. It's also why BugsysClub chose to use the Mersenne Twister PRNG.
Reference:
? M. Matsumoto and T. Nishimura, Mersenne twister: A 623-dimensionally equidistributed uniform pseudorandom number generator, ACM Trans. on Modeling and Computer Simulations, 1998.