CN110233737A - Common recognition method, apparatus, computer equipment and storage medium based on DPoS - Google Patents
Common recognition method, apparatus, computer equipment and storage medium based on DPoS Download PDFInfo
- Publication number
- CN110233737A CN110233737A CN201910580246.3A CN201910580246A CN110233737A CN 110233737 A CN110233737 A CN 110233737A CN 201910580246 A CN201910580246 A CN 201910580246A CN 110233737 A CN110233737 A CN 110233737A
- Authority
- CN
- China
- Prior art keywords
- verification
- node
- block
- nodes
- hash
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 29
- 238000012797 qualification Methods 0.000 claims abstract description 21
- 238000012795 verification Methods 0.000 claims description 176
- 238000012545 processing Methods 0.000 claims description 10
- 238000004590 computer program Methods 0.000 claims description 9
- 238000004806 packaging method and process Methods 0.000 claims description 7
- 230000007246 mechanism Effects 0.000 abstract description 13
- 238000004891 communication Methods 0.000 description 10
- 230000008569 process Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 206010063659 Aversion Diseases 0.000 description 1
- 238000013475 authorization Methods 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000005242 forging Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 239000003999 initiator Substances 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000001915 proofreading effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
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
- 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
- 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
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- 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
-
- 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/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Computer Security & Cryptography (AREA)
- Technology Law (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- Economics (AREA)
- Development Economics (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
Abstract
This application discloses common recognition method, apparatus, computer equipment and storage medium based on DPoS, the transaction in trading pit is packaged into block by super node, and the trading pit is stored with the transaction occurred on block chain；Super node sends the block and gives at least one alternative verifying node, and the one or more of at least one alternative verifying node obtains the qualification of verifying node by way of proof of work；Super node receives the message of the good authentication of one or more of verifying nodes, by the block cochain.The application can be by determining verifying node using the mode of PoW on the basis of DPoS common recognition mechanism, so that avoiding the problem that going out block node in DPoS common recognition mechanism combines the safety done evil, and then promote block catenary system with verifying node.
Description
Technical Field
The present application relates to the field of block chain technologies, and in particular, to a DPoS-based consensus method, apparatus, computer device, and storage medium.
Background
The distributed consensus algorithm is an important technology for ensuring the consistency of system states in a distributed system, and is an important basis of a distributed file system and a distributed database. The block chain adopts a distributed consensus algorithm to establish the system state under the environment without central node control and possibly with the existence of damaged nodes, thereby establishing trust.
The existing authorization rights certification consensus mechanism (DPoS) adopts a proxy voting mode to select a certain number of super nodes (also called as block-out nodes) to be responsible for block-out; and then, the verification node responsible for verification verifies the newly generated block, and after the verification is passed, the super node uplinks the newly generated block.
However, the verification process of the new block may be malicious; for example: the super node tampers the transaction information in the newly generated block, sends the newly generated block to a pre-specified verification node for verification, and feeds back a message of successful verification to the super node, and then the super node links the tampered block; resulting in a breakdown of the entire blockchain system.
Therefore, how to find a consensus mechanism related to the block chain, which can solve the above-mentioned situation that the super node and the verification node cooperate with each other, is a problem to be solved urgently.
The above is only for the purpose of assisting understanding of the technical solutions of the present application, and does not represent an admission that the above is prior art.
Disclosure of Invention
In order to solve the above problems, the present application provides a DPoS-based consensus method and apparatus, which enable a DPoS consensus mechanism to be more perfect and enable verification nodes to be more random, thereby avoiding the malicious problem of a combination of a block-out node and a verification node.
A first aspect of the present application provides a DPoS-based consensus method, including:
the super node packs the transactions in a transaction pool into blocks, and the transaction pool stores the transactions generated on a block chain;
the super node sends the block to at least one alternative verification node, and one or more of the at least one alternative verification node obtains the qualification of the verification node in a workload proving mode;
and the super node receives the message of successful verification of the one or more verification nodes and uplinks the blocks.
In one example, one or more of the at least one candidate verification node qualifies the verification node by way of workload attestation; the method specifically comprises the following steps:
one or more of the at least one candidate verification node obtains a second hash value by performing a first hash operation and a second hash operation on the block header of the block; the block header comprises a block version number, a hash value of a previous block, a Merkel root, a timestamp, a current difficulty value and a random number, and the second hash operation is to perform hash operation on a first hash value obtained by the first hash operation;
and when one or more of the at least one candidate verification node is smaller than a preset value according to the second hash value calculated by the one or more candidate verification nodes, determining the one or more candidate verification nodes to become verification nodes.
In one example, the first hash operation and the operation are the same hash operation.
In one example, the super node receives a message of successful authentication of the one or more authentication nodes, uplinks the block; further comprising:
the super node performs workload certification verification on the one or more verification nodes to confirm that the one or more verification nodes acquire verification node qualification; wherein,
the workload certification verification comprises verifying whether the second hash value calculated by the one or more verification nodes is smaller than a preset value.
A second aspect of the present application provides a DPoS-based consensus apparatus, which includes a sending unit, a processing unit, and a receiving unit; wherein,
the processing unit packs the transactions in the transaction pool into blocks, and the transaction pool stores the transactions generated on the block chain;
the sending unit is used for sending the block to at least one candidate verification node, and one or more of the at least one candidate verification node acquires the qualification of the verification node in a workload certification mode;
the receiving unit receives a message of successful verification of the one or more verification nodes, and chains the blocks.
In one example, one or more of the at least one candidate verification node qualifies the verification node by way of workload attestation; the method specifically comprises the following steps:
one or more of the at least one candidate verification node obtains a second hash value by performing a first hash operation and a second hash operation on the block header of the block; the block header comprises a block version number, a hash value of a previous block, a Merkel root, a timestamp, a current difficulty value and a random number, and the second hash operation is to perform hash operation on a first hash value obtained by the first hash operation;
and when one or more of the at least one candidate verification node is smaller than a preset value according to the second hash value calculated by the one or more candidate verification nodes, determining the one or more candidate verification nodes to become verification nodes.
In one example, the first hash operation and the operation are the same hash operation.
In one example, the receiving unit receives a message of successful authentication of the one or more authentication nodes, and chains the blocks; further comprising:
the processing unit is used for carrying out workload certification verification on the one or more verification nodes and confirming that the one or more verification nodes obtain verification node qualification; wherein,
the workload certification verification comprises verifying whether the second hash value calculated by the one or more verification nodes is smaller than a preset value.
A third aspect of the application provides a computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor performing the following program steps:
packaging the transactions in a transaction pool into blocks, wherein the transaction pool stores the transactions occurring on a block chain;
sending the block to at least one alternative verification node, wherein one or more of the at least one alternative verification node obtains the qualification of the verification node through a workload certification mode;
and receiving a message of successful verification of the one or more verification nodes, and uplink the blocks.
A fourth aspect of the present application provides a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the following program steps:
packaging the transactions in a transaction pool into blocks, wherein the transaction pool stores the transactions occurring on a block chain;
sending the block to at least one alternative verification node, wherein one or more of the at least one alternative verification node obtains the qualification of the verification node through a workload certification mode;
and receiving a message of successful verification of the one or more verification nodes, and uplink the blocks.
According to the method and the device, the verification node can be determined by using a PoW mode on the basis of the DPoS common identification mechanism, so that the problem that a block node and the verification node are combined and cooperate badly in the DPoS common identification mechanism is avoided, and the safety of a block chain system is improved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application.
Fig. 1 is a schematic flow chart of a DPoS-based consensus method according to an embodiment of the present disclosure;
fig. 2 is a schematic structural diagram of a DPoS-based consensus device according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a computing device related to a block chain according to an embodiment of the present application.
Detailed Description
In order to more clearly explain the overall concept of the present application, the following detailed description is given by way of example in conjunction with the accompanying drawings.
The terms "first," "second," and the like in the description and in the claims of the present application and in the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the order of such use may be interchanged under appropriate circumstances such that embodiments of the invention described herein may be practiced in other orders than those illustrated or described herein.
Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
The node referred to in the embodiment of the present application may be understood as an abstract machine that responds to an external specific trigger condition and performs state conversion according to a certain rule, and may be a device that can be installed with application software and can be networked, such as a mobile phone, a tablet computer, a palm computer, a personal PC, and the like.
Currently, in a common recognition mechanism of DPoS, a predetermined number of super nodes (for example, 21 super nodes) are responsible for acquiring transactions from a transaction pool and packaging the transactions; and verifying the packed block, and directly chaining the block after the verification is passed. Block uplink refers to placing a newly generated block after the last block of an existing block chain, i.e. the super node records the new block on the local block chain book.
As can be seen from the above, the super node itself can verify the newly generated block.
Therefore, in order to avoid the malicious behavior of the super node of the block, the super node A packages and generates a new block, and then sends the block to the super nodes except the super node A for verification. If super node A does not perform any transaction with super node B as the verification node, super node A modifies a transaction in the block, and super node B passes the verification, super node A links the block. The super node B will also uplink the modified block, which results in a system error in the block chain system and a system crash. The mode of doing the aversion: modifying the address of the recipient of the transaction, or forging the transaction.
Therefore, the application sets a consensus mechanism, and in the DPoS consensus mode, the verification node obtains the qualification of the verification node in a mode of verifying PoW through workload; therefore, the selection of the verification node is more random, the possibility of joint operation is reduced, the modified blocks can be verified, and the problematic blocks cannot be linked up.
It should be noted that, in the above description, the super node a generates the problematic block a, and after the super node a is verified by the super node B, only the super node a and the super node B associated with the bad block will link the block a; the super nodes except the super nodes A and B also verify the block and determine whether to chain the block according to the verification result; only if all super nodes do bad will each super node store the block on the local blockchain ledger. In the present application, in order to prevent a problem or a modified block, the link is established in a way that the block output node and the verification node cooperate with each other; workload proofreading is employed to select verification nodes.
As shown in fig. 1, a DPoS-based consensus method includes steps S101-S103.
S101, the super node packs the transactions in the transaction pool into blocks, and the transaction pool stores the transactions generated on the block chain.
S102, the super node sends the block to at least one candidate verification node, and one or more of the at least one candidate verification node obtains the qualification of the verification node in a workload certification mode.
S103, the super node receives the message of successful verification of the one or more verification nodes and links the blocks.
In one example, one or more of the at least one candidate verification node qualifies the verification node by way of workload attestation; the method specifically comprises the following steps:
one or more of the at least one candidate verification node obtains a second hash value by performing a first hash operation and a second hash operation on the block header of the block; the block header comprises a block version number, a hash value of a previous block, a Merkel root, a timestamp, a current difficulty value and a random number, and the second hash operation is to perform hash operation on a first hash value obtained by the first hash operation;
and when one or more of the at least one candidate verification node is smaller than a preset value according to the second hash value calculated by the one or more candidate verification nodes, determining the one or more candidate verification nodes to become verification nodes.
At the moment, the preset value can be adjusted according to the current difficulty value; since the candidate verification node verifies the newly generated block, the timestamp and the merkel root are already determined, and the candidate verification node may continuously try the random number until the calculated second hash value is smaller than the preset value.
It should be noted that, in the verification process of a newly generated block, the second hash value calculated by one or more candidate verification nodes may be smaller than a preset value; at this time, the time of the second hash value is calculated according to the plurality of candidate verification nodes, the ordering is carried out, and one or more candidate verification nodes which are calculated firstly are selected as verification nodes.
In one example, the preset value is the maximum preset value/current difficulty value. The maximum preset value is a constant value:
0x00000000 FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF. And, the preset value can be adjusted, the current difficulty value is the old difficulty value (the actual time spent by 2016 blocks in the past/the expected time spent by 2016 blocks in the past).
In addition, after the alternative verification node becomes the verification node, the newly generated block is verified, and the verification includes verifying the digital signature in each transaction, whether the balance of the transaction initiator is sufficient, the mekerr root, whether the format of the transaction is correct, and the like. This will not be described in detail.
In one example, the first hash operation and the operation are the same hash operation.
At this time, the first Hash operation and the second Hash operation may both be Hash 256; in further examples, the first and second hash operations may operate using different hash functions.
For example: the Hash256 (block version number + Hash value of previous block + merkel root + timestamp + current difficulty value + random number)) < a preset value, and at this time, the candidate verification node obtains the qualification of the verification node, thereby verifying the newly generated block.
In one example, the super node receives a message of successful authentication of the one or more authentication nodes, uplinks the block; further comprising:
the super node performs workload certification verification on the one or more verification nodes to confirm that the one or more verification nodes acquire verification node qualification; wherein,
the workload certification verification comprises verifying whether the second hash value calculated by the one or more verification nodes is smaller than a preset value.
The verification node can be determined by using the PoW mode on the basis of the DPoS common identification mechanism, so that the problem that a block node and the verification node are combined and cooperate badly in the DPoS common identification mechanism is avoided, a modified or problematic block cannot be linked, and the safety of a block chain system is improved.
As shown in fig. 2, a consensus device related to a block chain includes a sending unit, a processing unit, and a receiving unit.
The processing unit packs the transactions in the transaction pool into blocks, and the transaction pool stores the transactions generated on the block chain.
The sending unit sends the block to at least one candidate verification node, and one or more of the at least one candidate verification node acquires the qualification of the verification node in a workload certification mode.
The receiving unit receives a message of successful verification of the one or more verification nodes, and chains the blocks.
In one example, one or more of the at least one candidate verification node qualifies the verification node by way of workload attestation; the method specifically comprises the following steps:
one or more of the at least one candidate verification node obtains a second hash value by performing a first hash operation and a second hash operation on the block header of the block; the block header comprises a block version number, a hash value of a previous block, a Merkel root, a timestamp, a current difficulty value and a random number, and the second hash operation is to perform hash operation on a first hash value obtained by the first hash operation;
and when one or more of the at least one candidate verification node is smaller than a preset value according to the second hash value calculated by the one or more candidate verification nodes, determining the one or more candidate verification nodes to become verification nodes.
In one example, the first hash operation and the operation are the same hash operation.
In one example, the receiving unit receives a message of successful authentication of the one or more authentication nodes, and chains the blocks; further comprising:
the processing unit is used for carrying out workload certification verification on the one or more verification nodes and confirming that the one or more verification nodes obtain verification node qualification; wherein,
the workload certification verification comprises verifying whether the second hash value calculated by the one or more verification nodes is smaller than a preset value.
In the above embodiments, the same or similar parts as those in the method embodiments can be found, and are not described again.
An embodiment of the present application further provides a computer device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor executes the following program steps:
packaging the transactions in a transaction pool into blocks, wherein the transaction pool stores the transactions occurring on a block chain;
sending the block to at least one alternative verification node, wherein one or more of the at least one alternative verification node obtains the qualification of the verification node through a workload certification mode;
and receiving a message of successful verification of the one or more verification nodes, and uplink the blocks.
An embodiment of the present application further provides a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the computer program implements the following program steps:
packaging the transactions in a transaction pool into blocks, wherein the transaction pool stores the transactions occurring on a block chain;
sending the block to at least one alternative verification node, wherein one or more of the at least one alternative verification node obtains the qualification of the verification node through a workload certification mode;
and receiving a message of successful verification of the one or more verification nodes, and uplink the blocks.
According to the method and the device, the verification node can be determined by using a PoW mode on the basis of the DPoS common identification mechanism, so that the problem that a block node and the verification node are combined and cooperate badly in the DPoS common identification mechanism is avoided, and the safety of a block chain system is improved.
Fig. 3 shows a schematic structural diagram of a computer device provided in an embodiment of the present specification, where the computer device may include: a processor 310, a memory 320, an input/output interface 330, a communication interface 340, and a bus 350. Wherein the processor 310, memory 320, input/output interface 330, and communication interface 340 are communicatively coupled to each other within the device via bus 350.
The processor 310 may be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an Application Specific Integrated Circuit (ASIC), or one or more Integrated circuits, and is configured to execute related programs to implement the technical solutions provided in the embodiments of the present specification.
The Memory 320 may be implemented in the form of a ROM (Read Only Memory), a RAM (random access Memory), a static storage device, a dynamic storage device, or the like. The memory 320 may store an operating system and other application programs, and when the technical solution provided by the embodiments of the present specification is implemented by software or firmware, the relevant program codes are stored in the memory 320 and called to be executed by the processor 310.
The input/output interface 330 is used for connecting an input/output module to realize information input and output. The i/o module may be configured as a component in a device (not shown) or may be external to the device to provide a corresponding function. The input devices may include a keyboard, a mouse, a touch screen, a microphone, various sensors, etc., and the output devices may include a display, a speaker, a vibrator, an indicator light, etc.
The communication interface 340 is used for connecting a communication module (not shown in the figure) to implement communication interaction between the present device and other devices. The communication module can realize communication in a wired mode (such as USB, network cable and the like) and also can realize communication in a wireless mode (such as mobile network, WIFI, Bluetooth and the like).
Bus 350 includes a path that transfers information between the various components of the device, such as processor 310, memory 320, input/output interface 330, and communication interface 340.
It should be noted that although the above-mentioned device only shows the processor 310, the memory 320, the input/output interface 330, the communication interface 340 and the bus 350, in a specific implementation, the device may also include other components necessary for normal operation. In addition, those skilled in the art will appreciate that the above-described apparatus may also include only those components necessary to implement the embodiments of the present description, and not necessarily all of the components shown in the figures.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
Those of skill would further appreciate that the various illustrative components and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative components and steps have been described above generally in terms of their functionality in order to clearly illustrate this interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
The above description is only an example of the present application and is not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (10)
1. A DPoS-based consensus method, comprising:
the super node packs the transactions in a transaction pool into blocks, and the transaction pool stores the transactions generated on a block chain;
the super node sends the block to at least one alternative verification node, and one or more of the at least one alternative verification node obtains the qualification of the verification node in a workload proving mode;
and the super node receives the message of successful verification of the one or more verification nodes and uplinks the blocks.
2. The method of claim 1, wherein one or more of the at least one alternate verification node qualifies a verification node by way of workload attestation; the method specifically comprises the following steps:
one or more of the at least one candidate verification node obtains a second hash value by performing a first hash operation and a second hash operation on the block header of the block; the block header comprises a block version number, a hash value of a previous block, a Merkel root, a timestamp, a current difficulty value and a random number, and the second hash operation is to perform hash operation on a first hash value obtained by the first hash operation;
and when one or more of the at least one candidate verification node is smaller than a preset value according to the second hash value calculated by the one or more candidate verification nodes, determining the one or more candidate verification nodes to become verification nodes.
3. The method of claim 2, wherein the first hash operation and the operation are the same hash operation.
4. The method of claim 1 wherein the super node receives a message of successful authentication of the one or more authentication nodes, uplinks the block; further comprising:
the super node performs workload certification verification on the one or more verification nodes to confirm that the one or more verification nodes acquire verification node qualification; wherein,
the workload certification verification comprises verifying whether the second hash value calculated by the one or more verification nodes is smaller than a preset value.
5. A DPoS-based consensus device is characterized by comprising a sending unit, a processing unit and a receiving unit; wherein,
the processing unit packs the transactions in the transaction pool into blocks, and the transaction pool stores the transactions generated on the block chain;
the sending unit is used for sending the block to at least one candidate verification node, and one or more of the at least one candidate verification node acquires the qualification of the verification node in a workload certification mode;
the receiving unit receives a message of successful verification of the one or more verification nodes, and chains the blocks.
6. The apparatus of claim 5, wherein one or more of the at least one alternate verification node qualifies a verification node by way of workload attestation; the method specifically comprises the following steps:
one or more of the at least one candidate verification node obtains a second hash value by performing a first hash operation and a second hash operation on the block header of the block; the block header comprises a block version number, a hash value of a previous block, a Merkel root, a timestamp, a current difficulty value and a random number, and the second hash operation is to perform hash operation on a first hash value obtained by the first hash operation;
and when one or more of the at least one candidate verification node is smaller than a preset value according to the second hash value calculated by the one or more candidate verification nodes, determining the one or more candidate verification nodes to become verification nodes.
7. The apparatus of claim 6, wherein the first hash operation and the operation are the same hash operation.
8. The apparatus of claim 5, wherein the receiving unit receives a message of successful authentication of the one or more authentication nodes, uplinks the block; further comprising:
the processing unit is used for carrying out workload certification verification on the one or more verification nodes and confirming that the one or more verification nodes obtain verification node qualification; wherein,
the workload certification verification comprises verifying whether the second hash value calculated by the one or more verification nodes is smaller than a preset value.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor performs the following program steps:
packaging the transactions in a transaction pool into blocks, wherein the transaction pool stores the transactions occurring on a block chain;
sending the block to at least one alternative verification node, wherein one or more of the at least one alternative verification node obtains the qualification of the verification node through a workload certification mode;
and receiving a message of successful verification of the one or more verification nodes, and uplink the blocks.
10. A computer-readable storage medium, characterized in that a computer program is stored on the computer-readable storage medium, which computer program, when being executed by a processor, realizes the following program steps:
packaging the transactions in a transaction pool into blocks, wherein the transaction pool stores the transactions occurring on a block chain;
sending the block to at least one alternative verification node, wherein one or more of the at least one alternative verification node obtains the qualification of the verification node through a workload certification mode;
and receiving a message of successful verification of the one or more verification nodes, and uplink the blocks.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910580246.3A CN110233737A (en) | 2019-06-28 | 2019-06-28 | Common recognition method, apparatus, computer equipment and storage medium based on DPoS |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910580246.3A CN110233737A (en) | 2019-06-28 | 2019-06-28 | Common recognition method, apparatus, computer equipment and storage medium based on DPoS |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110233737A true CN110233737A (en) | 2019-09-13 |
Family
ID=67857681
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910580246.3A Pending CN110233737A (en) | 2019-06-28 | 2019-06-28 | Common recognition method, apparatus, computer equipment and storage medium based on DPoS |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110233737A (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110597839A (en) * | 2019-09-20 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Transaction data processing method, device, equipment and storage medium |
| CN110674217A (en) * | 2019-09-23 | 2020-01-10 | 百度在线网络技术（北京）有限公司 | Block chain data processing method, device, equipment and medium |
| CN110675257A (en) * | 2019-09-12 | 2020-01-10 | 广州蚁比特区块链科技有限公司 | Method and device for constructing block group chain |
| CN110825755A (en) * | 2019-10-30 | 2020-02-21 | 北京海益同展信息科技有限公司 | Block chain consensus method, consensus node, electronic device, and storage medium |
| CN110838063A (en) * | 2019-09-30 | 2020-02-25 | 远光软件股份有限公司 | Transaction processing method based on block chain, electronic device and storage medium |
| CN111371558A (en) * | 2020-02-26 | 2020-07-03 | 百度在线网络技术（北京）有限公司 | Block chain data processing method and device, electronic equipment and medium |
| CN111683121A (en) * | 2020-05-22 | 2020-09-18 | 哈尔滨工程大学 | Cloud data tracing source block chain consensus mechanism improvement method based on DPoS |
| CN113032478A (en) * | 2019-12-24 | 2021-06-25 | 航天信息股份有限公司 | Block chain system and data uplink method, device, equipment and medium |
| CN114386974A (en) * | 2021-11-24 | 2022-04-22 | 弥达斯科技(深圳)有限公司 | Transaction method, device, system and storage medium based on zero knowledge certification |
| CN116361385A (en) * | 2022-09-01 | 2023-06-30 | 矩阵时光数字科技有限公司 | Block chain consensus method and system |
-
2019
- 2019-06-28 CN CN201910580246.3A patent/CN110233737A/en active Pending
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110675257A (en) * | 2019-09-12 | 2020-01-10 | 广州蚁比特区块链科技有限公司 | Method and device for constructing block group chain |
| CN110675257B (en) * | 2019-09-12 | 2022-09-06 | 广州蚁比特区块链科技有限公司 | Block group chain construction method and device |
| CN110597839A (en) * | 2019-09-20 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Transaction data processing method, device, equipment and storage medium |
| CN110674217B (en) * | 2019-09-23 | 2022-07-22 | 百度在线网络技术（北京）有限公司 | Block chain data processing method, device, equipment and medium |
| CN110674217A (en) * | 2019-09-23 | 2020-01-10 | 百度在线网络技术（北京）有限公司 | Block chain data processing method, device, equipment and medium |
| CN110838063A (en) * | 2019-09-30 | 2020-02-25 | 远光软件股份有限公司 | Transaction processing method based on block chain, electronic device and storage medium |
| CN110838063B (en) * | 2019-09-30 | 2024-04-12 | 远光软件股份有限公司 | Transaction processing method based on blockchain, electronic equipment and storage medium |
| CN110825755A (en) * | 2019-10-30 | 2020-02-21 | 北京海益同展信息科技有限公司 | Block chain consensus method, consensus node, electronic device, and storage medium |
| CN110825755B (en) * | 2019-10-30 | 2021-05-04 | 北京海益同展信息科技有限公司 | Block chain consensus method, consensus node, electronic device, and storage medium |
| CN113032478A (en) * | 2019-12-24 | 2021-06-25 | 航天信息股份有限公司 | Block chain system and data uplink method, device, equipment and medium |
| CN113032478B (en) * | 2019-12-24 | 2023-10-31 | 航天信息股份有限公司 | Block chain system and data uplink method, device, equipment and medium |
| CN111371558B (en) * | 2020-02-26 | 2024-01-16 | 百度在线网络技术（北京）有限公司 | Block chain data processing method and device, electronic equipment and medium |
| CN111371558A (en) * | 2020-02-26 | 2020-07-03 | 百度在线网络技术（北京）有限公司 | Block chain data processing method and device, electronic equipment and medium |
| 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 |
| CN114386974A (en) * | 2021-11-24 | 2022-04-22 | 弥达斯科技(深圳)有限公司 | Transaction method, device, system and storage medium based on zero knowledge certification |
| CN116361385A (en) * | 2022-09-01 | 2023-06-30 | 矩阵时光数字科技有限公司 | Block chain consensus method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110233737A (en) | Common recognition method, apparatus, computer equipment and storage medium based on DPoS | |
| CN110298757B (en) | Consensus method and device relating to DPoS | |
| Weigert et al. | Practical experiences in using model-driven engineering to develop trustworthy computing systems | |
| CN109922049B (en) | Verification device and method based on block chain | |
| CN110909083A (en) | Consensus method and system for verifiable random function on block chain | |
| CN110674218A (en) | Company business license tracing method and device related to block chain | |
| CN110298670B (en) | Consensus method involving PBFT and apparatus therefor | |
| CN110634001A (en) | Food circulation information tracing method and device based on block chain | |
| CN113536240A (en) | Method and device for using admission ticket by combining NFT (network File transfer) | |
| CN113536094A (en) | NFT-based non-physical mapping method and device | |
| CN110400132A (en) | Method, apparatus, computer equipment and storage medium are paid out based on block chain | |
| CN110647768A (en) | Passport deposit method and device based on block chain | |
| CN110445620A (en) | The marriage certificate for being related to block chain deposits card method and device thereof | |
| CN110598389A (en) | Method and device for storing account book certificate based on block chain | |
| CN108763934B (en) | Data processing method and device, storage medium and server | |
| CN110879787A (en) | Client test method and system | |
| JP2007080083A (en) | Ic card command transfer method, ic card information service system and terminal equipment | |
| CN111835815A (en) | Synchronous storage method and device for internet self-media data on block chain | |
| CN110990418A (en) | Asynchronous processing method and device based on block chain user data | |
| CN111831725A (en) | Synchronous storage method and device for internet tourism data on block chain | |
| CN110545188A (en) | User block chain private key signing method and device related to self-media platform | |
| CN111831643A (en) | Method and device for storing tea data on block chain | |
| CN111831649A (en) | Method and device for processing business license data on block chain | |
| CN111831723A (en) | Method and device for storing social data of internet on block chain | |
| CN111125252A (en) | Method and device for storing knowledge question and answer data on block chain |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: No.108, 1 / F, No.9, shangdijiu street, Haidian District, Beijing 100085 Applicant after: Beijing ruice Technology Co.,Ltd. Address before: No.108, 1 / F, No.9, shangdijiu street, Haidian District, Beijing 100085 Applicant before: BEIJING AIMORECE TECHNOLOGY Co.,Ltd. |
|
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |