go-adaptive-radix-tree
merkletree
| go-adaptive-radix-tree | merkletree | |
|---|---|---|
| - | 1 | |
| 372 | 497 | |
| - | - | |
| 3.4 | 0.0 | |
| 12 days ago | over 1 year ago | |
| Go | Go | |
| MIT License | MIT License |
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.
go-adaptive-radix-tree
We haven't tracked posts mentioning go-adaptive-radix-tree yet.
Tracking mentions began in Dec 2020.
merkletree
-
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?
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
bit - Bitset data structure
gota - Gota: DataFrames and data wrangling in Go (Golang)
go-mcache - Fast in-memory key:value store/cache with TTL
bloom - Bloom filters implemented in Go.
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
bitmap - Simple dense bitmap index in Go with binary operators
bitset - Go package implementing bitsets
conjungo - A small flexible merge library in go
levenshtein - Go implementation to calculate Levenshtein Distance.
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom