Compressed Bloom Filters "Error optimized"Bloom filter is V2 full of 0's,1's. Compression would not help. But this optimization for a fixed filter size m. Instead optimize the false positives for a fixed number of transmitted bits. Filter size m can be larger,but mostly 0's Larger,sparser Bloom filter can be compressed. Useful if transmission cost is bottleneck. Claim:transmission cost limiting factor Updates happen frequently. Machine memory is cheap. 2020 Compressed Bloom Filters  “Error optimized” Bloom filter is ½ full of 0’s, 1’s.  Compression would not help.  But this optimization for a fixed filter size m.  Instead optimize the false positives for a fixed number of transmitted bits.  Filter size m can be larger, but mostly 0’s  Larger, sparser Bloom filter can be compressed.  Useful if transmission cost is bottleneck.  Claim: transmission cost limiting factor.  Updates happen frequently.  Machine memory is cheap