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
Nonce
Abbreviation for ‘number only used once’ It is of vital importance next to the hash in the verification of data from the Bitcoin blockchain network.
Non-custodial
It is a decentralized type-of-wallet, where the users owns its private keys.
Pay-Per-Last N Shares (PPLNS)
PPLNS system only pays miners after the pool has discovered the block. This means you'll only be compensated once the block has been discovered.
ROI
Short for “Return on Investment”, the ratio between the net profit and cost of investing.
Hungry for more knowledge?
Back to Glossary or Subscribe to our newsletter.