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.

翻译：我们提出了一种认证纯净性架构，将认知工作流系统中的治理执行从运行时约定转变为结构性的能力边界。一个先前的三层治理架构在满足纯模块约束（即步骤执行器不能执行副作用）的前提下，证明了治理完备性、溯源完备性以及无监管效应的不可能性。该约束通过模块导入图分析来实施，但该方法不足以应对BEAM虚拟机上的对抗性绕过。本文通过四种机制弥补了这一缺陷：(1) 一个受限的WebAssembly编译目标，其结构上不存在产生副作用的指令；(2) 纯净性证书——将执行器二进制文件与其导入分类绑定的加密签名证明；(3) 一个运行时验证门控，在未认证执行器进入治理管道前将其拒绝；(4) 通过远程证明实现便携式治理凭证以进行跨组织验证。我们证明了四个定理：构造性结构纯净性、对所有五类BEAM绕过类别的消除、证书完整性以及门控完备性。该保证基于一个明确的信任计算基。对四个已实现执行器的评估显示，验证延迟为39–42微秒，完整规划周期低于400微秒，运行时开销低于100毫秒HTTP请求的0.4%，且多次重复调用中零确定性偏差。