How reproducible is "Binary Fuse Filters: Fast and Smaller Than Xor Filters"?

Estimated time to first reproduction: a few days. Risk flags: Adjacent implementations are not paper-verified. No maintained paper-verified implementation was found; start with the closest related repositories below.

Binary Fuse Filters: Fast and Smaller Than Xor Filters

Thomas Mueller Graf, Daniel Lemire

Published: Mar 4, 2022

No direct implementation yet

Evidence: Adjacent

Domain fit: AI-adjacent

Verified repos: 0

Paper appears method- or tooling-adjacent to AI workflows with partial ecosystem coverage.

Time to first repro: a few days

1 risk flag

DOI Publisher

Bloom and cuckoo filters provide fast approximate set membership while using little memory. Engineers use them to avoid expensive disk and network accesses. The recently introduced xor filters can be faster and smaller than Bloom and cuckoo filters. The xor filters are within 23% of the theoretical lower bound in storage as opposed to 44% for Bloom filters. Inspired by Dietzfelbinger and Walzer, we build probabilisti ...

Read full abstract

c filters—called binary fuse filters —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. We compare the performance against a wide range of competitive alternatives such as Bloom filters, blocked Bloom filters, vector quotient filters, cuckoo filters, and the recent ribbon filters. Our experiments suggest that binary fuse filters are superior to xor filters.

Technical details

Canonical key: doi-10.1145_3510449

Cache status: Fresh

Generated at: Jun 18, 2026, 7:03 AM

Artifact coverage: sparse

HF provider: ok (mixed)

PWC source used: No

LLM status: not_generated

LLM model: n/a

LLM generated: Unknown

LLM content type: n/a

HF policy: hf-relevance-v27

context only

Benchmarks: missing

Time to repro: a few days

1 risk flag

Results & Benchmarks

Freshness tier: cold

Direct + Inferred Evidence

No concrete benchmark grounding is available yet. Treat the page as context or an implementation starting point only.

Bloom and cuckoo filters provide fast approximate set membership while using little memory.

Implementation Evidence Summary

Confidence: low

zszszszsz/.config is the closest maintained adjacent implementation (Matches contextual method/domain keyword: algorithm). It is not paper-verified; validate algorithm and evaluation setup against the paper before trusting reported metrics. Community adoption signal: 340 GitHub stars.

Reproduction Risks

Adjacent implementations are not paper-verified
Recommended repository is adjacent and not paper-verified.
Adjacent implementation match confidence is low.

Hardware Notes

Expect multi-day setup/compute for meaningful reproduction based on current guidance.

Evidence disclosure

Evidence graph: 3 refs, 3 links.

Utility signals: depth 70/100, grounding 75/100, status medium.

Implementation Status

No verified maintained repo

There is no verified maintained implementation yet. Use this baseline plan to decide whether to prototype now or defer.

No maintained paper-verified implementation was found; start with the closest related repositories below.
Compare repo methods against the paper equations/algorithm before trusting metrics.
Create a minimal baseline implementation from the paper and use adjacent repos as references.

Time to first repro: a few days

Reproduction readiness

No Repo

Time to first repro: days

Last checked: Jun 18, 2026

Hardware requirements

Expect multi-day setup/compute for meaningful reproduction based on current guidance.

No verified implementation available

· No maintained repository has been identified for this paper. Check adjacent implementations or HF artifacts below.

No benchmark numbers could be verified. You will not be able to validate reproduction correctness against published numbers.

Closest related implementations

These are not paper-verified. Use them as reference points when no direct implementation is available.

zszszszsz/.config

Adjacent

Confidence: Low

Stars: 340

Matches contextual method/domain keyword: algorithm
hexops/fastfilter

Adjacent

Confidence: Low

Stars: 295

Matches contextual method/domain keyword: bloom filter

Hugging Face artifacts

No trustworthy direct or curated related Hugging Face artifacts were found yet.

Continue with targeted Hugging Face searches derived from the paper title and method context:

Models

Binary Fuse Filters Bloom filter Bloom filter model

Datasets

Bloom filter dataset Binary Fuse Filters dataset

Spaces

Bloom filter demo Binary Fuse Filters demo

Tip: start with models, then check datasets/spaces if you need evaluation data or demos.

Direct artifact matches are currently sparse. Use targeted Hugging Face searches to quickly locate candidate models, datasets, and demos.

Search models Search datasets Search spaces

Research context

Citations

References

Tasks

Bloom filter, Cuckoo, Binary number, Fuse (electrical), Computer science, Cuckoo search, Upper and lower bounds, Quotient

Methods

Algorithm

Domains

Mathematics

Evaluation & Human Feedback Data

Open this paper in HFEPX to review benchmark signals, evaluation modes, and human-feedback protocol context.

Open in HFEPX

Explore Similar Papers

Jump to Paper2Code search queries derived from this paper's research context.

Bloom filter Cuckoo Binary number Fuse (electrical) Computer science Cuckoo search