{"p":"can-20","op":"mint","tick":"can","amt":"1000","rows":[{"df":"qa","content":[{"q":"What is a Merkle Tree?","a":"A Merkle tree is a binary tree-like data structure, also known as a hash tree. In a Merkle tree,  each node is a special form of hash based on its child nodes. Specifically, the hash of a leaf node is generated from the data block stored there (such as a file or a part of a file), and the hash of a non-leaf node is generated from the hashes of its child nodes. The main advantage of Merkle tree is that it can be used to efficiently and securely verify the content of large data structures. Because the hash of each node depends on its child nodes, if any part of the data changes, it will cause the hash to change."}]}],"pr":"a8d9c2812302286e151974ca8f62722dd93eb5ea830b4128db7bffce4c77e12a"}