Python implementation of Merkle Patricia Trie
-
Updated
Jun 9, 2018 - Python
Python implementation of Merkle Patricia Trie
Simple Implementation of Modified Merkle Patricia Tries
RocksDb storage implementation for the cita-trie merkle trie
Create a Merkle Tree using Python
Repo to better understand Merkle Tree Proof and Merkle Patricia Trie Data Structure
A java implementation of patricia-merkle-trie data structure
Verkle Tree vs Merkle Patricia Tries benchmarks
A verification library for Merkle Particia Tree in Solidity
calculate new mpt root without loading entire trie
Python implementation of the Modified Merkle Patricia Trie
A full Ethereum node (representing the Execution Layer) implementation | For educational purposes only | Referring to reth by Paradigm.xyz
An optimized Merkle Patricia Trie implementation on GPU, fully compatible with and integrable into Ethereum. The paper is published on VLDB 2024.
A comprehensive proofs handler for Ethereum trie
A simplified golang implementation of Ethereum's Modified Patricia Trie.
The most advanced solidity library for merkle (multi) proof verification of different kinds of merkle trees
Library for verifying ethereum state proofs.
Fast Merkle-Patricia Trie (MPT) state root calculator and proof generator for prefix-sorted nibbles
Add a description, image, and links to the merkle-patricia-trie topic page so that developers can more easily learn about it.
To associate your repository with the merkle-patricia-trie topic, visit your repo's landing page and select "manage topics."