MersenneTwister Wiki Rss Feed

UPDATED WIKI: Home

codekaizen — Wed, 27 Feb 2008 01:24:43 GMT

The Mersenne Twister is a rather well-known algorithm for generating pseudo-random numbers. It is fast and has a huge period (range over which it doesn't repeat itself), which makes it ideal for simulation. However, the sequence can be guessed after only 624 numbers have been generated, so it is not useful for cryptography. It was first published in 1998 by Makoto Matsumoto and Takuji Nishimura using C code. *

An acquaintance of mine, Trevor Misfeldt, converted the C code to C# and published it to c-sharpcorner. Another implementation in C# is from Akihilo Kramot at http://www.takel.jp/mt/MersenneTwister.cs.

I've taken both of these and created this version, since Trevor's is a fairly straight conversion from the C-code, yet has some compelling methods, and Akihilo Kramot's implementation is clean and well-adapted to .Net (implements System.Random), but contains a small bug in the NextBytes method.

I have also implemented the 53-bit variety of the algorithm for the NextDouble* methods after an article was published in the journal Monte Carlo Methods and Applications, Vol. 12, No. 5-6, pp. 385 – 393 (2006), entitled "A Repetition Test for Pseudo-Random Number Generators" highlighting that, somewhat unsurprisingly, the 32-bit variety for double floating points makes numbers repeat too soon in a sequence, whereas the 53-bit variety does not.

This code is currently being used in the NPack library to provide random numbers for the numerical algorithms there. That project also has rudimentary unit tests covering this code for sanity checking (testing correct parameter guarding, primarily). I also hope to add at least one randomness test in order to verify the implementation (the algorithm has already tested).

For the interested, more information on the Mersenne Twister can be found on Wackypedia and appears, as of this posting, fairly accurate and useful. This could, however, change at any moment.

* Published in the ACM's Transactions on Modeling and Computer Simulation Vol. 8, No. 1, January pp.3-30 (1998).

UPDATED WIKI: Home

codekaizen — Thu, 21 Feb 2008 13:04:45 GMT

The Mersenne Twister is a rather well-known algorithm for generating pseudo-random numbers. It is fast and has a huge period (range over which it doesn't repeat itself), which makes it ideal for simulation. However, the sequence can be guessed after only 624 numbers have been generated, so it is not useful for cryptography. It was first published in 1998 by Makoto Matsumoto and Takuji Nishimura using C code. *

An acquaintance of mine, Trevor Misfeldt, converted the C code to C# and published it to c-sharpcorner. Another implementation in C# is from Akihilo Kramot at http://www.takel.jp/mt/MersenneTwister.cs.

I've taken both of these and created this version, since Trevor's is a fairly straight conversion from the C-code, yet has some compelling methods, and Akihilo Kramot's implementation is clean and well-adapted to .Net (implements System.Random), but contains a small bug in the NextBytes method.

I have also implemented the 53-bit variety of the algorithm for the NextDouble() method after an article was published in the journal Monte Carlo Methods and Applications, Vol. 12, No. 5-6, pp. 385 – 393 (2006), entitled "A Repetition Test for Pseudo-Random Number Generators" highlighting that, somewhat unsurprisingly, the 32-bit variety for double floating points makes numbers repeat too soon in a sequence, whereas the 53-bit variety does not.

This code is currently being used in the NPack library to provide random numbers for the numerical algorithms there. That project also has rudimentary tests for sanity checking (testing correct parameter guarding, primarily). I also hope to add at least one randomness test in order to verify the implementation (the algorithm has already tested).

For the interested, more information on the Mersenne Twister can be found on Wackypedia and appears, as of this posting, fairly accurate and useful. This could, however, change at any moment.

* Published in the ACM's Transactions on Modeling and Computer Simulation Vol. 8, No. 1, January pp.3-30 (1998).

UPDATED WIKI: Home

codekaizen — Thu, 21 Feb 2008 04:15:17 GMT

The Mersenne Twister is a rather well-known algorithm for generating pseudo-random numbers. It is fast and has a huge period (range over which it doesn't repeat itself), which makes it ideal for simulation. However, the sequence can be guessed after only 624 numbers have been generated, so it is not useful for cryptography. It was first published in 1998 by Makoto Matsumoto and Takuji Nishimura using C code. *

An acquaintance of mine, Trevor Misfeldt, converted the C code to C# and published it to c-sharpcorner. Another implementation in C# is from Akihilo Kramot at http://www.takel.jp/mt/MersenneTwister.cs.

I've taken both of these and created this version, since Trevor's is a fairly straight conversion from the C-code, yet has some compelling methods, and Akihilo Kramot's implementation is clean and well-adapted to .Net (implements System.Random), but contains a small bug in the NextBytes method.

This code is currently being used in the NPack library to provide random numbers for the numerical algorithms there. That project also has rudimentary tests for sanity checking (testing correct parameter guarding, primarily). I also hope to add at least one randomness test in order to verify the implementation (the algorithm has already tested).

For the interested, more information on the Mersenne Twister can be found on Wackypedia and appears, as of this posting, fairly accurate and useful. This could, however, change at any moment.

* Published in the ACM's Transactions on Modeling and Computer Simulation Vol. 8, No. 1, January pp.3-30 (1998).

UPDATED WIKI: Home

codekaizen — Thu, 21 Feb 2008 04:00:08 GMT

UPDATED WIKI: Home

codekaizen — Thu, 21 Feb 2008 03:22:13 GMT

The Mersenne Twister is a rather well-known algorithm for generating pseudo-random numbers. It was first published in 1998 by Makoto Matsumoto and Takuji Nishimura using C code. *

A friend of mine, Trevor Misfeldt, converted the C code to C# and published it to c-sharpcorner. Another implementation in C# is from Akihilo Kramot at http://www.takel.jp/mt/MersenneTwister.cs.

I've taken both of these and created this version, since Trevor's is a very straight conversion from the C-code, yet has some compelling methods, and Akihilo Kramot's implementation is clean and well-adapted to .Net (implements System.Random), but contains a bug in the NextBytes method.

I also hope to add at least one randomness test

For the interested, more information on the Mersenne Twister can be found on Wackypedia and appears, as of this posting, fairly accurate and useful. This could, however, change at any moment.

* Published in the ACM's Transactions on Modeling and Computer Simulation Vol. 8, No. 1, January pp.3-30 (1998).