Commission
Research
All research areas →

Agent Evaluation and Coordination

Generated-Code and GPU-Kernel Correctness

Federated Learning and Privacy

Decentralised Systems and Protocol

Methods
Papers
Collaborate
About Contact Bring a technical claim

Research topic · Composability and MEV

Test fairness and atomicity claims where they are most likely to fail

Claims that a protocol orders transactions fairly, limits extractable value or executes atomically across rollups depend on who controls ordering and timing. Stating those assumptions, then searching for counterexamples, shows where a claim holds and where it breaks.

The situation

How should we evaluate fairness and composability claims under explicit adversarial and execution assumptions?

What you leave with

Formalised assumptions, a systematic counterexample search and a mechanism evaluation report that says where the claim holds and where it fails.

For: Protocol research team; academic collaborator

Established background

The following is general field knowledge, stated cautiously.

Maximal extractable value (MEV) is value that whoever controls transaction ordering and inclusion can capture beyond ordinary fees — for example by trading ahead of or around a visible pending transaction. Mitigations proposed in the field fall broadly into hiding transaction contents until ordering is fixed (commit-reveal, encryption), constraining the ordering rule itself, and auctioning or redistributing the value.

Composability is the ability of one transaction to use several contracts together and either succeed entirely or fail entirely. On a single chain this is the default; across separate rollups it is not, because each orders and settles independently. Approaches to restoring it typically introduce shared sequencing or cross-domain coordination, which moves trust onto new components.

In both cases the guarantee is conditional on who controls ordering and timing — which is why the assumptions come first.

My results

  • FairFlow Protocol (preprint, 2023) proposes an MEV-mitigation mechanism for Ethereum that combines commit-reveal ordering with economic incentives, aimed at more equitable treatment of transactions.
  • Towards Universal Atomic Composability (preprint, 2023) proposes a formal model of atomic composability for multi-rollup environments on Ethereum and analyses the conditions for cross-rollup atomic execution.
  • Centralized Intermediation in a Decentralized Web3 Economy (preprint, 2023) examines how intermediaries accrue and extract value — including through information asymmetry and ordering — despite decentralised infrastructure.

All three are proposals and analyses; none has been peer reviewed, and none is offered here as evidence that a deployed system is fair or atomic.

Open questions

  • Which ordering assumptions does a commit-reveal design still depend on — for example, whether the party that sees reveals can also delay or censor them?
  • Under what sequencer failure and delay models does cross-rollup atomicity degrade, and how quickly?
  • When a mechanism reduces one form of extraction, where does the value move instead?

Illustrative example — not a client engagement. A cross-rollup swap design claims atomic settlement. The study models two rollups with independent sequencers, bounded message delay and one sequencer that may stall. The search finds an execution in which the first leg commits and the second times out after the refund window closes. The report gives the replayable trace, the timing assumption it violates, and the condition under which atomicity holds.

Useful if

  • Your protocol claims fair ordering, reduced extraction or cross-rollup atomicity and you want to know the conditions under which that fails.
  • A design depends on a sequencer, relayer or builder behaving a certain way and that assumption has not been stated precisely.
  • An academic group wants a collaborator on formal models of ordering or composability.

Not the right fit if

  • You need a smart-contract security audit or a bug bounty. A mechanism study examines the design, not every line of code.
  • You need the mechanism implemented or run in production.
  • The aim is a report that can only endorse the design.

What this produces

  • Formalised assumptions. Who controls ordering and inclusion, message delays and failure modes, what each party observes, and which parties may collude.
  • Property statements. Fairness, extraction or atomicity written as precise properties that a trace of the system either satisfies or violates.
  • Counterexample search. Systematic exploration — model checking, property-based testing on a simulator, or adversarial strategy search — for executions that violate the properties.
  • Mechanism evaluation report. Properties that held within the model, counterexamples found with replayable traces, and the assumptions each conclusion depends on.

What you need before starting

  • Protocol specification. The ordering, commitment, settlement or cross-rollup messaging rules as designed, not only as marketed.
  • The claim. The specific fairness, MEV or composability property the protocol is said to provide.
  • Trust boundaries. Which components you assume honest, and why.

Protocol

  1. 1
    Formalise. Write the execution model and adversary capabilities, and agree them before analysis.
  2. 2
    State properties. Turn each claim into a property that can be checked against an execution trace.
  3. 3
    Search for counterexamples. Explore orderings, delays, failures and adversarial strategies, starting with the cheapest attacks.
  4. 4
    Evaluate the mechanism. Where properties hold in the model, measure cost under adversarial conditions; where they fail, minimise and replay the counterexample.
  5. 5
    Report. Separate what was checked, what was assumed, and what the model omits.

Limits and unfavourable results

  • A model-based search finds counterexamples within the model. Finding none does not prove the deployed protocol is safe.
  • Extraction strategies evolve. An evaluation covers the strategies modelled at the time.
  • My three papers in this area are 2023 preprints without a listed code artefact; a new study would build and publish its own model.

A study may find that the claimed property fails under realistic assumptions. Counterexamples are reported in full, and a commissioned study's fee does not depend on the outcome.

Evidence behind this page

Questions

What is FairFlow Protocol?

A December 2023 preprint (arXiv 2312.12654) proposing a mechanism for mitigating maximal extractable value on Ethereum through a transparent transaction-ordering approach that combines commit-reveal with economic incentives. It is not peer reviewed.

How do you evaluate a multi-rollup composability claim?

Formalise the execution model — sequencers, message delays, failure and reorg behaviour — state atomicity as a property of execution traces, then search systematically for executions where part of a cross-rollup transaction commits and part does not.

Can a study prove a protocol is MEV-resistant?

It can show that specified extraction strategies fail within a stated model, and can find counterexamples. It cannot rule out strategies or behaviours the model does not include, and the report says which those are.

What does the universal atomic composability paper contribute?

A formal model that defines atomic composability for transactions spanning multiple Ethereum rollups and analyses conditions for achieving it. It is a 2023 preprint and a starting point for evaluating specific cross-rollup designs.

See also

Technical guides

Commission a scoped study

Send the protocol specification, the fairness or composability claim and the components you assume honest. A public design document is enough to scope.

Last reviewed 2026-10-07.