Cryptographic Validity Is Not Runtime Admissibility: Opaque Reasoning Traces, Dynamic Classification Failure, and a Synthetic Policy-Conformance Benchmark
Encrypted reasoning traces exposed a broader architectural error in agentic memory: cryptographic authenticity does not establish contextual, semantic, or operational authority. This working paper formalizes a Contextual Runtime Admissibility Gate (CRAG) and reports a deterministic 28-case synthetic policy-conformance benchmark with a 14-case combinatorial holdout. Context binding alone admitted 60% of unsafe cases overall and 70% on holdout. Full CRAG admitted none while preserving all eight benign-continuity cases. The result establishes conformance to a frozen author-defined normative contract, not independent construct validation or production effectiveness. The deposit includes the paper and the complete synthetic replication package.
Authors
- Ignacio Adrián LERER (ORCID: https://orcid.org/0009-0007-6378-9749)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-08-13
- DOI
- https://doi.org/10.5281/zenodo.21927141
- Primary Topic
- Security and Verification in Computing
- Type
- preprint