Can someone explain to me how the Bloom filter table in BloomFilterCalculations was derived and how it is supposed to work? As I read the table it seems to indicate that with 14 hashes and 20 bits you get a fp of 6.71e-05. But if you plug those numbers into the Bloom filter calculator [1], that is calculated only for 1 item being in the filter. If you merge multiple filters together the false positive rate goes up. And as [1] shows by 5 merges you are over 50% fp rate and by 10 you are at close to 100% fp. So I have to assume this analysis is wrong. Can someone point me to the correct calculations?
Claude [1] https://hur.st/bloomfilter/?n=&p=6.71e-05&m=20&k=14
