CN113965566B - BFT consensus algorithm implementation method and system based on Header-Sig stream - Google Patents
BFT consensus algorithm implementation method and system based on Header-Sig stream Download PDFInfo
- Publication number
- CN113965566B CN113965566B CN202111180785.1A CN202111180785A CN113965566B CN 113965566 B CN113965566 B CN 113965566B CN 202111180785 A CN202111180785 A CN 202111180785A CN 113965566 B CN113965566 B CN 113965566B
- Authority
- CN
- China
- Prior art keywords
- block
- node
- module
- header
- splitting
- 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
- 238000000034 method Methods 0.000 title claims abstract description 22
- 238000012163 sequencing technique Methods 0.000 claims abstract description 29
- 238000012795 verification Methods 0.000 claims description 11
- 238000000926 separation method Methods 0.000 claims description 3
- 239000004744 fabric Substances 0.000 description 5
- 230000005540 biological transmission Effects 0.000 description 2
- 230000000903 blocking effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 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
- 238000006467 substitution reaction Methods 0.000 description 1
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)
- General Engineering & Computer Science (AREA)
- Computing Systems (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a method and a system for realizing BFT consensus algorithm based on Header-Sig flow, belonging to the field of block chain consensus algorithm; the method comprises the following specific steps: s1, dividing the structure of a generated block; s2, selecting book contents to corresponding blocks of the accounting nodes according to the needs of the accounting nodes; s3, issuing the block through the sorting nodes and pulling the block through a plurality of nodes; s4, 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 scheme of the invention fierce 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 BFT consensus characteristics; therefore, the concurrency performance of the BFT consensus is close to that of the non-Bayesian-busy consensus, and the practical BFT algorithm in reality is realized.
Description
Technical Field
The invention discloses a method and a system for realizing a BFT consensus algorithm based on a Header-Sig stream, and relates to the technical field of block chain consensus algorithms.
Background
In a blockchain network, data needs to be replicated on hundreds or thousands of nodes, so consensus algorithms with some fault tolerance mechanism are required. Standard fault tolerant consensus algorithms (e.g., raft and Paxos) assume that when a node fails, it simply stops working and does not reply to a message. But these algorithms are not applicable to public blockchains and anyone in the public network can participate or even attempt to break the network. To achieve consensus we need a tolerance to barthology. In a bayer failure, the failed node can operate in a completely arbitrary manner. Even collusion may be attempted. 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).
Accounting nodes need to receive more than 2/3 of the ordering node acknowledgements before consensus is achieved. Thus each accounting node needs to receive new blocks from more than 2/3 of the ordering nodes in the blockchain network, respectively, which is however expensive because the blocks are large. Based on the above consideration, we propose a method and a system for implementing BFT consensus algorithm based on Header-Sig stream 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 BFT consensus algorithm based on a Header-Sig stream, wherein the adopted technical scheme is as follows: a BFT consensus algorithm implementation method based on a Header-Sig stream comprises the following specific steps:
S1, dividing the structure of a generated block;
s2, selecting a corresponding block transmitted to the accounting node according to the requirement of the accounting node;
s3, issuing the block through the sorting node and pulling the block through the accounting node;
s4, the accounting node requests a complete block stream from a randomly selected ordering node and only requests a Header-Sig stream from all other ordering nodes.
The specific steps of the S1 for splitting the structure of the generated block are as follows:
S101, splitting a Header block Header in a generated block into a block number, a hash of a current effective load and a hash of a previous block;
s102, dividing Body blocks in the generated blocks into all transactions in the blocks;
s103, dividing Metadata of Metadata in the generation block into three fields.
The step S103 is to split Metadata of Metadata in the generated block into three fields, specifically including the index of the last configuration block, the consensus-specific information and the signature of the ordering node.
The specific steps of S3 issuing the block through the sorting node and pulling the block through the accounting node are as follows:
S301, using BFT algorithm to make all normal nodes execute request in same sequence through three-stage broadcast protocol;
S302 selects a master (Leader) ordering node, and calls a BFT consensus library to obtain a pre-preparation message.
The specific steps of using the BFT algorithm to make all normal nodes execute requests in the same order through the three-phase broadcast protocol in S301 are as follows:
S3011 outputs the pre-preparation message through the pre-preparation stage broadcast protocol;
s3012 outputs the preparation message through the preparation stage broadcast protocol;
S3013 outputs the commit message via mmit-phase broadcast protocol.
A BFT consensus algorithm implementation system based on a Header-Sig stream specifically comprises a structure splitting module, a block editing module, a block verification module and a node request module:
and (3) a structural separation module: splitting the structure of the generated block;
A block editing module: selecting a corresponding block transmitted to the accounting node according to the requirement of the accounting node;
block verification module: issuing the block through the sorting node and pulling the block through the accounting node;
The node request module: the accounting node requests a complete block stream from a randomly selected ordering node and requests only Header-Sig streams from all other ordering 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 comprises: splitting a Header block Header in the generated block into a block number, a hash of the current payload and a hash of a previous block;
Zone block splitting module: splitting the Body block Body in the generated block to obtain all transactions in the block;
metadata splitting module: the Metadata of Metadata in the generated block is split into three fields.
The metadata splitting module splits three fields, specifically including the index of the last configuration block, consensus-specific information, and the signature of the ordering node.
The block verification module specifically comprises a sequential execution module and a node pulling module:
The sequence execution module: using BFT algorithm to make all normal nodes execute request in same sequence through three-stage broadcast protocol;
node pulling module: a master (Leader) ordering node is elected, and a BFT consensus library is called to obtain a pre-preparation 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-preparation message through a pre-preparation stage broadcast protocol;
The protocol processing module B outputs a preparation message through a preparation stage broadcast protocol;
protocol processing module C: the commit message is output via the mmit phase broadcast protocol.
The beneficial effects of the invention are as follows: the invention aims to provide a method and a system for realizing BFT consensus algorithm based on 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 BFT consensus characteristics; therefore, the concurrency performance of the BFT consensus is close to that of the non-Bayesian-busy consensus, and the practical BFT algorithm in reality is realized.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions of the prior art, the drawings that are needed in the embodiments or the description of the prior art will be briefly described below, it will be obvious that the drawings in the following description are some embodiments of the present invention, and that other drawings can be obtained according to these drawings without inventive effort to a person skilled in the art.
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 of an embodiment of the present invention.
Detailed Description
The present invention will be further described with reference to the accompanying drawings and specific examples, which are not intended to be limiting, so that those skilled in the art will better understand the invention and practice it.
Embodiment one:
A BFT consensus algorithm implementation method based on a Header-Sig stream comprises the following specific steps:
S1, dividing the structure of a generated block;
s2, selecting a corresponding block transmitted to the accounting node according to the requirement of the accounting node;
s3, issuing the block through the sorting node and pulling the block through the accounting node;
S4, 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 accounting node requests a complete block stream from a randomly selected ordering node and requests a Header-Sig stream from all other ordering 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 of the invention fully utilizes the structure of the Fabric block, orderer signs the hash of the block content instead of the block content itself; constructing a Header-Sig block stream structure containing only a Header and metadata;
the accounting node requests a complete block stream from a randomly selected ordering node and only requests a Header-Sig stream from all other ordering nodes; the size of the Header-Sig stream relative to the size of the complete block stream can be several orders of magnitude smaller, and the occupation of the network and the storage space is small;
if the total number of sequencing nodes delivering the complete block provides a Header-Sig stream and then returns the complete block stream, then the accounting node may suspect subjective maliciousness of the sequencing node delivering the complete block, the accounting node downgrade the sequencing node to deliver the Header-Sig stream and select another sequencing node to deliver a complete block stream;
The invention aims to provide a method for realizing BFT consensus algorithm based on Header-Sig stream, 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 BFT consensus characteristics. Thereby leading the concurrency performance of the BFT consensus to be close to that of the non-Bayesian-busy consensus and realizing a practical BFT algorithm in reality;
The method can fully utilize the structure of the Fabric block, and the hash of the block content is signed by the sequencing node instead of the block content itself; the accounting node requests a complete block stream from a randomly selected ordering node and only requests a Header-Sig stream from all other ordering nodes; the size of the Header-Sig stream relative to the size of the complete block stream can be several orders of magnitude smaller, and the occupation of the network and the storage space is small; the overall concurrency processing capacity of the block chain network is effectively improved;
Meanwhile, in order to prevent the ordering node delivering the complete block flow from deliberately slowing down the whole blocking speed, the ordering node delivering the complete block is limited; if the total quorum of delivered complete blocks provides a Header-Sig stream followed by a return of the complete block stream, then the billing node may suspect subjective maliciousness of the delivered complete block of sequencing nodes; the accounting node downgrades the sequencing node to deliver the Header-Sig stream and selects another sequencing node to deliver a complete block stream;
Further, the specific steps of S1 to split the structure of the generated block are as follows:
S101, splitting a Header block Header in a generated block into a block number, a hash of a current effective load and a hash of a previous block;
s102, dividing Body blocks in the generated blocks into all transactions in the blocks;
s103, dividing Metadata of Metadata in the generated block into three fields;
The 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 a block;
further, the step S103 is to split Metadata of Metadata in the generated block into three fields, specifically including an index of the last configuration block, information specific to a common identifier, and a signature of the ordering node;
Metadata contains three important fields, (a) the index of the last configuration block; (b) consensus-specific information; (c) ordering the signatures of the nodes. Wherein the maximum data volume and occupied space are Body (block Body), and the maximum performance pressure for block transmission and block verification in a block chain network is the maximum;
further, the specific steps of issuing the block through the sorting node and pulling the block through the accounting node in S3 are as follows:
S301, using BFT algorithm to make all normal nodes execute request in same sequence through three-stage broadcast protocol;
s302, selecting a master (Leader) sequencing node, and calling a BFT consensus library to obtain a pre-preparation message;
still further, the specific steps of using the BFT algorithm to make all the normal nodes execute the request in the same order by using the three-phase broadcast protocol in S301 are as follows:
S3011 outputs the pre-preparation message through the pre-preparation stage broadcast protocol;
s3012 outputs the preparation message through the preparation stage broadcast protocol;
S3013 outputs the commit message via mmit-phase broadcast protocol.
The BFT algorithm makes all normal nodes execute requests according to the same sequence through a three-stage broadcast protocol, wherein the three stages are pre-prepare, prepare and commit respectively; outputting a pre-preparation message, a preparation message and a commit message corresponding to the three stages; in order to construct a new consensus block proposal, all sequencing nodes need to select a master (Leader) sequencing node first, and a pre-preparation message is obtained by calling a BFT consensus library by the master (Leader) sequencing node and is a block which is not signed by the sequencing node; the preparation information is the pre-preparation information signed by all sequencing nodes participating in consensus, each sequencing node sends a preparation information to all other sequencing nodes and simultaneously receives the preparation information sent by other sequencing nodes; if the preparation message received from 2f different ordering nodes is consistent with the pre-preparation message, namely, together with a total of 2f+1 acknowledgements of the preparation message, then entering a commit phase;
In our BFT consensus implementation, the blocks received from the ordering service cannot be forged because they are signed by at least 2/3 of the ordering nodes; however, receiving a stream of data blocks from a single ordering node is not secure because the ordering nodes are mutually untrusted; to prevent this, we implement a more resilient block delivery service; a simple way is to request a block stream from a 2/3 ordering node;
The accounting node simply requests the block flow from the 2/3 ordering node; this is expensive because the block is large; the structure of the Fabric block is fully utilized, and the ordering node signs the hash of the block content instead of the block content itself; the accounting node may request a new chunk structure-a stream containing only the header and metadata of each new chunk-header-sig stream;
the accounting node requests a complete block stream from a randomly selected ordering node and only requests a Header-Sig stream from all other ordering nodes; the size of the Header-Sig stream relative to the size of the complete block stream can be several orders of magnitude smaller, and the occupation of the network and the storage space is small;
The sorting nodes randomly selected to send the complete block flow are important, and in order to prevent the sorting nodes delivering the complete block flow from deliberately slowing down the whole blocking speed, the sorting nodes delivering the complete block are limited; if the total quorum of delivered complete blocks provides a Header-Sig stream followed by a return of the complete block stream, then the billing node may suspect subjective maliciousness of the delivered complete block of sequencing nodes; when this occurs, the billing node downgrades this ordering node to deliver the Header-Sig stream and selects another ordering node to deliver a complete block stream.
Embodiment two:
A BFT consensus algorithm implementation system based on a Header-Sig stream specifically comprises a structure splitting module, a block editing module, a block verification module and a node request module:
and (3) a structural separation module: splitting the structure of the generated block;
A block editing module: selecting a corresponding block transmitted to the accounting node according to the requirement of the accounting node;
block verification module: issuing the block through the sorting node and pulling the block through the accounting node;
the node request module: the accounting node requests a complete block stream from a randomly selected ordering node and only requests a Header-Sig stream from all other ordering nodes;
Further, the structure splitting module specifically includes a block header splitting module, a block body splitting module, and a metadata splitting module:
The block head splitting module comprises: splitting a Header block Header in the generated block into a block number, a hash of the current payload and a hash of a previous block;
Zone block splitting module: splitting the Body block Body in the generated block to obtain all transactions in the block;
Metadata splitting module: dividing Metadata of Metadata in the generated block into three fields;
Further, the metadata splitting module splits three fields, specifically including the index of the last configuration block, the consensus specific information and the signature of the ordering node;
Further, the block verification module specifically includes a sequential execution module and a node pulling module:
The sequence execution module: using BFT algorithm to make all normal nodes execute request in same sequence through three-stage broadcast protocol;
node pulling module: selecting a master (Leader) sequencing node, and calling a BFT consensus library to obtain a pre-preparation 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-preparation message through a pre-preparation stage broadcast protocol;
The protocol processing module B outputs a preparation message through a preparation stage broadcast protocol;
protocol processing module C: outputting a commit message through mmit-stage broadcast protocol;
As shown in fig. 3, each block on the blockchain 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 a block; metadata contains three important fields, (a) the index of the last configuration block; (b) consensus-specific information; (c) ordering the signatures of the nodes; wherein the maximum data volume and occupied space are Body (block Body), and the maximum performance pressure for block transmission and block verification in a block chain network is the maximum;
The structure of the Fabric block, the ordering node signs the hash of the block content, not the block content itself; in the above figures, the signed content 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, and does not contain Body itself;
The structural feature of the Fabric block is fully utilized, and no attempt is made to change the overall structure of the block, but the Header, body and metadata are split, and a Header-Sig block stream not containing Body is removed.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and are not limiting; although the 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 scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims (2)
1. A method for realizing BFT consensus algorithm based on Header-Sig stream is characterized by comprising the following specific steps:
S1, dividing the structure of a generated block;
s2, selecting a corresponding block transmitted to the accounting node according to the requirement of the accounting node;
s3, issuing the block through the sorting node and pulling the block through the accounting node;
S4, 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 specific steps of the S1 for splitting the structure of the generated block are as follows:
S101, splitting a Header block Header in a generated block into a block number, a hash of a current effective load and a hash of a previous block;
s102, dividing Body blocks in the generated blocks into all transactions in the blocks;
s103, dividing Metadata of Metadata in the generated block into three fields;
the step S103 is to split Metadata of Metadata in the generated block into three fields, wherein the three fields specifically comprise an index of the last configuration block, consensus specific information and a signature of a sequencing node;
the specific steps of S3 issuing the block through the sorting node and pulling the block through the accounting node are as follows:
S301, using BFT algorithm to make all normal nodes execute request in same sequence through three-stage broadcast protocol;
s302, selecting a master (Leader) sequencing node, and calling a BFT consensus library to obtain a pre-preparation message;
the specific steps of using the BFT algorithm to make all normal nodes execute requests in the same order through the three-phase broadcast protocol in S301 are as follows:
S3011 outputs the pre-preparation message through the pre-preparation stage broadcast protocol;
s3012 outputs the preparation message through the preparation stage broadcast protocol;
S3013 outputs the commit message via mmit-phase broadcast protocol.
2. A BFT consensus algorithm implementation system based on a Header-Sig stream is characterized by specifically comprising a structure splitting module, a block editing module, a block verification module and a node request module:
and (3) a structural separation module: splitting the structure of the generated block;
A block editing module: selecting a corresponding block transmitted to the accounting node according to the requirement of the accounting node;
block verification module: issuing the block through the sorting node and pulling the block through the accounting node;
the node request module: the accounting node requests a complete block stream from a randomly selected ordering node and only requests a Header-Sig stream from all other ordering 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: splitting a Header block Header in the generated block into a block number, a hash of the current payload and a hash of a previous block;
Zone block splitting module: splitting the Body block Body in the generated block to obtain all transactions in the block;
Metadata splitting module: dividing Metadata of Metadata in the generated block into three fields;
The metadata splitting module splits three fields, which specifically comprise the index of the last configuration block, the specific information of the consensus and the signature of the sequencing node;
the block verification module specifically comprises a sequential execution module and a node pulling module:
The sequence execution module: using BFT algorithm to make all normal nodes execute request in same sequence through three-stage broadcast protocol;
node pulling module: selecting a master (Leader) sequencing node, and calling a BFT consensus library to obtain a pre-preparation 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-preparation message through a pre-preparation stage broadcast protocol;
The protocol processing module B outputs a preparation message through a preparation stage broadcast protocol;
protocol processing module C: the commit message is output via 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 CN113965566A (en) | 2022-01-21 |
| CN113965566B true 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 (11)
| 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 |
| 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 |
| CN113111388A (en) * | 2017-03-31 | 2021-07-13 | 唐晓领 | Method, device and system for sharing transaction metadata information by financing parties based on block chain |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20200059369A1 (en) * | 2017-05-16 | 2020-02-20 | Peking University Shenzhen Graduate School | Determining consensus by parallel proof of voting in consortium blockchain |
| US11405181B2 (en) * | 2019-07-12 | 2022-08-02 | Microsoft Technology Licensing, Llc | Lightweight blockchain based on split-trust |
| BR112022003989A2 (en) * | 2019-09-06 | 2022-05-31 | Bosonic Inc | System and method for providing a blockchain-based registration process |
| CN110855565B (en) * | 2019-11-22 | 2021-07-20 | 广州大学 | Verifiable inter-domain route verification method based on block chain |
| CN111522683B (en) * | 2020-07-03 | 2020-10-02 | 支付宝(杭州)信息技术有限公司 | Consensus node changing method and related device for badger Byzantine fault-tolerant consensus mechanism |
-
2021
- 2021-10-11 CN CN202111180785.1A patent/CN113965566B/en active Active
Patent Citations (11)
| 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 |
| 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 |
| CN110569675A (en) * | 2019-09-18 | 2019-12-13 | 上海海事大学 | Multi-Agent transaction information protection method based on block chain technology |
| 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 |
Non-Patent Citations (5)
| Title |
|---|
| Scalable BFT Consensus Mechanism Through Aggregated Signature Gossip;J. Long and R. Wei;2019 IEEE International Conference on Blockchain and Cryptocurrency (ICBC);20190701;第360-367页 * |
| Window Based BFT Blockchain Consensus;M. M. Jalalzai and C. Busch;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);第971-979页 * |
| 区块链共识机制研究综述;刘懿中, 刘建伟, 张宗洋等;密码学报;20190831;第6卷(第04期);第395-432页 * |
| 区块链技术原理与应用综述;郭上铜, 王瑞锦, 张凤荔;计算机科学;第48卷(第02期);第271-281页 * |
| 基于区块链的网络安全体系结构与关键技术研究进展;徐恪, 凌思通, 李琦等;计算机学报;第44卷(第01期);第55-83页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113965566A (en) | 2022-01-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109936457B (en) | Block chain multi-party witness method, device, equipment and computer readable storage medium | |
| US10944624B2 (en) | Changing a master node in a blockchain system | |
| Collins et al. | Online payments by merely broadcasting messages | |
| CN113114759B (en) | Chain-crossing method and system for realizing multi-chain intercommunication | |
| Keidar et al. | Efficient message ordering in dynamic networks | |
| CN111625593B (en) | Block chain-based data processing method and device and computer equipment | |
| CN111598566A (en) | Network payment system based on mixed cross-chain | |
| CN111046437A (en) | Block chain parallel transaction processing method and system based on isomorphic multi-chain and terminal | |
| CN111681003A (en) | Resource cross-chain transfer method and device, computer equipment and storage medium | |
| CN118096139A (en) | Method and apparatus for cross-ledger transfer between distributed ledgers and systems using cross-ledger transfer | |
| CN110298754B (en) | Consensus method applied to block chain | |
| CN111342971A (en) | Byzantine consensus method and system | |
| Choi et al. | Scalable network-coded PBFT consensus algorithm | |
| CN113342838B (en) | Data processing method, device and equipment based on block chain and readable storage medium | |
| WO2021258548A1 (en) | Interactive aggregate signature method, and device and storage medium | |
| CN116707759B (en) | Lightweight alliance chain consensus method for high concurrency scene of data flow | |
| Li et al. | Jenga: Orchestrating smart contracts in sharding-based blockchain for efficient processing | |
| CN113965566B (en) | BFT consensus algorithm implementation method and system based on Header-Sig stream | |
| CN113157450A (en) | Method and apparatus for performing blocks in a blockchain system | |
| CN116455685A (en) | PBFT improved consensus method under broadcast network | |
| US20230066169A1 (en) | Method and apparatus for distributed consensus in consideration of share proportions of nodes and method of generating blockchain using the same | |
| CN114928446A (en) | Efficient consensus method for large-scale nodes | |
| CN111813795B (en) | Method and apparatus for confirming transactions in a blockchain network | |
| EP4346159A1 (en) | Method and apparatus of adding additional chain to blockchain, and method and apparatus of generating shard for the same | |
| CN116743343B (en) | High-performance block chain consensus method for complex network environment |
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 |