IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2607.11240.html

From PBS to ePBS: the Microstructure of Block Building

Author

Listed:
  • Jingyu Liu
  • Bolin Zhang
  • Lin William Cong
  • Siguang Li
  • Xuechao Wang

Abstract

Ethereum's Glamsterdam upgrade introduces enshrined proposer-builder separation (ePBS), replacing relay-centric PBS with direct builder bids to proposers. We study how this shift changes the block-building microstructure through a general imperfect-information two-stage auction with verifiable messages, where an early bid serves as both a price offer and a signal. PBS and ePBS are modeled as restrictions of the same block-building game: PBS fixes stopping and disclosure exogenously, while ePBS lets the proposer choose stopping and disclosure ex post. Latency heterogeneity is captured by asymmetric information updates: fast builders observe disclosed early information before rebidding, while slow builders do not. We combine exact perfect Bayesian equilibrium characterizations in tractable cases with calibrated no-regret learning in finite games. For PBS, we show that separating equilibria preserve the standard first-price-auction payoff benchmark and provide conditions for their existence. For ePBS, we demonstrate a ratchet effect: because the proposer can defer block proposal and use early bid information in the second stage, builders anticipate ex-post extraction and shade or pool early bids, generating allocation inefficiency and revenue-efficiency valleys. We interpret this ratchet distortion as a commitment failure. Under full commitment, the optimal policy collapses to the static Myerson auction and removes the ratchet channel. To realize part of this commitment advantage in a feasible mechanism, we propose a Trusted Execution Environment (TEE) sidecar that enforces limited commitment. We formulate the revenue-maximizing TEE mechanism as a bilinear optimization problem. In conservative finite benchmarks, the TEE design increases the proposer revenue relative to the first-price benchmark by approximately \(25\%\).

Suggested Citation

  • Jingyu Liu & Bolin Zhang & Lin William Cong & Siguang Li & Xuechao Wang, 2026. "From PBS to ePBS: the Microstructure of Block Building," Papers 2607.11240, arXiv.org.
  • Handle: RePEc:arx:papers:2607.11240
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2607.11240
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Tivas Gupta & Mallesh M Pai & Max Resnick, 2023. "The Centralizing Effects of Private Order Flow on Proposer-Builder Separation," Papers 2305.19150, arXiv.org, revised Oct 2023.
    2. Dirk Bergemann & Stephen Morris, 2016. "Information Design, Bayesian Persuasion, and Bayes Correlated Equilibrium," American Economic Review, American Economic Association, vol. 106(5), pages 586-591, May.
    3. Skreta, Vasiliki, 2015. "Optimal auction design under non-commitment," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 854-890.
    4. Mallesh Pai & Max Resnick, 2023. "Structural Advantages for Integrated Builders in MEV-Boost," Papers 2311.09083, arXiv.org.
    5. Elliot Lipnowski & Doron Ravid & Denis Shishkin, 2022. "Persuasion via Weak Institutions," Journal of Political Economy, University of Chicago Press, vol. 130(10), pages 2705-2730.
    6. Laura Doval & Vasiliki Skreta, 2022. "Mechanism Design With Limited Commitment," Econometrica, Econometric Society, vol. 90(4), pages 1463-1500, July.
    7. Qingmin Liu & Konrad Mierendorff & Xianwen Shi & Weijie Zhong, 2019. "Auctions with Limited Commitment," American Economic Review, American Economic Association, vol. 109(3), pages 876-910, March.
    8. Gerardi, Dino & Maestri, Lucas, 2020. "Dynamic contracting with limited commitment and the ratchet effect," Theoretical Economics, Econometric Society, vol. 15(2), May.
    9. Bergemann, Dirk & Morris, Stephen, 2016. "Bayes correlated equilibrium and the comparison of information structures in games," Theoretical Economics, Econometric Society, vol. 11(2), May.
    10. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    11. Dirk Bergemann & Benjamin Brooks & Stephen Morris, 2017. "First‐Price Auctions With General Information Structures: Implications for Bidding and Revenue," Econometrica, Econometric Society, vol. 85, pages 107-143, January.
    12. Mohammad Akbarpour & Shengwu Li, 2020. "Credible Auctions: A Trilemma," Econometrica, Econometric Society, vol. 88(2), pages 425-467, March.
    13. Vasiliki Skreta, 2006. "Sequentially Optimal Mechanisms -super-1," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 73(4), pages 1085-1111.
    14. James Best & Daniel Quigley, 2024. "Persuasion for the Long Run," Journal of Political Economy, University of Chicago Press, vol. 132(5), pages 1740-1791.
    15. Fei Wu & Danning Sui & Thomas Thiery & Mallesh Pai, 2025. "Measuring CEX-DEX Extracted Value and Searcher Profitability: The Darkest of the MEV Dark Forest," Papers 2507.13023, arXiv.org, revised Aug 2025.
    16. Maryam Bahrani & Pranav Garimidi & Tim Roughgarden, 2024. "Centralization in Block Building and Proposer-Builder Separation," Papers 2401.12120, arXiv.org.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Breig, Zachary, 2022. "Repeated contracting without commitment," Journal of Economic Theory, Elsevier, vol. 204(C).
    2. Emir Kamenica & Xiao Lin, 2024. "Commitment and Randomization in Communication," PIER Working Paper Archive 24-033, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
    3. Patrick Hummel, 2018. "Reserve prices in repeated auctions," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(1), pages 273-299, March.
    4. Doval, Laura & Skreta, Vasiliki, 2024. "Optimal mechanism for the sale of a durable good," Theoretical Economics, Econometric Society, vol. 19(2), May.
    5. Xu, Xiaoshu, 2025. "Optimal auctions with sequential arrival: Allowing for re-auction and resale," International Journal of Industrial Organization, Elsevier, vol. 100(C).
    6. Liu, Qingmin & Mierendorff, Konrad & Shi, Xianwen, 2025. "Coasian equilibria in sequential auctions," European Economic Review, Elsevier, vol. 173(C).
    7. Santiago R. Balseiro & Omar Besbes & Gabriel Y. Weintraub, 2019. "Dynamic Mechanism Design with Budget-Constrained Buyers Under Limited Commitment," Operations Research, INFORMS, vol. 67(3), pages 711-730, May.
    8. Beccuti, Juan & Möller, Marc, 2021. "Screening by mode of trade," Games and Economic Behavior, Elsevier, vol. 129(C), pages 400-420.
    9. Andrew Komo & Scott Duke Kominers & Tim Roughgarden, 2024. "Shill-Proof Auctions," Papers 2404.00475, arXiv.org, revised Dec 2025.
    10. Jiadong Gu, 2024. "Data Trade and Consumer Privacy," Papers 2406.12457, arXiv.org, revised Jan 2026.
    11. Alexander Teytelboym & Shengwu Li & Scott Duke Kominers & Mohammad Akbarpour & Piotr Dworczak, 2021. "Discovering Auctions: Contributions of Paul Milgrom and Robert Wilson," Scandinavian Journal of Economics, Wiley Blackwell, vol. 123(3), pages 709-750, July.
    12. Mohammad Akbarpour & Shengwu Li, 2020. "Credible Auctions: A Trilemma," Econometrica, Econometric Society, vol. 88(2), pages 425-467, March.
    13. repec:upd:utmpwp:018 is not listed on IDEAS
    14. Lauri Lov'en & Sasu Tarkoma, 2026. "The Endogeneity of Miscalibration: Impossibility and Escape in Scored Reporting," Papers 2605.07671, arXiv.org.
    15. Robert Zeithammer, 2009. "Commitment in sequential auctioning: advance listings and threshold prices," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 38(1), pages 187-216, January.
    16. Asseyer, Andreas, 2025. "Information orders in screening problems," Journal of Economic Theory, Elsevier, vol. 225(C).
    17. Balzer, Benjamin & Rosato, Antonio & von Wangenheim, Jonas, 2022. "Dutch vs. first-price auctions with expectations-based loss-averse bidders," Journal of Economic Theory, Elsevier, vol. 205(C).
    18. Devanur, Nikhil R. & Peres, Yuval & Sivan, Balasubramanian, 2019. "Perfect Bayesian Equilibria in repeated sales," Games and Economic Behavior, Elsevier, vol. 118(C), pages 570-588.
    19. Ruofei Ma & Wenpin Tang & David Yao, 2025. "Analysis of the Order Flow Auction under Proposer-Builder Separation on Blockchain," Papers 2502.12026, arXiv.org, revised Dec 2025.
    20. Meryem Essaidi & Matheus V. X. Ferreira & S. Matthew Weinberg, 2022. "Credible, Strategyproof, Optimal, and Bounded Expected-Round Single-Item Auctions for all Distributions," Papers 2205.14758, arXiv.org.
    21. Benjamin Brooks & Songzi Du, 2021. "Optimal Auction Design With Common Values: An Informationally Robust Approach," Econometrica, Econometric Society, vol. 89(3), pages 1313-1360, May.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2607.11240. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.