Verification algorithm
-
Bounded decode
Reject oversized, malformed, non-canonical, duplicate, indefinite, tagged, floating-point, or trailing input before it can affect later stages.
-
Reference resolution
Resolve the proof’s content-addressed object graph, require referenced objects, reject cycles and duplicates, and enforce plan limits.
-
Principal control
Use installed immutable registries to verify signatures and carried evidence for each principal-control binding.
-
Authority branches
Start at explicitly trusted roots, walk grant chains, and reject any expansion across protected authority dimensions.
-
Plan evaluation
Evaluate proof, all-of, any-of, and K-of-N composition without allowing indeterminate branches to become authorization.
-
Action binding
Match profile, action digest, body digest, audience, challenge, time, constraints, status, assurance, and local policy before constructing
VerifiedAction.
Determinism
Section titled “Determinism”Identical proof, canonical action, trusted context, and executable registry produce the same result bytes. Evaluation time and every other varying fact are explicit inputs.
Execution is not a verifier stage
Section titled “Execution is not a verifier stage”The kernel returns a sealed verified action. Profile decoding, replay and budget claims, transport policy, receipts, and execution occur downstream.