Red Belly: A Secure, Fair and Scalable Open Blockchain
Authors:
Top Cited Papers
- 1 May 2021
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 466-483
Abstract
Blockchain has found applications to track ownership of digital assets. Yet, several blockchains were shown vulnerable to network attacks. It is thus crucial for companies to adopt secure blockchains before moving them to production. In this paper, we present Red Belly Blockchain (RBBC), the first secure blockchain whose throughput scales to hundreds of geodistributed consensus participants. To this end, we drastically revisited Byzantine Fault Tolerant (BFT) blockchains through three contributions: (i) defining the Set Byzantine Con-sensus problem of agreeing on a superblock of all proposed blocks instead of a single block; (ii) adopting a fair leaderless design to offer censorship-resistance guaranteeing the commit of correctly requested transactions; (iii) introducing sharded verification to limit the number of signature verifications without hampering security. We evaluate RBBC on up to 1000 VMs of 3 different types, spread across 4 continents, and under attacks. Although its performance is affected by attacks, RBBC scales in that its throughput increases to hundreds of consensus nodes and achieves 30k TPS throughput and 3 second latency on 1000 VMs, hence improving by 3× both the latency and the throughput of its closest competitor.Keywords
Funding Information
- Australian Research Council
This publication has 50 references indexed in Scilit:
- The Next 700 BFT ProtocolsACM Transactions on Computer Systems, 2015
- Brief Announcement: Leaderless Byzantine PaxosLecture Notes in Computer Science, 2011
- A Leader-Free Byzantine Consensus Algorithm2010
- ZyzzyvaACM SIGOPS Operating Systems Review, 2007
- Practical byzantine fault tolerance and proactive recoveryACM Transactions on Computer Systems, 2002
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990
- Consensus in the presence of partial synchronyJournal of the ACM, 1988
- Asynchronous Byzantine agreement protocolsInformation and Computation, 1987
- A lower bound for the time to assure interactive consistencyInformation Processing Letters, 1982
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980