The University of SydneyPage 22Constructing a block–Constructing the block header
–Previous block hash–Hash of the block headerof the previous block known (received from the network) to the miner. –Merkle Root–Summary of all transactions selected to be included in the block with a Merkle tree.–Merkle tree, also known as a binary hash tree, is a data structure used for efficiently summarizing and verifying the integrity of large sets of data