Mar 22, 2025

The most significant of these plots is the first, showing how dramatically search cost of a Poisson distribution can be reduced using cascading filters. This is dramatically more efficient than both Bloom filtering (and Cuckoo filtering), and preserves the ability to use memory fencing to protect inserts. This is because it does not waste any bits, and aligns the filter rate closely to the Poisson distribution - staving off saturation much longer.