only the case of value on leaf node is supported, that is, the length of all keys is the same.

Converts a byte to a binary byte array, where each byte is 0x0 or 0x1.

The binary byte array represented by bs is restored to a byte.

Tree height: Any value can be reached after 16 nodes (including the root node).

To prove whether the value of a key exists.

Prove each summary in the packaged Hds, HdsRoot=Merkle{[]Hash{Hash(ChainID(4bytes)+Height(8bytes)), Header.Hash}}.

proof header type = ProofHeaderBase + models.BH* (Header column index).

To proof header Cashed root.

To proof header balance delta (deltas generated in local chain).

To proof header Headers root.

To proof header history hash.

[0x30, 0x80) including 80 items, which is the maximum number of properties of block.

To proof header state root.

To proof header VCC root.

Hash only child nodes without Header and Value.

To prove the value of the current node, valueHash should be nil.

The height of the tree in each node is 4 (to reach value after 4 nodes).

An 8-byte unsigned integer (block height) is serialized into 8 bytes in big-endian (high order first) order, and then create a complete binary tree with one nibble one level of TreeNode.

NodeHeader is used to describe the node serialize value 1.

1.

evidence for something.

In order to be able to serialize and deserialize, there can be no undetermined type (interface{}, or interfaces), so it cannot be made into an infinite level tree.

for JSON serialization method.

NodeType is a byte which used to describe the node type bit[7]: 1 if prefix is not nil bit[6]: 1 if children array is not empty bit[5]: 1 if value is not nil bit[4]: when bit[7]=1, 1 if prefix length is odd, 0 if prefix length is even bit[3-0]: when bit[4]=1, first byte of prefix, otherwise=0x0.

in the order of the proof tree from bottom to top.

0-15: to proof a child node 16: to proof node value 254: to proof existence 255: merkle trie proof.