Merkle Tree
A hash structure that summarises many transactions.
A Merkle tree hashes transactions together in pairs, level by level, down to a single root hash. That root goes in the block header, so any change to any transaction changes the root.
It lets a chain prove a transaction is in a block efficiently, without listing every transaction, and is a building block of how blocks are verified.
Back to the full glossaryReady to start mining?
Pick a coin on the pools overview and open its How to Mine guide for a ready-to-run command.