Is this a good Pseudo-Random Number Generator?
What could possibly be an advantage of your method from directly sampling the bytes from the prime number distribution?
Like:
Start at some integer $k$ and sample the 8 bits as: $k*30+\lbrace -13,-11,-7,-1,1,7,11,13\rbrace$, each time when it is a prime number, you set the bit at that position to 1, otherwise to 0. If your sampled Byte is $&lt;= 64$ use k-= Byte, otherwise use k+= Byte for the next sample.
Isn't this much simpler than your method, or am I missing something of importance?