跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.20838 · v1

Optimal Dynamic Fees for L2s: A Vault Approach

首次提交 2026-11-16 18:18
版本更新 2026-11-16 18:18
雷达观测 2026-11-17 17:11
arXiv ↗PDF ↗

摘要

Layer 2 (L2) blockchains incur costs when posting data to Layer 1 (L1) and charge users fees intended to recover those costs. We model this mechanism as a *vault*: user fees increase its balance, L1 posting costs reduce it, and surplus and deficit accumulate over time. Forecast-based fees aim to recover posting costs, but forecast errors accumulate in the vault. Returning the vault balance to a target requires feedback on the accumulated error. Treating the vault as a discrete-time control system, we derive in closed form the optimal trade-off between vault tracking and fee smoothness in an idealized benchmark. The optimal rule retains a fraction of the previous fee and corrects in proportion to the current vault error. This fee-memory fraction is the single parameter tracing the entire trade-off frontier. We compare proportional (P), proportional-integral (PI), and Arbitrum-style controllers against this frontier, both analytically and on historical Ethereum fee data. At the fee movement implied by Arbitrum's current parameters, the optimal rule reduces the benchmark tracking error by about one third. Fee memory improves the tracking-smoothness trade-off.

作者备注:24 pages, 3 figures, 3 tables

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-16 18:18 · 最新观测版本

Optimal Dynamic Fees for L2s: A Vault Approach

Layer 2 (L2) blockchains incur costs when posting data to Layer 1 (L1) and charge users fees intended to recover those costs. We model this mechanism as a *vault*: user fees increase its balance, L1 posting costs reduce it, and surplus and deficit accumulate over time. Forecast-based fees aim to recover posting costs, but forecast errors accumulate in the vault. Returning the vault balance to a target requires feedback on the accumulated error. Treating the vault as a discrete-time control system, we derive in closed form the optimal trade-off between vault tracking and fee smoothness in an idealized benchmark. The optimal rule retains a fraction of the previous fee and corrects in proportion to the current vault error. This fee-memory fraction is the single parameter tracing the entire trade-off frontier. We compare proportional (P), proportional-integral (PI), and Arbitrum-style controllers against this frontier, both analytically and on historical Ethereum fee data. At the fee movement implied by Arbitrum's current parameters, the optimal rule reduces the benchmark tracking error by about one third. Fee memory improves the tracking-smoothness trade-off.

查看此版本解读 →查看此版本原文 ↗