The probability part of data structures like bloom filters are intrinsic, and are fundamental to the actual reason they are used. At the set sizes they are use

The probability part of data structures like bloom filters are intrinsic, and are fundamental to the actual reason they are used. At the set sizes they are useful for, you simply have to make trade offs for performance reasons, and the trade off you are making is explicit. If you are are using a bloom filter, you know upfront that false positives will happen. That is a fundamental part of the code you will write, it isn’t something you will discover at a later date. You will write tests for false positives. It is well understood what the probabilities are for false positives. If you can’t live with that in your code, you might not be able to work on the sorts of workloads that bloom filters are good for.