6 papers · 1 filter
Guppy: Efficient Light Clients via Recursive Zero-Knowledge Proofs
George Danezis, Deepak Maram, Arnab Roy +3
Traditional light clients rely on validators committing to the entire blockchain state at every block via a state commitment such as a Merkle tree, allowing clients to verify facts…
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…
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…
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…
Obelia: Scaling DAG-Based Blockchains to Hundreds of Validators
George Danezis, Lefteris Kokoris-Kogias, Alberto Sonnino +1
Obelia improves upon structured DAG-based consensus protocols used in proof-of-stake systems, allowing them to effectively scale to accommodate hundreds of validators. Obelia imple…