nan
merkletree
| nan | merkletree | |
|---|---|---|
| - | 1 | |
| 84 | 475 | |
| - | - | |
| 3.0 | 0.0 | |
| 10 months ago | 9 months 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.
nan
We haven't tracked posts mentioning nan 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?
null - Nullable Go types that can be marshalled/unmarshalled to/from JSON.
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
gota - Gota: DataFrames and data wrangling in Go (Golang)
bit - Bitset data structure
ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
bitset - Go package implementing bitsets
bloom - Bloom filters implemented in Go.
willf/bloom - Go package implementing Bloom filters, used by Milvus and Beego.
go-mcache - Fast in-memory key:value store/cache with TTL
algorithms - CLRS study. Codes are written with golang.
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom