|
|
|
|
|
by bonyt
911 days ago
|
|
I was able to recreate this, eventually. I deleted my earlier comment where I failed to reproduce it - my method of extracting a bitstream from the list of numbers was flawed. First, I greedily requested 10,000 random numbers from xkcd with a script. These numbers are here so nobody need re-commit my deed: https://gist.github.com/tonyb486/0da38e7575071f241551d14101a... Then, I filtered out all numbers 2048 and above so that I just had 11 bits of entropy from each number from [0,2048). I converted that to a stream of binary in ASCII, 11 bits per random number. I fed that list of 78100 bits into STS, as 100 streams of 780 bits. It segfaulted, but it had already written out some results: ------------------------------------------------------------------------------
RESULTS FOR THE UNIFORMITY OF P-VALUES AND THE PROPORTION OF PASSING SEQUENCES
------------------------------------------------------------------------------
generator is <xkcd.ascii>
------------------------------------------------------------------------------
C1 C2 C3 C4 C5 C6 C7 C8 C9 C10 P-VALUE PROPORTION STATISTICAL TEST
------------------------------------------------------------------------------
13 15 7 9 7 6 9 11 17 6 0.137282 97/100 Frequency
13 5 10 12 11 7 4 10 12 16 0.191687 98/100 BlockFrequency
13 11 14 9 2 9 10 7 13 12 0.249284 97/100 CumulativeSums
11 10 12 11 1 10 9 15 8 13 0.181557 98/100 CumulativeSums
6 6 8 18 9 8 11 14 7 13 0.122325 99/100 Runs
16 7 6 12 13 9 7 14 9 7 0.275709 97/100 LongestRun
10 13 12 0 23 0 18 0 24 0 0.000000 * 99/100 FFT
Delightful. |
|