CN110930158A - Block chain DPoS common recognition method based on reward and punishment mechanism - Google Patents

Block chain DPoS common recognition method based on reward and punishment mechanism Download PDF

Info

Publication number
CN110930158A
CN110930158A CN201911132081.XA CN201911132081A CN110930158A CN 110930158 A CN110930158 A CN 110930158A CN 201911132081 A CN201911132081 A CN 201911132081A CN 110930158 A CN110930158 A CN 110930158A
Authority
CN
China
Prior art keywords
node
voting
weight
nodes
reward
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.)
Pending
Application number
CN201911132081.XA
Other languages
Chinese (zh)
Inventor
王堃
雷文
孙雁飞
亓晋
岳东
陈悦妍
马荣
钱凯
陆浩东
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing University of Posts and Telecommunications
Original Assignee
Nanjing University of Posts and Telecommunications
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Nanjing University of Posts and Telecommunications filed Critical Nanjing University of Posts and Telecommunications
Priority to CN201911132081.XA priority Critical patent/CN110930158A/en
Publication of CN110930158A publication Critical patent/CN110930158A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/40—Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
    • G06Q20/405—Establishing or using transaction specific rules

Landscapes

  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Engineering & Computer Science (AREA)
  • Finance (AREA)
  • Economics (AREA)
  • Computer Security & Cryptography (AREA)
  • Development Economics (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

A block chain DPoS common recognition method based on a reward and punishment mechanism is characterized in that voting weights of all nodes in a block chain are initialized, and the voting weights of all nodes are equal; voting by each node, wherein the first N nodes which vote most are obtained according to the preset number N of the main nodes are the main nodes; then judging whether the main node can generate a block in time and correctly accounting, if so, marking the main node as CORRECT, otherwise, marking the main node as ERROR; after the judgment, the main node marked as CORRECT starts accounting and generates blocks until the next round of voting; finally, for the main node marked as ERROR, losing the voting weight and the voted weight in the next round of voting, reducing the voting weight of the node voted to the ERROR node by 20 percent, and reducing the voting weight to 0 percent at least; the voting weight of the node voting for the CORRECT node is increased by 20%, and the voting weight is increased to 100% at most. According to the method, a reward and punishment mechanism is introduced into the block chain consensus mechanism, so that the safety of the whole block chain consensus mechanism is effectively improved.

Description

Block chain DPoS common recognition method based on reward and punishment mechanism
Technical Field
The invention belongs to the technical field of block chains, and particularly relates to a block chain DPoS consensus method based on a reward and punishment mechanism.
Background
The Blockchain (Blockchain) is an important concept of the bitcoin, which is essentially a decentralized database, and is used as the underlying technology of the bitcoin, and is a series of data blocks which are generated by using a cryptographic method to be related, wherein each data block contains information of a batch of bitcoin network transactions, and the information is used for verifying the validity (anti-counterfeiting) of the information and generating the next block.
An intelligent contract is an important feature of a blockchain that can make communication between blocks of the blockchain more convenient and efficient. The so-called "consensus mechanism" is that the verification and confirmation of the transaction is completed in a short time by the voting of a particular node. The common consensus mechanisms used at present are: a workload certification mechanism, a rights and interests certification mechanism, a practical byzantine mechanism, and a shares authorization certification mechanism.
Dpos (freed proof of stop) mechanism, i.e., certificate authority attestation mechanism. An authorization and consensus mechanism similar to a board of directors, which enables each coin holder to vote for the certification of the equity authorization of the nodes of the whole system, is similar to the board voting, and has a built-in real-time equiter voting system, like the system holding a stockholder meeting never scattered at any time, and all stocks are voted to decide company decision. The decentralized creation of block chains based on DPoS mechanisms relies on a certain number of representatives, not on the totality of users. Deciding which nodes can be trusted and proxying them for verification and billing while generating a small amount of the corresponding reward. In such a block chain, the entire nodes vote to select a certain number of node representatives, and the node representatives proxy the entire nodes to confirm the block and maintain the ordered operation of the system. At the same time, all nodes in the blockchain have the right to be struck and represented at any time. If necessary, all the nodes can make the existing node representatives lose the membership of representatives through voting, and the new representatives are reselected to realize real-time democratics. The DPoS greatly improves the processing capacity of the block chain and reduces the maintenance cost of the block chain, so that the transaction speed is close to a centralized settlement system.
Disclosure of Invention
The technical problem to be solved by the invention is to overcome the defects of the prior art, and provide a block chain DPoS consensus method based on a reward and punishment mechanism, wherein the reward and punishment mechanism is introduced into the block chain consensus mechanism, so that the node voting process is optimized, the voting weight of malicious voting nodes is reduced, and the voting weight of good nodes is improved, thereby improving the safety of the whole block chain consensus mechanism.
The invention provides a block chain DPoS consensus method based on reward and punishment mechanism, which comprises the following steps,
step S1, initializing the voting right of all nodes in the block chain, and the voting right of each node is equal;
step S2, voting by each node, wherein the first N nodes which vote most according to the preset number N of the main nodes are the main nodes;
step S3, judging whether the main node can generate blocks in time and correctly account, if yes, marking the main node as CORRECT, otherwise, marking the main node as ERROR; after the judgment, the main node marked as CORRECT starts accounting and generates blocks until the next round of voting;
step S4, for the master node labeled as ERROR, the voting weight and the voted weight are lost in the next round of voting, and the voting weight of the node voted to the ERROR node is reduced by 20%, and the voting weight is reduced to 0% at the lowest; for a node labeled as a CORRECT master node, the voting weight of the node voting for the CORRECT node is increased by 20%, and the voting weight is increased to 100% at most.
As a further technical solution of the present invention, in step S1, the initial voting right of each node is W1＝W2＝…＝Wm1, wherein, WmThe voting right of the mth node is equal to the voting right of each node, and is 1.
Further, in step S2, the calculation formula of the votes obtained by voting each node is as follows
Figure BDA0002278595030000021
Figure BDA0002278595030000022
Wherein, V (n)i,ndj) Is node ndjTo node niVoting situation of (1), WjIs node ndjVoting weight of, VniIs a node niThe value of the ticket.
Further, in step S4, the penalty given to the node voting for the ERROR node is Wi'＝(1-20％)*WiWherein W isi' voting weight after receiving penalty for node i, WiThe voting weight of the node i in the previous voting round is greater than 0; the reward given to the nodes voting for CORRECT nodes is Wi'＝(1+20％)*WiWherein W isi' voting weight after receiving reward for node i, WiThe voting weight of the node i in the previous voting round is calculated, and the voting weight is less than 1.
The invention combines a reward and punishment mechanism with a block chain consensus mechanism, and provides a block chain DPoS consensus method based on the reward and punishment mechanism.
Drawings
FIG. 1 is a schematic flow chart of the method of the present invention.
Detailed Description
Referring to fig. 1, the present embodiment provides a block chain DPoS consensus method based on reward and punishment mechanism, which includes the following steps,
step S1, initializing the voting right of all nodes in the block chain, and the voting right of each node is equal;
step S2, voting by each node, wherein the first N nodes which vote most according to the preset number N of the main nodes are the main nodes;
step S3, judging whether the main node can generate blocks in time and correctly account, if yes, marking the main node as CORRECT, otherwise, marking the main node as ERROR; after the judgment, the main node marked as CORRECT starts accounting and generates blocks until the next round of voting;
step S4, for the node 2 labeled as ERROR, the voting weight and the voted weight are lost in the next round of voting, and the voting weight of the node voted to the node 2 is reduced by 20%, and the voting weight is reduced to 0% at the lowest; for nodes labeled CORRECT master node 1 and node 3, the voting weight for the nodes voting to both is increased by 20%, the voting weight is increased up to 100%,
in step S1, the initial voting right of each node is W1＝W2＝…＝Wm1, wherein, WmThe voting right of the mth node is equal to the voting right of each node, and is 1. Assuming a total of 9 nodes, the voting weights of the 9 nodes are equal, W1＝W2＝…＝W9＝1。
In step S2, the calculation formula of the votes obtained by each node is
Figure BDA0002278595030000041
Figure BDA0002278595030000042
Wherein, V (n)i,ndj) Is node ndjTo node niVoting situation of (1), WjIs node ndjVoting weight of, VniIs a node niThe value of the ticket. If N is 3, the first three of the obtained ticket amount are selected as the main nodes, and falseThe three names are respectively a node 1, a node 2 and a node 3.
In step S3, determining whether the master node can generate blocks in time and correctly account, if yes, marking the master node as CORRECT, otherwise, marking the master node as ERROR; after the decision, the master node labeled CORRECT starts accounting and generates blocks until the next round of voting. Assuming that node 1 and node 3 can both account correctly, node 1 and node 3 are labeled CORRECT; node 2 cannot properly account for, node 2 is labeled ERROR.
In step S4, a penalty of W is given to the nodes voting for the ERROR master nodei'＝(1-20％)*WiWherein W isi' voting weight after receiving penalty for node i, WiThe voting weight of the node i after the previous round of voting is greater than 0; the reward given to a node voting for a CORRECT master node is Wi'＝(1+20％)*WiWherein W isi' voting weight after receiving reward for node i, WiThe voting weight of the node i in the previous voting round is calculated, and the voting weight is less than 1. Assuming that nodes 4, 5, 6, 7 cast votes to the CORRECT node in the vote, their voting weights in the next round of voting will receive a reward, i.e., Wi'＝(1+20％)*Wi，WiIs 1, Wi' is 1.2. But since the weights are at most 1, they are still 1 in their next round of voting. Assuming that the nodes 8, 9 cast votes to the ERROR node, their voting weights in the next round of voting will be penalized, i.e., Wi'＝(1-20％)*Wi，WiIs 1, Wi' is 0.8.
The foregoing illustrates and describes the principles, general features, and advantages of the present invention. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, which are intended to further illustrate the principles of the invention, and that various changes and modifications may be made without departing from the spirit and scope of the invention, which is intended to be protected by the appended claims. The scope of the invention is defined by the claims and their equivalents.

Claims (4)

1. A block chain DPoS consensus method based on reward and punishment mechanism is characterized by comprising the following specific steps:
step S1, initializing the voting right of all nodes in the block chain, and the voting right of each node is equal;
step S2, voting by each node, wherein according to the preset number N of the main nodes, the first N nodes which vote most are the main nodes;
step S3, judging whether the main node can generate blocks in time and correctly account, if yes, marking the main node as CORRECT, otherwise, marking the main node as ERROR; after the judgment, the main node marked as CORRECT starts accounting and generates blocks until the next round of voting;
step S4, for the master node labeled as ERROR, the voting weight and the voted weight are lost in the next round of voting, and the voting weight of the node voted to ERROR is reduced by 20%, and the voting weight is reduced to 0% at the lowest; the voting weight of the node voting for the CORRECT node is increased by 20%, and the voting weight is increased to 100% at most.
2. The DPoS consensus method for block chains based on reward and punishment mechanism as claimed in claim 1, wherein the initial voting weight of each node in step S1 is W1＝W2＝…＝Wm1, wherein, WmThe voting right of the mth node is equal to the voting right of each node, and is 1.
3. The DPoS consensus method for a block chain based on reward and punishment mechanism as claimed in claim 1, wherein the vote count of each node in step S2 is calculated as
Figure FDA0002278595020000011
Figure FDA0002278595020000012
Wherein, V (n)i,ndj) Is node ndjTo node niVoting situation of (1), WjIs node ndjVoting weight of, VniIs a node niThe value of the ticket.
4. The DPoS consensus method for block chains based on reward and punishment mechanism as claimed in claim 1, wherein the penalty given to the nodes voting to the ERROR master node in step S4 is Wi'＝(1-20％)*WiWherein W isi' voting weight after receiving penalty for node i, WiThe voting weight of the node i in the previous voting round is greater than 0; the reward given to a node voting for a CORRECT master node is Wi'＝(1+20％)*WiWherein W isi' voting weight after receiving reward for node i, WiThe voting weight of the node i in the previous voting round is calculated, and the voting weight is less than 1.
CN201911132081.XA 2019-11-19 2019-11-19 Block chain DPoS common recognition method based on reward and punishment mechanism Pending CN110930158A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911132081.XA CN110930158A (en) 2019-11-19 2019-11-19 Block chain DPoS common recognition method based on reward and punishment mechanism

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911132081.XA CN110930158A (en) 2019-11-19 2019-11-19 Block chain DPoS common recognition method based on reward and punishment mechanism

Publications (1)

Publication Number Publication Date
CN110930158A true CN110930158A (en) 2020-03-27

Family

ID=69853473

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911132081.XA Pending CN110930158A (en) 2019-11-19 2019-11-19 Block chain DPoS common recognition method based on reward and punishment mechanism

Country Status (1)

Country Link
CN (1) CN110930158A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111563278A (en) * 2020-05-09 2020-08-21 电子科技大学 Improved method for proving right of stock authorization
CN111683121A (en) * 2020-05-22 2020-09-18 哈尔滨工程大学 Cloud data tracing source block chain consensus mechanism improvement method based on DPoS
CN112118138A (en) * 2020-09-18 2020-12-22 上海计算机软件技术开发中心 System and method for implementing block chain consensus mechanism

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108377206A (en) * 2018-03-12 2018-08-07 众安信息技术服务有限公司 Method, apparatus and computer readable storage medium for configuring common recognition algorithm
CN109639837A (en) * 2019-01-31 2019-04-16 东南大学 Block chain DPoS common recognition method based on faith mechanism

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108377206A (en) * 2018-03-12 2018-08-07 众安信息技术服务有限公司 Method, apparatus and computer readable storage medium for configuring common recognition algorithm
CN109639837A (en) * 2019-01-31 2019-04-16 东南大学 Block chain DPoS common recognition method based on faith mechanism

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111563278A (en) * 2020-05-09 2020-08-21 电子科技大学 Improved method for proving right of stock authorization
CN111563278B (en) * 2020-05-09 2023-11-28 电子科技大学 Improved stock right authorization proving method
CN111683121A (en) * 2020-05-22 2020-09-18 哈尔滨工程大学 Cloud data tracing source block chain consensus mechanism improvement method based on DPoS
CN111683121B (en) * 2020-05-22 2022-12-13 哈尔滨工程大学 Cloud data tracing source block chain consensus mechanism improvement method based on DPoS
CN112118138A (en) * 2020-09-18 2020-12-22 上海计算机软件技术开发中心 System and method for implementing block chain consensus mechanism
CN112118138B (en) * 2020-09-18 2023-06-23 上海计算机软件技术开发中心 System and method for realizing block chain consensus mechanism

Similar Documents

Publication Publication Date Title
CN113794675B (en) Distributed Internet of things intrusion detection method and system based on block chain and federal learning
CN109639837B (en) Block chain DPoS (distributed denial of service) consensus method based on trust mechanism
CN110445778B (en) Consensus algorithm applied to alliance chain
CN110189128B (en) Distributed consensus method and device for block rapid generation
CN107220130B (en) Method, device and system for realizing information consensus at nodes of block chain
CN110188137B (en) Integrity-based block chain consensus mechanism
CN110602117B (en) Vehicle networking node consistency consensus method based on block chain
CN110855432B (en) Asynchronous BFT & DPOS consensus mechanism for assigning verifier rewards based on verifiable random functions
CN110535836A (en) A kind of trust block chain common recognition method of based role classification
CN110348248B (en) Distributed billing right generation method in blockchain technology
CN110930158A (en) Block chain DPoS common recognition method based on reward and punishment mechanism
US20220092593A1 (en) Methods and Devices for Recording Work History and Proving Reputation in a Blockchain Network
CN111583039B (en) Secure interaction method, incentive method and transaction system for manager-free blockchain transaction
CN111026578A (en) Intelligent contract security detection method based on prediction machine
US20220092592A1 (en) Methods and Devices for Registering and Authenticating Miner Identity in a Blockchain Network
CN110928951A (en) Data sharing and arbitration method based on block chain
CN110599179B (en) Risk control method and related equipment based on blockchain system
CN113992526B (en) Coalition chain cross-chain data fusion method based on credibility calculation
CN110084596A (en) A kind of method and apparatus of processing block chain mixing common recognition
CN112118138B (en) System and method for realizing block chain consensus mechanism
CN113971597A (en) Shared charging pile transaction system, method, equipment and terminal
CN111680098A (en) Block chain system for data acquisition, data annotation, AI model training and verification
CN114362987A (en) Distributed voting system and method based on block chain and intelligent contract
CN117078446B (en) Closed-loop associated management system and method for rural collective assets
Yuan et al. Lightweight and reliable decentralized reward system using blockchain

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
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20200327