CN109194482B - Reputation certification based block chain consensus method - Google Patents

Reputation certification based block chain consensus method Download PDF

Info

Publication number
CN109194482B
CN109194482B CN201810876700.5A CN201810876700A CN109194482B CN 109194482 B CN109194482 B CN 109194482B CN 201810876700 A CN201810876700 A CN 201810876700A CN 109194482 B CN109194482 B CN 109194482B
Authority
CN
China
Prior art keywords
block
miner
information
excavation
serial
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
Application number
CN201810876700.5A
Other languages
Chinese (zh)
Other versions
CN109194482A (en
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.)
Guangdong xinanhuai Technology Development Co.,Ltd.
Original Assignee
National Sun Yat Sen University
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 National Sun Yat Sen University filed Critical National Sun Yat Sen University
Priority to CN201810876700.5A priority Critical patent/CN109194482B/en
Publication of CN109194482A publication Critical patent/CN109194482A/en
Application granted granted Critical
Publication of CN109194482B publication Critical patent/CN109194482B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
    • 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
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/12—Applying verification of the received information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/12—Applying verification of the received information
    • H04L63/123—Applying verification of the received information received data contents, e.g. message integrity
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
    • H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • General Engineering & Computer Science (AREA)
  • Computing Systems (AREA)
  • Computer Hardware Design (AREA)
  • Strategic Management (AREA)
  • Technology Law (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Power Engineering (AREA)
  • Marketing (AREA)
  • Economics (AREA)
  • Development Economics (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

A block chain consensus method based on credit certification comprises a serial ore digging module and a miner credit module, wherein in the serial ore digging module, a miner generates initial ore digging information according to current block information and complete verification information, serial solution is performed according to the initial ore digging information, an unverified block is generated according to the obtained solution and is issued to a network, and all network nodes can perform multi-party parallel verification on the block; and the miner credit module realizes the quantification of the miner credit value in the block chain according to the mining event and sets different mining difficulties for the miner according to the quantified credit value. The serial ore excavation module solves the problem of resource centralization in a block chain, and the miner credit system can enable miners with high credibility to have great advantages in ore excavation competition, and can effectively resist malignant competitive behaviors such as 51% attack, selfish ore excavation and the like.

Description

Reputation certification based block chain consensus method
Technical Field
The invention relates to the technical field of block chains, in particular to a block chain consensus method based on credit certification.
Background
The block chain technology realizes the transmission of the trusted information and the transfer of the effective value on the non-trusted channel. The consensus method in the block chain solves the problems of data consistency and trust among nodes in a decentralized scene, and is a key for ensuring that a block chain system continuously runs. However, the existing block chain consensus method can cause the problems of resource centralization, network compatibility damage and the like, so that the risk that the network is attacked by 51 percent, selfish mining and the like is greatly increased, and the block chain technology realizes the transmission of trusted information and the transfer of effective value on an untrusted channel. The consensus method in the block chain solves the problems of data consistency and trust among nodes in a decentralized scene, and is a key for ensuring that a block chain system continuously runs. However, the existing block chain consensus method can cause the problems of resource centralization, network compatibility damage and the like, so that the risk that the network is attacked by 51 percent, selfish mining and the like is greatly increased.
Disclosure of Invention
The invention mainly aims to provide a block chain consensus method based on credit evidence, aiming at overcoming the problems.
In order to solve the technical problems, the invention adopts the technical scheme that:
a block chain consensus method based on the Proof of credit (PoC) comprises a Serial Mining module (SMP) and a mineworker credit module (PCS), wherein the Serial Mining module comprises a solving stage and a verification stage; in the solving stage, a miner firstly generates initialized excavation information according to the current block information and complete verification information, serially solves according to the initialized excavation information, generates an unverified block according to the obtained solution and issues the unverified block to a network; in the verification stage, all miners can perform multi-party parallel verification on unverified blocks; and the miner credit module records the credit value transaction of each event in each block in the block chain, realizes the quantification of the credit value, and sets different mining difficulties for miners according to the quantified credit value.
S10 prevents miners (i.e., blockchain data recording nodes) from colluding by serial mining, the serial mining module being divided into a solution phase and a verification phase.
S101, in a solving stage, a miner generates the following initial excavation information according to the current block information and the complete verification information:
msg＝SigID(Pi-1||Ri-1||Vi-1)||i
therein, SigIDIs a digital signature algorithm, ID is used to specify the private key of the signature, i-1 and i are the current block depth and the next block depth, Pi-1Is the hash value of the current block header, Ri-1For the transaction Mekel tree root node, V, corresponding to the current blocki-1And the hash value of the complete verification information of the current block.
S102, the miners serially generate a sequence of numbers { a ] according to the initialized mining informationn},{bn}：
Figure GDA0002830838190000031
bj＝bit(hash(msg||aj))
Wherein, the function bit has the fixed-length information hash (msg | | | a)j) For inputting and outputting a random bit bjThe hash is a hash function.
S103, if al∈{anSatisfy hash (msg | | a)l)≤DIDIs a valid solution for the SMP, where DIDThe mining difficulty is calculated according to the credit value of miners. Once a valid SMP solution is computed, an unverified block is generated from the resulting solution and published to the network.
S104, in the verification stage, a miner selects one block B from the received unverified block set S as a current block;
s105, verifying that the inequality hash (msg | B.s) is less than or equal to DIDIf true, wherein B.s is the solution for the serial excavation of the corresponding block. If the inequality is true, entering the next verification step; otherwise, selecting one block from S again for verification;
s106, extracting the character string bstr according to B.s and the ID of the minersID：
bstrID＝Extr(B.s,ID)
The function Extr takes B.s and ID as input, and outputs a random character string with the length equal to B.s.
S107. pair
Figure GDA0002830838190000032
Verifying B.s th bit bj: if equation bj＝bit(hash(msg||aj) B) is establishedjIs a valid bit, otherwise is an invalid bit, wherein ajA string of B.s first j-1 bits. If it is paired with
Figure GDA0002830838190000033
bjAll are valid bits, then verification valid information is generated
Figure GDA0002830838190000034
Broadcasting into the network and entering the next authentication step; otherwise, generating verification invalid information
Figure GDA0002830838190000041
Broadcasting to the network and reselecting a block from S for verification, wherein ebit is invalid bit information so that bebit≠bit(hash(msg||aebit))。
S108, generating B.s verification information set SV。SVIs initialized to
Figure GDA0002830838190000042
If receiving the verification invalid information
Figure GDA0002830838190000043
Then selecting a block from S again for verification, if receiving verification information
Figure GDA0002830838190000044
Then will be
Figure GDA0002830838190000045
Is added to SVIn (1). Set SVThe following character strings correspond:
Figure GDA0002830838190000046
if the ORbst is the all-1 character string, the verification successfully enters a solving stage, and a miner digs the mine by taking B as the current block.
And S20, quantifying the credit value of the miner through a miner credit system, and defining the mining difficulty based on the credit value of the user.
S201, each miner binds the account number of the miner to the global IP address of the miner and initializes the credit account of the miner. Each reputation account contains two quantities: a reputation value and a monetary value. Wherein the initial credit value of the account is 0 and the block reward of each block is only accumulated into the monetary value of the valid credit account;
s202, credit value increment is defined for the following mining events in the miner credit system, and the following events can be recorded in each block as special credit value transactions to realize quantification of the miner credit value.
1. Successful insertion of Block B into the Block chaini. Corresponding increment is
Figure GDA0002830838190000047
Where α is the upper bound of the increment set, λ1L (B) as a constant for setting the Δ growth tendencyi) Is a block BiSolution B corresponding to serial ore excavationiS length.
2. For blocks B in a block chainiProviding authentication validity information
Figure GDA0002830838190000048
Corresponding increment is
Figure GDA0002830838190000049
Where β is the upper bound of the increment set, λ2For setting the constant for the delta increase tendency,
Figure GDA0002830838190000051
is composed of
Figure GDA0002830838190000052
Middle bstrIDA non-zero number of bits.
3. Issue invalid block BjVerification invalid information of
Figure GDA0002830838190000053
Corresponding increment is
Figure GDA0002830838190000054
Where γ is the upper bound of the increment set, λ3For setting the constant for the delta increase tendency,
Figure GDA0002830838190000055
is composed of
Figure GDA0002830838190000056
Length of verified serial mined solution B.s.
4. Issue invalid block BjI.e. in BjThere are invalid bits in the solution B.s of the serial excavation. Corresponding increment is
Figure GDA0002830838190000057
Wherein, T<0 is a set upper increment bound, eta, lambda4For setting the constant for the delta increase tendency,
Figure GDA0002830838190000058
is composed of
Figure GDA0002830838190000059
Length of verified serial mined solution B.s.
5. Accepting invalid block BjI.e. publishing based on BjThe next block B is generatedj+1. Corresponding increment is
Figure GDA00028308381900000510
Wherein-p<0 is the lower bound of the increment set, λ5L (B) is a constant for setting the falling tendency of Δj) Is BjS length.
6. Exacerbating block chain branching. Blocks or validation information of close depth on different branches are published. Let S be a block or a set of block authentication information issued by the same user at different forks, and increment thereof is
Figure GDA00028308381900000511
Wherein- τ is<0 is a set upper increment bound, λ6For setting a constant for increasing the trend of delta, L (S) is for the modules of serial mining in SThe sum of the length of the solution (or the number of validation bits).
S203, setting different levels of ore digging difficulty for miners according to the quantized credit values: let the Miner p reputation value CpObeying the positive-Tai distribution N (mu, sigma), and the mining difficulty DpCalculated according to the following piecewise function:
Figure GDA0002830838190000061
wherein F is the miner credit value CpOf the cumulative distribution function, ΔL＝max{Lp-LThr,0}，LpSMP Length, L, for a mineworker p to successfully insert a previous Block in a Block chainThrA threshold value, θ, is specified for the systema,θb,θc,θd,δa,δb,δc,δdTo specify the constants, the following conditions are satisfied:
θa＝θb+F(μ+σ)(δb-δa),
θb＝θc+F(μ)(δc-δb),
θc＝θd+F(μ-σ)(δd-δc),
θd＝θd+F(μ-2σ),
0<δa<δb≤1<δc<δd.
s204, defining a block BiIntegral function
Figure GDA0002830838190000062
Wherein C ispTo generate BiF is a credit cumulative distribution function, LiIs BiLength of solution of serial excavation, LThrA threshold is specified for the system. In the serial ore excavation solving stage, the miners preferentially select B with the highest total integral sum of the branch blocksiAnd initializing ore excavation information when the block is the current block.
Compared with the prior art, the invention has the beneficial effects that: because the serial ore excavation modules can only solve in sequence and in series, the efficiency and the success rate of ore excavation by a miner in a combined manner cannot be obviously improved, and the problem of resource centralization in the existing block chain network is effectively solved; and the miner reputation module can enable miners with higher credibility to have greater advantages in the mine excavation competition. The miner reputation module can effectively resist malignant competitive behaviors, such as 51% attack, selfish mining and the like.
Drawings
FIG. 1 is a flow chart of a block chain formula method based on reputation certification
FIG. 2 is a block chain data structure based on reputation certification
FIG. 3 is a schematic diagram of an ore excavation process based on serial ore excavation modules
FIG. 4 is a schematic diagram of feature string bstr extraction
FIG. 5 is a schematic view of a single miner verification generation process of a serial mining module
FIG. 6 is a schematic view of a serial mining module integrity verification generation process
FIG. 7 is a schematic diagram of user reputation ranking
FIG. 8 is a diagram illustrating a mine excavation difficulty function
FIG. 9 is a block scoring function diagram
Detailed Description
The invention is further illustrated below with reference to the figures and examples. Wherein the drawings are for illustrative purposes only and represent only schematic or one of the possible embodiments, rather than fixed or equivalent, and are not to be construed as limiting the present patent; to better illustrate the embodiments of the present invention, some parts of the drawings may be omitted, enlarged or reduced, and do not represent the size of an actual product; it will be understood by those skilled in the art that certain well-known structures in the drawings and descriptions thereof may be omitted.
The drawings are for illustrative purposes only and are not to be construed as limiting the patent;
it will be understood by those skilled in the art that certain well-known structures in the drawings and descriptions thereof may be omitted.
The technical solution of the present invention is further described below with reference to the accompanying drawings and examples.
As shown in fig. 1-8, a block chain consensus method based on reputation certification is proposed to prevent the miners from colluding and digging in a serial manner, and a flow chart thereof is shown in fig. 1. Because the SMPs can only be processed in series in sequence, the efficiency and the success rate of ore excavation by a miner in combination cannot be obviously improved, and the problem of resource centralization in the existing block chain network is effectively solved. Secondly, the credit certification-based block chain consensus method provides the credit degree of miners based on the historical behavior of the miners, and mine excavation difficulties of different levels are set for the miners according to the credit degree, so that the miners with high reliability have greater advantages in mine excavation competition, and the vicious competition behaviors such as selfish mine excavation and the like are effectively resisted.
The block chain consensus method based on the credit proof comprises a serial ore digging module and a miner credit module. As shown in fig. 2, in a reputation-based blockchain network, each chunk i contains two parts, a chunk header and a transaction Merkel Tree. The hash value of the previous block, the mining information Mine of the block, the depth i of the block and the root node of the Merkel Tree are recorded in the block header. And BiThe transaction Merkel Tree of (1) contains two types of transaction records: monetary transactions and reputation value transactions. The currency transaction comprises input and output of each transaction, and the credit value transaction record comprises a credit value account ID, credit value Increment, updated credit value Balance and corresponding mine excavation event information Proof.
S10, the ore excavation process based on the serial ore excavation module is an infinite loop of two stages of solving and verifying, and is shown in figure 3.
The solving phase comprises the following three steps:
s101, generating the following initialized mining information according to the current block information and the complete verification information:
msg＝SigID(Pi-1||Ri-1||Vi-1)||i
therein, SigIDIn a digital signature algorithm, ID is used to specify the private signature key, i-1 and i are the current block depth and the next block depth,Pi-1as hash value of current chunk header, Ri-1For the transaction Mekel tree root node, V, corresponding to the current blocki-1And the hash value of the complete verification information of the current block.
S102, the miners serially generate a sequence of numbers { a ] according to the initialized mining informationn},{bn}：
Figure GDA0002830838190000091
bj＝bit(hash(msg||aj))
Wherein, the function bit has the fixed-length information hash (msg | | | a)j) For inputting and outputting a random bit bjThe hash is a hash function. If al∈{anSatisfy hash (msg | | a)l)≤DIDIs an effective solution of the serial mining module, wherein DIDThe mining difficulty is calculated according to the credit value of miners.
S103, generating an unverified block BiAnd published into the network.
S104, selecting the block B with the highest integral sum of the branch blocks from the unverified block set S as the current block.
S105, verifying that the inequality hash (msg | B.s) is less than or equal to DIDIf true, wherein B.s is the SMP solution for the corresponding block. If the inequality is true, the process proceeds to step S106, otherwise, B is deleted from S and the process returns to step S104.
S106. As shown in figure 4, extracting the character string bstr according to B.s and the miner IDIDWhere B.s and ID are used as input in the function Extr (B.s, ID), a random string with the length equal to B.s is output.
S107. as shown in figure 5, for
Figure GDA0002830838190000092
Verifying B.s th bit bj. If equation bj＝bit(hash(msg||aj) B) is establishedjIs a valid bit, otherwise is an invalid bit, wherein ajA string of B.s first j-1 bits. If it is paired with
Figure GDA0002830838190000093
bjAll are valid bits, and generate verification valid information
Figure GDA0002830838190000101
Broadcast to the network, proceed to step S108. Otherwise, generating verification invalid information
Figure GDA0002830838190000102
Broadcast into the network, delete B from S and go back to step S104, where ebit is invalid bit information such that Bebit≠bit(hash(msg||aebit))，
S108. As shown in FIG. 6, a verification information set S of B.s is generatedV. Set SVThe following character strings correspond:
Figure GDA0002830838190000103
if receiving the verification invalid information
Figure GDA0002830838190000104
B is deleted from S and returns to step 1. If receiving the verification information
Figure GDA0002830838190000105
Then will be
Figure GDA0002830838190000106
Is added to SVIn (1). If the ORbst is the all-1 character string, the verification successfully enters a solving stage, and the B is used as the current block for ore excavation.
S20, mine excavation difficulty degree definition based on miner reputation module
S201, in the block chain consensus method based on the credit certification, each miner needs to bind the account number to the global IP address of the miner, and initializes the credit account of the miner. Each reputation account contains two quantities: a reputation value and a monetary value. Where the initial reputation value of the account is 0, the block rewards of each block will only be accumulated into the monetary value of the valid reputation account.
S202, credit value increment is defined for the six types of mining events in the miner credit module, the events are recorded in each block as credit value transactions, and quantification of the miner credit value is achieved. The mine excavation event is defined as follows
1. Successful insertion of Block B into the Block chaini. Corresponding increment is
Figure GDA0002830838190000107
Where α is the upper bound of the increment set, λ1L (B) as a constant for setting the Δ growth tendencyi) Is a block BiCorresponding SMP solution BiS length.
2. For blocks B in a block chainiProviding authentication validity information
Figure GDA0002830838190000108
Corresponding increment is
Figure GDA0002830838190000111
Where β is the upper bound of the increment set, λ2For setting the constant for the delta increase tendency,
Figure GDA0002830838190000112
is composed of
Figure GDA0002830838190000113
Middle bstrIDA non-zero number of bits.
3. Issue invalid block BjVerification invalid information of
Figure GDA0002830838190000114
Corresponding increment is
Figure GDA0002830838190000115
Where γ is the upper bound of the increment set, λ3For setting the constant for the delta increase tendency,
Figure GDA0002830838190000116
is composed of
Figure GDA0002830838190000117
The length of the solution B.s of the verified serial excavation module.
4. Issue invalid block BjI.e. in BjThere are invalid bits in the MSP solution B.s. Corresponding increment is
Figure GDA0002830838190000118
Wherein, T<0 is a set upper increment bound, eta, lambda4For setting the constant for the delta increase tendency,
Figure GDA0002830838190000119
is composed of
Figure GDA00028308381900001110
The length of the solution B.s of the verified serial excavation module.
5. Accepting invalid block BjI.e. publishing based on BjThe next block B is generatedj+1. Corresponding increment is
Figure GDA00028308381900001111
Wherein-p<0 is the lower bound of the increment set, λ5L (B) is a constant for setting the falling tendency of Δj) Is BjS length.
6. Exacerbating block chain branching. Blocks or validation information of close depth on different branches are published. Let S be a block or a set of block authentication information issued by the same user at different forks, and increment thereof is
Figure GDA00028308381900001112
Wherein- τ is<0 is a set upper increment bound, λ6L (S) is the sum of the solution lengths (or the number of validation bits) of the serial excavation modules in S, which is a constant for setting the Δ growth trend.
S203, mine digging difficulties of different grades are set for miners according to the quantized credit values. Let the Miner p reputation value CpSubject to the positive too distribution N (μ, σ), the user reputation values are divided into 5 levels according to their distribution, as shown in fig. 7. Defining a piecewise function D shown in FIG. 8 according to reputation degree rankingpCalculating the corresponding ore digging difficulty for miners:
Figure GDA0002830838190000121
wherein, F (C)p) For miner credit value CpOf the cumulative distribution function, ΔL＝max{Lp-LThr,0}，LpLength of serial excavation, L, for a miner p to successfully insert a previous block in a block chainThrA threshold value, θ, is specified for the systema,θb,θc,θd,δa,δb,δc,δdTo specify the constants, the following conditions are satisfied
θa＝θb+F(μ+σ)(δb-δa),
θb＝θc+F(μ)(δc-δb),
θc＝θd+F(μ-σ)(δd-δc),
θd＝θd+F(μ-2σ),
0<δa<δb≤1<δc<δd.
S204, as shown in FIG. 9, define block BiIntegral function
Figure GDA0002830838190000122
Wherein C ispTo generate BiF is a credit cumulative distribution function, LiIs BiLength of solution, L, of the serial excavation moduleThrA threshold is specified for the system. In the solving stage of the serial ore digging module, a miner preferentially selects B with the highest total integral sum of the branch blocksiAnd initializing ore excavation information when the block is the current block.
The terms describing positional relationships in the drawings are for illustrative purposes only and are not to be construed as limiting the patent;
it should be understood that the above-described embodiments of the present invention are merely examples for clearly illustrating the present invention, and are not intended to limit the embodiments of the present invention. Other variations and modifications will be apparent to persons skilled in the art in light of the above description. And are neither required nor exhaustive of all embodiments. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the claims of the present invention.

Claims (5)

1. A block chain consensus method based on reputation certification is characterized by comprising the following steps:
s10 in the serial excavation stage, a miner firstly generates initialized excavation information according to the current block information and complete verification information of the block chain network, serially generates a sequence according to the initialized excavation information and solves the sequence, generates an unverified block according to the obtained solution, and issues the unverified block to the network to verify the validity of the unverified block;
s20, in the block chain network, the credit value transaction of each event is recorded in each block, the quantification of the credit value is realized, and different mining difficulties are set for miners according to the quantified credit value;
in S10, the serial generation of the sequence of numbers according to the initialized mining information and the solving includes the following steps:
s101, firstly, a miner generates initial excavation information according to the current block information and the complete verification information:
msg＝SigID(Pi-1||Ri-1||Vi-1)||i
therein, SigIDIs a digital signature algorithm, ID is used to specify the private key of the signature, i-1 and i are the current block depth and the next block depth, Pi-1As hash value of current chunk header, Ri-1For the root node of the traded Merck tree corresponding to the current block, Vi-1The hash value of the complete verification information of the current block is obtained;
s102, the miners serially generate the sequence of numbers { a ] according to the initialized mining informationn},{bn}：
Figure FDA0002830838180000011
bj＝bit(hash(msg||aj))
Wherein, the function bit has the fixed-length information hash (msg | | | a)j) For inputting and outputting a random bit bjThe hash is a hash function;
s103, calculating an effective serial ore excavation solution, generating an unverified block according to the solution and issuing the unverified block to a network;
the specific steps of issuing the unverified block to the network to verify the validity thereof are as follows:
s104, selecting a block B with the highest integral sum of the branch blocks as a current block from the unverified block set S;
s105 verifying that inequality hash (B.s) is less than or equal to DIDIf true, wherein B.s is the solution for serial excavation of the corresponding block, DIDIf the inequality is true, the step S106 is executed, otherwise, the step B is deleted from the step S and the step S104 is executed again;
s106, extracting the character string bstr according to B.s and the miner IDIDThe function Extr takes B.s and ID as input, and outputs a random character string with the length equal to B.s;
s107 pairs
Figure FDA0002830838180000021
Verifying B.s th bit bjIf equation bj＝bit(hash(msg||aj) B) is establishedjIs a valid bit, otherwise is an invalid bit, wherein ajA string of B.s first j-1 bits, if any
Figure FDA0002830838180000022
sjAll are valid bits, and generate verification valid information
Figure FDA0002830838180000023
Broadcasting to the network, and entering the next step; otherwise, generating verification invalid information
Figure FDA0002830838180000024
Broadcast into the network, delete B from S and go back to step S104, where ebit is invalid bit information such that Bebit≠bit(hash(msg||aebit))；bj
S108 generating B.s verification information set SVSet SVThe following character strings correspond:
Figure FDA0002830838180000025
if receiving the verification invalid information
Figure FDA0002830838180000026
Delete B from S and return to S104; if receiving the verification information
Figure FDA0002830838180000031
Then will be
Figure FDA0002830838180000032
Is added to SVPerforming the following steps; if the ORbst is the all-1 character string, the verification successfully enters a solving stage, and the B is used as the current block for ore excavation;
the specific steps of S20 are as follows:
s201, in a miner credit system, each miner needs to bind the account number to the global IP address of the miner and initialize the credit account of the miner; each reputation account contains two quantities: a reputation value and a monetary value; wherein, the initial credit value of the account is 0, and the block reward of each block is only accumulated into the monetary value of the effective credit account;
s202, credit value increment is defined for mining events in a miner credit system, and the events are recorded in each block as credit value transactions to realize the quantification of the miner credit value;
s203, setting different levels of ore digging difficulty for miners according to the quantized credit value: let the Miner p reputation value CpObeying the positive-Tai distribution N (mu, sigma), and the mining difficulty DpCalculating according to a specific piecewise function;
s204 defines the block BiIntegral function
Figure FDA0002830838180000033
Wherein C ispTo generate BiF is a probability cumulative function of the positive-Tai distribution, LiIs BiLength of solution of serial excavation, LThrA threshold is specified for the system.
2. The reputation-based blockchain consensus method of claim 1, wherein said mine excavation events defined with a reputation value increment comprise six types of mine excavation events,
1) successful insertion of Block B into the Block chainiCorresponding to an increment of
Figure FDA0002830838180000034
Where α is a fixed incremental upper bound, λ1L (B) as a constant for setting the Δ growth tendencyi) Is a block BiSolution B corresponding to serial ore excavation moduleiThe length of s;
2) for blocks B in a block chainiProviding authentication validity information
Figure FDA0002830838180000035
Corresponding increment is
Figure FDA0002830838180000041
Where β is the upper bound of the increment set, λ2For setting the constant for the delta increase tendency,
Figure FDA0002830838180000042
is composed of
Figure FDA0002830838180000043
Middle bstrIDA non-zero number of bits;
3) issue invalid block BjVerification invalid information of
Figure FDA0002830838180000044
Corresponding increment is
Figure FDA0002830838180000045
Where γ is the upper bound of the increment set, λ3For setting the constant for the delta increase tendency,
Figure FDA0002830838180000046
is composed of
Figure FDA0002830838180000047
Length of the verified serial mined solution B.s;
4) issue invalid block BjI.e. in BjThere are invalid bits in the solution B.s for the serial excavation corresponding to increments of
Figure FDA0002830838180000048
Wherein, T<0 is a set upper increment bound, eta, lambda4For setting the constant for the delta increase tendency,
Figure FDA0002830838180000049
is composed of
Figure FDA00028308381800000410
Length of the verified serial mined solution B.s;
5) accepting invalid block BjI.e. publishing based on BjThe next block B is generatedj+1Corresponding to an increment of
Figure FDA00028308381800000411
Wherein-p<0 is the lower bound of the increment set, λ5L (B) is a constant for setting the falling tendency of Δj) Is BjThe length of s;
6) aggravating block chain bifurcation, issuing blocks or verification information with close depths on different branches, and setting S as a set of block or block verification information issued by the same user on different bifurcations in increments of
Figure FDA00028308381800000412
Wherein- τ is<0 is a set upper increment bound, λ6L (S) is the sum of the MSP solution lengths (or the number of verification bits) in S, which is a constant used to set the delta growth trend.
3. A reputation based blockchain consensus method according to claim 1, wherein said specific piecewise function is
Figure FDA0002830838180000051
Wherein F is the miner credit value CpOf the cumulative distribution function, ΔL＝max{Lp-LThr,0}，LpLength of solution for serial excavation of a previous block successfully inserted into a blockchain by a miner p, LThrA threshold is specified for the system.
4. The reputation-based blockchain consensus method of claim 1, wherein the constraints comprise the following:
θa＝θb+F(μ+σ)(δb-δa),
θb＝θc+F(μ)(δc-δb),
θc＝θd+F(μ-σ)(δd-δc),
θd＝θd+F(μ-2σ),
0<δa<δb≤1<δc<δd.
wherein, thetaa,θb,θc,θd,δa,δb,δc,δdAre designated as constants.
5. The reputation-based blockchain consensus method of claim 1, wherein S10 is preceded by: s01 Miner prefers to choose the branch block with the highest total score BiThe block is the current block.
CN201810876700.5A 2018-08-03 2018-08-03 Reputation certification based block chain consensus method Active CN109194482B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810876700.5A CN109194482B (en) 2018-08-03 2018-08-03 Reputation certification based block chain consensus method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810876700.5A CN109194482B (en) 2018-08-03 2018-08-03 Reputation certification based block chain consensus method

Publications (2)

Publication Number Publication Date
CN109194482A CN109194482A (en) 2019-01-11
CN109194482B true CN109194482B (en) 2021-02-12

Family

ID=64920034

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810876700.5A Active CN109194482B (en) 2018-08-03 2018-08-03 Reputation certification based block chain consensus method

Country Status (1)

Country Link
CN (1) CN109194482B (en)

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110011981B (en) * 2019-03-15 2021-06-29 湖北工程学院 Trusted cloud storage method and system based on block chain
CN110232167B (en) * 2019-05-16 2023-05-02 中山大学 Block chain consensus mechanism based on optimization problem
CN110493323B (en) * 2019-07-29 2020-12-01 华南理工大学 Block chain-based fairness file distribution method, system and storage medium
CN111274324A (en) * 2020-02-12 2020-06-12 北京元链科技有限公司 Admissibility digital asset transfer method
CN111539729A (en) * 2020-05-21 2020-08-14 北京俩撇科技有限公司 Transaction signature checking method and device based on block chain
US20210390549A1 (en) * 2020-06-15 2021-12-16 Capital One Services, Llc Systems and methods for building blockchains for verifying assets for smart contracts
CN111698265A (en) * 2020-06-29 2020-09-22 曲阜师范大学 Intelligent pure bribery selfie mine excavation attack algorithm
CN112600917B (en) * 2020-12-11 2022-05-03 重庆邮电大学 Reputation-based block chain work proving method
CN113014392B (en) * 2021-02-19 2022-04-08 湖南大学 Block chain-based digital certificate management method, system, equipment and storage medium
CN113326240B (en) * 2021-06-22 2023-05-30 哈尔滨工程大学 Data sharing method of energy consumption sensitive terminal node in edge network
CN116760526B (en) * 2023-06-08 2024-04-26 山东大学 Parallel reputation consensus method for under-chain storage

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106789090A (en) * 2017-02-24 2017-05-31 陈晶 Public key infrastructure system and semi-random participating certificate endorsement method based on block chain
CN106952082A (en) * 2017-03-06 2017-07-14 钱德君 A kind of Quantum Chain common recognition mechanism method proved based on share
CN107945020A (en) * 2017-11-28 2018-04-20 浙江师范大学 A kind of block chain is sustainable to dig ore deposit method and system
CN108052530A (en) * 2017-11-10 2018-05-18 杭州云象网络技术有限公司 A kind of decentralization CA construction methods and its system based on alliance's chain

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106789090A (en) * 2017-02-24 2017-05-31 陈晶 Public key infrastructure system and semi-random participating certificate endorsement method based on block chain
CN106952082A (en) * 2017-03-06 2017-07-14 钱德君 A kind of Quantum Chain common recognition mechanism method proved based on share
CN108052530A (en) * 2017-11-10 2018-05-18 杭州云象网络技术有限公司 A kind of decentralization CA construction methods and its system based on alliance's chain
CN107945020A (en) * 2017-11-28 2018-04-20 浙江师范大学 A kind of block chain is sustainable to dig ore deposit method and system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
何蒲等.区块链技术与应用前瞻综述.《计算机科学》.2017, *

Also Published As

Publication number Publication date
CN109194482A (en) 2019-01-11

Similar Documents

Publication Publication Date Title
CN109194482B (en) Reputation certification based block chain consensus method
CN108352009B (en) Block chain generation device, block chain generation method, block chain verification device, block chain verification method, and computer-readable storage medium
CN108292395B (en) Block chain generation device, block chain generation method, block chain verification device, block chain verification method, and computer-readable storage medium
US20200145197A1 (en) System and method for parallel-processing blockchain transactions
Ritz et al. The impact of uncle rewards on selfish mining in ethereum
CN110941673B (en) Block chain data structure and task processing method and device
CN109639430B (en) Safe high-speed lightweight block chain system and method
US7512801B1 (en) Authentication system, authentication method, signing apparatus, signing method, certifying apparatus, certifying method, and a computer-readable recording medium with a program making a computer execute the method recording therein
CN110378697B (en) Block chain light node UTXO transaction verification method and device based on RSA accumulator
KR102017739B1 (en) Blockchain system and method of creating blockchain
CN109743182B (en) Intelligent contract approval method and system based on block chain
Kim et al. POSTER: Mining with proof-of-probability in blockchain
CN110084596B (en) Method and device for processing block chain mixed consensus
Shi et al. Pooling is not favorable: Decentralize mining power of PoW blockchain using age-of-work
De Roode et al. How to break IOTA heart by replaying?
CN111292190A (en) Transaction generation method, block creation method, related device and equipment
Reddy securePrune: Secure block pruning in UTXO based blockchains using Accumulators
Long Nakamoto consensus with verifiable delay puzzle
Ghimire Analysis of bitcoin cryptocurrency and its mining techniques
Yuan et al. Analysis of blockchain protocol against static adversarial miners corrupted by long delay attackers
CN109218289B (en) Consensus mechanism of entangled network based on serial workload certification
CN113256417A (en) Transaction sharing-based consensus block method and system
CN108564365A (en) A kind of method of commerce and system of the intelligent grid based on block chain
Pachal et al. Rational mining of Bitcoin
CN109447640B (en) Rights and interests-based improved PoW consensus algorithm

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
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20220303

Address after: 528299 Building 5, phase I, Guangdong Xiaxi International Rubber and plastic city, Nanping West Road, Guicheng Street, Nanhai District, Foshan City, Guangdong Province 20107

Patentee after: Guangdong xinanhuai Technology Development Co.,Ltd.

Address before: 510275 No. 135 West Xingang Road, Guangzhou, Guangdong, Haizhuqu District

Patentee before: SUN YAT-SEN University