Question: When computing the Merkle tree root for a set of transactions in a block to be inserted in a blockchain, two successive transactions ( or
When computing the Merkle tree root for a set of transactions in a block to be inserted in a blockchain, two successive transactions or intermediate hashes are concatenated and their hash is calculated. Explain what is done if a transaction or an intermediate hash has no counterpart with which it can be concatenated.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
