4 papers
DAGs for the Masses
Michael Anoprenko, Andrei Tonkikh, Alexander Spiegelman +3
A recent approach to building consensus protocols on top of Directed Acyclic Graphs (DAGs) shows much promise due to its simplicity and stable throughput. However, as each node in…
Prefix Consensus For Censorship Resistant BFT
Zhuolun Xiang, Andrei Tonkikh, Alexander Spiegelman
Despite broad adoption of BFT consensus in blockchains, censorship resistance remains weak: existing designs offer limited inclusion guarantees and allow leaders to exclude transac…
Raptr: Prefix Consensus for Robust High-Performance BFT
Andrei Tonkikh, Balaji Arun, Zhuolun Xiang +2
In this paper, we present Raptr--a Byzantine fault-tolerant state machine replication (BFT SMR) protocol that combines strong robustness with high throughput, while attaining near-…
Swiper: a new paradigm for efficient weighted distributed protocols
Andrei Tonkikh, Luciano Freitas
The majority of fault-tolerant distributed algorithms are designed assuming a nominal corruption model, in which at most a fraction of parties can be corrupted by the adversa…