Banner

Isotaxis: Optimal Asynchronous Byzantine Consensus with Ordering Linearizability

In this paper, we present Isotaxis, an optimal asynchronous Byzantine consensus protocol with ordering linearizability that mitigates MEV attacks.

Authored by:
 Vincent Gramoli, University of Sydney
 Zhenliang Lu, City University of Hong Kong
 Qiang Tang, University of Sydney
 Pouriya Zarbafian, University of Sydney
 Xinrui Zhang, University of Sydney

Despite ensuring both consistency and liveness, state machine replication (SMR) protocols remain vulnerable to adversaries that manipulate transaction order, causing, e.g., MEV attacks. However, existing protocols that employ dependency graphs, such as Aequitas (Crypto 2020), Themis (CCS 2023), and SpeedyFair (NDSS 2024), often suffer from suboptimal performance, limited resilience, or weakened security guarantees.

Download Paper

This paper was written by our CTO and Founder Professor Vincent Gramoli.

In this paper, we present Isotaxis, an optimal asynchronous Byzantine consensus protocol with ordering linearizability. Isotaxis constrains transaction ordering so that the final ledger order reflects the order observed by correct participants, reducing opportunities for front-running and related MEV extraction, while retaining optimal communication complexity and Byzantine resilience.