Ira: Efficient Transaction Replay for Distributed Systems
Adithya Bhat, Harshal Bhadreshkumar Shah, Mohsen Minaei

TL;DR
Ira is a framework that accelerates transaction replay in distributed systems by transmitting compact hints, significantly reducing backup replay time as demonstrated in Ethereum case studies.
Contribution
The paper introduces Ira, a novel hint-based approach to improve transaction replay efficiency, with a concrete protocol Ira-L for Ethereum that achieves substantial speedups.
Findings
Ira-L reduces Ethereum backup replay time from 6.5 hours to 16 minutes.
Hints add about 5% of block payload and impose a 10.9% execution overhead.
Median per-block speedup of 25x over baseline Ethereum client reth.
Abstract
In primary-backup replication, consensus latency is bounded by the time for backup nodes to replay (re-execute) transactions proposed by the primary. In this work, we present Ira, a framework to accelerate backup replay by transmitting compact \emph{hints} alongside transaction batches. Our key insight is that the primary, having already executed transactions, possesses knowledge of future access patterns which is exactly the information needed for optimal replay. We use Ethereum for our case study and present a concrete protocol, Ira-L, within our framework to improve cache management of Ethereum block execution. The primaries implementing Ira-L provide hints that consist of the working set of keys used in an Ethereum block and one byte of metadata per key indicating the table to read from, and backups use these hints for efficient block replay. We evaluated Ira-L against the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
