CN117478301A - Block chain consensus achieving method and device based on directed acyclic graph - Google Patents
Block chain consensus achieving method and device based on directed acyclic graph Download PDFInfo
- Publication number
- CN117478301A CN117478301A CN202311817635.6A CN202311817635A CN117478301A CN 117478301 A CN117478301 A CN 117478301A CN 202311817635 A CN202311817635 A CN 202311817635A CN 117478301 A CN117478301 A CN 117478301A
- Authority
- CN
- China
- Prior art keywords
- block
- consensus
- node
- creating
- global
- 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
- 238000000034 method Methods 0.000 title claims abstract description 36
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 44
- 230000003068 static effect Effects 0.000 claims abstract description 33
- 238000012790 confirmation Methods 0.000 claims abstract description 14
- 238000004590 computer program Methods 0.000 claims description 22
- 125000002015 acyclic group Chemical group 0.000 claims description 8
- 238000004891 communication Methods 0.000 claims description 6
- 238000005516 engineering process Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 238000013459 approach Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000013461 design Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 230000003044 adaptive effect Effects 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000000295 complement effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000000047 product Substances 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 239000013589 supplement Substances 0.000 description 1
- 239000000725 suspension Substances 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
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/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
-
- 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
-
- 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
Abstract
The invention provides a block chain consensus achieving method and device based on a directed acyclic graph, comprising the steps of constructing a block chain based on the directed acyclic graph and adopting a PoS consensus algorithm proposal to create a block; locking a subsequent pointer of the block before forming the global consensus, broadcasting block information, verifying the block information by other nodes, and feeding back the result to the creating block node; the master node judges whether the static consensus phase exists or not, if so, the static global consensus is carried out; otherwise, writing the confirmation voting information of the block into a log list of the master node; after the creating block node confirms that the voting achieves global consensus, unlocking a subsequent pointer of the block to link with a new block; and after receiving the message of the creating block node for sending the global consensus, the master node finishes deleting the log written into the log list. The method promotes the execution efficiency of the consensus algorithm and ensures the convergence of the DAG view.
Description
Technical Field
The invention relates to the technical field of blockchains, in particular to a blockchain consensus achieving method and device based on a directed acyclic graph.
Background
The blockchain technology is used as a highly reliable and available system, so that the problem of downtime of a traditional distributed database can be solved, and the problem of Byzantine attack of malicious nodes can be solved. The directed acyclic graph DAG is combined with the blockchain, so that single-chain blockchain conversion into concurrent multiple chains is possible, such as research on a high-efficiency blockchain consensus algorithm based on the directed acyclic graph DAG designed by the patent CN111080288A and the high-efficiency parallel blockchain based on the directed acyclic graph designed by the patent US2021124734A 1. However, the existing blockchain technology has the following defects:
first, the execution efficiency is low. For example, the PoW (consensus mechanism) has low speed and high energy consumption, and CN202010226540 is a block chain allocation method and system for adaptive PoW calculation allocation; the subsequent development of new blockchain systems such as ethernet, etc., poS (rights and interests proving), such as CN202010245065, an offline rights and interests proving method and system, BFT (bayer fault tolerance algorithm), etc., has improved efficiency on the basis of PoW, but still far from reaching the available speed of modern society.
Second, the efficiency of execution is enhanced by decentralizing the sacrifice blockchain technique, for example, using the DPoS algorithm of the execution committee, such as CN201810494863, an energy transaction management system and method based on DPoS blockchain, AHL, etc. are all losses to the decentralizing attribute. Decentralization is the basis for the distinction of blockchain technology from everything else, and once the blockchain technology loses the decentralization attribute, it is not unusual with today's database systems.
Finally, DAG-based blockchain consensus security is low. On the one hand, DAG-based blockchains are much more complex than single-chain blockchain structures, making it difficult to build security models; on the other hand, a double-flower attack may present a view split case in a DAG-based blockchain.
Accordingly, there is a need for a new method and apparatus for achieving blockchain consensus based on directed acyclic graphs that overcomes the above-mentioned drawbacks.
Disclosure of Invention
The invention aims to provide a novel block chain consensus achieving method and device based on a directed acyclic graph, which promote the execution efficiency of a consensus algorithm, ensure the convergence of a DAG view and improve the safety of the block chain consensus algorithm.
In order to achieve the above object, the present invention provides a blockchain consensus achieving method based on a directed acyclic graph, including:
constructing a block chain based on a directed acyclic graph, and creating a block by adopting a PoS consensus algorithm proposal by a global node of the block chain;
locking a subsequent pointer of the block before forming the global consensus, broadcasting block information, verifying the block information by other nodes, and feeding back the result to the creating block node;
the block creating node sends the feedback result to the main node, and the main node judges whether the feedback result is in a static consensus stage or not, if so, static global consensus is carried out; otherwise, writing the confirmation voting information of the block into a log list of the master node;
after the creating block node confirms that the voting achieves global consensus, unlocking a subsequent pointer of the block to link with a new block; after receiving the message of reaching global consensus sent by the creating block node, the master node deletes the log written into the log list, and the consensus is finished.
The invention also provides a block chain consensus achieving device based on the directed acyclic graph, which comprises:
the dynamic consensus module is used for creating blocks by adopting a PoS algorithm, and locking the blocks which do not achieve global consensus or unlocking the blocks achieving consensus;
and the static consensus module adopts a FastBFT algorithm to carry out static global consensus on the generated blocks.
The present invention also provides a computer readable storage medium storing a computer program which, when executed by a processor, implements the steps of the directed acyclic graph based blockchain consensus achieving method.
The invention also provides a computer terminal comprising a memory, a processor and a computer program stored in the memory and capable of running on the processor, wherein the processor realizes the steps of the block chain consensus achieving method based on the directed acyclic graph when executing the computer program.
Compared with the related art, the invention can effectively ensure that no center exists when constructing blocks and carrying out consensus, the PoS algorithm ensures that no fixed block creating node exists, and the FastBFT algorithm also ensures that the system has no fixed main node, thereby ensuring the decentralization attribute of the block chain consensus algorithm; the PoS algorithm is used for dynamic consensus, and locking is carried out in the branch establishment process of each DAG attempt, so that the voting of malicious nodes or invalid nodes can be effectively ensured not to influence the final consensus result of the block, overtime attack and Bayesian attack can be resisted, and the safety of the block chain consensus algorithm is ensured; by adopting the DAG to attempt to build the multi-chain blockchain, blocks can be built on branches attempted by a plurality of DAGs, so that the concurrent operation of the blockchains of the DAG can be effectively ensured, the waiting time is effectively reduced, the throughput is increased, and the execution efficiency of a blockchain commonality algorithm is promoted.
Drawings
For a clearer description of the technical solutions of the embodiments of the present invention, the drawings that are needed in the description of the embodiments are briefly introduced below, the drawings in the following description are only some embodiments of the present invention, and other drawings can be obtained according to these drawings without inventive effort for a person skilled in the art, wherein:
FIG. 1 is a block chain consensus implementation method based on directed acyclic graphs of the present invention;
FIG. 2 is a DAG view of the blockchain consensus approach based on directed acyclic graphs of the present invention;
FIG. 3 is a consensus flow chart of a blockchain consensus approach based on directed acyclic graphs of the present invention;
FIG. 4 is a static global consensus flow chart of the blockchain consensus approach based on directed acyclic graphs of the present invention.
Detailed Description
The following description of the technical solutions in the embodiments of the present invention will be clear and complete, and it is obvious that the described embodiments are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The invention designs a block chain consensus achieving method of a directed acyclic graph. Specifically, blockchains employ views in the form of directed acyclic graphs, rather than the single chains of the past. To guarantee concurrency of the blockchain consensus algorithm, we allow all blocks to be subsequently connected with multiple blocks, while the blockchain consensus algorithm employs the PoS algorithm. In the block verification stage, in order to ensure the convergence of the DAG view and the security of the consensus algorithm, a block which does not achieve global consensus is locked, and a new block can not be linked after the block until the block is authenticated by all honest nodes. Meanwhile, according to the convergence condition of the DAG view, the transaction is switched to a static consensus stage in a timed suspension mode, and all blocks passing through f+1 votes are subjected to global consensus by using a FastBFT algorithm.
Referring to fig. 1, fig. 1 is a schematic structural diagram of a DAG-based blockchain consensus method, and the diagram shows that the method is divided into a dynamic consensus module and a static consensus module. The difference between the dynamic consensus module and the static consensus module is whether the system is allowed to make new proposals (i.e., the static consensus phase does not allow the system to package transactions for new block proposals). The two modules can be switched according to the frequency of the transaction rate, for example, more transactions are usually processed in the workday or daytime, and then blocks are created more frequently; conversely, if there are fewer transactions in the non-workday or night, then the static consensus module may proceed at this time, so that the static consensus module may minimally impact the throughput of the transaction.
In the dynamic consensus module, the PoS algorithm is adopted to create the block and globally consensus because the PoS algorithm does not generate resource waste like the PoW algorithm, and the decentralization attribute of the system can be ensured. Unlike the conventional PoS algorithm, the present consensus algorithm locks the block that does not achieve global consensus, and waits for the block creation node to confirm that the vote achieves global consensus, for example, 2 x gst (greenwich mean time), that is, 2 standard times, before allowing the block to continue to be created after the block. This is because the DAG view blockchain is different from the single chain blockchain, creating blocks concurrently, if the security and certainty of the preamble block cannot be guaranteed, then continuing to create blocks later, can greatly reduce the security of the system. Waiting for 2 times of GST can ensure that the furthest honest node can complete communication with the block creating node, thereby ensuring the safety of the system.
In the static consensus module, the blocks up to f+1 votes can be globally consensus-recognized to ensure view convergence. This is because if the number of votes is less than f+1, the security of the block cannot be ensured, on the other hand, the time of the static consensus should be reduced as much as possible so as not to affect the progress of the transaction, and the static consensus exists so as to complement the situation that the speed of the global consensus is not kept up with the creation speed of the transaction. After the master node determines the block to be globally consensus, we use the FastBFT algorithm to perform the consensus because the situation at this time exactly accords with the situation of optimistic view estimation of FastBFT, and the communication complexity of FastBFT is lower, so that the global consensus can be ensured to be achieved as soon as possible, and the time of the system staying in the static consensus stage is reduced as much as possible.
Referring to fig. 2, fig. 2 is a DAG view, from which we can see that the created blocks, block a and block D represent blocks that have achieved global consensus, so that the creation of blocks can continue later; the block B and the block E belong to the unlocked blocks, the blocks can be connected subsequently, the subsequent blocks H and I indicated by the broken lines indicate the blocks which are not achieved global consensus and are not locked after the blocks which are just unlocked are subsequently created; block C represents that the locked block is undergoing global consensus.
Referring to fig. 3, fig. 3 is a schematic flow chart based on DAG blockchain consensus, and as shown in the figure, we can obtain the flow chart of the DAG blockchain consensus algorithm as follows:
step 1, a global node carries out a proposal link of a PoS consensus algorithm, a node closest to a target number of tokens is mortised to obtain the right of creating a block, and step 2 is carried out;
step 2, judging whether the ith block is locked or not, if so, entering a step 3; otherwise, creating a block after the ith block, and entering a step 4;
step 3, carrying out i+1, inquiring whether the i+1th block is locked or not, and entering step 2;
and 4, after the block is established, locking the block, entering a global consensus stage of a PoS algorithm, namely broadcasting block information, verifying the block information by other nodes, and feeding back the result to the creating block node. When the creating block node receives f+1 confirmation votes, the step 5 is entered; unlocking and entering a step 7 when the creating block node receives 2f+1 confirmation votes;
step 5, the round creating block node forwards the block which receives f+1 confirmation votes to the main node, and the step 6 is entered;
step 6, the master node judges whether the system is in a static consensus stage, if so, the master node directly performs static global consensus; otherwise, writing the information of f+1 votes received by the block into a log list of the master node;
step 7, the creating block node informs the main node that the block has achieved global consensus after 2f+1 confirmation votes are received, and the main node deletes the log of the block from the log list after receiving the message, and then the step 8 is entered;
and 8, finishing the round of consensus, and enabling the system to wait for the next proposal to come and enter the step 1.
As can be seen from fig. 3, the master node needs to additionally maintain a block log list to record the blocks currently receiving f+1 votes, so that global consensus can be ensured to be completed faster when the system enters a static consensus phase, and if the locked block is not in the log list of the master node, the global consensus needs to be achieved by using the consensus flow shown in fig. 4.
Referring to fig. 4, fig. 4 illustrates a static global consensus protocol for a 4-node example (i.e., the simplest communication system). As can be seen from fig. 4, if there is no locked block in the log list, it is necessary to perform global broadcast to verify whether the block can reach f+1 blocks to vote correctly, if so, forward the message to the master node, and add the block to the log list of the master node, and perform global consensus by using FastBFT algorithm. After the blocks reach global consensus, the corresponding block logs in the master node log list need to be deleted. And switching the whole system back to the dynamic consensus stage until all the block logs in the master node log list are emptied.
Referring to fig. 1, the system architecture of the block chain consensus achieving device based on the directed acyclic graph of the present invention includes a dynamic consensus module, creating blocks by using PoS algorithm, and locking blocks which do not achieve global consensus or unlocking blocks which achieve consensus; and the static consensus module adopts a FastBFT algorithm to carry out static global consensus on the generated blocks.
Compared with the related art, the invention designs a block chain consensus achieving device, and the implementation efficiency can be greatly improved on the basis of ensuring the decentralization and the safety by using the device; the block chain consensus algorithm based on the DAG view eliminates uncontrollable characteristics of view derivative directions caused by concurrency mechanisms of the block chain based on the DAG view, and ensures convergence of the DAG view through locking, unlocking and static consensus modules; the static global consensus algorithm based on the DAG view balances the transaction load, and the dynamic consensus algorithm is used as supplement to the dynamic consensus, thereby reducing the delay of the global consensus.
In another aspect, the present invention also provides a computer readable storage medium storing a computer program, which when executed by a processor, implements the steps of the above directed acyclic graph-based blockchain consensus achieving method.
An extension of another aspect of the present invention also provides a computer terminal, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the steps of the above directed acyclic graph-based blockchain consensus implementation method when the computer program is executed.
The processor, when executing the computer program, performs the functions of the modules/units in the above-described device embodiments. The computer program may be divided into one or more modules/units, which are stored in the memory and executed by the processor to accomplish the present invention, for example. The one or more modules/units may be a series of computer program instruction segments capable of performing the specified functions, which instruction segments are used for describing the execution of the computer program in the terminal device.
The computer terminal can be a desktop computer, a notebook computer, a palm computer, a cloud server and other computing devices. May include, but is not limited to, a processor, memory. More or fewer components may be included or certain components may be combined, or different components may be included, for example, in input and output devices, network access devices, buses, etc.
The processor may be a central processing unit (Central Processing Unit, CPU), but may also be other general purpose processors, digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), off-the-shelf programmable gate arrays (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The memory may be an internal storage unit, such as a hard disk or a memory. The memory may also be an external storage device, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash Card, etc. Further, the memory may also include both internal storage units and external storage devices. The memory is used for storing the computer program and other programs and data. The memory may also be used to temporarily store data that has been output or is to be output.
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-described division of the functional units and modules is illustrated, and in practical application, the above-described functional distribution may be performed by different functional units and modules according to needs, i.e. the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-described functions. The functional units and modules in the embodiment may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit, where the integrated units may be implemented in a form of hardware or a form of a software functional unit. In addition, specific names of the functional units and modules are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present application. The specific working process of the units and modules in the above system may refer to the corresponding process in the foregoing method embodiment, which is not described herein again.
In the foregoing embodiments, the descriptions of the embodiments are emphasized, and in part, not described or illustrated in any particular embodiment, reference is made to the related descriptions of other embodiments.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. 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 invention.
In the embodiments provided in the present invention, it should be understood that the disclosed apparatus/terminal device and method may be implemented in other manners. For example, the apparatus/terminal device embodiments described above are merely illustrative, e.g., the division of the modules or units is merely a logical function division, and there may be additional divisions in actual implementation, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection via interfaces, devices or units, which may be in electrical, mechanical or other forms.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The integrated modules/units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the present invention may implement all or part of the flow of the method of the above embodiment, or may be implemented by a computer program to instruct related hardware, where the computer program may be stored in a computer readable storage medium, and when the computer program is executed by a processor, the computer program may implement the steps of each of the method embodiments described above. Wherein the computer program comprises computer program code which may be in source code form, object code form, executable file or some intermediate form etc. The computer readable medium may include: any entity or device capable of carrying the computer program code, a recording medium, a U disk, a removable hard disk, a magnetic disk, an optical disk, a computer Memory, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), an electrical carrier signal, a telecommunications signal, a software distribution medium, and so forth. It should be noted that the computer readable medium contains content that can be appropriately scaled according to the requirements of jurisdictions in which such content is subject to legislation and patent practice, such as in certain jurisdictions in which such content is subject to legislation and patent practice, the computer readable medium does not include electrical carrier signals and telecommunication signals.
The foregoing description is only illustrative of the present invention and is not intended to limit the scope of the invention, and all equivalent structures or equivalent processes or direct or indirect application in other related technical fields are included in the scope of the present invention.
Claims (8)
1. A method for achieving blockchain consensus based on directed acyclic graphs, comprising:
constructing a block chain based on a directed acyclic graph, and creating a block by adopting a PoS consensus algorithm proposal by a global node of the block chain;
locking a subsequent pointer of the block before forming the global consensus, broadcasting block information, verifying the block information by other nodes, and feeding back the result to the creating block node;
the block creating node sends the feedback result to the main node, and the main node judges whether the feedback result is in a static consensus stage or not, if so, static global consensus is carried out; otherwise, writing the confirmation voting information of the block into a log list of the master node;
after the creating block node confirms that the voting achieves global consensus, unlocking a subsequent pointer of the block to link with a new block; after receiving the message of reaching global consensus sent by the creating block node, the master node deletes the log written into the log list, and the consensus is finished.
2. The directed acyclic graph-based blockchain consensus achievement method of claim 1, wherein the global node of the blockchain proposes creation of a block using a PoS consensus algorithm comprises:
the global node carries out a proposal link of a PoS consensus algorithm, and a node closest to the target number of tokens is mortgage to obtain the right of creating the block;
judging whether the ith block is locked or not, if so, carrying out i+1 inquiry, and judging whether the ith+1 block is locked or not; otherwise, a block is created after the ith block.
3. The directed acyclic graph-based blockchain consensus achieving method according to claim 2, wherein the locking a subsequent pointer to the block before the global consensus is formed, broadcasting the block information, validating the block message by other nodes, and feeding back the result to the creating block node comprises:
after the block is established, the block is locked, the block information is broadcast, the block information is verified by other nodes, and the result is fed back to the block creating node;
when the creating block node receives f+1 confirmation votes, forwarding the f+1 confirmation votes to the main node;
when the creating block node receives 2f+1 confirmation votes, the new block is linked with the block unlocking.
4. The method for achieving blockchain consensus based on directed acyclic graphs according to claim 3, wherein the master node determines whether the master node is in a static consensus phase, and if so, performs a static global consensus; otherwise, writing the confirmation voting information of the block into the log list of the master node comprises:
the master node receives f+1 blocks for confirming voting sent by the creating block node and judges whether the blocks are in a static consensus stage or not;
if yes, adopting a FastBFT algorithm to perform static global consensus; otherwise, the information of f+1 votes received by the block is written into a log list of the master node.
5. The method for achieving block chain consensus based on directed acyclic graph according to claim 4, wherein after the creating block node confirms that voting achieves global consensus, unlocking a subsequent pointer of the block to link a new block; after receiving the message of the creating block node for sending the global consensus, the master node deletes the log written into the log list, and the consensus is finished: comprising the following steps:
the block creating node waits for 2GST time so that the global node can complete communication with the block creating node, and 2f+1 confirmation votes are received; GST is Greenwich mean time;
the creating block node informs the master node that 2f+1 confirmation votes are received to achieve global consensus, the master node deletes the information log of the f+1 confirmation votes of the block from the log list after receiving the message, the consensus is completed, and the next PoS consensus algorithm proposal is waited.
6. An apparatus for applying the directed acyclic graph-based blockchain consensus achievement method as claimed in any of claims 1-5, the apparatus comprising:
the dynamic consensus module is used for creating blocks by adopting a PoS algorithm, and locking the blocks which do not achieve global consensus or unlocking the blocks achieving consensus;
and the static consensus module adopts a FastBFT algorithm to carry out static global consensus on the generated blocks.
7. A computer readable storage medium storing a computer program, wherein the computer program when executed by a processor implements the steps of the directed acyclic graph-based blockchain consensus achievement method according to any of claims 1 to 5.
8. A computer terminal comprising a memory, a processor and a computer program stored in the memory and executable on the processor, wherein the processor, when executing the computer program, performs the steps of the directed acyclic graph-based blockchain consensus achievement method according to any of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311817635.6A CN117478301B (en) | 2023-12-27 | 2023-12-27 | Block chain consensus achieving method and device based on directed acyclic graph |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311817635.6A CN117478301B (en) | 2023-12-27 | 2023-12-27 | Block chain consensus achieving method and device based on directed acyclic graph |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117478301A true CN117478301A (en) | 2024-01-30 |
| CN117478301B CN117478301B (en) | 2024-04-09 |
Family
ID=89626047
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311817635.6A Active CN117478301B (en) | 2023-12-27 | 2023-12-27 | Block chain consensus achieving method and device based on directed acyclic graph |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117478301B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019140555A1 (en) * | 2018-01-16 | 2019-07-25 | 华为技术有限公司 | Blockchain construction method and blockchain node |
| US20190391973A1 (en) * | 2017-05-12 | 2019-12-26 | Alibaba Group Holding Limited | Blockchain-based data processing method and device |
| CN110971684A (en) * | 2019-11-28 | 2020-04-07 | 北京工业大学 | PBFT-based block chain network node load balancing method |
| CN111061769A (en) * | 2019-12-24 | 2020-04-24 | 腾讯科技（深圳）有限公司 | Consensus method of block chain system and related equipment |
| US20200186360A1 (en) * | 2017-04-10 | 2020-06-11 | nChain Holdings Limited | Securing blockchain transaction based on undetermined data |
| CN115473710A (en) * | 2022-08-31 | 2022-12-13 | 杭州云象网络技术有限公司 | Byzantine fault-tolerant consensus method applied to block chain |
| US20230039066A1 (en) * | 2019-12-10 | 2023-02-09 | Jingdong Technology Information Technology Co., Ltd. | Method, apparatus, adapter and system for cross-chain data access of blockchain |
| US20230095359A1 (en) * | 2020-06-16 | 2023-03-30 | Hangzhou Rivtower Technology Co., Ltd | Method and Apparatus for Monitoring State of Blockchain Consensus Node |
| WO2023054888A1 (en) * | 2021-09-29 | 2023-04-06 | 한양대학교 산학협력단 | Efficient dual mode consensus protocol for blockchain network |
| CN115988001A (en) * | 2021-10-14 | 2023-04-18 | 腾讯科技（深圳）有限公司 | Consensus voting processing method, device, equipment and medium for block chain system |
-
2023
- 2023-12-27 CN CN202311817635.6A patent/CN117478301B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20200186360A1 (en) * | 2017-04-10 | 2020-06-11 | nChain Holdings Limited | Securing blockchain transaction based on undetermined data |
| US20190391973A1 (en) * | 2017-05-12 | 2019-12-26 | Alibaba Group Holding Limited | Blockchain-based data processing method and device |
| WO2019140555A1 (en) * | 2018-01-16 | 2019-07-25 | 华为技术有限公司 | Blockchain construction method and blockchain node |
| CN110971684A (en) * | 2019-11-28 | 2020-04-07 | 北京工业大学 | PBFT-based block chain network node load balancing method |
| US20230039066A1 (en) * | 2019-12-10 | 2023-02-09 | Jingdong Technology Information Technology Co., Ltd. | Method, apparatus, adapter and system for cross-chain data access of blockchain |
| CN111061769A (en) * | 2019-12-24 | 2020-04-24 | 腾讯科技（深圳）有限公司 | Consensus method of block chain system and related equipment |
| US20230095359A1 (en) * | 2020-06-16 | 2023-03-30 | Hangzhou Rivtower Technology Co., Ltd | Method and Apparatus for Monitoring State of Blockchain Consensus Node |
| WO2023054888A1 (en) * | 2021-09-29 | 2023-04-06 | 한양대학교 산학협력단 | Efficient dual mode consensus protocol for blockchain network |
| CN115988001A (en) * | 2021-10-14 | 2023-04-18 | 腾讯科技（深圳）有限公司 | Consensus voting processing method, device, equipment and medium for block chain system |
| CN115473710A (en) * | 2022-08-31 | 2022-12-13 | 杭州云象网络技术有限公司 | Byzantine fault-tolerant consensus method applied to block chain |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117478301B (en) | 2024-04-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20190354518A1 (en) | Chain mesh network for decentralized transaction systems | |
| Thin et al. | Formal analysis of a proof-of-stake blockchain | |
| CN112583917B (en) | CSCP-based hybrid chain construction method | |
| CN108881187A (en) | A kind of across chain data transferring method and equipment suitable for permitting chain scene | |
| CN111080288B (en) | Block chain consensus achieving method and device based on directed acyclic graph | |
| CN110084596B (en) | Method and device for processing block chain mixed consensus | |
| CN112862490B (en) | Output consensus method under asynchronous network | |
| CN113419823A (en) | Alliance chain system suitable for high-concurrency affairs and design method thereof | |
| CN113518005B (en) | Block consensus method, device, equipment and storage medium | |
| CN109542922B (en) | Processing method for real-time service data and related system | |
| CN117478301B (en) | Block chain consensus achieving method and device based on directed acyclic graph | |
| Li et al. | Jenga: Orchestrating smart contracts in sharding-based blockchain for efficient processing | |
| Pedreira et al. | Securing Cross-Chain Asset Transfers on Permissioned Blockchains | |
| CN115037472B (en) | Transaction processing method and system based on double-layer DAG consensus mechanism and service equipment | |
| CN116132058A (en) | Block chain consensus method, apparatus, device and computer readable storage medium | |
| CN114154969B (en) | Large-scale trading and settlement method based on block chain | |
| CN113242305B (en) | Cross-chain transaction processing method, device, computer equipment and medium | |
| CN114463008A (en) | Block chain transaction execution method and device based on parallel computing model | |
| CN113610527A (en) | Alliance chain transaction method, device, system, terminal device and storage medium | |
| CN114363084A (en) | Cross-border trade data trusted storage method based on block chain | |
| CN115145997A (en) | Distributed transaction implementation method and distributed system | |
| CN112650627A (en) | Data recovery method and device of intelligent contract, terminal equipment and storage medium | |
| Jourenko et al. | Interhead hydra: Two heads are better than one | |
| Thin et al. | Formal Analysis of a PoS Blockchain | |
| CN111866171B (en) | Message processing method, device, electronic equipment and 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 |