Positive Abstention and the Conversion Bar

Refusing to act is a first-class, recorded outcome — and can't be laundered into acting.

Primary technical disclosure

Secondary technical

Relay Non-Execution Attestation With Depth and Cycle Bounds How a relay non-execution attestation lets a middle semantic agent disclose a withholding it did not itself write, deriving the withheld action-class enumeration from a failing dispatch-authority predicate and bounding chain depth and cycles while preserving the abstention type.The Anti-Amplification Bound on Propagated Determinations How the Adaptive Query architecture bounds the movement of an admitting agent's scoped integrity vector on a propagated conduct determination at a declared sub-unity fraction of a locally computed reference, so judgments do not amplify across a chain of autonomous agents.The Attestation Revocation Object How a disclosing agent retracts its own non-execution attestation in the Adaptive Query architecture, releasing a carried abstention entry per action class on successor-epoch verification while incrementing no counter and producing no determination about either party.Empty-Intersection Mutual Positive Abstention How a semantic agent handles an empty co-residency intersection between two conflicting signed policy objects on a stateless node: a mutual positive abstention that produces no denial, no determination, and no counter increment under the conversion bar.Curing Counterparty Absence by Introduction Protocol How a persistent semantic agent cures an absent admissible counterparty class through a signed introduction protocol, admitting an introduction record from a second agent by signature verification and policy-object class membership testing.

Applications · general

Terminology