bloom
Bloom filters implemented in Go. (by zentures)
merkletree
A Merkle Tree implementation written in Go. (by cbergoon)
| bloom | merkletree | |
|---|---|---|
| - | 1 | |
| 147 | 497 | |
| 0.0% | - | |
| 0.0 | 0.0 | |
| over 6 years ago | over 1 year ago | |
| Go | Go | |
| MIT License | MIT License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
bloom
Posts with mentions or reviews of bloom.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning bloom yet.
Tracking mentions began in Dec 2020.
merkletree
Posts with mentions or reviews of merkletree.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-08-12.
-
High-Performance Merkle Tree Implementation in Go
So unlike some other implementations, when building a new Merkle Tree, my program only constructs the leaf node proofs and finally generates the Merkle root rather than caching the tree itself. With this optimization, my program can run much faster than the most started similar library on GitHub: cbergoon/merkletree. I improve the performance better by parallelization with goroutines.
What are some alternatives?
When comparing bloom and merkletree you can also consider the following projects:
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
trie - Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
bit - Bitset data structure
levenshtein - Go implementation to calculate Levenshtein Distance.
go-mcache - Fast in-memory key:value store/cache with TTL
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
willf/bloom - Go package implementing Bloom filters, used by Milvus and Beego.
conjungo - A small flexible merge library in go
mafsa