optimal cheap arbitrary bits: 5 cpu cycles per bit

[Daniel Pehoushek]

high quality cheap 5 instruction random prime bits
num b=0; num p=2;
num oneum()
{if(p<4<<++b){p=prime();b=1;}
return(1<<b&p)?1:0;}

daniel2380++

[Daniel Pehoushek]

provably fastest random generator in the universe?
daniel2380++

[B.H.]

You would need to see the proof that BPP = P to see it.

It is not coming out yet, I'm planning to make money from it.

Even with such a random number generator, you would need a good seed--an "unguessable password" that someone could think of--to prevent others from predicting the outputted random numbers. If the "password" is secure, the numbers are random up to a point, in a certain sense. Without giving too much detail, there are "degrees of randomness."

-Philip

[Greta Baine]

Get a brain.

[Daniel Pehoushek]

{if(p<4<<++b){p=prime();b=0;}
return(1<<b&p)?1:0;}

typo lost 1 bit of efficiency
daniel2380++

[Daniel Pehoushek]

theorem of cognition
all monotone qbfs are linear
how think works
daniel2380++