As per the paper in https://www.cs.cmu.edu/~binfan/papers/login_cuckoofilter.pdf, it mentioned that cuckoo filter had maximum insertion times for the same element.
“Inserting the same item kb+1 times will cause the insertion to fail. This is similar to counting Bloom filters where duplicate insertion causes counter overflow”. Do you know what is the number of kb+1 in RedisBloom’s cuckoo filter implementation? In my opinion, k is # of hash functions, b is the slots on single bucket, is that right?
Thanks in advanced~