AI & ML
DispersedBFT: Bottleneck-Free Primary-Backup Consensus using Dispersed Replication
arXiv cs.DC0 views
arXiv:2611.24833v1 Announce Type: cross Abstract: The advent of blockchains is fueling the development of novel resilient data management systems (RDSs). Typically, these RDSs are managed using a primary-backup design using a consensus protocol such as PBFT. In these primary-backup designs, a single participant, the primary, is responsible for coordinating the replication and execution of requests. Unfortunately, the central role of the primary makes it a bottleneck that drastically limits performance. In this paper, we propose DispersedBFT, a high performance PBFT-like consensus protocol that utilizes dispersed replication to eliminate the primary bottleneck of PBFT-like consensus. In specific, DispersedBFT uses information dispersal to distribute the task of replicating request from the primary to the backups. We propose several variants of DispersedBFT with either low CPU cost (by using Message Authentication Codes and Merkle proofs) or communication cost (by using digital signatures). We practically analyze the performance of DispersedBFT and show it greatly outperforms PBFT and HotStuff: DispersedBFT supports a throughput of 3.4Mtxn/sec with 43 replicas and is up-to 6.2x faster than PBFT and 2.6x faster than HotStuff.
Source:https://arxiv.org/abs/2611.24833PreviousStealing Exact Training Data from Other Clients during Federated LearningNextTackling Parallelization Challenges of Randomized Preconditioners With Dependency Tracking
Related posts
Designing a useful preview for an AI-generated comic
0dev.to
AI Agents: What They Are and Why They Matter
0dev.to
GPT-6.2 Astra Was Easier to Jailbreak, UK Testing Found
0dev.to
iFixit Says Apple’s HomeView Breaks Easily. Here’s Why I’m Not Worried
0CNET News
Scout Motors Is Using AI Earpieces to Train Factory Workers
0CNET News
'Grand Theft Auto VI' is here. What to know about the characters, music and all the hype
0Phys.org Tech