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
Replay Attack
A replay attack is a form of network attack when valid data transmission is fraudulently intercepted, then delayed or resent to mislead the receiver into doing what the hacker wants.
Hard Fork
It is a permanent divergence of a blockchain into two blockhains. The original blockchain does not recognize the new version.
Degen
Cryptotrading without Due Diligence and research - basically gambling
Application-Specific Integrated Circuit (ASIC)
Refers to specialized computers that are made to do a very specific task (eg. calculate hashes for Bitcoin's Proof-of-Work)
Hungry for more knowledge?
Back to Glossary or Subscribe to our newsletter.