Metraipolis › archive › dc_350ca17ffdb2

Competition, Collusion, and Corruption: The Spectrum of MEV Attacks on DAG-Based BFT Consensus Protocols — arXiv:2609.20069

Source: arXiv (en)
Original: https://arxiv.org/abs/2609.20069
License (as archived): CC0-1.0
Archived: 2026-10-10T03:51:01.206Z
SHA-256 of the archived text: 5e3d18615450982f57b03306feaba27a02b54c532e44f1c3b59dea8349abb480
Stable URL of this page: https://metraipolis.com/documento/dc_350ca17ffdb2

How to cite

Competition, Collusion, and Corruption: The Spectrum of MEV Attacks on DAG-Based BFT Consensus Protocols — arXiv:2609.20069 — arXiv (en), https://arxiv.org/abs/2609.20069 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_350ca17ffdb2 (Metraipolis archive dc_350ca17ffdb2, sha256 5e3d18615450982f57b03306feaba27a02b54c532e44f1c3b59dea8349abb480)

BibTeX

@misc{dc350ca17ffdb2,
  title = {Competition, Collusion, and Corruption: The Spectrum of MEV Attacks on DAG-Based BFT Consensus Protocols — arXiv:2609.20069},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.20069},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_350ca17ffdb2; sha256 5e3d18615450982f57b03306feaba27a02b54c532e44f1c3b59dea8349abb480},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.20069. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Byzantine Fault-Tolerant (BFT) protocols guarantee safety and liveness despite the malicious failure of nodes. However, they do not prevent adversarial manipulation of transaction order, where the order a proposer assigns diverges from the order in which clients submitted their transactions. Exploiting this discretion for profit is known as maximal extractable value (MEV), and it is intensified in DAG-based BFT protocols, where every replica proposes blocks concurrently rather than routing transactions through a single designated proposer each round. The proliferation of MEV attacks on DAG-based BFT protocols has made the resulting landscape difficult to navigate: attacks are reported individually, on different protocols, and under different metrics, making it unclear whether two attacks differ fundamentally or merely in how they are described. This paper closes that gap by presenting an attack space for MEV on DAG-based BFT protocols, organized around four families: the adversary, the protocol, the target, and the deployment. For each family, we identify the dimensions that shape an attack's impact. Each point in the attack space fixes one value per dimension, thereby representing a distinct, potential MEV attack, which can then be instantiated on a specific DAG-based BFT protocol. We perform a set of experiments, each isolating a single dimension where the protocol permits it, to empirically measure its effect on the success rate of MEV attacks against six production DAG-based BFT protocols. Our experimental evaluation reveals that every protocol we evaluate is vulnerable to at least a subset of the MEV attacks in this space, and that which attacks succeed is mostly dictated by the protocol's own design rather than by attacker effort.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-18 in cs.DC).
Categorie arXiv: Cryptography and Security (cs.CR) ; Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2609.20069 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T03:24:19.943Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).