Mnemosyne: Agentic Transaction Processing for Validating and Repairing AI-generated Workflows
Quick Answer
Mnemosyne introduces Agentic Transaction Processing (ATP) to validate AI-generated workflows, ensuring actions are trustworthy before execution.
Quick Take
Mnemosyne introduces Agentic Transaction Processing (ATP) to validate AI-generated workflows, ensuring actions are trustworthy before execution. It features a runtime with an append-only log and achieves under 6% overhead in projection and validation, while local repairs require significantly fewer operations than global recompute.
Key Points
- ATP treats generated actions as untrusted proposals until they meet executable constraints.
- Mnemosyne proves four safety properties, including authority separation and evidence-preserving repair.
- Local repair edits require an order of magnitude fewer operations than global recompute.
- The system maintains a bounded-reactive-repair guarantee for localized repair protocols.
- Mnemosyne is open source, available on GitHub.
Paper Resources
Article Content
From source RSS / original summaryarXiv:2607. 00269v1 Announce Type: new Abstract: LLMs, solvers, and agent teams increasingly generate workflow actions, repairs, and plans, but a generated action may be syntactically valid yet stale, infeasible, conflicting, or destructive of the evidence that triggered a repair. We introduce Agentic Transaction Processing (ATP), a transaction model that treats generated actions as untrusted proposals until they pass deterministic admission under a declared, executable constraint set C.
The principle is two-sided: a proposal is not truth, and no proposal foresees every disruption: anything may propose, but only the runtime admits and commits, and when an unforeseen disruption strikes it repairs reactively within bounds rather than trusting a fresh proposal. Relative to C, committed-state correctness becomes independent of the competence, honesty, or learning of the proposing layer.
We realize ATP in Mnemosyne, a runtime with an append-only transition log, effective-state projection, dependency-safe compensation, and active commitment records, and prove four safety properties relative to C (authority separation, serial-equivalent generative admission, evidence-preserving repair, and obligation containment) together with a bounded-reactive-repair guarantee for its localized repair protocol (LCRP).
A reproducible artifact rejects the targeted violations across nine falsification tests while still admitting valid work, at under 6% projection-and-validation overhead, and bounded local repair edits an order of magnitude fewer operations than global recompute. Mnemosyne is open source: https://github. com/eyuchang/Mnemosyne/tree/arxiv-atp-rq1-rq9b-r8-v2.
Want this in your inbox every morning?
Daily brief at your local 8am — bilingual EN/中文, free.
More from arXiv cs.AI
See more →The Verification Horizon: No Silver Bullet for Coding Agent Rewards
As coding agents evolve, verifying solutions becomes more challenging than generating them, necessitating a focus on scalable, faithful, and robust verification methods. The study reveals that no fixed reward function can sustain effectiveness as model capabilities advance, emphasizing the need for verification to evolve alongside solution generation.