12 papers
Orcaella: Hybrid Fault Tolerance with Client-Selectable Finality Latency
Lefteris Kokoris-Kogias, Alberto Sonnino
Classical partially synchronous state machine replication, as in PBFT, tolerates f Byzantine replicas among n at least 3f+1 using three communication steps per request. Recent prot…
BlueBottle: Fast and Robust Blockchains through Subsystem Specialization
Preston Vander Vos, Alberto Sonnino, Giorgos Tsimos +2
Blockchain consensus faces a trilemma of security, latency, and decentralization. High-throughput systems often require a reduction in decentralization or robustness against strong…
Beluga: Block Synchronization for BFT Consensus Protocols
Tasos Kichidis, Lefteris Kokoris-Kogias, Arun Koshy +4
Modern high-throughput BFT consensus protocols use streamlined push-pull mechanisms to disseminate blocks and keep happy-path performance optimal. Yet state-of-the-art designs lack…
Tidehunter: Large-Value Storage With Minimal Data Relocation
Andrey Chursin, Lefteris Kokoris-Kogias, Alex Orlov +2
Log-Structured Merge-Trees (LSM-trees) dominate persistent key-value storage but suffer from high write amplification from 10x to 30x under random workloads due to repeated compact…
Sedna: Sharding transactions in multiple concurrent proposer blockchains
Alejandro Ranchal-Pedrosa, Benjamin Marsh, Lefteris Kokoris-Kogias +1
Modern blockchains increasingly adopt multi-proposer (MCP) consensus to remove single-leader bottlenecks and improve censorship resistance. However, MCP alone does not resolve how…
Mysticeti: Reaching the Limits of Latency with Uncertified DAGs
Kushal Babel, Andrey Chursin, George Danezis +5
We introduce Mysticeti-C, the first DAG-based Byzantine consensus protocol to achieve the lower bounds of latency of 3 message rounds. Since Mysticeti-C is built over DAGs it also…