Building Fair Markets: A New Censorship-Resistant Consensus

TL;DR: The Aptos global trading engine works best if the markets are maximally fast, fair, and efficient. A new paper from Aptos Labs researchers Zhuolun Xiang, Andrei Tonkikh and Alexander Spiegelman breaks new ground with Prefix Consensus, the first leaderless consensus primitive with formalized anti-censorship and fairness guarantees. Today’s centralized markets still reward proximity: those closest to the matching engine see and act on information first. Prefix Consensus enables a more globally neutral model for price discovery.

When a single intermediary controls which orders reach the book and in what sequence, it can lead to information asymmetry, front-running, selective delay, or exclusion. TradFi understands this, and decades of market-structure regulation reflect this reality.

Blockchains face the same structural risk. Most BFT/DAG protocols still assign a leader/anchor deciding what goes into a block, giving one party outsized control over everyone else’s transactions.

The research paper formalizes Prefix Consensus, a new primitive that moves Aptos consensus toward a leaderless model: all parties can propose simultaneously, and the protocol agrees on a consistent prefix of those proposals.

The immediate payoff is formalized resistance to censorship, as discussed below.

The secondary benefit is system-level fairness that simply cannot be matched. Today’s market structure rewards proximity: those closest to the data center, with the fastest routes and earliest signals, consistently see information first and act first. Prefix Consensus flips this. As every validator proposes simultaneously, an onchain trader in Tokyo who sees market-moving news can trade without waiting for that signal to reach a NASDAQ server in New Jersey. There is no need to be colocated. You can submit to a nearby validator, which includes it alongside every other order.

The Prefix Consensus could be deployed on Archon, the proxy-primary leader architecture. Here, a colocated validator cluster behaves as a single stable leader, delivering 10ms blocktime and ~30ms inclusion confirmations. By running Prefix Consensus across clusters, all proxies propose simultaneously, and we get the speed of co-location and the fairness of leaderless consensus in the same design.

Pair that with Encrypted Mempools that hide transaction intent until ordering is fixed, and we get SOTA infrastructure that rivals centralized markets in censorship resistance and pure efficiency.

How Prefix Consensus Works

In traditional BFT consensus, every honest party must agree on exactly the same output.

Prefix Consensus relaxes this. Instead of requiring identical outputs, it requires compatible ones. Each party proposes a vector of values and produces two results:

→ v_low: values that are safe to commit now
→ v_high: values that are safe to extend in future rounds

The guarantee is that any high value extends any low value, and both the low and high values extend the max common prefix of honest inputs. This is important for censorship resistance.

TL;DR: Every honest validator agrees on what has happened so far; they could differ on how far they see into the future.

The primitive is solvable in asynchronous conditions. The paper proves that 3 communication rounds are both necessary and sufficient at optimal resilience.

From this base primitive, the paper constructs a full protocol stack that is entirely leaderless.

How Censorship Resistance Works

Because every party proposes in every slot, a malicious validator can no longer exclude a transaction by simply omitting it from their block. The protocol commits the max. common prefix of all honest validator input vectors ordered according to global rankings, so an attacker can only affect proposals that fall after their own position in the ordering.

When misbehavior is detected, the offending party gets demoted in the ranking for future slots.

The effect accrues over time. Honest parties rise in priority. The paper proves that, after synchrony, every honest party proposal is committed within a bounded number of slots, regardless of any adversary actions.

The Broader Architecture

Prefix Consensus does not operate in isolation. It is one layer of a broader Aptos stack that delivers fair, high-performance financial infrastructure that rivals the best of traditional finance.

Raptr solves performance and robustness with the prefix consensus approach, but not the censorship problem. Our new protocol further leverages prefix consensus to address it and formalize it. When the network is healthy, this means high throughput with no single bottleneck. When conditions degrade, the protocol commits whatever prefix is safe and continues, rather than stalling. This paper provides a formal proof of Raptr’s design choices.

Encrypted Mempools address a complementary problem. Prefix Consensus ensures your transaction cannot be excluded, but it does not hide its contents. Without privacy at the mempool layer, a validator that can read pending transactions can still front-run or reorder in its own proposal. Encrypted mempools solve this by hiding transaction intent: the content of each transaction is encrypted until the ordering is finalized, so validators commit to an order before they know what they are committing to.

To summarize:

• Prefix Consensus provides a formal censorship resistance guarantee. No honest transaction gets permanently excluded.
• Encrypted mempools close the information asymmetry gap by ensuring validators cannot exploit knowledge of pending transactions.

The combined architecture meets the requirements of the Aptos global trading engine: speed, fairness, and structural resistance to manipulation.

Learn more about Prefix Consensus here.

Building Fair Markets: A New Censorship-Resistant Consensus was originally published in Aptos Labs on Medium, where people are continuing the conversation by highlighting and responding to this story.