CN116471024A - Block chain asynchronous consensus algorithm based on DAG and fragmentation - Google Patents
Block chain asynchronous consensus algorithm based on DAG and fragmentation Download PDFInfo
- Publication number
- CN116471024A CN116471024A CN202310438907.5A CN202310438907A CN116471024A CN 116471024 A CN116471024 A CN 116471024A CN 202310438907 A CN202310438907 A CN 202310438907A CN 116471024 A CN116471024 A CN 116471024A
- Authority
- CN
- China
- Prior art keywords
- block
- node
- nodes
- dag
- leader
- 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
- 238000013467 fragmentation Methods 0.000 title abstract description 7
- 238000006062 fragmentation reaction Methods 0.000 title abstract description 7
- 238000000034 method Methods 0.000 claims abstract description 24
- 239000012634 fragment Substances 0.000 claims abstract description 22
- 238000012790 confirmation Methods 0.000 claims description 9
- 238000007689 inspection Methods 0.000 claims description 3
- 238000004891 communication Methods 0.000 abstract description 11
- 230000008569 process Effects 0.000 abstract description 7
- 238000005457 optimization Methods 0.000 description 8
- 238000012545 processing Methods 0.000 description 7
- 238000005192 partition Methods 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 230000007246 mechanism Effects 0.000 description 3
- 238000011160 research Methods 0.000 description 3
- 238000012795 verification Methods 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 230000015556 catabolic process Effects 0.000 description 2
- 238000006731 degradation reaction Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000000644 propagated effect Effects 0.000 description 1
- 230000007480 spreading Effects 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/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
-
- 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
-
- 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)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
A DAG and slice based blockchain asynchronous consensus algorithm comprising: dividing a block chain network into a plurality of fragments, wherein each fragment comprises a plurality of nodes; the node creates a block according to the received transaction information and an event corresponding to the block; nodes in the shard determine a leader block based on a DAG (directed acyclic graph) structure and form an on-chip consensus based on the leader block; the node merges the events into one batch based on the leader block, and the events of one batch propagate between the slices forming an inter-slice consensus. The invention provides a block chain asynchronous consensus algorithm based on DAG and fragmentation, which can greatly improve the consensus efficiency and shorten the communication overhead in the consensus process.
Description
Technical Field
The invention relates to the technical field of block chain consensus algorithms, in particular to a block chain asynchronous consensus algorithm based on DAG and fragmentation.
Background
As one of the most popular distributed ledger techniques, blockchains enable decentralized, transparent and non-tamperable transaction billing without the involvement of trusted third parties, thereby changing the transaction model of traditional ledgers. Blockchain technology has attracted extensive attention by academia and governments across countries, and more businesses and organizations are exploring the use of blockchain technology in their field. Consensus algorithms are a core element of blockchain technology and are a hot spot in distributed system research in recent years. The consensus algorithm affects the transaction processing capacity, expansibility and security of the blockchain, and is a building block for the development of blockchain technology. Initial consensus algorithm research is often focused on solving the consensus problem in synchronous environments, and strict synchronous assumptions are often difficult to meet under the current situation of the Internet, so that the research of the consensus algorithm in asynchronous environments has very important significance. Existing asynchronous consensus algorithms are still based on the same linear chain structure, limiting the scope of development.
Disclosure of Invention
In order to solve the defects in the prior art, the invention provides a block chain asynchronous consensus algorithm based on DAG and fragmentation, which can greatly improve the consensus efficiency and shorten the communication overhead in the consensus process.
In order to achieve the above purpose, the invention adopts the following specific scheme: a DAG and slice based blockchain asynchronous consensus algorithm comprising:
dividing a block chain network into a plurality of fragments, wherein each fragment comprises a plurality of nodes;
the node creates a block according to the received transaction information and an event corresponding to the block;
nodes in the shard determine a leader block based on a DAG (directed acyclic graph) structure and form an on-chip consensus based on the leader block;
the node merges the events into one batch based on the leader block, and the events of one batch propagate between the slices forming an inter-slice consensus.
As a further optimization of the DAG and slice-based blockchain asynchronous consensus algorithm described above: the specific method for creating the block by the node comprises the following steps:
after receiving the transaction information, the node orderly stores the transaction information in a transaction list;
creating a block based on transaction information in the transaction list when the node starts a new round;
after creating the block, the node broadcasts the block in the slice.
As a further optimization of the DAG and slice-based blockchain asynchronous consensus algorithm described above: the specific method for creating the event corresponding to the block by the node comprises the following steps:
verifying the block when the node receives the blocks from other nodes;
returning a signature confirmation message to the node creating the block when the node verifies that the block is valid;
when the node for creating the block receives that the number of signature confirmation messages corresponding to the block reaches a preset first threshold, an event corresponding to the block is created and broadcast in the fragments.
As a further optimization of the DAG and slice-based blockchain asynchronous consensus algorithm described above: ending the current round when the number of events of the current round received by the node reaches a preset second threshold value, and entering a new round.
As a further optimization of the DAG and slice-based blockchain asynchronous consensus algorithm described above: the method for determining the leader block by the node comprises the following steps:
nodes in the shard determine the leader block among all blocks held by random coin means and commit based on the locally maintained DAG structure.
As a further optimization of the DAG and slice-based blockchain asynchronous consensus algorithm described above: the specific method for forming intra-chip consensus by nodes in the shards based on the leader block comprises the following steps:
after submitting the leader block, the node performs path inspection on the leader block;
the nodes sort the leader blocks based on the associated paths of the leader blocks to obtain a leader sequence for representing the sequence of the leader blocks;
the ancestor blocks of each leader block are ordered according to deterministic rules based on the leader sequence to form an on-chip consensus.
As a further optimization of the DAG and slice-based blockchain asynchronous consensus algorithm described above: the node assigns numbers to events of the same batch while merging the events into one batch based on the leader block, and when the events of one batch are propagated between the fragments, the nodes receiving the events are ordered based on the numbers of the batches.
As a further optimization of the DAG and slice-based blockchain asynchronous consensus algorithm described above: when the node receives the events from other fragments, if at least two batches of events have the same numbers, the node reorders based on the hash value.
As a further optimization of the DAG and slice-based blockchain asynchronous consensus algorithm described above: when dividing the slices, at least the nodes in the slices and the nodes in one other slice are neighbor nodes.
The beneficial effects are that: the invention is realized based on the mode of combining DAG and fragmentation, and greatly improves the expandability of the block chain and the tolerance of network partition on the premise of ensuring the safety; in the inside of the fragments, the structured DAG is used for realizing parallel broadcasting and transaction processing, and the nodes only broadcast and store the transaction blocks of the local fragments, so that the transaction processing efficiency is improved and the storage cost is reduced; in inter-fragment communication, the nodes send block events instead of blocks, so that communication overhead among fragments can be greatly reduced, and the batch merging mode can reduce network bandwidth consumption and speed up confirmation; through inter-slice communication, nodes in different slices can maintain consistent global block event states, and the problem of security degradation caused by the slices is solved.
Drawings
FIG. 1 is an overall block diagram of a blockchain asynchronous consensus algorithm;
FIG. 2 is a block and event broadcast diagram of a blockchain asynchronous consensus algorithm;
FIG. 3 is a schematic diagram of intra-chip consensus submission rules for the blockchain asynchronous consensus algorithm.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described 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.
Referring to fig. 1 to 3, a block chain asynchronous consensus algorithm based on DAG and sharding includes the following steps.
In constructing a blockchain network, the blockchain network is divided into a plurality of slices, and each slice comprises a plurality of nodes. The number of slices and the number of nodes in each slice may be determined based on the size of the blockchain network.
After the fragments are formed, the nodes start to operate, and the nodes in operation establish blocks and events corresponding to the blocks according to the received transaction information. The specific method for creating the block by the node comprises the following steps.
First, the node sequentially stores the transaction information in a transaction list after receiving the transaction information. In the operation process, the node continuously receives the transaction information from the client, orderly stores all the transaction information in a transaction list according to the time of the received transaction information, and processes the transaction information according to the sequence of the transaction information in the subsequent process so as to avoid omission.
Second, a chunk is created based on the transaction information in the transaction list when the node starts a new round. In each round, the node only creates one block, so that the number of the blocks is reduced, the processing pressure of the block chain network is reduced, and the overall efficiency is improved. Each tile may contain a plurality of transaction information, the amount of transaction information that a tile can contain being determined by the size of the tile.
Finally, to verify the block to determine the validity of the block, the node broadcasts the block in the shard after creating the block, and the block is verified by other nodes within the shard.
The specific method for creating the event corresponding to the block by the node comprises the following steps.
First, a block is verified when a node receives blocks from other nodes. The specific verification method may be a predefined verification checking method, and all nodes verify the received block according to the same verification checking method.
Second, a signature acknowledgement message is returned to the node that created the block when the node verifies that the block is valid. When the block is verified to be valid, the node is proved to confirm the received block, and at the moment, a signature confirmation message can be returned to the node creating the block, so that the node creating the block confirms that the block has been verified by other nodes.
Finally, when the node for creating the block receives that the number of signature confirmation messages corresponding to the block reaches a preset first threshold, an event corresponding to the block is created and broadcast in the fragments. When the number of signature confirmation messages corresponding to the block received by the node for creating the block reaches a first threshold, the block can be confirmed to be verified by a plurality of nodes in the partition, so that the block is determined to be legal and valid, at the moment, an event corresponding to the block can be created, and the validity of the block can be proved by the event. After the event is created, the node broadcasts the event in the fragment, so that all other nodes can determine that the block corresponding to the event is legal and effective. The first threshold may be set to 2f+1, where the specific value of f is determined by the number of nodes within the shard. In this embodiment, the event may be a hash value obtained by performing hash calculation on the block, and in other embodiments, a similar calculation method may also be adopted, which is not described herein.
In the invention, in each fragment, the node only broadcasts the block containing specific transaction information and the event for representing the legal validity of the block, thereby improving the transaction processing efficiency and reducing the storage cost.
After the block and event creation, the nodes in the shard determine a leader block based on the DAG (directed acyclic graph) structure and form an intra-shard consensus based on the leader block. Specifically, each node locally maintains a consistent round-based DAG structure, the change process of the DAG is divided into multiple stages, each stage is composed of two consecutive rounds, and the DAG structures maintained by different nodes may be the same or different at the same time. In the intra-chip consensus process, after the node receives enough blocks, randomization is performed in the second round of stage to obtain consistent random coins, and then a leader block is selected from the blocks of the first round of stage, and the random coins can be obtained through an active threshold signature scheme, which belongs to the prior art in the field and is not described herein. If this leader block is sufficiently supported in the second round of stage (i.e., has sufficient sub-blocks, f+1), then commit the leader block, meaning that its ancestor blocks can be ordered. By the path checking mechanism, the node can be ensured to have the same leader block sequence, so that the node is ensured to have the same block sequence in the chip. Because the event can be created only after the block is approved by a plurality of nodes in the partition, and then all nodes determine the legal validity of the received block through broadcasting the event, the nodes do not need to adopt a complex voting and collecting mechanism when consensus in the partition, and can directly carry out on the basis of a DAG structure maintained by the nodes, thereby effectively reducing the complexity of the method and the communication cost. In this embodiment, the nodes in the shard determine and submit the leader block of the current stage by means of random coins based on the DAG structure maintained locally, and in other embodiments of the present invention, other simple random methods may be used to determine the leader block.
After forming the intra-slice consensus, the node merges the multiple events into one batch based on the leader block, and the events of one batch propagate between slices to form the inter-slice consensus. After intra-slice consensus is formed, consensus needs to be formed among different slices so that the whole blockchain network forms consensus, and by combining a plurality of events into one batch and then spreading the events of one batch among different slices, the number of times of inter-slice consensus can be reduced, the communication overhead of the whole blockchain network is reduced, and because the events are spread among the slices instead of the complete blocks, the communication overhead can be further reduced.
The invention is realized based on the mode of combining DAG and fragmentation, and greatly improves the expandability of the block chain and the tolerance of network partition on the premise of ensuring the safety; in the inside of the fragments, the structured DAG is used for realizing parallel broadcasting and transaction processing, and the nodes only broadcast and store the transaction blocks of the local fragments, so that the transaction processing efficiency is improved and the storage cost is reduced; in inter-fragment communication, the nodes send block events instead of blocks, so that communication overhead among fragments can be greatly reduced, and the batch merging mode can reduce network bandwidth consumption and speed up confirmation; through inter-slice communication, nodes in different slices can maintain consistent global block event states, and the problem of security degradation caused by the slices is solved.
The specific method for updating the round of the node comprises the following steps: ending the current round when the number of events of the current round received by the node reaches a preset second threshold value, and entering a new round. The second threshold may also be determined based on the number of nodes within the shard.
Further, a specific method for forming an intra-chip consensus based on the leader block for nodes in the shard includes the following steps.
After the node submits the leader block, a path check is performed on the leader block. The specific path inspection method is as follows.
When a node submits a leader block of one round, within the range of the current round and the last round to submit the leader block, the node should start recursively checking whether there is an inheritance relationship between the leader block of the current round and the leader block of the previous round, i.e., whether there is at least one path, such as the red path in fig. 3, and if so, the node should submit the leader block of the previous round and sort it before the leader block of the current round, and then continue to do path checking for the previous round from the leader block of the previous round. The block determined by the inheritance relationship may be defined as an ancestor block of the leader block.
The nodes sort the leader blocks based on their associated paths, resulting in a leader sequence that characterizes the order of the leader blocks. The ancestor blocks of each leader block are ordered according to deterministic rules based on the leader sequence to form an on-chip consensus. Through the path checking mechanism, the nodes can be ensured to have the same leader block sequence, so that the nodes are ensured to have the same block sequence in the chip.
In order to ensure that nodes in different slices can correctly order received events of one batch in an inter-slice consensus stage, and finally form a correct inter-slice consensus, the nodes assign numbers to the events of the same batch when combining a plurality of events into one batch based on a leader block, and when the events of one batch propagate among the slices, the nodes receiving the events order based on the numbers of the batches. In order to avoid that the nodes cannot smoothly sequence the received events of different batches due to the same number, so as to interfere with the formation of the consensus among the slices, when the nodes receive the events from other slices, if at least two batches of events have the same number, the nodes reorder based on the hash value. The collision resistance of the hash function ensures that nodes can get consistent batch order, so nodes can get a global chain of consistent block events.
In order to ensure that the node can smoothly transmit an event of one batch to other slices, when the slices are divided, the node in the slice and the node in one other slice are at least neighbor nodes.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (9)
1. A DAG and slice based blockchain asynchronous consensus algorithm comprising:
dividing a block chain network into a plurality of fragments, wherein each fragment comprises a plurality of nodes;
the node creates a block according to the received transaction information and an event corresponding to the block;
nodes in the shard determine a leader block based on a DAG (directed acyclic graph) structure and form an on-chip consensus based on the leader block;
the node merges the events into one batch based on the leader block, and the events of one batch propagate between the slices forming an inter-slice consensus.
2. The DAG and tile based blockchain asynchronous consensus algorithm as in claim 1, wherein the node creates the block in a particular way comprising:
after receiving the transaction information, the node orderly stores the transaction information in a transaction list;
creating a block based on transaction information in the transaction list when the node starts a new round;
after creating the block, the node broadcasts the block in the slice.
3. The DAG and tile based blockchain asynchronous consensus algorithm as in claim 2, wherein the node creates the event corresponding to the tile in a particular way comprising:
verifying the block when the node receives the blocks from other nodes;
returning a signature confirmation message to the node creating the block when the node verifies that the block is valid;
when the node for creating the block receives that the number of signature confirmation messages corresponding to the block reaches a preset first threshold, an event corresponding to the block is created and broadcast in the fragments.
4. A DAG and sliced blockchain asynchronous consensus algorithm according to claim 3 wherein the current round is ended when the number of events received by the node for the current round reaches a preset second threshold and a new round is entered.
5. The DAG and slice based blockchain asynchronous consensus algorithm as in claim 1, wherein the method of the node determining the leader block comprises:
nodes in the shard determine the leader block among all blocks held by random coin means and commit based on the locally maintained DAG structure.
6. The DAG and sliced block chain asynchronous consensus algorithm as claimed in claim 5, wherein the specific method of nodes in the slice forming intra-slice consensus based on the leader block comprises:
after submitting the leader block, the node performs path inspection on the leader block;
the nodes sort the leader blocks based on the associated paths of the leader blocks to obtain a leader sequence for representing the sequence of the leader blocks;
the ancestor blocks of each leader block are ordered according to deterministic rules based on the leader sequence to form an on-chip consensus.
7. The DAG and shard based blockchain asynchronous consensus algorithm of claim 1 wherein nodes assign numbers to events of a same batch while merging events into a batch based on a leader block, nodes receiving events are ordered based on batch numbers as events of a batch propagate between shards.
8. The DAG and shard based blockchain asynchronous consensus algorithm according to claim 7, wherein when a node receives events from other shards, the node reorders based on hash values if at least two batches of events have the same number.
9. A DAG and shard based blockchain asynchronous consensus algorithm according to claim 1 wherein when sharding the shards, the nodes within the shards are neighbor nodes with at least the nodes in one other shard.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310438907.5A CN116471024A (en) | 2023-04-21 | 2023-04-21 | Block chain asynchronous consensus algorithm based on DAG and fragmentation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310438907.5A CN116471024A (en) | 2023-04-21 | 2023-04-21 | Block chain asynchronous consensus algorithm based on DAG and fragmentation |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116471024A true CN116471024A (en) | 2023-07-21 |
Family
ID=87176779
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310438907.5A Pending CN116471024A (en) | 2023-04-21 | 2023-04-21 | Block chain asynchronous consensus algorithm based on DAG and fragmentation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116471024A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116723200A (en) * | 2023-08-11 | 2023-09-08 | 杭州趣链科技有限公司 | Cluster changing method and device, electronic equipment and computer readable storage medium |
| CN116846916A (en) * | 2023-09-01 | 2023-10-03 | 武汉趣链数字科技有限公司 | Data synchronization method, device, electronic equipment and computer readable storage medium |
| CN117114886A (en) * | 2023-10-23 | 2023-11-24 | 北京邮电大学 | Block chain carbon transaction method and system based on double-layer consensus mechanism |
-
2023
- 2023-04-21 CN CN202310438907.5A patent/CN116471024A/en active Pending
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116723200A (en) * | 2023-08-11 | 2023-09-08 | 杭州趣链科技有限公司 | Cluster changing method and device, electronic equipment and computer readable storage medium |
| CN116723200B (en) * | 2023-08-11 | 2023-11-10 | 武汉趣链数字科技有限公司 | Cluster changing method and device, electronic equipment and computer readable storage medium |
| CN116846916A (en) * | 2023-09-01 | 2023-10-03 | 武汉趣链数字科技有限公司 | Data synchronization method, device, electronic equipment and computer readable storage medium |
| CN116846916B (en) * | 2023-09-01 | 2023-12-08 | 武汉趣链数字科技有限公司 | Data synchronization method, device, electronic equipment and computer readable storage medium |
| CN117114886A (en) * | 2023-10-23 | 2023-11-24 | 北京邮电大学 | Block chain carbon transaction method and system based on double-layer consensus mechanism |
| CN117114886B (en) * | 2023-10-23 | 2024-04-09 | 北京邮电大学 | Block chain carbon transaction method and system based on double-layer consensus mechanism |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN116471024A (en) | Block chain asynchronous consensus algorithm based on DAG and fragmentation | |
| CN109544334B (en) | Method for realizing network extensible block chain | |
| CN108717630B (en) | Block output method and implementation system thereof | |
| CN110493148B (en) | Block processing, block consensus and block synchronization method and device | |
| Abraham et al. | Solida: A blockchain protocol based on reconfigurable byzantine consensus | |
| CN110796547A (en) | Improved practical Byzantine fault-tolerant system based on alliance block chain | |
| WO2021135934A1 (en) | Blockchain accounting method and apparatus, node and storage medium | |
| CN112163856A (en) | Consensus method and system for block chain and Internet of things fusion scene | |
| CN113626875B (en) | Knowledge graph file storage method for block chain fragment enabling | |
| CN113570357B (en) | Dynamic layered efficient PBFT algorithm | |
| CN111130790B (en) | Block co-recognition method based on block chain node network | |
| WO2024040796A1 (en) | Block chain power transaction system, consensus method, device and storage medium | |
| US20220278854A1 (en) | Unity Protocol Consensus | |
| US12124433B2 (en) | Graphic-blockchain-orientated hybrid consensus implementation apparatus and implementation method thereof | |
| CN113660125A (en) | Consensus method and device based on random credible committee | |
| CN111414420A (en) | Improved PBFT block chain consensus method | |
| CN113132401A (en) | Data processing method and device based on block chain | |
| CN113923217B (en) | Asynchronous Bayesian-busy family consensus method and system based on DAG | |
| CN114338040A (en) | Grouping multi-chain three-time consensus method for block link points | |
| CN114124410B (en) | Improved POA consensus method suitable for multi-party verification in supply chain scene | |
| CN117792608A (en) | Optimization asynchronous BFT consensus implementation method suitable for alliance chain | |
| CN112184454B (en) | Block chain consensus method, device, system and storage medium | |
| CN114338673A (en) | Transaction data processing method, device, equipment, system and storage medium | |
| CN111669277B (en) | Consensus method based on vrf and practical Byzantine algorithm on block chain | |
| CN116389483A (en) | Method and system for dynamic segmentation design of block chain capable of being supervised |
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 |