<?xml version="1.0" encoding="UTF-8"?>
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" category="exp" docName="draft-watts-unison-noncollapse-00" ipr="trust200902" submissionType="IETF" version="3">
  <front>
    <title>Typed UNISON and Non-Collapse Boundaries for Evidence and Authorization Systems</title>
    <seriesInfo name="Internet-Draft" value="draft-watts-unison-noncollapse-00"/>
    <author fullname="Deonte Watts" initials="D." surname="Watts">
      <organization>Independent Researcher</organization>
      <address><postal><city>San Francisco</city><region>CA</region><country>US</country></postal><email>deonte@goodshyt.fun</email><uri>https://orcid.org/0009-0005-8586-3650</uri></address>
    </author>
    <date year="2026" month="October"/>
    <area>Security</area>
    <keyword>authorization</keyword><keyword>agents</keyword><keyword>evidence</keyword>
    <abstract><t>This document describes a transport-neutral model for bounded correspondence among distinct representations and explicit promotion boundaries between observation, evidence, authorization, and execution.</t></abstract>
  </front>
  <middle>
    <section anchor="s1" numbered="true"><name>Introduction</name><t>This document defines a typed correspondence model for comparing evidence and state representations without treating coordinate equality, semantic equivalence, scientific support, authorization, and execution as the same property.</t></section>
<section anchor="s2" numbered="true"><name>Typed Comparison Spaces</name><t>Each required comparison declares source representations, a common comparison space, bridge functions, units, snapshot alignment, uncertainty treatment, and tolerance. Missing required bridge data is indeterminate rather than pass.</t></section>
<section anchor="s3" numbered="true"><name>Non-Collapse</name><t>Observation does not imply evidence qualification; evidence qualification does not imply authorization; authorization does not imply execution. Each promotion requires an explicit procedure and artifact.</t></section>
<section anchor="s4" numbered="true"><name>Comparison Relations</name><t>Profiles distinguish strict invariance, covariant transformation, quotient equivalence, and tolerance-bounded equivalence. A comparison MUST state which relation is being tested.</t></section>
<section anchor="s5" numbered="true"><name>Selection</name><t>An empty authorized set yields no selection. A tie without a declared tie rule yields no implicit selection. Feasibility does not imply attainment or progress.</t></section>
<section anchor="s6" numbered="true"><name>Status of Validation</name><t>The v0.1 reference implementation reports 40 passing boundary checks, including fail-closed empty-set, missing-representation, unit-mismatch, uncertainty, tie, promotion, and finite quotient checks. Independent formal proof is not claimed.</t></section>
    <section anchor="security" numbered="true"><name>Security Considerations</name><t>This document defines an architectural model. Implementations MUST fail closed when required authority, evidence, or enforcement state is unknown. The model does not establish closure outside a declared enforcement boundary.</t></section>
    <section anchor="privacy" numbered="true"><name>Privacy Considerations</name><t>Capability and evidence graphs can reveal topology, identity relationships, and operational context. Implementations SHOULD minimize disclosure and use scoped identifiers and digests where possible.</t></section>
    <section anchor="iana" numbered="true"><name>IANA Considerations</name><t>This document has no IANA actions.</t></section>
  </middle>
  <back/>
</rfc>
