Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2605.23677 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914592403226624 |
|---|---|
| author | Cason, Daniel Liao, Gordon Mena, Sergio Milošević, Nenad Seredinschi, Adi Sforzin, Alessandro Sousa, João Vos, Preston Vander |
| author_facet | Cason, Daniel Liao, Gordon Mena, Sergio Milošević, Nenad Seredinschi, Adi Sforzin, Alessandro Sousa, João Vos, Preston Vander |
| contents | Blockchain systems that settle financial transactions face a structural tension: the single validator that assembles each block holds unilateral power over transaction inclusion and ordering. Traditional markets curb this very power through front-running and market-manipulation laws. Regulators have flagged the absence of such rules as a first-order concern for blockchain-based financial infrastructure. In response, we introduce AMP, a multi-proposer protocol, on top of the Tendermint consensus algorithm, where no validator can control the flow of transactions into blocks. Instead, dedicated nodes called proposers sit between users and validators. They collect user transactions, group them into payloads, and broadcast the payloads to all validators. Consequently, there is no mempool, and AMP applies the design principle of separating dissemination from agreement, which can lead to higher throughput. Validators publicly attest to receiving payloads and run consensus to decide the set of payloads to include in the next block. When all correct validators attest to a given payload, AMP guarantees that payload will be included in the next block; a block thus contains payloads from multiple proposers, allowing for bulk finalization. This bounded inclusion guarantee along with a deterministic ordering algorithm which is run over all payloads included in a block, curbs the power of any single validator. Validators no longer control what is included in a block, nor can they arbitrarily order the contents of blocks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_23677 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | AMP: Arc Multi-Proposer Protocol with Bounded Inclusion Guarantees Cason, Daniel Liao, Gordon Mena, Sergio Milošević, Nenad Seredinschi, Adi Sforzin, Alessandro Sousa, João Vos, Preston Vander Distributed, Parallel, and Cluster Computing Blockchain systems that settle financial transactions face a structural tension: the single validator that assembles each block holds unilateral power over transaction inclusion and ordering. Traditional markets curb this very power through front-running and market-manipulation laws. Regulators have flagged the absence of such rules as a first-order concern for blockchain-based financial infrastructure. In response, we introduce AMP, a multi-proposer protocol, on top of the Tendermint consensus algorithm, where no validator can control the flow of transactions into blocks. Instead, dedicated nodes called proposers sit between users and validators. They collect user transactions, group them into payloads, and broadcast the payloads to all validators. Consequently, there is no mempool, and AMP applies the design principle of separating dissemination from agreement, which can lead to higher throughput. Validators publicly attest to receiving payloads and run consensus to decide the set of payloads to include in the next block. When all correct validators attest to a given payload, AMP guarantees that payload will be included in the next block; a block thus contains payloads from multiple proposers, allowing for bulk finalization. This bounded inclusion guarantee along with a deterministic ordering algorithm which is run over all payloads included in a block, curbs the power of any single validator. Validators no longer control what is included in a block, nor can they arbitrarily order the contents of blocks. |
| title | AMP: Arc Multi-Proposer Protocol with Bounded Inclusion Guarantees |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2605.23677 |