nowfound

Life & fun · August 7, 2016

Cuckoo Filter Implementation in Go, Better Than Bloom Filters

Cuckoo Filter implementation in Go, better than Bloom Filters (unmaintained) - irfansharif/cfilter

Cuckoo Filter Implementation in Go, Better Than Bloom Filters launched on August 7, 2016 with 181 votes, #155 of 3,856 launches that month and more than 95% of that year's launches. The site was still online in September 2026, 10 years on.

Visit github.com ↗Alternativestop 4% of August 2016

In plain words

Cuckoo Filter Implementation in Go is a data structure library that offers an alternative to traditional Bloom filters for membership testing. It uses a cuckoo hashing approach to determine whether an element exists in a set with fewer false positives than Bloom filters while maintaining similar memory efficiency. The tool is designed for developers building systems that require fast, space-efficient lookup operations, such as databases, caches, and networking applications. It's implemented in Go and available as open-source code on GitHub.

written from the facts on this page · September 2026

Does a similar job

all alternatives →
  • Cuckoo Filter: Practically better than Bloom filter implemented in Go2017 · github.com · ▲16

    Cuckoo Filter: Practically better than bloom filter - vedhavyas/cuckoo-filter

  • Cuckoo Filter in Ruby2017 · github.com · ▲74

    Pure Ruby Cuckoo Filter Implementation. Contribute to pawandubey/cuckoo_filter development by creating an account on GitHub.

  • GPU Cuckoo Filter – faster queries than Blocked Bloom, with deletionJan 2026 · github.com · ▲32

    High-Performance GPU Cuckoo Filter. Contribute to tdortman/Cuckoo-GPU development by creating an account on GitHub.

  • BloomSearch – Keyword search with hierarchical Bloom filters2025 · github.com · ▲66

    Hey HN! I got nerd-sniped by Bloom Filters this weekend, specifically for searching datasets with high "cardinality" (number of unique items). They're an _amazing_ data structure that, at a fixed size, tracks potential set membership. That means unlike normal b-tree indexes, they don't grow with the number of unique items in the dataset. This makes them great for "needle in a haystack" search (logs, document) as implementations like VictoriaMetrics and Bing's BitFunnel show. I've used them in the past, but they've never been center-stage in my projects. I wanted high cardinality keyword…

  • InBloom – Portable Bloom Filters in Java, Python and Go2015 · github.com · ▲45

    Cross language bloom filter implementation. Contribute to EverythingMe/inbloom development by creating an account on GitHub.

  • BF
    Bloom Filter2017 · sacert.github.io · ▲65

More life & fun this month

the category →

Source: Show HN post ↗

Launched alongside, August 2016

the whole month →