CN114416766B

CN114416766B - Practical computing power certification consensus method and device, electronic equipment and storage medium

Info

Publication number: CN114416766B
Application number: CN202210319043.0A
Authority: CN
Inventors: 欧志; 盛富; 蔡东
Original assignee: Shenzhen Yihang Network Information Technology Co ltd
Current assignee: Shenzhen Yihang Network Information Technology Co ltd
Priority date: 2022-03-29
Filing date: 2022-03-29
Publication date: 2022-06-28
Anticipated expiration: 2042-03-29
Also published as: CN114416766A

Abstract

The invention discloses a practical computing power certification consensus method, a practical computing power certification consensus device, electronic equipment and a storage medium, wherein the method comprises the following steps: modifying the node state through a node state assignment algorithm, and calculating a score value according to the modified node state; determining a block of which the corresponding node in the reason signature node pool is responsible for generating the block in the current block; the trade in the reason signature node block and other signature node verification blocks is determined, and the punishment to the Byzantine node and the reward after the successful block are specified. The embodiment of the invention is suitable for the full application scenes of public chains, alliance chains and private chains in different project development. The method has the characteristics of strong consistency, strong fault tolerance and strong disaster tolerance.

Description

Practical computing power certification consensus method and device, electronic equipment and storage medium

Technical Field

The invention relates to the technical field of computers, in particular to a practical computing power certification consensus method, a practical computing power certification consensus device, electronic equipment and a storage medium.

Background

The first generation block chain consensus algorithm represented by a workload certification (POW) uses a method for solving a Hash problem as an important way for ensuring the consistency of block chains, but the POW algorithm has two important defects, firstly, computational power resources are seriously wasted, and the calculation for solving the Hash problem is meaningless, so that huge computational power resources are wasted in the operation for calculating the Hash value of the whole network, secondly, the performance problem is caused, due to the requirement of a solving difficulty coefficient, the transaction confirmation process is slow, TPS of a network using the POW as the consensus algorithm can only reach 20-200, and the application scene is obviously severely limited.

To address the deficiencies of the first generation consensus algorithms, second generation consensus algorithms have been developed, of which representative ones are the equity proof consensus algorithm (POS) and the authority proof consensus algorithm (POA). The POS and POA part solves the problems of serious computational resource waste and insufficient performance, but the POS and POA algorithm brings new problems. The POS and POA algorithms are not complete decentralization consensus algorithms and require the network to authorize the nodes participating in the governance, thus changing the governance structure of the block chain and limiting the capacity expansion capability of the network.

In view of the foregoing, there is a need for improvements and developments in the art.

Disclosure of Invention

In view of the defects of the prior art, the invention provides a practical computing power certification consensus method, a practical computing power certification consensus device, an electronic device and a storage medium, and aims to solve the problem that the capacity expansion capability of a network is limited due to the fact that the network is required to authorize nodes participating in treatment in the prior art.

The technical scheme of the invention is as follows:

a practical computing power proves the consensus method, is used for calculating and setting up the state of participating in the node and dispatching the node to go out the order and realize the consensus mechanism dynamically; wherein the method comprises the following steps:

Modifying the node state through a node state assignment algorithm, and calculating a score value according to the modified node state;

dynamic scheduling, which is used for determining the block of the current block, the block of which is taken charge of by the corresponding node in the reason signing node pool;

and the output block is used for determining the transaction in the output block of the rational signature node and the verification block of other signature nodes, and the penalty of the Byzantine node and the reward after the successful output block are specified.

Furthermore, the node state assignment algorithm supports nodes to be freely added and deleted, a new node automatically obtains a common node state, each node stores the same node state table, and when each round of block comes out, the node state assignment algorithm calculates and updates the state table, wherein the state table comprises a node address, a node state and a score; the score is obtained by weighted calculation according to the number of the node blocks and the average block output time, the node state is updated every 5000 blocks, the node state of 0.1% of the score in the state table is a rational signature node, the node of 1% of the score in the state table is a recurrent signature node, the node of 5% of the score in the state table is a calculation node, and the rest nodes are common nodes.

Further, the dynamic scheduling includes:

Judging whether the number of blocks is integral multiple +1 of 5000;

if not, returning the current block output position +1 in the signature node array to the signature node of the current block output position;

if yes, updating the signature node array according to the previous node state table, and returning the node at the current block output position, wherein the current block output position is 0.

Further, the block outputting comprises:

the selected reason signature node can select transactions from the transaction pool by itself, and the sum of the transaction sizes cannot be smaller than the upper limit of the block size by 95 percent; checking the selected transaction;

submitting other reason signature node for verification after the block construction is completed;

after log (n) number of the reason signature nodes pass the verification, block uplink, wherein n is the total number of the reason signature nodes;

synchronizing block information of all other nodes, and storing the current block as a snapshot;

the reason signature node and the waiting signature node continuously check the current block;

when more than 50% of all the reason signature nodes and the rotation signature node check blocks pass, the block chain snapshot moves forward, if the check blocks cannot pass, the blocks roll back to the previous confirmation block, and a punishment mechanism is started;

punishing byzantine signature nodes.

A practical computing power attestation consensus apparatus, wherein the apparatus comprises:

The node state assignment algorithm device is used for modifying the node state and calculating the score value according to the modified node state;

the dynamic scheduling device is used for determining a block of which the corresponding node in the reason signing node pool is responsible for generating the block in the current block;

and block output means for determining transactions in the block output of the rational signature node and in the verification block of the other signature nodes, and specifying a penalty for the byzantine node and a reward after a successful block output.

Further, in the apparatus, the node state assignment algorithm supports nodes to be added or deleted freely, a new node automatically obtains a common node state, each node stores a same node state table, and when each round of block generation occurs, the node state assignment algorithm calculates and updates the state table, which includes a node address, a node state and a score; the score is obtained by weighted calculation according to the number of the node blocks and the average block output time, the node state is updated every 5000 blocks, the node state of 0.1% of the score in the state table is a rational signature node, the node of 1% of the score in the state table is a recurrent signature node, the node of 5% of the score in the state table is a calculation node, and the rest nodes are common nodes.

Further, the apparatus, wherein the dynamic scheduling apparatus includes:

judging whether the number of blocks is integral multiple +1 of 5000;

Further, the apparatus, wherein the block output device includes:

Penalizing byzantine signature nodes.

Another embodiment of the invention provides an electronic device comprising at least one processor; and (c) a second step of,

a memory communicatively coupled to the at least one processor; wherein,

the memory stores instructions executable by the at least one processor to cause the at least one processor to perform the method described above.

Yet another embodiment of the present invention provides a non-transitory computer-readable storage medium storing computer-executable instructions that, when executed by one or more processors, cause the one or more processors to perform the above-described method.

Has the beneficial effects that: the invention is used for accessing a basic architecture layer of a decentralized block chain network, and provides a block chain consensus algorithm capable of meeting the requirements of high performance and high data throughput. Fast Practical computing power proves that a Consensus algorithm (FPCCA for short) is suitable for public chain, alliance chain and private chain full application scenarios. The method has the characteristics of strong consistency, strong fault tolerance and strong disaster tolerance capability.

Drawings

The invention will be further described with reference to the following drawings and examples, in which:

FIG. 1 is a flow chart of a preferred embodiment of a method for computing capability attestation consensus according to the invention;

FIG. 2 is a functional block diagram of a preferred embodiment of a computing capability demonstration consensus device according to the present invention;

fig. 3 is a schematic diagram of a hardware structure of an electronic device according to a preferred embodiment of the invention.

Detailed Description

In order to make the objects, technical solutions and effects of the present invention clearer and clearer, the present invention is described in further detail below. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.

Embodiments of the present invention will be described below with reference to the accompanying drawings.

The embodiment of the invention provides a practical computing power certification consensus method, which is used for realizing a consensus mechanism by dynamically computing and setting the states of participating nodes and dynamically scheduling the node block-out sequence; referring to fig. 1, fig. 1 is a flow chart of a preferred embodiment of a method for computing capability attestation consensus according to the invention. As shown in fig. 1, it includes the steps of:

s100, a node state assignment algorithm is used for modifying the node state and calculating a score value according to the modified node state;

S200, dynamically scheduling, namely determining a block of which a corresponding node in the reason signing node pool is responsible for block output in the current block;

and S300, a block is generated, the block is used for determining the transaction in the block generation of the rational signature node and the verification block of other signature nodes, and the punishment of the Byzantine node and the reward after the block generation is successful are specified.

Fast Practical computing power proves that the Consensus algorithm (FPCCA) is a block chain Consensus algorithm. The consensus algorithm can be used for accessing a basic architecture layer of a decentralized block chain network, and a high-performance and high-data throughput basic consensus algorithm is provided for the basic architecture layer.

The FPCCA algorithm realizes a consensus mechanism by dynamically calculating and setting the states of the participating nodes and dynamically scheduling the node block-out sequence. Any block chain node running the node code will automatically join the node pool, and the initial state is common node (COMM). The nodes in the node pool are divided into four states: a rational signature node (SIGNER), a round signature node (CAND), a computing node (COMP) and a common node (COMM). And the node state is dynamically calculated and assigned by an FPCCA algorithm, a rational signature node (SIGNER) is responsible for block output, other state nodes are used for redundancy backup and disaster recovery, each round of block output rational signature node (SIGNER) is determined by an FPCCA scheduling algorithm, no competition block output exists, one node is responsible for block output every time, and other rational signature nodes are responsible for verification and vote to confirm a block output result.

In specific implementation, the node state assignment algorithm of the embodiment of the present invention supports free addition and deletion of nodes, a new node automatically obtains a common node state, each node stores an identical node state table, when each round of block generation occurs, the state table is calculated and updated by the algorithm, the state table includes a node address, a node state and a score, the score is calculated according to the number of the node blocks generated and the average time of the generated block, the node state is updated once every 5000 blocks, the node state of 0.1% before the score is a rational signature node, the node of 1% before the score is a rational signature node, the node of 5% before the score is a calculation node, and the rest are common nodes.

In one embodiment, the dynamic scheduling comprises:

judging whether the number of blocks is integral multiple +1 of 5000;

In one embodiment, in the method, the block outputting includes:

Submitting other reason signature nodes for checking after the block is constructed;

after log (n) number of physical signature nodes pass verification, block uplink is carried out, wherein n is the total number of the physical signature nodes;

penalizing byzantine signature nodes.

Another embodiment of the present invention provides a practical computing power certification consensus apparatus, as shown in fig. 2, the apparatus 1 includes:

the node state assignment algorithm device 11 is used for modifying the node state and calculating the score value of the basis for modifying the node state;

a dynamic scheduling device 12, configured to determine a block in the current block for which a corresponding node in the reason signing node pool is responsible for block generation;

and a block-out device 13 for determining the transactions in the block-out of the reason signature node and other signature node verification blocks, and specifying the punishment to the Byzantine node and the reward after the successful block-out.

Furthermore, in the device, the node state assignment algorithm device supports nodes to be freely added and deleted, a new node automatically obtains a common node state, each node stores a same node state table, when each round of block generation occurs, the state table is calculated and updated by an algorithm, the state table comprises a node address, a node state and a score, the score is obtained by weighted calculation according to the number of the node block generation blocks and the average time of the node block generation blocks, the node state is updated once every 5000 blocks, the node state of 0.1% of the score is a rational signature node, the node of 1% of the score is a rational signature node, the node of 5% of the score is a calculation node, and the rest are common nodes.

Further, in the apparatus, the dynamic scheduling apparatus includes:

judging whether the number of blocks is integral multiple +1 of 5000;

Further, in the apparatus, the block output apparatus includes:

when more than 50% of all the reason signature nodes and the waiting signature node check blocks pass, the block chain snapshot moves forward, if the blocks cannot pass, the blocks roll back to the previous confirmation block, and the punishment mechanism is started;

penalizing byzantine signature nodes.

Another embodiment of the present invention provides an electronic device, as shown in fig. 3, the electronic device 10 includes:

one or more processors 110 and a memory 120, where one processor 110 is illustrated in fig. 3, the processor 110 and the memory 120 may be connected by a bus or other means, and the connection by the bus is illustrated in fig. 3.

The processor 110 is used to implement various control logic for the electronic device 10, which may be a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA), a single chip, an ARM (Acorn RISC machine) or other programmable logic device, discrete gate or transistor logic, discrete hardware controls, or any combination of these components. Also, the processor 110 may be any conventional processor, microprocessor, or state machine. The processor 110 may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.

The memory 120, which is a non-volatile computer-readable storage medium, may be used to store non-volatile software programs, non-volatile computer-executable programs, and modules, such as program instructions corresponding to the alert method in embodiments of the present invention. The processor 110 executes various functional applications and data processing of the device 10, i.e. implements the alerting method in the above-described method embodiments, by running non-volatile software programs, instructions and units stored in the memory 120.

The memory 120 may include a storage program area and a storage data area, wherein the storage program area may store an operating device, an application program required for at least one function; the storage data area may store data created according to the use of the device 10, and the like. Further, the memory 120 may include high speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device. In some embodiments, memory 120 optionally includes memory located remotely from processor 110, which may be connected to device 10 via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.

One or more units are stored in the memory 120, which when executed by the one or more processors 110, perform the alerting method of any of the method embodiments described above, e.g. perform the method steps S100 to S300 of fig. 1 described above.

Embodiments of the present invention provide a non-transitory computer-readable storage medium storing computer-executable instructions for execution by one or more processors, for example, to perform steps S100-S300 of the method of fig. 1 described above.

By way of example, nonvolatile storage media can include Read Only Memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), electrically erasable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM), which acts as external cache memory. By way of illustration and not limitation, RAM is available in many forms such as Synchronous RAM (SRAM), dynamic RAM, (DRAM), Synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), Enhanced SDRAM (ESDRAM), Synchlink DRAM (SLDRAM), and Direct Rambus RAM (DRRAM). The disclosed memory controls or memories of the operating environments described herein are intended to comprise one or more of these and/or any other suitable types of memory.

Another embodiment of the invention provides a computer program product comprising a computer program stored on a non-transitory computer-readable storage medium, the computer program comprising program instructions which, when executed by a processor, cause the processor to perform the alert method of the above method embodiment. For example, the method steps S100 to S300 in fig. 1 described above are performed.

The embodiments described above are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one position, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

Through the above description of the embodiments, it is clear to those skilled in the art that the embodiments may be implemented by software plus a general hardware platform, and may also be implemented by hardware. Based on such understanding, the above technical solutions essentially or contributing to the related art can be embodied in the form of a software product, which can be stored in a computer-readable storage medium, such as ROM/RAM, magnetic disk, optical disk, etc., and includes several instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods of the various embodiments or some parts of the embodiments.

Conditional language such as "can," "might," or "may" is generally intended to convey that a particular embodiment can include (yet other embodiments do not include) particular features, elements, and/or operations, among others, unless specifically stated otherwise or understood otherwise within the context as used. Thus, such conditional language is also generally intended to imply that features, elements and/or operations are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without input or prompting, whether these features, elements and/or operations are included or are to be performed in any particular embodiment.

What has been described herein in the specification and drawings includes examples of methods and apparatus capable of providing alerts. It will, of course, not be possible to describe every conceivable combination of components and/or methodologies for purposes of describing the various features of the present disclosure, but it can be appreciated that many further combinations and permutations of the disclosed features are possible. It is therefore evident that various modifications may be made to the disclosure without departing from the scope or spirit thereof. In addition, or in the alternative, other embodiments of the disclosure may be apparent from consideration of the specification and drawings and from practice of the disclosure as presented herein. It is intended that the examples set forth in this specification and figures be considered in all respects as illustrative and not restrictive. Although specific terms are employed herein, they are used in a generic and descriptive sense only and not for purposes of limitation.

Claims

1. A practical computing power proves the consensus method, is used for calculating and setting up the state of participating in the node and dispatching the node to go out the order and realize the consensus mechanism dynamically; characterized in that the method comprises:

an out block for determining transactions in the reason signature node out block and other signature node verification blocks, and specifying a penalty for the byzantine node and a reward after a successful out block;

the node state assignment algorithm supports nodes to be freely added and deleted, a new node automatically obtains a common node state, each node stores the same node state table, when each round of block generation, the node state assignment algorithm calculates and updates the state table, and the state table comprises node addresses, node states and scores; the scores are obtained by weighted calculation according to the number of the node blocks and the average block output time, the node state is updated every 5000 blocks, the node state of 0.1% of the top scores in the state table is a rational signature node, the nodes of 1% of the top scores in the state table are rotation signature nodes, the nodes of 5% of the top scores in the state table are calculation nodes, and the rest are common nodes;

The dynamic scheduling comprises the following steps:

judging whether the number of the blocks is integral multiple +1 of 5000;

2. The method of claim 1, wherein the deblocking comprises:

selecting a reason signature node to select a transaction from a transaction pool, wherein the sum of the transaction sizes cannot be less than 95% of the upper limit of the block size; checking the selected transaction;

Penalizing byzantine signature nodes.

3. An apparatus for practical computing power certification consensus, the apparatus comprising:

block output means for determining transactions in the block output of the rational signature node and in the verification block of the other signature nodes, and specifying a penalty for the byzantine node and a reward after successful block output;

the node state assignment algorithm supports nodes to be added and deleted freely, a new node automatically acquires a common node state, each node stores the same node state table, the node state assignment algorithm calculates and updates the state table when each round of block discharging is carried out, and the state table comprises node addresses, node states and scores; the scores are obtained by weighted calculation according to the number of the node blocks and the average block output time, the node state is updated every 5000 blocks, the node state of 0.1% of the top scores in the state table is a rational signature node, the nodes of 1% of the top scores in the state table are rotation signature nodes, the nodes of 5% of the top scores in the state table are calculation nodes, and the rest are common nodes;

The dynamic scheduling device comprises:

judging whether the number of the blocks is integral multiple +1 of 5000;

4. The apparatus of claim 3, wherein the block-out means comprises:

Punishing byzantine signature nodes.

5. An electronic device, characterized in that the electronic device comprises at least one processor; and the number of the first and second groups,

a memory communicatively coupled to the at least one processor; wherein,

the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-2.

6. A non-transitory computer-readable storage medium storing computer-executable instructions that, when executed by one or more processors, cause the one or more processors to perform the method of any one of claims 1-2.