🌳 The simple and easy implementation of Merkle Tree
-
Updated
Jun 1, 2024 - Python
🌳 The simple and easy implementation of Merkle Tree
Incremental Merkle Tree (IMT) - a specialized form of a Merkle tree designed to allow for efficient appending of new elements
Merkle-tree in Python
This code aims to build a Merkle tree from a list of values. All data are hashed using the cryptographic hash algorithm SHA-3 (Secure Hash Algorithm 3).
Functional blockchain that combines the ideas of proof-of-work, transactions, blocks, and blockchains.
Repo to better understand Merkle Tree Proof and Merkle Patricia Trie Data Structure
Merkle tree explained implementation, With SHA256 hashing ,root signaning and proof of inclusion.
Token drop template on Tezos blockchain, based on Merkle Tree Distribution mechanism.
Contains implementation for merkle tree in Go, Rust, Python
Merkle tree·可视化·快速查询·增删·visualization·quick query·add·delete
Implementation and comparison of three kinds of sparse Merkle trees.
LoR Merkle proof verifier
Data driven Public Key Ecosystem Backed by Blockchain & Fault Tolerance. Keywords: Trustless PKI, Blockchain, Consensus, Merkle tree, Merkle proof, Practical Byzantine Fault Tolerance (PBFT), Proof of Work (PoW), X.509 alternative
A python program which explains the working of Merkle Tree along with it's impementation.
Add a description, image, and links to the merkle-proof topic page so that developers can more easily learn about it.
To associate your repository with the merkle-proof topic, visit your repo's landing page and select "manage topics."