<p>Because the parent hash is already based on the previous parent hash, and so on, it effectively <em>does</em> include all of them. A merkle tree is a commitment to all of them, this does the same thing. It would just make generating the block header harder before the miner can even start mining, so there would be no benefit.</p>

CC BY-SA 3.0
2017-11-10T02:04:18.300Z
2017-11-10T02:04:18.300Z
meshcollider
<p>Why does new block include only parent's block hash instead of hash of it's all previous blocks calculated using e.g. merkle tree algorithm?</p>

CC BY-SA 3.0
2017-11-09T18:53:05.653Z
What would be the benefit of such approach?
croraf
<blockchain>
Blockchain linking algorithm
Michal
# Blockchain linking algorithm

(Asked by: username_0 on 2017-11-09)

Why does new block include only parent's block hash instead of hash of it's all previous blocks calculated using e.g. merkle tree algorithm?

**Tags:** blockchain

> **Comments:**
> **username_1**: What would be the benefit of such approach?  

---

## 1 answers

### Answer by username_2 on 2017-11-10. Score: 1

Because the parent hash is already based on the previous parent hash, and so on, it effectively *does* include all of them. A merkle tree is a commitment to all of them, this does the same thing. It would just make generating the block header harder before the miner can even start mining, so there would be no benefit.


---

