Life & fun · alternatives · 2026

24 alternatives to Cuckoo Filter: Practically better than Bloom filter implemented in Go

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

Cuckoo Filter is a Go implementation of a probabilistic data structure used for membership testing. It determines whether an item exists in a set with minimal memory overhead, similar to a Bloom filter but with… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes. Cuckoo Filter: Practically better than Bloom filter implemented in Go launched in 2017; newer entries below may have overtaken it.

1
Cuckoo Filter Implementation in Go, Better Than Bloom Filters▲181
Cuckoo Filter implementation in Go, better than Bloom Filters (unmaintained) - irfansharif/cfilter
2016 · github.com · its alternatives →
2
Cuckoo Filter in Ruby▲74
Pure Ruby Cuckoo Filter Implementation. Contribute to pawandubey/cuckoo_filter development by creating an account on GitHub.
2017 · github.com · its alternatives →
3
GPU Cuckoo Filter – faster queries than Blocked Bloom, with deletion▲32
High-Performance GPU Cuckoo Filter. Contribute to tdortman/Cuckoo-GPU development by creating an account on GitHub.
Jan 2026 · github.com · its alternatives →
4
BloomSearch – Keyword search with hierarchical Bloom filters▲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…
2025 · github.com · its alternatives →
5BF
Bloom Filter▲65
2017 · sacert.github.io · its alternatives →
6
BoomFilters – Probabilistic data structures for processing streams▲70
Probabilistic data structures for processing continuous, unbounded streams. - tylertreat/BoomFilters
2015 · github.com · its alternatives →
7
Morton Filter: Fast, Self-Resizing Alternative to Bloom Filter▲11
A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf) - AMDComputeLibraries/morton_filter
2019 · github.com · its alternatives →
8
PDD – Probabilistic De-Duplication of Streams with Bloom Filters▲86
Advanced Bloom Filter Based Algorithms for Efficient Approximate Data De-Duplication in Streams - jparkie/PDD
2016 · github.com · its alternatives →
9
InBloom – Portable Bloom Filters in Java, Python and Go▲45
Cross language bloom filter implementation. Contribute to EverythingMe/inbloom development by creating an account on GitHub.
2015 · github.com · its alternatives →
10
Fast Self-Resizing Bloom Filter Alternative▲5
A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf) - AMDComputeLibraries/morton_filter
2019 · github.com · its alternatives →
11
Automated smooth Nth order derivatives of noisy data▲146
This little project came about because I kept running into the same problem: cleanly differentiating sensor data before doing analysis. There are a ton of ways to solve this problem, I've always personally been a fan of using kalman filters for the job as its easy to get the double whammy of resampling/upsampling to a fixed consistent rate and also smoothing/outlier rejection. I wrote a little numpy only bayesian filtering/smoothing library recently (https://github.com/hugohadfield/bayesfilter/) so this felt like a fun and very useful first thing to…
2024 · github.com · its alternatives →
12
Beehive – An open source IFTTT powered by Go's templating engine▲247
A flexible event/agent & automation system with lots of bees 🐝 - muesli/beehive
2017 · github.com · its alternatives →
13
Birdseed – A silly way to get random numbers by hashing tweets▲68
:bird: :game_die: Use Twitter's Search API to get random numbers - GitHub - ryanmcdermott/birdseed: :bird: Use Twitter's Search API to get random numbers
2015 · github.com · its alternatives →
14
Public transportation signage based on bloom filters (rough mockup)▲128
Hello, I was running around Germany, hectically navigating public transportation, and getting lost all the time. I noticed that every station had i platforms, each used lists of n buses (trains, whatever) arriving, each has their list of m destinations. That means I would be scanning i x n x m items just to see if I was at the correct stop. As I was nervous, for every bus that arrived, I would rescan the list of stops to double check. I began thinking how I could make a better system. Linked is a very shoddy mockup of how bloom filters could be used to allow passengers O(1) lookup time for…
2023 · github.com · its alternatives →
15
ShapedQL▲211
The SQL engine for search, feeds, and AI agents
Jan 2026 · its alternatives →
16
A Go implementation of TensorFlow's streaming quantiles estimator▲98
Optimal Quantile Approximation in Streams. Contribute to axiomhq/quantiles development by creating an account on GitHub.
2018 · github.com · its alternatives →
17
An improved version of HyperLogLog▲194
HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom - axiomhq/hyperloglog
2017 · github.com · its alternatives →
18
Checking 320M passwords in milliseconds with serverless bloom filters▲33
Using serverless functions to provide an API for checking potential passwords against an enormous corpus of passwords leaked from security breaches. - jthomas/serverless-pwned-passwords
2017 · github.com · its alternatives →
19
A radically more scalable alternative to Bayesian Optimization▲96
Experimental Global Optimization Algorithm. Contribute to chrisstroemel/Simple development by creating an account on GitHub.
2018 · github.com · its alternatives →
20
C++ Implementation of the Paper Median Filter in Constant Time▲49
Arm neon optimization practice. Contribute to Ldpe2G/ArmNeonOptimization development by creating an account on GitHub.
2019 · github.com · its alternatives →
21SA
ShapedQL – A SQL engine for multi-stage ranking and RAG▲80
Hi HN, I’m Tullie, founder of Shaped. Previously, I was a researcher at Meta AI, worked on ranking for Instagram Reels, and was a contributor to PyTorch Lightning. We built ShapedQL because we noticed that while retrieval (finding 1,000 items) has been commoditized by vector DBs, ranking (finding the best 10 items) is still an infrastructure problem. To build a decent for you feed or a RAG system with long-term memory, you usually have to put together a vector DB (Pinecone/Milvus), a feature store (Redis), an inference service, and thousands of lines of Python to handle business logic…
Jan 2026 · playground.shaped.ai · its alternatives →
22
Reducing the size of PCSA to that of HyperLogLog▲45
Contribute to seiflotfy/pcsa development by creating an account on GitHub.
2018 · github.com · its alternatives →
23
A weekend replication of STOKE, a stochastic superoptimiser▲58
Haskell re-implementation of STOKE, the stochastic superoptimizer - blaze/notebooks/tutorial.ipynb at master · bollu/blaze
2019 · github.com · its alternatives →
24
A pure reference counting GC in Go▲57
Contribute to sendilkumarn/gopurerc development by creating an account on GitHub.
2020 · github.com · its alternatives →

Also compare

Ranked by how close each launch is in meaning, then by votes. Prices were read from each product’s own site when checked and can change. Refine with your own description →