CN114499874A - Byzantine fault-tolerant consensus optimization method applied to industrial internet - Google Patents
Byzantine fault-tolerant consensus optimization method applied to industrial internet Download PDFInfo
- Publication number
- CN114499874A CN114499874A CN202111642100.0A CN202111642100A CN114499874A CN 114499874 A CN114499874 A CN 114499874A CN 202111642100 A CN202111642100 A CN 202111642100A CN 114499874 A CN114499874 A CN 114499874A
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 34
- 238000005457 optimization Methods 0.000 title claims abstract description 29
- 238000012795 verification Methods 0.000 claims abstract description 25
- 230000006854 communication Effects 0.000 claims description 31
- 238000004891 communication Methods 0.000 claims description 28
- 238000005192 partition Methods 0.000 claims description 16
- 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
- 238000005516 engineering process Methods 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003313 weakening effect Effects 0.000 description 1
Images
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
Abstract
The invention belongs to the field of a block chain technology consensus algorithm, and particularly relates to a Byzantine fault-tolerant consensus optimization method applied to an industrial internet; the method comprises the following steps: a coordination phase, a preparation phase, a voting phase and a submission phase; in the coordination stage, Q leaders are elected in the block chain system, and each leader is configured with a coordinator, wherein the coordinators are randomly selected from a leader set, and each leader can only be used as a coordinator of one leader; in the preparation phase, a client broadcasts a block generation request to all the leaders and the coordinators; voting by a leader and a coordinator in the voting stage on the block generation request; in the submitting stage, the leader and the coordinator verify the voting results, if the verification is passed, the consensus is achieved, and if the verification is not passed, the consensus fails; each node repeatedly executes the Byzantine fault-tolerant consensus optimization algorithm until all the nodes finish consensus; compared with the prior art, the method has the advantages of lower time delay, higher throughput and larger node capacity.
Description
Technical Field
The invention belongs to the field of a block chain technology consensus algorithm, and particularly relates to a Byzantine fault-tolerant consensus optimization method applied to an industrial internet.
Background
Byzantine errors refer to the fault tolerance that a malicious node sends inconsistent information to each node in order to hinder the transmission of real information and achieve effective consistency, and can handle the byzantine errors, which is called byzantine fault tolerance. The Byzantine fault-tolerant consensus algorithm is how to form consensus on the network state among normal nodes under the condition that a blockchain network environment comprises a server which operates normally, a server which fails and a server which is a destructor.
The use of cryptocurrency facilitates the use of Byzantine Fault Tolerance (BFT) in many blockchain systems. The BFT protocol has certain advantages in terms of computational efficiency, etc., compared to the workload proof method (POW). BFT has been well studied in the context of distributed systems, and algorithms such as PBFT (practical byzantine fault-tolerant formula algorithm) have emerged. The problem that the original Byzantine fault-tolerant algorithm is low in efficiency is solved, and the complexity of the algorithm is reduced from exponential level to polynomial level, so that the Byzantine fault-tolerant algorithm is feasible in practical system application. It is this algorithm that is primarily used in the superbugt fabry 0.6. It can ensure that the message delivery is correct and reliable without the failed node exceeding the total node number 1/3.
PBFT essentially uses the number of communications in exchange for reliability. The execution of each command requires pairwise interaction between nodes to check messages, which results in higher communication cost, and the PBFT algorithm belongs to a communication-intensive protocol algorithm and is only suitable for a small-scale system, i.e., a system with a small number of nodes. When the number of system nodes is increased, the performance of the protocol algorithm is sharply reduced, and in order to improve the performance, namely, improve the communication efficiency, algorithms such as hot stuff, Streamlet, SBFT and the like are appeared, but the protocols have limited expansibility and performance because of a single leader bottleneck. In order to expand the system and increase the throughput, a method capable of optimizing the byzantine fault-tolerant consensus and weakening the influence of the bottleneck of a single leader on the system performance is needed.
Disclosure of Invention
Aiming at the defects in the prior art, the invention provides a Byzantine fault-tolerant consensus optimization method applied to an industrial internet, which comprises the following steps:
designing a block chain system, wherein the system comprises N client sides, the number of fault-tolerant nodes in all the client sides is F, and the number of leaders is Q; all the leaders form a leader set Ls(ii) a 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 Byzantine fault-tolerant consensus optimization algorithm on each node in the block chain system according to the local communication model so as to enable each node to achieve consensus;
the method comprises the steps of executing a Byzantine fault-tolerant consensus optimization algorithm, wherein the algorithm comprises a coordination stage, a preparation stage, a voting stage and a submission stage; in the coordination stage, Q leaders are elected in the block chain system, and each leader is configured with a coordinator, wherein the coordinators are randomly selected from a leader set, and each leader can only be used as a coordinator of one leader; in the preparation phase, a client broadcasts a block generation request to all the leaders and the coordinators; voting by a leader and a coordinator in the voting stage on the block generation request; in the submitting stage, the leader and the coordinator verify the voting results, if the verification is passed, the consensus is achieved, and if the verification is not passed, the consensus fails; and (4) repeatedly executing the Byzantine fault-tolerant consensus optimization algorithm by each node until all the nodes finish consensus.
Preferably, constructing the local communication model includes: setting a network delay threshold value delta; setting a time period t, and finishing the information communication process by all honest leaders in the set time period t in the process of executing the Byzantine fault-tolerant consensus optimization algorithm; when one of the honest leaders sends a communication, the other honest leader that is to receive the message receives the communication within δ.
Preferably, electing Q leaders in the blockchain system comprises: appoint coordinator CrCircularly electing Q leaders; from leader setLsRespectively configuring a different coordinator for each leader, wherein each leader can only be used as the coordinator of one leader; the coordinator divides the sequence number of the leader to obtain a partition space; the coordinator records the round information.
Preferably, the preparation phase comprises: the leader and the coordinator copy the state machine logs to generate a copy, and partition space division is carried out on the copy according to the partition space to obtain a copy partition space; the coordinator updates the round information and sends round change information to the corresponding leader according to the partition space; the leader signs the change information of the round and replies the signature information to the coordinator.
Further, the step of the coordinator sending the round change information to the corresponding leader comprises: the coordinator carries out digital signature on the round change information by adopting a cryptology principle 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 the local signature information σ of all coordinatorsi＝signiBj(ii) a The leader integrates the received local signature information into a single signature sigma-AggSign (sign) by using a signature aggregation modei(Bj)i∈N) (ii) a The leader aggregates all the single signatures sigma into a signature AggQC; wherein σiRepresenting the ith local signature, signiRepresenting the signing of a block, BjRepresenting the jth block, Agg representing aggregation into a single signature, and N representing the number of clients.
Further, the leader replying the signature information to the coordinator comprises: the coordinator receives reply information of the leader; the coordinator establishes a RoundQC according to the received reply information; the coordinator broadcasts RoundQC information to all the leaders of the round, RoundQC representing the information generated by the coordinator.
Preferably, the voting stage comprises: after receiving the block generation request, the leader generates a pseudo block and carries out signature on the pseudo block, and the pseudo block after signature is used as voting information; the copy signs and verifies the voting information, and if the verification fails, the consensus fails; 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 }; and the leader receives the voting information sent by other leaders and generates a voting result according to the voting information.
Preferably, the process of signature verification of the voting information by the copy comprises: and the copy obtains a copy voting result according to the copy partition space, the voting result received by the leader is compared with the copy voting result, if the results are the same, the verification is passed, and if the results are different, the verification is not passed.
Preferably, the commit phase 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; and the leader replies a reply message to the client, and the consensus is finished.
The invention has the beneficial effects that: the invention is based on the PBFT algorithm, each node can become a leader, and each leader is configured with a coordinator, so that all the leaders can communicate in a parallel stage; by setting a local communication model, consensus is carried out under the local communication model, so that the realization of global communication and consensus is achieved; compared with the traditional Byzantine fault-tolerant consensus algorithm, the method and the system solve the problem that the large-capacity nodes cannot be carried due to the bottleneck of a single leader, so that the system can improve the block generation rate and the consensus efficiency, and further achieve the effects of reducing delay and improving throughput.
Drawings
FIG. 1 is a schematic diagram of the consensus process of the present invention;
FIG. 2 is a schematic diagram illustrating an overview of the communication between a consensus node and a block chain in the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The invention provides a Byzantine fault-tolerant consensus optimization method applied to an industrial internet, as shown in figure 1, the method comprises the following steps:
designing a block chain system, wherein the system comprises N client sides, the number of fault-tolerant nodes in all the client sides is F, and the number of leaders is Q; all the leaders form a leader set Ls(ii) a 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 Byzantine fault-tolerant consensus optimization algorithm on each node in the block chain system according to the local communication model so as to enable each node to achieve consensus;
the method comprises the steps of executing a Byzantine fault-tolerant consensus optimization algorithm, wherein the algorithm comprises a coordination stage, a preparation stage, a voting stage and a submission stage; in the coordination stage, Q leaders are elected in the block chain system, and each leader is configured with a coordinator, wherein the coordinators are randomly selected from a leader set, and each leader can only be used as a coordinator of one leader; in the preparation phase, a client broadcasts a block generation request to all the leaders and the coordinators; voting by a leader and a coordinator in the voting stage on the block generation request; in the submitting stage, the leader and the coordinator verify the voting results, if the verification is passed, the consensus is achieved, and if the verification is not passed, the consensus fails; and (4) repeatedly executing the Byzantine fault-tolerant consensus optimization algorithm by each node until all the nodes finish consensus.
Constructing a local communication model includes: setting a network delay threshold delta, wherein the setting of the threshold delta can realize the parallel communication of N nodes by realizing the linear communication complexity under any condition; setting a time period t, and finishing the information communication process by all honest leaders in the set time period t in the process of executing the Byzantine fault-tolerant consensus optimization algorithm; when one of the honest leaders sends a communication in a certain round of consensus, the other honest leader who is to receive the message receives the message within a time δ.
Electing Q leaders in a blockchain system includes: appoint coordinator CrCircularly electing Q leaders; set of Slave leaders LsRespectively configuring a different coordinator for each leader, wherein each leader can only be used as the 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; in order to avoid communication conflict among the leaders, the coordinator divides the leaders into sequence numbers and divides a partition space for each leader.
Entering a preparation stage: the client side sends a block generation Request to the leader, and specifically, the client side dynamically sends a plurality of independent requests < Request, t, O, id > to the leader; wherein t is time, O is an operation number, and id is client id.
The leader and the coordinator copy the state machine logs to generate a copy, and partition space division is carried out on the copy according to the partition space to obtain a copy partition space; the coordinator updates the round information and sends round change information to the corresponding leader according to the partitioned space; the leader signs the round change information and replies the signature information to the coordinator.
The coordinator sending the round change information to the corresponding leader comprises: the coordinator carries out digital signature on the round change information by adopting a cryptology principle to obtain local signature information; the coordinator sends the local signature information to all the leaders of the block to which the coordinator belongs.
The leader signs the round change information, including: the leader receives the local signature information σ of all coordinatorsi＝signiBj(ii) a The leader integrates the received local signature information into a single signature sigma-AggSign (sign) by using a signature aggregation modei(Bj)i∈N) (ii) a The leader aggregates all the single signatures sigma into a signature AggQC; wherein σiRepresenting the ith local signature, signiRepresenting the signing of a block, BjRepresenting the jth block, Agg representing the aggregation into a single signature, and N representing the number of clients.
The leader replying the signature information to the coordinator includes: the coordinator receives reply information of the leader; the coordinator creates a RoundQC; the coordinator broadcasts the RoundQC information to all the leaders of the round according to the received reply information; RoundQC denotes the coordinator-generated information, and RoundQC information contains signature information.
The voting stage comprises: after receiving the block generation request, the leader generates a pseudo block and carries out signature on the pseudo block, and the pseudo block after signature is used as voting information; the copy signs and verifies the voting information, and the signing process comprises the following steps: adopting a standard digital signature and all signature information in a Public Key Infrastructure (PKI) identification system, obtaining a duplicate voting result by a duplicate according to a duplicate partition space, comparing the voting result received by a leader with the duplicate voting result, if the results are the same, passing the verification, and if the results are different, not passing the verification; if the verification is passed, the leader sends voting information to other leaders; in order to reduce the communication complexity in the voting stage, integrating all the voting information into a voting set { votes }; after receiving the voting information sent by other leaders, the leader generates a voting result according to the voting information by a principle that a minority obeys a majority;
the client receives the voting information signed by the copy, and the voting information is represented 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; and the leader replies a reply message to the client, and the consensus is finished.
The summary of information exchange between the consensus nodes and the block chains is shown in fig. 2, after the verification is passed, the client sends commit messages to the coordinator node and synchronizes all the consensus nodes in the consensus network to prepare for the next consensus; the coordinator sends a commit message to the leader; and the leader replies a reply message to the client, the achieved consensus is broadcasted to the whole network, and the consensus in the current round is finished.
The invention is based on the PBFT algorithm, each node can become a leader, and each leader is configured with a coordinator, so that all the leaders can communicate in a parallel stage; by setting a local communication model, consensus is carried out under the local communication model, so that the realization of global communication and consensus is achieved; compared with the traditional Byzantine fault-tolerant consensus algorithm, the method and the system solve the problem that the large-capacity nodes cannot be carried due to the bottleneck of a single leader, so that the system can improve the block generation rate and the consensus efficiency, and further achieve the effects of reducing delay and improving throughput.
The above-mentioned embodiments, which further illustrate the objects, technical solutions and advantages of the present invention, should be understood that the above-mentioned embodiments are only preferred embodiments of the present invention, and should not be construed as limiting the present invention, and any modifications, equivalents, improvements, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. A Byzantine fault-tolerant consensus optimization method applied to an industrial internet is characterized by comprising the following steps:
designing a block chain system, wherein the system comprises N clients, the number of fault-tolerant nodes in all the clients is F, and the number of leaders is Q; all the leaders form a leader set Ls(ii) a 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 Byzantine fault-tolerant consensus optimization algorithm on each node in the block chain system according to the local communication model so as to enable each node to achieve consensus;
the method comprises the steps of executing a Byzantine fault-tolerant consensus optimization algorithm, wherein the algorithm comprises a coordination stage, a preparation stage, a voting stage and a submission stage; in the coordination stage, Q leaders are elected in the block chain system, and each leader is configured with a coordinator, wherein the coordinators are randomly selected from a leader set, and each leader can only be used as a coordinator of one leader; in the preparation phase, a client broadcasts a block generation request to all the leaders and the coordinators; voting by a leader and a coordinator in the voting stage on the block generation request; in the submitting stage, the leader and the coordinator verify the voting results, if the verification is passed, the consensus is achieved, and if the verification is not passed, the consensus fails; and (4) repeatedly executing the Byzantine fault-tolerant consensus optimization algorithm by each node until all the nodes finish consensus.
2. The Byzantine fault-tolerant consensus optimization method applied to the industrial Internet according to claim 1, wherein the building of the local communication model comprises: setting a network delay threshold value delta; setting a time period t, and finishing the information communication process by all honest leaders in the set time period t in the process of executing the Byzantine fault-tolerant consensus optimization algorithm; when one of the honest leaders sends a communication, the other honest leader that is to receive the message receives the communication within δ.
3. The Byzantine fault-tolerant consensus optimization method applied to the industrial Internet according to claim 1, wherein electing Q leaders in the blockchain system comprises: appoint coordinator CrCircularly electing Q leaders; set of Slave leaders LsRespectively configuring a different coordinator for each leader, wherein each leader can only be used as the coordinator of one leader; the coordinator divides the sequence number of the leader to obtain a partition space; the coordinator records the round information.
4. The Byzantine fault-tolerant consensus optimization method applied to the industrial Internet according to claim 1, wherein the preparation phase comprises: the leader and the coordinator copy the state machine logs to generate a copy, and partition space division is carried out on the copy according to the partition space to obtain a copy partition space; the coordinator updates the round information and sends round change information to the corresponding leader according to the partitioned space; the leader signs the round change information and replies the signature information to the coordinator.
5. The Byzantine fault-tolerant consensus optimization method applied to the industrial Internet according to claim 4, wherein the coordinator sending the turn change information to the corresponding leader comprises: the coordinator carries out digital signature on the round change information by adopting a cryptology principle to obtain local signature information; the coordinator sends the local signature information to all the leaders of the block to which the coordinator belongs.
6. The Byzantine fault-tolerant consensus optimization method applied to the industrial Internet according to claim 4, wherein the leader signs on the turn change information comprises: the leader receives the local signature information σ of all coordinatorsi＝signiBj(ii) a The leader integrates the received local signature information into a single signature sigma-AggSign (sign) by using a signature aggregation modei(Bj)i∈N) (ii) a The leader aggregates all the single signatures sigma into a signature AggQC; wherein σiRepresenting the ith local signature, signiRepresenting the signing of a block, BjRepresenting the jth block, Agg representing the aggregation into a single signature, and N representing the number of clients.
7. The Byzantine fault-tolerant consensus optimization method applied to the industrial Internet according to claim 4, wherein the leader replying the signature information to the coordinator comprises: the coordinator receives reply information of the leader; the coordinator establishes a RoundQC according to the received reply information; the coordinator broadcasts RoundQC information to all the leaders of the round, RoundQC representing the information generated by the coordinator.
8. The Byzantine fault-tolerant consensus optimization method applied to the industrial Internet according to claim 1, wherein the voting stage comprises: after receiving the block generation request, the leader generates a pseudo block and carries out signature on the pseudo block, and the pseudo block after signature is used as voting information; the copy signs and verifies the voting information, and if the verification fails, the consensus fails; 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 }; and the leader receives the voting information sent by other leaders and generates a voting result according to the voting information.
9. The Byzantine fault-tolerant consensus optimization method applied to the industrial Internet according to claim 7, wherein the process of signature verification of voting information by the copy comprises the following steps: and the copy obtains a copy voting result according to the copy partition space, the voting result received by the leader is compared with the copy voting result, if the results are the same, the verification is passed, and if the results are different, the verification is not passed.
10. The Byzantine fault-tolerant consensus optimization method applied to the industrial Internet according to claim 1, wherein the submitting 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; and the leader replies a reply message to the client, and the consensus is finished.
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 true CN114499874A (en) | 2022-05-13 |
| CN114499874B 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) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117221332A (en) * | 2023-06-08 | 2023-12-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 |
|---|
| SHENGHUI LI: "Byzantine-Robust Aggregation in Federated Learning Empowered Industrial IoT", 《IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 》 * |
| 翁良: "异步环境下的拜占庭共识算法研究", 《硕士电子期刊》 * |
| 韩镇阳;宫宁生;任珈民;: "一种区块链实用拜占庭容错算法的改进", 计算机应用与软件, no. 02 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117221332A (en) * | 2023-06-08 | 2023-12-12 | 天津大学 | High-robustness exchange packaging method based on multi-leader Bayesian-busy-family fault-tolerant consensus |
| CN117221332B (en) * | 2023-06-08 | 2024-04-12 | 天津大学 | High-robustness exchange packaging method based on multi-leader Bayesian-busy-family fault-tolerant consensus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114499874B (en) | 2023-10-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110784346B (en) | Reputation value-based PBFT consensus system and method | |
| CN111131209B (en) | Improved efficient consensus method, system, computer device and storage medium | |
| CN114401150A (en) | Method for adding node in block chain network and block chain system | |
| CN111311414A (en) | Block chain multi-party consensus method based on consistent hash algorithm | |
| CN111682942B (en) | Binary weighted Byzantine fault-tolerant consensus method applied to license chain | |
| Decouchant et al. | DAMYSUS: streamlined BFT consensus leveraging trusted components | |
| CN113141414B (en) | Grouped multi-chain asynchronous consensus method for block chain nodes in CNFS protocol | |
| Buchnik et al. | Fireledger: A high throughput blockchain consensus protocol | |
| CN109919760A (en) | Byzantine failure tolerance common recognition algorithm based on voting mechanism | |
| CN112395113B (en) | Practical Bayesian fault-tolerant consensus method and device and readable storage medium | |
| CN113064764B (en) | Method and apparatus for executing blocks in a blockchain system | |
| KR20200081533A (en) | Blockchain Consensus Method based Improved Dynamic Blind Voting for Internet of Things Environment | |
| CN110874351A (en) | Workload certification cooperative work method, block chain node and block chain system | |
| CN112217683A (en) | Cross-heterogeneous-chain data reachability processing method, system, medium, device and terminal | |
| Wang et al. | Byzantine fault tolerant algorithm based on vote | |
| CN111798234B (en) | Lightweight block chain system and construction method | |
| CN111582843A (en) | Block chain privacy transaction method based on aggregated signature | |
| CN114422513A (en) | Block chain consensus method based on Raft-PBFT | |
| CN114745140B (en) | Urban planning field block chain consensus verification method and system based on aggregation encryption | |
| CN114338040A (en) | Grouping multi-chain three-time consensus method for block link points | |
| CN114760135B (en) | Optimization method of block chain fault-tolerant consensus scheme | |
| CN114499874A (en) | Byzantine fault-tolerant consensus optimization method applied to industrial internet | |
| CN113157450B (en) | Method and apparatus for executing blocks in a blockchain system | |
| CN111970370B (en) | Communication equipment system-oriented multilayer block chain protocol expansion system and method | |
| Lei et al. | Improved Method of Blockchain Cross-Chain Consensus Algorithm Based on Weighted PBFT |
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 |