An optimized Sparse Merkle Tree in Rust
Implementation and comparison of three kinds of sparse Merkle trees.
Python object-oriented implementation of hash tree, originally used as a module in university project
Browser-based Merkle tree and inclusion proof demo — build trees up to 16 leaves with real SHA-256, generate O(log n) membership proofs, tamper any leaf and watch the root change, with Git, Bitcoin, and Certificate Transparency walkthroughs. Part of crypto-lab.
Add a description, image, and links to the inclusion-proof topic page so that developers can more easily learn about it.
To associate your repository with the inclusion-proof topic, visit your repo's landing page and select "manage topics."