CN112600682B - Block chain consensus method and device based on delegation interest certification algorithm - Google Patents
Block chain consensus method and device based on delegation interest certification algorithm Download PDFInfo
- Publication number
- CN112600682B CN112600682B CN202011425792.9A CN202011425792A CN112600682B CN 112600682 B CN112600682 B CN 112600682B CN 202011425792 A CN202011425792 A CN 202011425792A CN 112600682 B CN112600682 B CN 112600682B
- Authority
- CN
- China
- Prior art keywords
- witness
- node
- nodes
- vote
- votes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computing arrangements using knowledge-based models
- G06N5/04—Inference or reasoning models
- G06N5/042—Backward inferencing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Theoretical Computer Science (AREA)
- Evolutionary Computation (AREA)
- Data Mining & Analysis (AREA)
- Computational Linguistics (AREA)
- Physics & Mathematics (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Artificial Intelligence (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a block chain consensus method and a block chain consensus device based on a delegation interest certification algorithm, and relates to the field of block chains, wherein the block chain consensus method comprises the following steps: voting by each witness node in the witness nodes according to the votes of the witness nodes and the received votes, and selecting a plurality of entrusted nodes; the node participating in the voting consensus issues voting incentive after the validity of the votes is determined; and generating a block at any one of the plurality of entrusted nodes, and issuing an accounting incentive to the witness node which votes to the corresponding entrusted node and is effective after the blocks are identified successfully. The invention reduces the importance of the coin age, can quicken the elimination of wrong witness nodes, issues voting incentive to effective witness nodes for vote and improves the participation degree of the witness nodes. After the block consensus is completed, the accounting incentive is issued to the witness node with the vote being effective, so that the block chain system centralization trend is avoided, and the method has high practicability.
Description
Technical Field
The invention relates to the field of block chains, in particular to a block chain consensus method and device based on a delegation interest certification algorithm.
Background
The blockchain technique is a recording technique with decentralization formed by a combination of a plurality of existing techniques (P2P network, cryptography, etc.). Currently, there is no uniform definition of the blockchain, and the definition of the blockchain in wikipedia is as follows: the blockchain (bolckchain) is a peer-to-peer network for discriminating, transmitting and recording information by using a distributed database, in short, the blockchain is essentially a distributed database with decentralized characteristics, the blockchain technology is essentially a distributed database technology, and nodes in the network maintain the consistency and integrity of the data of the whole network together by using technologies such as cryptography, consensus algorithm, point-to-point communication and the like.
The algorithms for realizing common knowledge of block chains at present mainly include workload Proof (Proof of Work, PoW), equity Proof (Proof of Stack, PoS), and delegation equity Proof (DPoS). The DPoS algorithm is different from the PoS algorithm in that the money age of each witness node does not need to be counted for sorting operation any more, but each witness node puts the money age of each witness node as a vote to a trusted entrusted node, and a block chain system selects nodes with the highest rank from the entrusted nodes to finish accounting in turn.
The DPoS algorithm selects a plurality of entrusted nodes for alternative accounting through each round of voting, and therefore consensus efficiency of the block chain system is greatly improved. It also has some problems: the witness nodes in the whole system have low participation degree, and the participation in voting and consensus require the consumption of some resources; secondly, because the money age is used as a vote, when the wrong witness node is found, the wrong witness node cannot be removed quickly; in addition, the DPoS algorithm only issues the entrusted nodes when issuing the accounting stimulus after accounting, but not the witness nodes voting, so that the centralization trend of the block chain system is aggravated in the long term.
Disclosure of Invention
In view of the above problems, the present invention provides a block chain consensus method and apparatus based on a delegation rights and interests certification algorithm, which improves the participation of witness nodes in a block chain system, and at the same time, can accelerate the elimination of wrong witness nodes, and avoid issuing accounting incentives only to trusted nodes, on the premise of ensuring the security of the block chain system.
The embodiment of the invention provides a block chain consensus method based on a delegation interest certification algorithm, wherein the block chain system comprises: a plurality of witness nodes; the method comprises the following steps:
each witness node in the witness nodes votes according to the votes of the witness node and the received votes so as to select a plurality of entrusted nodes from the witness nodes;
issuing a voting incentive to the witness node that is valid for the votes voted on the plurality of trusted nodes;
generating a block at any trusted node in the plurality of trusted nodes, and issuing an accounting incentive to the witness node which is effective in votes voted to the plurality of trusted nodes after the generated blocks are identified successfully;
wherein the ballot includes: the currency age of the witness node, the deposit of the witness node and historical consensus information of the witness node, wherein the historical consensus information comprises: and the witness nodes participate in successful consensus times and failed consensus times.
Optionally, each witness node in the plurality of witness nodes votes according to its vote and the received vote to select a plurality of trusted nodes in the plurality of witness nodes, including:
each witness node calculates to obtain a vote according to the age of the coin, the deposit and the historical consensus information of the witness node, and broadcasts the vote to other witness nodes;
each witness node sorts the votes according to the received votes of other witness nodes and the votes of the witness node and the numerical value of the votes;
each witness node selects a witness node corresponding to the highest vote value as a candidate node within a preset time, throws the vote of the witness node to the candidate node, and broadcasts the information of the candidate node;
checking and counting votes of each candidate node in all the candidate nodes, and sequencing the votes according to the numerical value of the votes which are checked correctly;
and selecting a first preset number of candidate nodes in the top sequence as the plurality of entrusted nodes.
Optionally, the witness node issuing voting incentives that are valid for votes cast to the plurality of trusted nodes, comprising:
the method for issuing voting incentive aiming at witness nodes with effective votes in each entrusted node specifically comprises the following steps:
calculating the sum of the guarantee funds of witness nodes with effective votes in the entrusted node;
calculating the respective occupation ratio of the deposit of each witness node in the entrusted node, wherein the vote of each witness node is effective;
and calculating the voting incentive of the witness node with each vote effective according to the respective proportion of the deposit of the witness node with each vote effective and the historical consensus information of the witness node with each vote effective.
Optionally, after a block is generated by any one of the plurality of entrusted nodes and the generated blocks are successfully identified, issuing an accounting incentive to the witness node that is effective in the vote voted to the entrusted node, includes:
generating a block at any trusted node in the plurality of trusted nodes, and issuing total accounting excitation after the block is successfully identified;
determining a right index corresponding to a witness node which is effective in each vote based on a Banzhaf right index in a game theory;
and calculating to obtain the accounting incentive which is due by the witness node which is effective in each vote according to the right index which is corresponding to the witness node which is effective in each vote and the total accounting incentive.
Optionally, the method further comprises:
each of the plurality of entrusted nodes needs to generate a second preset number of blocks;
after each entrusted node generates a second preset number of blocks, executing the following steps: each witness node in the plurality of witness nodes votes according to votes received by the witness node to select a plurality of entrusted nodes from the plurality of witness nodes.
Optionally, after each witness node sorts the votes according to the received votes of other witness nodes and the votes of the witness node, according to the numerical value of the votes, the method further includes:
and if the first witness node in the witness nodes does not select the witness node corresponding to the highest vote value as a candidate node within the preset time, casting the vote of the first witness node to the candidate node, and broadcasting the information of the candidate node, judging that the voting of the first witness node is invalid, and penalizing the security fund of the first witness node.
Optionally, the checking and counting votes of each candidate node in all the candidate nodes, and sorting the votes according to the numerical value of the votes which are checked correctly, includes:
checking each vote of each candidate node in all the candidate nodes;
counting the numerical value of the votes which are correctly verified, and sequencing the votes according to the numerical value of the votes which are correctly verified;
after checking each vote of each candidate node in all the candidate nodes, the method further comprises the following steps:
for votes that are checked for being incorrect, it is determined that the vote for the witness node issuing the vote is invalid and the deposit for the witness node that did not issue the vote is penalized.
Optionally, each witness node calculates to obtain its vote according to its own coin age, deposit and historical consensus information, and broadcasts its vote to the other witness nodes, including:
each witness node calculates the product of the currency age of the witness node and the first weight to obtain the corrected currency age;
each witness node calculates the product of the own deposit and the second weight to obtain a corrected deposit;
each witness node calculates the product of the historical consensus information of the witness node and the third weight to obtain corrected historical consensus information;
each witness node calculates the sum of the corrected coin age, the corrected deposit and the corrected historical consensus information to obtain a vote of the witness node, and broadcasts the vote to other witness nodes;
the value of the historical consensus information of each witness node is increased along with the increase of the number of successful consensus participation times and is decreased along with the increase of the number of failed consensus participation times.
The embodiment of the invention also provides a block chain consensus device based on the delegation interest certification algorithm, and the block chain system comprises: a plurality of witness nodes; the device comprises:
a elected trusted node module for voting by each witness node of the witness nodes according to votes received by the witness node to elect a plurality of trusted nodes among the witness nodes;
the voting incentive issuing module is used for issuing voting incentive to the witness node which is effective in voting for the plurality of trustees nodes;
the issuing and accounting excitation module is used for generating a block at any one of the plurality of entrusted nodes, and issuing accounting excitation to the witness node which is effective in votes voted to the plurality of entrusted nodes after the generated blocks are identified successfully;
wherein the ballot includes: the currency age of the witness node, the deposit of the witness node and historical consensus information of the witness node, wherein the historical consensus information comprises: and the witness nodes participate in successful consensus times and failed consensus times.
Optionally, the elected entrusted node module includes:
the calculating vote unit is used for calculating and obtaining votes of each witness node according to the age of the money of each witness node, the deposit and the historical consensus information, and broadcasting the votes to other witness nodes;
the vote sorting unit is used for sorting each witness node according to the received votes of other witness nodes and the votes of the witness node per se within the preset time according to the numerical value of the votes;
a candidate node casting unit, which is used for each witness node to select the witness node corresponding to the highest vote value as a candidate node, casting the vote of the witness node to the candidate node, and broadcasting the information of the candidate node;
the checking and counting sorting unit is used for checking and counting votes of each candidate node in all the candidate nodes and sorting the votes according to the numerical value of the votes which are checked correctly;
and the selected entrusted node unit is used for selecting a first preset number of candidate nodes in the top sequence as the plurality of entrusted nodes.
Optionally, the voting incentive issuing module is configured to issue voting incentives to witness nodes in which votes in each entrusted node are valid, and specifically includes:
a total sum calculating unit used for calculating the total sum of the guarantee funds of the witness nodes with effective votes in the entrusted node;
the calculating proportion unit is used for calculating the respective proportion of the deposit of the witness node which is effective in each vote in the entrusted node;
and the voting incentive calculation unit is used for calculating and obtaining the voting incentive of the witness node with each vote according to the respective proportion of the deposit of the witness node with each vote being effective and the historical consensus information of the witness node with each vote being effective.
Optionally, the issuing of the billing incentive module comprises:
a total issuing incentive unit, configured to generate a block at any trusted node of the plurality of trusted nodes, and issue a total accounting incentive after the block is successfully identified;
the right index determining unit is used for determining a right index corresponding to the witness node for each vote based on the Banzhaf right index in the game theory;
and the calculation accounting excitation unit is used for calculating and obtaining the accounting excitation which is obtained by the witness node which is effective in each vote according to the right index which corresponds to the witness node which is effective in each vote and the total accounting excitation.
Optionally, the check statistic ordering unit is specifically configured to:
checking each vote of each candidate node in all the candidate nodes;
counting the numerical value of the votes which are correctly verified, and sequencing the votes according to the numerical value of the votes which are correctly verified;
for votes that are checked for being incorrect, it is determined that the vote for the witness node issuing the vote is invalid and the deposit for the witness node that did not issue the vote is penalized.
Optionally, the vote calculating unit is specifically configured to:
each witness node calculates the product of the currency age of the witness node and the first weight to obtain the corrected currency age;
each witness node calculates the product of the own deposit and the second weight to obtain a corrected deposit;
each witness node calculates the product of the historical consensus information of the witness node and the third weight to obtain corrected historical consensus information;
each witness node calculates the sum of the corrected coin age, the corrected deposit and the corrected historical consensus information to obtain a vote of the witness node, and broadcasts the vote to other witness nodes;
the value of the historical consensus information of each witness node is increased along with the increase of the number of successful consensus participation times and is decreased along with the increase of the number of failed consensus participation times.
According to the block chain consensus method and device based on the delegation rights and interests certification algorithm, a plurality of entrusted nodes are selected, and then voting incentive is issued to witness nodes with effective votes, so that participation of the witness nodes is facilitated. The vote is not only based on the condition of the age of the coin, but also adds the guarantee fund and the historical consensus information, thereby reducing the importance of the age of the coin and being beneficial to accelerating the elimination of the wrong witness node. In addition, after the block consensus is completed, the accounting stimulus is issued to the witness node with the vote being effective, the accounting stimulus is not issued only to the trusted node any more, the block chain system centralization trend is avoided, the problem of the existing DPoS algorithm is solved, and the method has high practicability.
Drawings
Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the invention. Also, like reference numerals are used to refer to like parts throughout the drawings. In the drawings:
FIG. 1 is a flow chart of a block chain consensus method based on a delegation interest certification algorithm according to an embodiment of the present invention;
FIG. 2 is a block diagram of a blockchain consensus device based on the delegation interest certification algorithm according to an embodiment of the present invention;
FIG. 3 is a comparison of the results of a normal witness node for 50 rounds of voting in an embodiment of the invention;
FIG. 4 is a graph of the number of votes cast by 50 rounds of consensus witness nodes in an embodiment of the invention;
fig. 5 is a time delay graph of 50 rounds of consensus in the embodiment of the present invention.
Detailed Description
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in further detail below. It should be understood that the specific embodiments described herein are merely illustrative of the invention, but do not limit the invention to only some, but not all embodiments.
The block chain consensus method provided by the embodiment of the present invention is improved on the current DPoS algorithm, and referring to fig. 1, a flowchart of the block chain consensus method based on the delegation rights and interests certification algorithm according to the embodiment of the present invention is shown, where the block chain includes: a plurality of witness nodes; the block chain consensus method based on the delegation interest certification algorithm comprises the following steps:
step 101: each witness node in the plurality of witness nodes votes according to votes received by the witness node to select a plurality of trusted nodes from the plurality of witness nodes.
In the embodiment of the invention, a plurality of witness nodes are arranged in a block chain, each witness node needs to vote according to own votes and received votes, and a plurality of entrusted nodes are selected from the witness nodes according to the voting result. Wherein, the vote includes: the money age of the witness node, the deposit of the witness node, and the historical consensus information of the witness node, the historical consensus information including: and the witness nodes participate in successful consensus times and failed consensus times. In the number of times of consensus of all the blockchains in which any witness node participates, there always exist consensus of successful participation and consensus of failed participation, and the witness node which participates in the consensus failure is generally considered to be an error node. If the number of successful consensus participation of a certain witness node is more than or far more than the number of failed consensus, the witness node is a correct witness node, and naturally, if the number of successful consensus participation of a certain witness node is equal to or less than the number of failed consensus, the witness node is a wrong witness node.
For vote, each witness node needs to calculate by itself, and the specific calculation method comprises the following steps:
step S1: each witness node calculates the product of the currency age of the witness node and the first weight to obtain the corrected currency age;
step S2: each witness node calculates the product of the own deposit and the second weight to obtain a corrected deposit;
step S3: and each witness node calculates the product of the historical consensus information of the witness node and the third weight to obtain corrected historical consensus information.
In the embodiment of the invention, the guarantee fund and the historical consensus information are additionally introduced, so that respective weights are respectively set for the coin age, the guarantee fund and the historical consensus information, and the problem that the witness nodes with higher coin ages cannot be removed when being malicious nodes is solved, so that the dependence of the votes on the single factor of the coin age is reduced. The deposit can be used as an endorsement of witness node vote, so that the credibility of vote is increased, and the cost of cheating of the witness node is increased. The more successful consensus times the witness node participates in indicates that the voting of the witness node is more credible, so the historical consensus information can further increase the credibility of the votes.
Based on the consideration, different weights are respectively set for the coin age, the deposit and the historical consensus information, and during calculation, the witness node calculates the product of the coin age and the first weight to obtain the corrected coin age; calculating the product of the self deposit and the second weight to obtain a corrected deposit; and calculating the product of the historical consensus information of the user and the third weight to obtain the corrected historical consensus information.
Step S4: each witness node calculates the sum of the corrected coin age, the corrected deposit and the corrected historical consensus information to obtain a self vote, and broadcasts the self vote to the other witness nodes.
The value of the historical consensus information of each witness node is increased along with the increase of the number of successful consensus participation times and is decreased along with the increase of the number of failed consensus participation times.
In the embodiment of the invention, after each witness node calculates and obtains the respective corrected coin age, the corrected deposit and the corrected historical consensus information, the sum of the three is obtained, the vote of the witness node can be obtained, and the vote of the witness node is broadcasted to other witness nodes after the vote is obtained. Of course, it will also receive the respective votes broadcast by the other witness nodes.
Assuming a first weight of 0.4, a second weight of 0.2, and a third weight of 0.4, the votes for each witness node are: vote 0.4 dollar age +0.2 warranty gold +0.4 historical consensus information.
Aiming at historical consensus information, in order to accelerate the elimination of the victims nodes, the weights of the witness nodes need to be timely reduced, and the long-term too low voting weight caused by the influence of the number of times of failure consensus on the witness nodes needs to be prevented. Therefore, when statistical historical consensus information can be set, a consensus record set to several successes can offset a failed consensus record, such as: setting 2 successful consensus records may offset 1 failed consensus record. When the successful consensus times are less than twice of the failure times, the result of the historical consensus information is considered to be a negative value and is exponentially reduced, namely, the more the successful consensus times are less than twice of the failure times, the smaller the result of the historical consensus information is; when the successful consensus times are more than twice the failure times, the result of the historical consensus information is considered to be positive and linearly increased, i.e., the more the successful consensus times are more than twice the failure times, the larger the result of the historical consensus information is. By dynamically adjusting the weight of the node, the influence of the node voting on the whole voting result can be quickly reduced, and the node can be encouraged to participate in correct consensus to improve the voting weight of the voting.
The result of the historical consensus information can be obtained in the following preferred manner:
suppose Cs represents the number of successful consensus participation by the witness, Ce represents the number of failed consensus participation by the witness, and the third weight is 0.4. When Cs is more than or equal to 2Ce, the result of the historical consensus information is 0.4-Cs-2 Ce; when Cs < 2Ce, the result of the historical consensus information is-0.4 x 2│Cs-2Ce│. Therefore, when the number of times of consensus that the witness node fails to participate is larger, the voting weight of the witness node is decreased exponentially, so that the voting weight of the wrong witness node can be decreased rapidly, and the witness node can be eliminated rapidly. The more the number of successful consensus participation times, the greater the voting weight linearly increases.
After each witness node calculates its vote and broadcasts it, it also receives votes broadcast by other witness nodes, and the following steps include:
step T1: each witness node sorts the votes according to the received votes of other witness nodes and the votes of the witness node and the numerical value of the votes;
step T2: each witness node selects the witness node corresponding to the highest vote value as a candidate node within preset time, throws the vote of the witness node to the candidate node, and broadcasts the information of the candidate node.
In the embodiment of the invention, after each witness node receives votes of other nodes, the votes of other witness nodes and the votes of the witness nodes can be sorted according to the numerical value of the votes, wherein the row with the highest vote value is the first row, and the row with the lowest vote value is the last row. Then, the witness node needs to select the first witness node which is sequenced in the preset time, namely the witness node corresponding to the highest vote value as a candidate node, and cast the vote of the witness node to the candidate node and broadcast the information of the candidate node.
The reason why the witness node votes within the preset time is to improve the consensus speed of the block chain. Generally, the number of witness nodes in a block chain is huge, if preset time is not set to force the witness nodes to vote, the witness nodes may delay for a long time to vote, so that selection of entrusted nodes needs to take a long time, which obviously does not meet actual requirements, and therefore a preset time needs to be set to accelerate selection of entrusted nodes, and further the consensus speed of the block chain is improved.
In addition, the number of witness nodes in the block chain is huge, but the network quality is not completely the same, so that in the actual process, not every witness node can receive votes of all other witness nodes, and even if the votes are received, the time is long.
For example: assuming that there are 100 witness nodes, because of various factors such as network quality, if it is desired that all the 100 witness nodes receive votes from each other, the time spent for re-ordering and voting may take 10 minutes, but if each witness node of the 100 witness nodes receives another 80 votes, the time spent for re-ordering and voting may only take 5 minutes, then 5 minutes is set, and within 5 minutes, all the 100 witness nodes complete respective voting to obtain all the candidate nodes.
In order to accelerate the selection of the trusted node, if a first witness node (namely any witness node) in a plurality of witness nodes does not select the witness node corresponding to the highest vote value within the preset time as a candidate node, the self vote is cast to the candidate node, the information of the candidate node is broadcasted, the block chain judges that the first witness node votes ineffectively, and the guarantee fund of the first witness node is penalized. By the method, the selection of the entrusted node is accelerated, and the block chain consensus speed is further improved.
Step T3: checking and counting votes of each candidate node in all the candidate nodes, and sequencing the votes according to the numerical value of the votes which are checked correctly;
step T4: and selecting a first preset number of candidate nodes in the top sequence as a plurality of entrusted nodes.
In the embodiment of the invention, after the candidate nodes are determined, the votes of each candidate node are verified, if the votes are verified correctly, the votes which are verified correctly are subjected to numerical statistics, namely, the votes of the candidate nodes are actually the sum of the votes voted to the witness nodes. For example: if a candidate node obtains votes of 30 witness nodes, the value of the votes of the candidate node is the sum of the respective votes of the 30 witness nodes theoretically, and the votes of the 30 witness nodes are verified correctly. If the vote of a witness node is not verified correctly, the vote of the witness node which issues the vote needs to be determined to be invalid for the vote which is verified incorrectly, and meanwhile, the deposit of the witness node which does not issue the vote is penalized. Therefore, the malicious cost of the malicious node is increased, and the safety and stability of the block chain are maintained.
After numerical summation is carried out on each vote which is verified to be correct in the candidate nodes, the votes of the candidate nodes are obtained, all the candidate nodes are ranked according to the numerical value of the vote which is verified to be correct, the candidate node with the highest vote value is ranked firstly, and the candidate node with the lowest vote value is ranked finally.
And after the sorting is finished, selecting a first preset number of candidate nodes in the front sorting as a plurality of selected entrusted nodes in the block chain. For example: the first predetermined number is 30%, and then the first 30% of the candidate nodes are selected as the trusted nodes.
Step 102: the witness node issues voting incentives that are effective for votes that are voted on to a plurality of trusted nodes.
In the embodiment of the invention, after the trustee nodes are voted out, the witness nodes which are voted to a plurality of trustee nodes and are effective in voting are issued voting incentive. Therefore, the witness nodes are stimulated to actively participate in the selection of the trustee nodes of the block chain, and the malicious witness nodes are removed quickly.
The step of issuing voting incentives for witness nodes for which votes in each trusted node are valid specifically comprises:
step V1: calculating the sum of the guarantee funds of witness nodes with effective votes in the entrusted node;
step V2: calculating the respective occupation ratio of the deposit of each witness node in the entrusted node, wherein the vote of each witness node is effective;
step V3: and calculating the voting incentive of the witness node with each vote effective according to the respective proportion of the deposit of the witness node with each vote effective and the historical consensus information of the witness node with each vote effective.
In the embodiment of the invention, in order to encourage the witness node to pay more security, increase the cost of doing malicious activities of the witness node and encourage the witness node to participate in the number of times of successful consensus, the voting incentive determines the specific allocation by the security and the historical consensus information.
The method comprises the steps of firstly calculating the sum of the deposit of the witness nodes with all the votes in the entrusted node, and then calculating the respective proportion of the deposit of the witness node with each vote in the entrusted node. That is, the higher the witness node's assurance fund is, the higher its share ratio is. And finally, calculating to obtain the voting incentive of the witness node with each vote according to the respective proportion of the deposit of the witness node with each vote being effective and the historical consensus information of the witness node with each vote being effective.
The calculation method of voting incentive can be understood as follows:
for a witness node: suppose Cs represents the number of successful consensus participation of the witness node, Ce represents the number of failed consensus participation of the witness, and n represents the guaranteed credit ratio of the witness node. Then when Cs ≧ 2Ce, the witness node's voting incentive (Cs-2Ce)2(ii) a When Cs < 2Ce, voting incentive of the witness node is n-Cs-Ce. Therefore, the higher the guarantee fund of the witness node is, the higher the number of successful consensus participation times is, and the higher the voting incentive is.
Step 103: and generating a block at any one of the plurality of entrusted nodes, and issuing an accounting incentive to the witness node which is effective in the votes voted to the plurality of entrusted nodes after the generated blocks are identified successfully.
In the embodiment of the invention, after a plurality of entrusted nodes are selected and voting excitation is issued, any entrusted node in the entrusted nodes can generate a block, each time a block is generated, a block chain is required to perform block consensus, and the entrusted nodes generate the blocks in turn according to a certain sequence.
In order to control the election times of the entrusted nodes within a reasonable range, each entrusted node in the entrusted nodes needs to generate a second preset number of blocks, and after all the entrusted nodes generate the second preset number of blocks respectively, the block chain starts to select a new round of entrusted nodes.
Assuming that there are 6 entrusted nodes and the second preset number is 5, each of the 6 entrusted nodes needs to generate 5 blocks, and after generating 30 blocks in total, a new round of entrusted node selection is started. This is done to ensure fairness of the blockchain, since the number of witness nodes in the blockchain may change, and the number of votes for each witness node may also change, so that the trusted node needs to be reselected after the conditions are met. So after all the entrusted nodes generate the second preset number of blocks respectively, the following steps are executed: each witness node in the plurality of witness nodes votes according to votes received by the witness node to select a plurality of trusted nodes from the plurality of witness nodes.
After each entrusted node generates a block and the block consensus succeeds, the witness node which votes to the plurality of entrusted nodes is required to issue an accounting incentive, and the method specifically comprises the following steps:
step D1: generating a block at any trusted node in the plurality of trusted nodes, and issuing total accounting excitation after the block is successfully identified;
step D2: determining a right index corresponding to a witness node which is effective in each vote based on a Banzhaf right index in a game theory;
step D3: and calculating to obtain the accounting incentive which is due by the witness node which is effective in each vote according to the right index which is corresponding to the witness node which is effective in each vote and the total accounting incentive.
In the embodiment of the invention, because only the trusted node has the accounting incentive in the existing DPoS consensus algorithm, but the witness node which is effective in each vote issues the accounting incentive, the problem that how to better and more fairly distribute the accounting incentive is difficult to solve is solved. Through a large amount of research and practical tests, the inventor creatively discovers the similarity of the DPoS consensus algorithm and the game theory, introduces related knowledge of the game theory, determines the right index corresponding to the witness node effective in each vote based on the Banzhaf right index in the game theory on the basis of the issued total accounting stimulus, and finally calculates and obtains the accounting stimulus corresponding to the witness node effective in each vote according to the right index corresponding to the witness node effective in each vote and the total accounting stimulus.
Specifically, the game theory refers to a theory that when a plurality of decision-making subjects act with each other, each subject makes a decision in favor of the subject according to the grasped information. The basic elements of the game are action sequence, player in the game, effectiveness and balance. The game player is a player participating in the game to make a decision, the effectiveness is the income obtained in the game process, the action sequence is the decision sequence adopted by the game player, and a balanced and stable state can be finally achieved according to the Nash game. Whether a game is played by a player in a game theory in a manner that the player forms an alliance with other players is called cooperative play and non-cooperative play.
Based on the theory, the inventor further researches and discovers that in the DPoS consensus algorithm, the witness node of each vote is regarded as a person in the bureau, the income obtained by the witness node due to the vote can be regarded as utility, and different voting strategies adopted by each witness node can be regarded as action sequences, so that the whole block chain consensus process can be seen to accord with the characteristics of the game theory. The witness node casts the vote of the witness node to the entrusted node, and the behavior of competing with other witness nodes for the accounting right can be regarded as a cooperative game. Based on the above findings, further based on Banzhaf entitlement indices in cooperative gaming, the billing incentives can be redistributed.
The Banzhaf entitlement index is an index for quantitatively analyzing the degree of importance of a voter in a voteThe more important the voter is in the league, the greater its entitlement index. In league gaming, if a voter wins a league after joining the league with no chance of winning the original league, or if the voter leaves the league without winning the original league, the leagues can be regarded as a valid league for the voter [19 ]]. The more its active league for each voter, the greater the voting rights it has. For a league game (N, V), the weighting vector β ═ β can be used if the betting weights are hit in the game1，β2，…，βoExpressed, the rights index is specifically formulated as follows:
where N {1, 2, …, N } represents a set of witness nodes, V: 2N → R is the utility function, and K ∈ N, v (K) denotes federation revenue in the presence of node i. v (K \ i }) represents the revenue when i is not present in the federation. 2n-1And the number of the unions which can be formed by the rest n-1 nodes excluding the i node in the set formed by the n witness nodes is shown. The rights and interests of the nodes range from 0 to 1, betaiThe closer to 1 the greater the rights, the equity value sum of all nodes is 1. In the operation, the effective alliance number of the witness node for each vote is determined, namely the witness node for each vote can determine whether a plurality of candidate nodes become entrusted nodes or not, and then the witness node for each vote has a plurality of effective alliances. And determining the sum of the effective alliances, namely the sum of the effective alliances of the witness nodes with all votes, and determining the right index of the witness node with the votes according to the ratio of the effective alliance number of the witness node with each vote to the sum of the effective alliances. Finally, the total accounting incentive is multiplied by the right index of the witness node with the valid vote, namely the accounting incentive of the witness node with the valid voteAnd (4) exciting.
For example: if the total number of the valid witness nodes of all votes is 120, the right index of the witness node valid for the vote is 10/120-0.08333. The valid witness node's accounting incentives for the vote are 0.08333 total accounting incentives.
Referring to fig. 2, a block diagram of a block chain consensus method based on the delegation interest certification algorithm according to an embodiment of the present invention is shown, where the block chain consensus method includes: a plurality of witness nodes; the device comprises:
a elected trusted node module 210 for voting by each witness node of the plurality of witness nodes according to votes received by the witness node to elect a plurality of trusted nodes among the plurality of witness nodes;
a voting incentive issuing module 220 for issuing voting incentives to witness nodes for which votes voted for the plurality of trusted nodes are valid;
the issuing and accounting incentive module 230 is configured to generate a block at any trusted node of the plurality of trusted nodes, and issue an accounting incentive to a witness node that is effective in votes voted to the plurality of trusted nodes after the generated blocks are successfully identified;
wherein the ballot includes: the currency age of the witness node, the deposit of the witness node and historical consensus information of the witness node, wherein the historical consensus information comprises: and the witness nodes participate in successful consensus times and failed consensus times.
Optionally, the elected entrusted node module includes:
the calculating vote unit is used for calculating and obtaining votes of each witness node according to the age of the money of each witness node, the deposit and the historical consensus information, and broadcasting the votes to other witness nodes;
the vote sorting unit is used for sorting each witness node according to the received votes of other witness nodes and the votes of the witness node per se within the preset time according to the numerical value of the votes;
a candidate node casting unit, which is used for each witness node to select the witness node corresponding to the highest vote value as a candidate node, casting the vote of the witness node to the candidate node, and broadcasting the information of the candidate node;
the checking and counting sorting unit is used for checking and counting votes of each candidate node in all the candidate nodes and sorting the votes according to the numerical value of the votes which are checked correctly;
and the selected entrusted node unit is used for selecting a first preset number of candidate nodes in the top sequence as the plurality of entrusted nodes.
Optionally, the voting incentive issuing module is configured to issue voting incentives to witness nodes in which votes in each entrusted node are valid, and specifically includes:
a total sum calculating unit used for calculating the total sum of the guarantee funds of the witness nodes with effective votes in the entrusted node;
the calculating proportion unit is used for calculating the respective proportion of the deposit of the witness node which is effective in each vote in the entrusted node;
and the voting incentive calculation unit is used for calculating and obtaining the voting incentive of the witness node with each vote according to the respective proportion of the deposit of the witness node with each vote being effective and the historical consensus information of the witness node with each vote being effective.
Optionally, the issuing of the billing incentive module comprises:
a total issuing incentive unit, configured to generate a block at any trusted node of the plurality of trusted nodes, and issue a total accounting incentive after the block is successfully identified;
the right index determining unit is used for determining a right index corresponding to the witness node for each vote based on the Banzhaf right index in the game theory;
and the calculation accounting excitation unit is used for calculating and obtaining the accounting excitation which is obtained by the witness node which is effective in each vote according to the right index which corresponds to the witness node which is effective in each vote and the total accounting excitation.
Optionally, the check statistic ordering unit is specifically configured to:
checking each vote of each candidate node in all the candidate nodes;
counting the numerical value of the votes which are correctly verified, and sequencing the votes according to the numerical value of the votes which are correctly verified;
for votes that are checked for being incorrect, it is determined that the vote for the witness node issuing the vote is invalid and the deposit for the witness node that did not issue the vote is penalized.
Optionally, the vote calculating unit is specifically configured to:
each witness node calculates the product of the currency age of the witness node and the first weight to obtain the corrected currency age;
each witness node calculates the product of the own deposit and the second weight to obtain a corrected deposit;
each witness node calculates the product of the historical consensus information of the witness node and the third weight to obtain corrected historical consensus information;
each witness node calculates the sum of the corrected coin age, the corrected deposit and the corrected historical consensus information to obtain a vote of the witness node, and broadcasts the vote to other witness nodes;
the value of the historical consensus information of each witness node is increased along with the increase of the number of successful consensus participation times and is decreased along with the increase of the number of failed consensus participation times.
The following is a verification of the reliability of the method of the invention. The consensus behavior of the witness nodes is simulated in a multi-thread mode, each witness node is simulated by one thread, and 120 witness nodes are simulated. The method provided by the invention is compared with the existing DPoS algorithm through experiments in the aspects of witness node income, witness node participation, elimination of wrong witness nodes and the like. The experimental environment is shown in the following table:
| processor with a memory having a plurality of memory cells | System for controlling a power supply | Memory device |
| Intel I5-8250U | Ubuntu 18.04 | 8G |
In order to verify the method for voting and selecting the entrusted nodes, when 30% of error witness nodes exist in the block chain system, the error witness nodes can be eliminated through multiple rounds of consensus. The experimental conditions were set as follows: the witness nodes initially have the same coin age, and some witness nodes are gradually participated in invalid voting or error block generation after the experiment begins, so as to simulate rogue nodes in the block chain system. After several rounds of consensus, the states of the witness nodes in the system are different, so that the vote weights of the witness nodes are different.
Fig. 3 shows a comparison graph of the results of the normal witness nodes after 50 rounds of voting. In fig. 3, the horizontal axis is the number of experiments, the vertical axis is the proportion (%) of the normal witness nodes, the black bars represent the proportion of the normal witness nodes after 50 rounds of voting by the method of the present invention, and the gray bars represent the proportion of the normal witness nodes after 50 rounds of voting by the DPoS algorithm.
Therefore, when the number of experimental rounds is small, the proportion of the nodes of the error witness of the method and the DPoS algorithm is not large. The difference between the two becomes prominent when the experiment is carried out for 10 rounds, the error witness node proportion in the method of the invention and the original algorithm are separated and kept stable when the experiment is carried out for 35 rounds, and the error node proportion of the DPoS algorithm is in a fluctuation state. The reason of analysis can be known that after some witness nodes participate in some wrong consensus, the system can record the voting information of the witness nodes, and the method can adjust the voting weight of the witness nodes according to the records during the vote counting, so that the probability that the witness nodes become trusted nodes is reduced. The DPoS algorithm only counts the coin age information of the nodes, and the weight of node voting of a wrong witness cannot be reduced well. It can therefore be concluded that: the method can accelerate the screening of the block chain system on the abnormal witness node and reduce the probability that the abnormal witness node becomes a trusted node.
Aiming at the participation degree of the witness nodes, the DPoS algorithm has the problem that the positivity of the voting witness nodes is not high, and aims to verify whether the activity degree of the witness nodes can be increased by the method. In the experiment, 50 rounds of consensus are performed under the condition that the initial coin ages of the witness nodes are consistent, the number of the witness nodes participating in voting in each round is counted, and the result is shown in fig. 4.
In fig. 4, the horizontal axis represents the number of experiments, and the vertical axis represents the number of witness nodes participating in voting; the curve formed by the black square frame and the solid line is the curve of the number of votes participated by the witness node under the method, and the curve formed by the black circle and the solid line is the curve of the number of votes participated by the witness node under the DPoS algorithm. When multiple rounds of consensus are carried out by the DPoS algorithm, the number of witness nodes participating in voting is approximately stabilized at about 65%. In the method, because the witness nodes participating in voting have corresponding voting incentive and the trusted nodes thereof also have corresponding accounting incentive after successful completion of consensus after voting, the liveness of the witness nodes is maintained at about 80% under the method, and the participation degree of the witness nodes is obviously higher than that of a DPoS algorithm. The method of the invention is effective for improving the activity of the block chain system.
The time delay is the time consumption from the start of voting to the generation of the block. Therefore, the time delay of the algorithm can directly reflect the real performance of the algorithm, and the lower the time consumption is, the higher the performance of the algorithm is. 50 times of experiments are carried out under the same conditions, and a time delay comparison graph is obtained, and the structure is shown in figure 5.
In fig. 5, the horizontal axis represents the number of experiments, and the vertical axis represents the time consumption(s); the curve formed by the black square frame and the solid line is the time consumption curve under the method, and the curve formed by the black circle and the solid line is the time consumption curve under the DPoS algorithm. The time consumption of both algorithms increases with the number of experiments, but the method of the invention increases relatively slowly. It can thus be shown that the improvement of the method of the invention compared to the DPoS algorithm is valid in terms of time delay.
Through the embodiment, the invention selects a plurality of entrusted nodes firstly, and then issues voting incentive to the witness node with effective votes, so that the participation degree of the witness node is improved. The vote is not only based on the condition of the age of the coin, but also adds the guarantee fund and the historical consensus information, thereby reducing the importance of the age of the coin and effectively eliminating the wrong witness nodes. In addition, after the block consensus is completed, the accounting stimulus is issued to the witness node with the vote being effective, the accounting stimulus is not issued only to the trusted node any more, the block chain system centralization trend is avoided, the problem of the existing DPoS algorithm is solved, and the method has high practicability.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, embodiments of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, embodiments of the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
Embodiments of the present invention are described with reference to flowchart illustrations and/or block diagrams of methods, terminal devices (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing terminal to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing terminal, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing terminal to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing terminal to cause a series of operational steps to be performed on the computer or other programmable terminal to produce a computer implemented process such that the instructions which execute on the computer or other programmable terminal provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Finally, it should also be noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or terminal that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or terminal. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or terminal that comprises the element.
The embodiments of the present invention have been described in connection with the accompanying drawings, and the principles and embodiments of the present invention are described herein using specific examples, which are provided only to help understand the method and the core idea of the present invention; meanwhile, for a person skilled in the art, according to the idea of the present invention, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present invention.
Claims (8)
1. A block chain consensus method based on a delegation interest certification algorithm, the block chain comprising: a plurality of witness nodes; the method comprises the following steps:
each witness node in the witness nodes calculates to obtain a vote value according to the coin age, the deposit and the historical consensus information of the witness node, and broadcasts the vote value to other witness nodes;
each witness node sorts according to the received vote values of other witness nodes and the vote value of the witness node and the numerical value of the vote value;
each witness node selects a witness node corresponding to the highest numerical value as a candidate node within preset time, throws a vote of the witness node to the candidate node, and broadcasts information of the candidate node;
checking and counting votes of each candidate node in all the candidate nodes, and sequencing all the candidate nodes according to the numerical value of the number of votes which are provided with correct check;
selecting a first preset number of candidate nodes in the top ranking as a plurality of entrusted nodes;
issuing a voting incentive to the witness node that is valid for the votes voted on the plurality of trusted nodes;
generating a block at any trusted node in the plurality of trusted nodes, and issuing an accounting incentive to the witness node which is effective in votes voted to the plurality of trusted nodes after the generated blocks are identified successfully;
wherein the historical consensus information comprises: the number of successful consensus and failed consensus of each witness node is increased along with the increase of the number of successful consensus and is decreased along with the increase of the number of failed consensus.
2. The method of claim 1, wherein issuing a voting incentive for a witness node to be effective for votes cast to the plurality of trusted nodes comprises:
the method for issuing voting incentive aiming at witness nodes with effective votes in each entrusted node specifically comprises the following steps:
calculating the sum of the guarantee funds of witness nodes with effective votes in the entrusted node;
calculating the respective occupation ratio of the deposit of each witness node in the entrusted node, wherein the vote of each witness node is effective;
and calculating the voting incentive of the witness node with each vote effective according to the respective proportion of the deposit of the witness node with each vote effective and the historical consensus information of the witness node with each vote effective.
3. The method of claim 1, wherein issuing a billing incentive for a witness node that is valid for votes voted on the plurality of trusted nodes after a block is generated by any one of the plurality of trusted nodes and the generated blocks are successfully identified comprises:
generating a block at any trusted node in the plurality of trusted nodes, and issuing total accounting excitation after the block is successfully identified;
determining a right index corresponding to a witness node which is effective in each vote based on a Banzhaf right index in a game theory;
and calculating to obtain the accounting incentive which is due by the witness node which is effective in each vote according to the right index which is corresponding to the witness node which is effective in each vote and the total accounting incentive.
4. The method of claim 1, further comprising:
each of the plurality of entrusted nodes needs to generate a second preset number of blocks;
after all the entrusted nodes respectively generate a second preset number of blocks, executing the following steps: each witness node in the witness nodes votes according to the vote value received by the witness node, so that a plurality of entrusted nodes are selected from the witness nodes.
5. The method as in claim 1, wherein after each witness node has been sorted by the numerical size of the vote value based on the vote values received for other witness nodes and its vote value, further comprising:
and if the first witness node in the witness nodes does not select the witness node corresponding to the highest numerical value as a candidate node within the preset time, casting the vote of the first witness node to the candidate node, and broadcasting the information of the candidate node, judging that the voting of the first witness node is invalid, and penalizing the security fund of the first witness node.
6. The method of claim 1, wherein the checking and counting votes for each of all candidate nodes, and sorting the votes according to the number of votes that have been checked for correctness, comprises:
checking each vote of each candidate node in all the candidate nodes;
counting the number of votes which are correctly checked, and sequencing all candidate nodes according to the number of votes which are correctly checked;
after checking each vote of each candidate node in all the candidate nodes, the method further comprises the following steps:
for votes that are checked for being incorrect, it is determined that the vote for the witness node issuing the vote is invalid and the deposit for the witness node that did not issue the vote is penalized.
7. The method as in claim 1, wherein each witness node calculates its vote value based on its age of currency, deposit, and historical consensus information, and broadcasts its vote value to the remaining witness nodes, comprising:
each witness node calculates the product of the currency age of the witness node and the first weight to obtain the corrected currency age;
each witness node calculates the product of the own deposit and the second weight to obtain a corrected deposit;
each witness node calculates the product of the historical consensus information of the witness node and the third weight to obtain corrected historical consensus information;
and each witness node calculates the sum of the corrected coin age, the corrected deposit and the corrected historical consensus information to obtain a vote value of the witness node, and broadcasts the vote value of the witness node to other witness nodes.
8. A block chain consensus device based on a delegation interest certification algorithm, wherein the block chain comprises: a plurality of witness nodes; the device comprises:
a elected entrusted node module, said elected entrusted node module comprising:
the vote calculation unit is used for calculating and obtaining a vote value of each witness node in the witness nodes according to the coin age, the deposit and the historical consensus information of the witness node and broadcasting the vote value to other witness nodes;
the vote sorting unit is used for sorting each witness node according to the received vote values of other witness nodes and the vote value per se in the preset time according to the numerical value of the vote value;
the candidate node casting unit is used for selecting the witness node corresponding to the highest numerical value as a candidate node by each witness node, casting the vote of the witness node to the candidate node, and broadcasting the information of the candidate node;
the checking and counting sorting unit is used for checking and counting votes of each candidate node in all the candidate nodes and sorting the votes according to the numerical value of the number of the votes which are provided with correct checking;
the selection entrusted node unit is used for selecting a first preset number of candidate nodes in the top sequence as a plurality of entrusted nodes;
the voting incentive issuing module is used for issuing voting incentive to the witness node which is effective in voting for the plurality of trustees nodes;
the issuing and accounting excitation module is used for generating a block at any one of the plurality of entrusted nodes, and issuing accounting excitation to the witness node which is effective in votes voted to the plurality of entrusted nodes after the generated blocks are identified successfully;
wherein the historical consensus information comprises: the number of successful consensus and failed consensus of each witness node is increased along with the increase of the number of successful consensus and is decreased along with the increase of the number of failed consensus.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011425792.9A CN112600682B (en) | 2020-12-09 | 2020-12-09 | Block chain consensus method and device based on delegation interest certification algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011425792.9A CN112600682B (en) | 2020-12-09 | 2020-12-09 | Block chain consensus method and device based on delegation interest certification algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112600682A CN112600682A (en) | 2021-04-02 |
| CN112600682B true CN112600682B (en) | 2022-01-18 |
Family
ID=75191232
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011425792.9A Active CN112600682B (en) | 2020-12-09 | 2020-12-09 | Block chain consensus method and device based on delegation interest certification algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112600682B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114629915A (en) * | 2022-03-04 | 2022-06-14 | 中信银行股份有限公司 | Witness voting mechanism processing method and witness voting mechanism processing system |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109951474A (en) * | 2019-03-15 | 2019-06-28 | 杭州云象网络技术有限公司 | A method of realizing that block chain is known together out block |
| CN112039964A (en) * | 2020-08-24 | 2020-12-04 | 大连理工大学 | Node reputation consensus method based on block chain |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170345011A1 (en) * | 2016-05-26 | 2017-11-30 | Hitfin, Inc. | System and method executed on a blockchain network |
| WO2019232789A1 (en) * | 2018-06-08 | 2019-12-12 | 北京大学深圳研究生院 | Voting-based consensus method |
| US11165862B2 (en) * | 2017-10-24 | 2021-11-02 | 0Chain, LLC | Systems and methods of blockchain platform for distributed applications |
| CN109934608B (en) * | 2017-12-18 | 2020-10-30 | 厦门本能管家科技有限公司 | Block chain consensus method |
| CN109543075B (en) * | 2018-11-14 | 2020-09-22 | 全链通有限公司 | Block generation method and system |
| US20200313855A1 (en) * | 2019-03-26 | 2020-10-01 | Si Yin | Consensus method for blockchain via virtual machine based hybrid delegated proof of stake and proof of work (vdposw) |
| CN110517139B (en) * | 2019-08-23 | 2021-12-28 | 电子科技大学 | Voting mechanism-based alliance block chain power sharing consensus method |
| CN111563278B (en) * | 2020-05-09 | 2023-11-28 | 电子科技大学 | Improved stock right authorization proving method |
| CN111563822A (en) * | 2020-05-14 | 2020-08-21 | 上海简苏网络科技有限公司 | DPOS (distributed data processing System) consensus method and system realized by intelligent contracts |
-
2020
- 2020-12-09 CN CN202011425792.9A patent/CN112600682B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109951474A (en) * | 2019-03-15 | 2019-06-28 | 杭州云象网络技术有限公司 | A method of realizing that block chain is known together out block |
| CN112039964A (en) * | 2020-08-24 | 2020-12-04 | 大连理工大学 | Node reputation consensus method based on block chain |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112600682A (en) | 2021-04-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110580653B (en) | Block chain consensus mechanism based on transaction | |
| Hafalir et al. | College admissions with entrance exams: Centralized versus decentralized | |
| Apesteguia et al. | Imitation and the evolution of Walrasian behavior: Theoretically fragile but behaviorally robust | |
| Brock et al. | Dictating the risk: Experimental evidence on giving in risky environments | |
| Giné et al. | Microfinance games | |
| Fu et al. | On disclosure policy in contests with stochastic entry | |
| CN109993004B (en) | Block chain autonomous method and system based on credit mechanism | |
| García et al. | Measuring cultural dynamics through the eurovision song contest | |
| CN114143104B (en) | DPoS (distributed denial of service) consensus mechanism node reputation value measurement method based on dynamic trust model | |
| CN107749006A (en) | Game appraisal procedure, device and equipment | |
| CN112600682B (en) | Block chain consensus method and device based on delegation interest certification algorithm | |
| CN112118138B (en) | System and method for realizing block chain consensus mechanism | |
| CN114741721A (en) | Consensus device and consensus method based on contribution value certification for file block chain | |
| CN111078787A (en) | Block chain consensus method based on random number mapping | |
| CN110585722A (en) | Block chain-based game time information processing method and device and game control method and device | |
| CN111563278B (en) | Improved stock right authorization proving method | |
| Okada et al. | When culture does not matter: Experimental evidence from coalition formation ultimatum games in Austria and Japan | |
| Kazachkov et al. | On tanking and competitive balance: Reconciling conflicting incentives | |
| Huang et al. | Fairness concerns are less relevant when agents are less informed | |
| Balaguer et al. | Hcmd-zero: Learning value aligned mechanisms from data | |
| CN111522884B (en) | Threat information transaction alliance chain transaction promotion method based on benefit distribution | |
| Price et al. | Trial-based dominance enables non-parametric tests to compare both the speed and accuracy of stochastic optimizers | |
| Klumpp | Colonel Blotto's Tug of War | |
| Chui et al. | Non-strategic Structural Inference (for Initial Play). | |
| CN112738196B (en) | Block chain representative node selection method and device, computer equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |