BigDipper: A hyperscale BFT system with short term censorship resistance
Bowen Xue, Soubhik Deb, Sreeram Kannan

TL;DR
BigDipper introduces a hyperscale BFT system that ensures short-term censorship resistance by decentralizing transaction inclusion, enabling fast confirmation, and maintaining high throughput in decentralized applications.
Contribution
The paper presents BigDipper, a novel BFT system that decentralizes transaction inclusion and enforces censorship resistance with a modular design and three new DA-CR protocols.
Findings
Achieves censorship resistance in BFT protocols.
Supports hyperscale throughput and fast confirmation.
Demonstrates integration with Hotstuff-2.
Abstract
Byzantine-fault-tolerant (BFT) protocols underlie a variety of decentralized applications including payments, auctions, data feed oracles, and decentralized social networks\cite{chainlink,lens}. In most leader-based BFT protocols, an important property that has been missing is the censorship resistance of transaction in the short term. The protocol should provide inclusion guarantees in the next block height even if the current and future leaders have the intent of censoring.In this paper, we present a BFT system, BigDipper, that achieves censorship resistance while providing fast confirmation for clients and hyperscale throughput. The core idea is to decentralize inclusion of transactions by allowing every BFT replica to create their own mini-block, and then enforcing the leader on their inclusions. To achieve this, BigDipper creates a modular system made of three components. First,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Advanced Data Storage Technologies · Caching and Content Delivery
