Fragment fast selection method based on distributed network

Abstract

The invention discloses a fragment fast selection method based on a distributed network, and relates to the network technical field; the method comprises the following steps: 1, node information registration: registering all nodes participating fragmentation in certain distributed storage system; 2, fragment information configuration: enabling a creator to set a common recognition mode employed bythe fragment and needed parameters such as a common recognition node number; 3, fast fragment selection: enabling the node to compare a calculated Hash distance with a target Hash distance so as to determine whether the node is selected to participate with the fragmentation or not. The method can store the fragment subordination information without needing an extra storage room, and can realize fragment control of a single contact, thus realizing fragment refined control; the method employs the same fragment in the life cycle of the contact, thus reducing the data storage burden.

Description

technical field [0001] The invention relates to the field of network technology, in particular to a distributed network-based fragmentation fast selection method. Background technique [0002] Fragmentation, as an effective method to improve the processing speed and parallel processing capability of the decentralized network, has received more and more attention. In blockchain technology, due to the decentralized nature of the distributed network, it is a challenge to select a fragment that meets the requirements among a large number of nodes. These challenges lie in several aspects: 1. The selection of shards must be completely random, or satisfy a normal distribution; 2. It must be guaranteed that all distributed nodes get the same result; 3. It must be implemented quickly and easily to support fast processing speed. 4. The selection of shards cannot be obtained in some way in advance, so that malicious nodes can conspire to participate in the same shard. [0003] Exist...

AI Technical Summary

Problems solved by technology

These challenges lie in several aspects: 1. The selection of shards must be completely random, or satisfy a normal distribution; 2. It must be guaranteed that all distributed nodes get the same result; 3. It must be implemented quickly and easily to support fast processing speed

4. The selection of shards cannot be obtained in some way in advance, so that malicious nodes can conspire to participate in the same shard

This has several disadvantages: 1. When the nodes change rapidly, it cannot be effectively dealt with; 2. If the number of active nodes in a certain shard is lower than the minimum standard, the shard cannot achieve normal consensus, and must wait until the end of the cycle to restart It can only run normally after allocation, resulting in long-term unavailability of the shard; 3. If the life cycle of a certain contract is longer than the shard selection cycle, unnecessary data storage burden will be caused after the shard is reselected

Images