Discussion about this post

User's avatar
Tris Simondsen's avatar

The FMxAI community is treating formal verification as a panacea, attempting to build guarantees on top of architectures that violate zero-trust evidence contracts at the root level.

The current push toward Secure Program Synthesis (SPS) and vericoding assumes that if a generated output satisfies a formal specification (via Lean, Coq, or another ITP), the system itself is secured. This fundamentally misunderstands the generative engine. Under the Observational Sufficiency Principle (OSP), any system relying on "latent completion", the assumption that identical observable outputs imply identical underlying system states, operates as a structurally unobservable stochastic process, not a Fully Specified Stochastic Process (FSSP).

If the latent state space cannot be observed or formalized, attempting to use formal methods strictly on the output layer violates the Non-Circularity Principle (NCP). You cannot use the downstream observable output of a probabilistic channel to validate the epistemic integrity of the channel itself. Doing so is not secure engineering; it is simply stochastic laundering.

The Information-Loss Boundary of these models perfectly mirrors the established cryptographic theorems of nested and subliminal channels (historically anchored by Shannon and Simmons). The reliance on latent completion is no longer just a statistical oversight, it is recognized by classical cryptography as a direct violation of zero-trust evidence contracts.

We cannot patch intent or evaluate alignment by measuring circularity. The formal mathematical proofs against inference as engineering are mapped here:

https://trissimondsen.wordpress.com/2026/07/10/from-osp-to-ncp-the-non-circularity-principle-against-inference-as-engineering/

No posts

Ready for more?