# MINSTD

best https://oeis.org/A096559

https://oeis.org/A221556

https://oeis.org/A096550

old 16807
new 48271
alternate 69621 better for 7th and higher dimension

https://web.archive.org/web/20181018200921if_/http://random.mat.sbg.ac.at/results/karl/server/server.html

simscript II mod 2^31-1, a 630360016 = 14^29, c 0
Implemented in the SIMSCRIPT II and INSIGHT simulation
programming language and employed by the FORTRAN RAN function


BCSLIB in the totally portable random number generator HSRPUN from BCSLIB (Boeing Computer Services).
   c 7261067085, seed 0

SIMULA mod 2^35, a 5^15, c 0 seed 1. Variants with mod 2^47 and 2^48 exists

URN12(URN11) mod 2^31, a = 5^15  mod 2^31 = 452807053, c 0, seed 1


mod 2^32, a 69069, c 0, s 1
This generator, proposed by George Marsaglia is part of a combined Generator
called SUPER-DUPER (combined with a shift-register generator).

As a candidate for the best of all multipliers,
I nominate 69069 = 3*7*11*13*23. This palindromically convoluted multiplier is easy to
remember and has a nearly cubic lattice for moduli $2^{32}$, $2^{35}$, $2^{36}$.
Super-Duper was sometimes implemented in the form $LCG(2^{32}, 69069, c=1, s=0) better spectral test results.


zx https://oeis.org/A357907

knut_b https://oeis.org/A221555

D.E. Knuth.
The Art of Computer Programming, volume 2: Seminumerical Algorithms.
Addison-Wesley, Reading, MA, 2nd edition, 1981.

chat gpt thinks about this a 
742938285 also in paper
1343714438 in paper
950706376
123456789
62089911 https://oeis.org/A096559

Original DIEHARD CD
https://web.archive.org/web/20160125103112/http://stat.fsu.edu/pub/diehard/
https://webhome.phy.duke.edu/~rgb/General/dieharder/
https://github.com/GINARTeam/Diehard-statistical-test/tree/master
https://github.com/apex-hughin/DieHarder
https://www.stata.com/support/cert/diehard/