CN112991068B - Share authorization proof DPoS consensus method, device, electronic device and storage medium - Google Patents

Abstract

The embodiment of the invention discloses a share authorization certification (DPoS) consensus method, a device, electronic equipment and a storage medium, which are applied to a block chain network, wherein the block chain network comprises nodes in a normal state, a good state, an abnormal state or a malicious state, and the method comprises the following steps: acquiring a first node in the blockchain network and a new block generated by a new transaction in the blockchain network; under the condition that the new block meets a preset condition, converting the first state of the first node into a second state, and obtaining an initial credit value of the first node in the second state; the initial credit value characterizes a degree of trust of the first node in the second state; obtaining a voting result of the new block, performing credit reward and punishment on other nodes according to the voting result and the initial credit value, and determining credit values of the other nodes; and determining the second node with the credit value smaller than a preset threshold value, and deleting the second node.

Description

Share authorization proof DPoS consensus method, device, electronic device and storage medium

technical field

The present invention relates to the field of blockchain technology, and in particular, to a consensus method, device, electronic device and storage medium for Proof of Share Authorization (DPoS).

Background technique

At present, the consensus methods of blockchain mainly include: Proof of Work (PoW), Proof of Stake (PoS), and Delegate Proof of Stake (DPos). Among them, the PoW consensus method is relatively mature. It ensures data integrity and data security through the competition of distributed nodes' computing power. However, its powerful computing power causes waste of resources, mainly electricity resources, and 10-minute transactions. Confirmation time is not suitable for commercial applications of small transactions. In the PoS consensus method, the node with the highest equity rather than the highest computing power in the system obtains the right of bookkeeping, and its equity is reflected in the node's ownership of a specific currency. PoS solves the problem of wasting PoW computing power to a certain extent, and can shorten the time to reach consensus, but its credit foundation is not reliable enough, and there is a risk of monopoly. DPoS is a "democratic centralized" accounting method, in which the nodes in the system vote to elect representatives, and the representatives conduct accounting. DPoS can solve the problem of wasting energy in PoW, and it can also make up for the disadvantage that participants with bookkeeping rights in PoS may not want to participate in bookkeeping. cause a safety hazard. However, there is currently no effective solution to the above problems.

SUMMARY OF THE INVENTION

In view of this, the embodiments of the present invention are expected to provide a consensus method, apparatus, electronic device, and storage medium for Proof of Share Authority (DPoS).

The technical embodiments of the embodiments of the present invention are implemented as follows:

An embodiment of the present invention provides a Proof of Share Authorization (DPoS) consensus method, which is applied to a blockchain network, where the blockchain network includes nodes in a normal state, a good state, an abnormal state or a malicious state, and the method includes :

Obtain the first node in the blockchain network and a new block generated by a new transaction in the blockchain network; the first node is any one of the nodes;

In the case that the new block satisfies the preset condition, the first state of the first node is converted to the second state, and the initial credit value of the first node in the second state is obtained; the first The state is any of the normal state, the good state, and the abnormal state; the second state is the normal state, the good state, the abnormal state, or the malicious state, except for the Any state other than the first state; the initial credit value represents the trust level of the first node in the second state;

Obtain the voting result of the new block, perform credit rewards and punishments on other nodes according to the voting result and the initial credit value, and determine the credit value of the other nodes; the other nodes are the nodes except the first one. nodes other than nodes;

Determine the second node whose credit value is less than a preset threshold, and delete the second node; the second node is a node of the other nodes.

In the above solution, when the new block satisfies the preset condition, the first state of the first node is converted to the second state, and the initial state of the first node in the second state is obtained. Credit value, including:

In the case that the new block satisfies that the new block is a valid block, and the number of valid blocks is greater than a first preset threshold, the first node is converted from the normal state to the good state state, the initial credit value of the first node in the good state is obtained; the valid block indicates that the new transaction does not cause conflict.

In the above solution, when the new block satisfies the preset condition, the first state of the first node is converted to the second state, and the initial state of the first node in the second state is obtained. Credit value, including:

When the new block satisfies that the new block is an invalid block, and the number of the invalid blocks is less than or equal to a second preset threshold, the first node is converted from the normal state to the Abnormal state, and the first node is converted from the good state to the abnormal state, and the initial credit value of the first node in the abnormal state is obtained; the invalid block indicates that the new transaction produces a conflict .

In the above solution, when the new block satisfies the preset condition, the first state of the first node is converted to the second state, and the initial state of the first node in the second state is obtained. Credit value, including:

In the case that the new block satisfies that the new block is an invalid block and the number of the invalid blocks is greater than a second preset threshold, the first node is converted from the abnormal state to the malicious state state, obtain the initial credit value of the first node in the malicious state; the invalid block indicates that the new transaction conflicts.

In the above solution, credit rewards and punishments are performed on other nodes according to the voting result and the initial credit value, and the credit value of the other nodes is determined, including:

Perform credit penalty on other nodes according to the voting result and the initial credit value, and obtain the credit penalty value of the other nodes;

Obtain the credit reward value of the other nodes;

According to the credit penalty value and the credit reward value, the credit value of the other node is determined.

An embodiment of the present invention provides a Proof of Share Authority (DPoS) consensus device, which is applied in a blockchain network, where the blockchain network includes nodes in a normal state, a good state, an abnormal state or a malicious state, and the device includes : obtain unit, conversion unit and determination unit, where:

The obtaining unit is used to obtain a first node in the blockchain network and a new block generated by a new transaction in the blockchain network; the first node is any node among the nodes ;

The conversion unit is configured to convert the first state of the first node to the second state under the condition that the new block obtained by the obtaining unit satisfies a preset condition, and obtain the location of the first node in the The initial credit value of the second state; the first state is any state in the normal state, the good state, and the abnormal state; the second state is the normal state, the good state, any state other than the first state in the abnormal state or the malicious state; the initial credit value represents the trust level of the first node in the second state;

The determining unit is configured to obtain the voting result of the new block, perform credit rewards and punishments on other nodes according to the voting result and the initial credit value obtained by the conversion unit, and determine the credit value of the other nodes; The other nodes are the nodes other than the first node in the nodes; determine the second node whose credit value is less than the preset threshold, delete the second node; the second node is the second node of the other nodes node.

In the above solution, the conversion unit is further configured to convert the new block into The first node transitions from the normal state to the good state, and obtains the initial credit value of the first node in the good state; the valid block indicates that the new transaction does not cause a conflict.

In the above solution, the conversion unit is further configured to convert all the blocks in the case that the new block satisfies that the new block is an invalid block and the number of the invalid blocks is less than or equal to a second preset threshold. converting the first node from the normal state to the abnormal state and converting the first node from the good state to the abnormal state, and obtaining the initial credit value of the first node in the abnormal state; The invalid block indicates that the new transaction collided.

In the above solution, the conversion unit is further configured to convert the The first node is converted from the abnormal state to the malicious state, and obtains the initial credit value of the first node in the malicious state; the invalid block indicates that the new transaction conflicts.

In the above solution, the determining unit is further configured to perform credit punishment on other nodes according to the voting result and the initial credit value, and obtain the credit punishment value of the other node; obtain the credit reward value of the other node ; According to the credit penalty value and the credit reward value, determine the credit value of the other nodes.

An embodiment of the present invention provides an electronic device, including: a processor and a memory for storing a computer program that can be executed on the processor, wherein the processor is configured to execute the method described above when the computer program is executed. any step.

An embodiment of the present invention provides a computer-readable storage medium on which a computer program is stored, and when the computer program is executed by a processor, implements any step of the foregoing method.

The share authorization proof (DPoS) consensus method, device, electronic device, and storage medium provided by the embodiments of the present invention, wherein, by obtaining the first node in the blockchain network and a new transaction occurs in the blockchain network The new block generated; the first node is any node in the nodes; in the case that the new block satisfies the preset condition, convert the first state of the first node to the second state, and obtain The initial credit value of the first node in the second state; the first state is any state in the normal state, the good state, and the abnormal state; the second state is the normal state any state other than the first state in the state, the good state, the abnormal state or the malicious state; the initial credit value represents the trust level of the first node in the second state; Obtain the voting result of the new block, perform credit rewards and punishments on other nodes according to the voting result and the initial credit value, and determine the credit value of the other nodes; the other nodes are the nodes except the first one. Nodes other than the node; determine the second node whose credit value is less than the preset threshold, delete the second node; the second node is the node of the other nodes, which can timely, effectively and accurately diagnose malicious nodes, and delete the second node. Eliminate malicious nodes in the set of proxy nodes to avoid potential security risks to the network.

Description of drawings

FIG. 1 is a schematic diagram of an implementation process of a DPoS consensus method according to an embodiment of the present invention;

FIG. 2 is a schematic diagram of node state transition in a DPoS consensus method according to an embodiment of the present invention;

FIG. 3 is a schematic structural diagram of a DPoS consensus device according to an embodiment of the present invention;

FIG. 4 is a schematic diagram of a hardware entity structure of an electronic device in an embodiment of the present invention.

Detailed ways

In order to make the purpose, technical solutions and advantages of the present invention clearer, the present invention will be further described in detail below with reference to the accompanying drawings. All other embodiments obtained under the premise of creative work fall within the protection scope of the present invention.

In the following description, reference is made to "some embodiments" which describe a subset of all possible embodiments, but it is understood that "some embodiments" can be the same or a different subset of all possible embodiments, and Can be combined with each other without conflict.

In the following description, the term "first\second\third" is only used to distinguish similar objects, and does not represent a specific ordering of objects. It is understood that "first\second\third" Where permitted, the specific order or sequence may be interchanged to enable the embodiments of the invention described herein to be practiced in sequences other than those illustrated or described herein.

Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. The terms used herein are for the purpose of describing the embodiments of the present invention only, and are not intended to limit the present invention.

Before further describing the embodiments of the present invention in detail, the terms and terms involved in the embodiments of the present invention are described. The terms and terms involved in the embodiments of the present invention are applicable to the following explanations.

1) Signature, that is, digital signature, a digital string that can only be generated by the sender of the information and cannot be forged by others, and is also an effective proof of the authenticity of the information sent by the sender of the information; digital signatures usually define two complementary operations, One is used for signature and the other is used for verification, which is the application of asymmetric key encryption technology and digital digest technology.

2) In response, it is used to represent the condition or state on which the executed operation depends, and when the dependent condition or state is satisfied, one or more of the executed operations may be real-time or may have a set delay; Unless otherwise specified, there is no restriction on the order of execution of multiple operations to be executed.

3) Transaction (Transaction), which is equivalent to the computer term "transaction". Transaction includes operations that need to be submitted to the blockchain network for execution, not just transactions in a business context. In view of the conventional use of blockchain technology The term "transaction", the embodiment of the present invention follows this convention.

For example, the Deploy transaction is used to install the specified smart contract to the nodes in the blockchain network and is ready to be invoked; the Invoke transaction is used to append the record of the transaction in the blockchain by invoking the smart contract, and Perform operations on the state database of the blockchain, including update operations (including adding, deleting, and modifying key-value pairs in the state database) and query operations (that is, querying key-value pairs in the state database).

4) Blockchain is the storage structure of encrypted and chained transactions formed by blocks.

5) Blockchain Network, a collection of nodes that incorporate new blocks into the blockchain through consensus.

6) Ledger is a general term for blockchain (also known as ledger data) and a state database synchronized with the blockchain. Among them, the blockchain records transactions in the form of files in the file system; the state database records transactions in the blockchain in the form of different types of key (Key) value (Value) pairs to support Quick lookup of transactions in the blockchain.

7) Smart Contracts, also known as Chaincode or application code, are programs deployed in the nodes of the blockchain network, and the nodes execute the smart contracts called in the received transactions to update the state database. Key-value operations to update or query data.

8) Consensus is a process in the blockchain network, which is used to reach agreement on the transactions in the block among the multiple nodes involved, and the agreed block will be appended to the end of the blockchain , the mechanisms for achieving consensus include Proof of Work (PoW, Proof of Work), Proof of Stake (PoS, Proof of Stake), Proof of Delegated Proof-of-Stake (DPoS, Delegated Proof-of-Stake), Proof of Elapsed Time (PoET, Proof of Elapsed Time), etc.

Based on the above explanations of the terms and terms involved in the embodiments of the present invention, the following describes a consensus method for Proof of Share Authorization (DPoS) proposed in this embodiment, which is applied to a blockchain network, where the blockchain network includes a normal state. , a node in a good state, an abnormal state, or a malicious state. Figure 1 is a schematic diagram of the implementation process of the DPoS consensus method according to an embodiment of the present invention. As shown in Figure 1, the method includes:

Step S101: Obtain a first node in the blockchain network and a new block generated by a new transaction in the blockchain network; the first node is any node among the nodes.

It should be noted that the number of nodes in the blockchain network is multiple, and the state of each node has a normal state, a good state, an abnormal state or a malicious state; the normal state can represent the initial state of the node, The node does not generate invalid transactions, and it can also be understood that the node does not generate invalid blocks, and the credit value is generally 170-190; the normal state can represent the initial state of the node, and the node does not generate invalid transactions, which can also be understood as the The node does not generate invalid blocks, and the credit value is generally 170-190; the good state can represent that the node has generated valid transactions, or it can be understood that the node has generated valid blocks, and the credit value is generally 150-170; the abnormal state It can indicate that the node has generated invalid transactions, or it can be understood that the node has generated invalid blocks, and the number of invalid blocks is less than or equal to the preset threshold, and the credit value is generally 150-170; the malicious state can indicate that the node has generated Invalid transaction, it can also be understood that the node has generated invalid blocks, and the number of invalid blocks is greater than the preset threshold, and the credit value is generally less than 150; in practical applications, the normal state can be recorded as NS, the The good state may be denoted as GS, the abnormal state may be denoted as AS, and the malicious state may be denoted as ES. The first node is any one of multiple nodes. Obtaining the first node in the blockchain network may be obtaining any node in the blockchain network.

Obtaining a new block generated by a new transaction in the blockchain network can be understood as a new transaction in the blockchain network, and nodes in the entire network compete for bookkeeping, and the nodes that succeed in the competition record all the transaction information in the area. New blocks generated by new transactions in the blockchain network.

Step S102: in the case that the new block satisfies the preset condition, convert the first state of the first node to the second state, and obtain the initial credit value of the first node in the second state; The first state is any of the normal state, the good state, and the abnormal state; the second state is the normal state, the good state, the abnormal state, or the malicious state Any state other than the first state; the initial credit value represents the trust level of the first node in the second state.

It should be noted that the preset conditions represent whether the new block is a valid block and the number of times that the new block is generated. In practical applications, once a new block is generated, there will be one new block, and if a new block is generated multiple times, there will be multiple new blocks, that is, the number of new blocks generated corresponds to the number of new blocks. As an example, the preset condition may include a first preset condition, a second preset condition, and a third preset condition;

The first preset condition may be that the new block is a valid block, and the number of the valid blocks is greater than a first preset threshold; wherein, the first preset threshold may be determined according to the actual situation, This is not limited. As an example, the first preset threshold may be 10 times; correspondingly, in the case that the new block satisfies the preset condition, the first state of the first node is converted to the second state to obtain The initial credit value of the first node in the second state may be that when the new block satisfies the first preset condition, the first state of the first node is converted to the second state, and the obtained value is obtained. the initial credit value of the first node in the second state. Specifically, when the new block satisfies that the new block is a valid block, and the number of the valid blocks is greater than a first preset threshold, the first node is converted from the normal state For the good state, the initial credit value of the first node in the good state is obtained; that is, in the case that the new block satisfies the first preset condition, the normal state of the blockchain network can be The node is converted to a node in good state. Obtaining the initial credit value of the first node in the good state may be determined according to the actual situation, which is not limited herein. As an example, the initial credit value of the first node in the good state may be 190.

The second preset condition may be that the new block is an invalid block, and the number of the invalid blocks is less than or equal to a second preset threshold, wherein the second preset threshold may be determined according to the actual situation. This is not limited. As an example, the second preset threshold may be three times; correspondingly, in the case that the new block satisfies the preset condition, the first state of the first node is converted to the second state to obtain The initial credit value of the first node in the second state may be that when the new block satisfies the second preset condition, the first state of the first node is converted to the second state, and the obtained value is obtained. the initial credit value of the first node in the second state. Specifically, when the new block satisfies that the new block is an invalid block, and the number of the invalid blocks is less than or equal to a second preset threshold, the first node is changed from the normal state to the normal state. Converting to the abnormal state and converting the first node from the good state to the abnormal state, obtaining the initial credit value of the first node in the abnormal state; that is, in the new block Under the condition that the second preset condition is satisfied, a node in a normal state in the blockchain network can be converted into a node in an abnormal state, and a node in a good state can be converted into a node in an abnormal state. Obtaining the initial credit value of the first node in the abnormal state may be determined according to the actual situation, which is not limited herein. As an example, the initial credit value of the first node in the abnormal state may be 150.

The third preset condition may be that the new block is an invalid block, and the number of the invalid blocks is greater than a second preset threshold, wherein the second preset threshold may be determined according to the actual situation, here Not limited. As an example, the second preset threshold may be three times; correspondingly, in the case that the new block satisfies the preset condition, the first state of the first node is converted to the second state to obtain The initial credit value of the first node in the second state may be that when the new block satisfies the third preset condition, the first state of the first node is converted to the second state, and the obtained value is obtained. the initial credit value of the first node in the second state. Specifically, when the new block satisfies that the new block is an invalid block, and the number of the invalid blocks is greater than a second preset threshold, the first node is converted from the abnormal state For the malicious state, obtain the initial credit value of the first node in the malicious state; that is, in the case that the new block satisfies the third preset condition, the abnormal state in the blockchain network can be The node transitions to a malicious state node. Obtaining the initial credit value of the first node in the malicious state may be determined according to the actual situation, which is not limited herein. As an example, the initial credit value of the first node in the malicious state may be 145.

Step S103: Obtain the voting result of the new block, perform credit rewards and punishments on other nodes according to the voting result and the initial credit value, and determine the credit value of the other nodes; Nodes other than the first node described above.

Here, obtaining the voting result of the new block may be obtaining the voting result of the node in normal state, the node in good state, and the node in abnormal state corresponding to the new block; wherein, the voting result includes an affirmative vote and a negative vote .

Perform credit reward and punishment on other nodes according to the voting result and the initial credit value, and determine the credit value of the other node may be performing credit punishment and credit reward on other nodes according to the voting result and the initial credit value, and determine the credit value of the other node.

As an example, performing credit penalties and credit rewards on other nodes according to the voting result and the initial credit value, and determining the credit value of the other nodes may be based on the voting result and the initial credit value. Perform credit punishment to obtain the credit punishment value of the other node; obtain the credit reward value of the other node; determine the credit value of the other node according to the credit punishment value and the credit reward value.

，所述初始信用值记为

，所述其他节点的信用惩罚值记为

，则

可以通过以下式（1）表示，

可以通过以下式（2）表示：For ease of understanding, here is an example, the first node is the i-th node, the other nodes are the i+1-th node, and the voting result is recorded as

, the initial credit value is denoted as

, the credit penalty value of the other nodes is recorded as

,but

It can be represented by the following formula (1),

It can be represented by the following formula (2):

（1）

(1)

（2）

(2)

表示在投票过程中对有恶意投票行为节点的一种惩罚。In Equation (2), t is the time interval from the start of the last vote to the next vote; U represents the speed at which the credit value decreases, which is a constant and can be determined according to the actual situation, which is not limited here. As an example, U can be 2; T represents a time constant, when t < T, that is, when the time interval between two votings is less than T, the node's credit value does not change, on the contrary, the credit value will decrease, and the node votes After success, the time t will be reset, that is, t=0, to encourage nodes to participate in voting;

Indicates a punishment for nodes with malicious voting behavior during the voting process.

，则

可以通过以下式（3）表示：The credit rewards of the other nodes can be recorded as

,but

It can be represented by the following formula (3):

（3）

(3)

为第i个节点的信用奖励，可以根据实际情况进行确定，在此不做限定。作为一种示例，

可以为0。In formula (3),

is the credit reward of the i-th node, which can be determined according to the actual situation, and is not limited here. As an example,

Can be 0.

，所述信用惩罚值记为

，所述信用奖励值记为

，则

可以通过以下式（4）表示：According to the credit penalty value and the credit reward value, determining the credit value of the other node may be performing a preset operation on the credit penalty value and the credit reward value to determine the credit value of the other node. Wherein, the preset operation may be determined according to the actual situation, which is not limited herein. As an example, the preset operation may be an addition operation. For the convenience of understanding, here is an example, assuming that the credit value of the other node is recorded as

, the credit penalty value is recorded as

, the credit reward value is recorded as

,but

It can be represented by the following formula (4):

（4）

(4)

Step S104: Determine a second node whose credit value is less than a preset threshold, and delete the second node; the second node is a node of the other nodes.

Here, the preset threshold is determined according to the actual situation, which is not limited here. The preset threshold may be a credit value corresponding to a node in a malicious state. For ease of understanding, here is an example, assuming that the credit value corresponding to the node in the malicious state is lower than 150, that is, the credit value corresponding to the node in the malicious state is less than 150, the preset threshold may be 150.

Determining the second node whose credit value is less than the preset threshold value, and deleting the second node can be understood as selecting the node corresponding to the credit value less than the preset threshold value according to the credit value of the other nodes as the second node, Delete the second node; wherein, the second node can be understood as a node in a malicious state.

The DPoS consensus method provided by the embodiment of the present invention obtains a first node in the blockchain network and a new block generated by a new transaction in the blockchain network; the first node is one of the nodes in the blockchain network. If the new block satisfies the preset condition, convert the first state of the first node to the second state, and obtain the initial credit value of the first node in the second state ; the first state is any of the normal state, the good state, the abnormal state; the second state is the normal state, the good state, the abnormal state or the malicious state any state in the state except the first state; the initial credit value represents the trust degree of the first node in the second state; obtain the voting result of the new block, according to the voting result and The initial credit value is used to reward and punish other nodes, and the credit values of the other nodes are determined; the other nodes are nodes other than the first node in the nodes; The second node is to delete the second node; the second node is a node of the other nodes, which can diagnose malicious nodes effectively and accurately in a timely manner, and eliminate malicious nodes in the set of proxy nodes, so as to avoid potential security risks to the network.

In an optional embodiment of the present invention, when the new block satisfies a preset condition, the first state of the first node is converted to the second state, and the first node is obtained in The initial credit value of the second state includes: in the case that the new block satisfies that the new block is a valid block, and the number of the valid blocks is greater than the first preset threshold A node transitions from the normal state to the good state, and obtains the initial credit value of the first node in the good state; the valid block indicates that the new transaction does not conflict.

It should be noted that, the valid block can be understood as that there is no conflict in the transaction, that is, the transaction is successful and data is recorded.

The first preset threshold may be determined according to the actual situation, which is not limited herein. As an example, the first preset threshold may be 10 times;

In the case that the new block satisfies that the new block is a valid block, and the number of valid blocks is greater than a first preset threshold, the first node is converted from the normal state to the good state state, obtaining the initial credit value of the first node in the good state can be understood as satisfying that the new block is a valid block in the new block, and the number of valid blocks is greater than the first preset threshold In the case of , the nodes in the normal state in the blockchain network are all converted into nodes in the good state, and the initial credit value of the nodes in the good state in the blockchain network is obtained. The initial credit value of the node in the good state can be determined according to the actual situation, which is not limited here. As an example, the initial credit value of the node in good state may be 190.

In practical applications, once a new block is generated, there will be one new block, and if a new block is generated multiple times, there will be multiple new blocks, that is, the number of new blocks generated corresponds to the number of new blocks.

In an optional embodiment of the present invention, when the new block satisfies a preset condition, the first state of the first node is converted to the second state, and the first node is obtained in The initial credit value of the second state includes: when the new block satisfies that the new block is an invalid block, and the number of the invalid blocks is less than or equal to a second preset threshold, changing the The first node is converted from the normal state to the abnormal state and the first node is converted from the good state to the abnormal state, and the initial credit value of the first node in the abnormal state is obtained; The invalid block indicates that the new transaction collided.

It should be noted that the invalid block can be understood as a transaction conflict. The second preset threshold may be determined according to the actual situation, which is not limited herein. As an example, the second preset threshold may be three times.

When the new block satisfies that the new block is an invalid block, and the number of the invalid blocks is less than or equal to a second preset threshold, the first node is converted from the normal state to the Abnormal state and the first node is converted from the good state to the abnormal state, and obtaining the initial credit value of the first node in the abnormal state can be understood as satisfying the new block in the new block as Invalid blocks, and if the number of invalid blocks is less than or equal to the second preset threshold, convert the normal state nodes in the blockchain network into abnormal state nodes and convert the blockchain network The nodes in the good state in the network are all converted into nodes in the abnormal state, and the initial credit value of the node in the abnormal state in the blockchain network is obtained. The initial credit value of the node in the abnormal state can be determined according to the actual situation, which is not limited here. As an example, the initial credit value of the node in the abnormal state may be 150.

In practical applications, once a new block is generated, there will be one new block, and if a new block is generated multiple times, there will be multiple new blocks, that is, the number of new blocks generated corresponds to the number of new blocks.

In an optional embodiment of the present invention, when the new block satisfies a preset condition, the first state of the first node is converted to the second state, and the first node is obtained in The initial credit value of the second state includes: in the case that the new block satisfies that the new block is an invalid block, and the number of the invalid blocks is greater than a second preset threshold, assigning the first A node is converted from the abnormal state to the malicious state, and obtains the initial credit value of the first node in the malicious state; the invalid block indicates that the new transaction conflicts.

It should be noted that the invalid block indicates that the new transaction conflicts, that is, the invalid block can be understood as a new transaction conflict. The second preset threshold may be determined according to the actual situation, which is not limited herein. As an example, the second preset threshold may be three times.

In the case that the new block satisfies that the new block is an invalid block and the number of the invalid blocks is greater than a second preset threshold, the first node is converted from the abnormal state to the malicious state state, obtaining the initial credit value of the first node in the malicious state can be understood as satisfying that the new block is an invalid block in the new block, and the number of the invalid blocks is greater than the second preset threshold In the case of the abnormal state in the blockchain network, all nodes in the abnormal state are converted into nodes in the malicious state, and the initial credit value of the node in the malicious state in the blockchain network is obtained. The initial credit value of the node in the malicious state can be determined according to the actual situation, which is not limited here. As an example, the initial credit value of the node in the malicious state may be 145.

In practical applications, once a new block is generated, there will be one new block, and if a new block is generated multiple times, there will be multiple new blocks, that is, the number of new blocks generated corresponds to the number of new blocks.

In an optional embodiment of the present invention, performing credit rewards and punishments on other nodes according to the voting result and the initial credit value, and determining the credit value of the other nodes includes: according to the voting result and the initial credit value The credit value performs credit punishment on other nodes, and obtains the credit punishment value of the other nodes; obtains the credit reward value of the other nodes; determines the credit value of the other nodes according to the credit punishment value and the credit reward value. .

In this embodiment of the present invention, other nodes are subjected to credit punishment according to the voting result and the initial credit value, and obtaining the credit punishment value of the other nodes may be based on the voting result and the initial credit value through a first A formula is set to perform credit penalty on other nodes, and the credit penalty value of the other nodes is obtained; wherein, the first preset formula can be determined according to the actual situation, which is not limited here. The first preset formula represents whether to impose a credit penalty on a node in a normal state or a node in a good state to cast a negative vote. As an example, the preset formula can refer to the above formula (1) and formula (2) .

Obtaining the credit reward value of the other node may be obtaining the credit reward value of the other node based on a second preset formula; wherein, the second preset formula may be determined according to the actual situation, which is not limited herein. The second preset formula represents whether to perform a credit reward for a situation where a node in an abnormal state casts a negative vote. As an example, the second preset formula can refer to the above formula (3).

Determining the credit value of the other node according to the credit penalty value and the credit reward value may be determining the credit value of the other node by using the credit penalty value and the credit reward value according to a third preset formula ; wherein, the third preset formula can be determined according to the actual situation, which is not limited here. The third preset formula represents the credit value of the other node at the moment. As an example, the third preset formula can refer to the above formula (4).

In the DPoS consensus method provided by the embodiment of the present invention, by performing credit punishment on other nodes according to the voting result and the initial credit value, the credit punishment value of the other node is obtained; the credit reward value of the other node is obtained; according to The credit penalty value and the credit reward value are used to determine the credit values of the other nodes, so as to solve the security risks caused by malicious nodes occupying account rights in the blockchain DPoS consensus method, as well as the low voting enthusiasm of retail nodes.

In order to facilitate understanding, a practical application scenario is illustrated here. In practical applications, a DPoS consensus method can be a DPoS consensus algorithm based on credit rewards and punishments. In order to accurately diagnose and eliminate malicious nodes in the proxy node set, refine The node state, in addition to the normal state and abnormal state, introduces a good state and a malicious state. At the same time, in order to enhance the timeliness of malicious node removal, in addition to supporting votes, nodes can also vote against votes based on their own judgments in the voting process, and use voting behavior to affect node status changes, so as to accurately and timely remove malicious proxy nodes.

The first step is to define the four states of the node.

Each node has four states, and the four states are as follows: normal state, which can be recorded as NS, which can be understood as the initial state of all nodes. At the same time, it can also be understood as indicating that the proxy node does not produce invalid blocks, and the credit The value range is 170-190; the good state can be recorded as GS, which can be understood as the proxy node continues to generate valid blocks and exceeds the cumulative number of times threshold, and the credit value range is 190-200; abnormal state can be recorded as AS, It can be understood that the proxy node generates invalid blocks but does not exceed the accumulated value, and the range of credit value is 150-170; the malicious state can be recorded as ES, which can be understood as the proxy node produces invalid blocks many times, and the range of credit value for less than 150.

The second step is node state transition. After refining the node state, each node judges the node behavior according to a given preset condition and performs state transition. The preset conditions include at least a first preset condition, a second preset condition, and a third preset condition.

Node state transitions are performed according to state transition conditions:

The first preset condition: multiple valid blocks are continuously generated, and the number of valid blocks exceeds the accumulated value N1.

The second preset condition: invalid blocks are generated, and the number of the invalid blocks is less than or equal to the accumulated value N2.

The third preset condition: invalid blocks are generated multiple times, and the number of the invalid blocks is greater than the accumulated value N2.

N1 and N2 are determined according to the actual situation, and are not limited here. Therefore, the normal state node is converted to a good state node when the first preset condition is satisfied; the normal state node and the good state node are converted to an abnormal state node when the second preset condition is satisfied; the abnormal state node is in the third preset state. When the conditions are established, it will be converted into a malicious state node; abnormal state nodes will not be allowed to participate in voting and proxy node elections for a period of time.

For ease of understanding, a schematic diagram of node state transition in the DPoS consensus method according to an embodiment of the present invention is illustrated here. FIG. 2 is a schematic diagram of node state transition in the DPoS consensus method according to an embodiment of the present invention. As shown in FIG. 2 , the normal state may be denoted as NS , the good state may be denoted as GS, the abnormal state may be denoted as AS, and the malicious state may be denoted as ES. The node in the normal state is converted from the node in the normal state to the node in the good state when the first preset condition is satisfied; the node in the normal state is converted from the node in the normal state when the second preset condition is satisfied. The node is converted into a node in an abnormal state, and the node in a good state is converted from a node in a good state to a node in an abnormal state when the second preset condition is satisfied; the node in the abnormal state is in a third preset condition. When established, the node in a good state is converted to a node in an abnormal state.

The third step, credit reward and punishment model: The voting process based on credit reward and punishment involves three basic factors: negative votes, credit penalties and credit rewards.

Credit value initialization: Get the credit initial value of each node.

Credit penalty: The credit value of each node will be calculated according to its vote.

The credit penalty value of the i+1th node is calculated according to the credit value of the i-th node, and the process can refer to the above formula (1) and formula (2).

Credit reward: In order to improve the accuracy of the credit reward, after each round of voting results, it is determined whether the AS node that has been voted against has become a proxy node. If not, the node that voted against the AS will receive a credit reward. Then the credit value remains unchanged, and the AS node is removed from the set of proxy nodes as soon as possible.

The credit reward value of the i+1th node is calculated according to the vote of the ith node, and the process can refer to the above formula (3).

The credit penalty and credit reward of each node are added together to form the credit value of the i+1th node at this moment. This process can refer to the above formula (4).

Then, the credit value of the proxy node is judged, and the nodes whose credit value is lower than 150 malicious state are eliminated.

In the fourth step, the proxy node is elected.

The nodes with the right to be elected are voted, and the credit value of each node is calculated. Finally, the top N nodes with the most credit values are selected and become proxy nodes. The replacement of the proxy node set requires regular voting and node credit value. renew.

In the fifth step, the proxy node produces blocks.

Generate a Merkle tree of all transaction data in the block, put it into the block body, save the root value of the Merkle tree in the block header, and use the SHA256 algorithm to calculate the hash value of the block header data of the previous block, which is The parent hash value of the new block, saves the current time in the timestamp field, and broadcasts the block to the set of proxy nodes in the entire network.

The sixth step is to verify.

After the agent node set receives the broadcasted new block, it verifies the data and block information in the block, focusing on verifying the attributes in the block header: including serial number, timestamp, Merkle root value, last block hash value and The new block hash. It mainly verifies whether the specific content in the received block is valid, and the specific judgment is based on the fact that the data in the block is recognized by two-thirds of the proxy nodes in the entire network. After all verifications are passed, the block is judged to be valid.

The seventh step is to wind the chain.

The proxy node adds the verified block to the blockchain to form an electronic certificate information data chain to the latest block. When there are multiple forked chains in the main chain, the appropriate one is selected as the main chain according to the criteria of the consensus algorithm.

The share authorization proof DPoS consensus method provided by the embodiment of the present invention solves the security risks caused by malicious nodes occupying account rights in the blockchain DPoS consensus method, and the problem of low voting enthusiasm of retail nodes.

This embodiment proposes a DPoS consensus device for certificate of share authorization, which is applied to a blockchain network, where the blockchain network includes nodes in a normal state, a good state, an abnormal state or a malicious state. FIG. 3 is an embodiment of the present invention. A schematic diagram of the composition and structure of the DPoS consensus device, as shown in FIG. 3 , the device 200 includes: an obtaining unit 201, a converting unit 202 and a determining unit 203, wherein:

The obtaining unit 201 is configured to obtain a first node in the blockchain network and a new block generated by a new transaction in the blockchain network; the first node is any one of the nodes node;

The conversion unit 202 is configured to convert the first state of the first node to a second state when the new block obtained by the obtaining unit satisfies a preset condition, and obtain the first node in The initial credit value of the second state; the first state is any of the normal state, the good state, and the abnormal state; the second state is the normal state and the good state , any state other than the first state in the abnormal state or the malicious state; the initial credit value represents the trust level of the first node in the second state;

The determining unit 203 is configured to obtain the voting result of the new block, perform credit rewards and punishments on other nodes according to the voting result and the initial credit value obtained by the conversion unit, and determine the credit value of the other nodes; The other node is a node other than the first node among the nodes; the second node whose credit value is less than a preset threshold is determined, and the second node is deleted; the second node is the other node node.

In other embodiments, the conversion unit 202 is further configured to: when the new block satisfies that the new block is a valid block and the number of the valid blocks is greater than a first preset threshold, The first node is converted from the normal state to the good state, and the initial credit value of the first node in the good state is obtained; the valid block indicates that the new transaction has no conflict.

In other embodiments, the conversion unit 202 is further configured to satisfy the condition that the new block is an invalid block and the number of the invalid blocks is less than or equal to a second preset threshold , converting the first node from the normal state to the abnormal state and converting the first node from the good state to the abnormal state to obtain the initial state of the first node in the abnormal state Credit value; the invalid block indicates that the new transaction collided.

In other embodiments, the conversion unit 202 is further configured to: when the new block satisfies that the new block is an invalid block, and the number of the invalid blocks is greater than a second preset threshold, The first node is converted from the abnormal state to the malicious state, and the initial credit value of the first node in the malicious state is obtained; the invalid block indicates that the new transaction conflicts.

In other embodiments, the determining unit 203 is further configured to perform a credit penalty on other nodes according to the voting result and the initial credit value, and obtain the credit penalty value of the other node; obtain the credit penalty value of the other node; Credit reward value; according to the credit penalty value and the credit reward value, determine the credit value of the other nodes.

The descriptions of the above apparatus embodiments are similar to the descriptions of the above method embodiments, and have similar beneficial effects to the method embodiments. For technical details not disclosed in the apparatus embodiments of the present invention, please refer to the description of the method embodiments of the present invention to understand.

It should be noted that, in the embodiment of the present invention, if the above-mentioned DPoS consensus method for share authorization certificate is implemented in the form of a software functional module, and sold or used as an independent product, it can also be stored in a computer-readable storage medium. . Based on this understanding, the technical embodiments of the embodiments of the present invention essentially or the parts that make contributions to the prior art may be embodied in the form of software products, and the computer software products are stored in a storage medium, including a number of instructions for So that a control server (which may be a personal computer, a server, or a network server, etc.) executes all or part of the methods described in the various embodiments of the present invention. The aforementioned storage medium includes: a U disk, a removable hard disk, a read only memory (Read Only Memory, ROM), a magnetic disk, or an optical disk and other mediums that can store program codes. As such, embodiments of the present invention are not limited to any particular combination of hardware and software.

Correspondingly, an embodiment of the present invention provides an electronic device, including: a processor and a memory for storing a computer program that can be run on the processor, wherein the processor is configured to execute the above implementation when running the computer program The steps in the DPoS consensus method provided by the example of the Proof of Stake Delegation.

Correspondingly, an embodiment of the present invention provides a computer-readable storage medium on which a computer program is stored, and when the computer program is executed by a processor, implements the steps in the DPoS consensus method provided by the above-mentioned embodiment.

It should be pointed out here that the descriptions of the above embodiments of the storage medium and the server are similar to the descriptions of the above method embodiments, and have similar beneficial effects to the method embodiments. For technical details not disclosed in the embodiments of the storage medium and server of the present invention, please refer to the description of the method embodiments of the present invention for understanding.

It should be noted that FIG. 4 is a schematic diagram of a hardware entity structure of an electronic device in an embodiment of the present invention. As shown in FIG. 4 , the hardware entity of the electronic device 300 includes: a processor 301 and a memory 303 . The electronic device 300 may also include a communication interface 302 .

It is understood that the memory 303 may be a volatile memory or a non-volatile memory, and may also include both volatile and non-volatile memory. The non-volatile memory may be Read Only Memory (ROM, Read Only Memory), Programmable Read Only Memory (PROM, Programmable Read-Only Memory), Erasable Programmable Read-Only Memory (EPROM, Erasable Programmable Read-Only Memory) Only Memory), Electrically Erasable Programmable Read-Only Memory (EEPROM, Electrically Erasable Programmable Read-Only Memory), Magnetic Random Access Memory (FRAM, ferromagnetic random access memory), Flash Memory (Flash Memory), Magnetic Surface Memory , CD-ROM, or CD-ROM (Compact Disc Read-Only Memory); magnetic surface memory can be disk memory or tape memory. Volatile memory may be random access memory (RAM, Random Access Memory), which acts as an external cache memory. By way of illustration, but not limitation, many forms of RAM are available, such as Static Random Access Memory (SRAM), Synchronous Static Random Access Memory (SSRAM), Dynamic Random Access Memory Memory (DRAM, Dynamic Random Access Memory), Synchronous Dynamic Random Access Memory (SDRAM, SynchronousDynamic Random Access Memory), Double Data Rate Synchronous Dynamic Random Access Memory (DDRSDRAM, Double Data Rate Synchronous Dynamic Random Access Memory), Enhanced Synchronous Dynamic Random Access Memory (ESDRAM, Enhanced Synchronous Dynamic Random Access Memory), Synchronous Link Dynamic Random Access Memory (SLDRAM, SyncLink Dynamic Random Access Memory), Direct Memory Bus Random Access Memory (DRRAM, Direct Rambus Random Access Memory) . The memory 303 described in the embodiments of the present invention is intended to include, but not limited to, these and any other suitable types of memory.

The methods disclosed in the above embodiments of the present invention may be applied to the processor 301 or implemented by the processor 301 . The processor 301 may be an integrated circuit chip with signal processing capability. In the implementation process, each step of the above-mentioned method can be completed by an integrated logic circuit of hardware in the processor 301 or an instruction in the form of software. The above-mentioned processor 301 may be a general-purpose processor, a digital signal processor (DSP, Digital Signal Processor), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, and the like. The processor 301 may implement or execute the methods, steps, and logical block diagrams disclosed in the embodiments of the present invention. A general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the method disclosed in combination with the embodiments of the present invention can be directly embodied as being executed by a hardware decoding processor, or executed by a combination of hardware and software modules in the decoding processor. The software module may be located in a storage medium, and the storage medium is located in the memory 303, and the processor 301 reads the information in the memory 303, and completes the steps of the foregoing method in combination with its hardware.

In an exemplary embodiment, the electronic device may be implemented by one or more of Application Specific Integrated Circuit (ASIC, Application Specific Integrated Circuit), DSP, Programmable Logic Device (PLD, Programmable Logic Device), Complex Programmable Logic Device (CPLD, Complex) Programmable Logic Device), Field-Programmable Gate Array (FPGA, Field-Programmable Gate Array), general-purpose processor, controller, microcontroller (MCU, Micro Controller Unit), microprocessor (Microprocessor), or other electronic components to achieve , used to perform the aforementioned method.

In the several embodiments provided by the present invention, it should be understood that the disclosed method and apparatus may be implemented in other manners. The apparatus embodiments described above are only illustrative. For example, the division of the units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components may be combined, or Can be integrated into another observable, or some features can be ignored, or not enforced. In addition, the communication connection between the components shown or discussed may be through some interfaces, indirect coupling or communication connection of devices or units, and may be electrical, mechanical or other forms.

The unit described above as a separate component may or may not be physically separated, and the component displayed as a unit may or may not be a physical unit, that is, it may be located in one place or distributed to multiple network units; Some or all of the units may be selected according to actual needs to achieve the purpose of this embodiment.

Those of ordinary skill in the art can understand that all or part of the steps of implementing the above method embodiments can be completed by program instructions related to hardware, the aforementioned program can be stored in a computer-readable storage medium, and when the program is executed, the execution includes: The steps of the above method embodiments; and the aforementioned storage medium includes: a removable storage device, a read-only memory (ROM, Read-Only Memory), a magnetic disk or an optical disk and other media that can store program codes.

Alternatively, if the above-mentioned integrated units in the embodiments of the present invention are implemented in the form of software functional units and sold or used as independent products, they may also be stored in a computer-readable storage medium. Based on this understanding, the technical embodiments of the embodiments of the present invention essentially or the parts that make contributions to the prior art may be embodied in the form of software products, and the computer software products are stored in a storage medium, including a number of instructions for So that an electronic device (which may be a personal computer, a server, or a network device, etc.) executes all or part of the methods described in the various embodiments of the present invention. The aforementioned storage medium includes various media that can store program codes, such as a removable storage device, a ROM, a magnetic disk, or an optical disk.

The present invention is the share authorization certificate DPoS consensus method, electronic equipment, electronic equipment and storage medium recorded in the example, only the embodiment of the present invention is used as an example, but it is not limited to this, as long as the share authorization certificate DPoS consensus method, electronic equipment and storage medium are involved. Devices, electronic devices and storage media are all within the protection scope of the present invention.

It is to be understood that reference throughout the specification to "one embodiment" or "an embodiment" means that a particular feature, structure or characteristic associated with the embodiment is included in at least one embodiment of the present invention. Thus, appearances of "in one embodiment" or "in an embodiment" in various places throughout this specification are not necessarily necessarily referring to the same embodiment. Furthermore, the particular features, structures or characteristics may be combined in any suitable manner in one or more embodiments. It should be understood that, in various embodiments of the present invention, the size of the sequence numbers of the above-mentioned processes does not mean the sequence of execution, and the execution sequence of each process should be determined by its functions and internal logic, rather than the embodiments of the present invention. implementation constitutes any limitation. The above-mentioned serial numbers of the embodiments of the present invention are only for description, and do not represent the advantages or disadvantages of the embodiments.

It should be noted that, herein, the terms "comprising", "comprising" or any other variation thereof are intended to encompass non-exclusive inclusion, such that a process, method, article or device comprising a series of elements includes not only those elements, It also includes other elements not expressly listed or inherent to such a process, method, article or apparatus. Without further limitation, an element qualified by the phrase "comprising a..." does not preclude the presence of additional identical elements in a process, method, article or apparatus that includes the element.

The methods disclosed in the several method embodiments provided by the present invention can be arbitrarily combined under the condition of no conflict to obtain new method embodiments.

The features disclosed in the several product embodiments provided by the present invention can be combined arbitrarily without conflict to obtain a new product embodiment.

The features disclosed in several method or device embodiments provided by the present invention may be combined arbitrarily under the condition of no conflict to obtain new method embodiments or device embodiments.

The above are only the embodiments of the present invention, but the protection scope of the present invention is not limited to this. Any person skilled in the art who is familiar with the technical scope disclosed by the present invention can easily think of changes or substitutions. Included within the scope of protection of the present invention. Therefore, the protection scope of the present invention should be based on the protection scope of the claims.

Claims (10)

1. A share authorization attestation (DPoS) consensus method is applied to a block chain network, wherein the block chain network comprises nodes in a normal state, a good state, an abnormal state or a malicious state, and the method comprises the following steps:

acquiring a first node in the blockchain network and a new block generated by a new transaction in the blockchain network; the first node is any one of the nodes;

under the condition that the new block meets a preset condition, converting the first state of the first node into a second state, and obtaining an initial credit value of the first node in the second state; the first state is any one of the normal state, the good state and the abnormal state; the second state is any one state except the first state among the normal state, the good state, the abnormal state or the malicious state; the initial credit value characterizes a degree of trust of the first node in the second state;

obtaining a voting result of the new block, performing credit reward and punishment on other nodes according to the voting result and the initial credit value, and determining credit values of the other nodes; the other nodes are nodes except the first node in the nodes; the voting results comprise anti-votes;

determining a second node with the credit value smaller than a preset threshold value, and deleting the second node; the second node is a node of the other node;

wherein, the converting the first state of the first node into the second state when the new block satisfies a preset condition, and obtaining the initial credit value of the first node in the second state includes:

when the new block meets the condition that the new block is an invalid block and the number of the invalid blocks is less than or equal to a second preset threshold value, converting the first node from the normal state to the abnormal state and converting the first node from the good state to the abnormal state, and obtaining an initial credit value of the first node in the abnormal state; the invalid block characterizes the new transaction as conflicting.

2. The method according to claim 1, wherein said converting the first state of the first node into the second state in case that the new block satisfies a preset condition, and obtaining the initial credit value of the first node in the second state comprises:

when the new block meets the condition that the new block is an effective block and the number of the effective blocks is greater than a first preset threshold value, converting the normal state of the first node into the good state, and obtaining an initial credit value of the first node in the good state; the valid block characterizes the new transaction as not creating a conflict.

3. The method according to claim 1, wherein said converting the first state of the first node into the second state in case that the new block satisfies a preset condition, and obtaining the initial credit value of the first node in the second state comprises:

when the new block meets the condition that the new block is an invalid block and the number of the invalid blocks is greater than a second preset threshold value, converting the abnormal state of the first node into the malicious state, and obtaining an initial credit value of the first node in the malicious state; the invalid block characterizes the new transaction as conflicting.

4. The method of any one of claims 1-3, wherein performing credit penalties on other nodes according to the voting results and the initial credit values, and determining the credit values of the other nodes comprises:

performing credit punishment on other nodes according to the voting result and the initial credit value to obtain credit punishment values of the other nodes;

obtaining credit reward values for the other nodes;

and determining the credit value of the other node according to the credit punishment value and the credit reward value.

5. A device for certification of authority (DPoS) consensus of shares, applied to a blockchain network including nodes exhibiting a normal state, a good state, an abnormal state, or a malicious state, the device comprising: an obtaining unit, a converting unit and a determining unit, wherein:

the obtaining unit is configured to obtain a first node in the blockchain network and a new block generated by a new transaction occurring in the blockchain network; the first node is any one of the nodes;

the conversion unit is configured to convert the first state of the first node into a second state when the new block obtained by the obtaining unit meets a preset condition, and obtain an initial credit value of the first node in the second state; the first state is any one of the normal state, the good state and the abnormal state; the second state is any one state except the first state among the normal state, the good state, the abnormal state or the malicious state; the initial credit value characterizes a degree of trust of the first node in the second state;

the determining unit is configured to obtain a voting result of the new block, perform credit reward and punishment on other nodes according to the voting result and the initial credit value obtained by the converting unit, and determine credit values of the other nodes; the other nodes are nodes except the first node in the nodes; the voting results comprise anti-votes; determining a second node with the credit value smaller than a preset threshold value, and deleting the second node; the second node is a node of the other node;

the conversion unit is further configured to, when the new block satisfies that the new block is an invalid block and the number of the invalid blocks is less than or equal to a second preset threshold, convert the first node from the normal state to the abnormal state and convert the first node from the good state to the abnormal state, and obtain an initial credit value of the first node in the abnormal state; the invalid block characterizes the new transaction as conflicting.

6. The apparatus of claim 5, wherein the converting unit is further configured to convert the first node from the normal state to the good state to obtain an initial credit value of the first node in the good state if the new block satisfies that the new block is a valid block and the number of valid blocks is greater than a first preset threshold; the valid block characterizes the new transaction as not creating a conflict.

7. The apparatus according to claim 5, wherein the converting unit is further configured to, if the new block satisfies that the new block is an invalid block and the number of the invalid blocks is greater than a second preset threshold, convert the first node from the abnormal state to the malicious state, and obtain an initial credit value of the first node in the malicious state; the invalid block characterizes the new transaction as conflicting.

8. The apparatus according to any one of claims 5 to 7, wherein the determining unit is further configured to perform credit penalty on the other node according to the voting result and the initial credit value, and obtain a credit penalty value of the other node; obtaining credit reward values for the other nodes; and determining the credit value of the other node according to the credit punishment value and the credit reward value.

9. An electronic device, comprising: a processor and a memory for storing a computer program capable of running on the processor,

wherein the processor is adapted to perform the steps of the method of any one of claims 1 to 4 when running the computer program.

10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 4.

Images