2 ms·
MT uses a lot of memory. IIRC, it's multiple KiB where 64 bits ought to do fine. A modern CSPRNG like the SHA-3 candidate Skein can produce random data at a st
by marshray 15y ago
MT uses a lot of memory. IIRC, it's multiple KiB where 64 bits ought to do fine.
A modern CSPRNG like the SHA-3 candidate Skein can produce random data at a steady rate of only a few cycles per byte. I wonder if at some point something like that will dethrone MT for non-crypto PRNGs.
- mturmon 15y agoSomething will dethrone the MT -- everything gets dethroned eventually. Besides what you mention, its algorithm is somewhat over-complex. But it will be a long time before an alternative is better in a compelling way. And take a look at the list of implementations for the MT: http://en.wikipedia.org/wiki/Mersenne_twister#Implementations_in_various_languages http://en.wikipedia.org/wiki/Mersenne_twister#Implementation... That's not a single throne, it's a multifaceted empire.