Remora: Scale-out Deterministic Execution for Smart Contracts
For blockchain systems with compute-intensive smart contracts, Remora provides a scalable solution to match modern consensus performance, addressing a critical bottleneck in modular architectures.
Remora addresses the bottleneck in blockchain execution by proposing a scale-out deterministic execution engine for smart contracts, achieving up to 3x throughput improvement over state-of-the-art schemes, scaling to 250k TPS, and reducing latency by up to 5ms.
Modern blockchains rely on a modular architecture that decouples consensus from execution. Recent advances in consensus algorithms have shifted the bottleneck to the execution layer, which must deterministically follow the consensus order and handle increasingly complex, compute-intensive smart contracts. We identify that single-node validators cannot keep up, motivating the need for a scale-out design. We design Remora, a scale-out smart contract execution engine. Remora adopts an efficient asymmetric architecture with centralized transaction dispatching and distributed execution, and depends on an object versioning scheme with a strict ownership model to guarantee deterministic scale-out execution. Remora achieves up to 3x throughput improvement compared to state-of-the-art deterministic execution schemes, scales up to 250k TPS, matching modern consensus performance, and reduces latency by up to 5ms. We also show that Remora elastically adapts to bursty workloads and dynamic access patterns using real-world traces. Remora's main performance benefits come from a novel stateless-stateful separation during smart contract execution, which overlaps the execution of state-independent tasks with consensus, and a new locality-aware and load-balanced scheduling scheme.