Scalable and Probabilistic Leaderless BFT Consensus through Metastability

Rocket, Team; Yin, Maofan; Sekniqi, Kevin; Renesse, Robbert van; Sirer, Emin Gün

doi:10.48550/arxiv.1906.08936

Cited by 21 publications

(48 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…DAGs Other permissionless Blockchains use directed acyclic graphs rather than chains [92,94,96], but require dependencies and conflicts to be known prior to execution.…”

Section: Related Workmentioning

confidence: 99%

Basil: Breaking up BFT with ACID (transactions)

Suri-Payer,

Burke,

Wang

et al. 2021

Preprint

View full text Add to dashboard Cite

This paper presents Basil, the first transactional, leaderless Byzantine Fault Tolerant key-value store. Basil leverages ACID transactions to scalably implement the abstraction of a trusted shared log in the presence of Byzantine actors. Unlike traditional BFT approaches, Basil executes non-conflicting operations in parallel and commits transactions in a single round-trip during fault-free executions. Basil improves throughput over traditional BFT systems by four to five times, and is only four times slower than TAPIR, a non-Byzantine replicated system. Basil's novel recovery mechanism further minimizes the impact of failures: with 30% Byzantine clients, throughput drops by less than 25% in the worst-case.CCS Concepts: • Computer systems organization → Dependable and fault-tolerant systems and networks; • Security and privacy → Systems security; Database and storage security.

show abstract

“…DAGs Other permissionless Blockchains use directed acyclic graphs rather than chains [92,94,96], but require dependencies and conflicts to be known prior to execution.…”

Section: Related Workmentioning

confidence: 99%

Basil: Breaking up BFT with ACID (transactions)

Suri-Payer,

Burke,

Wang

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…• Single validator per block: To simplify the model, we avoid using committees [22,47,25,23,10,15,44,41] and verifiers [5,6] as they add more variance and make both formal and simulation methods more difficult.…”

Section: Assumption 2 (Distributed Systems) All Communication Between...mentioning

confidence: 99%

“…• Sharded state is synchronously traversed Any sharded state in our PoS blockchain is read synchronously and we assume linearizability in our blockchain. This can be relaxed to non-linearizable protocols like Avalanche [47], but will depend on the scoring function used for each branch.…”

Section: Assumption 2 (Distributed Systems) All Communication Between...mentioning

confidence: 99%

Competitive equilibria between staking and on-chain lending

Chitra¹

2020

Preprint

View full text Add to dashboard Cite

Proof of Stake (PoS) is a burgeoning Sybil resistance mechanism that aims to have a digital asset ("token") serve as security collateral in crypto networks. However, PoS has so far eluded a comprehensive threat model that encompasses both Byzantine attacks from distributed systems and financial attacks that arise from the dual usage of the token as a means of payment and a Sybil resistance mechanism. In particular, the existence of derivatives markets makes malicious coordination among validators easier to execute than in Proof of Work systems. We demonstrate that it is also possible for on-chain lending smart contracts to cannibalize network security in PoS systems. When the yield provided by these contracts is more attractive than the inflation rate provided from staking, stakers will tend to remove their staked tokens and lend them out, thus reducing network security. In this paper, we provide a simple stochastic model that describes how rational validators with varying risk preferences react to changes in staking and lending returns. For a particular configuration of this model, we provide a formal proof of a phase transition between equilibria in which tokens are predominantly staked and those in which they are predominantly lent. We further validate this emergent adversarial behavior (e.g. reduced staked token supply) with agent-based simulations that sample transitions under more realistic conditions. Our results illustrate that rational, non-adversarial actors can dramatically reduce PoS network security if block rewards are not calibrated appropriately above the expected yields of on-chain lending.

show abstract

“…A coordinator run by the IOTA foundation provides checkpoints every minute so that nodes consistently verify transactions, and so that the DAG does not grow excessively in width. Avalanche [18] uses a data structure similar to IOTA. Users are free to choose which transactions they want to reference, and therefore need to be incentivized to help build a DAG with limited width.…”

Section: Related Workmentioning

confidence: 99%

“…Blockclique also uses a DAG structure, but restricts it to a fixed number of threads, allowing the DAG to grow only in one direction. This greatly simplifies the protocol and its analysis, and removes the need for central entities [17] or incentives for users to grow the DAG in a single direction [18].…”

Section: Related Workmentioning

confidence: 99%

Blockclique: scaling blockchains through transaction sharding in a multithreaded block graph

Forestier¹,

Vodenicarevic²,

Laversanne-Finot³

2018

Preprint

View full text Add to dashboard Cite

Decentralized crypto-currencies based on the blockchain architecture under-utilize available network bandwidth, making them unable to scale to thousands of transactions per second. We define the Blockclique architecture, that addresses this limitation by sharding transactions in a block graph with a fixed number of threads. The architecture allows the creation of intrinsically compatible blocks in parallel, where each block references one previous block of each thread. The consistency of the Blockclique protocol is formally established in presence of attackers. An experimental evaluation of the architecture's performance in large realistic networks demonstrates an efficient use of available bandwidth and a throughput of thousands of transactions per second.

show abstract

Scalable and Probabilistic Leaderless BFT Consensus through Metastability

Cited by 21 publications

References 0 publications

Basil: Breaking up BFT with ACID (transactions)

Basil: Breaking up BFT with ACID (transactions)

Competitive equilibria between staking and on-chain lending

Blockclique: scaling blockchains through transaction sharding in a multithreaded block graph

Contact Info

Product

Resources

About