merkletree
algorithms
| merkletree | algorithms | |
|---|---|---|
| 1 | - | |
| 475 | 764 | |
| - | - | |
| 0.0 | 0.0 | |
| 9 months ago | about 3 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.
algorithms
We haven't tracked posts mentioning algorithms yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
gota - Gota: DataFrames and data wrangling in Go (Golang)
bit - Bitset data structure
null - Nullable Go types that can be marshalled/unmarshalled to/from JSON.
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
go-datastructures - A collection of useful, performant, and threadsafe Go datastructures.
bloom - Bloom filters implemented in Go.
go-mcache - Fast in-memory key:value store/cache with TTL
gostl - Data structure and algorithm library for go, designed to provide functions similar to C++ STL
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom