most succinct quality random bit generator:
num um = 0; num p = 2;
// five cycles for each of twelve bits per random prime
ool arbitraryOneum()
{if (p<four<<++um) {p=prime();um=one;}
return p&one<<um?one:zero;}

prime returns a random 15 bit prime.
five cycles is theoretically optimum.
daniel 2391++

On Sunday, June 26, 2022 at 5:40:23 AM UTC-4, Daniel Pehoushek wrote:
> most succinct quality random bit generator:
> num um = 0; num p = 2;
> // five cycles for each of twelve bits per random prime
> ool arbitraryOneum()
> {if (p<four<<++um) {p=prime();um=one;}
> return p&one<<um?one:zero;}
>
> prime returns a random 15 bit prime.
> five cycles is theoretically optimum.
> daniel 2391++
0 three planes make a point
1 one half dozen lines
2 define an idea
3 two halfspaces make a space
4 two halfplanes make a plane
5 two halflines make a line
6 three planes make a point
7 four lines make a square
8 numbers are two colorable
9 theory is two colorable
10 all is black information on white background

high speed and
high quality
random bit
generator

num um = 0; num p = 2;
num Randombit()
{if (p<four<<++um)
{p=prime();um=one;}
return p&one<<um?one:zero;}

prime returns a random fifteen bit prime.
five cycles is theoretically optimum.
Oneum
Arbitrarium
Randombit

in my implementation
the cycle size of the stream is
ten to the seventy

daniel 2391++

On Tuesday, June 28, 2022 at 6:29:09 AM UTC-4, Daniel Pehoushek wrote:
> high speed and
> high quality
> random bit
> generator
>
> num um = 0; num p = 2;
> num Randombit()
> {if (p<four<<++um)
> {p=prime();um=one;}
> return p&one<<um?one:zero;}
> prime returns a random fifteen bit prime.
> five cycles is theoretically optimum.
> Oneum
> Arbitrarium
> Randombit
>
> in my implementation
> the cycle size of the stream is
> ten to the seventy
>
> daniel 2391++
high speed arbitrary bits
shield level quality and time