A program to demonstrate Merkle root calculation on GPUs through Vulkan
-
Updated
Jun 3, 2024 - C++
A program to demonstrate Merkle root calculation on GPUs through Vulkan
🌳 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 Algorithm
🌱 Construct Merkle Trees and verify proofs in JavaScript.
🌳 The simple and easy implementation of Merkle Tree
Go Merkle Tree. High performance, Supporting parallel run, OpenZeppelin sorting pairs.
A performance conscious library for merkle root and tree calculations.
Blockchain structure using PHP, has a full blockchain structure for demo purposes
Utilize the Merkle tree data structure for secure verification and minimal memory usage. The root hash represents the list, enabling efficient confirmation of names. Optimize memory by traversing the tree with sibling hashes, ensuring constant memory consumption. Streamline gift distribution with minimal server memory requirements.
A library of hashing algorithms commonly used in blockchain applications.
The "Merkle Root" Hardhat repository aids in managing Merkle tree structures for Ethereum smart contracts, simplifying their implementation and interaction within decentralized applications.
This has the basic solidity code, where you can verify and test Merkle proof with Merkle Tree and root hash
Merkle tree chunking is a technique used to split large amounts of data into smaller chunks and create a Merkle tree out of them. The root of the Merkle tree can be stored on the blockchain, allowing for efficient verification of the integrity of the data. This method is used to enable larger inscriptions on the Bitcoin blockchain ...
MerkleTree & utilities in TypeScript
Alchemy University Ethereum Bootcamp module 2 final project in rust
A java implementation of patricia-merkle-trie data structure
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
Add a description, image, and links to the merkle-root topic page so that developers can more easily learn about it.
To associate your repository with the merkle-root topic, visit your repo's landing page and select "manage topics."