AI 中文总结
本文提出认知可串行化及TCT机制，解决AI智能体基于易变输入提交变更的一致性问题，通过类型化依赖令牌和密封事务实现，原型验证有效且开销仅3.22毫秒。
AI 中文摘要
自主智能体从数据库读取、检索到的证据、策略、信念和委托权限中派生出具体的变更。这些输入在推理进行过程中可能会发生变化。数据库隔离对已提交的事务进行排序；智能体事务处理确定提案是否满足可执行合约。除非合约表示相关谓词，否则这两种保证都不能为变更及其派生输入建立一个共同的有效点。类型化依赖令牌区分内容完整性与适用性，可信中介捕获暴露给推理的值。在严格认知可串行化下，已提交的效果允许一个串行顺序和一个逻辑事件，在该事件中，暴露给派生的每个值都保持不变。栅栏持续到实现密封持久性域的运行时事件为止。较弱的效应兼容认知准入根据同时持有的当前依赖向量和当前策略重新认证效果，而不声称对原始随机派生进行串行化。TCT结合了不可变的版本化可执行定义、注册表派生的权限计划、密封信封、守卫优先提交事务、密封后信封和见证绑定授权、共同提交的收据、幂等授权最终化以及收据驱动的认知协调。完整的注册足迹和单一增长阶段在局部守卫和不兼容的外部保留上诱导无环锁点顺序。相应的结果给出了可串行化条件和零误差健全性与正进展的观测等价边界。一个证伪套件测试了实现义务：原型阻止了所有注入的异常，并增加了3.22毫秒的平均提交开销。
英文摘要
Autonomous agents derive concrete mutations from database reads, retrieved evidence, policy, beliefs, and delegated authority. Those inputs may change while reasoning is in progress. Database isolation orders the submitted transaction; agentic transaction processing determines whether a proposal satisfies an executable contract. Neither guarantee establishes a common valid point for the mutation and its derivation inputs unless the contract represents the relevant predicates. Typed dependency tokens distinguish content integrity from applicability, and trusted mediation captures the values exposed to reasoning. Under strict Cognitive Serializability, committed effects admit a serial order and a logical event at which every value exposed to derivation is unchanged. The fences last until the runtime event that realizes the sealed durability domain. The weaker Effect-Compatible Cognitive Admission recertifies an effect against a simultaneously held current dependency vector and current policy without claiming to serialize the original stochastic derivation. TCT combines immutable versioned executable definitions, registry-derived authority plans, sealed envelopes, guard-first commit transactions, post-seal envelope- and witness-bound grants, co-committed receipts, idempotent grant finalization, and receipt-driven epistemic reconciliation. Complete registered footprints and a single growing phase induce an acyclic lock-point order over local guards and incompatible external reservations. The corresponding results give serializability conditions and an observational-equivalence boundary for zero-error soundness and positive progress. A falsification suite tests the implementation obligations: the prototype prevented all injected anomalies and added 3.22 ms mean commit overhead.
Comments22 pages, 3 figures, 4 tables
