Corpus ID: 204576201

It is high time we let go of the Mersenne Twister

@article{Vigna2019ItIH,
  title={It is high time we let go of the Mersenne Twister},
  author={Sebastiano Vigna},
  journal={ArXiv},
  year={2019},
  volume={abs/1910.06437}
}
  • S. Vigna
  • Published 14 October 2019
  • Mathematics, Computer Science
  • ArXiv
When the Mersenne Twister made his first appearance in 1997 it was a powerful example of how linear maps on $\mathbf F_2$ could be used to generate pseudorandom numbers. In particular, the easiness with which generators with long periods could be defined gave the Mersenne Twister a large following, in spite of the fact that such long periods are not a measure of quality, and they require a large amount of memory. Even at the time of its publication, several defects of the Mersenne Twister were… Expand
Scrambled Linear Pseudorandom Number Generators
TLDR
A new test for Hamming-weight dependencies that is able to discover subtle, previously unknown biases in existing generators (in particular, in linear ones), and a number of scramblers, that is, nonlinear functions applied to the state array that reduce or delete the linear artifacts. Expand
Optimizing Discrete Simulations of the Spread of HIV-1 to Handle Billions of Cells on a Workstation
TLDR
It is demonstrated how to optimize simulations of HIV on a workstation by combining features such as just-in-time compilation, parallelism at the level of threads, pseudo random number generators, and simplified handling of neighbors in a cellular automaton. Expand
Restoring isotropy in a three-dimensional lattice model: The Ising universality class
We study a generalized Blume-Capel model on the simple cubic lattice. In addition to the nearest neighbor coupling there is a next to next to nearest neighbor coupling. In order to quantify spatialExpand
Counter-Interception and Counter-Exploitation Features of Noise Radar Technology
In defense applications, the main features of radars are the Low Probability of Intercept (LPI) and the Low Probability of Exploitation (LPE). The counterpart uses more and more capable interceptExpand
The significance of neural inter-frequency power correlations
It is of great interest in neuroscience to determine what frequency bands in the brain have covarying power. This would help us robustly identify the frequency signatures of neural processes. HoweverExpand

References

SHOWING 1-10 OF 35 REFERENCES
On the F2-linear relations of Mersenne Twister pseudorandom number generators
  • S. Harase
  • Mathematics, Computer Science
  • Math. Comput. Simul.
  • 2014
TLDR
Assessment of non-random bit patterns in dimensions that are higher than the dimension of equidistribution with v -bit accuracy, which focuses on the relationship between points in the Couture-L'Ecuyer dual lattices and F 2 -linear relations on the most significant v bits of output sequences. Expand
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
TLDR
A new algorithm called Mersenne Twister (MT) is proposed for generating uniform pseudorandom numbers, which provides a super astronomical period of 2 and 623-dimensional equidistribution up to 32-bit accuracy, while using a working area of only 624 words. Expand
Scrambled Linear Pseudorandom Number Generators
TLDR
A new test for Hamming-weight dependencies that is able to discover subtle, previously unknown biases in existing generators (in particular, in linear ones), and a number of scramblers, that is, nonlinear functions applied to the state array that reduce or delete the linear artifacts. Expand
Improved long-period generators based on linear recurrences modulo 2
TLDR
This article proposes new generators of that form with better equidistribution and “bit-mixing” properties for equivalent period length and speed and illustrates how this can reduce the impact of persistent dependencies among successive output values, which can be observed in certain parts of the period of gigantic generators such as the Mersenne twister. Expand
SIMD-Oriented Fast Mersenne Twister: a 128-bit Pseudorandom Number Generator
TLDR
A 128-bit based PRNG, named SIMD-oriented Fast Mersenne Twister (SFMT), which is analogous to MT but making full use of these features, and is roughly twice as fast as optimised MT using SIMD operations. Expand
Parallel random numbers: As easy as 1, 2, 3
TLDR
It is demonstrated that independent, keyed transformations of counters produce a large alternative class of PRNGs with excellent statistical properties, ideally suited to modern multi- core CPUs, GPUs, clusters, and special-purpose hardware. Expand
An Experimental Exploration of Marsaglia's xorshift Generators, Scrambled
  • S. Vigna
  • Mathematics, Computer Science
  • ACM Trans. Math. Softw.
  • 2016
TLDR
The space of possible generators obtained by multiplying the result of a xorshift generator by a suitable constant is explored, finding choices of parameters providing periods of length 21024 − 1 and 24096 − 1. Expand
The art of computer programming. Vol.2: Seminumerical algorithms
TLDR
This professional art of computer programming volume 2 seminumerical algorithms 3rd edition that has actually been written by is one of the best seller books in the world and is never late to read. Expand
F2-Linear Random Number Generators
TLDR
The most interesting construction methods for random number generators based on linear recurrences modulo 2 are reviewed, their theoretical and empirical properties are examined, the relevant computational tools and algorithms are described, and comparisons are made. Expand
TestU01: A C library for empirical testing of random number generators
We introduce TestU01, a software library implemented in the ANSI C language, and offering a collection of utilities for the empirical statistical testing of uniform random number generators (RNGs).Expand
...
1
2
3
4
...