CN114499874B - Bayesian-busy-family fault-tolerant consensus optimization method applied to industrial Internet - Google Patents
Bayesian-busy-family fault-tolerant consensus optimization method applied to industrial Internet Download PDFInfo
- Publication number
- CN114499874B CN114499874B CN202111642100.0A CN202111642100A CN114499874B CN 114499874 B CN114499874 B CN 114499874B CN 202111642100 A CN202111642100 A CN 202111642100A CN 114499874 B CN114499874 B CN 114499874B
- Authority
- CN
- China
- Prior art keywords
- leader
- coordinator
- information
- voting
- consensus
- 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 28
- 238000005457 optimization Methods 0.000 title claims abstract description 23
- 238000012795 verification Methods 0.000 claims abstract description 24
- 230000006854 communication Effects 0.000 claims description 29
- 238000004891 communication Methods 0.000 claims description 26
- 238000005192 partition Methods 0.000 claims description 19
- 230000008859 change Effects 0.000 claims description 14
- 230000008569 process Effects 0.000 claims description 8
- 230000002776 aggregation Effects 0.000 claims description 6
- 238000004220 aggregation Methods 0.000 claims description 6
- 230000010076 replication Effects 0.000 claims description 3
- 238000005516 engineering process Methods 0.000 abstract description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 239000004744 fabric Substances 0.000 description 1
- 230000003993 interaction 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
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
- H04L63/1441—Countermeasures against malicious traffic
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Hardware Redundancy (AREA)
Abstract
The invention belongs to the field of block chain technology consensus algorithm, and particularly relates to a Bayesian fault-tolerant consensus optimization method applied to industrial Internet; the method comprises the following steps: a coordination phase, a preparation phase, a voting phase and a submitting phase; the coordination stage selects Q leaders in the blockchain system, each leader is configured with one coordinator, wherein the coordinator is a leader selected randomly from a leader set, and each leader can only serve as a coordinator of one leader; the client side in the preparation stage broadcasts a block generation request to all leaders and coordinators; the leader and coordinator in the voting stage vote on the block generation request; in the submitting stage, the leader and the coordinator verify the voting result, if the verification is passed, consensus is achieved, and if the verification is not passed, the consensus fails; each node repeatedly executes the Bayesian fault-tolerant consensus optimization algorithm until all nodes complete consensus; compared with the prior art, the method has lower time delay, higher throughput and larger node capacity.
Description
Technical Field
The invention belongs to the field of block chain technology consensus algorithm, and particularly relates to a Bayesian fault-tolerant consensus optimization method applied to industrial Internet.
Background
The bayer error refers to a fault tolerance that a malicious node transmits information that is inconsistent before and after to each node in order to prevent the transmission of real information and the achievement of effective agreement, and can cope with the bayer error, and is called a bayer fault tolerance. The Bayesian fault-tolerant consensus algorithm is how to form a consensus on the network state among normal nodes assuming that the blockchain network environment includes servers that are operating normally, failed servers, and destroyers.
The use of cryptocurrency facilitates the use of BYBYBZATH Fault Tolerance (BFT) in many blockchain systems. Compared with a work load proving method (POW), the BFT protocol has certain advantages in terms of computational efficiency and the like. BFT has been fully studied in the context of distributed systems, and algorithms such as PBFT (practical bayer fault tolerance formula algorithm) have emerged. The problem of low efficiency of the original Bayesian fault-tolerant algorithm is solved, and the algorithm complexity is reduced from an exponential level to a polynomial level, so that the Bayesian fault-tolerant algorithm becomes feasible in practical system application. It is this algorithm that is mainly used in super ledger Fabric 0.6. It can ensure the correct and reliable message transmission under the condition that the number of failed nodes is not more than 1/3 of the total nodes.
PBFT essentially trades for reliability with the number of communications. Every command execution requires every two interaction between nodes to verify messages, which generates relatively high communication cost, and the PBFT algorithm belongs to a communication intensive protocol algorithm and is only suitable for small-scale systems with a small number of nodes. The performance of the protocol algorithm is drastically reduced when the number of system nodes is increased, and algorithms such as HotStuff, streamlet, SBFT are presented for improving the performance, i.e. improving the communication efficiency, but these protocols have limited scalability and performance due to having a single leader bottleneck. In order to extend the system and increase throughput, there is a need for a method that optimizes the bayer fault tolerance consensus and reduces the impact of a single leader bottleneck on system performance.
Disclosure of Invention
Aiming at the defects existing in the prior art, the invention provides a Bayesian-preemption fault-tolerant consensus optimization method applied to the industrial Internet, which comprises the following steps:
designing a blockchain system comprising N clients, fault tolerant nodes in all clientsThe number of points is F, and the number of leaders is Q; all leaders constitute a leader set L s The method comprises the steps of carrying out a first treatment on the surface of the Wherein N is more than or equal to 3F+1, and Q is a random number less than or equal to N; constructing a local communication model, and executing a Bayesian fault-tolerant consensus optimization algorithm on each node in the blockchain system according to the local communication model so that each node achieves consensus;
executing a Bayesian fault-tolerant consensus optimization algorithm, wherein the Bayesian fault-tolerant consensus optimization algorithm comprises a coordination stage, a preparation stage, a voting stage and a submitting stage; the coordination stage selects Q leaders in the blockchain system, each leader is configured with one coordinator, wherein the coordinator is a leader selected randomly from a leader set, and each leader can only serve as a coordinator of one leader; the client side in the preparation stage broadcasts a block generation request to all leaders and coordinators; the leader and coordinator in the voting stage vote on the block generation request; in the submitting stage, the leader and the coordinator verify the voting result, if the verification is passed, consensus is achieved, and if the verification is not passed, the consensus fails; each node repeatedly executes the Bayesian fault-tolerant consensus optimization algorithm until all nodes complete consensus.
Preferably, constructing the local communication model includes: setting a network delay threshold delta; setting a time period t, and completing an information communication process by all honest leaders in the set time period t in the process of executing a Bayesian-busy-tolerant consensus optimization algorithm; when one of the honest leaders transmits a communication, the other honest leader to receive the message receives the communication within delta time.
Preferably, electing Q leaders in the blockchain system includes: designated coordinator C r Circularly electing Q leaders; from the leader collection L s Each leader is respectively configured with a different coordinator, and each leader can only serve as a coordinator of one leader; the coordinator carries out serial number division on the leader to obtain a partition space; the coordinator records the round information.
Preferably, the preparation phase comprises: the leader and the coordinator perform state machine log replication to generate a copy, and partition space division is performed on the copy according to the partition space to obtain a copy partition space; the coordinator updates the turn information and sends turn change information to the corresponding leader according to the partition space; the leader signs the round change information and replies the signed information to the coordinator.
Further, the coordinator sending the round change information to the corresponding leader thereof includes: the coordinator adopts the cryptography principle to digitally sign the round change information to obtain local signature information; the coordinator sends the local signature information to all the leaders of the block to which the coordinator belongs.
Further, the leader receives local signature information sigma of all coordinators i ＝sign i B j The method comprises the steps of carrying out a first treatment on the surface of the The leader integrates the received partial signature information into a single signature σ=aggsign (sign) using signature aggregation i (B j ) i∈N ) The method comprises the steps of carrying out a first treatment on the surface of the The leader aggregates all single signatures sigma into a signature AggQC; wherein sigma i Representing the i-th partial signature, sign i Representing signing a block, B j The j-th block is represented, agg represents the aggregation into a single signature, and N represents the number of clients.
Further, the leader replying the signature information to the coordinator includes: the coordinator receives the reply information of the leader; the coordinator creates a RoundQC according to the received reply information; the coordinator broadcasts the RoundQC information to all the leaders of the round, with RoundQC representing information generated by the coordinator.
Preferably, the voting phase comprises: after receiving the block generation request, the leader generates a pseudo block and signs the pseudo block, and takes the signed pseudo block as voting information; signing and verifying the voting information by the copy, and if the verification fails, failing the consensus; if the verification is passed, the leader sends voting information to other leaders, and all the voting information is integrated into a voting set { votes }; the leader receives the voting information sent by other leaders and generates a voting result according to the voting information.
Preferably, the process of signing and verifying the voting information by the copy comprises the following steps: the copies obtain the copy voting results according to the copy partition space, the voting results received by the leader are compared with the copy voting results, if the results are the same, the verification is passed, and if the results are different, the verification is not passed.
Preferably, the submitting stage comprises: after the verification is passed, the client sends a commit message to the coordinator node; the coordinator sends a commit message to the leader; the leader replies a reply message to the client and the consensus ends.
The beneficial effects of the invention are as follows: the invention is based on PBFT algorithm, and by making each node be a leader and configuring a coordinator for each leader, all the leaders can communicate in parallel stage; setting a local communication model, and carrying out consensus under the local communication model so as to realize global communication and consensus; compared with the traditional Bayesian fault-tolerant consensus algorithm, the problem that a single leader bottleneck causes that a large-capacity node cannot be borne is solved, so that the system can improve the generation rate and consensus efficiency of the block, further achieve the effects of reducing delay and improving throughput, and compared with the algorithms such as POW, DPOS, CBFT, PBFT in the prior art, the invention has lower time delay, higher throughput and larger node capacity.
Drawings
FIG. 1 is a schematic diagram of a consensus process in the present invention;
FIG. 2 is a schematic diagram illustrating an overview of communication between a node and a blockchain in accordance with the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The invention provides a Bayesian-preemption fault-tolerant consensus optimization method applied to an industrial Internet, which is shown in figure 1 and comprises the following steps:
designing a blockchain system that includes N clientsThe number of fault-tolerant nodes in all clients is F, and the number of leaders is Q; all leaders constitute a leader set L s The method comprises the steps of carrying out a first treatment on the surface of the Wherein N is more than or equal to 3F+1, and Q is a random number less than or equal to N; constructing a local communication model, and executing a Bayesian fault-tolerant consensus optimization algorithm on each node in the blockchain system according to the local communication model so that each node achieves consensus;
executing a Bayesian fault-tolerant consensus optimization algorithm, wherein the Bayesian fault-tolerant consensus optimization algorithm comprises a coordination stage, a preparation stage, a voting stage and a submitting stage; the coordination stage selects Q leaders in the blockchain system, each leader is configured with one coordinator, wherein the coordinator is a leader selected randomly from a leader set, and each leader can only serve as a coordinator of one leader; the client side in the preparation stage broadcasts a block generation request to all leaders and coordinators; the leader and coordinator in the voting stage vote on the block generation request; in the submitting stage, the leader and the coordinator verify the voting result, if the verification is passed, consensus is achieved, and if the verification is not passed, the consensus fails; each node repeatedly executes the Bayesian fault-tolerant consensus optimization algorithm until all nodes complete consensus.
The constructing of the local communication model comprises the following steps: setting a network delay threshold delta, wherein the setting of the threshold delta is required to ensure that N nodes can communicate in parallel by realizing linear communication complexity under any condition; setting a time period t, and completing an information communication process by all honest leaders in the set time period t in the process of executing a Bayesian-busy-tolerant consensus optimization algorithm; when one of the honest leaders transmits a communication message in a certain round of consensus, the other honest leaders who want to receive the message in delta time.
Electing Q leaders in a blockchain system includes: designated coordinator C r Circularly electing Q leaders; from the leader collection L s Each leader is respectively configured with a different coordinator, and each leader can only serve as a coordinator of one leader; the coordinator records the round information; the coordinator circularly and randomly selects from the leader set, and is responsible for guiding each round of consensus process and recording the current consensus round; is thatCommunication conflicts among the leaders are avoided, the coordinator divides sequence numbers of the leaders, and partitions a partition space for each leader.
Entering a preparation stage: the client sends a block generation Request to the leader, and specifically, the client dynamically sends a plurality of independent requests < Request, t, O, id > to the leader; wherein t is time, O is operation number, and id is client id.
The leader and the coordinator perform state machine log replication to generate a copy, and partition space division is performed on the copy according to the partition space to obtain a copy partition space; the coordinator updates the turn information and sends turn change information to the corresponding leader according to the partition space; the leader signs the round change information and replies the signed information to the coordinator.
The coordinator sending the round change information to its corresponding leader includes: the coordinator adopts the cryptography principle to digitally sign the round change information to obtain local signature information; the coordinator sends the local signature information to all the leaders of the block to which the coordinator belongs.
Signing the turn change information by the leader includes: the leader receives the local signature information sigma of all coordinators i ＝sign i B j The method comprises the steps of carrying out a first treatment on the surface of the The leader integrates the received partial signature information into a single signature σ=aggsign (sign) using signature aggregation i (B j ) i∈N ) The method comprises the steps of carrying out a first treatment on the surface of the The leader aggregates all single signatures sigma into a signature AggQC; wherein sigma i Representing the i-th partial signature, sign i Representing signing a block, B j The j-th block is represented, agg represents the aggregation into a single signature, and N represents the number of clients.
The leader replying the signature information to the coordinator includes: the coordinator receives the reply information of the leader; the coordinator creates a RoundQC; broadcasting the RoundQC information to all leaders of the round by the coordinator according to the received reply information; the RoundQC represents information generated by the coordinator, and the RoundQC information contains signature information.
The voting stage comprises the following steps: after receiving the block generation request, the leader generates a pseudo block and signs the pseudo block, and takes the signed pseudo block as voting information; the copy performs signing verification on the voting information, and the signing process is as follows: all signature information in a PKI (public key infrastructure) identification system is adopted, a copy obtains a copy voting result according to a copy partition space, the voting result received by a leader is compared with the copy voting result, if the result is the same, verification is passed, and if the result is different, verification is not passed; if the verification is passed, the leader sends voting information to other leaders; to reduce the communication complexity of the voting phase, all the voting information is integrated into one voting set { votes }; after receiving voting information sent by other leaders, the leader generates voting results according to the voting information by using a rule of minority compliance and majority compliance;
the client receives the voting information signed by the copy, which is expressed as < Reply, r, t, L >, wherein r is an integer, and L is a leader identifier for executing the client request.
Entering a commit phase, wherein the commit phase comprises: after the verification is passed, the client sends a commit message to the coordinator; the coordinator sends a commit message to the leader; the leader replies a reply message to the client and the consensus ends.
The information exchange outline between the consensus nodes and the blockchain is shown in fig. 2, after the verification is passed, the client sends a commit message to the coordinator node and synchronizes all the consensus nodes in the consensus network to prepare for the next round of consensus; the coordinator sends a commit message to the leader; the leader replies reply information to the client, broadcasts the achieved consensus to the whole network, and the round of consensus is ended.
The invention is based on PBFT algorithm, and by making each node be a leader and configuring a coordinator for each leader, all the leaders can communicate in parallel stage; setting a local communication model, and carrying out consensus under the local communication model so as to realize global communication and consensus; compared with the traditional Bayesian fault-tolerant consensus algorithm, the problem that a single leader bottleneck causes that a large-capacity node cannot be borne is solved, so that the system can improve the generation rate and consensus efficiency of the block, further achieve the effects of reducing delay and improving throughput, and compared with the algorithms such as POW, DPOS, CBFT, PBFT in the prior art, the invention has lower time delay, higher throughput and larger node capacity.
While the foregoing is directed to embodiments, aspects and advantages of the present invention, other and further details of the invention may be had by the foregoing description, it will be understood that the foregoing embodiments are merely exemplary of the invention, and that any changes, substitutions, alterations, etc. which may be made herein without departing from the spirit and principles of the invention.
Claims (1)
1. The Bayesian-preemption fault-tolerant consensus optimization method applied to the industrial Internet is characterized by comprising the following steps of:
designing a blockchain system, wherein the system comprises N clients, the number of fault-tolerant nodes in all clients is F, and the number of leaders is Q; all leaders constitute a leader set L s The method comprises the steps of carrying out a first treatment on the surface of the Wherein N is more than or equal to 3F+1, and Q is a random number less than or equal to N; constructing a local communication model, and executing a Bayesian fault-tolerant consensus optimization algorithm on each node in the blockchain system according to the local communication model so that each node achieves consensus; the constructing of the local communication model comprises the following steps: setting a network delay threshold delta; setting a time period t, and completing an information communication process by all honest leaders in the set time period t in the process of executing a Bayesian-busy-tolerant consensus optimization algorithm; when one honest leader sends a piece of communication information, the other honest leader which is to receive the information receives the information within delta time;
executing a Bayesian fault-tolerant consensus optimization algorithm, wherein the Bayesian fault-tolerant consensus optimization algorithm comprises a coordination stage, a preparation stage, a voting stage and a submitting stage; the coordination stage selects Q leaders in the blockchain system, each leader is configured with one coordinator, wherein the coordinator is a leader selected randomly from a leader set, and each leader can only serve as a coordinator of one leader; the client side in the preparation stage broadcasts a block generation request to all leaders and coordinators; the leader and coordinator in the voting stage vote on the block generation request; in the submitting stage, the leader and the coordinator verify the voting result, if the verification is passed, consensus is achieved, and if the verification is not passed, the consensus fails; each node repeatedly executes the Bayesian fault-tolerant consensus optimization algorithm until all nodes complete consensus;
electing Q leaders in a blockchain system includes: designated coordinator C r Circularly electing Q leaders; from the leader collection L s Each leader is respectively configured with a different coordinator, and each leader can only serve as a coordinator of one leader; the coordinator carries out serial number division on the leader to obtain a partition space; the coordinator records the round information;
the preparation stage comprises the following steps: the leader and the coordinator perform state machine log replication to generate a copy, and partition space division is performed on the copy according to the partition space to obtain a copy partition space; the coordinator updates the turn information and sends turn change information to the corresponding leader according to the partition space; the leader signs on the round change information and replies the signature information to the coordinator; wherein, the coordinator sends the round change information to the corresponding leader thereof, which comprises: the coordinator carries out digital signature on the round change information to obtain local signature information; the coordinator sends the local signature information to all leaders of the block to which the coordinator belongs; signing the turn change information by the leader includes: the leader receives the local signature information sigma of all coordinators i ＝sign i B j The method comprises the steps of carrying out a first treatment on the surface of the The leader integrates the received partial signature information into a single signature σ=aggsign (sign) using signature aggregation i (B j ) i∈N ) The method comprises the steps of carrying out a first treatment on the surface of the The leader aggregates all single signatures sigma into a signature AggQC; wherein sigma i Representing the i-th partial signature, sign i Representing signing a block, B j The j-th block is represented, agg represents the aggregation into a single signature, and N represents the number of clients; the leader replying the signature information to the coordinator includes: the coordinator receives the reply information of the leader; the coordinator creates a RoundQC according to the received reply information; the coordinator broadcasts the RoundQC information to all the leaders of the round, roundQC represents coordinator-generated information;
the voting stage comprises the following steps: after receiving the block generation request, the leader generates a pseudo block and signs the pseudo block, and takes the signed pseudo block as voting information; signing and verifying the voting information by the copy, and if the verification fails, failing the consensus; if the verification is passed, the leader sends voting information to other leaders, and all the voting information is integrated into a voting set { votes }; the leader receives voting information sent by other leaders and generates a voting result according to the voting information; the process of signing and verifying the voting information by the copy comprises the following steps: the copies obtain the copy voting results according to the copy partition space, the voting results received by the leader are compared with the copy voting results, if the results are the same, the verification is passed, and if the results are different, the verification is not passed;
the submitting stage comprises the following steps: after the verification is passed, the client sends a commit message to the coordinator; the coordinator sends a commit message to the leader; the leader replies a reply message to the client and the consensus ends.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111642100.0A CN114499874B (en) | 2021-12-29 | 2021-12-29 | Bayesian-busy-family fault-tolerant consensus optimization method applied to industrial Internet |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111642100.0A CN114499874B (en) | 2021-12-29 | 2021-12-29 | Bayesian-busy-family fault-tolerant consensus optimization method applied to industrial Internet |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114499874A CN114499874A (en) | 2022-05-13 |
| CN114499874B true CN114499874B (en) | 2023-10-31 |
Family
ID=81508600
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111642100.0A Active CN114499874B (en) | 2021-12-29 | 2021-12-29 | Bayesian-busy-family fault-tolerant consensus optimization method applied to industrial Internet |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114499874B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117221332B (en) * | 2023-06-08 | 2024-04-12 | 天津大学 | High-robustness exchange packaging method based on multi-leader Bayesian-busy-family fault-tolerant consensus |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111179087A (en) * | 2019-12-31 | 2020-05-19 | 重庆邮电大学 | Alliance chain consensus method based on grid arbitration |
| CN111372100A (en) * | 2020-04-21 | 2020-07-03 | 白杨 | End-to-end content distribution network system and distribution method based on distributed election |
| CN112118321A (en) * | 2020-09-24 | 2020-12-22 | 北京工业大学 | Practical Byzantine fault-tolerant consensus mechanism optimization system of industrial block chain |
| CN112424810A (en) * | 2018-07-03 | 2021-02-26 | 万迪斯科股份有限公司 | Method, device and system for remittance based on distributed coordination engine for realizing block chain distributed ledger |
-
2021
- 2021-12-29 CN CN202111642100.0A patent/CN114499874B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112424810A (en) * | 2018-07-03 | 2021-02-26 | 万迪斯科股份有限公司 | Method, device and system for remittance based on distributed coordination engine for realizing block chain distributed ledger |
| CN111179087A (en) * | 2019-12-31 | 2020-05-19 | 重庆邮电大学 | Alliance chain consensus method based on grid arbitration |
| CN111372100A (en) * | 2020-04-21 | 2020-07-03 | 白杨 | End-to-end content distribution network system and distribution method based on distributed election |
| CN112118321A (en) * | 2020-09-24 | 2020-12-22 | 北京工业大学 | Practical Byzantine fault-tolerant consensus mechanism optimization system of industrial block chain |
Non-Patent Citations (3)
| Title |
|---|
| Byzantine-Robust Aggregation in Federated Learning Empowered Industrial IoT;Shenghui Li;《IEEE Transactions on Industrial Informatics 》;全文 * |
| 一种区块链实用拜占庭容错算法的改进;韩镇阳;宫宁生;任珈民;;计算机应用与软件(第02期);全文 * |
| 异步环境下的拜占庭共识算法研究;翁良;《硕士电子期刊》;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114499874A (en) | 2022-05-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20230259430A1 (en) | Byzantine agreement using communications having linear complexity | |
| CN110784346B (en) | Reputation value-based PBFT consensus system and method | |
| CN111131209B (en) | Improved efficient consensus method, system, computer device and storage medium | |
| Jalalzai et al. | Fast-hotstuff: A fast and resilient hotstuff protocol | |
| CN113141414B (en) | Grouped multi-chain asynchronous consensus method for block chain nodes in CNFS protocol | |
| Decouchant et al. | DAMYSUS: streamlined BFT consensus leveraging trusted components | |
| Yu et al. | Improved blockchain consensus mechanism based on PBFT algorithm | |
| CN114422513B (en) | Block chain consensus method based on Raft-PBFT | |
| CN114050904B (en) | Consensus system and method based on two-level leader node fragmentation structure | |
| CN113064764B (en) | Method and apparatus for executing blocks in a blockchain system | |
| CN109919760A (en) | Byzantine failure tolerance common recognition algorithm based on voting mechanism | |
| Jalalzai et al. | Window based BFT blockchain consensus | |
| CN112395113B (en) | Practical Bayesian fault-tolerant consensus method and device and readable storage medium | |
| CN111582843A (en) | Block chain privacy transaction method based on aggregated signature | |
| He et al. | An improvement of consensus fault tolerant algorithm applied to alliance chain | |
| CN114745140B (en) | Urban planning field block chain consensus verification method and system based on aggregation encryption | |
| CN114499874B (en) | Bayesian-busy-family fault-tolerant consensus optimization method applied to industrial Internet | |
| Jalalzai et al. | Fast-hotstuff: A fast and robust bft protocol for blockchains | |
| CN111970370B (en) | Communication equipment system-oriented multilayer block chain protocol expansion system and method | |
| CN116232893A (en) | Consensus method and device of distributed system, electronic equipment and storage medium | |
| Li et al. | EBFT: A hierarchical and group-based byzantine fault tolerant consensus algorithm | |
| CN116260826A (en) | Bayesian-busy fault tolerance consensus method and system in supply chain tracing | |
| CN113992398A (en) | Improved PBFT consensus algorithm | |
| CN113660346B (en) | Method for broadcasting blocks on alliance chain | |
| Jiang et al. | An efficient Byzantine fault-tolerant consensus mechanism based on threshold signature |
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 |