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

Question

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.

Please add more detail on this, like referral links, documentation, etc. — Pimenta, Jul 08 '20 at 11:36
I’m voting to close this question because it is better asked on crypto.stackexchange.com — Peter O., Jul 09 '20 at 16:06

score 0 · Answer 1 · answered Jul 14 '20 at 16:38

0

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

answered Jul 14 '20 at 16:38

Muktar hossain

1

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

1 Answers1