CN110198233B - Block chain consensus method and system based on trusted execution environment and directed acyclic graph - Google Patents
Block chain consensus method and system based on trusted execution environment and directed acyclic graph Download PDFInfo
- Publication number
- CN110198233B CN110198233B CN201910385696.7A CN201910385696A CN110198233B CN 110198233 B CN110198233 B CN 110198233B CN 201910385696 A CN201910385696 A CN 201910385696A CN 110198233 B CN110198233 B CN 110198233B
- Authority
- CN
- China
- Prior art keywords
- event
- node
- directed acyclic
- acyclic graph
- execution environment
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/30—Decision processes by autonomous network management units using voting and bidding
-
- 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
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Technology Law (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Development Economics (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer And Data Communications (AREA)
- Storage Device Security (AREA)
Abstract
The invention discloses a block chain consensus method and a block chain consensus system based on a trusted execution environment and a directed acyclic graph, and the method comprises the steps of receiving an event set sent by a neighbor node, judging whether an event is legal or not based on trusted execution environment information carried by a new event, adding the legal event set into the directed acyclic graph of the node, judging that the event has achieved consensus if any event is agreed by nodes with more than a specified number in the block chain system, and ending the current round of consensus; all nodes pack the generated transaction to the generated new event, a neighbor node is randomly selected, and an event set which is known by the node and is unknown by the neighbor node is sent to the neighbor node through a gossip message. The invention can effectively reduce the network communication overhead, simplify the process of achieving consensus, improve the efficiency of achieving consensus, improve the expandability and the throughput rate of the nodes and reduce the resource consumption of event storage.
Description
Technical Field
The invention relates to a block chain consensus technology, in particular to a block chain consensus method and a block chain consensus system based on a trusted execution environment and a directed acyclic graph.
Background
The blockchain consensus is one of core technologies of the blockchain, and is used for each consensus main body of the blockchain to agree on transaction data on the blockchain, and finally, a distributed consistent account book is formed. The existing block chain consensus method can be divided into two methods, namely block chain structure-based consensus and Directed Acyclic Graph (DAG) -based consensus according to the block chain data structure. First, the consensus method based on the block chain structure includes workload certification (PoW), rights and interests certification (PoS), and Practical Byzantine (PBFT). Among them, PoW has problems of low expandability, low throughput, large resource consumption, etc., PoS is an improved method of PoW, and although PoS improves certain efficiency and reduces resource consumption, PoS has a centralized risk. The PBFT consensus method requires a large network communication overhead, which is not favorable for the extension of the consensus subject. Secondly, a block chain consensus method based on the DAG, such as byte snowball (byteall), hash map (Hashgraph), etc., although the throughput and the expandability are improved to some extent, the consensus subject cannot be changed dynamically, and the consensus process is very complex.
Disclosure of Invention
The technical problems to be solved by the invention are as follows: the invention can effectively reduce network communication overhead, simplify the process of achieving consensus, improve the efficiency of achieving consensus, improve the throughput rate and reduce the resource consumption of event storage.
In order to solve the technical problems, the invention adopts the technical scheme that:
a block chain consensus method based on a trusted execution environment and a directed acyclic graph is provided, wherein the implementation step of performing consensus by any node in a block chain comprises the following steps:
1) receiving an event set sent by a neighbor node;
2) judging whether each new event in the event set is legal or not based on the trusted execution environment information carried by the new event, if each new event is legal and the node is an honest node, voting by the node to agree with the proposal in the event, and skipping to execute the step 3); otherwise, discarding the received event set, ending the consensus of the round and exiting;
3) adding the received event set into the directed acyclic graph of the node;
4) for all events in the directed acyclic graph of the node, if any event is confirmed by more than a specified number of nodes in the blockchain system, determining that the event has achieved consensus; otherwise, skipping to execute the next step;
5) judging whether the node has a new proposal or not, if so, generating a new event containing the new proposal, and if not, generating an empty new event;
6) randomly selecting a neighbor node, determining an event set which is known by the node and is unknown by the neighbor node according to the directed acyclic graph of the node and the directed acyclic graph of the neighbor node, and sending the event set which is known by the node and is unknown by the neighbor node to the neighbor node through a gossip message.
Preferably, the detailed step of determining whether each new event in the event set is legal based on the trusted execution environment information carried by the new event in step 2) includes:
2.1) reading the sending event count value C carried in the judged new eventi；
2.2) obtaining the sending event count value C carried in the last event sent by the source node sending the judged new eventi-1The sending event count value is obtained by the source node continuously counting the sending events based on a sending event counter in the trusted execution environment and embedding the sending events in the sending events;
2.3) determining the value of the transmission event counter Ci-1Sending an event counter value CiWhether the events are continuous or not, and if the events are continuous, judging that the judged new event is legal; otherwise, judging that the judged new event is illegal.
Preferably, when the received event set is added to the directed acyclic graph of the local node in step 3), each event in the received event set is stored according to the receiving sequence, the parent pointer of the local node of each event points to the last event of the local node, the parent pointers of other nodes point to the event in the source node, each event in the received event set includes two hash values of the parent pointer of the local node and the parent pointers of other nodes, so that the event of the local node forms the directed acyclic graph according to the parent pointer of the local node, and a directed acyclic graph is formed between adjacent nodes through the parent pointers of other nodes.
The invention also provides a block chain consensus system based on a trusted execution environment and a directed acyclic graph, which comprises a computer device programmed or configured to execute the steps of the block chain consensus method based on a trusted execution environment and a directed acyclic graph.
The invention also provides a block chain consensus system based on a trusted execution environment and a directed acyclic graph, which comprises a computer device, wherein a storage medium of the computer device stores a computer program programmed or configured to execute the block chain consensus method based on the trusted execution environment and the directed acyclic graph.
The present invention also provides a computer readable storage medium having stored thereon a computer program programmed or configured to perform the aforementioned trusted execution environment and directed acyclic graph-based blockchain consensus method of the present invention.
Compared with the prior art, the invention has the following advantages:
1. the invention judges whether each new event in the event set is legal or not based on the trusted execution environment information carried by the new event, thereby reducing the transmission of illegal data serving as a malicious node in a block chain, effectively reducing the network communication overhead, simplifying the process of achieving consensus and improving the efficiency of achieving consensus.
2. According to the invention, the received event set is stored through the directed acyclic graph, so that the storage and expansion of the event are simplified, the expandability and the throughput rate of the node can be improved, and the resource consumption of event storage is reduced.
Drawings
FIG. 1 is a schematic diagram of a basic flow of a method according to an embodiment of the present invention.
FIG. 2 is an example of a directed acyclic graph in an embodiment of the present invention.
Fig. 3 is a schematic diagram illustrating the principle of consensus voting according to an embodiment of the present invention.
FIG. 4 is a diagram illustrating a directed acyclic graph for system distribution according to an embodiment of the present invention
FIG. 5 is a block diagram of a directed acyclic graph during system consolidation in an embodiment of the present invention.
Detailed Description
As shown in fig. 1, in the present embodiment, in the block chain consensus method based on a trusted execution environment and a directed acyclic graph, the implementation step of performing consensus by any node in a block chain includes:
1) receiving an event set sent by a neighbor node;
2) judging whether each new event in the event set is legal or not based on the trusted execution environment information carried by the new event, if each new event is legal and the node is an honest node, voting by the node to agree with the proposal in the event, and skipping to execute the step 3); otherwise, discarding the received event set, ending the consensus of the round and exiting;
3) adding the received event set into the directed acyclic graph of the node;
4) for all events in the directed acyclic graph of the node, if any event is confirmed by nodes exceeding a specified number (half of the nodes in the blockchain system in the embodiment, or other thresholds may be set) in the blockchain system, it is determined that the event has reached a consensus; otherwise, skipping to execute the next step;
5) judging whether the node has a new proposal or not, if so, generating a new event containing the new proposal, and if not, generating an empty new event;
6) randomly selecting a neighbor node, determining an event set which is known by the node and is unknown by the neighbor node according to the directed acyclic graph of the node and the directed acyclic graph of the neighbor node, and sending the event set which is known by the node and is unknown by the neighbor node to the neighbor node through a gossip message.
In this embodiment, the detailed step of determining whether each new event in the event set is legal based on the trusted execution environment information carried by the new event in step 2) includes:
2.1) reading the sending event count value C carried in the judged new eventi；
2.2) obtaining the sending event count value C carried in the last event sent by the source node sending the judged new eventi-1The sending event count value is obtained by the source node continuously counting the sending events based on a sending event counter in the trusted execution environment and embedding the sending events in the sending events;
2.3) determining the value of the transmission event counter Ci-1Sending an event counter value CiWhether the events are continuous or not, and if the events are continuous, judging that the judged new event is legal; otherwise, judging that the judged new event is illegal.
In the embodiment, each node is configured with a special hardware, namely a Trusted Execution Environment (TEE), and the message is bound by using the trusted execution environment. The trusted execution environment provides a simple monotonically increasing counter (send event counter), and a new send event count value is generated to bind with the event each time the event is sent, so that the count value of the event binding sent by the node each time is different, and the node is prevented from sending the proposal with opposite content to different users to do bad, and causing bifurcation attack, because if different proposals are sent to different users, the two proposals must be bound with different count values a and a +1, and when the user receives a +1 but does not receive a, the node is suspected to do bad, so that the event sent by the user is rejected.
In this embodiment, when the received event set is added to the directed acyclic graph of the local node in step 3), each event in the received event set is stored according to the received sequence, and the parent pointer (self-parent) of the local node of each event points to the last event of the local node, and the parent pointers (other-parent) of other nodes point to the event in the source node, and each event in the received event set includes two hash values of the parent pointer and the parent pointers of other nodes, so that the event of the local node forms a directed acyclic graph according to the parent pointer of the local node, and a directed acyclic graph is formed between adjacent nodes through the parent pointers of other nodes. The block chain consensus method based on the trusted execution environment and the directed acyclic graph is used for each node in a distributed network to achieve Byzantine consensus, each node can initiate a proposal and wait for the consensus to be achieved in the whole network based on the Trusted Execution Environment (TEE) and the Directed Acyclic Graph (DAG), the node packages the proposal into an event, and the content of the event comprises two hash values and pointers pointing to other two events besides the proposal. After receiving the events sent by other devices, each node stores the events to the local, and finally forms a directed acyclic graph DAG according to the hash pointer.
As shown in fig. 2, numbered circles in the figure represent events, four time axes a, B, C, and D represent 4 nodes, respectively, and all events sent by each node are arranged on its own time axis from bottom to top in order of sequence. On the same time axis, each new event is generated, and the event needs to contain the hash value of an event on the same time axis, and the last event is called the parent vertex (self-parent) of the node of the newly generated event. Meanwhile, the newly generated event also includes another hash value, where the hash value is the hash value of an event on another timeline, and the event on another timeline is called another parent vertex (other-parent) of the newly generated event, that is, the event indicated by the arrow sent by the event in fig. one. For example, the parent vertex of the present node (self-parent) of event 5 is event 6, and the parent vertices of the other nodes (other-parent) are event 1. Over time, the directed acyclic graph DAG grows upward, with new events up and old events down. All events are propagated through the gossip protocol, and a node randomly selects a neighbor node at a time and sends all events known by itself but not owned by the neighbor to the node. Each time a node sends an event, a new event is generated, the hash values and proposals of self-parent and other-parent are filled in the event, if no proposal is to be initiated, the proposed contents of the event can be empty, the self-parent is the current topmost event on the same root time axis, and the other-parent is the topmost event in the received events. As shown in fig. one, when node C performs gossip communication to node D, C sends an event which is known by itself but not by node D to node D, and node D only has event 8, while node C has events 1,2,3,4,5, 6. Therefore, the node C sends the event set {1,2,3,4,5,6} to the node D, after receiving the event set, the node D firstly carries out validity verification on the events, after the verification is passed, the events are added into the local directed acyclic graph DAG, and a new event 7 is generated, wherein the self-parent vertex (self-parent) of the node is the event 8, and the other parent vertices (other-parent) of the nodes are the events 5. Therefore, each node of all events can create a directed acyclic graph DAG locally according to the received events, and then agree on the events on the directed acyclic graph DAG. All honest nodes can get the same directed acyclic graph DAG, so that the final consensus on the event can be agreed. The process of event consensus is a process of collecting votes, when a node receives an event, the node verifies the validity of the event, if the event is legal, honest nodes agree with the proposal initiated by the event, then the event is added into a directed acyclic graph DAG of the node, and is transmitted to other nodes through gossip, so that all events agreed by more than half of the nodes in the directed acyclic graph DAG are already agreed events, for example, the black event in FIG. 3 is the already agreed event.
As shown in fig. 4, when the nodes in the blockchain system are distributed to form subsystems, the consensus bodies are changed, and at this time, the subsystems perform the same consensus process (i.e., execute the blockchain consensus method based on the trusted execution environment and the directed acyclic graph in this embodiment), nodes in the subsystems send gossip to each other, and different subsystems do not interact with each other. The interior of the subsystem can still reach consensus on new proposals, and at the moment, only half of the number of the nodes of the subsystem needs to be collected for voting. As shown in fig. 5, when the subsystems are merged into a whole, the nodes of the two subsystems start to send events to each other (i.e., execute the blockchain consensus method based on the trusted execution environment and the directed acyclic graph in this embodiment), and synchronize the events that the neighboring nodes do not have in the past according to the same rule, where the achievement of consensus requires collecting half of votes of the number of nodes of the whole system. Therefore, the blockchain consensus method based on the trusted execution environment and the directed acyclic graph in the embodiment is not only applicable to a static blockchain system, but also applicable to a process of forming a subsystem by dispersing nodes in the blockchain system and forming the blockchain system by merging the subsystems.
The embodiment also provides a blockchain consensus system based on a trusted execution environment and a directed acyclic graph, which comprises a computer device programmed or configured to execute the steps of the blockchain consensus method based on a trusted execution environment and a directed acyclic graph. The embodiment also provides a block chain consensus system based on a trusted execution environment and a directed acyclic graph, which includes a computer device, where a storage medium of the computer device stores a computer program programmed or configured to execute the block chain consensus method based on a trusted execution environment and a directed acyclic graph according to the foregoing embodiments of the present invention. The present embodiment also provides a computer readable storage medium, which stores thereon a computer program programmed or configured to execute the aforementioned block chain consensus method based on a trusted execution environment and a directed acyclic graph according to the present invention.
The above description is only a preferred embodiment of the present invention, and the protection scope of the present invention is not limited to the above embodiments, and all technical solutions belonging to the idea of the present invention belong to the protection scope of the present invention. It should be noted that modifications and embellishments within the scope of the invention may occur to those skilled in the art without departing from the principle of the invention, and are considered to be within the scope of the invention.
Claims (5)
1. A block chain consensus method based on a trusted execution environment and a directed acyclic graph is characterized in that an implementation step of performing consensus by any node in a block chain comprises the following steps:
1) receiving an event set sent by a neighbor node;
2) judging whether each new event in the event set is legal or not based on the trusted execution environment information carried by the new event, if each new event is legal and the node is an honest node, voting by the node to agree with the proposal in the event, and skipping to execute the step 3); otherwise, discarding the received event set, ending the consensus of the round and exiting;
3) adding the received event set into the directed acyclic graph of the node;
4) for all events in the directed acyclic graph of the node, if any event is confirmed by nodes with more than a specified number in the block chain system, judging that the event has achieved consensus; otherwise, skipping to execute the next step;
5) judging whether the node has a new proposal or not, if so, generating a new event containing the new proposal, and if not, generating an empty new event;
6) randomly selecting a neighbor node, determining an event set which is known by the node and is unknown by the neighbor node according to the directed acyclic graph of the node and the directed acyclic graph of the neighbor node, and sending the event set which is known by the node and is unknown by the neighbor node to the neighbor node through a gossip message;
the detailed step of judging whether each new event in the event set is legal or not based on the trusted execution environment information carried by the new event in the step 2) comprises the following steps:
2.1) reading the sending event count value C carried in the judged new eventi；
2.2) obtaining the sending event count value C carried in the last event sent by the source node sending the judged new eventi-1The sending event count value is obtained by the source node continuously counting the sending events based on a sending event counter in the trusted execution environment and embedding the sending events in the sending events;
2.3) determining the value of the transmission event counter Ci-1Sending an event counter value CiWhether the events are continuous or not, and if the events are continuous, judging that the judged new event is legal; otherwise, judging that the judged new event is illegal.
2. The block chain consensus method based on the trusted execution environment and the directed acyclic graph according to claim 1, wherein when the received event set is added to the directed acyclic graph of the local node in step 3), each event in the received event set is stored according to a received sequence, a parent pointer of the local node of each event points to a previous event of the local node, parent pointers of other nodes point to the event in the source node, each event in the received event set includes two hash values of the parent pointer of the local node and the parent pointers of other nodes, so that the event of the local node forms the directed acyclic graph according to the parent pointer of the local node, and adjacent nodes form the directed acyclic graph through the parent pointers of other nodes.
3. A system for blockchain consensus based on a trusted execution environment and a directed acyclic graph, comprising a computer device, wherein the computer device is programmed or configured to perform the steps of the method for blockchain consensus based on a trusted execution environment and a directed acyclic graph of claim 1 or 2.
4. A blockchain consensus system based on a trusted execution environment and a directed acyclic graph, comprising a computer device, wherein a storage medium of the computer device has stored thereon a computer program programmed or configured to perform the blockchain consensus method based on a trusted execution environment and a directed acyclic graph of claim 1 or 2.
5. A computer-readable storage medium having stored thereon a computer program programmed or configured to perform the blockchain consensus method based on a trusted execution environment and a directed acyclic graph of claim 1 or 2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910385696.7A CN110198233B (en) | 2019-05-09 | 2019-05-09 | Block chain consensus method and system based on trusted execution environment and directed acyclic graph |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910385696.7A CN110198233B (en) | 2019-05-09 | 2019-05-09 | Block chain consensus method and system based on trusted execution environment and directed acyclic graph |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110198233A CN110198233A (en) | 2019-09-03 |
| CN110198233B true CN110198233B (en) | 2021-11-19 |
Family
ID=67752481
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910385696.7A Active CN110198233B (en) | 2019-05-09 | 2019-05-09 | Block chain consensus method and system based on trusted execution environment and directed acyclic graph |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110198233B (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110458995B (en) * | 2019-09-12 | 2021-08-31 | 北京笔新互联网科技有限公司 | Anonymous voting system and voting method based on trusted execution environment |
| CN111080288B (en) * | 2019-10-18 | 2023-08-18 | 湖南天河国云科技有限公司 | Block chain consensus achieving method and device based on directed acyclic graph |
| ES2961304T3 (en) * | 2020-01-20 | 2024-03-11 | Decard Ag | System and method implementing a directed acyclic graph (DAG) consensus algorithm via an epidemic protocol |
| CN112202775B (en) * | 2020-09-29 | 2021-06-22 | 北京理工大学 | Consensus mechanism architecture and method for block chain of directed acyclic graph structure |
| CN112783983A (en) * | 2021-02-07 | 2021-05-11 | 中国人民解放军国防科技大学 | Self-adaptive consensus method based on major-minor block diagram chain structure block chain account book design |
| CN113077343B (en) * | 2021-04-09 | 2022-09-16 | 中山大学 | Block chain consensus system based on directed acyclic graph |
| CN113297569B (en) * | 2021-05-06 | 2022-08-12 | 湖南兆物信链科技集团有限公司 | Attack processing method, equipment and storage medium based on Hash diagram |
| CN113034146B (en) * | 2021-05-25 | 2021-08-17 | 杭州云链趣链数字科技有限公司 | Block chain-based communication method, system, electronic device and storage medium |
| CN113923217B (en) * | 2021-09-30 | 2024-04-16 | 中国人民解放军国防科技大学 | Asynchronous Bayesian-busy family consensus method and system based on DAG |
| CN116723200B (en) * | 2023-08-11 | 2023-11-10 | 武汉趣链数字科技有限公司 | Cluster changing method and device, electronic equipment and computer readable storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108111604A (en) * | 2017-12-21 | 2018-06-01 | 广州广电运通金融电子股份有限公司 | Block chain common recognition methods, devices and systems, identification information treating method and apparatus |
| CN109102296A (en) * | 2018-08-31 | 2018-12-28 | 北京八分量信息科技有限公司 | A kind of node common recognition method and system |
| CN109447795A (en) * | 2018-09-11 | 2019-03-08 | 中国人民解放军国防科技大学 | Byzantine consensus method supporting rapid achievement of final confirmation |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017198291A1 (en) * | 2016-05-18 | 2017-11-23 | Rwe International Se | Peer-to-peer network and node of a peer-to-peer network |
| US11165589B2 (en) * | 2017-05-11 | 2021-11-02 | Shapeshift Ag | Trusted agent blockchain oracle |
-
2019
- 2019-05-09 CN CN201910385696.7A patent/CN110198233B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108111604A (en) * | 2017-12-21 | 2018-06-01 | 广州广电运通金融电子股份有限公司 | Block chain common recognition methods, devices and systems, identification information treating method and apparatus |
| CN109102296A (en) * | 2018-08-31 | 2018-12-28 | 北京八分量信息科技有限公司 | A kind of node common recognition method and system |
| CN109447795A (en) * | 2018-09-11 | 2019-03-08 | 中国人民解放军国防科技大学 | Byzantine consensus method supporting rapid achievement of final confirmation |
Non-Patent Citations (1)
| Title |
|---|
| An Overview of Blockchain Technology: Architecture, Consensus, and Future Trends;huaimin wang;《ieee》;20170911;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110198233A (en) | 2019-09-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110198233B (en) | Block chain consensus method and system based on trusted execution environment and directed acyclic graph | |
| Wang et al. | SoK: DAG-based blockchain systems | |
| JP7184959B2 (en) | Method and apparatus for distributed database in network | |
| JP7211943B2 (en) | Method and Apparatus for Distributed Database Enabling Deletion of Events | |
| CN111131209A (en) | Improved efficient consensus method, system, computer device and storage medium | |
| CN110851537A (en) | Consensus method based on block chain fragmentation technology | |
| CN109379343B (en) | Heterogeneous consensus method of block chains and terminal | |
| CN108804706A (en) | A kind of block chain data processing method, device, equipment and storage medium | |
| KR102601973B1 (en) | System architecture and how it processes data | |
| WO2023071373A1 (en) | Blockchain consensus method, apparatus, and device, and storage medium | |
| CN110213038B (en) | Method and system for forming consensus of block chain | |
| Cong et al. | A blockchain consensus protocol with horizontal scalability | |
| Al-Bassam et al. | Airtnt: Fair exchange payment for outsourced secure enclave computations | |
| CN113923217B (en) | Asynchronous Bayesian-busy family consensus method and system based on DAG | |
| Ghasemi et al. | Asynchronous coded caching | |
| CN111555860B (en) | Block chain link point consensus method, device, electronic equipment and storage medium | |
| Ma et al. | Stochastic performance modeling for practical byzantine fault tolerance consensus in the blockchain | |
| Wan et al. | AnonymousFox: An efficient and scalable blockchain consensus algorithm | |
| Tang et al. | Hedera: A permissionless and scalable hybrid blockchain consensus algorithm in multiaccess edge computing for IoT | |
| WO2018179293A1 (en) | Verification information adding device, verification device, information management system, method, and program | |
| Fanti et al. | Barracuda: the power of ℓ-polling in proof-of-stake blockchains | |
| CN117251889B (en) | Block chain consensus method, related device and medium | |
| CN112181599B (en) | Model training method, device and storage medium | |
| CN108418871A (en) | A kind of cloud storage performance optimization method and system | |
| Wu et al. | Scaling proof-of-authority protocol to improve performance and security |
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 |