Message7962

That sounds like an abuse of an PRNG. AFAIK, a PRNG is only supposed to output a pseudo-random bit string of length N, given a seed s.

It is NOT supposed to guarantee to output the set of bit strings {b1[0:n], b2[0:n], ... for small n} given a set of seeds {s1, s2, ...}.

To clarify, here is the underlying behavior:

>>> from random import seed, random
>>> for i in range(1000):
...     seed(i); print random()
... 
0.730967788633
0.730878197405
0.731146941285
0.731057364959
0.730609460976
0.730519869749
0.730788621079
0.730699037303
0.73025113332
0.730161549544
0.730430293423
0.730340717097
0.729892805664
0.729803221888
0.730071965767
0.729982389441
0.732401084355
0.732311508029
0.732580251909
0.732490660682
[...]

Note the similarities in the one-tenth and one-hundredth places.

In other words, what you are doing seem to be asking for a higher order randomness for which the base PRNG is not suited.