Implementing the use case of Merkel Tree in verifying if the name exists in the tree or not.
-
Updated
Dec 12, 2022 - JavaScript
Implementing the use case of Merkel Tree in verifying if the name exists in the tree or not.
A mixer that uses merkle trees and zero-knowledge proofs to provide shielded transfers of Ethereum
Blockchain Technology Projects
use Merkel trees to prove if a name is on list - see code
The Merkel Tree Gift List project manages gift assignments based on a Merkel tree structure. Users input person and gift data and hashed into the tree. Clients provide a name and proof to the server. If the hash matches the stored Merkel root, gifts are assigned. This ensures secure and accurate gift management.
A secure C library to check integrity of a file
Simple reference implementation of Merkle trees for general use.
In cryptography and computer science, a hash tree or Merkle Hash Tree is a tree in which every "leaf" (node) is labelled with the cryptographic hash of a data block, and every node that is not a leaf (called a branch, inner node, or inode) is labelled with the cryptographic hash of the labels of its child nodes
Sample blockchain concept implementation from scratch.
Assignments and Quizes - Coursera BlockChain Specialization By University of California - Irvine
Command line (bash) scripts to upload large files to AWS glacier using multipart upload and to calculate the required tree hash
Add a description, image, and links to the merkel-tree topic page so that developers can more easily learn about it.
To associate your repository with the merkel-tree topic, visit your repo's landing page and select "manage topics."