From the official site given in the URL: ---- snip ----- SFMT is a new variant of Mersenne Twister (MT) introduced by Mutsuo Saito and Makoto Matsumoto in 2006. The algorithm was reported at MCQMC 2006. The article will apper in the proceedings of MCQMC2006. (see Prof. Matsumoto's Papers on random number generation.) SFMT is a Linear Feedbacked Shift Register (LFSR) generator that generates a 128-bit pseudorandom integer at one step. SFMT is designed with recent parallelism of modern CPUs, such as multi-stage pipelining and SIMD (e.g. 128-bit integer) instructions. It supports 32-bit and 64-bit integers, as well as double precision floating point as output. SFMT is much faster than MT, in most platforms. Not only the speed, but also the dimensions of equidistributions at v-bit precision are improved. In addition, recovery from 0-excess initial state is much faster. See Master's Thesis of Mutsuo Saito for detail (submitted). ----- snip ------- So SFMT is a nice new RNG and dSFMT is a special version of it for generating doubles directly. Adam Piątyszek has kindly made easy-to-install libraries from the reference implementations of SFMT and dSFMT, and here are the ebuilds for those. The gentoo-science overlay people might be interested about these for Monte Carlo simulations or such. Reproducible: Always Steps to Reproduce:
Created attachment 157309 [details] libsfmt-1.3.0.ebuild
Created attachment 157311 [details] libdsfmt-1.3.1.ebuild
In science overlay, thanks for those ebuilds, they were easy to review!
Tested on x86 w/ gcc-4.3.1
I don't think there's much value to keeping this bug open in 2022. The SFMT is an improvement over the classical MT, but is still previous-generation technology as far as performance and statistical guarantees are concerned.
