WO2020199179A1

WO2020199179A1 - Method and apparatus for determining consensus node, and computer device and storage medium

Info

Publication number: WO2020199179A1
Application number: PCT/CN2019/081432
Authority: WO
Inventors: 李升林; 姜海涛; 孙立林; 傅志敬
Original assignee: 云图有限公司
Priority date: 2019-04-04
Filing date: 2019-04-04
Publication date: 2020-10-08

Abstract

Provided are a method and apparatus for determining a consensus node, and a computer device and a storage medium. The method comprises: acquiring a selection proportion of each target node from among a plurality of target nodes in a blockchain system; according to the selection proportion of each target node from among the plurality of target nodes, selecting candidate nodes from the plurality of target nodes to form a candidate node set; and randomly selecting a plurality of nodes from the candidate node set as consensus nodes. The solution solves the technical problem of a low degree of decentralization in the existing consensus node determination method, and achieves the technical effects of effectively improving the degree of decentralization and improving the security and expandability of a system.

Description

Method, device, computer equipment and storage medium for determining consensus node

Technical field

This application relates to the field of blockchain technology, in particular to a method, device, computer equipment and storage medium for determining consensus nodes.

Background technique

The "impossible triangle" theory of the blockchain proposes that the three core properties of the blockchain cannot be achieved at the same time: scalability, decentralization, and security. The quantitative indicator of decentralization is the number of nodes participating in the consensus, the quantitative indicator of scalability is the consensus performance, and the quantitative indicator of security is the economic cost of evil. As the core component of the blockchain, the consensus algorithm also has these trade-offs.

At present, mainstream blockchains tend to adopt PoS (Proof of Stake) consensus algorithms, but all PoS systems have a trade-off between the number of consensus nodes and performance. DPoS (Delegated Proof of Stake) consensus algorithm favors fewer consensus nodes in exchange for higher performance, but the degree of decentralization is lower. Algorand uses a random method to select consensus nodes in the entire network, but it can only run on a strong synchronization network, and it is difficult for individual users to participate, which seriously affects the decentralization characteristics.

In view of the above problems, no effective solutions have been proposed yet.

Summary of the invention

The embodiments of the present application provide a consensus node determination method, device, computer equipment, and storage medium to solve the problem of low decentralization in selecting consensus nodes in the prior art.

The embodiment of the application provides a method for determining a consensus node, including: obtaining the selection rate of each target node among multiple target nodes in the blockchain system; according to the selection rate of each target node among the multiple target nodes, A candidate node is selected from the target nodes to form a candidate node set; multiple nodes are randomly selected from the candidate node set as consensus nodes.

In an embodiment, the selection rate includes at least one of the following: the proportion of the target node selected by the node in the blockchain system, and the proportion of the target node's own share.

In one embodiment, according to the selection rate of each target node in the multiple target nodes, selecting candidate nodes from the multiple target nodes to form a candidate node set includes: dividing the multiple target nodes into a block chain system. Nodes whose selected ratio is greater than a preset ratio threshold are used as selected nodes to form a selected node set; selected nodes whose share in the selected node set satisfies preset conditions are used as candidate nodes to form a candidate node set.

In one embodiment, the preset condition includes one of the following: exceeding a preset proportion threshold and being located in the front preset number of digits.

In one embodiment, randomly selecting multiple nodes from the set of candidate nodes as consensus nodes includes: obtaining the weight of each candidate node in the set of candidate nodes, where the weight of each candidate node is the total votes obtained by each candidate node Age; Get random seeds of multiple blocks in the blockchain system, where the random seed of the current block is generated according to the VRF algorithm and the random seed of the previous block; according to the random seeds and candidate nodes of multiple blocks The sorting sequence number of each candidate node in the set is selected, and a random number is selected for each candidate node in the candidate node set; according to the weight and random number of each candidate node, the number of votes for each candidate node in the candidate node set is determined; The number of votes each candidate node is selected determines multiple consensus nodes from the set of candidate nodes.

In one embodiment, obtaining the weight of each candidate node in the candidate node set includes determining the weight of each candidate node in the candidate node set according to the following formula:

Among them, w _i is the weight of the i-th candidate node in the candidate node set, A _i,k is the age of the k- _th vote obtained by the i-th candidate node, and Mi is the total number of votes obtained by the i-th candidate node Number, N is the number of candidate nodes in the candidate node set.

In one embodiment, the random seed of the current block is generated according to the VRF algorithm and the random seed of the previous block according to the following formula:

Wherein, r _i and π _i are the current block and random seed data demonstrate, r _i-1 is a random seed block before the current block, sk _i of the current block to generate a private key, VRF function VRF algorithm, n is the block height of the blockchain system.

In one embodiment, a random number is selected for each candidate node in the candidate node set according to the random seeds of multiple blocks and the sorting sequence number of each candidate node in the candidate node set, including selecting a random number for each candidate node in the candidate node set according to the following formula: Each candidate node selects a random number:

Among them, i is the sequence number of the candidate node in the candidate node set, R _i is the random number of the i-th candidate node in the candidate node set, r _n is the random seed of the nth block in the blockchain system, and r _ni is The random seed of the nith block in the blockchain system, where n is the block height of the blockchain system, and N is the number of candidate nodes in the candidate node set.

In one embodiment, determining the number of votes for each candidate node in the candidate node set according to the weight and random number of each candidate node includes: determining the minimum _Ji value that satisfies the following inequality as the i-th candidate node Number of votes selected:

R _i /2 ^hashlen ≥F _X (J _i +1), i=1,2...N;

Among them, R _i is the random number of the i-th candidate node in the candidate node set, hashlen is the number of bits of the random seed generated according to the VRF algorithm, F _x is the cumulative distribution function, and N is the number of candidate nodes in the candidate node set, where , F _X (x)=P(X≤x), where,

Represents the probability that the number of votes of the i-th candidate node in the candidate node set is k, where,

Among them, t is the number of multiple consensus nodes participating in the consensus,

Is the average of the weights of all candidate nodes in the candidate node set,

Is the total weight of all candidate nodes in the candidate node set, where w _i is the weight of the i-th candidate node in the candidate node set.

In one embodiment, determining a plurality of consensus nodes from the candidate node set according to the number of votes each candidate node has been selected includes: sorting the candidate nodes in the candidate node set in descending order according to the number of votes the candidate node has been selected; The selected multiple candidate nodes with the same number of votes are sorted in descending order according to the weight of the candidate nodes; the candidate nodes ranked in the front preset number are determined as multiple consensus nodes participating in the consensus.

In one embodiment, after determining multiple consensus nodes from the candidate node set according to the number of votes each candidate node has been selected, the method further includes: multiple consensus nodes take turns as proposed nodes to generate blocks, where the last one is generated During the block, randomly select one ballot from the votes obtained by each consensus node as the reward ballot to obtain multiple reward votes; for each of the multiple reward votes, vote in the blockchain system The node that gave the reward ballot will be rewarded.

In one embodiment, randomly selecting a reward vote from the votes obtained by each consensus node, including: for each consensus node, sort all votes obtained by the consensus node according to the voting time; for each consensus node , Determine the age range of each ballot according to the age and sort number of all votes obtained by the consensus node; for each consensus node, according to the age range of the vote age of the consensus node, The ballots corresponding to this ballot age range are determined as bonus ballots.

In one embodiment, for each consensus node, the vote age interval of each vote among all the votes obtained by the consensus node is determined according to the vote age and the ranking sequence number, including: the μth vote of the i-th consensus node The age range of votes is divided into:

Among them, μ is the sequence number of the votes, I _{i, μ} are the age intervals of the μth vote of the i-th consensus node, Ai _,k is the age of the _k- th vote obtained by the i-th candidate node, M _i is the total number of votes obtained by the i-th candidate node, and t is the number of multiple consensus nodes participating in the consensus.

The embodiment of the present application also provides a consensus node determination device, which includes: an acquisition module for acquiring the selection rate of each target node among multiple target nodes in the blockchain system; In the selection rate of each target node in the selection rate, candidate nodes are selected from multiple target nodes to form a candidate node set; the random selection module is used to randomly select multiple nodes from the candidate node set as consensus nodes.

An embodiment of the present application also provides a computer device, including a processor and a memory for storing executable instructions of the processor. When the processor executes the instructions, the steps of the consensus node determination method described in any of the foregoing embodiments are implemented. .

An embodiment of the present application also provides a computer-readable storage medium on which computer instructions are stored, which when executed, implement the steps of the consensus node determination method described in any of the foregoing embodiments.

In the embodiment of the present application, a method for determining consensus nodes is provided. According to the selection rate of each of the multiple target nodes, candidate nodes are selected from multiple target nodes to form a candidate node set; Randomly select multiple nodes as consensus nodes to participate in the consensus. In the above method, the candidate node set is determined according to the selection rate of each target node, and then multiple consensus nodes are randomly selected from the candidate node set, so that a limited number of consensus nodes participate in the consensus, which can ensure the consensus performance of the system, thereby improving the system At the same time, because the candidate node set is determined from multiple target nodes according to the selection rate, on the one hand, the candidate nodes in the determined candidate node set are more representative, and on the other hand, a larger consensus node group can be maintained The scale of, effectively avoids the problem of over-centralization; in addition, the security of the blockchain system can be guaranteed by randomly selecting multiple consensus nodes in the candidate nodes. The above solution solves the technical problem of low decentralization in the existing consensus node determination method, and achieves the technical effect of effectively improving the degree of decentralization and improving the security and scalability of the system.

Description of the drawings

The drawings described here are used to provide a further understanding of the application, constitute a part of the application, and do not constitute a limitation to the application. In the attached picture:

FIG. 1 shows a schematic diagram of a method for determining a consensus node in an embodiment of the present application;

Figure 2 shows a flowchart of a method for determining a consensus node in an embodiment of the present application;

FIG. 3 shows a flowchart of a method for determining a consensus node in an embodiment of the present application;

FIG. 4 shows a schematic diagram of a consensus node determining device in an embodiment of the present application;

Fig. 5 shows a schematic diagram of a computer device in an embodiment of the present application.

detailed description

The principle and spirit of the present application will be described below with reference to several exemplary embodiments. It should be understood that these embodiments are only provided to enable those skilled in the art to better understand and then implement the application, but not to limit the scope of the application in any way. On the contrary, these embodiments are provided to make the disclosure of this application more thorough and complete, and to fully convey the scope of the disclosure to those skilled in the art.

Those skilled in the art know that the implementation manners of this application can be implemented as a system, apparatus, method, or computer program product. Therefore, the disclosure of the present application can be specifically implemented in the following forms, namely: complete hardware, complete software (including firmware, resident software, microcode, etc.), or a combination of hardware and software.

Although this application provides method operation steps or device structures as shown in the following embodiments or drawings, the method or device may include more or fewer operation steps or module units based on conventional or no creative labor. . In steps or structures where there is no necessary causal relationship logically, the execution order of these steps or the module structure of the device is not limited to the execution order or module structure shown in the description of the embodiments of this application and the drawings. When the described method or module structure is applied to an actual device or terminal product, it can be executed sequentially or in parallel according to the method or module structure connection shown in the embodiments or drawings (for example, parallel processor or multi-threaded processing Environment, even distributed processing environment).

The embodiment of the application provides a method for determining a consensus node, which can be specifically applied to a blockchain system, in which the selection rate of each target node among multiple target nodes in the blockchain system is first obtained, and then the selection rate of each target node Selection rate of target nodes Select candidate nodes from the multiple target nodes to form a candidate node set, and then randomly select multiple consensus nodes from the set of candidate nodes to participate in the consensus, which can ensure that a limited number of consensus nodes participate in the consensus The consensus performance of the system and the scalability of the system are improved. The security of the system can be ensured by randomly selecting consensus nodes. By determining the candidate node set from multiple target nodes, a large consensus node group can be maintained, effectively avoiding excessive The problem of centralization can effectively improve the degree of decentralization of the blockchain system.

In a specific scenario example, refer to Figure 1. Among them, the target node set in the blockchain system includes multiple target nodes. According to the selection rate of each target node in the target node set, candidate nodes are selected from the multiple target nodes to form a candidate node set, and then randomly selected from the candidate node set Multiple consensus nodes to participate in the next round of consensus process.

Among them, the target node is a blockchain node in the blockchain system that can accept votes from voting nodes. Nodes in the blockchain system can become quasi-target nodes by staking certain tokens or other forms of assets. According to the number of pledged tokens, sort the quasi-target nodes in the blockchain system in descending order; for multiple quasi-target nodes with the same number of pledged tokens, sort the multiple quasi-target nodes twice according to the pledge time; then The quasi-target nodes with a preset number of digits in front are determined as the multiple target nodes to form a target node set. Among them, the preset number of bits can be set according to actual needs. By controlling the number of target nodes in the target node set, the scale of the consensus node group can be controlled, thereby controlling the degree of decentralization of the blockchain system. Among them, voting nodes are nodes in the blockchain that can vote for target nodes. Nodes in the blockchain system can pledge certain tokens or other forms of assets in exchange for votes to become voting nodes.

Fig. 2 shows a flowchart of a method for determining a consensus node in an embodiment of the present application. As shown in Figure 2, the method for determining a consensus node provided by the embodiment of the present application may include the following steps:

Step S201: Obtain the selection rate of each target node among multiple target nodes in the blockchain system.

Among them, the target node is a blockchain node that can accept votes in the blockchain system. In order to select representative nodes from multiple target nodes as candidate nodes, it is necessary to obtain the selection rate of each target node in the multiple target nodes.

In some embodiments of the present application, the selection rate may include at least one of the following: the proportion of the target node selected by the node in the blockchain system, and the proportion of the target node's own share. Among them, the proportion of target nodes selected by nodes in the blockchain system can be characterized by the number of votes the target node obtains from voting nodes in the blockchain system. The proportion of the target node's own share can refer to the number of tokens or other assets pledged by the target node in the contract account.

Step S202: According to the selection rate of each target node among the multiple target nodes, candidate nodes are selected from the multiple target nodes to form a candidate node set.

In order to make the candidate nodes in the formed candidate node set more representative, the candidate nodes may be selected from the multiple target nodes to form the candidate node set according to the selection rate of each of the multiple target nodes.

In some embodiments of the present application, step S202 may specifically include: among the multiple target nodes, nodes whose ratios selected by nodes in the blockchain system are greater than a preset ratio threshold are used as selected nodes to form a selected node set; The selected nodes whose shares in the selected node set meet the preset conditions are regarded as candidate nodes to form a candidate node set.

Specifically, a target node whose number of votes obtained by multiple target nodes is greater than a preset threshold can be used as a selected node to form a selected node set; then the number of tokens pledged by each selected node in the selected node set meets the preset conditions. As candidate nodes, a candidate node set is formed. Through two-layer screening, nodes with a large number of votes and pledged tokens that meet certain conditions can be obtained as a candidate node set, so that the candidate nodes in the candidate node set are more representative and a larger-scale consensus can be maintained The node group effectively improves the degree of decentralization of the blockchain system.

Further, in some embodiments of the present application, the foregoing predetermined condition may include one of the following: exceeding a predetermined proportion threshold and being located in the front predetermined number of digits. Among them, exceeding the predetermined proportion threshold can mean that the number of tokens or other assets pledged by the target node is higher than the preset threshold; the first preset digit can refer to when the number of tokens or other assets pledged by the target node is sorted in descending order , The target node located in the front preset digits. Among them, the specific selection of preset conditions can be determined according to actual needs.

Step S203: randomly select multiple nodes from the set of candidate nodes as consensus nodes.

Specifically, in forming the candidate node set, in order to improve the security of the system, multiple nodes can be randomly selected from the candidate node set as consensus nodes. Among them, multiple consensus nodes can be used to participate in the next round of consensus process to generate multiple blocks. Each of the multiple consensus nodes takes turns as a proposal node to generate a block, and the generated block is verified by other nodes in the multiple consensus nodes, and the block is uploaded to the chain after the verification is passed.

It is understandable that the above method can be used to determine multiple consensus nodes participating in the next round of consensus, and the above steps can be executed when the last block of the current round of consensus is generated to determine the next consensus node. Among them, the block proposal node and the verification node execute the same selection logic (the above steps S201-S203) when producing and verifying the last block of each round according to the same rules, and finally reach a consensus, thereby successfully selecting and participating in the next block. Multiple consensus nodes for a round of consensus. The consensus node for the first round of consensus can be directly set through the genesis block, for example, it can be configured by the configuration file in the genesis block or written directly in the code.

In the above method, the candidate node set is determined according to the selection rate of each target node, and then multiple consensus nodes are randomly selected from the candidate node set, so that a limited number of consensus nodes participate in the consensus, which can ensure the consensus performance of the system, thereby improving the system At the same time, because the candidate node set is determined from multiple target nodes according to the selection rate, on the one hand, the candidate nodes in the determined candidate node set are more representative, and on the other hand, a larger consensus node group can be maintained The scale of, effectively avoids the problem of over-centralization; in addition, the security of the blockchain system can be guaranteed by randomly selecting multiple consensus nodes in the candidate nodes. The above solution solves the technical problem of low decentralization in the existing consensus node determination method, and achieves the technical effect of effectively improving the degree of decentralization and improving the security and scalability of the system.

Further, in some embodiments of the present application, as shown in FIG. 3, randomly selecting multiple nodes from a set of candidate nodes as consensus nodes may include the following steps:

Step S301: Obtain the weight of each candidate node in the candidate node set, where the weight of each candidate node is the total vote age obtained by each candidate node.

Specifically, the weight of the candidate node may be the total vote age of all votes obtained by the candidate node. When a consensus node is randomly selected from the candidate node set, the weight of the candidate node in the candidate node set may be considered.

Step S302: Obtain random seeds of multiple blocks in the blockchain system, where the random seed of the current block is generated according to the VRF algorithm and the random seed of the previous block.

In step S303, a random number is selected for each candidate node in the candidate node set according to the random seeds of multiple blocks and the sorting sequence number of each candidate node in the candidate node set.

Specifically, in order to randomly select consensus nodes from a set of candidate nodes, a random number can be selected for each candidate node to perform a Bernoulli experiment. Among them, each block in the blockchain system has a random seed, and the random seed of the current block is generated according to the VRF algorithm and the random seed of the previous block. Among them, the sorting sequence number of the candidate node refers to the sequence number obtained by sorting the candidate nodes in descending order according to the number of votes obtained by the candidate node and secondly sorting according to the number of tokens or other assets pledged by the candidate node. After obtaining the random seeds of multiple blocks and the sorting sequence number of each candidate node in the candidate node set, a random number can be selected for each candidate node according to the random seed and sorting sequence number.

Step S304: Determine the number of votes for each candidate node in the candidate node set according to the weight and random number of each candidate node.

Step S305: Determine multiple consensus nodes from the set of candidate nodes according to the number of votes each candidate node has been selected.

Among them, the higher the weight of the candidate node, the higher the probability of being selected. Since the weight of the candidate node is the total age of votes obtained by the candidate node, the consensus node can be determined by calculating the number of votes the candidate node has been selected. According to the weight and random number of each candidate node, the number of votes of each candidate node in the candidate node set is selected to ensure the representativeness and randomness of the consensus node.

In the above method, according to the VRF algorithm, multiple nodes are selected from the candidate nodes as consensus nodes according to the weight of the candidate nodes. On the one hand, the randomness of the consensus node selection can be guaranteed, and on the other hand, the random selection according to the weight of the candidate nodes can make the The selected consensus nodes are more representative and can effectively ensure the security of the blockchain system.

In some embodiments of the present application, obtaining the weight of each candidate node in the candidate node set may include determining the weight of each candidate node in the candidate node set according to the following formula:

Among them, w _i is the weight of the i-th candidate node in the candidate node set, that is, the total age of votes obtained by the i-th candidate node, _Ai,k is the age of the _k- th vote obtained by the i-th candidate node, M _i is the total number of votes obtained by the i-th candidate node, and N is the number of candidate nodes in the candidate node set. Among them, _Ai,k = _Hi,k- Li _,k , _Hi,k is the block height at the current moment, Li _,k is the block when the k-th vote of the i-th candidate node is generated height.

In some embodiments of this application, the random seed of the current block is generated according to the VRF algorithm and the random seed of the previous block according to the following formula:

Specifically, each node generates a random seed common public and private key pair (pk _{_i,} sk _i), the private key sk _i local storage for generating a random seed, is disclosed for verifying the public key pk _i generated locally. Among them, the genesis block generates a random number as the initial pseudo-random seed r ₀ . Each common node when a new block is generated according to the stored VRF function and the local private key sk _i is calculated for the block to generate random seed r _i, the function returns a hash value and a proof data π _i, and the hash value proof The data π _i are packed on the new block. The hash value is used as the random seed r _{i of the} current block, and the hash value is determined by the private key sk _i and the random seed of the previous block r _i-1 , and cannot be forged. The proof data π _i can be used by any other consensus node that knows the public key of the consensus node that generated the block to verify that the hash value is indeed generated by the consensus node according to the random seed of the previous block, and the random range of the hash value In [0,2 ^hashlen -1], where hashlen is the upper limit of the number of bits of the hash value generated by the VRF function, generally 2048.

In some embodiments of the present application, according to the random seed and the sequence number of each candidate node in the candidate node set, selecting a random number for each candidate node in the candidate node set may include selecting a random number for each candidate node in the candidate node set according to the following formula: Select a random number for each candidate node:

Among them, i is the sequence number of the candidate node in the candidate node set, R _i is the random number of the i-th candidate node in the candidate node set, r _n is the random seed of the nth block in the blockchain system, and r _ni is The random seed of the nith block in the blockchain system, where n is the block height of the blockchain system, and N is the number of candidate nodes in the candidate node set. Generally, n is the height of the block responsible for selecting the next round of consensus nodes. Choose a random number for each candidate node in the candidate node set for Bernoulli test. The selection rule of random number is: According to the sort number i of the candidate node in the candidate node set, random seeds r _n and r _{ni are selected} to reduce the attack The random number R _i for Bernoulli test is the exclusive OR of two random seeds r _n and r _ni . By selecting random numbers in the above manner, the security of the blockchain system can be further improved.

In some embodiments of the present application, determining the number of vote ages of each candidate node in the candidate node set according to the random number of each candidate node may include: determining the minimum _Ji value satisfying the following inequality as the i-th candidate node Number of vote ages selected:

R _i /2 ^hashlen ≥F _X (J _i +1), i=1,2...N;

Among them, R _i is the random number of the i-th candidate node in the candidate node set, hashlen is the number of bits of the random seed generated according to the VRF algorithm, F _x is the cumulative distribution function, and N is the number of candidate nodes in the candidate node set, where ，F _X (x)=P(X≤x), where,

Is the average of the weights of all candidate nodes in the candidate node set,

Specifically, assuming that the weight of each candidate node is denoted as w _i (i=1, 2...N, the total vote age of each candidate node), then the total weight is

(The total vote age of all candidate nodes), then the probability of the i-th candidate node being selected as a consensus node matches its weight ratio w _i /W. In each round, t consensus nodes are selected from N candidate nodes in the candidate node pool, if the average vote age of all candidate nodes is

Then the probability of each voting age unit being selected is

Random selection of consensus nodes in the candidate node pool is actually a Bernoulli test, so the probability of k selected among the w vote ages of each candidate node follows a binomial distribution

The cumulative distribution function is F _X (x)=P (X≤x). The last block proposal node of each round is responsible for selecting the consensus node for the next round: a random number R _i is selected for each candidate node in the candidate node pool for Bernoulli test. For each candidate node, calculate the inequality R _i /2 ^hashlen ≥F _X (J _i +1), i=1, 2...N according to the binomial distribution cumulative function, and find the minimum J _i value that satisfies the inequality, which means the selected candidate node J _i is a ticket age.

In some embodiments of the present application, determining a plurality of consensus nodes from the candidate node set according to the number of vote ages of each candidate node being selected may include: descending order of the candidate nodes in the candidate node set according to the number of vote ages of the candidate nodes being selected Sorting; for selected multiple candidate nodes with the same number of votes, sort multiple candidate nodes in descending order according to the weight of the candidate nodes; determine the preset number of candidate nodes in the front as multiple consensus nodes participating in the consensus .

After determining the number of votes for each candidate node in the candidate node pool, consensus nodes can be selected from the candidate node pool according to the number of votes. Specifically, the candidate nodes in the candidate node set are sorted in descending order according to the number of vote ages of the candidate nodes being selected; then for multiple candidate nodes with the same vote age selected, the multiple candidate nodes are performed according to the weight of the candidate nodes. Secondary sorting; the candidate nodes ranked in the front preset number are determined as multiple consensus nodes participating in the consensus. Through the above method, the consensus node can be conveniently selected from the candidate node pool according to the number of vote ages selected.

In order to encourage voting nodes in the blockchain system to participate in voting, in each round of consensus, a vote can be randomly selected from the votes obtained by each consensus node, and the selected vote will get a certain incentive. Therefore, in some embodiments of the present application, after determining multiple consensus nodes from the candidate nodes based on the number of votes each candidate node has been selected, it may further include: multiple consensus nodes taking turns as proposed nodes to generate blocks, where When the last block is generated, one vote is randomly selected from the votes obtained by each consensus node as a reward vote to obtain multiple reward votes; for each of the multiple reward votes, the district The node in the blockchain system that casts the reward ballot will be rewarded. Through the above method, the voting nodes in the blockchain system can be encouraged to participate in voting, so that the selected consensus nodes are more representative.

In some embodiments of this application, randomly selecting a reward ballot from the votes obtained by each consensus node may include: for each consensus node, sort all votes obtained by the consensus node according to the voting time; A consensus node determines the age range of each vote according to the age and sorting sequence number of each vote in all the votes obtained by the consensus node; for each consensus node, according to the vote age of the consensus node selected by the vote age In the interval, the ballot corresponding to the voting age interval is determined as the reward ballot. Through the above method, the reward ballots can be randomly selected according to the voting age and the ranking sequence number of each ballot, which is convenient to operate.

Further, in some embodiments of this application, for each consensus node, the vote age range of each vote among all the votes obtained by the consensus node and the sequence number of each vote are determined, which may include: the i-th consensus The age interval of the μth vote of the node is divided into:

Among them, μ is the sequence number of the votes, I _{i, μ} are the age intervals of the μth vote of the i-th consensus node, Ai _,k is the age of the _k- th vote obtained by the i-th candidate node, M _i is the total number of votes obtained by the i-th candidate node, and t is the number of multiple consensus nodes participating in the consensus. For example, for the j-th consensus node, the number of vote ages selected is J _j . When it is determined that the age range of J _j is I _j,ν , then the _νth ticket obtained by the j-th consensus node can be The votes are determined as the reward votes corresponding to the consensus node. Through the above method, the voting age interval can be divided according to the voting age and the sorting sequence number, and then the reward votes corresponding to each node are determined according to the voting age interval and the number of voting ages selected by each consensus node, and rewards for obtaining multiple reward votes .

Generally, when the last block is generated in the current round of consensus, the reward votes corresponding to the consensus nodes participating in the current round of consensus can be determined, and multiple consensus nodes participating in the next round of consensus can be determined.

In addition, in order to encourage consensus nodes participating in the consensus to actively produce blocks, this can be achieved by rewarding block producers. For example, the block producer in the consensus node can get a certain reward for each block. This reward rule is fixed, such as a fixed reward of 5 tokens per block, so that the block is verified by other consensus nodes At this time, in addition to executing the transactions packaged in the block, additional reward rules will be executed, and the transaction execution results and reward results will be compared with the root hash value in the block header. If they are consistent, the block has been verified. After the verification is passed, the reward is given to the account of the block producer.

Similarly, in order to improve the security of the blockchain system, malicious nodes can be punished. Specifically, if a consensus node violates the BFT (Byzantine Fault Tolerance) protocol during the consensus process, such as not producing a block in its own block generation round, packing at the same block height or confirming that different blocks cause a fork, it will be triggered In addition to being eliminated from the candidate node set and target node set, the tokens pledged to the contract account also need to be deducted. The execution method of the penalty and reward is the same, but the penalty is packaged in the first block of the next round of consensus, and all consensus nodes will punish the first block of the next round of consensus verification. By rewarding or punishing consensus nodes, the security and system reliability of the blockchain system can be improved.

The above method will be described below in conjunction with a specific embodiment. However, it is worth noting that this specific embodiment is only for better describing the application, and does not constitute an improper limitation of the application.

Specifically, the method for determining consensus nodes in this embodiment can be called PPoS (Probabilistic Proof of Stake). Based on DPOS and VRF algorithms, a limited number of consensuses are randomly selected based on the weight of the candidate node pool with a controllable scale. node. Specifically, the consensus node that generates the last block in each round of consensus process randomly selects t nodes from the candidate node pool according to the weight of the candidate node as the consensus nodes participating in the next round of consensus, and is responsible for the next round of block packaging , Can include the following steps:

Step 1. Obtain the number of votes and pledge amount obtained by each target node among multiple target nodes in the blockchain system;

Step 2: Take the node whose number of votes obtained by the node in the blockchain system from the multiple target nodes is greater than the preset threshold as the selected node to form the selected node set;

Step 3: Sort the selected nodes in descending order according to the pledge deposit amount of each selected node in the selected node set. In multiple selected nodes with the same pledge deposit amount, perform a secondary sorting according to the pledge time of each selected node, and rank in the front preset number The selected nodes of are determined as candidate nodes to form a candidate node set;

Step 4. Determine the weight of each candidate node in the candidate node set according to the following formula:

Among them, w _i is the weight of the i-th candidate node in the candidate node set, A _i,k is the age of the k- _th vote obtained by the i-th candidate node, and Mi is the total number of votes obtained by the i-th candidate node Number, N is the number of candidate nodes in the candidate node set;

Step 5: Obtain random seeds of multiple blocks in the blockchain system. Among them, the genesis block randomly generates a random number as the random seed r _{0 of the} genesis block. The random seed of the current block is based on the VRF algorithm and The random seed of the previous block is generated according to the following formula:

Wherein, r _i and π _i are the current block and random seed data demonstrate, r _i-1 is a random seed block before the current block, sk _i of the current block to generate a private key, VRF function VRF algorithm, n is the block height of the blockchain system;

Step 6. Select a random number for each candidate node in the candidate node set according to the following formula:

Among them, i is the sequence number of the candidate node in the candidate node set, R _i is the random number of the i-th candidate node in the candidate node set, r _n is the random seed of the nth block in the blockchain system, and r _ni is The random seed of the nith block in the blockchain system, where n is the block height of the blockchain system, and N is the number of candidate nodes in the candidate node set;

Step 7. Determine the minimum _Ji value that satisfies the following inequality as the number of votes of the i-th candidate node:

R _i /2 ^hashlen ≥F _X (J _i +1), i=1,2...N;

Is the average of the weights of all candidate nodes in the candidate node set,

Is the total weight of all candidate nodes in the candidate node set, where w _i is the weight of the i-th candidate node in the candidate node set;

Step 8. Sort the candidate nodes in the candidate node set in descending order according to the number of vote ages J _i of the candidate nodes are selected; for multiple candidate nodes with the same number of vote ages selected, perform multiple candidate nodes according to their weight Sort in descending order; determine the top t candidate nodes as multiple consensus nodes participating in the consensus;

Step 9. The other consensus nodes in this round of consensus are responsible for verifying the results of the nodes selected when the last block is generated to participate in the next round of consensus nodes, which can include the following steps: use the consensus node that generated the last block The public key performs VRF verification on the random seed r _n and proof data π _n of the block; select t candidate nodes according to the same logic as the consensus node that generated the last block, and compare and verify the consensus nodes participating in the next round of consensus Whether the selection result is correct.

The method for determining the consensus node in the PPoS consensus algorithm in the foregoing embodiment is based on the DPOS and VRF algorithm to randomly extract a limited number of consensus nodes from a controllable candidate node pool according to weights. The candidate node set is determined according to the number of votes of each target node and the amount of pledge deposit, and then multiple consensus nodes are randomly selected in the candidate node set according to the VRF algorithm and the weight of the candidate nodes, so that a limited number of consensus nodes participate in the consensus, which can ensure the system Consensus performance, thereby improving the scalability of the system; at the same time, because the candidate node set is determined from multiple target nodes according to the number of votes and the pledge amount, on the one hand, the candidate nodes in the determined candidate node set are more representative, on the other hand A large consensus node group can be maintained, effectively avoiding the problem of over-centralization; in addition, the VRF algorithm is used to randomly select multiple consensus nodes in the candidate node set to ensure the security of the blockchain system.

Based on the same inventive concept, an apparatus for determining a consensus node is also provided in an embodiment of the present application, as described in the following embodiment. Since the principle of the consensus node determination device to solve the problem is similar to the consensus node determination method, the implementation of the consensus node determination device can refer to the implementation of the consensus node determination method, and the repetition will not be repeated. As used below, the term "unit" or "module" can be a combination of software and/or hardware that implements predetermined functions. Although the devices described in the following embodiments are preferably implemented by software, hardware or a combination of software and hardware is also possible and conceived. Fig. 4 is a structural block diagram of the consensus node determining apparatus according to an embodiment of the present application. As shown in Fig. 4, it may include: an acquisition module 401, a selection module 402, and a random selection module 403. The structure is described below.

The obtaining module 401 is used to obtain the selection rate of each target node among multiple target nodes in the blockchain system.

The selection module 402 is configured to select candidate nodes from the plurality of target nodes to form a candidate node set according to the selection rate of each target node in the plurality of target nodes.

The random selection module 403 is used to randomly select multiple nodes from a set of candidate nodes as consensus nodes.

In some embodiments of the present application, the selection rate may include at least one of the following: the proportion of the target node selected by the node in the blockchain system, and the proportion of the target node's own share.

In some embodiments of the present application, the selection module 402 may be specifically configured to: among multiple target nodes, nodes whose ratios selected by nodes in the blockchain system are greater than a preset ratio threshold are used as selected nodes to form a selected node set ; The selected nodes whose shares in the selected node set meet the preset conditions are used as candidate nodes to form a candidate node set.

In some embodiments of the present application, the preset condition may include one of the following: exceeding a preset proportion threshold and being located in the front preset digits.

In some embodiments of the present application, the random selection module 403 may be specifically used to: obtain the weight of each candidate node in the candidate node set, where the weight of each candidate node is the total vote age obtained by each candidate node; The random seed of multiple blocks in the blockchain system, where the random seed of the current block is generated according to the VRF algorithm and the random seed of the previous block; each candidate is set according to the random seed of multiple blocks and candidate nodes The sorting sequence number of the node, a random number is selected for each candidate node in the candidate node set; the weight of each candidate node and the random number are used to determine the number of votes for each candidate node in the candidate node set; according to each candidate node The number of selected votes determines multiple consensus nodes from the set of candidate nodes.

In some embodiments of this application, selecting a random number for each candidate node in the candidate node set according to the random seeds of multiple blocks and the sorting sequence number of each candidate node in the candidate node set may include selecting a random number as a candidate according to the following formula Each candidate node in the node set selects a random number:

In some embodiments of the present application, determining the number of votes for each candidate node in the candidate node set according to the weight and random number of each candidate node may include: determining the minimum _Ji value that satisfies the following inequality as the i-th The number of votes the candidate node has been selected:

R _i /2 ^hashlen ≥F _X (J _i +1), i=1,2...N;

Is the average of the weights of all candidate nodes in the candidate node set,

In some embodiments of the present application, after determining multiple consensus nodes from the candidate node set according to the number of votes each candidate node has been selected, it may further include: multiple consensus nodes taking turns as proposed nodes to generate blocks, where When the last block is generated, one vote is randomly selected from the votes obtained by each consensus node as the reward vote to obtain multiple reward votes; for each of the multiple reward votes, the blockchain The node in the system that casts the reward ballot will be rewarded.

In some embodiments of this application, randomly selecting a reward ballot from the votes obtained by each consensus node may include: for each consensus node, sort all votes obtained by the consensus node according to the voting time; A consensus node determines the age range of each vote according to the age and sorting sequence number of each vote in all the votes obtained by the consensus node; for each consensus node, according to the vote age of the consensus node selected by the vote age In the interval, the ballot corresponding to the voting age interval is determined as the reward ballot.

In some embodiments of the present application, for each consensus node, the vote age interval of each vote among all the votes obtained by the consensus node and the sorting sequence number are determined, which may include: the ith consensus node The age range of μ votes is divided into:

From the above description, it can be seen that the embodiments of this application achieve the following technical effects: the candidate node set is determined according to the selection rate of each target node, and then multiple consensus nodes are randomly selected from the candidate node set, making the number limited Participation of consensus nodes in the consensus can ensure the consensus performance of the system, thereby improving the scalability of the system; at the same time, since the candidate node set is determined from multiple target nodes according to the selection rate, on the one hand, the candidate node in the determined candidate node set It is more representative. On the other hand, it can maintain a large consensus node group scale, which effectively avoids the problem of over-centralization; in addition, by randomly selecting multiple consensus nodes in the candidate node set, the blockchain system can be guaranteed safety. The above solution solves the technical problem of low decentralization in the existing consensus node determination method, and achieves the technical effect of effectively improving the degree of decentralization and improving the security and scalability of the system.

The embodiment of the present application also provides a computer device. For details, please refer to the schematic diagram of the structure of the computer device based on the consensus node determination method provided by the embodiment of the present application shown in FIG. 5. The computer device may specifically include an input device 51, processing器52, memory 53. Wherein, the memory 53 is used to store processor executable instructions. The processor 52 implements the steps of the consensus node determination method described in any of the foregoing embodiments when executing the instructions.

In this embodiment, the input device may specifically be one of the main devices for information exchange between the user and the computer system. The input device may include a keyboard, a mouse, a camera, a scanner, a light pen, a handwriting input board, a voice input device, etc.; the input device is used to input raw data and programs for processing these numbers into the computer. The input device can also obtain and receive data transmitted from other modules, units, and devices. The processor can be implemented in any suitable way. For example, the processor may take the form of a microprocessor or a processor and a computer-readable medium, logic gates, switches, application specific integrated circuits that store computer-readable program codes (such as software or firmware) executable by the (micro)processor ( Application Specific Integrated Circuit (ASIC), programmable logic controller and embedded microcontroller form, etc. The memory may specifically be a memory device used to store information in modern information technology. The memory can include multiple levels. In a digital system, as long as it can store binary data, it can be a memory; in an integrated circuit, a circuit with a storage function without a physical form is also called a memory, such as RAM, FIFO, etc.; In the system, storage devices in physical form are also called memory, such as memory sticks, TF cards, etc.

In this embodiment, the specific functions and effects implemented by the computer device can be explained in comparison with other embodiments, and will not be repeated here.

The embodiment of the present application also provides a computer storage medium based on a consensus node determination method, the computer storage medium stores computer program instructions, and when the computer program instructions are executed, the consensus node in any of the above embodiments is realized Determine the steps of the method.

In this embodiment, the above-mentioned storage medium includes but is not limited to random access memory (Random Access Memory, RAM), read-only memory (Read-Only Memory, ROM), cache (Cache), hard disk (Hard Disk Drive, HDD) Or memory card (Memory Card). The memory can be used to store computer program instructions. The network communication unit may be set up in accordance with the standards stipulated by the communication protocol, and is an interface used for network connection communication.

In this embodiment, the specific functions and effects realized by the program instructions stored in the computer storage medium can be explained in comparison with other embodiments, and will not be repeated here.

Obviously, those skilled in the art should understand that the modules or steps of the above-mentioned embodiments of the application can be implemented by a general computing device, and they can be concentrated on a single computing device or distributed among multiple computing devices. Optionally, they can be implemented with program codes executable by a computing device, so that they can be stored in a storage device for execution by the computing device, and in some cases, can be different from here The steps shown or described are executed in the order of, or they are respectively fabricated into individual integrated circuit modules, or multiple modules or steps of them are fabricated into a single integrated circuit module to achieve. In this way, the embodiments of the present application are not limited to any specific hardware and software combination.

It should be understood that the above description is for illustration and not for limitation. By reading the above description, many implementations and many applications beyond the examples provided will be apparent to those skilled in the art. Therefore, the scope of this application should not be determined with reference to the above description, but should be determined with reference to the foregoing claims and the full range of equivalents possessed by these claims.

The foregoing descriptions are only preferred embodiments of the present application, and are not intended to limit the present application. For those skilled in the art, the embodiments of the present application may have various modifications and changes. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of this application shall be included in the protection scope of this application.

Claims

A method for determining consensus nodes is characterized in that it includes:

Obtain the selection rate of each target node among multiple target nodes in the blockchain system;

Selecting candidate nodes from the plurality of target nodes according to the selection rate of each target node in the plurality of target nodes to form a candidate node set;

A plurality of nodes are randomly selected from the set of candidate nodes as consensus nodes.
The method according to claim 1, wherein the selection rate comprises at least one of the following: the proportion of the target node selected by the node in the blockchain system, and the proportion of the target node's own share.
The method according to claim 2, characterized in that, according to the selection rate of each of the multiple target nodes, selecting candidate nodes from the multiple target nodes to form a candidate node set comprises:

Taking a node whose ratio selected by nodes in the blockchain system among the plurality of target nodes is greater than a preset ratio threshold as a selected node to form a selected node set;

The selected nodes whose share in the selected node set satisfies preset conditions are used as candidate nodes to form a candidate node set.
The method according to claim 3, wherein the preset condition comprises one of the following: exceeding a preset proportion threshold and being located in the front preset number of digits.
The method according to claim 1, wherein randomly selecting multiple nodes from the set of candidate nodes as consensus nodes comprises:

Acquiring the weight of each candidate node in the candidate node set, where the weight of each candidate node is the total vote age obtained by each candidate node;

Obtaining random seeds of multiple blocks in the blockchain system, where the random seed of the current block is generated according to the VRF algorithm and the random seed of the previous block;

Selecting a random number for each candidate node in the candidate node set according to the random seeds of the multiple blocks and the ranking sequence number of each candidate node in the candidate node set;

Determining the number of vote ages of each candidate node in the candidate node set according to the weight and random number of each candidate node;

The multiple consensus nodes are determined from the candidate node set according to the number of votes each candidate node is selected.
The method according to claim 5, wherein obtaining the weight of each candidate node in the candidate node set comprises determining the weight of each candidate node in the candidate node set according to the following formula:

Among them, w i is the weight of the i-th candidate node in the set of candidate nodes, A i,k is the age of the k- th vote obtained by the i-th candidate node, and M i is the number of votes obtained by the i-th candidate node The total number of sheets, where N is the number of candidate nodes in the candidate node set.
The method according to claim 5, wherein the random seed of the current block is generated according to the VRF algorithm and the random seed of the previous block according to the following formula:

Among them, r i and π i are the random seed and proof data of the current block, respectively, r i-1 is the random seed of the previous block of the current block, sk i is the private key for generating the current block, VRF The function is the VRF algorithm, and n is the block height of the blockchain system.
The method according to claim 5, characterized in that, according to the random seeds of the multiple blocks and the sorting sequence number of each candidate node in the candidate node set, each candidate node in the candidate node set is selected A random number includes selecting a random number for each candidate node in the candidate node set according to the following formula:

Where i is the sorting sequence number of the candidate node in the candidate node set, R i is the random number of the i-th candidate node in the candidate node set, and r n is the random seed of the n-th block in the blockchain system , R ni is the random seed of the nith block in the blockchain system, where n is the block height of the blockchain system, and N is the number of candidate nodes in the candidate node set.
The method according to claim 5, wherein determining the number of votes of each candidate node in the candidate node set according to the weight and random number of each candidate node comprises:

Determine the minimum Ji value that satisfies the following inequality as the number of votes of the i-th candidate node:

R i /2 hashlen ≥F X (J i +1), i=1,2...N;

Where R i is the random number of the i-th candidate node in the candidate node set, hashlen is the number of bits of the random seed generated according to the VRF algorithm, F x is the cumulative distribution function, and N is the number of the candidate node in the candidate node set. Number, where F X (x) = P ( X ≤ x), where,
Indicates the probability that the number of votes of the i-th candidate node in the candidate node set is k, where,
Among them, t is the number of multiple consensus nodes participating in the consensus,
Is the average of the weights of all candidate nodes in the candidate node set,
Is the total weight of all candidate nodes in the candidate node set, where w i is the weight of the i-th candidate node in the candidate node set.
The method according to claim 5, wherein the determining the plurality of consensus nodes from the set of candidate nodes according to the number of votes each candidate node has been selected comprises:

Sorting the candidate nodes in the candidate node set in descending order according to the number of votes of the candidate nodes being selected;

For selected multiple candidate nodes with the same vote age, sort the multiple candidate nodes in descending order according to the weight of the candidate nodes;

The candidate nodes ranked in the front preset number are determined as multiple consensus nodes participating in the consensus.
The method according to claim 5, characterized in that, after determining the plurality of consensus nodes from the set of candidate nodes according to the number of votes each candidate node has been selected, the method further comprises:

The multiple consensus nodes take turns as proposal nodes to generate blocks;

Among them, when the last block is generated, one vote is randomly selected from the votes obtained by each consensus node as a reward vote to obtain multiple reward votes;

For each of the multiple reward votes, the node that casts the reward vote in the blockchain system is rewarded.
The method according to claim 11, characterized in that randomly selecting a reward ballot among the ballots obtained by each consensus node, respectively, comprises:

For each consensus node, sort all votes obtained by the consensus node according to voting time;

For each consensus node, determine the vote age range of each vote according to the vote age and sort sequence number of all votes obtained by the consensus node;

For each consensus node, the vote corresponding to the vote age range is determined as the reward vote according to the vote age range in which the vote age number of the consensus node is selected.
The method according to claim 12, characterized in that, for each consensus node, determining the vote age range of each vote according to the vote age and sorting sequence number of each vote among all the votes obtained by the consensus node includes:

Divide the age range of the μth vote of the i-th consensus node into:

Among them, μ is the sequence number of the votes, I i, μ are the age intervals of the μth vote of the i-th consensus node, Ai ,k is the age of the k- th vote obtained by the i-th candidate node, M i is the total number of votes obtained by the i-th candidate node, and t is the number of multiple consensus nodes participating in the consensus.
A device for determining a consensus node is characterized in that it comprises:

The obtaining module is used to obtain the selection rate of each target node among multiple target nodes in the blockchain system;

The selection module is configured to select candidate nodes from the plurality of target nodes to form a candidate node set according to the selection rate of each target node in the plurality of target nodes;

The random selection module is used to randomly select multiple nodes from the candidate node set as consensus nodes.
A computer device comprising a processor and a memory for storing executable instructions of the processor, and the processor implements the steps of the method according to any one of claims 1 to 13 when executing the instructions.
A computer-readable storage medium having computer instructions stored thereon, which implement the steps of the method described in any one of claims 1 to 13 when the instructions are executed.