Merkle Tree
By CoinGecko | Updated on Mar 03, 2020
A Merkle tree is also known as a hash tree in cryptography. It is a tree where every lead node is labelled with cryptographic hash of a data block, and every non-leaf node is labelled with the hash of the labels of its child nodes. It is used to verify of data stored within it and transferable in and between computers.
Related Terms
EIP (Ethereum Improvement Proposal)
Refers to improvement proposals for Ethereum, used to introduce features or any updates on the Ethereum network.
Decentralized Applications (dApps)
Applications that run on decentralized peer-to-peer networks such as Ethereum.
Difficulty
A relative measure on how difficult it is to correctly guess a new block
Delegated Proof-of-Stake (dPOS)
A consensus mechanism where selected members of a network are voted as delegates to validate transactions and produce blocks on a blockchain.
Hungry for more knowledge?
Back to Glossary or Subscribe to our newsletter.