Multiple Concurrent Proposers: Why and How

• URL: http://arxiv.org/abs/2509.23984v1
• Date: Sun, 28 Sep 2025 17:24:18 GMT
• Title: Multiple Concurrent Proposers: Why and How
• Authors: Pranav Garimidi, Joachim Neu, Max Resnick,
• Abstract summary: Single-proposer blockchains suffer from miner extractable value (MEV)<n>We propose a multiple concurrent proposer (MCP) protocol offering exactly these properties.
• Score: 3.149171695785005
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Traditional single-proposer blockchains suffer from miner extractable value (MEV), where validators exploit their serial monopoly on transaction inclusion and ordering to extract rents from users. While there have been many developments at the application layer to reduce the impact of MEV, these approaches largely require auctions as a subcomponent. Running auctions efficiently on chain requires two key properties of the underlying consensus protocol: selective-censorship resistance and hiding. These properties guarantee that an adversary can neither selectively delay transactions nor see their contents before they are confirmed. We propose a multiple concurrent proposer (MCP) protocol offering exactly these properties.

Related papers

• Sedna: Sharding transactions in multiple concurrent proposer blockchains [42.71280924071485]
  We present Sedna, a user-facing protocol that replaces naive transaction replication with verifiable, rateless coding.<n>We prove Sedna guarantees liveness and emphuntil-decode privacy, significantly reducing MEV exposure.
  arXiv  Detail & Related papers  (2025-12-18T20:12:55Z)
• Voting-Based Semi-Parallel Proof-of-Work Protocol [45.776687601070705]
  We first consider the existing parallel PoW protocols and develop hard-coded incentive attack structures.<n>We introduce a voting-based semi-parallel PoW protocol that outperforms both Nakamoto consensus and the existing parallel PoW protocols.
  arXiv  Detail & Related papers  (2025-08-08T17:57:35Z)
• Information Bargaining: Bilateral Commitment in Bayesian Persuasion [60.3761154043329]
  We introduce a unified framework and a well-structured solution concept for long-term persuasion.<n>This perspective makes explicit the common knowledge of the game structure and grants the receiver comparable commitment capabilities.<n>The framework is validated through a two-stage validation-and-inference paradigm.
  arXiv  Detail & Related papers  (2025-06-06T08:42:34Z)
• Multiple Proposer Transaction Fee Mechanism Design: Robust Incentives Against Censorship and Bribery [0.0]
  This study explores how multiple proposers should be rewarded to incentivize censorship resistance.<n>Main contribution is the identification of TFMs that ensure censorship resistance under bribery attacks.<n>We provide a concrete payment mechanism for FOCIL, along with generalizable contributions to the literature.
  arXiv  Detail & Related papers  (2025-05-19T21:53:58Z)
• Cross-Chain Options: A Bridgeless, Universal, and Efficient Approach [3.5562096606353215]
  Despite the growing interest in options for blockchain-resident assets, such as cryptocurrencies, current option mechanisms face significant challenges.<n>Our protocol is the first to eliminate the need for holders to post collateral when establishing options in trustless service environments.<n>Its universality allows for cross-chain options involving nearly textitany assets on textitany two different blockchains.<n>Our evaluation demonstrates that the proposed scheme reduces option transfer latency to less than half of that in existing methods.
  arXiv  Detail & Related papers  (2024-10-21T07:43:20Z)
• BlockScan: Detecting Anomalies in Blockchain Transactions [16.73896087813861]
  BlockScan is a customized Transformer for anomaly detection in blockchain transactions.<n>This work sets a new benchmark for applying Transformer-based approaches in blockchain data analysis.
  arXiv  Detail & Related papers  (2024-10-05T05:11:34Z)
• The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
  We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.<n>Our measurements from the Aptos mainnet show that the optimistic approach reduces latency overhead by 71%.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• Flashback: Enhancing Proposer-Builder Design with Future-Block Auctions in Proof-of-Stake Ethereum [27.386337024680245]
  Auction mechanisms used between searchers, builders and proposers are crucial to the overall health of the blockchain. In this paper, we consider PBS design in as a game between searchers, builders and proposers. A key novelty in our design is the inclusion of future block proposers, as all proposers of an epoch are decided ahead of time in proof-of-stake (PoS) Our analysis shows the existence of alternative auction mechanisms that result in a better equilibrium to players compared to state-of-the-art.
  arXiv  Detail & Related papers  (2024-05-15T15:58:21Z)
• Towards a Theory of Maximal Extractable Value II: Uncertainty [4.07926531936425]
  Maximal Extractable Value (MEV) is value extractable by temporary monopoly power commonly found in decentralized systems. This extraction stems from a lack of user privacy upon transaction submission and the ability of a monopolist validator to reorder, add, and/or censor transactions. We show that neither fair ordering techniques nor economic mechanisms can individually mitigate MEV for arbitrary payoff functions.
  arXiv  Detail & Related papers  (2023-09-25T15:01:11Z)
• Cuttlefish: Expressive Fast Path Blockchains with FastUnlock [4.483666331132052]
  Cuttlefish addresses limitations of existing consensus-less and consensus-minimized decentralized ledgers. Key insight of Cuttlefish is that consensus is necessary due to contention, rather than multiple owners of an asset as suggested by prior work. Cuttlefish introduces collective objects and multi-owner transactions that can offer most of the functionality of classic blockchains.
  arXiv  Detail & Related papers  (2023-09-22T08:56:32Z)
• Blockchain Large Language Models [65.7726590159576]
  This paper presents a dynamic, real-time approach to detecting anomalous blockchain transactions. The proposed tool, BlockGPT, generates tracing representations of blockchain activity and trains from scratch a large language model to act as a real-time Intrusion Detection System.
  arXiv  Detail & Related papers  (2023-04-25T11:56:18Z)
• Uniswap Liquidity Provision: An Online Learning Approach [49.145538162253594]
  Decentralized Exchanges (DEXs) are new types of marketplaces leveraging technology. One such DEX, Uniswap v3, allows liquidity providers to allocate funds more efficiently by specifying an active price interval for their funds. This introduces the problem of finding an optimal strategy for choosing price intervals. We formalize this problem as an online learning problem with non-stochastic rewards.
  arXiv  Detail & Related papers  (2023-02-01T17:21:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.