跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+197新增论文
+151其中 AI 相关
+16已有论文修订
+91新增 AI 导读

arXiv 最近完成扫描:2026-11-21 12:19 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-21 06:27 — 2026-11-22 06:27(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-21 12:19最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-21 12:17(北京时间)
新论文 · v1arXiv:2611.20838

Optimal Dynamic Fees for L2s: A Vault Approach

Ulysse Pavloff, Lin Oshitani

原文摘要

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.

cs.CR