Cryptography, Hashing, Learning, Data Structures, Merkle Tree.
we’re able to demonstrate that A belongs to the tree by just revealing three nodes! This system is known as a Merkle proof. And a very neat thing about it is how nicely it scales. As it so happens, the number of nodes N we have to reveal scales logarithmically with the number of inputs: So for 1024