# Isotaxis Targets MEV With Asynchronous Transaction Ordering

Published 2026-10-30 · Crypto.world Team · Crypto.world

> A paper in the Cryptology ePrint Archive presents Isotaxis, a state-machine replication protocol designed to preserve transaction ordering fairness in asynchronous networks. Its authors report tests against Pompē across systems of 4 to 100 nodes, but do not measure reductions in live MEV.

## Isotaxis puts ordering fairness into asynchronous consensus

A paper received and approved by the [Cryptology ePrint Archive](https://eprint.iacr.org/2026/2645) on October 26 proposes Isotaxis, a state-machine replication protocol that aims to limit transaction-order manipulation while operating in an asynchronous network. The work, titled “Isotaxis: Optimal Asynchronous Byzantine Consensus with Ordering Linearizability,” lists authors Vincent Gramoli, Zhenliang Lu, Qiang Tang, Pouriya Zarbafian and Xinrui Zhang. The archive identifies the paper as slated for the Network and Distributed System Security Symposium 2027.

Transaction ordering can create opportunities for maximal extractable value, or MEV, when an adversary influences which transactions execute first. The authors frame Isotaxis as a way to address that problem through ordering linearizability, a guarantee intended to preserve a fairer ordering of transactions even when the network is asynchronous. Unlike synchronous systems, asynchronous protocols cannot assume messages arrive within a known time limit.

> “To the best of our knowledge, Isotaxis is the first protocol to achieve ordering linearizability in the asynchronous setting, especially one with optimal communication complexity and optimal Byzantine resilience.”
>
> The authors of “Isotaxis: Optimal Asynchronous Byzantine Consensus with Ordering Linearizability” write:

## Why the authors focus on network delays

The paper describes limits in earlier approaches to fair ordering. Protocols including Aequitas, Themis and SpeedyFair use dependency graphs, but the authors say such designs can involve suboptimal performance, limited resilience or weaker security guarantees. Pompē introduced ordering linearizability, but its guarantee depends on favorable network conditions, according to the paper. Network delays can undermine its fairness, while Byzantine faults can degrade performance.

Isotaxis is designed to combine ordering linearizability with asynchronous state-machine replication without sacrificing liveness, the property that the system continues to make progress. The authors describe that combination as an open problem for asynchronous settings. Their claim is about the protocol’s design and guarantees; the paper does not present Isotaxis as a deployed production network.

## Communication cost scales with transactions and nodes

The paper gives Isotaxis communication complexity as O(nℓ + λn²), where n is the number of processes, ℓ is the input or transaction size, and λ is the security parameter. The authors call this optimal when ℓ is at least λn, and contrast it with previous approaches that they characterize as having cubic communication complexity. The paper also describes the protocol as having optimal Byzantine resilience, but its abstract does not specify a fault threshold.

To test the protocol, the researchers implemented it using as many as 100 Amazon EC2 c6a.2xlarge instances. Their experiments cover system sizes from 4 to 100 nodes and compare Isotaxis with Pompē. The authors report that Isotaxis outperforms Pompē across those tested scales, but the abstract does not provide throughput, latency or percentage-improvement figures.

## A research result, not a measured MEV reduction

The experiments provide a performance comparison between consensus protocols; they do not quantify how much MEV Isotaxis prevents in live trading or measure its effects on users, validators or transaction fees. The paper’s contribution is a protocol design that seeks to preserve transaction-order guarantees despite asynchronous communication and Byzantine behavior, alongside an implementation evaluated in a controlled cloud setup.

For blockchain developers, the distinction matters: ordering fairness is a consensus property, while realized MEV depends on how transactions are submitted, observed and executed in a particular system. Isotaxis addresses the ordering layer identified by its authors. Its reported tests span 4 to 100 nodes, with the paper’s stated optimal communication bound applying when transaction input size reaches at least λn.

## Sources

1. Original source · Preprint [Cryptology ePrint Archive](https://eprint.iacr.org/2026/2645) eprint.iacr.org

## Related stories

- [Ethereum Draft Targets a Fourfold Cut in Finality Time](https://crypto.world/news/ethereum-eip-8453-decoupled-consensus-finality)
- [Lido proposes trustless and trusted MEV tracks](https://crypto.world/news/lido-updated-mev-policy-ethereum-epbs)
- [Solana Sets Alpenglow Mainnet Switch for Oct. 21](https://crypto.world/news/solana-alpenglow-mainnet-switch-october-21)
- [Researchers map trade-offs across Tendermint consensus designs](https://crypto.world/news/researchers-map-tendermint-consensus-design-tradeoffs)
- [Researchers propose DEX approvals before consensus](https://crypto.world/news/researchers-propose-dex-approvals-before-consensus)

## Explore

[More articles](https://crypto.world/news)

---

Canonical: https://crypto.world/news/isotaxis-mev-resistant-asynchronous-consensus
