Transaction
A transaction is a record of an action, for example 'Asha sends 2 coins to Ravi'. It is signed by the sender to prove it is real (we learn signatures later).
Block
Many transactions are collected into one block. A block has two parts:
| Part | Contains |
|---|---|
| Header | Previous block hash, Merkle root, timestamp, nonce, difficulty or other network data |
| Body | The list of transactions |
Hash in One Line
A hash is a fingerprint of data. The same data always gives the same fingerprint. Change one letter and the fingerprint changes completely.
The Chain
Each block stores the hash of the previous block. So block 2 depends on block 1, and block 1 depends on block 0.
Why Old Data Cannot Be Changed Easily
- A cheat changes a transaction in Block 1
- Block 1's hash changes
- Block 2 stores the old hash of Block 1, so the link breaks
- To hide it, the cheat must redo Block 2, 3, 4 and all later blocks and convince the network. This is very costly in real networks
Merkle Tree
A Merkle tree summarizes all transactions of a block into one hash (the Merkle root).
- Change any transaction and the root changes
- Light clients can prove one transaction is in a block using only a few hashes (a Merkle proof)
Life of a Transaction
- User signs a transaction in a wallet
- It is sent to a node and broadcast to the network
- It waits in the mempool (waiting area)
- A miner or validator puts it into a block
- The network validates the block and adds it to the chain
- More blocks on top give more confirmations
Practice
- What two parts does a block have?
- What does the previous hash do?
- What does the Merkle root summarize?
Conclusion
Blocks hold signed transactions and a header. Each block stores the previous block's hash, so changing old data breaks the chain. A Merkle root summarizes all transactions.

