arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2608.08253cs.AIcs.IR

SuperLocalMemory 4.0:面向AI智能体的受管控内存操作系统

SuperLocalMemory 4.0: The Governed Memory Operating System for AI Agents

Varun Pratap Bhardwaj, Garima Singh, Arun Pratap Bhardwaj

首次发表
浏览论文内容

中文总结 AI 辅助

本文提出SuperLocalMemory 4.0,一款面向AI智能体的受管控本地优先内存操作系统,整合多类型检索与管控功能,经测试其可靠性达标,为AI智能体提供持久化内存解决方案。

中文摘要 AI 辅助

AI智能体正成为共享基础设施,然而持久化内存通常由独立的检索、管控和操作组件组合而成。本文提出SuperLocalMemory 4.0,这是一款面向AI智能体的受管控、优先本地部署的内存操作系统。该系统通过 reciprocal-rank 融合整合了密集语义检索、BM25词汇检索、时间检索、Hopfield联想检索及扩散激活检索;具备受管控的学习与行为层;支持双时态回忆;提供个人、共享、全局多范围内存;实现基于角色的访问控制;符合GDPR要求的导出与可验证擦除功能;保留审计跟踪;还包含部署场景下的《欧盟人工智能法案》检查清单。V4版本为其主写路径引入了可靠性核心:生成受限准入、策略注册表、带有各投影应用、验证、补偿及擦除所有者的可验证内存事务,以及可哈希校验的完成清单。运行时可通过CLI、MCP、HTTP守护进程、仪表盘、编辑器集成及框架适配器使用,支持完全本地、带设备端模型的本地、及提供商辅助三种模式。我们对11种故障注入与机制场景进行评估,每种重复200次。发布的证据包显示2200次确定性重复均符合其范围组件属性。受管控写信封的p50为3.522毫秒,p99为5.297毫秒,而不受管控基线的对应值为1.835毫秒和2.569毫秒,对应进程内控平面开销的p50为1.687毫秒,p99为2.728毫秒。这些是范围组件与机制的测量结果,而非端到端多进程或外部检索准确率基准。本文整合了SuperLocalMemory在隐私保护多智能体内存、信息几何检索及V3.3 Living Brain生命周期方面的前期研究成果。

英文摘要

We present SuperLocalMemory 4.0, a governed, local-first memory operating system for AI agents, unifying multi-channel retrieval under reciprocal-rank fusion, bi-temporal recall, multi-scope isolation, role-based access, verified erasure, and a hash-chained audit trail. A reliability spine governs the primary write path: generation-fenced admission, verifiable memory transactions with per-projection apply, verify, compensate and erase owners, and hash-checkable completion manifests. Eleven fault-injection scenarios, each repeated 200 times, upheld 2,199 of 2,200 scoped component properties. This version leads with a negative result. Ten mechanisms here were implemented, reachable on a live call path, and ineffective at their final connection. Implemented, reachable and effective are three different questions, and the third requires an oracle independent of the mechanism under test. We contribute two mechanical invariants that supply one: a prior-distance assertion over Bayesian learners, and a join-liveness assertion over schema-guarded paths that reports where a guard's missing data resides. A three-arm ablation varying only the recall session-identifier namespace moves no posterior with the defect present and every instantiated arm with it absent, while a negative control that writes every ticket but supplies no engagement settles nothing. We withdraw the previous version's governed write-envelope overhead figure: the two paths it differenced are not comparable. Timing the envelope in place gives an 11.0 ms governed write of which the envelope is 70.6 percent, but the generation fence costs 1.9 microseconds and the obligation ledger 42 microseconds. The cost is durability, not governance.

发表机构

  • Qualixar(奎利克萨)

机构由 AI 辅助整理,请以论文原文为准。

补充信息

↑