认知工作流执行器的认证纯度:从静态分析到密码学证明
Certified Purity for Cognitive Workflow Executors: From Static Analysis to Cryptographic Attestation
AI总结:
提出一种认证纯度架构,通过WebAssembly编译、密码签名证书和运行时验证门,将认知工作流系统中的治理执行从运行时约定转变为结构性能力边界,消除BEAM虚拟机上的对抗性绕过。
摘要:
我们提出了一种认证纯度架构,将认知工作流系统中的治理执行从运行时约定转变为结构性能力边界。先前的三层治理架构证明了治理完备性、来源完备性以及不可治理效应的不可能性,这依赖于纯模块约束:即步骤执行器不能执行效应。该约束通过模块导入图分析来执行,但不足以对抗BEAM虚拟机上的对抗性绕过。本文通过四种机制弥补了这一差距:(1)受限的WebAssembly编译目标,其中产生效应的指令在结构上缺失;(2)纯度证书,即密码学签名的证明,将执行器二进制文件与其导入分类绑定;(3)运行时验证门,在未认证执行器进入治理管道之前拒绝它们;以及(4)通过远程证明实现跨组织验证的可移植治理凭证。我们证明了四个定理:结构性纯度由构造保证,所有五种BEAM绕过类别的绕过消除,证书完整性,以及门完备性。该保证相对于显式的可信计算基成立。在四个已实现执行器上的评估显示,验证延迟为39-42微秒,完整计划周期低于400微秒,运行时开销低于100毫秒HTTP请求的0.4%,并且重复调用之间零确定性分歧。
英文摘要:
We present a certified purity architecture that converts governance enforcement in cognitive workflow systems from a runtime convention into a structural capability boundary. A prior three-layer governance architecture proves governance completeness, provenance completeness, and the impossibility of ungoverned effects, conditional on the pure module constraint: that step executors cannot perform effects. That constraint was enforced by module import graph analysis, which is insufficient against adversarial bypass on the BEAM virtual machine. This paper closes the gap through four mechanisms: (1) a restricted WebAssembly compilation target where effect-producing instructions are structurally absent; (2) purity certificates, cryptographically signed proofs binding executor binaries to their import classifications; (3) a runtime verification gate that rejects uncertified executors before they enter the governance pipeline; and (4) portable governance credentials via remote attestation for cross-organizational verification. We prove four theorems: structural purity by construction, bypass elimination for all five BEAM bypass classes, certificate integrity, and gate completeness. The guarantee holds relative to an explicit Trusted Computing Base. Evaluation on four implemented executors shows verification latency of 39--42 us, full plan cycle under 400 us, runtime overhead under 0.4% of a 100 ms HTTP request, and zero determinism divergences across repeated invocations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。