Level Tree
Last updated
Last updated
MEVerse's LEVEL Tree technology can improve the 5 times quicker overall verification process.
Merkle trees are used in Bitcoin and Ethereum and serve as a fundamental core component in blockchain networks.
In the traditional Merkle Tree data structure, data is transmitted through P2P (peer-to-peer) or used in the verification process of data exchange in a database like Cassandra. This is mainly used when a relatively big volume over 1 MB has to be processed by the node. Also, when only a proportion is recognized, not the whole Merkle Tree, clear verification is hard to be made. Thus, for clear and correct verification, the presence of the entire Merkle Tree is a prerequisite and entails a whole lot of calculation. Even if Merkle Tree guarantees the verification on a practical level, much memory and calculation are required for SPV (Simple Payment Verification).
MEVerse employs the LEVEL Tree method, clustering 16 blocks as one unit to hash and hash that unit into 16 parts. This is a much more efficient system, making a tree where the hash process of the transaction is simplified, and each level has 16 subunits.
Using this tree system makes 1 route, 16 level 1s, 256 level 2s, 4,096 level 3s and total transaction list of 65,535 (In the serialization process, 2 Bytes is used to limit the maximum number; transaction variable can be 0-65,535). Considerably less memory and calculation resources are utilized, guaranteeing verification of transaction with less resource and network communication in mobile devices in which tree is saved.
A light node saves the LEVEL Tree, not the entire tree, and it requests information in need to the full node. If LEVEL 3 Tree data is saved, only 16 hash and 1 Transaction is sufficient to search specific transactions or verify the validity. Therefore, even if there is low memory, it can be used with a very fast verification process.
