|
Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus won a Best Paper Award at EURO/SYS’22!
The authors propose separating the task of reliable transaction dissemination from transaction ordering. They design and evaluate a mempool protocol, Narwhal, specializing in high-throughput reliable dissemination and storage of causal histories of transactions.
George Danezis (Mysten Labs & UCL), Eleftherios Kokoris Kogias (IST Austria), Alberto Sonnino (Mysten Labs), Alexander Spiegelman (Aptos)
Five papers by IC3 authors were presented at FC’22!
Sliding Window Challenge Process for Congestion Detection
The authors suggest ways to auto-extend deadlines in smart contracts during times of network congestion.
Ayelet Lotem (The Hebrew University of Jerusalem), Sarah Azouvi (Protocol Labs), Patrick McCorry (Infura), Aviv Zohar (The Hebrew University of Jerusalem)
SnarkPack: Practical SNARK Aggregation
The authors present SnarkPack, a new argument that further reduces the size of SNARK proofs by means of aggregation. It is designed to work with Groth16 scheme and has logarithmic size proofs and a verifier that runs in logarithmic time in the number of proofs to be aggregated and reuses the public parameters from Groth16 system.
Anca Nitulescu (Protocol Labs), Nicolas Gailly (Protocol Labs), Mary Maller (Ethereum Foundation)
Be Aware of Your Leaders
The authors introduce Carousel, a novel, reputation-based Leader-rotation solution to achieve Leader-Aware SMR. Among other properties, it formalizes a Leader-utilization requirement that bounds the number of rounds whose leaders are faulty in crash-only executions.
Shir Cohen (Technion & Novi Research), Rati Gelashvili (Novi Research), Eleftherios Kokoris Kogias (IST Austria & Novi Research), Zekun Li (Facebook/Novi), Dahlia Malkhi (Novi Research), Alberto Sonnino (Novi Research), Alexander Spiegelman (Novi Research)
Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback
The authors present Ditto, a Byzantine SMR protocol that enjoys the best of both worlds: optimal communication on and off the happy path (linear and quadratic, respectively) and progress guarantee under asynchrony and DDoS attacks. They also design a 2-chain version of HotStuff, Jolteon, which leverages a quadratic view-change mechanism to reduce the latency of the standard 3-chain HotStuff
Rati Gelashvili (Novi Research), Elefteris Kokoris-Kogias (Novi Research & IST Austria), Alberto Sonnino (Novi Research), Alexander Spiegelman (Novi Research), Zhuolun Xiang (UIUC)
Decentralization Conscious Players And System Reliability
The authors propose a game-theoretic model of the reliability of decentralized systems based on Varian’s model of system reliability to which they add a new normalized total effort case that models decentralization conscious players who prioritize decentralization.
Sarah Azouvi (Protocol Labs), Alexander Hicks (University College London)
| 
