Constructs a new counting bloom filter by determining the optimal bloom filter size n in bits and the
number of hash functions k based on the expected number n of elements in the bloom filter and the
tolerable false positive rate p.
This Redis-backed bloomfilter stores the counting bits in a bit array and uses Lua scripting (available in Redis 2.6
and above) to access it efficiently.