Assume totally has 1M record. We want test is 1% wrong rate. 7 hash functions. In this way, it totally need around 1.14MB bits for the bloom filter.
Bloom filter block those which doesn’t exist. For those bloom filter think the value exist, there is 1% chance wrong.
Refer bloom filter calculator. http://hur.st/bloomfilter?n=1000000&p=0.01