Transaction Ordering Fairness

Value can be extracted from deciding the order of transactions in a block. Several designs attempt to remove that, and each encounters a hard constraint.

The proposals

First come, first served. Order by arrival time.

The problem: arrival time is local. Every node observes a different order because of network latency, and there is no global clock. Any implementation requires agreeing on what arrival means, which is itself a consensus problem.

It also rewards the fastest connection, which converts the extraction into a latency race rather than removing it.

Encrypted mempools. Transactions are encrypted until after ordering is fixed, so the orderer cannot see what they contain.

Genuinely promising. The problems are that something must hold the decryption capability, which is a trust assumption, and that transactions can be ordered by metadata even when content is hidden. Threshold decryption distributes the trust and adds latency and complexity.

Batch auctions. Collect transactions over an interval and settle them at a uniform clearing price, removing the value of being first.

Effective for trading specifically. It adds latency and does not generalise to arbitrary transactions.

Fair ordering protocols. Consensus on ordering itself, using rules based on what a majority of nodes observed.

Theoretically sound, expensive in communication, and it produces guarantees that are weaker than they first appear because of how latency interacts with the definitions.

The constraint underneath

Ordering is a resource with value. Any mechanism that assigns it assigns that value to someone.

You can move who captures it: from the block producer to a builder market, from builders to a protocol, from a protocol back to users through rebates. You cannot make the value disappear, because it arises from the existence of ordering itself.

What has actually been deployed

Separation of proposing and building, which made the extraction market competitive and moved more of the value to validators rather than to whoever had the fastest infrastructure.

Private transaction routing, which lets individual users avoid public exposure. This is the most practically useful development for ordinary users.

Batch auctions in specific trading venues.

Encrypted mempool designs in testing on several networks.

The user’s position

The defences available to an individual are narrow and effective: tight slippage limits, private routing for anything substantial, and avoiding thin pools where the extractable value is largest relative to trade size.

For anyone whose activity is buying and holding rather than trading on-chain, none of this arises. Purchases matched inside a venue such as a venue that supports immediate withdrawal involve no ordering auction, and the single withdrawal that follows has no extractable value attached to its position in a block.