An Algorithm to Avoid Costless Attacks in Blockchain Consensus

Abstract

The invention discloses an algorithm for avoiding costless attacks in block chain consensus, including the following steps: node users detect the current block main chain; block miners produce the current block on the block main chain; other miners Waiting for a block generation period, waiting for the current block miner to produce the current block on the block main chain; other miners do not find the current block miner to produce the current block on the block main chain after the end of a single block production cycle, then all nodes The user re-selects the block miner of the backup block, and after waiting for one or more block generation cycles, the new block miner generates a backup block on the block main chain; before the next block of the backup block is generated, the backup The block miner of the next block of the block detects the current block main chain, that is, the fork of the block containing the block number with the largest value; if the fork where the backup block is located is the block main chain, the The fork where the block is located; if the fork where the backup block is located is not the main chain of the block, continue to produce blocks on the main chain of the block.

Description

technical field [0001] The invention relates to the technical field of block chains, in particular to an algorithm for avoiding costless attacks in block chain consensus. Background technique [0002] In a distributed network, due to the many nodes in the network and the inevitable communication delay in the network, nodes may experience complex situations such as downtime, failure, failure, etc., for example, the following situations: [0003] When a block of height r is produced, the block miner should be ID_Target r =Q r mod N, pity ID_Target r Due to network delay or malicious reservation of blocks by miners, the whole network fails to perceive the blocks in time. After waiting for the λ time period, the [0004] ID λ =hash(ID||λ||Sig r-1 ) [0005] miners will generate blocks, and at this time the network may face two forks. [0006] It leads to forks in the entire network; at the same time, there are still a certain number of malicious nodes in the network. On a...

AI Technical Summary

Problems solved by technology

[0006] It leads to forks in the entire network; at the same time, there are still a certain number of malicious nodes in the network. On any fork, there are miners who can produce blocks at no cost. At the same time, they will also face several common Possibility of long-range attacks

[0007] The bifurcation leads to inconsistency in the data saved by each node user, resulting in inconsistent and confusing information on the entire network

Images