3 papers
cs.DB2026
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…
cs.DC2025
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…
cs.DC2024
Mahi-Mahi: Low-Latency Asynchronous BFT DAG-Based Consensus
Philipp Jovanovic, Lefteris Kokoris Kogias, Bryan Kumara +3
We present Mahi-Mahi, the first asynchronous BFT consensus protocol that achieves sub-second latency in the WAN while processing over 100,000 transactions per second. We accomplish…