Trust by Construction for Cross-Domain Autonomous Agents: A Protocol-Agnostic Mathematical Framework for Bounded, Revocable, and Cross-Domain Authority
We present a protocol-agnostic formulation of bounded delegation, fail-closed admission, and post-revocation rejection for autonomous agents. The guarantees are conditional on transitive capability narrowing, sound verification checks, authentic current state roots, sound state proofs, and inactive-after-revoke semantics. Z3 5.3.3, Lean 4.35.0, and CBMC 6.11.0 check specified finite instances, key lemmas, and two simplified C harnesses; they do not mechanize the complete protocol stack or prove code equivalence. A software-in-the-loop prototype provides simplified CCC/ICCE/Matter/Aliro trust-root adapters, 38 passing behavioral and adversarial tests, a cross-adapter resource-mismatch scenario, and single-host performance measurements with variance reported. Adapter correctness, full standards conformance, general cross-domain policy composition, distributed root consensus, and hardware-level evaluation remain future work.
Authors
- Lei Lv (ORCID: https://orcid.org/0009-0000-1583-0785)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-15
- DOI
- https://doi.org/10.5281/zenodo.24238203
- Primary Topic
- Access Control and Trust
- Type
- preprint