Optimal Publishing Strategies on a Base Layer
Preprint
Abstract
A growing number of products use layer 2 solutions to expand the capabilities of primary blockchains like Ethereum, where computation is off-loaded from the root chain, and the results are published to it in bulk. Those include optimistic and zero-knowledge rollups, information oracles, and app-specific chains. This work presents an analysis of layer 2 blockchain strategies determining the optimal times for publishing transactions on the root chain. There is a trade-off between waiting for a better layer 1 gas price and the urgency to finalize layer 2 transactions. We present a model for the problem that captures this trade-off, generalizing previous works, and we analyze the properties of optimal publishing strategies. We show that such optimal strategies hold a computable simple form for a large class of cost functions.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Efficient Rollup Batch Posting Strategy on Base Layer2023
- Blockchain Scaling Using Rollups: A Comprehensive SurveyIEEE Access, 2022
- Distributionally Robust Inventory Control When Demand Is a MartingaleMathematics of Operations Research, 2022
- A Survey of Recent Progress in the Asymptotic Analysis of Inventory SystemsProduction and Operations Management, 2020
- An inventory planning problem for time-varying linear demand and parabolic holding cost with salvage valueCroatian Operational Research Review, 2019
- Inventory Control with Generalized ExpeditingOperations Research, 2010
- OPTIMALITY OF FOUR-THRESHOLD POLICIES IN INVENTORY SYSTEMS WITH CUSTOMER RETURNS AND BORROWING/STORAGE OPTIONSProbability in the Engineering and Informational Sciences, 2005
- Investment under alternative return assumptions Comparing random walks and mean reversionJournal of Economic Dynamics and Control, 1995
- Competitive randomized algorithms for nonuniform problemsAlgorithmica, 1994
- The Optimal Inventory Policy for Batch OrderingOperations Research, 1965