In essence, these requirements are a test of how well a bit sequence: has zeros and ones equally often; after a sequence of "n" zeros (or ones), the next bit a one (or zero) with probability one-half; and any selected subsequence contains no information about the next element(s) in the sequence.
Veliko raziskovalnega dela iz tistega časa na mnogih področjih, ki se je opiralo na naključno izbiro, na simulacije vrste Monte Carlo ali drugače, je veliko manj zanesljivo, kakor bi lahko bilo.