Accounting method of blockchain consensus algorithm trading system and electronic device

Abstract

The invention discloses an accounting method of a blockchain consensus algorithm trading system and an electronic device. The method comprises a step of performing a preset random calculation at an election initiation time in response to an election initiated by a transaction system at the election initiation time, wherein a random value selected at the election initiation time is calculated according to the random calculation so as to obtain a calculation result which satisfies a preset condition, a step of submitting the calculation result of the preset random condition after the preset timeand selecting first N nodes whose calculation results are most close to the preset condition as random bookkeepers, and a step of allowing the random bookkeepers to carry out signature confirmation on all transactions. According to the accounting method and the electronic device, the problem of a pseudo-random number is overcome by a random calculation mode, thus elected bookkeepers are true andrandom, the problem of counterfeit bookkeepers is avoided, thus the confirmation time of the transaction can be shortened, and the transaction efficiency can be improved while the transaction can be guaranteed to be authentic and reliable.

Description

technical field [0001] The invention relates to the related technical field of a blockchain consensus algorithm transaction system, in particular to an accounting method and electronic equipment for a blockchain consensus algorithm transaction system. Background technique [0002] The blockchain consensus algorithm trading system, such as Bitcoin, adopts the method of proof of work (power of work, POW) to elect a relatively credible "bookkeeper" to book the transactions in the trading system. [0003] However, the existing bookkeeper election method is to randomly select multiple nodes in the transaction system as the bookkeeper. However, the random selection method is selected by random numbers, and the random numbers in the computer are pseudo-random numbers. , is a pseudo-random number generated by a determinable function (eg, linear congruence) through a seed (eg, system time). Therefore, when the seed or the random numbers that have been generated are known, it is poss...

AI Technical Summary

Problems solved by technology

Therefore, the bookkeeper selected by the prior art is easy to fake and unreliable

[0004] For this reason, in order to prevent the bookkeeper from being faked, the existing technology needs to set a confirmation time of up to 1 hour for each transaction, and confirm the transaction through repeated comparisons between multiple bookkeepers for a long time, resulting in transaction time too long

Images