Research On Overlapping Partition Block Chain Based On Core Node Belonging

Since 2008,the features of decentralization,traceability and immutability of blockchain have attracted great attention from academia and industry.However,the low transaction confirmation throughput becomes a significant obstacle to the widespread adoption of blockchains as the number of clients and transactions increases.In addition to network latency,the root cause of the low throughput problem is that the blockchain’s consensus protocol involves all nodes.Every node needs to verify and store all transactions.Every consensus message needs to be broadcast across the entire blockchain network.With the further development of blockchain technology,more and more work has been done to study the scalability of blockchain,however,the existing research schemes still have some problems in various aspects.Previously,in order to improve the scalability of blockchain,researchers and developers have studied sharding,DAG technology,state channels,sidechains and other technologies.Among them,sharding technology is currently considered to be one of the most promising technologies to improve the scalability of blockchain.Its main idea is to divide nodes into small groups called shards,which can process transactions in parallel.However,most of the existing sharding systems use full sharding,that is,each shard is isolated.This adds extra overhead to guarantee atomicity and consistency across shard transactions and severely degrades system performance.This paper proposes a returning degree-based overlapping fraction block chain for problems with poor scalability and low throughput of the block chain.The main research contents of this article are as follows:The existing segmentation block chains are randomized,and the nodes that have more frequent transactions may be assigned to different fractions,improve the proportion of cross-slice transactions,and reduce the system throughput.In response to this problem,this paper proposes concepts such as core nodes and node belonging.We transaction data in a certain period of time as our prior data set,by building a transaction topology to find the core nodes in the block chain,and then assign more closely related nodes with the core node to the core node through the altribrator function.In fragmentation,the span film transaction is reduced by constantly iteration until a stable fragmentation is formed.In order to achieve consistency between the relevant fractions,this paper improves the fragmentation consensus based on multiple slice collaboration.Compared with the complete fraction of multiple negotiation wheels,we need to spend a plurality of negotiated rounds,we need to submit span transactions to atomic submission by redesigned block structures.At the same time,it can be submitted through a round of consensus agreement by improving the slice consensus protocol,thereby increasing the throughput of the system.Finally,we analyze the security,scalability and performance of the system,and the experimental results assessment of this paper shows that our system has better performance.