# Test the randomness (uniformly distributed) on a 64 bit float random generator

We have a random number generator which is supposed to generate 64 bit floats, uniformly.

We want to test whether it is a good uniformly random.

I am not asking the general way to test it, as it was asked here https://stackoverflow.com/questions/22916519/test-the-randomness-of-a-black-box-that-outputs-random-64-bit-floats.

As I understand, the first step for the test is to somehow divide the whole range into equal sizes like bins, then we keep generating and see the number of "balls" falling into each bin.

How should I split the whole range of 64 bits float?

The range is between -1.79769313486231571e+308 and 1.79769313486231571e+308 and it is huge.

My idea is to utilise the 64 bits. Can I design the equal size bins like this:

1. Every float has 64 bits, so we have 64 bins.
2. For every float generated, we read all those bits, if a bit is 1, then we increased the according bin's number by 1
3. After N samplings, the expected number of each bin should be N/2.
4. Then we carry on pearson's chi-square test, etc.

As it stands, this is not a good way to test whether floating point numbers are uniformly distributed. Like Aksakal, I wondered about whether the bits of the exponent part of the floating point representation would be uniformly distributed. The answer to this is that they aren't uniformly distributed, because there are very many more numbers with large exponents than there are numbers with small exponents.

I wrote a small test program that confirms this. It generates $N = 1 \text{ million}$ uniformly distributed random floating point numbers, and as a control, $N$ random integers. (There were various problems generating 64 bit floating point numbers, see e.g. here, and 32 bits seems sufficient for demonstration purposes.)

First, the control case. The plot of the bins of bits for integers is just as you suggested, with each bin $\approx N/2$. Now for the floating point numbers. A plot of the sorted numbers is a straight line, indicating that they would pass the Kolmogorov–Smirnov test for uniformity. But the bins are definitely not uniform. If you plot only bins 1 to 23 together with bin 32, you do get bins $\approx N/2$, but bins 24 to 31 show a clear increasing pattern. These bits corresponds precisely with the bits for the exponent in 32 bit floating point numbers. The IEEE single precision floating point definition stipulates

• the least significant 23 bits are for the mantissa
• the next 8 bits are for the exponent
• the most significant bit is for the sign

Another way to see this is to consider a simpler example. Think about generating numbers in base 10 between 0 and $10^7$, with a base 10 exponent. Numbers between 0 and 1 would have an exponent of 0. Numbers between 1 and 10 would have an exponent of 1, numbers between 10 and 100 an exponent of 2, ..., and numbers between $10^6$ and $10^7$ an exponent of 7. The numbers $10^4$ to $10^7$ are $(10^7-10^4)/10^7=99.9\%$ of the range and in binary their exponents range from 001 to 111, so you'd expect the most significant bit to occur 99.9% of the time, not 50% of the time.

It would be possible, with some care, to use an approach like this to get the expected frequencies for each bin in the binary exponent of a floating point number, and use this in a $\chi^2$ test, but Kolmogorov–Smirnov is a better approach in theory and easy to implement. Nevertheless a test like this could pick up distributional biases in the implementation of a random number generation that Kolmogorov–Smirnov might not. For example, when I first tried generating 64 bit double precision floating point random numbers in C++, I forgot to change to a 64 bit Mersenne Twister engine. The sorted numbers give a straight line plot, but you can see from the plots of the bins of the bits that the 64 bit Mersenne Twister engine is superior to the 32 bit one (as you would expect). (Note in both cases that the last bit, the sign bit, is zero, due to the difficulties of generating random numbers across the whole range.)

have you looked at A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications by NIST?

I think it's a great place to start your analysis.

• Hi. I understand that there are a number of ways and good ways to really test randomness. But in this question, I particularly know whether my idea is correct or not Apr 8, 2014 at 13:28
• the reason i suggest not to make up your own tests, is that it's a tricky business. so many people are using RNGs for so long that there's got to be a test tried and proven to work, such as "Monobit" or "Frequency Test within a Block", which are suspiciously similar to what you seem to be trying to do (see the NIST suite) Apr 8, 2014 at 13:41
• Hi,sorry, this question is from a telephone interview for a developer position. I think they want to ask for general stats knowledge, combined with CS methods. that's why I focus on bits Apr 8, 2014 at 13:43
• the main flaw in your idea is that 64bit float is probably represented as IEEE 754 double precision floating point number, look it up in interweb. as you'll see it has matissa (fraction) and exponent parts. my gut feeling's that your scheme will not work for this format. Apr 8, 2014 at 13:48