Omakase boosts blockchain transaction speed with better task sharing

Omakase: Execution Congestion Control through Conflict-Graph Integration in Multi-Proposer Blockchain

DatabasesDistributed, Parallel, and Cluster Computing

Summary

Blockchain systems face delays because running many transactions at once can cause conflicts and slow things down. The authors introduce Omakase, which spreads work across many processors by predicting conflicts before transactions are finalized and combining information from multiple blocks. This helps run more transactions in parallel without mistakes, speeding up overall performance. Tests on real Ethereum data and synthetic cases show Omakase can more than double the speed and handles busy periods more smoothly.

What this means in practice

  • For blockchain platform engineers: Increase transaction processing speed and stability in blockchain validators by integrating conflict graphs across proposed blocks.
  • For distributed database developers: Reduce transaction aborts and improve parallelism by applying integrated conflict graph scheduling and concurrency control techniques from Omakase.

Authors

Dakai Kang, Ray Neiheiser, Alberto Sonnino, Eleftherios Kokoris Kogias, Mohammad Sadoghi

Abstract

As multi-proposer protocols push consensus throughput, transaction execution has become the dominant bottleneck in blockchains. Layer-1 blockchains parallelize execution either pessimistically (Solana, Sui), requiring upfront state-access declarations and serializing contended transactions, or optimistically (Aptos, Sei, Monad), resolving dependencies at run time but suffering cascading aborts under contention. Both treat blocks in isolation, leaving inter-block parallelism unexploited and most cores idle. We introduce Omakase, a parallel execution framework that combines pre-execution, inter-block conflict-graph integration, and graph-aware Optimistic Concurrency Control (OCC). Replicas use idle cores to pre-execute only the blocks they propose, spreading prediction work across concurrent proposers. After building per-block conflict graphs and identifying their hot resources, a greedy scheduler integrates graphs across the blocks committed in a round, keeping an integration only when a lightweight balance heuristic predicts a parallelism gain. A graph-aware OCC executor then runs the integrated graph, admitting transactions in dependency order, which eliminates aborts when the predicted graph is exact and reduces re-executions when it is not. On 15,000 Ethereum mainnet blocks (~2.4M transactions) and synthetic workloads with configurable contention, Omakase reaches a 2.47x speedup over sequential execution, well above single-block OCC and graph-aware baselines. Against the strongest alternative, which runs the whole round as one optimistic window, Omakase matches mean throughput but is markedly more stable under high contention, because integration bounds how much optimistic work is in flight: this is the congestion control of our title. Integration is not free, but overlapping it with execution across rounds hides 94% of its measured cost in the validator pipeline.