2

enter image description here

If we want to check that data is member of it or not we will take the root, data block, and all the blocks in path between data and root. According to this picture if i want to check that data block, then how can i validate the hash pointer store in above block without having left child?

-1

this is the picture of proof path, if you want to get the path, technically you need calculate the hash of all the data block and get the whole merkle tree

| improve this answer | |

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.