Paper 2026/2684
SoK: Multiple Concurrent Proposer Blockchains
Abstract
Multiple concurrent proposer (MCP) protocols let several parties contribute transactions to the same ledger update. They can distribute communication and reduce one proposer's control over inclusion and order, but these benefits depend on how the contributions are combined. We describe a common architecture from transaction receipt through proposal formation, agreement, data recovery, ordering, execution, and state finality. Within it, we identify four direct MCP families: fixed proposal vectors, selected proposal collections, persistent proposal streams, and causal proposal DAGs. We compare them with constrained assembly, where several parties restrict a block assembled by one party. Across 39 configurations, we distinguish agreement and progress from service for a particular transaction, and compare hiding, ordering, communication, throughput, and latency at explicitly named endpoints. The comparison shows why additional proposers alone do not guarantee inclusion, why hiding does not settle who can react last, and why parallel disseminations need not improve useful execution. It also identifies the recovery, payment, and organizational assumptions needed to turn independent proposal rights into reliable transaction service.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- multiple concurrent proposersblockchaincensorship resistanceMEV
- Contact author(s)
-
ben @ seinetwork io
alejandro @ seinetwork io
resnick max @ gmail com - History
- 2026-10-31: approved
- 2026-10-29: received
- See all versions
- Short URL
- https://ia.cr/2026/2684
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2026/2684,
author = {Benjamin Marsh and Alejandro Ranchal-Pedrosa and Max Resnick},
title = {{SoK}: Multiple Concurrent Proposer Blockchains},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/2684},
year = {2026},
url = {https://eprint.iacr.org/2026/2684}
}
