CN111211904A - Consensus method, device and storage medium - Google Patents
Consensus method, device and storage medium Download PDFInfo
- Publication number
- CN111211904A CN111211904A CN201911284198.XA CN201911284198A CN111211904A CN 111211904 A CN111211904 A CN 111211904A CN 201911284198 A CN201911284198 A CN 201911284198A CN 111211904 A CN111211904 A CN 111211904A
- Authority
- CN
- China
- Prior art keywords
- block
- voting
- temporary
- vote
- temporary block
- 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.)
- Granted
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/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
-
- 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
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/46—Secure multiparty computation, e.g. millionaire problem
- H04L2209/463—Electronic voting
-
- 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/104—Peer-to-peer [P2P] networks
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Computer Security & Cryptography (AREA)
- Technology Law (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Development Economics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a consensus method, a device and a storage medium, which relate to the technical field of block chains and the like, and the method comprises the following steps: when the current node selects a voting node with the first block height, receiving a first temporary block proposed and broadcasted by an accounting node with the first block height; pre-executing each transaction of the first temporary block, generating a first block hash, verifying whether the first block hash is the same as a second block hash in the first temporary block: otherwise, anti-vote information is generated and broadcast in the first vote of two votes on the first temporary block. According to the method and the device, illegal transactions are not included in the generated blocks, so that the number of transactions which can be executed correctly in one block is increased, the execution of correct transactions is accelerated, and the experience of a user of a block chain is improved.
Description
Technical Field
The present application relates to the field of blockchain technologies, and in particular, to a consensus method, device, and storage medium.
Background
In the current Tendermint consensus, in the voting process, if a temporary block proposed by an accounting node at a certain height contains an illegal transaction, the voting node does not execute in advance, but simply checks the generated temporary block in the two-stage voting process (for example, whether a generated merkle root is correct or not is checked according to a transaction hash list, whether the accounting node really has an accounting qualification or not is checked), that is, the temporary block is considered to be legal, and the accounting node acquires a mining incentive.
The above mechanism will cause some accounting nodes to put many illegal transactions in the proposed temporary block in order to generate the block quickly, resulting in a reduction in the number of transactions that can be executed correctly in a block, prolonging the time for which correct transactions are executed, and reducing the experience of users of the block chain.
Disclosure of Invention
In view of the above-mentioned deficiencies or inadequacies in the prior art, it would be desirable to provide a consensus method, apparatus, and storage medium that does not contain illegal transactions in blocks.
In a first aspect, the present invention provides a consensus method for mining nodes in a blockchain network, where the method includes:
when the current node selects a voting node with the first block height, receiving a first temporary block proposed and broadcasted by an accounting node with the first block height;
pre-executing each transaction of the first temporary block, generating a first block hash, verifying whether the first block hash is the same as a second block hash in the first temporary block:
otherwise, anti-vote information is generated and broadcast in the first vote of two votes on the first temporary block.
In a second aspect, the present invention provides a consensus method applicable to a blockchain node, where the method includes:
when a first vote held by a current node is qualified for voting with a first block height, receiving a first temporary block proposed and broadcasted by a node where the vote with accounting qualification with the first block height is located;
pre-executing each transaction of the first temporary block, generating a first block hash, verifying whether the first block hash is the same as a second block hash in the first temporary block:
otherwise, anti-vote information is generated and broadcast in the first vote of two votes on the first temporary block.
In a third aspect, the present invention also provides an apparatus comprising one or more processors and a memory, wherein the memory contains instructions executable by the one or more processors to cause the one or more processors to perform the consensus method provided according to embodiments of the present invention.
In a fourth aspect, the present invention also provides a storage medium storing a computer program that causes a computer to execute the consensus method provided according to the embodiments of the present invention.
The consensus method, the consensus device and the consensus storage medium provided by the embodiments of the present invention receive a first temporary block proposed and broadcasted by an accounting node with a first block height when a current node selects a voting node with the first block height; pre-executing each transaction of the first temporary block, generating a first block hash, verifying whether the first block hash is the same as a second block hash in the first temporary block: if not, generating anti-vote information in the first round of voting in the two rounds of voting for the first temporary block and broadcasting the anti-vote information, so that the generated block does not comprise illegal transactions, thereby increasing the number of transactions which can be really and correctly executed in one block, accelerating the execution of correct transactions and improving the experience of users of the block chain.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
fig. 1 is a flowchart of a consensus method according to an embodiment of the present invention.
Fig. 2 is a flowchart of step S16 in a preferred embodiment of the method shown in fig. 1.
Fig. 3 is a flowchart of another consensus method according to an embodiment of the present invention.
Fig. 4 is a flowchart of step S26 in a preferred embodiment of the method shown in fig. 3.
Fig. 5 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
The block hash is generated according to a plurality of parameters, wherein the parameters comprise the height of the block, the number of transactions in the block, the version number, the merkle root and the like.
Fig. 1 is a flowchart of a consensus method according to an embodiment of the present invention. As shown in fig. 1, in this embodiment, the present invention provides a consensus method for mining nodes in a blockchain network, where the method includes:
s12: when the current node selects a voting node with the first block height, receiving a first temporary block proposed and broadcasted by an accounting node with the first block height;
s14: pre-executing each transaction of the first temporary block, generating a first block hash, verifying whether the first block hash is the same as a second block hash in the first temporary block:
otherwise, step S16 is executed: anti-vote information is generated and broadcast in the first of two rounds of voting on the first temporary block.
Specifically, the accounting node is configured to be a voting node at the same time, and all voting information in the first temporary block and the two rounds of voting is broadcast to the whole network node as an example; suppose there are 10 mining nodes a 1-j 1 in the blockchain, wherein a1, b1, c1, d1 and e1 select voting nodes with the first block height, and e1 selects accounting nodes with the first block height, and there are 10 transactions tx 1-tx 10 in the first temporary block proposed and broadcast by e1, and tx10 is illegal;
taking a1 as an example:
in step S12, since a1 picks up the voting node of the first chunk height, a1 receives the first temporary chunk proposed and broadcast by e 1;
in step S14, a1 pre-executes each transaction tx1 to tx10 of the first temporary chunk, generates a first chunk hash, verifies whether the first chunk hash is the same as the second chunk hash in the first temporary chunk:
since tx10 is an illegal transaction, a1 deletes tx10, the "number of transactions in chunk" of a1 is 9, and the "number of transactions in chunk" of e1 is 10, and the first chunk hash generated by a1 is different from the second chunk hash generated by e1, step S16 is performed: a1 generates anti-vote information in the first of two votes for the first temporary block and broadcasts to the network-wide nodes.
When the first block hash is the same as the second block hash, a1 continues to perform other verifications in the first round of voting of tentrimint, if the verification fails, anti-vote information is generated in the first round of voting in the two rounds of voting performed on the first temporary block and is broadcast to the nodes of the whole network; and if the verification is successful, generating vote information in the first voting round of the two voting rounds of the first temporary block and broadcasting the vote information to the nodes of the whole network.
In the above mechanism, all network nodes will confirm the block to be generated according to the received temporary block and all voting information in two rounds of voting. The first temporary block generated by e1 is identified as an incorrect block through two rounds of voting, and it is necessary to reselect the accounting node and the voting node, assuming that each transaction in the second temporary block generated by the reselected accounting node is f1, the voting nodes are a1, b1, c1, d1, f1, and f1 is a legal transaction, and the second temporary block is identified as a correct block through two rounds of voting, at this time, the mesh-wide node confirms that the second temporary block is a correct block according to the two rounds of voting information of the second temporary block.
In the above embodiment, the accounting node is configured to be a voting node at the same time, and all voting information in the first temporary block and the two rounds of voting is broadcast to the whole network node; suppose there are 10 mining nodes a 1-j 1 in the blockchain, wherein a1, b1, c1, d1 and e1 select voting nodes with the first block height, and e1 selects accounting nodes with the first block height, and there are 10 transactions tx 1-tx 10 in the first temporary block proposed and broadcast by e1, and tx10 elaborates the illegal transactions;
in further embodiments, the accounting node may also be configured not to be a voting node according to actual needs, and the same technical effect may be achieved.
In further embodiments, the broadcast manner of all the voting information in the first temporary block and the two rounds of voting may be configured as follows according to actual requirements: broadcasting to other voting nodes of the first block height; at this time, a1, b1, c1, d1 and f1 confirm that the second temporary block is the correct block according to the two rounds of voting information of the second temporary block; the other nodes in the block chain synchronize the correct generated blocks, achieving the same technical effect.
In further embodiments, the same technical effect can also be achieved by "generating and broadcasting anti-vote information in the first round of two rounds of voting for the first temporary block" and "configuring and broadcasting" generating and broadcasting anti-vote information in the second round of two rounds of voting for the first temporary block "according to actual needs.
The above embodiment enables the generated block not to include illegal transactions, thereby increasing the number of transactions that can be actually and correctly executed in one block, accelerating the execution of correct transactions, and improving the experience of users of the block chain.
Fig. 2 is a flowchart of step S16 in a preferred embodiment of the method shown in fig. 1. As shown in fig. 2, in a preferred embodiment, step S16 includes:
s161: anti-vote information is generated in the first of two rounds of voting on the first temporary block and broadcast to other voting nodes at the first block height.
The encryption principle of parallel chain transaction in the above embodiment can refer to a method of a preferred embodiment shown in fig. 1, and is not described herein again.
Fig. 3 is a flowchart of another consensus method according to an embodiment of the present invention. As shown in fig. 3, in this embodiment, the present invention provides a consensus method applicable to a blockchain node, where the method includes:
s22: when a first vote held by a current node is qualified for voting with a first block height, receiving a first temporary block proposed and broadcasted by a node where the vote with accounting qualification with the first block height is located;
s24: pre-executing each transaction of the first temporary block, generating a first block hash, verifying whether the first block hash is the same as a second block hash in the first temporary block:
otherwise, step S26 is executed: anti-vote information is generated and broadcast in the first of two rounds of voting on the first temporary block.
Specifically, for example, one node holds at most one vote, one vote can simultaneously have accounting qualification and voting qualification, and all voting information in the first temporary block and the two rounds of voting is broadcast to the nodes of the whole network; assuming that votes held by a2, b2, c2, d2 and e2 qualify for voting and votes held by e2 qualify for billing, 10 transactions tx1' tx10' and tx10' are illegal transactions in the first temporary block proposed and broadcast by e 2;
taking a2 as an example:
in step S22, since the first vote held by a2 qualifies as a vote of a first block height, a2 receives the first temporary block proposed and broadcast by node e2 at which the vote qualifying as a debit of the first block height resides;
in step S24, a2 pre-executes transactions tx1 'to tx10' of the first temporary block, generates a first chunk hash, verifies whether the first chunk hash is the same as a second chunk hash in the first temporary block:
since tx10 'is an illegal transaction, a2 deletes tx10', the "number of transactions in chunk" of a2 is 9, and the "number of transactions in chunk" of e2 is 10, the first chunk hash generated by a2 is different from the second chunk hash generated by e2, then step S26 is performed: anti-vote information is generated and broadcast in the first of two rounds of voting on the first temporary block.
When the first block hash is the same as the second block hash, a2 continues to perform other verifications in the first round of voting of tentrimint, if the verification fails, anti-vote information is generated in the first round of voting in the two rounds of voting performed on the first temporary block and is broadcast to the nodes of the whole network; and if the verification is successful, generating vote information in the first voting round of the two voting rounds of the first temporary block and broadcasting the vote information to the nodes of the whole network.
In the above mechanism, all network nodes will confirm the block to be generated according to the received temporary block and all voting information in two rounds of voting. The first temporary block generated by e2 is identified as an incorrect block through two rounds of voting, and votes qualified for billing and votes qualified for voting need to be re-selected, assuming that after re-selection, f2 has votes qualified for billing, a2, b2, c2, d2, and f2 have votes qualified for voting, each transaction in the second temporary block generated by f2 is a legal transaction, and the second temporary block is identified as a correct block through two rounds of voting, at this time, the network-wide node confirms that the second temporary block is a correct block according to the second temporary block for the two rounds of voting information of the second temporary block.
In the above embodiment, a node holds at most one vote, one vote can simultaneously have accounting qualification and voting qualification, and all voting information in the first temporary block and the two rounds of voting is broadcast to the nodes in the whole network as an example; assuming that votes held by a2, b2, c2, d2 and e2 qualify for voting and votes held by e2 qualify for billing, 10 transactions tx1' to tx10', tx10' are elaborated for illegal transactions in the first temporary block proposed and broadcast by e 2;
in further embodiments, it is also possible to configure that a vote cannot be qualified for both accounting and voting according to actual needs, and the same technical effect can be achieved.
In further embodiments, the number of votes held by a node at most may be configured to other values according to actual requirements, for example, configured to be 5, that is, a node may hold 5 votes at most, and the same technical effect may be achieved.
In further embodiments, the broadcast manner of all the voting information in the first temporary block and the two rounds of voting may be configured as follows according to actual requirements: broadcasting to other voting nodes of the first block height; at this time, a2, b2, c2, d2 and f2 confirm that the second temporary block is the correct block according to the two rounds of voting information of the second temporary block; the other nodes in the block chain synchronize the correct generated blocks, achieving the same technical effect.
In further embodiments, the same technical effect can also be achieved by "generating and broadcasting anti-vote information in the first round of two rounds of voting for the first temporary block" and "configuring and broadcasting" generating and broadcasting anti-vote information in the second round of two rounds of voting for the first temporary block "according to actual needs.
The above embodiment enables the generated block not to include illegal transactions, thereby increasing the number of transactions that can be actually and correctly executed in one block, accelerating the execution of correct transactions, and improving the experience of users of the block chain.
Fig. 4 is a flowchart of step S26 in a preferred embodiment of the method shown in fig. 3. As shown in fig. 4, in a preferred embodiment, step S26 includes:
s261: in the first of two rounds of voting on the first temporary block, anti-vote information is generated and broadcast to the nodes at which other votes qualifying the vote of the first block height lie.
The encryption principle of parallel chain transaction in the above embodiment can refer to a method of a preferred embodiment shown in fig. 3, and is not described herein again.
Fig. 5 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
As shown in fig. 5, as another aspect, the present application also provides an apparatus 500 including one or more Central Processing Units (CPUs) 501 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. In the RAM503, various programs and data necessary for the operation of the apparatus 500 are also stored. The CPU501, ROM502, and RAM503 are connected to each other via a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
The following components are connected to the I/O interface 505: an input portion 506 including a keyboard, a mouse, and the like; an output portion 507 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The driver 510 is also connected to the I/O interface 505 as necessary. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as necessary, so that a computer program read out therefrom is mounted into the storage section 508 as necessary.
In particular, according to an embodiment of the present disclosure, the consensus method described in any of the above embodiments may be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing a consensus method. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 509, and/or installed from the removable medium 511.
As yet another aspect, the present application also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the apparatus of the above-described embodiment; or it may be a separate computer readable storage medium not incorporated into the device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the consensus methods described herein.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units or modules described in the embodiments of the present application may be implemented by software or hardware. The described units or modules may also be provided in a processor, for example, each of the described units may be a software program provided in a computer or a mobile intelligent device, or may be a separately configured hardware device. Wherein the designation of a unit or module does not in some way constitute a limitation of the unit or module itself.
The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention herein disclosed is not limited to the particular combination of features described above, but also encompasses other arrangements formed by any combination of the above features or their equivalents without departing from the spirit of the present application. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.
Claims (6)
1. A consensus method applicable to a mining node in a blockchain network, the method comprising:
when the current node selects a voting node with a first block height, receiving a first temporary block proposed and broadcasted by an accounting node with the first block height;
pre-executing each transaction of the first temporary block, generating a first block hash, verifying whether the first block hash is the same as a second block hash in the first temporary block:
otherwise, anti-vote information is generated and broadcast in the first vote of two votes on the first temporary block.
2. The method of claim 1, wherein generating and broadcasting anti-vote information in a first of two rounds of voting on the first temporary block comprises:
anti-vote information is generated and broadcast to other voting nodes of the first block height in a first of two rounds of voting on the first temporary block.
3. A consensus method applicable to a blockchain node, the method comprising:
when a first vote held by a current node is qualified for voting with a first block height, receiving a first temporary block proposed and broadcasted by a node where the vote with accounting qualification of the first block height is located;
pre-executing each transaction of the first temporary block, generating a first block hash, verifying whether the first block hash is the same as a second block hash in the first temporary block:
otherwise, anti-vote information is generated and broadcast in the first vote of two votes on the first temporary block.
4. The method of claim 3, wherein generating and broadcasting anti-vote information in a first of two rounds of voting on the first temporary block comprises:
anti-vote information is generated in a first of two rounds of voting on the first temporary block and broadcast to nodes at which other votes qualifying the vote at the first block height are located.
5. An apparatus, characterized in that the apparatus comprises:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method recited in any of claims 1-4.
6. A storage medium storing a computer program, characterized in that the program, when executed by a processor, implements the method according to any one of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911284198.XA CN111211904B (en) | 2019-12-13 | 2019-12-13 | Consensus method, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911284198.XA CN111211904B (en) | 2019-12-13 | 2019-12-13 | Consensus method, device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111211904A true CN111211904A (en) | 2020-05-29 |
| CN111211904B CN111211904B (en) | 2023-06-02 |
Family
ID=70789242
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911284198.XA Active CN111211904B (en) | 2019-12-13 | 2019-12-13 | Consensus method, device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111211904B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111858770A (en) * | 2020-07-30 | 2020-10-30 | 杭州复杂美科技有限公司 | Consensus method, device and storage medium |
| CN112600905A (en) * | 2020-12-09 | 2021-04-02 | 杭州复杂美科技有限公司 | Transaction broadcasting and block generating method, apparatus and storage medium |
| CN112712366A (en) * | 2021-01-11 | 2021-04-27 | 杭州复杂美科技有限公司 | Block execution method, computer device and storage medium |
| CN113626530A (en) * | 2021-09-03 | 2021-11-09 | 杭州复杂美科技有限公司 | Block generation method, computer device and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106447311A (en) * | 2016-09-26 | 2017-02-22 | 北京天德科技有限公司 | Block chain block building method for Byzantine fault tolerant algorithm of quartic communication |
| CN108182635A (en) * | 2017-12-18 | 2018-06-19 | 深圳前海微众银行股份有限公司 | Block chain common recognition method, system and computer readable storage medium |
| CN108648078A (en) * | 2018-05-02 | 2018-10-12 | 杭州秘猿科技有限公司 | A kind of transaction preprocess method, device and electronic equipment |
| CN108830602A (en) * | 2018-06-27 | 2018-11-16 | 电子科技大学 | A kind of license chain construction and management-control method based on chameleon hash function |
| CN109978516A (en) * | 2019-03-06 | 2019-07-05 | 西安电子科技大学 | The manufacture of block and synchronous method, information data processing terminal in block chain network |
| CN110298657A (en) * | 2018-03-21 | 2019-10-01 | 中思博安科技（北京）有限公司 | A kind of block chain common recognition method, relevant apparatus and system |
-
2019
- 2019-12-13 CN CN201911284198.XA patent/CN111211904B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106447311A (en) * | 2016-09-26 | 2017-02-22 | 北京天德科技有限公司 | Block chain block building method for Byzantine fault tolerant algorithm of quartic communication |
| CN108182635A (en) * | 2017-12-18 | 2018-06-19 | 深圳前海微众银行股份有限公司 | Block chain common recognition method, system and computer readable storage medium |
| CN110298657A (en) * | 2018-03-21 | 2019-10-01 | 中思博安科技（北京）有限公司 | A kind of block chain common recognition method, relevant apparatus and system |
| CN108648078A (en) * | 2018-05-02 | 2018-10-12 | 杭州秘猿科技有限公司 | A kind of transaction preprocess method, device and electronic equipment |
| CN108830602A (en) * | 2018-06-27 | 2018-11-16 | 电子科技大学 | A kind of license chain construction and management-control method based on chameleon hash function |
| CN109978516A (en) * | 2019-03-06 | 2019-07-05 | 西安电子科技大学 | The manufacture of block and synchronous method, information data processing terminal in block chain network |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111858770A (en) * | 2020-07-30 | 2020-10-30 | 杭州复杂美科技有限公司 | Consensus method, device and storage medium |
| CN111858770B (en) * | 2020-07-30 | 2023-11-28 | 杭州复杂美科技有限公司 | Consensus method, device and storage medium |
| CN112600905A (en) * | 2020-12-09 | 2021-04-02 | 杭州复杂美科技有限公司 | Transaction broadcasting and block generating method, apparatus and storage medium |
| CN112600905B (en) * | 2020-12-09 | 2023-04-14 | 杭州复杂美科技有限公司 | Transaction broadcasting and block generating method, apparatus and storage medium |
| CN112712366A (en) * | 2021-01-11 | 2021-04-27 | 杭州复杂美科技有限公司 | Block execution method, computer device and storage medium |
| CN113626530A (en) * | 2021-09-03 | 2021-11-09 | 杭州复杂美科技有限公司 | Block generation method, computer device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111211904B (en) | 2023-06-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111211904A (en) | Consensus method, device and storage medium | |
| CN108683539B (en) | Block chain network management method, block chain network management device, block chain network management medium and electronic equipment | |
| CN108848055B (en) | Block chain consensus method, accounting node and node | |
| CN107566124B (en) | Hash operation-based consensus establishing method, block chain system and storage medium | |
| CN106385319B (en) | Method and system for verifying information in block chain network | |
| CN107395557B (en) | Service request processing method and device | |
| CN108900364B (en) | Block chain network management method, block chain network management device, block chain network management medium and electronic equipment | |
| CN109583903B (en) | Block confirmation method, equipment and storage medium | |
| CN111275438B (en) | Consensus method, device, equipment and storage medium of block chain network | |
| CN111191292A (en) | Accounting method, accounting device, accounting system and computer-readable storage medium | |
| CN109408595B (en) | Block chain accounting method, device and computer readable storage medium | |
| CN109325744B (en) | Payment processing method, payment processing device, payment processing medium and electronic equipment | |
| CN113194146B (en) | Leader node determination method, computer device, and storage medium | |
| CN112866282B (en) | Method and device for verifying time information in block chain | |
| CN112134883B (en) | Method, device and related product for carrying out rapid authentication on trust relationship between nodes based on trusted computing | |
| CN110853214A (en) | Block generation method, device and storage medium | |
| CN112511312B (en) | Assembled consensus method and system | |
| CN111291014B (en) | Block chain consensus method, apparatus and storage medium | |
| CN111310242B (en) | Method and device for generating device fingerprint, storage medium and electronic device | |
| CN114416407B (en) | Real-time data out-of-order repair system and method and computer equipment | |
| CN113206882B (en) | Consensus method, computer device and storage medium | |
| CN112948388A (en) | Parallel chain arbitration consensus method, computer device and storage medium | |
| CN112261145A (en) | New block chain generation method and device | |
| CN111061712A (en) | Data connection operation processing method and device | |
| CN110442448B (en) | Block generation method, device and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |