Glossaire
Merkle Tree Signification : Que Veut Dire Merkle Tree en Crypto ?
Définition
A data structure used to efficiently verify transaction integrity in a block
Invented by Ralph Merkle in 1979, Merkle trees allow quick verification of large datasets with minimal data transfer, optimizing blockchain efficiency for blocks containing thousands of transactions. Implementation Details: Tree Depth: log₂(n) where n = number of transactions. SPV Proof Size: ~1KB for 1000+ transactions. Verification Time: O(log n) complexity. Applications: Light client verification, state tree in Ethereum, certificate transparency logs.