Open AccessResearch Summary of Blockchain Fragmentation Propagation Mechanism Based on Merkel Tree
Author(s) -
Tian Lan,
Sun Yu
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1914/1/012010
Subject(s) - correctness , computer science , block (permutation group theory) , node (physics) , tree (set theory) , relay , tree structure , blockchain , fragmentation (computing) , algorithm , theoretical computer science , binary tree , mathematics , computer security , engineering , combinatorics , physics , power (physics) , structural engineering , quantum mechanics , operating system
At present, when the blockchain system propagates blocks, it is a point-to-point propagation of complete blocks. This method has three shortcomings: the propagation load is large; the message can only be received from one node; only after the complete block is received, can it be propagated to other nodes. Therefore, this article considers changing the block’s Merkel tree data structure to minimize the data size during block propagation while ensuring that the receiving node can reconstruct the correct and complete block. On the other hand, in order to be able to receive blocks from multiple nodes at the same time and relay to other nodes when incompletely received, the blocks are fragmented and then reorganized. At the same time, the correctness of a single fragment can also be verified.