CN113965566A - BFT consensus algorithm implementation method and system based on Header-Sig flow - Google Patents
BFT consensus algorithm implementation method and system based on Header-Sig flow Download PDFInfo
- Publication number
- CN113965566A CN113965566A CN202111180785.1A CN202111180785A CN113965566A CN 113965566 A CN113965566 A CN 113965566A CN 202111180785 A CN202111180785 A CN 202111180785A CN 113965566 A CN113965566 A CN 113965566A
- Authority
- CN
- China
- Prior art keywords
- block
- module
- node
- splitting
- nodes
- 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 26
- 238000012163 sequencing technique Methods 0.000 claims description 49
- 238000012545 processing Methods 0.000 claims description 19
- 238000012795 verification Methods 0.000 claims description 11
- 239000004744 fabric Substances 0.000 description 5
- 230000005540 biological transmission Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000001105 regulatory effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
- H04L63/083—Network architectures or network communication protocols for network security for authentication of entities using passwords
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Theoretical Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Computing Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Computer Hardware Design (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a method and a system for realizing a BFT consensus algorithm based on a Header-Sig flow, belonging to the field of block chain consensus algorithms; the method comprises the following specific steps: s1, splitting the structure of the generating block; s2, selecting book content to the corresponding block of the accounting node according to the requirement of the accounting node; s3 issuing blocks through sorting nodes and pulling blocks through several nodes; s4 accounting node requests a complete block flow from a randomly selected sorting node and only requests Header-Sig flow from all other sorting nodes; the scheme of the invention has the advantages that the consensus process of the BFT consensus algorithm is optimized by a Chongge, so that the occupation of the network and the disk space in the consensus process can be reduced on the premise of keeping the completion of the BFT consensus characteristic; therefore, the concurrency performance of the BFT consensus is close to the non-Byzantine consensus, and a practical BFT algorithm is realized.
Description
Technical Field
The invention discloses a method and a system for realizing a BFT consensus algorithm based on a Header-Sig flow, and relates to the technical field of block chain consensus algorithms.
Background
In a blockchain network, data needs to be replicated on hundreds of nodes, so some consensus algorithm for fault tolerance is needed. Standard fault-tolerant consensus algorithms (such as Raft and Paxos) assume that when a node fails, it simply stops working and does not reply to a message. These algorithms are not suitable for public blockchains, where anyone in the public network can participate, even trying to disrupt the network. To achieve consensus, we need Byzantine's fault tolerance. In a byzantine fault, the faulty node can operate in a completely arbitrary manner. And may even be colluded to try to do malicious work. Thus, in essence, the purpose of the BFT consensus algorithm is to establish trust between nodes in an untrusted network (e.g., the world wide web).
The accounting node needs to receive 2/3 the confirmation of the sequencing node before consensus can be achieved. Thus each accounting node needs to receive a new tile from a respective sequencing node in excess of 2/3 in the blockchain network, which is expensive because the tiles are large. Based on the above consideration, we propose a method and a system for realizing a BFT consensus algorithm based on a Header-Sig flow to solve the above problems
Disclosure of Invention
Aiming at the problems in the prior art, the invention provides a method and a system for realizing a BFT consensus algorithm based on a Header-Sig flow, wherein the adopted technical scheme is as follows: a BFT consensus algorithm implementation method based on a Header-Sig flow comprises the following specific steps:
s1, splitting the structure of the generating block;
s2, selecting book content to the corresponding block of the accounting node according to the requirement of the accounting node;
s3 issuing blocks through sorting nodes and pulling blocks through several nodes;
the S4 accounting node requests a complete chunk stream from a randomly selected sorting node and only the Header-Sig stream from all other sorting nodes.
The specific steps of splitting the structure of the generation block in S1 are as follows:
s101, splitting a Header block head in a generated block into a block number, a hash of a current effective load and a hash of a previous block;
s102, dividing the Body block Body in the generated block into all transactions in the block;
s103, splitting the Metadata in the generated block into three fields.
In S103, the Metadata in the generated block is divided into three fields, which specifically include the index of the last configuration block, the information specific to the consensus, and the signature of the sorting node.
The specific steps of S3 issuing tiles through the sorting nodes and pulling tiles through several nodes are as follows:
s301, utilizing BFT algorithm to make all normal nodes execute requests in the same order through three-stage broadcast protocol;
s302, electing a main (Leader) sequencing node, and calling a BFT consensus library to obtain a pre-prefix message.
The S301 utilizes the BFT algorithm to make all normal nodes execute the request in the same order through the three-stage broadcast protocol, and the specific steps are as follows:
s3011, outputting a pre-preamble message through a pre-preamble stage broadcast protocol;
s3012, outputting a preamble message through a preamble stage broadcast protocol;
s3013 outputs the commit message through the mmit phase broadcast protocol.
A BFT consensus algorithm implementation system based on a Header-Sig flow specifically comprises a structure splitting module, a block editing module, a block verification module and a node request module:
the structure is disassembled the module: splitting the structure of the generated block;
the block editing module: selecting book contents to corresponding blocks of the accounting nodes according to the requirements of the accounting nodes;
a block verification module: issuing blocks through sequencing nodes and pulling the blocks through a plurality of nodes;
a node request module: the accounting node requests a complete block stream from a randomly selected sorting node and only a Header-Sig stream from all other sorting nodes.
The structure splitting module specifically comprises a block head splitting module, a block body splitting module and a metadata splitting module:
the block head splitting module is included: splitting a Header block head in the generated block into a block number, a hash of the current effective load and a hash of a previous block;
a block body splitting module: dividing the Body block Body in the generated block into all transactions in the block;
a metadata splitting module: and splitting the Metadata in the generating block into three fields.
The metadata splitting module splits three fields, including specifically the index of the last configuration block, consensus-specific information, and the signature of the sequencing node.
The block verification module specifically comprises a sequential execution module and a node pulling module:
a sequential execution module: utilizing a BFT algorithm to cause all normal nodes to execute requests in the same order through a three-phase broadcast protocol;
a node pulling module: and selecting a main (Leader) sequencing node, and calling the BFT consensus library to obtain a pre-prefix message.
The sequence execution module specifically comprises a protocol processing module A, a protocol processing module B and a protocol processing module C:
the protocol processing module A outputs a pre-prefix message through a pre-prefix stage broadcast protocol;
the protocol processing module B outputs a prefix message through a prefix stage broadcast protocol;
the protocol processing module C: and outputting the commit message through the mmit phase broadcast protocol.
The invention has the beneficial effects that: the invention aims to provide a method and a system for realizing a BFT consensus algorithm based on a Header-Sig flow, which optimize the consensus process of the BFT consensus algorithm and can reduce the occupation of network and disk space in the consensus process on the premise of keeping the completion of the BFT consensus characteristic; therefore, the concurrency performance of the BFT consensus is close to the non-Byzantine consensus, and a practical BFT algorithm is realized.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
FIG. 1 is a flow chart of the method of the present invention; FIG. 2 is a schematic diagram of the system of the present invention; FIG. 3 is a block chain structure according to an embodiment of the present invention.
Detailed Description
The present invention is further described below in conjunction with the following figures and specific examples so that those skilled in the art may better understand the present invention and practice it, but the examples are not intended to limit the present invention.
The first embodiment is as follows:
a BFT consensus algorithm implementation method based on a Header-Sig flow comprises the following specific steps:
s1, splitting the structure of the generating block;
s2, selecting book content to the corresponding block of the accounting node according to the requirement of the accounting node;
s3 issuing blocks through sorting nodes and pulling blocks through several nodes;
s4 accounting node requests a complete block flow from a randomly selected sorting node and only requests Header-Sig flow from all other sorting nodes;
the accounting node requests a complete block flow from a randomly selected sequencing node and requests a Header-Sig flow from all other sequencing nodes; in this way, even if the transaction itself in the block is ignored, the accounting node can verify the signature on the received block using only the block header and metadata; therefore, a large amount of network resources and storage space can be saved, and the efficiency of the block chain consensus process is improved;
the method fully utilizes the structure of the Fabric block, and the orderer signs are hash of the block content, but not the block content; constructing a Header-Sig block stream structure only containing a Header and metadata;
the accounting node requests a complete block flow from a randomly selected sequencing node and only requests a Header-Sig flow from all other sequencing nodes; the size of the Header-Sig stream is smaller than that of a complete block stream by several orders of magnitude, and the occupation of the network and the storage space is small;
if the flow of the complete block is returned after a quorum of sequencing nodes delivering the complete block provide the Header-Sig flow, the accounting node suspects that the sequencing nodes delivering the complete block have subjective maliciousness, the accounting node downgrades the sequencing node to deliver the Header-Sig flow, and selects another sequencing node to deliver a complete block flow;
the invention aims to provide a method for realizing a BFT consensus algorithm based on a Header-Sig flow, which optimizes the consensus process of the BFT consensus algorithm and reduces the occupation of network and disk space in the consensus process on the premise of keeping the completion of the BFT consensus characteristic. Therefore, the concurrency performance of the BFT consensus is close to the non-Byzantine consensus, and a practical BFT algorithm in reality is realized;
the method can fully utilize the structure of the Fabric block, and the sorting node signs the hash of the block content instead of the block content; the accounting node requests a complete block flow from a randomly selected sequencing node and only requests a Header-Sig flow from all other sequencing nodes; the size of the Header-Sig stream is smaller than that of a complete block stream by several orders of magnitude, and the occupation of the network and the storage space is small; the overall concurrent processing capacity of the block chain network is effectively improved;
meanwhile, in order to prevent the sorting node which delivers the complete block flow from intentionally slowing down the overall block-making speed, the sorting node which delivers the complete block is limited; if the flow of the complete block is returned after the head-Sig flow is provided by the quorum of the sequencing nodes delivering the complete block, the accounting node suspects that the sequencing nodes delivering the complete block have subjective maliciousness; the accounting node downgrades the sequencing node to deliver a Header-Sig stream and selects another sequencing node to deliver a complete block stream;
further, the step S1 of splitting the structure of the generation block includes:
s101, splitting a Header block head in a generated block into a block number, a hash of a current effective load and a hash of a previous block;
s102, dividing the Body block Body in the generated block into all transactions in the block;
s103, splitting Metadata in the generating block into three fields;
a block is composed of a Header, a Body, and metadata; the Header contains the block number, the hash of the current payload, and the hash of the previous block. Body (block Body) contains all transactions in the block;
further, in the step S103, the Metadata in the generated block is divided into three fields, specifically including an index of the last configuration block, information specific to a consensus person, and a signature of a sorting node;
metadata contains three important fields, (a) the index of the last configuration block; (b) consensus-specific information; (c) and ordering the signatures of the nodes. The maximum data volume and occupied space is Body (block), and the performance pressure on block transmission and block verification in the block chain network is the maximum;
further, the specific steps of S3 issuing tiles through the sorting nodes and pulling tiles through several nodes are as follows:
s301, utilizing BFT algorithm to make all normal nodes execute requests in the same order through three-stage broadcast protocol;
s302, selecting a main (Leader) sequencing node, and calling a BFT consensus library to obtain a pre-prefix message;
still further, the step S301, which uses the BFT algorithm to make all normal nodes execute the request in the same order through the three-phase broadcast protocol, includes the following steps:
s3011, outputting a pre-preamble message through a pre-preamble stage broadcast protocol;
s3012, outputting a preamble message through a preamble stage broadcast protocol;
s3013 outputs the commit message through the mmit phase broadcast protocol.
The BFT algorithm causes all normal nodes to execute requests in the same order through a three-stage broadcast protocol, the three stages being pre-prepare, prepare and commit, respectively; outputting a pre-prepare message, a prepare message and a commit message corresponding to the three stages; in order to construct a consensus new block proposal, all sequencing nodes are required to select a main (Leader) sequencing node at first, and pre-prepare information is obtained by calling a BFT consensus library by the main (Leader) sequencing node and is a block which is not signed by the sequencing node; the prefix message is a pre-prefix message signed by all sequencing nodes participating in consensus, each sequencing node sends a prefix message to all other sequencing nodes, and receives the prefix messages sent by other sequencing nodes; if the prefix message received from 2f different sequencing nodes is consistent with the pre-prefix message, namely 2f +1 acknowledgements are confirmed together with the self, and then a commit stage is started;
in our BFT consensus implementation, chunks received from the sorting service cannot be forged because they are signed by at least the sorting node of 2/3; however, it is not safe to receive a stream of data blocks from a single sequencing node because the sequencing nodes are not trusted by each other; to prevent this, we implement a more resilient block delivery service; a simple way is to request the block stream from the 2/3 sequencing node;
the accounting node simply requests the block stream from 2/3 sequencing nodes; this is expensive because the blocks are large; the hash of the block content is signed by the sorting node instead of the block content by fully utilizing the structure of the Fabric block; the accounting node may request a new chunk structure-a header-sig stream-a stream containing only the header and metadata for each new chunk;
the accounting node requests a complete block flow from a randomly selected sequencing node and only requests a Header-Sig flow from all other sequencing nodes; the size of the Header-Sig stream is smaller than that of a complete block stream by several orders of magnitude, and the occupation of the network and the storage space is small;
the sorting node which is randomly selected to send the complete block stream is important, and in order to prevent the sorting node which delivers the complete block stream from intentionally slowing down the overall block-making speed, the sorting node which delivers the complete block stream is limited and regulated; if the flow of the complete block is returned after the head-Sig flow is provided by the quorum of the sequencing nodes delivering the complete block, the accounting node suspects that the sequencing nodes delivering the complete block have subjective maliciousness; when this happens, the accounting node downgrades this sequencing node to deliver the Header-Sig stream and selects another sequencing node to deliver a complete block stream.
Example two:
a BFT consensus algorithm implementation system based on a Header-Sig flow specifically comprises a structure splitting module, a block editing module, a block verification module and a node request module:
the structure is disassembled the module: splitting the structure of the generated block;
the block editing module: selecting book contents to corresponding blocks of the accounting nodes according to the requirements of the accounting nodes;
a block verification module: issuing blocks through sequencing nodes and pulling the blocks through a plurality of nodes;
a node request module: the accounting node requests a complete block flow from a randomly selected sequencing node and only requests a Header-Sig flow from all other sequencing nodes;
further, the structure splitting module specifically includes a block head splitting module, a block body splitting module, and a metadata splitting module:
the block head splitting module is included: splitting a Header block head in the generated block into a block number, a hash of the current effective load and a hash of a previous block;
a block body splitting module: dividing the Body block Body in the generated block into all transactions in the block;
a metadata splitting module: dividing Metadata in the generating block into three fields;
further, the metadata splitting module splits three fields, specifically including an index of the last configuration block, information specific to a consensus and a signature of a sequencing node;
further, the block verification module specifically includes a sequential execution module and a node pull module:
a sequential execution module: utilizing a BFT algorithm to cause all normal nodes to execute requests in the same order through a three-phase broadcast protocol;
a node pulling module: selecting a main (Leader) sequencing node, and calling a BFT consensus library to obtain a pre-prefix message;
still further, the sequential execution module specifically includes a protocol processing module a, a protocol processing module B, and a protocol processing module C:
the protocol processing module A outputs a pre-prefix message through a pre-prefix stage broadcast protocol;
the protocol processing module B outputs a prefix message through a prefix stage broadcast protocol;
the protocol processing module C: outputting a commit message through a mmit stage broadcast protocol;
as shown in fig. 3, each chunk on the blockchain is composed of a Header, Body, and metadata;
the Header contains the block number, hash of the current payload, and hash of the previous block; body (block Body) contains all transactions in the block; metadata contains three important fields, (a) the index of the last configuration block; (b) consensus-specific information; (c) ordering signatures of the nodes; the maximum data volume and occupied space is Body (block), and the performance pressure on block transmission and block verification in the block chain network is the maximum;
the structure of the Fabric Block, the sorting node signs the hash of the content of the Block, not the content of the Block itself; as in the above figure, the content signed in Signatures in Metadata includes: the index of the last configuration block, consensus-specific information, block height, previous block hash, hash of the current Body (block Body), and not the Body (block Body) itself;
we fully utilize this structural feature of Fabric blocks, and do not try to change the whole structure of the blocks, but split the Header (block Header), Body (block Body) and metadata, and remove a Header-Sig block stream that does not contain Body (block Body).
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (10)
1. A BFT consensus algorithm implementation method based on a Header-Sig flow is characterized by comprising the following specific steps:
s1, splitting the structure of the generating block;
s2, selecting book content to the corresponding block of the accounting node according to the requirement of the accounting node;
s3 issuing blocks through sorting nodes and pulling blocks through several nodes;
the S4 accounting node requests a complete chunk stream from a randomly selected sorting node and only the Header-Sig stream from all other sorting nodes.
2. The method as claimed in claim 1, wherein the step of splitting the structure of the generation block in S1 comprises:
s101, splitting a Header block head in a generated block into a block number, a hash of a current effective load and a hash of a previous block;
s102, dividing the Body block Body in the generated block into all transactions in the block;
s103, splitting the Metadata in the generated block into three fields.
3. The method as claimed in claim 2, wherein the step S103 of splitting Metadata in the generated block into three fields specifically includes an index of the last configuration block, identifier-specific information and a signature of the sorting node.
4. The method as claimed in claim 3, wherein the step of S3 issuing the block through the sorting node and pulling the block through the several nodes comprises the steps of:
s301, utilizing BFT algorithm to make all normal nodes execute requests in the same order through three-stage broadcast protocol;
s302, electing a main (Leader) sequencing node, and calling a BFT consensus library to obtain a pre-prefix message.
5. The method as claimed in claim 4, wherein the step S301 for enabling all normal nodes to execute the request in the same order through a three-phase broadcast protocol by using a BFT algorithm comprises the steps of:
s3011, outputting a pre-preamble message through a pre-preamble stage broadcast protocol;
s3012, outputting a preamble message through a preamble stage broadcast protocol;
s3013 outputs the commit message through the mmit phase broadcast protocol.
6. A BFT consensus algorithm implementation system based on a Header-Sig flow is characterized by specifically comprising a structure splitting module, a block editing module, a block verification module and a node request module:
the structure is disassembled the module: splitting the structure of the generated block;
the block editing module: selecting book contents to corresponding blocks of the accounting nodes according to the requirements of the accounting nodes;
a block verification module: issuing blocks through sequencing nodes and pulling the blocks through a plurality of nodes;
a node request module: the accounting node requests a complete block stream from a randomly selected sorting node and only a Header-Sig stream from all other sorting nodes.
7. The system of claim 6, wherein the structure splitting module specifically comprises a block header splitting module, a block body splitting module, and a metadata splitting module:
the block head splitting module is included: splitting a Header block head in the generated block into a block number, a hash of the current effective load and a hash of a previous block;
a block body splitting module: dividing the Body block Body in the generated block into all transactions in the block;
a metadata splitting module: and splitting the Metadata in the generating block into three fields.
8. The system of claim 7, wherein the metadata splitting module splits three fields specifically including an index of the last configuration block, a recognizer-specific information, and a signature of the sequencing node.
9. The system of claim 8, wherein the block verification module comprises a sequential execution module and a node pull module:
a sequential execution module: utilizing a BFT algorithm to cause all normal nodes to execute requests in the same order through a three-phase broadcast protocol;
a node pulling module: and selecting a main (Leader) sequencing node, and calling the BFT consensus library to obtain a pre-prefix message.
10. The system according to claim 9, wherein the sequential execution module specifically includes a protocol processing module a, a protocol processing module B, and a protocol processing module C:
the protocol processing module A outputs a pre-prefix message through a pre-prefix stage broadcast protocol;
the protocol processing module B outputs a prefix message through a prefix stage broadcast protocol;
the protocol processing module C: and outputting the commit message through the mmit phase broadcast protocol.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111180785.1A CN113965566B (en) | 2021-10-11 | 2021-10-11 | BFT consensus algorithm implementation method and system based on Header-Sig stream |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111180785.1A CN113965566B (en) | 2021-10-11 | 2021-10-11 | BFT consensus algorithm implementation method and system based on Header-Sig stream |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113965566A true CN113965566A (en) | 2022-01-21 |
| CN113965566B CN113965566B (en) | 2024-05-14 |
Family
ID=79463892
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111180785.1A Active CN113965566B (en) | 2021-10-11 | 2021-10-11 | BFT consensus algorithm implementation method and system based on Header-Sig stream |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113965566B (en) |
Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108717630A (en) * | 2018-05-19 | 2018-10-30 | 上海分布信息科技有限公司 | One kind going out block method and its realizes system |
| CN108769173A (en) * | 2018-05-21 | 2018-11-06 | 阿里体育有限公司 | The block chain implementation method and equipment of the intelligent contract of operation |
| CN109842606A (en) * | 2018-02-24 | 2019-06-04 | 中国科学院计算技术研究所 | Block chain common recognition algorithm and system based on consistency hash algorithm |
| CN109872156A (en) * | 2019-03-11 | 2019-06-11 | 赛迪(青岛)区块链研究院有限公司 | A kind of alliance's chain common recognition system and method |
| CN110213737A (en) * | 2019-05-23 | 2019-09-06 | 广西大学 | The method for establishing body area network Information Security Mechanism based on alliance's chain |
| WO2019222993A1 (en) * | 2018-05-25 | 2019-11-28 | 北京大学深圳研究生院 | Blockchain consensus method based on trust relationship |
| CN110569675A (en) * | 2019-09-18 | 2019-12-13 | 上海海事大学 | Multi-Agent transaction information protection method based on block chain technology |
| US20200059369A1 (en) * | 2017-05-16 | 2020-02-20 | Peking University Shenzhen Graduate School | Determining consensus by parallel proof of voting in consortium blockchain |
| CN111611599A (en) * | 2020-04-16 | 2020-09-01 | 浪潮云信息技术股份公司 | Block chain consensus algorithm implementation method, equipment and medium |
| CN112118124A (en) * | 2020-08-03 | 2020-12-22 | 西安电子科技大学 | Block chain construction method, system, storage medium, computer equipment and application |
| CN112202775A (en) * | 2020-09-29 | 2021-01-08 | 北京理工大学 | Consensus mechanism architecture and method for block chain of directed acyclic graph structure |
| US20210014042A1 (en) * | 2019-07-12 | 2021-01-14 | Microsoft Technology Licensing, Llc | Lightweight Blockchain Based on Split-Trust |
| US20210073913A1 (en) * | 2019-09-06 | 2021-03-11 | Bosonic, Inc. | System and method of providing a block chain-based recordation process |
| US20210160171A1 (en) * | 2019-11-22 | 2021-05-27 | Guangzhou University | Blockchain-based verifiable inter-domain routing validation method |
| CN113111388A (en) * | 2017-03-31 | 2021-07-13 | 唐晓领 | Method, device and system for sharing transaction metadata information by financing parties based on block chain |
| US20210314392A1 (en) * | 2020-07-03 | 2021-10-07 | Alipay (Hangzhou) Information Technology Co., Ltd. | Consensus node changing method and related apparatus based on honey badger byzantine fault tolerance consensus mechanism |
-
2021
- 2021-10-11 CN CN202111180785.1A patent/CN113965566B/en active Active
Patent Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113111388A (en) * | 2017-03-31 | 2021-07-13 | 唐晓领 | Method, device and system for sharing transaction metadata information by financing parties based on block chain |
| US20200059369A1 (en) * | 2017-05-16 | 2020-02-20 | Peking University Shenzhen Graduate School | Determining consensus by parallel proof of voting in consortium blockchain |
| CN109842606A (en) * | 2018-02-24 | 2019-06-04 | 中国科学院计算技术研究所 | Block chain common recognition algorithm and system based on consistency hash algorithm |
| CN108717630A (en) * | 2018-05-19 | 2018-10-30 | 上海分布信息科技有限公司 | One kind going out block method and its realizes system |
| CN108769173A (en) * | 2018-05-21 | 2018-11-06 | 阿里体育有限公司 | The block chain implementation method and equipment of the intelligent contract of operation |
| WO2019222993A1 (en) * | 2018-05-25 | 2019-11-28 | 北京大学深圳研究生院 | Blockchain consensus method based on trust relationship |
| CN109872156A (en) * | 2019-03-11 | 2019-06-11 | 赛迪(青岛)区块链研究院有限公司 | A kind of alliance's chain common recognition system and method |
| CN110213737A (en) * | 2019-05-23 | 2019-09-06 | 广西大学 | The method for establishing body area network Information Security Mechanism based on alliance's chain |
| US20210014042A1 (en) * | 2019-07-12 | 2021-01-14 | Microsoft Technology Licensing, Llc | Lightweight Blockchain Based on Split-Trust |
| US20210073913A1 (en) * | 2019-09-06 | 2021-03-11 | Bosonic, Inc. | System and method of providing a block chain-based recordation process |
| CN110569675A (en) * | 2019-09-18 | 2019-12-13 | 上海海事大学 | Multi-Agent transaction information protection method based on block chain technology |
| US20210160171A1 (en) * | 2019-11-22 | 2021-05-27 | Guangzhou University | Blockchain-based verifiable inter-domain routing validation method |
| CN111611599A (en) * | 2020-04-16 | 2020-09-01 | 浪潮云信息技术股份公司 | Block chain consensus algorithm implementation method, equipment and medium |
| US20210314392A1 (en) * | 2020-07-03 | 2021-10-07 | Alipay (Hangzhou) Information Technology Co., Ltd. | Consensus node changing method and related apparatus based on honey badger byzantine fault tolerance consensus mechanism |
| CN112118124A (en) * | 2020-08-03 | 2020-12-22 | 西安电子科技大学 | Block chain construction method, system, storage medium, computer equipment and application |
| CN112202775A (en) * | 2020-09-29 | 2021-01-08 | 北京理工大学 | Consensus mechanism architecture and method for block chain of directed acyclic graph structure |
Non-Patent Citations (5)
| Title |
|---|
| J. LONG AND R. WEI: "Scalable BFT Consensus Mechanism Through Aggregated Signature Gossip", 2019 IEEE INTERNATIONAL CONFERENCE ON BLOCKCHAIN AND CRYPTOCURRENCY (ICBC), 1 July 2019 (2019-07-01), pages 360 - 367 * |
| M. M. JALALZAI AND C. BUSCH: "Window Based BFT Blockchain Consensus", 2018 IEEE INTERNATIONAL CONFERENCE ON INTERNET OF THINGS (ITHINGS) AND IEEE GREEN COMPUTING AND COMMUNICATIONS (GREENCOM) AND IEEE CYBER, PHYSICAL AND SOCIAL COMPUTING (CPSCOM) AND IEEE SMART DATA (SMARTDATA), pages 971 - 979 * |
| 刘懿中, 刘建伟, 张宗洋等: "区块链共识机制研究综述", 密码学报, vol. 6, no. 04, 31 August 2019 (2019-08-31), pages 395 - 432 * |
| 徐恪, 凌思通, 李琦等: "基于区块链的网络安全体系结构与关键技术研究进展", 计算机学报, vol. 44, no. 01, pages 55 - 83 * |
| 郭上铜, 王瑞锦, 张凤荔: "区块链技术原理与应用综述", 计算机科学, vol. 48, no. 02, pages 271 - 281 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113965566B (en) | 2024-05-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109995850B (en) | Block chain system and transaction processing method thereof | |
| CN109936457B (en) | Block chain multi-party witness method, device, equipment and computer readable storage medium | |
| CN111539726B (en) | Block chain consensus system and method | |
| CN113114759B (en) | Chain-crossing method and system for realizing multi-chain intercommunication | |
| CN110399424B (en) | Block generation method, block generation device, block chain node and storage medium | |
| CN113642019A (en) | Double-layer grouping Byzantine fault-tolerant consensus method and system | |
| CN112532396A (en) | Optimized Byzantine fault-tolerant method based on aggregated signature and storage medium | |
| Yu et al. | Improved blockchain consensus mechanism based on PBFT algorithm | |
| CN111342971A (en) | Byzantine consensus method and system | |
| CN113067707B (en) | Data processing method, device and equipment based on block chain and readable storage medium | |
| CN115665170B (en) | Block chain consensus method based on reputation and node compression mechanism | |
| CN111478775B (en) | Interactive aggregated signature method, equipment and storage medium | |
| CN114050904A (en) | Consensus system and method based on two-level leader node fragmentation structure | |
| WO2023011019A1 (en) | Blockchain-based data processing method and apparatus, device, readable storage medium and computer program product | |
| Li et al. | Jenga: Orchestrating smart contracts in sharding-based blockchain for efficient processing | |
| CN113157450A (en) | Method and apparatus for performing blocks in a blockchain system | |
| CN117370460A (en) | Block chain storage optimization method and device based on double-chain storage | |
| CN113965566A (en) | BFT consensus algorithm implementation method and system based on Header-Sig flow | |
| CN115292340B (en) | Block chain storage optimization method and device based on distributed network coding | |
| Fu et al. | A multiple-blockchains based service monitoring framework in edge-cloud computing | |
| CN111371850A (en) | Multi-partition PBFT (partition-based multi-partition function) based multi-channel block chain platform optimization method | |
| CN117376352B (en) | Block chain-based Internet of things system | |
| EP4346159A1 (en) | Method and apparatus of adding additional chain to blockchain, and method and apparatus of generating shard for the same | |
| CN115801809B (en) | Cross-network data synchronous control system, method and medium | |
| WO2024066974A1 (en) | Blockchain-based data processing method, device, and readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |