merkletree
go-mcache
| merkletree | go-mcache | |
|---|---|---|
| 1 | - | |
| 474 | 93 | |
| - | - | |
| 0.0 | 0.0 | |
| 8 months ago | over 4 years 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.
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.
go-mcache
We haven't tracked posts mentioning go-mcache yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
golang levenshtein - Levenshtein distance for golang
bit - Bitset data structure
gocache - ☔️ A complete Go cache library that brings you multiple ways of managing your caches
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
null - Nullable Go types that can be marshalled/unmarshalled to/from JSON.
bloom - Bloom filters implemented in Go.
gota - Gota: DataFrames and data wrangling in Go (Golang)
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom
algorithms - CLRS study. Codes are written with golang.
trie - Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]