Block chain fragmentation method combining node contribution mechanism and two-round consensus

Abstract

The invention discloses a block chain fragmentation method combining a node contribution mechanism and two rounds of consensus. The method comprises the following steps: completing block chain node initialization and random fragmentation by using a verifiable random function based on an elliptic curve algorithm; constructing a multi-dimensional dynamic contribution value model based on discretization calculation, comprehensively considering the voting consistency, the historical contribution mean value and the identity additional score of the node in the current round, and selecting a leading node according to the voting consistency, the historical contribution mean value and the identity additional score; executing a two-round consensus protocol; and respectively triggering a dynamic replacement mechanism aiming at the malicious leader node or the malicious fragment by comparing the pre-committed consistency with the effective signature number of the block head. Through hierarchical consensus and dynamic excitation, local malicious nodes are tolerated, cross-fragment communication overhead is effectively reduced, and transaction throughput and security of a block chain system are improved.

Description

Technical Field

[0001] This invention relates to the field of blockchain, and in particular to a blockchain sharding method that combines a node contribution mechanism and a two-round consensus. Background Technology

[0002] Blockchain is a decentralized ledger technology based on distributed networks, cryptographic principles, and consensus mechanisms. Its core features include data immutability, transaction traceability, and high system fault tolerance.

[0003] The classic blockchain workflow begins with a user initiating a transaction, such as a transfer or contract call. The transaction is generated through a wallet and digitally signed to ensure its authenticity. The transaction is then broadcast to the P2P network, where nodes verify its validity. Valid transactions are stored in a mempool. Verifiers or consensus nodes select transactions from the mempool, package them into a new block, and reach an agreement through the consensus mechanism. The successfully generated block is broadcast to the entire network, verified by nodes, and appended to the chain to update the global state. Finally, multiple confirmations ensure that the transaction is irreversible, achieving ledger synchronization and finality.

[0004] A significant drawback of blockchain is its low transaction processing efficiency, primarily due to design limitations in its consensus mechanism. Mechanisms such as Proof-of-Work require nodes to reach consensus through competitive computation or multiple rounds of voting, resulting in high transaction confirmation latency and low throughput, making it unsuitable for scenarios with massive concurrent transactions. To address this bottleneck, researchers have proposed optimizing the consensus mechanism or introducing sharding technology. This involves dividing the network into subsets for parallel processing and coordinating the global state through cross-sharding protocols, thereby significantly improving system scalability.

[0005] To address the efficiency and security bottlenecks in blockchain sharding, existing sharding schemes still face challenges in terms of the fairness and efficiency of leader election, as well as the communication overhead and centralization risks of the meta-consensus architecture. Summary of the Invention

[0006] To address the aforementioned technical problems, this invention provides a highly efficient and robust blockchain sharding method that combines a node contribution mechanism with two-round consensus.

[0007] The technical solution of this invention to solve the above-mentioned technical problems is: a blockchain sharding method combining a node contribution mechanism and a two-round consensus, comprising the following steps:

[0008] Step 1: Use a verifiable random function based on elliptic curve algorithm to complete the initialization of blockchain nodes and random sharding;

[0009] Step 2: Construct a multi-dimensional dynamic contribution value model based on discretization calculation, which comprehensively considers the voting consistency of nodes in the current round, the average historical contribution, and the identity bonus points, in order to select leader nodes;

[0010] Step 3: Execute the two-round consensus protocol. In the first round, the transaction voting and statistics are carried out in parallel within the shard, and the leader node of the shard generates a pre-commitment to fix the composition of the member nodes within the shard. In the second round, the leadership committee performs global verification and confirmation on the block header containing the signature set submitted by the shard.

[0011] Step 4: By comparing the consistency of the pre-commitment with the number of valid signatures in the block header, a dynamic replacement mechanism is triggered for malicious leader nodes or malicious shards, respectively.

[0012] The blockchain sharding method described above, which combines a node contribution mechanism and a two-round consensus, involves the following specific steps in step one: First, based on the elliptic curve algorithm, a public key is generated for each node. and private key The public key From private key The identifier is calculated based on the base point and serves as the node's identity; then, it is determined based on a verifiable random function and the number of shards. public and private key pairs of nodes Current consensus round And the random value of this round The shard address to which a node belongs is used as an input parameter.

[0013] The aforementioned blockchain sharding method, which combines a node contribution mechanism and a two-round consensus, in step two, for any node... In a certain round, it needs to be handled One transaction, using Represents a node The voting in this round of transactions, , Represents a node For the Voting on the transaction A value of +1 indicates approval. A value of -1 indicates opposition. A value of 0 indicates silence;

[0014] A node's contribution value is closely related to the accuracy of its votes, defined as follows: This represents the final consensus result vector determined based on the majority rule within each shard. , For the first segment The option that receives the most votes in a transaction makes a node's contribution value highly positively correlated with the similarity between its voting and the final consensus result;

[0015] The node with the largest contribution value is selected as the temporary leader node. When the contribution value of a node exceeds that of the current leader node, or when the current leader node is identified as a malicious node, the leader node replacement mechanism is activated.

[0016] The above-described blockchain sharding method, which combines a node contribution mechanism and a two-round consensus, includes step two where the node... Contribution value The calculation formula is as follows:

[0017]

[0018] in, It is an adjustable weighting parameter. Represents a node In the Contribution value of each round Represents a node in the past The average contribution value of each round, For nodes in the past Total contribution value across all rounds Represents a node In the Contribution value of each round This is an auxiliary function used to determine the consistency between node voting and the consensus result. Its expression is as follows:

[0019]

[0020] in, This indicates that the two are not equal.

[0021] For nodes The identity-based bonus is used to provide additional incentives based on the node's identity, and the expression is as follows:

[0022]

[0023] in, As a leadership node, and All of these are adjustable weight parameters.

[0024] The aforementioned blockchain sharding method, which combines a node contribution mechanism and a two-round consensus, involves, in step three, the blockchain network... Each node Each of the 1000 fragments contains 100 fragments. 1 node A leader node is elected in each shard. Within a shard, all nodes except the leader node are member nodes, and the leader nodes of all shards together form the leadership committee. The two-round consensus protocol specifically includes: a first round of intra-segment consensus involving all nodes within each segment, and a second round of global consensus involving the leadership committee.

[0025] The blockchain sharding method described above, which combines a node contribution mechanism and a two-round consensus, involves the following process in step three: the intra-shard consensus formed by all nodes in each shard.

[0026] first, Receive pending transactions belonging to this fragment and package them into a transaction list. ,Will Broadcast to member nodes to initiate the consensus process;

[0027] Then, each member node verifies independently. For each transaction in the process, a voting vector containing "for," "against," or "silent" opinions is generated, and the voting vector is sent to... ;

[0028] then, Collect the voting vectors of all member nodes to form a voting set. , Traversal For each transaction, the number of votes in favor, against, and silent votes are counted separately. All transactions are tallied, and the voting results for each transaction are included in the transaction resolution table. ;

[0029] at last, Will and Broadcast within the shard, member nodes within the shard verify. To verify the accuracy of the statistical data, please reply with a confirmation message after confirming that it is correct. to ; fragmented Consensus was reached after receiving confirmation messages from more than half of the member nodes.

[0030] In the blockchain sharding method described above, which combines a node contribution mechanism and a two-round consensus, step three involves forming a public key list during the pre-commitment generation process of the sharding leader node. , ,in For the first The first fragment in the... Round number The first public key is used to generate the second public key. The first fragment in the... Pre-commitment for each round , , For the hash function, the leader node of the shard will Broadcast within segments to reach a consensus, and... Used for subsequent node replacement verification.

[0031] The aforementioned blockchain sharding method, which combines a node contribution mechanism and a two-round consensus, includes, in step three, a leadership committee composed of leading nodes. The monitoring consensus process consists of three phases: the pre-preparation phase, the preparation phase, and the submission phase.

[0032] The specific process of the preparatory stage is as follows: Each shard's leader node To the Leadership Committee Submit candidate blocks for this round and pre-commitment At the same time, broadcast the list of public keys to the member nodes within the shard. and Leadership Committee Check candidate block headers The content, whether each transaction has more than Valid votes, and at the same time Each shard's member nodes will receive With the Leadership Committee Received If they are equal, then it is accepted. The legitimate identity of the member node; if they are not equal, the member node reports to the leadership committee. Send an abnormal signal; if the leadership committee Received more than [number] from the same fragment within a set time. If an abnormal signal is detected, the leader node is determined to be malicious and the leader node replacement mechanism is immediately initiated; if the candidate block header and pre-commitment pass the integrity verification, the protocol enters the preparation phase.

[0033] The aforementioned blockchain sharding method, which combines a node contribution mechanism and a two-round consensus, includes the following specific process in step three: the preparation phase, in which each leadership node in the leadership committee... Candidate blocks broadcast preparation messages to each other. ,like Received more A preparation message from other leadership nodes of the leadership committee. Then the agreement enters the submission phase;

[0034] The specific process of the submission phase is as follows: If this... The candidate block submission request is generated by other leader nodes of the leadership committee, who then generate submission messages for the candidate blocks. ,like Received more The node's commit messages come from other leader nodes on the leadership committee. This achieves a consensus among the leadership and generates an end message. Then Send back the first Each segment, The candidate blocks will be officially written into the blockchain, completing this round of consensus protocol.

[0035] In the blockchain sharding method described above, which combines a node contribution mechanism and a two-round consensus, the specific triggering conditions for the dynamic replacement mechanism in step four are as follows:

[0036] Targeting the replacement of malicious leader nodes: (The following is a list of steps / sections) Each shard's member nodes listen Pre-commitment submitted to the leadership committee If detected Pre-commitments received by member nodes If there is a discrepancy, an anomaly signal is sent to the leadership committee; when the leadership committee... Received more than from the same fragment After detecting and verifying an abnormal signal, the leader node is determined to be a malicious node, its contribution value is reset to zero, and a new shard leader node is selected based on the contribution value ranking.

[0037] Reconstruction for Fragmentation Activity Loss: Leadership Committee A threshold check is performed on the number of transaction votes in the candidate block header. If the threshold is detected... In a series of consecutive rounds of submissions to candidate blocks, the number of transaction votes did not reach [a certain threshold]. If the shard is found to be unable to process transactions or has been maliciously controlled, the system will freeze the shard and randomly select a node from the backup node pool to reorganize the shard.

[0038] The beneficial effects of this invention are as follows:

[0039] 1. This invention introduces the dimension of node historical contribution, increasing the cost and risk of malicious nodes engaging in short-term masquerading. A node must accumulate sufficiently high contribution capital through long-term honest behavior, which constitutes a strong deterrent against malicious behavior in game theory, ensuring the long-term stability of the system.

[0040] 2. The contribution value formula of this invention transforms the core evaluation metric from geometric distance into a simple discrete counting problem, directly counting the number of times node votes are completely consistent with the final result through an auxiliary function. This process only involves... The sum of the integer comparisons does not exceed [number]. This integer addition completely avoids any high-cost operations such as multiplication, division, and square root extraction.

[0041] 3. The solution of this invention does not rely on an external arbitration institution. The leader node is fairly elected by each shard, the leader committee nodes supervise each other, and the member nodes of the shards supervise the leader node through a pre-commitment comparison mechanism, so that the leader committee is always in a state of dynamic updating.

[0042] 4. The two-round consensus mechanism of this invention is based on a leader node, where all shards only need to report to the leader node, which enables the system to remain efficient even at a larger scale and reduces network communication overhead and topology complexity.

[0043] 5. The node replacement of the present invention is a refined dynamic governance mechanism. It can not only restore the activity of the system, but also achieve the continuous self-purification and evolution of the system through precise punishment and elimination of malicious individuals. This smooth node replacement avoids the periodic performance oscillation caused by shard-level switching and ensures the long-term stable operation of the system. Attached Figure Description

[0044] Figure 1 This is the overall flowchart of the present invention.

[0045] Figure 2 This is a schematic diagram of the sharding of the blockchain network of the present invention. Detailed Implementation

[0046] The present invention will be further described below with reference to the accompanying drawings and embodiments.

[0047] like Figure 1 As shown, a blockchain sharding method combining node contribution mechanism and two-round consensus includes the following steps:

[0048] Step 1: Use a verifiable random function based on elliptic curve algorithm to complete the initialization of blockchain nodes and random sharding.

[0049] The specific process of step one is as follows: First, based on the elliptic curve algorithm, a public key is generated for each node. and private key The public key From private key The identifier is calculated based on the base point and serves as the node's identity; then, it is determined based on a verifiable random function and the number of shards. public and private key pairs of nodes Current consensus round And the random value of this round The generated parameters are used as input parameters to determine the shard address to which a node belongs; at the same time, the generated parameters can be used to verify the identity of a node.

[0050] Step 2: Construct a multi-dimensional dynamic contribution value model based on discretization calculation, which comprehensively considers the voting consistency of nodes in the current round, the average historical contribution, and the identity bonus points, in order to select leader nodes.

[0051] In step two, for any node In a certain round, it needs to be handled One transaction, using Represents a node The voting in this round of transactions, , Represents a node For the Voting on the transaction A value of +1 indicates approval. A value of -1 indicates opposition. A value of 0 indicates silence;

[0052] A node's contribution value is closely related to the accuracy of its votes, defined as follows: This represents the final consensus result vector determined based on the majority rule within each shard. , For the first segment The option that receives the most votes in a transaction makes a node's contribution value highly positively correlated with the similarity between its voting and the final consensus result;

[0053] node Contribution value The calculation formula is as follows:

[0054]

[0055] in, It is an adjustable weighting parameter. Represents a node In the Contribution value of each round Represents a node in the past The average contribution value of each round, For nodes in the past Total contribution value across all rounds Represents a node In the Contribution value of each round This is an auxiliary function used to determine the consistency between node voting and the consensus result. Its expression is as follows:

[0056]

[0057] in, This indicates that the two are not equal.

[0058] For nodes The identity-based bonus is used to provide additional incentives based on the node's identity, and the expression is as follows:

[0059]

[0060] in, As a leadership node, and All of these are adjustable weight parameters.

[0061] Both nodes and leader nodes can gain additional contribution points, but nodes gain more. As the number of transactions increases, the difference in contribution points between nodes and leader nodes becomes smaller and smaller, until eventually a node's contribution point exceeds that of the leader node, thus becoming the new leader node. This allows well-performing leader nodes to maintain their leader status in more rounds, while also providing the possibility for nodes to become leader nodes.

[0062] The node with the largest contribution value is selected as the temporary leader node. When the contribution value of a node exceeds that of the leader node, or the leader node is identified as a malicious node, the leader node replacement mechanism is activated.

[0063] Step 3: Execute the two-round consensus protocol. In the first round, the transaction voting and statistics are carried out in parallel within the shard, and the leader node of the shard generates a pre-commitment to fix the composition of the member nodes within the shard. In the second round, the leadership committee performs global verification and confirmation on the block header containing the signature set submitted by the shard.

[0064] like Figure 2 As shown, in step three, the blockchain network has a total of Each node Each of the 1000 fragments contains 100 fragments. 1 node A leader node is elected in each shard. ( Figure 2 The red nodes in the diagram represent the member nodes (excluding the leader node). Figure 2 The white nodes in the diagram represent the leadership committee comprised of all the leader nodes of each shard. The two-round consensus protocol specifically includes: a first round of intra-segment consensus involving all nodes within each segment, and a second round of global consensus involving the leadership committee.

[0065] The process of forming intra-shard consensus among all nodes in each shard is as follows:

[0066] first, Receive pending transactions belonging to this fragment and package them into a transaction list. ,Will Broadcast to member nodes to initiate the consensus process;

[0067] Then, each member node verifies independently. For each transaction in the process, a voting vector containing "for," "against," or "silent" opinions is generated, and the voting vector is sent to... ;

[0068] then, Collect the voting vectors of all member nodes to form a voting set. , Traversal For each transaction, the number of votes in favor, against, and silent votes are counted separately. All transactions are tallied, and the voting results for each transaction are included in the transaction resolution table. ;

[0069] at last, Will and Broadcast within the shard, member nodes within the shard verify. To verify the accuracy of the statistical data, please reply with a confirmation message after confirming that it is correct. to ; fragmented Consensus was reached after receiving confirmation messages from more than half of the member nodes.

[0070] During the process of generating pre-commitments by the leader node of the sharding, a list of public keys is formed. , ,in For the first The first fragment in the... Round number The first public key is used to generate the second public key. The first fragment in the... Pre-commitment for each round , , For the hash function, the leader node of the shard will Broadcast within segments to reach a consensus, and... Used for subsequent node replacement verification.

[0071] Leadership Committee composed of leadership nodes The monitoring consensus process consists of three phases: the pre-preparation phase, the preparation phase, and the submission phase.

[0072] The specific process of the preparatory stage is as follows: Each shard's leader node To the Leadership Committee Submit candidate blocks for this round and pre-commitment At the same time, broadcast the list of public keys to the member nodes within the shard. and Leadership Committee Check candidate block headers The content, whether each transaction has more than Valid votes, and at the same time Each shard's member nodes will receive With the Leadership Committee Received If they are equal, then it is accepted. The legitimate identity of the member node; if they are not equal, the member node reports to the leadership committee. Send an abnormal signal; if the leadership committee Received more than [number] from the same fragment within a set time. If an abnormal signal is detected, the leader node is determined to be malicious and the leader node replacement mechanism is immediately initiated; if the candidate block header and pre-commitment pass the integrity verification, the protocol enters the preparation phase.

[0073] The specific process of the preparation phase is as follows: each leadership node in the leadership committee targets... Candidate blocks broadcast preparation messages to each other. ,like Received more A preparation message from other leadership nodes of the leadership committee. Then the agreement enters the submission phase;

[0074] The specific process of the submission phase is as follows: If this The candidate block submission request is generated by other leader nodes of the leadership committee, who then generate submission messages for the candidate blocks. ,like Received more The node's commit messages come from other leader nodes on the leadership committee. This achieves a consensus among the leadership and generates an end message. Then Send back the first Each segment, The candidate blocks will be officially written into the blockchain, completing this round of consensus protocol.

[0075] Step 4: By comparing the consistency of the pre-commitment with the number of valid signatures in the block header, a dynamic replacement mechanism is triggered for malicious leader nodes or malicious shards, respectively.

[0076] The specific triggering conditions for the dynamic replacement mechanism are as follows:

[0077] Targeting the replacement of malicious leader nodes: (The following is a list of steps / sections) Each shard's member nodes listen Pre-commitment submitted to the leadership committee If detected Pre-commitments received by member nodes If there is a discrepancy, an anomaly signal is sent to the leadership committee; when the leadership committee... Received more than from the same fragment After detecting and verifying an abnormal signal, the leader node is determined to be a malicious node, its contribution value is reset to zero, and a new shard leader node is selected based on the contribution value ranking.

[0078] Reconstruction for Fragmentation Activity Loss: Leadership Committee A threshold check is performed on the number of transaction votes in the candidate block header. If the threshold is detected... In a series of consecutive rounds of submissions to candidate blocks, the number of transaction votes did not reach [a certain threshold]. If the shard is found to be unable to process transactions or has been maliciously controlled, the system will freeze the shard and randomly select a node from the backup node pool to reorganize the shard.

Claims

1. A blockchain sharding method combining a node contribution mechanism and two-round consensus, characterized in that, The method comprises the following steps: Step 1: completing blockchain node initialization and random sharding by using a verifiable random function based on an elliptic curve algorithm; Step 2: constructing a multi-dimensional dynamic contribution value model based on discrete calculation, comprehensively considering the voting consistency of nodes in the current round, the historical contribution average value and the identity additional score, so as to select a leader node; Step 3: executing a two-round consensus protocol, the first round being parallel voting statistics on transactions within a shard, and the leader node of the shard generating a pre-commitment for fixing the member nodes within the shard, and the second round being global verification and confirmation of the block header submitted by the leadership committee to the shard containing a signature set; Step 4: triggering a dynamic replacement mechanism for a malicious leader node or a malicious shard by comparing the consistency of the pre-commitment and the number of valid signatures of the block header.

2. The blockchain sharding method with joint node contribution mechanism and two-round consensus according to claim 1, characterized in that, The specific process of the step one is: first, based on the elliptic curve algorithm, a public key and a private key are generated for each node , wherein the public key is calculated by the private key in combination with a base point, as an identity of the node ​ Then, based on a verifiable random function, and according to the number of shards , the public-private key pair of the node , the current consensus round , and the random value of the current round , as input parameters, to divide the shard address to which the node belongs.

3. The blockchain sharding method with joint node contribution mechanism and two-round consensus according to claim 2, characterized in that, In step two, for any node In a certain round, it needs to be handled One transaction, using Represents a node The voting in this round of transactions, , Represents a node For the Voting on the transaction A value of +1 indicates approval. A value of -1 indicates opposition. A value of 0 indicates silence; The contribution value of a node is closely related to the accuracy of the vote, defined as the final consensus result vector determined by the majority rule within the shard, , the final consensus result vector determined by the majority rule within the shard, The option with the most votes for a transaction makes the contribution value of a node highly positively correlated with the degree of similarity between its vote and the final consensus result. The node with the maximum contribution value is selected as a temporary leader node, and when the contribution value of the node exceeds that of the current leader node or the current leader node is identified as a malicious node, the leader node replacement mechanism is started.

4. The blockchain sharding method with joint node contribution mechanism and two-round consensus according to claim 3, characterized in that, In the second step, the node contribution value is calculated according to the following formula: ； in, It is an adjustable weighting parameter. Represents a node In the Contribution value of each round Represents a node in the past The average contribution value of each round, For nodes in the past Total contribution value across all rounds Represents a node In the Contribution value of each round This is an auxiliary function used to determine the consistency between node voting and the consensus result. Its expression is as follows: ； wherein denotes not equal to; For nodes The identity-based bonus is used to provide additional incentives based on the node's identity, and the expression is as follows: ； wherein, is the leader node, and are adjustable weight parameters.

5. The blockchain sharding method with joint node contribution mechanism and two-round consensus according to claim 3, characterized in that, In the third step, the blockchain network shares nodes, shards, each shard containing nodes, , and elects a leader node in each shard , other nodes in the shard except the leader node are member nodes, and the leader nodes of all shards together form a leader committee ; The two-round consensus protocol specifically comprises an intra-shard consensus phase participated by all nodes within each shard and a global consensus phase participated by the leadership committee.

6. The blockchain sharding method with joint node contribution mechanism and two-round consensus according to claim 5, characterized in that, In step 3, the intra-shard consensus process formed by all nodes in each shard is as follows: First, Receive pending transactions belonging to this shard, package into transaction list , start consensus process Broadcast to member nodes, start consensus process Then, each member node independently verifies the legality of each transaction in , generates a voting vector containing approval, objection or silent opinion, and sends the voting vector to ; Next, Collect the voting vectors of all member nodes to form a voting set , Traverse , respectively count the number of votes for, against and silent for each transaction, count all transactions, and include the voting situation of each transaction in the transaction resolution table ; Finally, Will And Broadcast within the shard, shard member nodes verify The accuracy of the statistics, and reply to confirm the message after verification To ; the Consensus is reached after receiving confirmation messages from more than half of the member nodes.

7. The blockchain sharding method with joint node contribution mechanism and two-round consensus according to claim 5, characterized in that, In step three, in the process of generating pre-commitment in the leader node of the shard, a public key list is formed , wherein is the i-th public key of the j-th shard in the i-th round, and the pre-commitment of the i-th shard in the i-th round is generated , , is a hash function, and the leader node of the shard broadcasts within the shard to reach consensus, and is used for subsequent node replacement verification.​​​​​ 8. The blockchain sharding method with joint node contribution mechanism and two-round consensus according to claim 7, characterized in that, In step 3, the global consensus process of the leadership committee composed of leader nodes comprises a pre-preparation phase, a preparation phase and a submission phase. The specific process of the pre-preparation phase is as follows: the first leader node of the first shard submits a candidate block of this round to the leader committee and a pre-commitment , and broadcasts the public key list to the member nodes in the shard and ; the leader committee checks the content of the candidate block header , whether each transaction has more than valid votes, and the member nodes of the first shard compare the received with the received by the leader committee , if they are equal, the identity of the first is recognized as legal, if they are not equal, the member nodes send an exception signal to the leader committee ; if the leader committee receives more than exception signals from the same shard within a set time, it is determined that the leader node is malicious and the leader node replacement mechanism is immediately started; if the candidate block header and the pre-commitment pass the integrity check, the protocol enters the preparation phase.

9. The blockchain sharding method with joint node contribution mechanism and two-round consensus according to claim 8, characterized in that, In the third step, the specific process of the preparation phase is: each leader node in the leader committee broadcasts a preparation message to each other for a candidate block If more than preparation messages from other leader nodes in the leader committee are received , the protocol enters the commit phase;​ The specific process of the commit phase is: if the current candidate block commit request is submitted, other leader nodes of the leader committee generate commit messages for the candidate block , if more than nodes from other leader nodes of the leader committee receive the commit messages , consensus of the leader is reached, an end message is generated , and then is sent back to the th shard, formally write the current candidate block into the block chain, and complete the current round of consensus protocol.

10. The blockchain sharding method with joint node contribution mechanism and two-round consensus according to claim 9, characterized in that, In step 4, the specific triggering conditions of the dynamic replacement mechanism are as follows: Targeting the replacement of malicious leader nodes: (The following is a list of steps / sections) Each shard's member nodes listen Pre-commitment submitted to the leadership committee If detected Pre-commitments received by member nodes If there is a discrepancy, an anomaly signal is sent to the leadership committee; when the leadership committee... Received more than After detecting and verifying an abnormal signal, the leader node is determined to be a malicious node, its contribution value is reset to zero, and a new shard leader node is selected based on the contribution value ranking. Reconstruction for loss of shard activity: leadership committee Threshold check on the number of votes for transactions in candidate block headers, if it is detected that the number of votes for transactions in candidate blocks submitted by the shard in multiple rounds does not reach , it is determined that the shard cannot normally process transactions or is maliciously controlled; the system immediately freezes the shard and randomly selects nodes from the backup node pool to reorganize the shard.

Images