SBFT: a Scalable and Decentralized Trust Infrastructure

Abstract: SBFT is a state of the art Byzantine fault tolerant permissioned blockchain system that addresses the challenges of scalability, decentralization and world-scale geo-replication. SBFTis optimized for decentralization and can easily handle more than 200 active replicas in a real world-scale deployment. We evaluate \sysname in a world-scale geo-replicated deployment with 209 replicas withstanding f=64 Byzantine failures. We provide experiments that show how the different algorithmic ingredients of \sysname increase its performance and scalability. The results show that SBFT simultaneously provides almost 2x better throughput and about 1.5x better latency relative to a highly optimized system that implements the PBFT protocol. To achieve this performance improvement, SBFT uses a combination of four ingredients: using collectors and threshold signatures to reduce communication to linear, using an optimistic fast path, reducing client communication and utilizing redundant servers for the fast path.

• The paper demonstrates that SBFT supports 200+ replicas with tolerance for 64 Byzantine faults, achieving nearly double the throughput of optimized PBFT systems.
• It introduces innovations like linear communication via collectors, threshold signatures, and an optimistic fast path to minimize overhead and latency.
• Experimental results on 209 replicas executing smart contracts show over 170 transactions per second with latencies around 620 ms, confirming SBFT’s efficiency under real-world conditions.

Overview of "SBFT: A Scalable and Decentralized Trust Infrastructure"

The paper "SBFT: a Scalable and Decentralized Trust Infrastructure" introduces a Byzantine fault-tolerant (BFT) blockchain system designed to address key challenges associated with scalability, decentralization, and geo-replication on a global scale. This system, referred to as SBFT, promises improvements over previous protocols such as Practical Byzantine Fault Tolerance (PBFT) by leveraging advanced cryptographic techniques and optimizing its architecture for efficient consensus in large-scale deployments.

Core Contributions and Methodology

The primary contribution of SBFT lies in its ability to support a large number of replicas—more than 200 in the actual deployment—and withstand a significant number of Byzantine failures (f = 64). The paper highlights SBFT's ability to provide almost double the throughput and 1.5 times better latency compared to a highly optimized PBFT system. The performance enhancements stem from the integration of several algorithmic innovations:

1. Linear Communication with Collectors and Threshold Signatures: SBFT reduces communication complexity using collectors and leverages threshold signatures that transform an all-to-all communication pattern into a linear one. This approach significantly lowers the overhead, as each decision in the system is verified using a threshold signature which implies constant-sized messages despite having a large number of replicas.
2. Optimistic Fast Path: The system includes a fast path for consensus processing in optimistic scenarios where all replicas behave correctly and are synchronized. This technique accelerates transactions by reducing the communication and computational steps required to reach agreement.
3. Reduced Client Communication and Single-Messaging Acknowledgment: Traditional Byzantine fault-tolerant protocols required a client to wait for f+1 responses to consider a request acknowledged. SBFT reduces this overhead by enabling a single message acknowledgment using cryptographic signatures, making it particularly efficient when interacting with a large number of clients.
4. Redundant Servers to Enhance Performance and Resilience: SBFT incorporates redundant servers into its architecture to accommodate up to a certain number, c, of non-responsive or faulty nodes without affecting its fast-path capabilities. This redundancy ensures that SBFT maintains its efficiency and robustness across a wide spectrum of real-world conditions.

Experimental Evaluation

SBFT was evaluated through extensive experiments under real-world conditions, showcasing its capability to support a geo-replicated deployment and execute Ethereum Virtual Machine (EVM) smart contracts. In a case study with 209 replicas, SBFT demonstrated the capacity to handle more than 170 smart contract transactions per second with a latency of roughly 620 milliseconds even under Byzantine failures.

Implications and Future Prospects

The research on SBFT presents significant implications for both permissioned and potentially permissionless blockchain deployments. By improving performance, scalability, and resilience, SBFT addresses crucial limitations faced by existing BFT protocols when applied to global blockchain systems. As the demand for decentralized distributed systems grows, particularly with enterprise use cases, the advancement of SBFT paves the way for integrating BFT consensus mechanisms with real-world blockchain applications at scale.

Looking forward, future work could explore integrating SBFT's capabilities into permissionless systems or further enhancing the interoperability with other consensus algorithms. Additionally, as smart contracts and decentralized applications become more prominent, optimized BFT solutions like SBFT will prove invaluable in ensuring security and efficiency across diverse operational environments.