2006, designed to be fast when it runs on 128-bit SIMD. It is roughly twice as fast as Mersenne Twister. It has a better equidistribution property of v-bit accuracy than MT but worse than WELL ("Well Equidistributed Long-period Linear"). It has quicker recovery from zero-excess initial state than MT, but slower than WELL. It supports various periods from 2607 − 1 to 2216091 − 1. Intel SSE2 and PowerPC AltiVec are supported by SFMT. It is also used for games with the Cell BE in the PlayStation 3. TinyMT TinyMT is a variant of Mersenne Twister, proposed by Saito and Matsumoto in 2011. TinyMT uses just 127 bits of state space, a significant decrease compared to the original's 2.5 KiB of state. However, it has a period of , far shorter than the original, so it is only recommended by the authors in cases where memory is at a premium. References Further reading . . External links The academic paper for MT, and related articles by Makoto Matsumoto Mersenne Twister home page, with codes in C, Fortran, Java, Lisp and some other languages Mersenne Twister examples — a collection of Mersenne Twister implementations, in several programming languages - at GitHub SFMT in Action: Part I – Generating a DLL Including SSE2 Support – at Code Project Pseudorandom number generators Articles with example pseudocode Japanese inventions