Comment by vlovich123

I think you misread:

> that are within 13% of the storage lower bound -- without sacrificing query speed. As an additional benefit, the construction of the new binary fuse filters can be more than twice as fast as the construction of xor filters. By slightly sacrificing query speed, we further reduce storage to within 8% of the lower bound.

They are faster to construct (2x) and smaller (within 13% of theoretical limit) while maintaining the same query performance.