8 papers
Finding Nemo-Nemo: CFT DAG-based Consensus in the WAN
Rithwik Kerur, Pasindu Tennage, Philipp Jovanovic +3
This paper introduces Nemo-Nemo, a practical crash-fault tolerant (CFT) consensus protocol designed to outperform existing protocols in wide-area networks by bridging design princi…
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…
Lifefin: Escaping Mempool Explosions in DAG-based BFT
Jianting Zhang, Sen Yang, Alberto Sonnino +2
Directed Acyclic Graph (DAG)-based Byzantine Fault-Tolerant (BFT) protocols have emerged as promising solutions for high-throughput blockchains. By decoupling data dissemination fr…
Byzantine Consensus in the Random Asynchronous Model
George Danezis, Jovan Komatovic, Lefteris Kokoris-Kogias +2
We propose a novel relaxation of the classic asynchronous network model, called the random asynchronous model, which removes adversarial message scheduling while preserving unbound…
Stingray: Fast Concurrent Transactions Without Consensus
Srivatsan Sridhar, Alberto Sonnino, Lefteris Kokoris-Kogias
Recent advances have improved the throughput and latency of blockchains by processing transactions accessing different parts of the state concurrently. However, these systems are u…