Cryptography, Hashing, Learning, Data Structures, Merkle Tree.
look at this image: See the nodes highlighted in green? That’s all the information we really need to calculate the root. See, we can calculate m = H(a || b), and then u = H(m || n), and finally H(u || v), and we’re done. Instead of revealing all the leaves of the tree (A, B, C, D, E, F, G, I),