🚀 go-pugleaf

There are a number of known problems with linear
congruential generaters, mostly due to the hyperplane
problem. However, these generaters are still usefull
for many projects where speed is important. I sometimes
compare runs using a good slow generator with runs
using an LCG. If the LCG is giving the same results, then
I cut back on the slower generater.

My usual practice is to use a shuffle generator based on
several LCG's. See Press et a. Numerical Recipes for an 
example. This is still pretty fast. I have not heard
of any falures of shuffle generaters yet. Comments would be
welcome. Choose a prime for the shuffle table length and
try to have most of the factors relatively prime in the
periods. 

Don Martin Biostatistics, University of Washington