Each non leaf node of a Merkle tree is just the hash of the concatenation of it's children.

Does this literally mean stick the 2 hashes together or is there a more intricate process involved?


Cat(hash1,hash2) => Cat(b5e187f15f1a250e51a7856..,e29ccfc0a7f48e06d19ce02..) =>

Output: b5e187f15f1a250e51a7856..e29ccfc0a7f48e06d19ce02

Cannot find description of this process anywhere! Thanks

ref: https://en.wikipedia.org/wiki/Merkle_tree enter image description here


I asked myself this question too, and by looking at bitcoin's implementation of merkle trees, it seems like the two hashes are first, treated as binary data and second, they're indeed concatenated.

  • Wow ok, that seems too simplistic.. – jamarcus_13 Mar 25 '18 at 22:59

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.