AMBR Merkle Tree

Merkle Tree ( also known as Hash Tree ) is a binary tree structure consisting of a root node, a set of middle node, and a set of leaf nodes. The Merkel Tree was first proposed by Merkle Ralf in 1980 and, before Blockchain, was widely used in file systems and P2P systems. Its main features are:

• The lowest leaf node contains stored data or its hash value;

• Non-leaf nodes (including intermediate nodes and root nodes) are hash values of the contents of its two child nodes.

Ambr's verification chain global state machine, the state is a Merkle tree consisting of the account address and the corresponding state. The Merkle tree can be used in the SPV light node wallet, which can reduce the download amount. On the basis of not downloading all the data, the account information data can be compared and verified, and the data transmission and weight are reduced when the P2P network is synchronized.