Merkle tree also called hash tree. It helps validators check individual transactions parallelly. Merkle tree is looks like a leaf labelled structure with consist of data block. It also allows secure verification of data structure.

Hash tree is named after Ralph Merkle in 1979. Hash trees can be used to verify different kinds of data in between nodes. Blockchains are decentralized and require a data management procedure which can be authorised by the entire blockchain network and also for security and these functions are provided by Merkle trees. Hash tree helps to peer to peer network. In Bitcoin Satoshi Nakamoto applies Merkle trees function, this is first time in cryptocurrency.
Merkle trees are used in proof of reserves. Hash trees are also used in the IPFS and Ethereum network, Dat protocol, Apache wave, Btrfs and Zfs . The concept of the Merkle tree is also being used in the hyperladger fabric blockchain.
Each miner individually validates the transactions and stores them in the leaf of the Merkle tree. In hash tree there is a top hash or root hash or main hash. Every hash tree branch check data immediately step by steps. In hash tree some points has also contains degree, depth, forest and leaf.
The Merkle tree blockchain structure reduce power consumption and reducing the burden on individual notes for making the blockchain scalable. It helps for detect data tampering.
#GateioBountyCreator #BountyCreator #CryptoNewsCarnival #GateioBountyCreator #Bykaranteli #Gate.ioDaily

View Original

This page may contain third-party content, which is provided for information purposes only (not representations/warranties) and should not be considered as an endorsement of its views by Gate, nor as financial or professional advice. See Disclaimer for details.

4 Likes