Hash Tree (Merkle Tree) error localization question for 128 data blocks

638 Views Asked by At

For a hash tree that covers 128 data blocks, how many hash checks do you need to perform to localize the error? Assume that error occurred on only one block.

1

There are 1 best solutions below

0
On

The answer is 15. 128 data block produce a tree of depth 8. To find the localize the error (2 multiply depth-1)=(2 multiply 8-1)=15