Consensus optimization method for delegation rights and interests proof based on dynamic reputation evaluation

Abstract

The invention provides a consensus optimization method for delegation rights and interests proof based on dynamic reputation evaluation, and relates to the technical field of blockchains, and the method comprises the steps: obtaining an initial reputation value based on a blockchain node; based on the initial reputation value, analyzing the block chain nodes to obtain a block-out node set and a candidate node set; generating block information by using the block-out node set, and sending a whole-network broadcast message based on the block information; based on the whole network broadcast message, verifying the block information by using the candidate node set to obtain a verification result; and based on the verification result, updating the node comprehensive reputation value to obtain a consensus optimization result of the delegation right and interest proof, and completing optimization of the consensus of the delegation right and interest proof. According to the method, the problems that in a traditional DPoS (Deleted Proof-of-Station) consensus mechanism, the centralization trend of a high-right node is aggravated, a low-right node cannot enter a committee, so that the enthusiasm is contextual, and malicious nodes cannot be removed in time are solved.

Description

Technical Field

[0001] The present invention relates to the field of blockchain technology, and in particular to a method for optimizing a consensus of delegated proof of stake based on dynamic reputation evaluation. Background Art

[0002] Blockchain is a decentralized ledger system based on a distributed network, which ensures the security and transparency of data through encryption and consensus mechanisms. The basic technologies of blockchain usually include data blocks, hash functions, consensus mechanisms, etc. The data block of each block contains a timestamp, transaction data, the hash value of the previous block and its own hash value. The hash function is the unique identifier of each block, and the consensus mechanism is an algorithm to ensure the consistency of data in the distributed network. Currently, the commonly used consensus mechanisms include Proof of Work (PoW), Proof of Stake (PoS), Delegated Proof of Stake (DPoS), etc.

[0003] The DPoS consensus algorithm allows each coin holder to obtain corresponding voting rights according to the number of tokens he owns. The top N nodes with the highest number of votes are selected as witness nodes in the committee. Through the form of a committee, the block generation time is shortened and the transaction processing efficiency is improved. The elected representatives in DPoS are called block producers (bp). bp is responsible for verifying transactions, generating blocks, verifying blocks, etc. The number of bp in DPoS is different in different projects, for example, it is 101 in Bitshares, 51 in Asch, and 21 in EOS. N bps will take turns to produce blocks, and the whole process is supervised by the remaining N-1 bps. When the block produced by the current bp[i] is verified by (2 / 3N+1) bps, the current bp[i] can obtain the block generation reward and the block can be put on the chain. A round of consensus is not considered to be over until all N bps have completed the generation of blocks. Next, bps are re-elected and the above consensus operations are repeated. In the DPoS committee, only high-stakes nodes have the right to produce blocks, which makes it impossible to remove malicious nodes from the committee, aggravates the centralization of the system, and frustrates the consensus enthusiasm of low-stakes honest nodes. Summary of the invention

[0004] In view of the above-mentioned deficiencies in the prior art, the present invention provides a delegated proof-of-stake consensus optimization method based on dynamic reputation evaluation, which solves the problems existing in the traditional DPoS (Delegated Proof-of-Stake) consensus mechanism in the decentralized ledger system, namely, the centralization trend of high-stake nodes is aggravated, the enthusiasm of low-stake nodes is frustrated due to the inability to enter the committee, and malicious nodes cannot be removed in time.

[0005] In order to achieve the above-mentioned invention object, the technical solution adopted by the present invention is: a method for optimizing the consensus of delegated proof of stake based on dynamic reputation evaluation, comprising:

[0006] S1: Obtain the initial reputation value based on the blockchain node in the decentralized ledger system;

[0007] S2: Based on the initial reputation value, the blockchain node is analyzed to obtain a block-producing node set and a candidate node set;

[0008] S3: Generate block information using the block-producing node set, and send a network-wide broadcast message based on the block information;

[0009] S4: Based on the network-wide broadcast message, the block information is verified using the candidate node set to obtain a verification result;

[0010] S5: Based on the verification result, the node comprehensive reputation value is updated to obtain the optimization result of the delegated proof of stake consensus, thereby completing the optimization of the delegated proof of stake consensus.

[0011] Further, the S1 includes:

[0012] Based on the blockchain nodes and Gossip distribution in the decentralized ledger system, the performance of each blockchain node is initially set to obtain the initial reputation value:

[0013] RM0(u)=∑ i w i *X i ;

[0014]

[0015] Among them, RM0(u) represents the initial reputation value of node u, w i Indicates the corresponding indicator weight, X i represents the performance normalization index, X′ i represents the normalized index of delay and packet loss rate, X max Indicates the maximum value of the indicator parameter, X min Indicates the minimum value of the indicator parameter.

[0016] Further, the S1 includes:

[0017] Based on the blockchain node and Gossip distribution, the performance of each blockchain node is initially set to obtain the initial reputation value:

[0018] RM0(u)=∑ i w i *X i ;

[0019]

[0020] Among them, RM0(u) represents the initial reputation value of node u, w i Indicates the corresponding indicator weight, X i represents the performance normalization index, X′ i represents the normalized index of delay and packet loss rate, X max Indicates the maximum value of the indicator parameter, X min Indicates the minimum value of the indicator parameter.

[0021] Furthermore, the expression of the voting weight is:

[0022]

[0023] Among them, RV i (u) represents the voting reputation value of node u in the i-th round of consensus, coin i (u) represents the number of tokens staked by node u in the i-th round of consensus, α represents the influence parameter of the equity value, It represents the comprehensive reputation value of the consensus node u in the previous round, and β represents the influence parameter of the reputation value on the voting weight.

[0024] Further, the S3 includes:

[0025] Based on the block proposal put forward by the block producing node set, the transaction information and block data are verified to obtain a transaction structure;

[0026] Based on the transaction structure, obtain the hash value of the previous block;

[0027] Generate block information using the hash value of the previous block and the private key of the current block-producing node;

[0028] Based on the block information, a network-wide broadcast message is issued; wherein the network-wide broadcast message includes the hash value of the previous block, the block information and the current block header signature:

[0029] H pre =Hash(PreBlockInfo);

[0030] MSG M = {BlockInfo, W sign};

[0031] W sign =Sign(BlockInfo,W sk );

[0032] Among them, H preIndicates the hash value of the previous block, Hash indicates the hash function, PreBlockInfo indicates the previous block information, MSG M Indicates the broadcast message of the whole network, W sign Indicates block information, Sign indicates the header signature, BlockInfo indicates the current block node, and W sk Indicates the private key of the previous block producer.

[0033] Further, the S3 includes:

[0034] Based on the block proposal put forward by the block producing node set, the transaction information and block data are verified to obtain a transaction structure;

[0035] Based on the transaction structure, obtain the hash value of the previous block;

[0036] Generate block information using the hash value of the previous block and the private key of the current block-producing node;

[0037] Based on the block information, a network-wide broadcast message is issued; wherein the network-wide broadcast message includes the hash value of the previous block, the block information and the current block header signature:

[0038] H pre =Hash(PreBlockInfo);

[0039] MSG M = {BlockInfo, W sign};

[0040] W sign =Sign(BlockInfo,W sk );

[0041] Among them, H pre Indicates the hash value of the previous block, Hash indicates the hash function, PreBlockInfo indicates the previous block information, MSG M Indicates the broadcast message of the whole network, W sign Indicates block information, Sign indicates the header signature, BlockInfo indicates the current block node, and W sk Indicates the private key of the previous block producer.

[0042] Further, the S5 includes:

[0043] Based on the verification result, the verification reputation value and the malicious penalty value of the corresponding node are obtained by calculation;

[0044] Based on the verification reputation value and the evil penalty value, the comprehensive reputation value of the node is updated, the optimization result of the delegated proof of stake consensus is obtained, and the optimization of the delegated proof of stake consensus is completed.

[0045] Furthermore, the expression of the delegated proof of stake consensus optimization result is:

[0046] R i (u)=RM0+RV i (u)+RT i (u)-RE i (u);

[0047]

[0048] Q r =a(e br -1)+cr 2 ;

[0049] Among them, R i (u) represents the optimization result of the delegated proof of stake consensus, RM0 represents the initial reputation value, RV i (u) represents the voting reputation value of node u in the i-th round of consensus, RT i (u) represents the verification reputation value of node u in the i-th round of consensus, RE i (u) represents the penalty value for node u in the i-th round of consensus, V i (u) represents the number of times node u verifies correctly in the i-th round of consensus, V correct (u) represents the verification accuracy rate of node u in the i-th round of consensus, V total (u) represents the total number of verifications, E represents the number of malicious types, and M r The maximum number of malicious behaviors that the system can tolerate for malicious behavior type r, m r Indicates the current tolerance number, Q r The penalty factor r represents the node malicious type. In the formula, it reflects the severity of the malicious behavior in the form of an independent variable. a represents the system's sensitivity to malicious behavior, b represents the degree of difference in punishment for malicious behaviors of different degrees, and c represents the nonlinear growth parameter for adjusting the penalty.

[0050] The beneficial effects of the present invention are as follows: a delegated proof of stake consensus optimization method based on dynamic reputation evaluation is proposed. (1) By setting an initial reputation model, the authenticity of the DPoS consensus system is realized; (2) By setting a bufferable penalty model, malicious nodes in the committee are promptly removed, effectively ensuring the security of the DPoS consensus system; (3) By using the voting reputation model as a new committee election mechanism and combining it with the verification reputation model to give honest nodes more opportunities to enter the committee, the fairness of the system is guaranteed and the activity of the system consensus is improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0051] This specification will be further described in the form of exemplary embodiments, which will be described in detail by the accompanying drawings. These embodiments are not restrictive, and in these embodiments, the same number represents the same structure, wherein:

[0052] Figure 1 This is an exemplary flow chart of a delegated proof-of-stake consensus optimization method based on dynamic reputation evaluation according to some embodiments of this specification. DETAILED DESCRIPTION

[0053] The specific implementation modes of the present invention are described below so that those skilled in the art can understand the present invention. However, it should be clear that the present invention is not limited to the scope of the specific implementation modes. For those of ordinary skill in the art, as long as various changes are within the spirit and scope of the present invention as defined and determined by the attached claims, these changes are obvious, and all inventions and creations utilizing the concept of the present invention are protected.

[0054] Example

[0055] Figure 1 This is an exemplary flow chart of a method for optimizing a consensus of delegated proof of stake based on dynamic reputation evaluation according to some embodiments of this specification. Figure 1 As shown, the process includes the following steps. In some embodiments, the process can be executed by a processor.

[0056] S1: Obtain the initial reputation value based on the blockchain node in the decentralized ledger system.

[0057] The initial reputation value is the reputation value of the blockchain node before the delegated proof of stake consensus is reached.

[0058] In some embodiments, the processor may use a reputation manager to calculate an initial reputation value based on node performance indicators. For example, the processor may use a reputation manager to adopt a Gossip distribution, set the performance of each node, initialize the node pool to conform to the actual data distribution, and select malicious nodes from the node group at each performance stage.

[0059] In this way, all nodes can be assigned different initial reputation values ​​according to the differences in initial configuration conditions, thereby reflecting the authenticity and reliability of the system.

[0060] In some embodiments, the processor may implement S1 based on the following steps: based on the blockchain nodes and Gossip distribution in the decentralized ledger system, initially set the performance of each blockchain node to obtain an initial reputation value.

[0061] In some embodiments, the expression of the initial reputation value may be:

[0062] RM0(u)=∑ i w i *X i ;

[0063]

[0064] Among them, RM0(u) represents the initial reputation value of node u, w i Indicates the corresponding indicator weight, X i represents the performance normalization index, X′ i represents the normalized index of delay and packet loss rate, X max Indicates the maximum value of the indicator parameter, X min Indicates the minimum value of the indicator parameter.

[0065] In some embodiments, the relationship between node indicators and their weights is shown in Table 1.

[0066] Table 1 Node indicators and weights

[0067]

[0068]

[0069] S2: Based on the initial reputation value, the blockchain nodes are analyzed to obtain a block-producing node set and a candidate node set.

[0070] The block-producing node set is the node set used to send broadcast messages to the outside world.

[0071] The candidate node set is the node set used to verify the broadcast message.

[0072] In some embodiments, the processor can use the node manager to traverse all nodes in the node pool, sort the nodes according to their initial reputation values, select the top N nodes as the consensus node set, and then the reputation manager can sort the nodes according to the coin holdings of each node. i (u) and the comprehensive reputation value R of the previous round i-1 (u) to calculate the voting weight RV i (u), the consensus nodes vote to select the top MineMinVoteNum nodes as the block-producing node set, and the remaining N-MineMinVoteNum nodes as the candidate node set.

[0073] In some embodiments, the processor can implement S2 based on the following steps: based on the initial reputation value, sort the blockchain nodes, and use the first N blockchain nodes as the consensus node set; based on the token holdings of each node in the consensus node set and the comprehensive reputation value of the previous round, calculate the voting weight of each consensus node to obtain voting ranking information; based on the voting ranking information, select the first MineMinVoteNum as the block-producing node set, and the remaining N-MineMinVoteNum as the candidate node set.

[0074] The consensus node set is the set of blockchain nodes whose initial reputation value is higher than the threshold.

[0075] Voting weight is the weight data that reflects the historical reputation information of the consensus node.

[0076] In some embodiments, the expression of voting weight may be:

[0077]

[0078] Among them, RV i (u) represents the voting reputation value of node u in the i-th round of consensus, coin i (u) represents the number of tokens staked by node u in the i-th round of consensus, α represents the influence parameter of the equity value, It represents the comprehensive reputation value of the consensus node u in the previous round, and β represents the influence parameter of the reputation value on the voting weight.

[0079] Voting ranking information is information that sorts consensus nodes from high to low according to voting weight.

[0080] In some embodiments, the expression of the voting equity reward obtained by the node can be:

[0081]

[0082] T i (u) = t i (u)-T i ;

[0083] Among them, E i (u) represents the voting rights reward obtained by node u in round i, C i (u) indicates whether the node voted by consensus node u in this round has successfully entered the block node set, T i (u) represents the voting time t of node u in round i i (u) Whether it is within the specified time T i Completed within E itotal Indicates all the coins in the prize pool, coin i (u) represents the coins pledged during voting.

[0084] S3: Generate block information using the block-producing node set, and send a network-wide broadcast message based on the block information.

[0085] Block information is information that reflects the original content of the block.

[0086] The whole network broadcast message is a message that sends the block-related information of the current node to the outside through the network. For example, the whole network broadcast message may include the hash value of the previous block, block information, and the current block header signature.

[0087] In some embodiments, the processor can implement S3 based on the following steps: based on the block proposal put forward by the set of block-producing nodes, verify the transaction information and block data to obtain a transaction structure; based on the transaction structure, obtain the hash value of the previous block; use the hash value of the previous block and the private key of the current block-producing node to generate block information; based on the block information, send a network-wide broadcast message.

[0088] The transaction structure is a structure that reflects the content generated before and after the transaction. For example, the transaction structure may include a transaction ID, Inputs, and Outputs, where Inputs include the hash value TxID of the previous transaction, the sender's signature Signature and public key PubKey, and Outputs include the script public key hash ScriptPubKey containing the receiver.

[0089] In some embodiments, the processor may return the Outputs in the transaction structure to the controller as a verification transaction result.

[0090] In some embodiments, the expression of the network-wide broadcast message may be:

[0091] H pre =Hash(PreBlockInfo);

[0092] MSG M = {BlockInfo, W sign};

[0093] W sign =Sign(BlockInfo,W sk );

[0094] Among them, H pre Indicates the hash value of the previous block, Hash indicates the hash function, PreBlockInfo indicates the previous block information, MSG M Indicates the broadcast message of the whole network, W sign Indicates block information, Sign indicates the header signature, BlockInfo indicates the current block node, and Wsk Indicates the private key of the previous block producer.

[0095] S4: Based on the network-wide broadcast message, the block information is verified using the candidate node set to obtain a verification result.

[0096] The verification result reflects whether the signature of the node in the network-wide broadcast message is valid and the node's participation in the verification.

[0097] In some embodiments, the processor can implement S4 based on the following steps: based on the hash value of the previous block, compare and verify with the hash value of the last block on the current chain to obtain a broadcast information verification result; when the broadcast information verification result is data consistency, use the public key of the miner node to decrypt the extracted current block header signature to obtain a signature decryption result; compare the signature decryption result with the original data in the block-producing node set to obtain a verification result.

[0098] The broadcast information verification result is the verification result of whether the hash value of the previous block in the block-producing node is consistent with the hash value of the last block on the current chain.

[0099] In some embodiments, the processor may verify that the hash value of the previous block in the block-producing node is consistent with the hash value of the last block on the current chain.

[0100] The signature decryption result is the decrypted signature of the current block header of the block producing node.

[0101] In some embodiments, the processor may use the candidate node set as a verification node and use the public key of the miner node to extract the digital signature W sign Decrypt and decrypt the result H ’ Compare it with the hash value H of the original data calculated by the same hash algorithm. ’ =H, the signature is valid, otherwise the signature is invalid. Finally, the block verification result is returned to the blockchain manager.

[0102] S5: Based on the verification result, the node comprehensive reputation value is updated to obtain the optimization result of the delegated proof of stake consensus, thereby completing the optimization of the delegated proof of stake consensus.

[0103] The optimization result of the delegated proof-of-stake consensus reflects the optimization result of the comprehensive reputation value of the node.

[0104] In some embodiments, the processor can update the reputation value of the node in real time during the entire consensus process according to the reward and punishment mechanism, so as to encourage non-high-equity nodes to actively participate in the consensus and enter the committee, thereby achieving decentralization of the system's high-equity nodes while ensuring system fairness and increasing system consensus activity.

[0105] In some embodiments, the processor may implement S5 based on the following steps: Based on the verification result, through calculation, obtain the verification reputation value and the malicious punishment value of the corresponding node; Based on the verification reputation value and the malicious punishment value, update the comprehensive reputation value of the node to obtain the optimized result of the proof of stake consensus, and complete the optimization of the proof of stake consensus.

[0106] The verification reputation value is a value that reflects the enthusiasm of the node to participate in verification.

[0107] The malicious punishment value is a numerical value that reflects the malicious behavior of the node.

[0108] In some embodiments, the processor may analyze the malicious behavior of the node based on the node malicious evaluation table to obtain the malicious punishment value; wherein, the node malicious evaluation table is shown in Table 2.

[0109] Table 2 Node Malicious Evaluation Table

[0110]

[0111] In some embodiments, as shown in Table 2, the size of the punishment factor is: Qr = 1 < Qr = 2 < Qr = 3 < Qr = 4, and the corresponding tolerance times are opposite: Mr = 1 > Mr = 2 > Mr = 3 > Mr = 4, m r represents the actual number of malicious acts corresponding to the malicious type r of the node, M r represents the maximum number of malicious acts that the system can tolerate for the malicious type r. The larger r is, the larger the corresponding malicious punishment factor Q r is. Mathematically, as the independent variable increases, its function value increases, that is, the punishment value increases. When the maximum tolerance times are exceeded, the reputation value of the node will be reset to zero.

[0112] In some embodiments, the expression of the optimized result of the proof of stake consensus can be:

[0113] R i (u) = RM0 + RV i (u) + RT i (u) - RE i (u);

[0114]

[0115] Q r = a(e br - 1) + cr 2 ;

[0116] Among them, R i (u) represents the optimized result of the proof of stake consensus, RM0 represents the initial reputation value, RV i(u) represents the voting reputation value of node u in the i-th round of consensus, RT i (u) represents the verification reputation value of node u in the i-th round of consensus, RE i (u) represents the penalty value for node u in the i-th round of consensus, V i (u) represents the number of times node u verifies correctly in the i-th round of consensus, V oorrect (u) represents the verification accuracy rate of node u in the i-th round of consensus, V total (u) represents the total number of verifications, E represents the number of malicious types, and M r The maximum number of malicious behaviors that the system can tolerate for malicious behavior type r, m r Indicates the current tolerance number, Q r The penalty factor r represents the node malicious type. In the formula, it reflects the severity of the malicious behavior in the form of an independent variable. a represents the system's sensitivity to malicious behavior, b represents the degree of difference in punishment for malicious behaviors of different degrees, and c represents the nonlinear growth parameter for adjusting the penalty.

[0117] In some embodiments, the processor can analyze the voting reputation value of the node based on the voting equity reward, and use the voting equity reward to reward the nodes that actively participate in the voting and whose voting objects enter the committee with token value, so that the node has a greater advantage in the optimization results of the delegated equity proof consensus, and obtain the voting reputation value of each node in each round of consensus.

[0118] In some embodiments of this specification, a delegated proof of stake consensus optimization method based on dynamic reputation evaluation is proposed to solve the problems of the aggravated centralization trend of high-stakes nodes, the inability of low-stakes nodes to enter the committee, resulting in the frustration of enthusiasm, and the inability to remove malicious nodes in a timely manner in the DPoS consensus mechanism in a decentralized ledger system. (1) By setting an initial reputation model, the authenticity of the DPoS consensus system is achieved; (2) By setting a bufferable penalty model, malicious nodes in the committee are removed in a timely manner, effectively ensuring the security of the DPoS consensus system; (3) By using the voting reputation model as a new committee election mechanism, and combining the verification reputation model to give honest nodes more opportunities to enter the committee, the fairness of the system is guaranteed and the system consensus activity is improved.

Claims

1. A delegated proof of stake consensus optimization method based on dynamic reputation evaluation, characterized in that: include: S1: Obtain the initial reputation value based on the blockchain node in the decentralized ledger system; S2: Based on the initial reputation value, the blockchain node is analyzed to obtain a block-producing node set and a candidate node set; S3: Generate block information using the block-producing node set, and send a network-wide broadcast message based on the block information; S4: Based on the network-wide broadcast message, the block information is verified using the candidate node set to obtain a verification result; S5: Based on the verification result, the node comprehensive reputation value is updated to obtain the optimization result of the delegated proof of stake consensus, thereby completing the optimization of the delegated proof of stake consensus.

2. The method for optimizing the consensus of delegated proof of stake based on dynamic reputation evaluation according to claim 1, characterized in that: The S1 includes: Based on the blockchain nodes and Gossip distribution in the decentralized ledger system, the performance of each blockchain node is initially set to obtain the initial reputation value: RM0(u)=∑ i w i *X i ; Among them, RM0(u) represents the initial reputation value of node u, w i Indicates the corresponding indicator weight, X i represents the performance normalization index, X′ i represents the normalized index of delay and packet loss rate, X max Indicates the maximum value of the indicator parameter, X min Indicates the minimum value of the indicator parameter.

3. The method for optimizing the consensus of delegated proof of stake based on dynamic reputation evaluation according to claim 1, characterized in that: The S2 includes: Based on the initial reputation value, the blockchain nodes are sorted, and the first N blockchain nodes are used as a consensus node set; Based on the token holdings of each node in the consensus node set and the comprehensive reputation value of the previous round, the voting weight of each consensus node is calculated to obtain the voting ranking information; Based on the voting ranking information, the first MineMinVoteNum nodes are selected as the block-producing node set, and the remaining N-MineMinVoteNum nodes are selected as the candidate node set.

4. The method for optimizing the consensus of delegated proof of stake based on dynamic reputation evaluation according to claim 3 is characterized in that: The expression of the voting weight is: Among them, RV i (u) represents the voting reputation value of node u in the i-th round of consensus, coin i (u) represents the number of tokens staked by node u in the i-th round of consensus, α represents the influence parameter of the equity value, It represents the comprehensive reputation value of the consensus node u in the previous round, and β represents the influence parameter of the reputation value on the voting weight.

5. The method for optimizing the consensus of delegated proof of stake based on dynamic reputation evaluation according to claim 1, characterized in that: The S3 includes: Based on the block proposal put forward by the block producing node set, the transaction information and block data are verified to obtain a transaction structure; Based on the transaction structure, obtain the hash value of the previous block; Generate block information using the hash value of the previous block and the private key of the current block-producing node; Based on the block information, a network-wide broadcast message is issued; wherein the network-wide broadcast message includes the hash value of the previous block, the block information and the current block header signature: H pre =Hash(PreBlockInfo); MSG M ={BlockInfo,W sign }; W sign =Sign(BlockInfo,W sk ); Among them, H pre Indicates the hash value of the previous block, Hash indicates the hash function, PreBlockInfo indicates the previous block information, MSG M Indicates the broadcast message of the whole network, W sign Indicates block information, Sign indicates the header signature, BlockInfo indicates the current block node, and W sk Indicates the private key of the previous block producer.

6. The method for optimizing the consensus of delegated proof of stake based on dynamic reputation evaluation according to claim 5, characterized in that: The S4 includes: Based on the hash value of the previous block, the hash value of the last block on the current chain is compared and verified to obtain the broadcast information verification result; When the broadcast information verification result is consistent with the data, the public key of the miner node is used to decrypt the extracted current block header signature to obtain the signature decryption result; The signature decryption result is compared with the original data in the block-producing node set to obtain a verification result.

7. The method for optimizing the consensus of delegated proof of stake based on dynamic reputation evaluation according to claim 1, characterized in that: The S5 includes: Based on the verification result, the verification reputation value and the malicious penalty value of the corresponding node are obtained by calculation; Based on the verification reputation value and the evil penalty value, the comprehensive reputation value of the node is updated, the optimization result of the delegated proof of stake consensus is obtained, and the optimization of the delegated proof of stake consensus is completed.

8. The method for optimizing the consensus of delegated proof of stake based on dynamic reputation evaluation according to claim 7 is characterized in that: The expression of the delegated proof of stake consensus optimization result is: R i (u)=RM0+RV i (in)+RT i (in)-RE i (in); Q r =a(e br -1)+cr 2 ; Among them, R i (u) represents the optimization result of the delegated proof of stake consensus, RM0 represents the initial reputation value, RV i (u) represents the voting reputation value of node u in the i-th round of consensus, RT i (u) represents the verification reputation value of node u in the i-th round of consensus, RE i (u) represents the penalty value for node u in the i-th round of consensus, V i (u) represents the number of times node u verifies correctly in the i-th round of consensus, V correct (u) represents the verification accuracy rate of node u in the i-th round of consensus, V total (u) represents the total number of verifications, E represents the number of malicious types, and M r The maximum number of malicious behaviors that the system can tolerate for malicious behavior type r, m r Indicates the current tolerance number, Q r represents the penalty factor, r represents the node malicious type, and in the formula, it reflects the severity of the malicious behavior in the form of an independent variable. a represents the system's sensitivity to malicious behavior, b represents the degree of difference in punishment for malicious behaviors of different degrees, and c represents the nonlinear growth parameter for adjusting the penalty.

Images