Talk:MIXMAX generator

TestU01 statistical tests

@Intgr: As I understand you would like to know if MIXMAX has passed statistical tests. The U01 test was performed for the MIXMAX generator. The results of these tests are published in the article already refereed, K. Savvidy (2015) "The MIXMAX Random Number Generator". Comp.Phys.Communic. 196: 161–165. The article is also available in an open-access site: http://arxiv.org/abs/1403.5355. The Table 1 of the article represents the necessary data. In the last column of the Table 1 one can see that the MIXMAX generators of the dimension N bigger than N=88 are passing the BigCrash suite of tests (the U01 test). The default dimension recommended to the users is N=256. Sincerely George Savvidy (George Savvidy 19:30, 21 April 2016 (UTC))

@Savvidy: Well, it's not about "me wanting to know", but about properly satisfying the WP:Verifiability and WP:No original research policies. I read that arXiv copy, that's why I removed the claim. The paper does not mention TestU01 anywhere, it's not clear to a layman which statistical tests were applied in the MIXMAX paper.

What particularly annoyed me, the sources cited in the article didn't support the original claims that "it is one of only a few generators in general use which pass all statistical tests". Like I mention in my edit summary, there's no end of CSPRNGs and stream ciphers that pass every conceivable statistical test, so it's provably false. Coupled with the COI editing, I get the impression that this is just promotion of this research paper. -- intgr [talk] 08:05, 22 April 2016 (UTC)

@Intgr: Would this [[1]] help shed some more light in this topic ? I understand that there's (probably) not such a thing as a perfect RNG in our imperfect physical universe, but perhaps this one looks very promising comparing to others. Anyways, I (also) understand your objection; Wikipedia has standards of objectivity and of being an encyclopedia for the layman, not for researchers. But then, one can find highly technical articles, say: Dirac_delta_function. So, maybe Wikipedia isn't concerned about the layman only, but also for students, and other people with technical knowledge that are looking for a short introduction and a list of bibliography/references. Having said that, I'd kindly suggest to Dr @Savvidy: to consider writing a more detailed article in Scholarpedia (example: [[2]]) as well, since that encyclopedia's articles are created by researchers for researchers. Mlliarm (talk) 23:58, 26 July 2017 (UTC)

@Mlliarm: I had a look at the slides, but they don't look at all convincing to me. First, the author seems to be very partial, i.e. he wants to show MINMAX is good and for this purpose he compares it with random number generators with well-known defects (Mersenne twister). Second, the PractRand screenshots in the slides do not show tests for long sequences (say, a few TB of random data. PractRand goes by default up to 32TB). Third, speed and memory usage DO matter for random number generators, and they are never mentioned!!! One cannot disregard such considerations: even the lousiest LCG can become excellent if you only use a few of the highest bits and/or if for each call you also compute but not return (ie skip) some values (to uncorrelated the output, RANLUX-style). MINMAX claims a very long period, but this also implies high memory usage (because it has to store the state), which for MINMAX must be at least 15KB; this is quite a lot, as common RNG's such as xoroshift* etc. only use ~128/256 bits. Also, no info is given about speed. If we disregard speed/memory we could just always use a good cipher in counter mode (AES, ChaCha...) and be done once and for all. L0rents (talk) 12:15, 25 November 2017 (UTC)

@L0rents: Thanks for the very informative reply. Mlliarm (talk) 10:36, 4 December 2017 (UTC)