I think we are talking past each other here. What I was missing was the
size of the filter. I was assuming that the size of the filter was the
number of bits specified in the BloomFilterCalculations (error on my
part), what I was missing was the multiplication of the number of bits by
the number
I’m not sure I follow your reasoning. The bloom filter table is false positive
per sstable given the number of bits *per key*. So for 10 keys you would have
200 bits, which yields the same false positive rate as 20 bits and 1 key.
It does taper slightly at much larger N, but it’s pretty nominal
