CN113283892A - PoSearch and PBFT fusion consensus algorithm based on voting mechanism - Google Patents

Abstract

The invention discloses a PoSearch and PBFT fusion consensus algorithm based on a voting mechanism, which includes multiple nodes for issuing tasks by client nodes, searching for mining nodes, and finding the optimal solution of the optimization problem; the client sends a request message to the master node, and the master node Assign a number to the received client request message, broadcast the pre-preparation message to other committee nodes, append the pre-preparation message to the message published by the client, verify that the pre-preparation message is passed, and enter the preparation stage, and append the pre-preparation message to the In the received pre-preparation message, all committee nodes verify the validity of the message and write it into the message log. All committee nodes broadcast the confirmation message to all other nodes except themselves, write it into the message log, and the committee nodes report to the customer service. The terminal sends a reply message. The invention effectively increases the transaction time required by the consensus algorithm when the number of nodes in the network is relatively large, and improves the algorithm transaction throughput.

Description

A Consensus Algorithm Based on PoSearch and PBFT Fusion Based on Voting Mechanism

technical field

The invention relates to the technical field of blockchain service credit, in particular to a consensus algorithm based on a voting mechanism for PoSearch and PBFT fusion.

Background technique

Broadly speaking, blockchain technology is a method that uses encrypted chain block structure to verify and store data, uses distributed node consensus algorithm to generate and update data, and uses automated script code (smart contract) to program and manipulate data. Decentralized infrastructure and the distributed computing paradigm. As the key technology of blockchain, consensus algorithm directly affects the transaction processing capability, scalability and security of blockchain.

At present, blockchain consensus can be divided into two categories. One is the authorization consensus mechanism. The nodes in the authorization network generally complete the identity authentication through the public key infrastructure before participating in the subsequent consensus mechanism. In an unauthorized network, nodes join and exit at any time, and the number of nodes changes dynamically and unpredictably. The unauthorized consensus completes the process of block producer election, block generation, and node verification and updating the blockchain through a specific algorithm. Its basic process can be divided into electing block producers, generating blocks, and nodes verifying and updating the blockchain.

Blockchain can be further divided into public chain, consortium chain and private chain, and authorization consensus mechanism is mostly used in consortium chain. Among the current mainstream consensus algorithms, the PoW (Proof of Work) algorithm has a high degree of decentralization, but the node computing resources are wasted and the transaction efficiency is low. Although the PoS (Proof of Stake) algorithm is superior to the PoW consensus algorithm in terms of transaction efficiency , but the degree of decentralization is low; the PBFT (Byzantine Fault Tolerance) algorithm used in traditional distributed systems can complete consensus through three parts: pre-prepare, prepare and commit, which is suitable for alliance chains However, the communication complexity of the consensus part of the PBFT algorithm is high. When the number of nodes increases to a certain scale, the consensus delay is extremely long and the scalability is poor.

SUMMARY OF THE INVENTION

The purpose of the present invention is to provide a consensus algorithm of PoSearch and PBFT fusion based on voting mechanism to solve the above problems.

The present invention solves the technical problem by adopting the following technical solutions:

A consensus algorithm based on voting mechanism of PoSearch and PBFT fusion, including two steps of PoSearch algorithm selecting committee nodes and committee nodes for PBFT consensus; among them,

The selection of committee nodes by the PoSearch algorithm includes: client nodes issue tasks, search for mining nodes according to the tasks released by client nodes, and find multiple nodes for the optimal solution of the optimization problem; the committee nodes perform PBFT consensus including: the client sends a request message to the master node, and the master node sends a request message to the master node. The node assigns a number to the received client request message, then broadcasts the pre-preparation message to other committee nodes, and appends the pre-preparation message to the message published by the client. The preparation message is also appended to the received pre-preparation message. All committee nodes verify the validity of the message and write it into the message log. All committee nodes broadcast confirmation messages to all nodes except themselves, and write them into the message log. , the committee node sends a reply message to the client.

Further, the task information includes the evaluator and the task content. The evaluator is used to evaluate whether the result is the optimal solution, input a certain calculation result, and output the judgment result of whether the result is the optimal solution. The task content is used for other nodes to directly run the calculation , using computing power to find the optimal solution.

Further, the method of finding mining nodes according to the task issued by the client node is as follows: the client node broadcasts the task information to all nodes in the network, and all other nodes receive the task information, and perform the optimal solution search according to the task information, and the competition becomes Mining node.

Further, the method for finding multiple nodes for the optimal solution of the optimization problem is as follows: the nodes that complete the tasks issued by the client nodes are verified by the evaluator and broadcast the evaluation results of the evaluator to the whole network; Multiple nodes are marked as committee nodes. If there are multiple nodes that find the optimal solution in the same time period, the node is selected by random selection; The participation of the optimal solution task, the node has a higher voting rate for the node with shorter time and higher participation, and finally the node with the highest number of votes becomes the master node.

Further, the request message initiated by the client to the master node includes operation information, time stamp, and client number.

Further, the reply message includes time stamp, client number, node number, and operation result information.

Further, if the client receives multiple identical response messages from different nodes, and the reply message has a corresponding timestamp and operation result, the client considers the operation result to be a correct execution result.

Beneficial effects:

The invention effectively increases the transaction time required by the consensus algorithm when the number of nodes in the network is large, improves the transaction throughput of the algorithm, and at the same time increases the scalability of the consensus algorithm, and can also ensure the steady progress of the consensus when the number of nodes is large. ; The addition of the voting mechanism can also reduce the probability of the master node being a malicious node and enhance the fault tolerance of the consensus. On the other hand, the PoSearch algorithm utilizes the original computing resources and avoids excessive resource waste.

Description of drawings

Fig. 1 is the method flow chart of the present invention;

FIG. 2 is a flowchart of the PBFT consensus algorithm of the present invention.

Detailed ways

In order to make the purposes, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments These are some embodiments of the present invention, but not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

Referring to FIG. 1 , the present invention discloses a fusion algorithm based on PoSearch and PBFT consensus, which elects nodes for PBFT algorithm through PoSearch algorithm, and reduces the number of nodes participating in PBFT algorithm. In view of the defect of the PoW algorithm wasting computing resources, the PoSearch consensus algorithm is introduced, and the wasted resources in the original PoW algorithm are used to calculate the optimal solution. Including the two steps of PoSearch algorithm to select committee nodes and committee nodes to conduct PBFT consensus; among them,

The selection of committee nodes by the PoSearch algorithm includes the following steps:

S1, the client node publishes the corresponding task, the task information includes the evaluator and the task content, the evaluator is used to evaluate whether the result is the optimal solution, input a certain calculation result, and output the judgment result of whether the result is the optimal solution. The task content is used for Other nodes run calculations directly and use computing power to find the optimal solution.

S2, the client node broadcasts the task information to all nodes in the network.

S3, all other nodes receive the task information, and search for the optimal solution according to the task information, and compete to become mining nodes.

S4, the node that completes the task issued by the client node is verified by the evaluator and broadcasts the evaluation result of the evaluator to the whole network.

S5, the first (3f+1) nodes that first find the optimal solution and broadcast the results are marked as committee nodes. If there are multiple nodes that find the optimal solution in the same time period, the nodes are selected by random extraction.

S6, voting among committee nodes, combining the time for the committee nodes to find the optimal solution and the node's participation in the optimal solution task (the number of tasks issued and the number of participation in finding the optimal solution), the time spent on the node pair is shorter and the degree of participation is higher. High nodes have higher voting rates, and the node with the most votes eventually becomes the master node.

The committee node's PBFT consensus includes the following steps:

S7, the client sends a request message to the master node, and the request message includes operation information, time stamp, client number, and the like.

S8 , the master node assigns a number m to the received client request message, then broadcasts a pre-preparation message to other committee nodes, and appends the pre-preparation message to the message published by the client.

S9, each other committee node enters the preparation stage after receiving and verifying the pre-preparation message, broadcasts the pre-preparation message to other nodes, and appends the pre-preparation message to the received pre-preparation message.

S10, after receiving the preparation message, all committee nodes including the master node verify the validity of the message and write it into the message log.

S11, after the prepare message is verified to be true, all committee nodes broadcast a confirmation message to all other nodes except themselves, and other nodes write the confirmation message into the message log after receiving the confirmation message.

S12, the committee node sends a reply message to the customer service terminal, and the reply message includes information such as timestamp, client number, node number, operation result, etc. If the client receives f+1 identical response information from different nodes, and the reply If the message has the corresponding timestamp and the operation result, the client considers the operation result to be the correct execution result.

In the subsequent n rounds of consensus, the consensus process is completed in the committee nodes, and the committee nodes are re-selected after n rounds of consensus are determined.

PoSearch algorithm selects committee nodes: PoSearch (Proof of Search) is a search proof algorithm based on the principle of the PoW algorithm. The basic principle of the algorithm is similar to the PoW consensus algorithm, but an optimization problem is introduced, and the calculation of random numbers in the original PoW algorithm is used. Resource computing optimal solution. The concepts of evaluator, client and job are introduced. The evaluator is used to judge whether a certain result is the optimal solution to the problem, and the output result must be the same when the input in the evaluator is the same. A task is an executable request to find the optimal solution to an optimization problem, and the task also contains the evaluator and all the information needed to execute the search request. A client is a node that submits tasks, and any node that can submit a task and submit a task becomes a client node. At the same time, it is stipulated that: a) The first (3f+1) nodes that first propose the best solution in the order of time among the mining nodes can enter the committee to participate in the PBFT consensus; b) The nodes cannot submit their own known results for optimization problems ; c) When there is no optimization problem to be solved in the network, the PoW algorithm is used to calculate the corresponding random number.

Committee nodes conduct PBFT consensus: the committee nodes conduct internal voting, and the node with the highest number of votes is the master node, and other committee nodes are backup nodes. The PBFT consensus is divided into two parts. The consensus is completed in three parts: pre-prepare), prepare (prepare) and commit (commit). The second part is view-change. When the primary node fails to process data requests in time, other backup nodes initiate view-change. After the conversion is successful, it becomes a new master node and starts to work. At this stage, the transaction confirmation time will be increased, and the master node will be elected by adding a voting mechanism to ensure that the master node is not a malicious node, increase the exclusion rate of malicious nodes, and enhance fault tolerance.

The invention effectively increases the transaction time required by the consensus algorithm when the number of nodes in the network is large, improves the transaction throughput of the algorithm, and at the same time increases the scalability of the consensus algorithm, and can also ensure the steady progress of the consensus when the number of nodes is large. ; The addition of the voting mechanism can also reduce the probability of the master node being a malicious node and enhance the fault tolerance of the consensus. On the other hand, the PoSearch algorithm utilizes the original computing resources and avoids excessive resource waste.

In addition, in the permissioned alliance chain, there are multi-party credit platform nodes, and a node acts as a client to issue request information (for example, the request information contains changes to a certain credit information), which is verified by the consensus algorithm of the present invention, and the above operations are performed. , agree on the request information.

Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, but not to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that it can still be The technical solutions described in the foregoing embodiments are modified, or some technical features thereof are equivalently replaced; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims (7)

1. A PoSearch and PBFT fusion consensus algorithm based on a voting mechanism is characterized by comprising two steps of selecting a committee node and performing PBFT consensus on the committee node by the PoSearch algorithm; wherein,

the PoSearch algorithm selection committee node comprises: the client node issues tasks, and mine digging nodes are searched according to the client node issuing tasks, so that a plurality of nodes of optimal solutions of optimization problems are found; committee nodes performing PBFT consensus including: the client side initiates a request message to the main node, the main node distributes a number to the received client side request message, then broadcasts a pre-preparation message to other committee nodes, adds the pre-preparation message to a message issued by the client side, enters a preparation stage after the pre-preparation message is verified to pass, adds the preparation message to the received pre-preparation message, verifies the validity of the message and writes the message into a message log, all the committee nodes broadcast confirmation messages to all the nodes except the committee node and write the confirmation messages into the message log, and the committee nodes send reply messages to the client side.

2. The PoSearch and PBFT fusion consensus algorithm based on the voting mechanism as claimed in claim 1, wherein the task information comprises an evaluator and task contents, the evaluator is configured to evaluate whether a result is an optimal solution, input a certain calculation result, output a determination result task content whether the result is the optimal solution, and use the determination result task content to directly run calculations at other nodes, and search for the optimal solution by using computing power.

3. The PoSearch and PBFT fusion consensus algorithm based on voting mechanism according to claim 2, wherein the method for finding the mining node according to the task issued by the client node comprises the following steps: the client node broadcasts the task information to all the nodes in the network, and all other nodes receive the task information and perform optimal solution search work according to the task information to compete to become the mining node.

4. The PoSearch and PBFT fusion consensus algorithm based on voting mechanism according to claim 3, wherein the method for finding the plurality of nodes for optimizing the optimal solution of the problem comprises: after the nodes which finish the tasks issued by the client nodes are verified by the evaluator, the evaluation results of the evaluator are broadcast to the whole network; the first nodes which preferentially find the optimal solution and broadcast the result are marked as committee nodes, and if the optimal solution is found by the nodes in the same time period, the nodes are selected in a random extraction mode; voting among the committee nodes, integrating the time of finding the optimal solution by the committee nodes and the participation of the nodes in the task of the optimal solution, enabling the nodes with shorter time and higher participation to have higher voting rate, and finally obtaining the node with the highest vote number to serve as a main node.

5. The PoSearch and PBFT fusion consensus algorithm based on voting mechanism according to claim 1, wherein the request message initiated by the client to the master node comprises operation information, a timestamp and a client number.

6. The PoSearch and PBFT fusion consensus algorithm based on voting mechanism as claimed in claim 5, wherein the reply message comprises information of a timestamp, a client number, a node number, and an operation result.

7. The PoSearch and PBFT fusion consensus algorithm based on voting mechanism according to claim 6, wherein if the client receives a plurality of identical response messages from different nodes, and the reply message has corresponding timestamps and operation results, the client considers the operation results as correct execution results.

Images