In cryptography and the theory of computation, the next-bit test is a test against pseudo-random number generators. We say that a sequence of bits passes the next bit test for at any position i {\displaystyle i} in the sequence, if any attacker who knows the i {\displaystyle i} first bits (but not the seed) cannot predict the ( i + 1 ) {\displaystyle (i+1)} st with reasonable computational power.