On most blockchains, pending transactions sit in a public queue where paying a higher fee can move a submission to the front. Bots routinely exploit that gap through a practice known as maxim
On most blockchains, pending transactions sit in a public queue where paying a higher fee can move a submission to the front. Bots routinely exploit that gap through a practice known as maximal extractable value, or MEV. @hedera's design aims to close that opening at the base layer.
Every transaction on the $HBAR network receives a consensus timestamp derived from when nodes first observed it. This is achieved by calculating the median timestamp of an event, specifically the median of the times at which each node says it first received that event. Transactions then execute in that timestamp order, a property Hedera calls fair ordering.
Hedera is a leaderless network, meaning no single node can unilaterally decide the order of transactions, and all nodes are able to receive transaction submissions.Transactions on Hedera are not held in a memory pool by consensus nodes, making it impossible for a malicious node to exploit transaction ordering.Hedera also does not have variable transaction fees. They are fixed, based in USD, and paid in $HBAR, removing the fee-bidding dynamic that powers most MEV strategies on other networks.
There is no leader or miner given special permission for determining the consensus timestamp assigned to a transaction. Instead, consensus timestamps are calculated via a voting process in which nodes collectively and democratically establish the consensus.
Hedera's fair ordering claim comes with conditions. The network's own documentation notes the guarantee holds only when more than two-thirds of nodes are honest with reliable clocks. Even if all malicious nodes report unreasonable times that are millions of years in the past or future, the final timestamp will still be reasonable, because the median is bounded by the honest majority.
However, academic research points to a narrower edge case. If order is calculated by sorting by timestamps, fair timestamps yield an order that is intuitively fair, but the order can only change when two true timestamps are close enough that malicious votes can swap them using only their fair amount of weight. A 2021 thesis from the University of Bern examining fair transaction order in Hedera Hashgraph also showed an example of how a malicious node could change the order in a protocol like Hedera Hashgraph. In short, a node landing its claimed time precisely at the median could, in theory, flip the sequence of two adjacent transactions, making it difficult to rule out entirely, even if hard to execute in practice.
Hedera's notion of fairness reduces certain forms of ordering manipulation but does not eliminate all MEV or adversarial ordering strategies, because protocol rules, timing, and attacker capabilities still matter. The design removes a lever that bad actors rely on elsewhere. Whether that is enough depends on the use case and the honesty assumptions a given application is willing to accept.
SourcesHedera: Does Maximal Extractable Value (MEV) Exist on Hedera?Hedera Technical Insights: Fair Timestamping and Fair Ordering of TransactionsUniversity of Bern: Fair Transaction Order in Hedera Hashgraph
