Elixir implementation of computing the merkle tree root corresponding to a set of transactions
-
Updated
Feb 10, 2022 - Elixir
Elixir implementation of computing the merkle tree root corresponding to a set of transactions
Merkle tree explained implementation, With SHA256 hashing ,root signaning and proof of inclusion.
Merkle tree proof implementation
Blockchain Hashing is a Java program that implements a MerkleTree for use in a blockchain. The project taught the creator about implementing algorithms and methods in Java for use in a blockchain.
Dexm is a cryptocurrency based on Ethereum 2.0
Construct merkle trees with MerkleTree.js and verify merkle proofs in Solidity for quantum resistance
YAY Games test problems. One of the packages builds a Merkle Tree and checks Merkle Proof, another one runs a daemon that communicates with a smart contract on blockchain.
Rust Implementation of Streaming Merkle Root, Proof, and Verify (single leaf) from Luke Champine's paper: Streaming Merkle Proofs within Binary Numeral Trees
Lightweight library that lets you create Merkle trees with custom branching factors.
bht: Reference implementation of Banded Hash Tree, an immutable and appendable hash tree (Merkle tree).
my own merkle tree implemention for Java
CS104 G3T8: Implementation of Merkle Tree as part of CS104 Mathematical Foundations of Computing's project to understand Merkle Tree
Merkle Tree Algorithm
A simple, fast, immutable, in-memory, generic, "hash function-agnostic" merkle tree.
Add a description, image, and links to the merkletree topic page so that developers can more easily learn about it.
To associate your repository with the merkletree topic, visit your repo's landing page and select "manage topics."