Technically this doesn't prove that this random problem is in fact not a random problem, but a deterministic one ;-). But I concur that it doesn't look good.
Yes. It makes it a bit hard writing a test case... :)
Have people been counting on the random generator of Pike to be generating reproducible sequences?
Yes, but not that one, I think. There are other methods under Crypto that are used when it's supposed to be real or semi-real random.
If not, then we might overhaul the generator to simply use as much bits per call as is needed to generate up to the maximum requested.
Or just kick in the bignum generator for >INT32 for now, but I'm not sure what the problem is.