

















Abstract: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.
| Comments: | 23 pages, 4 figures, 8 tables. Companion proofs: this https URL. Project: this https URL. Updated license |
| Subjects: | Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI); Programming Languages (cs.PL) |
| ACM classes: | D.2.4; D.3.1; F.3.1; I.2.0 |
| Cite as: | arXiv:2605.01037 [cs.CR] |
| (or arXiv:2605.01037v3 [cs.CR] for this version) | |
| https://doi.org/10.48550/arXiv.2605.01037 arXiv-issued DOI via DataCite |
From: Alan McCann [view email]
[v1]
Fri, 1 May 2026 19:04:37 UTC (37 KB)
[v2]
Tue, 5 May 2026 10:31:31 UTC (37 KB)
[v3]
Tue, 26 May 2026 12:33:51 UTC (37 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。