Merkle Root
The Merkle root folds all of a block's transactions into a single number. Through it your ASIC, without knowing it, signs off on the block's contents.
What it is and why
A block's transactions are hashed in pairs, the results again in pairs, and so on down to a single number at the top. That number is called the Merkle root and it sits in the block header. The ASIC grinds through header hashes, so every attempt it makes already carries the block's full contents inside.
No quiet substitution is possible: swapping any transaction changes the root, the root changes the header, and all the work done so far stops matching it. A found solution therefore proves two things at once: the work itself and the contents of the block it was done over.
The tree also enables quick checks: to confirm a transaction is in a block you don't need the whole block, a short branch from it up to the root is enough. Light wallets that skip storing the full chain stand on exactly this.
Mining has an everyday tie to the root too: when the pool updates the block contents or moves a field in its service transaction, the root gets recomputed and workers receive a new job. Frequent new jobs from the pool are the Merkle tree living its life, not a connection problem.
The short version
| What it is | a block's transactions folded into one number |
| Where it sits | in the block header |
| What it guarantees | block contents can't be swapped quietly |
| What wallets get | transaction proof without the whole block |
| Link to the ASIC | a new job on every recompute |
Where a miner runs into it
New jobs from the pool every few seconds: the pool reshuffled the block contents, the root changed, work continues with a new header.
A job switch when a fresh block appears in the network: the old contents expired wholesale, and work finished on it becomes a stale share.
A light wallet on your phone confirms your payout with a Merkle branch without downloading the block: the same tree in daily use.
In pool reports the words merkle root show up in raw job data: no need to flinch, it is a normal part of the protocol.
An example on your fingers
A block holds four transactions: A, B, C, D. Pairs AB and CD are hashed, then their results together, and one number remains. Change even a byte in C and a different number lands on top, one that all the found work no longer matches. That is how four lines are guarded by one.
Related terms
Where to go next on the site
Coins
- Bitcoin coins
Algorithms
- SHA-256 algorithms
Questions and answers
Does the ASIC know anything about the block's transactions
No, it only sees the header with the finished root. The pool assembles the block contents, the ASIC proves work over those contents.
Why does the pool send jobs so often
The pool refreshes the block contents: new transactions, new fees. Every root recompute is a new job, and that is the normal rhythm of the work.
Are the Merkle root and the tree root the same thing
Yes, the Merkle tree is the structure of pairwise hashes and the root is its top. Only the top makes it into the block header.
How the terms connect
Every link in the chain is clickable. Orange marks where you are now.
Looking for an ASIC miner
The catalog holds 212 models. You can compare them by hashrate and by joules per terahash, then plug your own rate into the calculator and see what stays in your pocket.
Page written and checked by Denys Klimchuk. Updated .