Mersenne Twister [SEP] discoverer or inventor
Mersenne Twister
The Mersenne Twister is a pseudorandom number generator (PRNG). It is by far the most widely used general-purpose PRNG. Its name derives from the fact that its period length is chosen to be a Mersenne prime.
The Mersenne Twister was developed in 1997 by and . It was designed specifically to rectify most of the flaws found in older PRNGs.
The most commonly used version of the Mersenne Twister algorithm is based on the Mersenne prime 2−1. The standard implementation of that, MT19937, uses
the following holds.
Algorithmic detail.
For a "w"-bit word length, the Mersenne Twister generates integers in the range [0, 2−1].
The Mersenne Twister algorithm is based on a matrix linear recurrence over a finite binary field "F". The algorithm is a twisted generalised feedback shift register (twisted GFSR, or TGFSR) of rational normal form (TGFSR(R)), with state bit reflection and tempering. The basic idea is to define a series formula_2 through a simple recurrence relation, and then