为AI代理设计的受控本地内存系统,确保记忆安全与可审计。
SuperLocalMemory 4.0: The Governed Memory Operating System for AI Agents
- 采用双向排序融合与时间-范围隔离机制统一多源记忆检索
- 在11类故障注入中保持2199/2200组件属性正确,可靠性极强
- 适合对记忆安全有高要求的AI系统开发者使用
我们提出SuperLocalMemory 4.0,一种面向AI代理的受控、本地优先的记忆操作系统,通过互斥排序融合、双时间召回、多作用域隔离、基于角色的访问控制、可验证擦除及哈希链审计日志实现统一管理。可靠性核心控制主写路径:生成防护准入、每投影的申请-验证-补偿-擦除所有权机制,以及哈希可验证完成声明。在11种故障注入场景中各重复200次,共维持2,199/2,200个作用域组件属性。本版本以负面结果领先:10项机制虽已实现且可达,但在最终连接处无效。实现、可达、有效是三个不同问题,后者需独立于被测机制的预言机。我们贡献两个机械不变量:针对贝叶斯学习者的先验距离断言,和针对模式保护路径的连接存活断言,用于定位缺失数据。三臂消融实验表明,仅当回忆会话标识符命名空间存在缺陷时,后验无变化;而完全写入但无交互的负向对照则无任何影响。撤回此前版本的受控写包裹开销数据:两条路径不可比。实际测量显示,11.0毫秒的受控写中,包裹占70.6%,但生成屏障仅耗1.9微秒,义务账本耗42微秒。成本来自持久性,而非治理。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。