If we have checked the first few bits of x(s) with x and found them to be equal, what is the probability that the correct entry has been retrieved, if the alternative hypothesis is that x is actually not in the database? Assume that the original source strings are random, and the hash function is a random hash function. How many binary evaluations are needed to be sure with odds of a billion to one that the correct entry has been retrieved?