DeltaBox: Scaling Stateful AI Agents with Millisecond-Level Sandbox Checkpoint/Rollback
Yunpeng Dong, Jingkai He, Yuze Hou, Dong Du, Zhonghu Xu, Si Yu, Yubin Xia, Haibo Chen

TL;DR
DeltaBox introduces OS-level change-based checkpoint and rollback mechanisms, enabling AI agents to perform rapid state exploration with millisecond latency, significantly improving scalability and efficiency.
Contribution
The paper proposes DeltaState, DeltaFS, and DeltaCR, new OS abstractions and mechanisms for change-based checkpoint/rollback tailored for AI agents.
Findings
DeltaBox achieves checkpoint/rollback in 14ms and 5ms latency.
Enables AI agents to explore more nodes within fixed time budgets.
Significantly reduces C/R latency compared to existing methods.
Abstract
LLM-powered AI agents require high-frequency state exploration (e.g., test-time tree search and reinforcement learning), relying on rapid checkpoint and rollback (C/R) of the complete sandbox state, including files and process state (e.g., memory, contexts, etc.). Existing mechanisms duplicate the entire state, causing hundreds of milliseconds to seconds of latency per C/R, which severely bottlenecks deep search and large-scale fan-outs. This paper observes that subsequent checkpoints in AI agents are highly similar. Therefore, instead of full duplication, a sandbox should only duplicate the changes between consecutive checkpoints (Key Insight). However, it is non-trivial to realize the idea, mainly due to the missing OS supports. This paper proposes a new OS-level abstraction, DeltaState, to enable the change-based transactional C/R for AI agents with two co-designed OS mechanisms.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
