Block chain storage optimization method based on dynamic widening algorithm

Abstract

The invention belongs to the field of computer system distributed storage technology, block chain technology and network communication technology, and discloses a block chain performance optimization method based on a dynamic widening algorithm, a block chain storage structure uses the dynamic widening algorithm, that is, the width of the block chain storage structure dynamically changes according to network transaction density; the storage structure is a continuously generated directed acyclic graph; the width of the block chain storage structure is the number of out-degree-free nodes of the directed acyclic graph and can also be called the number of current block chain network fragments; the block chain network fragments are fragments formed by block chain node spontaneous point-to-point networking; the transaction density is a proportionality coefficient in positive correlation with the number of block chain network transactions in unit time; the nodes perform transaction confirmation through the dynamic widening algorithm so as to reach a consensus. According to the method, the block chain is divided into a plurality of sub-slices, so that the block chain has a variable width attribute, and the peak performance of block chain transaction processing is improved through consensus mechanism parallelization.

Description

technical field [0001] The invention belongs to the field of computer system distributed storage technology, block chain technology, and network communication technology, and in particular relates to a block chain storage optimization method based on a dynamic widening algorithm. Background technique [0002] Blockchain is a decentralized distributed ledger storage technology that plays an important role in logistics, justice, government affairs, finance and other fields. With the diversification of application scenarios, the transaction data and frequency on the chain are gradually increasing, and there are higher requirements for the transaction confirmation delay and throughput on the chain, and the main bottleneck lies in the consensus algorithm of the blockchain. [0003] At present, the more popular consensus algorithms mainly include the PoW algorithm based on the proof of work and the PBFT algorithm based on the Byzantine fault tolerance problem. Among them, the PoW...

AI Technical Summary

Problems solved by technology

However, due to the abandonment of the chained storage structure, it also brings some insurmountable shortcomings: in order to improve security, the distributed ledger storage based on the directed acyclic graph contains centralized functions, such as coordinators or pre-selected validators, This makes the entire network easier to be manipulated and is challenged by security; although the directed acyclic graph can maintain a certain width in the process of expansion, it is difficult to converge into a single chain, so the finality is difficult to guarantee

Directed acyclic graphs are not a substitute for blockchains, nor can they directly solve the problem of poor performance in blockchain networks using the PBFT consensus algorithm

Images