Why Bloom Filters Swipe Right on Immutability

In my last post Bloom Filters: MathMania , we worked through the derivations for optimal number of bits to allocate and the right number of hash functions to use – striking a balance between space, computation, and false positives. But all of that math rested on one simple assumption: the set