Parbft: Faster asynchronous bft consensus with a parallel optimistic path
To reduce latency and communication overhead of asynchronous Byzantine Fault Tolerance
(BFT) consensus, an optimistic path is often added, with Ditto and BDT as state-of-the-art …
(BFT) consensus, an optimistic path is often added, with Ditto and BDT as state-of-the-art …
[引用][C] ParBFT: Faster Asynchronous BFT Consensus with a Parallel Optimistic Path
X Dai, B Zhang, H Jin, L Ren - 2023 - par.nsf.gov
ParBFT: Faster Asynchronous BFT Consensus with a Parallel Optimistic Path
X Dai, B Zhang, H Jin, L Ren - Cryptology ePrint Archive, 2023 - eprint.iacr.org
To reduce latency and communication overhead of asynchronous Byzantine Fault Tolerance
(BFT) consensus, an optimistic path is often added, with Ditto and BDT as state-of-the-art …
(BFT) consensus, an optimistic path is often added, with Ditto and BDT as state-of-the-art …
ParBFT: Faster Asynchronous BFT Consensus with a Parallel Optimistic Path
X Dai, H Jin, B Zhang, L Ren - 30th ACM SIGSAC Conference …, 2023 - experts.illinois.edu
To reduce latency and communication overhead of asynchronous Byzantine Fault Tolerance
(BFT) consensus, an optimistic path is often added, with Ditto and BDT as state-of-the-art …
(BFT) consensus, an optimistic path is often added, with Ditto and BDT as state-of-the-art …