Ribbon filter: practically smaller than Bloom and Xor · HackerPapers discussions

Ribbon filter: practically smaller than Bloom and Xor — mentioned by less_less

Thu, 22 Jan 2026 10:14:57 GMT

See also the paper Ribbon filter: practically smaller than Bloom and Xor: https://arxiv.org/abs/2103.02515, which is a similar idea though not by the same authors. IIRC, binary fuse filters are faster to construct than ribbon filters, but typically not quite as space-efficient. There are also frayed ribbon filters (by me) which are slower and more complex to construct but more space-efficient. There's no paper for those, just a Rust implementation. Ribbon filters are deployed in Mozilla's Clubcard for distributing compressed certificate revocation lists: https://github.com/mozilla/clubcard…

Paper and discussion history. A mention is not an endorsement.

Ribbon filter: practically smaller than Bloom and Xor — mentioned by sparkie

Fri, 02 May 2025 10:51:18 GMT

Also quite recent are Ribbon filters: https://arxiv.org/abs/2103.02515 But these, and xor/binary-fuse-filters are only direct replacements for Bloom filters in some problems. There are still problems for which Bloom filters are a better solution. Bloom filters have the advantage that the filter produced by adding two elements, is the same as the bitwise-or of a pair of filters made by adding each element separately. bloom([x, y]) == bloom([x]) | bloom([y]) Also, the filter produced by bitwise-and, `bloom([x]) & bloom([y])`, cannot have any bits set in it which are not also set by `bloom([x…

Paper and discussion history. A mention is not an endorsement.

Ribbon filter: practically smaller than Bloom and Xor — mentioned by awmarthur

Mon, 24 Oct 2022 17:30:04 GMT

related and useful: "Ribbon filter: Practically smaller than Bloom and Xor" (https://arxiv.org/abs/2103.02515) This paper does a good job of showing the space/time tradeoffs of various approximate sets.

Paper and discussion history. A mention is not an endorsement.

Ribbon filter: practically smaller than Bloom and Xor — mentioned by doomrobo

Thu, 08 Sep 2022 07:27:49 GMT

Merkle Hash Trees are not a solution for offline checks. You can very easily check membership in a tree if someone sends you a proof of membership. But to get a proof, you'd either have to generate it yourself (meaning you're storing the whole set anyway) or get it from a third party (ie an online lookup, which is what OCSP is). The forefront of CRL design is in set compression techniques like Ribbon filters https://arxiv.org/pdf/2103.02515.pdf

Paper and discussion history. A mention is not an endorsement.

Ribbon filter: practically smaller than Bloom and Xor — HN submission

Mon, 12 Jul 2021 22:38:03 GMT

Ribbon filter: practically smaller than Bloom and Xor

1 point; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Ribbon filter: practically smaller than Bloom and Xor — mentioned by mfrw

Sun, 11 Jul 2021 08:36:48 GMT

Link to the full paper on arxiv: https://arxiv.org/abs/2103.02515

Paper and discussion history. A mention is not an endorsement.

Ribbon filter: practically smaller than Bloom and Xor — mentioned by java-man

Fri, 09 Jul 2021 18:25:01 GMT

Direct link to paper: [0] https://arxiv.org/abs/2103.02515

Paper and discussion history. A mention is not an endorsement.

Ribbon filter: practically smaller than Bloom and Xor — HN submission

Fri, 05 Mar 2021 23:42:34 GMT

Ribbon filter: practically smaller than Bloom and Xor

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.