<?xml version='1.0' encoding='UTF-8'?>
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" category="info" docName="draft-das-satellite-orbital-finality-profiles-00" ipr="trust200902" submissionType="IETF" consensus="false" xml:lang="en" tocInclude="true" tocDepth="3" symRefs="true" sortRefs="true" version="3">
  <front>
    <title abbrev="LEO/NTN Orbital Finality">Execution-Finality Profiles for LEO/NTN Satellites, Orbital AI, Optical ISLs, Spacecraft Autonomy, and Cybersecurity</title>
    <seriesInfo name="Internet-Draft" value="draft-das-satellite-orbital-finality-profiles-00"/>
    <author fullname="Sangam Kumar Das" initials="S." surname="Das">
      <organization>Independent</organization>
      <address>
        <postal>
          <city>Balasore</city>
          <region>Odisha</region>
          <country>IN</country>
        </postal>
        <phone>+91-9861363532</phone>
        <email>info@sangamdas.com</email>
      </address>
    </author>
    <date year="2026" month="September" day="14"/>
    <area>Security</area>
    <workgroup>Individual Submission</workgroup>
    <keyword>execution finality</keyword>
    <keyword>satellite</keyword>
    <keyword>non-terrestrial networks</keyword>
    <keyword>orbital AI</keyword>
    <keyword>delay-tolerant networking</keyword>
    <keyword>remote attestation</keyword>
    <keyword>optical inter-satellite links</keyword>
    <keyword>space mobility</keyword>
    <keyword>satellite servicing</keyword>
    <keyword>orbital maneuver</keyword>
    <keyword>zero debris</keyword>
    <keyword>LEO satellite</keyword>
    <keyword>satellite cybersecurity</keyword>
    <keyword>spacecraft autonomy</keyword>
    <keyword>optical ISL</keyword>
    <abstract>
      <t>
        Satellite and non-terrestrial networks are becoming programmable compute,
        routing, sensing, radio, and AI infrastructures. In such systems, successful
        authentication, attestation, routing, scheduling, inference, fault recovery,
        or protocol processing does not necessarily establish authority for the
        resulting operation to become externally effective.
      </t>
      <t>
        This document describes an execution-finality architecture in which a
        consequence-bearing operation is represented as a Candidate Act and may
        remain in a Non-Effective State after computation. A Protected Enforcement
        Domain validates act-bound predicates and protected state, commits protected
        validation evidence, and permits release of scoped non-bearer authority. A
        Finality Sink at or before the relevant consequence boundary verifies that
        authority before an operation becomes routing-effective, radiative-effective,
        storage-effective, control-effective, disclosure-effective, or otherwise
        externally effective.
      </t>
      <t>Sixty satellite and NTN enforcement profiles are provided, covering orbital AI output release, model-state transfer, Earth observation, power- and thermal-bounded compute, radiation recovery, optical inter-satellite links, onboard gNB and user-plane functions, delay-tolerant delivery, emergency services, firmware and microcode activation, privileged maintenance, orbital maneuver and collision-avoidance authority, proximity operations, propulsion and attitude actuation, hosted-payload control, sensing activation, end-of-life decommissioning, manufacturing and launch-preparation component admission, and high-consequence command release. Each profile states a concrete problem space and the corresponding execution-finality solution.</t>
      <t>
        Publicly described work from SpaceX / Starlink, Blue Origin, Northrop Grumman /
        SpaceLogistics, Rocket Lab, Airbus Defence and Space, and Thales Alenia Space
        illustrates industry directions involving direct-to-device connectivity,
        optical inter-satellite networking, orbital mobility, hosted and software-defined
        payloads, onboard processing, rendezvous and proximity operations, and in-orbit
        servicing. These references identify technical complementarity and possible
        enforcement locations; they do not imply that any named organization has
        reviewed, endorsed, adopted, or lacks equivalent mechanisms.
      </t>
      <t>
        The proposal does not replace 3GPP NTN, IETF routing or Time-Variant Routing,
        DTN, RATS/attestation, ACE authorization, SUIT update mechanisms, optical-link
        protocols, spacecraft fault detection, isolation and recovery, or
        cryptographic authentication. Those mechanisms can provide inputs to the
        finality decision. The additional question is whether a specific Candidate
        Act is permitted to cross the boundary at which it first acquires external
        effect. Technical corrections and references to equivalent existing
        mechanisms are expressly invited.
      </t>
    </abstract>
  </front>
  <middle>
    <section anchor="intro">
      <name>Introduction</name>
      <t>
        Satellite systems increasingly combine radio access, direct-to-device
        communication, regenerative payloads, onboard packet processing, optical
        inter-satellite links, distributed sensing, onboard AI inference, accelerator
        compute, autonomous scheduling, store-and-forward communication, Earth
        observation analytics, and satellite-to-ground cloud services.
      </t>
      <t>
        These capabilities make a distinction necessary between an operation being
        computable and an operation being authorized to cause a consequence. A model
        can infer, a route can exist, an attestation result can be acceptable, a
        command can authenticate, a bundle can be stored, or a recovery procedure can
        complete without those facts necessarily answering whether the exact resulting
        act should become externally effective now.
      </t>
      <t>
        The core invariant of this document is therefore: <strong>computation is not
        authority</strong>. The proposal makes the execution-to-effect boundary
        explicit and places a verifiable finality decision at or before that boundary.
      </t>
      <section anchor="problem-space">
        <name>Problem Space</name>
        <t>
          The problem is not limited to malicious commands. It also includes stale
          authority, delayed delivery, changing orbital geometry, route changes,
          cross-jurisdictional handoff, autonomous model output, radiation-degraded
          state, partner-constellation changes, emergency-mode transitions, and
          software updates whose downstream effects are broader than the authority
          used to obtain or install them.
        </t>
        <t>
          Existing controls frequently establish properties about identity, platform
          state, connectivity, path availability, update authenticity, or fault
          recovery. Those properties are necessary. The unresolved engineering
          question addressed here is narrower: what prevents a prepared operation
          from becoming effective when one of the conditions governing the actual
          consequence is absent, stale, revoked, mismatched, exhausted, or
          indeterminate?
        </t>
      </section>
      <section anchor="existing-approaches-gap">
        <name>Existing Approaches and the Remaining Gap</name>
        <t>
          Existing solutions already address important parts of the system: cryptographic
          authentication can establish identity and integrity; secure channels can protect
          transport; RATS can provide evidence and Attestation Results; TVR and routing
          mechanisms can describe path state; DTN can carry data across disruption; ACE can
          provide constrained authorization; SUIT can protect software-update workflows;
          spacecraft FDIR can detect, isolate and recover faults; and 3GPP NTN can provide
          radio, mobility, bearer and user/control-plane procedures.
        </t>
        <t>
          The proposed architecture does not duplicate those functions. The remaining gap
          considered here is the transition from a successful upstream operation to an
          externally consequential act. Authentication answers who or what; attestation can
          answer properties of state; routing answers how traffic can move; DTN answers how
          it can survive disruption; FDIR answers how faults are detected and recovered.
          Execution finality asks whether this exact Candidate Act, under the current bound
          state, may cross this consequence boundary now.
        </t>
        <t>
          The technical shortcoming addressed by the proposal is therefore not the absence
          of policy or the absence of those mechanisms. It is the possibility that a policy
          decision or trustworthy upstream result is advisory, stale, detached from the act,
          or bypassable at the point of effect. The proposed solution is to preserve a
          Non-Effective State until act-bound authority is verified by the Finality Sink.
        </t>
      </section>
      <section anchor="policy-enforcement">
        <name>From Policy Requirements to Technical Enforcement</name>
        <t>
          Regulatory and risk-management frameworks increasingly require lifecycle
          risk management, oversight, robustness, cybersecurity, and technical or
          organisational mitigation. As one example, Articles 9, 14, and 15 of the
          European Union Artificial Intelligence Act address risk management, human
          oversight, and accuracy, robustness and cybersecurity for high-risk AI
          systems <xref target="EU-AI-ACT"/>. The same Regulation contains a
          standards and conformity-assessment section, including Article 40 on harmonised
          standards and standardisation deliverables, illustrating the continuing need to
          translate legal requirements into interoperable technical specifications. The
          NIST AI Risk Management Framework similarly treats AI risk management as an
          ongoing governance and risk management activity <xref target="NIST-AI-RMF"/>.
        </t>
        <t>
          Those frameworks do not mandate the architecture in this document, and
          deployment of execution finality does not by itself establish legal or
          regulatory compliance. Their relevance is the engineering translation
          problem: high-level requirements such as risk mitigation, oversight,
          robustness, misuse resistance, and cybersecurity must ultimately be
          enforced through concrete system behavior.
        </t>
        <t>
          Policies, audits, operating procedures, logs, model documentation,
          contracts, and human-oversight processes remain important. They are not,
          by themselves, a technical property that prevents a machine-generated act
          from crossing an effect boundary. This document therefore focuses on the
          <strong>policy-to-enforcement</strong> and <strong>execution-to-effect</strong>
          boundary rather than treating documentation or post-event evidence as a
          substitute for pre-effectuation control.
        </t>
        <table anchor="regulatory-alignment">
          <name>Illustrative regulatory-to-technical alignment</name>
          <thead>
            <tr>
              <th>Policy objective</th>
              <th>Possible execution-finality contribution</th>
              <th>Not claimed</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td>Risk mitigation</td>
              <td>Machine-verifiable predicates and fail-closed effectuation</td>
              <td>A complete risk-management program</td>
            </tr>
            <tr>
              <td>Human oversight</td>
              <td>Human approval or quorum can be a bound predicate before effect</td>
              <td>Replacement of human oversight duties</td>
            </tr>
            <tr>
              <td>Robustness and cybersecurity</td>
              <td>Freshness, revocation, protected state, alternate-path closure, bounded release</td>
              <td>Complete system cybersecurity</td>
            </tr>
            <tr>
              <td>Traceability</td>
              <td>Protected validation evidence committed before or atomically with release</td>
              <td>A universal legal audit-record format</td>
            </tr>
          </tbody>
        </table>
      </section>
      <section anchor="scope-nongoals">
        <name>Scope and Non-Goals</name>
        <t>
          This document is an architectural and profile catalogue. It does not define
          a new satellite physical layer, radio scheduler, optical modulation scheme,
          routing protocol, attestation evidence format, firmware manifest, legal
          policy language, spacecraft FDIR algorithm, or universal capability-token
          format.
        </t>
        <t>
          The architecture can consume outputs from such systems as predicates. It
          does not decide what the governing policy should be. It defines where and
          how a policy decision can be made load-bearing before the corresponding
          external consequence.
        </t>
      </section>
    </section>
    <section anchor="relationship-ntn-rf-draft"><name>Relationship to the Existing NTN/RF Execution-Finality Draft</name><t>This document is complementary to, and does not replace, the earlier Internet-Draft “RF Enable Is Not Transmit Authority: Finality for LEO/NTN and Inter-Satellite Control” (<xref target="DAS-NTN-RF"/>draft-das-ntn-rf-execution-finality).</t><t>The earlier document addresses a deliberately focused problem: the transition from an authenticated, scheduled, computed, or otherwise prepared satellite or non-terrestrial-network operation into an actual radio-frequency, beam, inter-satellite-link, gateway, or related communications consequence. Its principal enforcement locations include boundaries such as power-amplifier enablement, beam-control paths, inter-satellite forwarding, feeder gateways, user-terminal transmit paths, and other points at which a prepared network or radio operation becomes physically or externally effective.</t><t>The present document serves a different but complementary purpose.</t><t>Satellite and non-terrestrial infrastructure increasingly extends beyond RF transport. A modern spacecraft or constellation may contain autonomous mission software, onboard AI accelerators, distributed orbital compute, optical inter-satellite networking, regenerative payloads, software-defined routing, spacecraft recovery logic, radiation-tolerant computing, programmable firmware, hosted third-party payloads, autonomous collision-avoidance functions, orbital-maneuver planning, propulsion and attitude-control systems, Earth-observation processing, cross-constellation cooperation, delayed store-and-forward services, and increasingly autonomous maintenance and mission-management functions.</t><t>Accordingly, the present document does not attempt merely to restate the RF-finality mechanism for additional satellite examples. Instead, it provides a catalogue of Enforcement Profiles showing how the common execution-finality invariant may be instantiated at materially different satellite, spacecraft, orbital-compute, manufacturing, servicing, routing, sensing, recovery, and physical-effect boundaries.</t><t>The relationship between the two documents may therefore be summarized as follows:</t><ul spacing="normal"><li><t>draft-das-ntn-rf-execution-finality provides a focused treatment of execution finality for NTN, RF, beam, inter-satellite-link, gateway, and closely related communications consequences.</t></li><li><t>This document provides a broader satellite and orbital-infrastructure profile catalogue describing how the same underlying execution-finality architecture may apply across multiple distinct consequence classes and technical boundaries.</t></li></ul><t>For example, the present profile catalogue includes cases in which the relevant Finality Sink is not an RF transmitter. Depending on the profile, the Finality Sink may instead be an orbital-AI output-release boundary, optical-terminal admission gate, tensor-ingress interface, spacecraft storage-commit interface, propulsion actuator, thruster latch valve, reaction-wheel driver, payload activation rail, sensor-exposure control, firmware activation boundary, reset-release gate, safe-mode exit gate, spacecraft-component admission boundary, or terrestrial ingestion boundary.</t><t>The distinction is important because the same architectural principle can produce different engineering requirements depending on the consequence being controlled.</t><t>A transmit operation may require verification immediately before RF energy leaves an aperture. An orbital AI result may require verification before downlink or destination admission. An inter-satellite tensor transfer may require separate source-release and destination-admission checks. A spacecraft recovery action may require verification before reset release or safe-mode exit. A propulsion command may require verification at a thruster or actuator boundary. A replacement or reintroduced spacecraft component may require validation before it becomes operationally authoritative within the spacecraft package. These are related applications of execution finality, but they are not identical effectuation boundaries.</t><t>The profiles therefore make explicit a property that would otherwise remain hidden behind a generic statement that “execution finality also applies to satellites.” Each profile identifies the concrete problem space, Candidate Act, Non-Effective State, relevant authority predicates and protected evidence, scoped authority, applicable Finality Sink, fail-closed behavior, and relationship to existing technical mechanisms.</t><t>This profile-oriented treatment also makes it possible to evaluate the architecture against existing standards and implementations on a boundary-by-boundary basis. A mechanism that already provides an equivalent property for RF transmission may not necessarily provide the same property for orbital AI output release, firmware activation, autonomous maneuver execution, post-radiation recovery, optical-mesh admission, hosted-payload egress, or component re-admission. Conversely, an existing mechanism in any of those domains may already satisfy some or all of the execution-finality properties described by the corresponding profile.</t><t>For that reason, the existence of the earlier NTN/RF draft is not treated as evidence that a second satellite-focused document is required merely for additional terminology or additional use cases. The justification for this document is the presence of materially different consequence boundaries requiring separate technical analysis.</t><t>The documents intentionally share the same architectural substrate:</t><artwork align="left" name="Shared execution-finality substrate"><![CDATA[
  Candidate Act
      |
      v
  Non-Effective State
      |
      v
  Protected Validation
      |
      v
  Protected Validation Evidence
      |
      v
  Scoped Non-Bearer Authority
      |
      v
  Finality Sink Verification
      |
      v
  External Effect
]]></artwork><t>They differ principally in scope and level of decomposition.</t><t>Where an Enforcement Profile in this document substantially overlaps the earlier NTN/RF draft, the earlier draft should be treated as the more focused technical treatment of that RF- or communications-specific boundary. This document provides the wider profile context and should not duplicate detailed material unnecessarily.</t><t>Where a profile addresses a consequence boundary outside that focused NTN/RF scope, this document provides the domain-specific problem statement and execution-finality mapping.</t><section anchor="relationship-ntn-rf-corrections"><name>Correction, Consolidation, and Modification Invited</name><t>The separation between the two documents is intended to improve technical clarity rather than multiply specifications unnecessarily.</t><t>Readers are expressly invited to identify:</t><ul spacing="normal"><li><t>a profile in this document that is already fully and unambiguously covered by draft-das-ntn-rf-execution-finality;</t></li><li><t>an existing IETF, 3GPP, CCSDS, ETSI, ITU, space-industry, hardware, safety, or proprietary mechanism that already provides an equivalent enforcement property;</t></li><li><t>a profile whose technical distinction is too small to justify separate treatment;</t></li><li><t>an enforcement boundary that has been characterized incorrectly;</t></li><li><t>terminology that should be aligned between the documents;</t></li><li><t>profiles that should be consolidated, narrowed, expanded, relocated, or removed; or</t></li><li><t>additional technical distinctions necessary to accurately represent deployed or emerging satellite architectures.</t></li></ul><t>Such corrections and modifications are welcomed.</t><t>The objective is not to claim that existing satellite or NTN systems lack equivalent mechanisms. The objective is to identify, with sufficient technical precision, the point at which a particular prepared satellite operation becomes externally effective and to determine whether act-specific, current, machine-verifiable authority is enforced at that boundary.</t><t>These references and cross-references identify technical complementarity and possible enforcement locations; they do not imply that any named organization has reviewed, endorsed, adopted, or lacks equivalent mechanisms.</t></section></section><section anchor="public-industry-context">
          <name>Public Industry Context and Technical Complementarity</name>
          <t>These public references are included to orient the engineering discussion around capabilities that make consequence-bound authorization increasingly relevant. The references identify publicly described directions in satellite manufacturing, launch and in-space systems, orbital mobility, direct-to-device connectivity, software-defined payloads, optical inter-satellite networking, hosted payloads, onboard processing, and in-orbit servicing. They are not statements about proprietary implementation details.</t>
          <t>These references identify technical complementarity and possible enforcement locations; they do not imply that any named organization has reviewed, endorsed, adopted, or lacks equivalent mechanisms.</t>
          <t>Corrections and modifications are expressly invited. A named organization, standards participant, implementer, researcher, or other reader is encouraged to identify any inaccurate characterization, later technical change, existing equivalent or stronger mechanism, more appropriate enforcement boundary, or wording that should be narrowed, corrected, expanded, or removed. Where an equivalent mechanism exists, the most useful correction is a reference to the specific public mechanism and an explanation of where the equivalent of the Candidate Act, Non-Effective State, act-bound validation evidence or authority, Finality Sink, and alternate-path closure occurs.</t>
          <t>This industry-context discussion is technical rather than legal. It does not state or imply patent infringement, patent essentiality, freedom-to-operate status, novelty, inventive step, validity, enforceability, or a legal prior-art conclusion. Patent and standards-IPR questions are governed by their applicable legal and procedural frameworks independently of these engineering references.</t>
          <section anchor="company-spacex-starlink">
            <name>SpaceX / Starlink</name>
            <t>SpaceX publicly describes Starlink Direct to Cell satellites as regenerative cellular infrastructure using onboard eNodeB functionality, phased-array antennas, and laser backhaul through the Starlink constellation. SpaceX also describes Starlink laser inter-satellite networking and future Direct to Cell generations with substantially greater beam and bandwidth capability. These directions make Profiles covering beam/RF effectuation, inter-satellite routing, onboard scheduling, partner or destination admission, autonomous orbital state, and fail-closed consequence boundaries potentially relevant as possible technical application points. Possible enforcement locations discussed by this document include RF-chain enablement, beamforming or antenna-control boundaries, optical-terminal admission, routing or packet-forwarding gates, and propulsion or attitude-control boundaries; this does not assert how SpaceX implements those functions internally. <eref target="https://starlink.com/business/direct-to-cell">Public reference</eref>.</t>
          </section>
          <section anchor="company-blue-origin">
            <name>Blue Origin</name>
            <t>Blue Origin publicly describes Blue Ring as a highly maneuverable multi-mission and multi-orbit spacecraft supporting payload hosting and deployment, onboard computing and communications, and substantial orbital maneuverability. Those capabilities create natural possible technical application points for Profiles 51, 53, 54, 56, and related orbital-compute and payload-release profiles. Potential Finality Sinks in the abstract architecture could include propulsion enablement, hosted-payload activation, onboard-compute egress, communications release, or other mandatory consequence boundaries. No assertion is made about Blue Origin's internal authorization or safety architecture. <eref target="https://www.blueorigin.com/blue-ring">Public reference</eref>.</t>
          </section>
          <section anchor="company-northrop-grumman-spacelogistics">
            <name>Northrop Grumman / SpaceLogistics</name>
            <t>Northrop Grumman publicly describes SpaceLogistics systems for mission extension and robotic in-orbit servicing, including rendezvous and proximity operations, inspection, relocation, repair, upgrades, disposal, debris-removal functions, and robotic servicing. These capabilities are technically adjacent to Profiles 52 and 53 and to act-bound propulsion, attitude, servicing-approach, payload, and irreversible mission-state controls. The document identifies possible consequence boundaries generically, such as propulsion or attitude actuation and other servicing-effectuation gates, without asserting the internal architecture of SpaceLogistics systems. <eref target="https://www.northropgrumman.com/what-we-do/space/space-logistics-services">Public reference</eref>.</t>
          </section>
          <section anchor="company-rocket-lab">
            <name>Rocket Lab</name>
            <t>Rocket Lab has publicly described spacecraft and mission capabilities including Photon-based in-space propulsion, orbit raising and hosted payload operation, and has identified programs involving rendezvous and proximity operations and an in-orbit spacecraft refueling depot. These directions provide useful technical context for orbital-maneuver, propulsion, proximity-operation, mission-state, and spacecraft-integration profiles. The present architecture does not define refueling plumbing or docking mechanics; it addresses only supported authority and effectuation boundaries such as exact maneuver release, propulsion enablement, payload or subsystem activation, and protected command execution. <eref target="https://investors.rocketlabusa.com/files/doc_financials/2024/q2/FINAL-Rocket-Lab-Q2-2024-Earnings-Presentation.pdf">Public reference</eref>.</t>
          </section>
          <section anchor="company-airbus-defence-and-space">
            <name>Airbus Defence and Space</name>
            <t>Airbus publicly describes SpaceRAN work using software-defined satellites, onboard 5G processing, inter-satellite links, routing, and beam or satellite handover, and is also developing large LEO satellite programs. These directions are technically complementary to profiles concerning onboard gNB or regenerative processing, NTN handoff, inter-satellite routing, software-defined payload state, beam control, and orbital compute or output release. Possible enforcement locations in this document include onboard routing or scheduler commits, payload-control boundaries, beam or RF effectuation points, optical-link gates, and terrestrial handoff admission. No claim is made about whether Airbus systems already provide equivalent controls. <eref target="https://www.airbus.com/en/newsroom/press-releases/2026-01-airbus-launches-demonstrator-to-test-global-5g-connectivity-in">Public reference</eref>.</t>
          </section>
          <section anchor="company-thales-alenia-space">
            <name>Thales Alenia Space</name>
            <t>Thales Alenia Space publicly describes secure digital satellite payloads and future IRIS2 payload work involving optical inter-satellite links, native 5G capability, in-orbit traffic routing, active interference management, active antennas, and software-defined processing. These directions provide technical context for optical-link establishment, wavelength or beam control, satellite user-plane forwarding, onboard network functions, secure routing, and payload reconfiguration profiles. Potential enforcement locations described here include optical-terminal or routing admission, active-antenna or RF-control boundaries, payload-processing commits, and destination or gateway admission; no statement is made about proprietary implementation details or the absence of equivalent mechanisms. <eref target="https://www.thalesgroup.com/en/news-centre/press-releases/thales-alenia-space-provide-digital-and-secure-payloads-330-iris2">Public reference</eref>.</t>
          </section>
        </section>
        <section anchor="terminology">
      <name>Terminology</name>
      <dl newline="false" spacing="normal">
        <dt>Candidate Act</dt>
        <dd>A computed, proposed, queued, routed, scheduled, recovered, or otherwise prepared operation that has not yet been permitted to cause the relevant external consequence.</dd>
        <dt>Non-Effective State</dt>
        <dd>A state in which the Candidate Act can exist or be fully prepared but cannot yet produce the protected external effect.</dd>
        <dt>Protected Enforcement Domain (PED)</dt>
        <dd>A protected hardware, firmware, operating-system, gateway, or hybrid enforcement domain that validates required predicates and protected state. It is not limited to any one TEE or HSM technology.</dd>
        <dt>Protected validation evidence</dt>
        <dd>Machine-verifiable evidence or a protected receipt committed before effectuation or atomically with release of the authority required for effectuation.</dd>
        <dt>Scoped non-bearer authority</dt>
        <dd>Authority bound to the Candidate Act, relevant state, scope, and Finality Sink such that mere possession of a detached artifact is insufficient to authorize a different effect.</dd>
        <dt>Finality Sink</dt>
        <dd>The point at or before which the protected Candidate Act first becomes externally effective. The sink can verify, reconstruct, or re-verify load-bearing state.</dd>
        <dt>External Effect</dt>
        <dd>A network, routing, radio, optical, storage, disclosure, control, model-update, subsystem-activation, or other consequence protected by the profile.</dd>
        <dt>Fail-closed</dt>
        <dd>Absence, staleness, exhaustion, revocation, mismatch, replay, or indeterminacy results in denial, continued non-effectiveness, bounded degradation, or an explicitly authorized substitute path rather than unvalidated effectuation.</dd>
      </dl>
    </section>
    <section anchor="architecture">
      <name>Execution-Finality Architecture</name>
      <t>
        The common sequence used by the profiles is shown below. Deployments can
        combine or distribute components, but the security property depends on the
        ordering rather than on a particular physical packaging.
      </t>
      <sourcecode type="text">
Candidate Act
     |
     v
Non-Effective State
     |
     v
Protected validation + protected-state checks/consumption
     |
     v
Protected validation evidence
     |
     v
Scoped non-bearer authority
     |
     v
Finality Sink verification
     |
     v
External Effect
</sourcecode>
      <t>
        The architecture intentionally separates authority to compute from authority
        to cause an effect. It can also separate authority to consume scarce compute,
        power, thermal, radio, optical, or routing resources from authority to release
        the resulting output.
      </t>
      <section anchor="requirements">
        <name>Core Enforcement Properties</name>
        <ol spacing="normal" type="1">
          <li>The consequential operation is represented as a specific Candidate Act.</li>
          <li>The Candidate Act can remain in a Non-Effective State after computation or protocol processing.</li>
          <li>Validation is bound to the act, relevant current state, intended sink, and permitted consequence scope.</li>
          <li>Freshness, revocation, replay, quota, and protected mutable state are evaluated where applicable.</li>
          <li>Protected validation evidence is committed before effectuation or atomically with authority release.</li>
          <li>The Finality Sink verifies the required authority before the protected external effect.</li>
          <li>Alternate paths to the equivalent protected effect are either covered by equivalent finality enforcement or are treated as bypasses.</li>
          <li>Emergency or disconnected operation uses explicitly bounded substitute authority rather than an unqualified fail-open path.</li>
        </ol>
      </section>
    </section>
    <section anchor="threat-model">
      <name>Satellite and NTN Threat and Failure Model</name>
      <t>
        The profiles are motivated by both adversarial and non-adversarial failure
        modes. An attacker or faulty component may be able to prepare an operation
        without being entitled to make it effective. Separately, a previously valid
        operation can become invalid because satellite state changes between
        preparation and effectuation.
      </t>
      <ul spacing="normal">
        <li>stale, replayed, substituted, or over-broad authority;</li>
        <li>compromised or buggy onboard software preparing unauthorized acts;</li>
        <li>ground-station, gateway, operator, or partner-constellation state changing after preparation;</li>
        <li>long DTN delay causing policy or revocation state to change before delivery;</li>
        <li>orbital, beam, route, service-area, jurisdiction, or spectrum state changing before effect;</li>
        <li>radiation, memory, power, thermal, or redundant-compute faults corrupting load-bearing state;</li>
        <li>model, tensor, gradient, adapter, or sensor-state crossing tenant, mission, purpose, or destination boundaries;</li>
        <li>firmware, microcode, or payload patches having broader effects than the authority used to obtain them;</li>
        <li>maintenance, debug, emergency, or break-glass functions bypassing ordinary control paths; and</li>
        <li>alternate output, routing, RF, optical, storage, or API paths bypassing the intended enforcement point.</li>
      </ul>
      <t>
        The architecture assumes that at least one protected enforcement path and the
        cryptographic or hardware roots on which it relies remain trustworthy. A
        complete compromise of every relevant Finality Sink or its root of trust is
        outside the guarantee of this architecture and must be addressed by platform,
        supply-chain, redundancy, and recovery controls.
      </t>
    </section>
    <section anchor="existing-tech">
      <name>Relationship to Existing Technologies and Standards</name>
      <t>
        The technologies below are complementary. Their inclusion does not imply
        endorsement of this proposal, that the proposal is within a particular
        Working Group charter, or that equivalent functionality is absent from
        existing specifications. Corrections identifying an existing equivalent are
        specifically requested.
      </t>
      <table>
        <name>Existing technology and the additional finality question</name>
        <thead>
          <tr>
            <th>Technology / work</th>
            <th>Primary role</th>
            <th>Execution-finality question</th>
          </tr>
        </thead>
        <tbody>
          <tr>
            <td>3GPP NTN <xref target="TGPP-TR-38.821"/>
            </td>
            <td>Radio access, mobility, service and user/control-plane procedures</td>
            <td>May this specific scheduled, routed, handed-over, or radiative act become effective now?</td>
          </tr>
          <tr>
            <td>IETF TVR <xref target="TVR-WG"/>
              <xref target="RFC9657"/>
            </td>
            <td>Time-varying topology and scheduled routing attributes, with NTN as a main driver</td>
            <td>Does an available or predicted path also carry authority for this Candidate Act and consequence?</td>
          </tr>
          <tr>
            <td>IETF DTN / BPv7 <xref target="DTN-WG"/>
              <xref target="RFC9171"/>
              <xref target="RFC9172"/>
            </td>
            <td>Communication under delay and disruption, storage and forwarding</td>
            <td>When connectivity returns, is previously accepted traffic still authorized to be released?</td>
          </tr>
          <tr>
            <td>IETF RATS <xref target="RATS-WG"/>
              <xref target="RFC9334"/>
            </td>
            <td>Evidence, appraisal and Attestation Results concerning system components</td>
            <td>Does trustworthy component state authorize this particular output or operation to cross the effect boundary?</td>
          </tr>
          <tr>
            <td>IETF ACE <xref target="ACE-WG"/>
              <xref target="RFC9200"/>
            </td>
            <td>Authentication and authorization for constrained environments</td>
            <td>Is the grant bound to the exact consequence, current state, and Finality Sink rather than merely resource access?</td>
          </tr>
          <tr>
            <td>IETF SUIT <xref target="SUIT-WG"/>
              <xref target="RFC9019"/>
            </td>
            <td>Secure firmware-update architecture and manifests</td>
            <td>After an update is obtained or verified, when may it become active and cause subsystem effects?</td>
          </tr>
          <tr>
            <td>IETF CCAMP <xref target="CCAMP-WG"/>
            </td>
            <td>Control and measurement for optical and other non-packet technologies</td>
            <td>May the particular optical path, retune, or emission become effective under current act-bound authority?</td>
          </tr>
          <tr>
            <td>TEEP architecture <xref target="TEEP-WG"/>
              <xref target="RFC9397"/>
            </td>
            <td>Provisioning and management of trusted applications in TEEs</td>
            <td>Can protected execution be used as an enforcement location without equating TEE presence with release authority?</td>
          </tr>
          <tr>
            <td>Spacecraft FDIR</td>
            <td>Fault detection, isolation, recovery, redundancy, safe mode and subsystem restoration</td>
            <td>After recovery succeeds, which consequential outputs or subsystem re-enables may become effective?</td>
          </tr>
          <tr>
            <td>Cryptographic authentication and secure channels</td>
            <td>Identity, integrity, origin authentication and confidentiality</td>
            <td>Is this authenticated operation presently authorized for this consequence?</td>
          </tr>
        </tbody>
      </table>
      <section anchor="ietf-relevance">
        <name>Relevance to IETF Working Groups and Areas</name>
        <t>
          The proposal is cross-area and is not presented as work already belonging
          to one Working Group. The strongest technical intersections are TVR for
          time-varying satellite path state, DTN for delayed release and
          store-and-forward, and RATS for trustworthy evidence used as a predicate.
          ACE is relevant to constrained authorization semantics; SUIT is relevant to
          update distribution and activation; CCAMP is relevant where optical
          control-plane abstractions intersect with the optical consequence boundary.
          TEEP has concluded, but its architecture remains relevant where a TEE is an
          implementation option for a Protected Enforcement Domain.
        </t>
        <t>
          Radio-layer, bearer, mobility, beam, and other NTN procedure design remains
          primarily a 3GPP matter. Spacecraft FDIR, flight software, safety, spectrum,
          and mission-control requirements also involve standards and operational
          communities outside the IETF. The IETF-relevant question is the protocol
          and authorization property at boundaries where networked state becomes a
          consequential act.
        </t>
      </section>
      <section anchor="equivalence-test">
        <name>Correction Invited and Equivalence Test</name>
        <t>
          Readers are expressly invited to identify an existing standard, protocol,
          architecture, implementation, or prior work that already provides an
          equivalent property for any profile. A useful correction should identify
          where the equivalent mechanism provides all of the following, or explain
          which property is unnecessary in that domain:
        </t>
        <ol spacing="normal" type="1">
          <li>a specific consequence-bearing act can remain technically non-effective after computation or protocol processing;</li>
          <li>authority is bound to that act, the relevant current state, and the intended consequence boundary;</li>
          <li>required validation evidence exists before effectuation or atomically with the authority that enables it;</li>
          <li>verification occurs at or before the actual external-effect boundary; and</li>
          <li>an alternate path cannot produce the equivalent protected effect while bypassing that verification.</li>
        </ol>
        <t>
          The purpose of this equivalence test is not to assume that existing mechanisms are
          deficient. It is to make the claimed boundary precise enough that overlap,
          equivalence, or technical difference can be tested rather than asserted.
        </t>
      </section>
    </section>
    <section anchor="companion-resources">
      <name>Companion Public Resources and Related Internet-Drafts</name>
      <t>
        This section lists public materials that apply the same execution-finality
        architecture to closely related satellite, telecommunications, hardware,
        attestation, and regulatory contexts. These materials are informative only.
        They are not prerequisites for implementing or evaluating this document, and
        their inclusion does not incorporate their requirements into this document.
      </t>
      <section anchor="related-ietf-drafts">
        <name>Related IETF Internet-Drafts</name>
        <t>
          The most directly related companion document is
          <xref target="DAS-NTN-RF"/>, which applies execution finality to LEO/NTN RF
          transmission, beam control, and inter-satellite operation. The broader
          telecommunications relationship is developed in <xref target="DAS-6G-ORAN"/>.
          Attestation as an input to act-specific finality is developed in
          <xref target="DAS-RATS-EF"/>, while the hardware-rooted and general protocol
          formulations are described in <xref target="DAS-HW-EF"/> and
          <xref target="DAS-PROTOCOL-LAYER"/> respectively.
        </t>
        <t>
          The policy-to-enforcement distinction discussed in this document is further
          explored in <xref target="DAS-EU-AI-ACT"/>, and cross-jurisdiction authority
          separation is discussed in <xref target="DAS-DIGITAL-SOV"/>. All of these
          documents are Internet-Drafts and therefore works in progress that may be
          updated, replaced, or obsoleted.
        </t>
      </section>
      <section anchor="github-implementations">
        <name>GitHub Reference Implementations</name>
        <t>
          A satellite-specific runnable implementation is published as
          <xref target="DAS-NTN-IMPL"/>. Closely related implementations cover
          AI-native 5G/6G and O-RAN <xref target="DAS-6G-ORAN-IMPL"/>, GPU and AI
          accelerator finality <xref target="DAS-GPU-IMPL"/>, hardware-rooted
          execution finality <xref target="DAS-HW-IMPL"/>, and technical enforcement
          for AI-governance constraints <xref target="DAS-AI-GOV-IMPL"/>.
        </t>
        <t>
          These repositories are provided for engineering review, experimentation,
          interoperability discussion, and reproducibility. They are not production
          certifications, satellite flight software, regulatory compliance
          certifications, or normative dependencies of this document.
        </t>
      </section>
      <section anchor="zenodo-resources">
        <name>Zenodo Technical Background and Archived Material</name>
        <t>
          Broader explanatory background across AI, telecommunications, cloud,
          payments, satellite systems, and other consequence-bearing environments is
          archived in <xref target="DAS-ZENODO-FOUNDATIONAL"/>. An archived companion
          snapshot for accelerator and confidential-computing execution finality is
          available as <xref target="DAS-ZENODO-GPU"/>. Additional Candidate-Act
          architectural material is available as <xref target="DAS-ZENODO-CANDIDATE"/>.
        </t>
        <t>
          These records provide supplementary context and archival stability. The
          architecture and profiles in this Internet-Draft are intended to remain
          understandable independently of those external materials.
        </t>
      </section>
    </section>
    <section anchor="patent-family-transparency">
      <name>Additional Patent-Family Disclosure for Technical Transparency</name>
      <t>
        This section is provided solely for technical-source transparency, provenance,
        and easier review of the public and author-disclosed disclosure trail from which
        portions of the terminology, consequence-boundary catalogue, and implementation
        examples in this document were developed. Inclusion of an application in this
        section is not an assertion that any patent claim is granted, valid, enforceable,
        infringed, essential to an IETF standard, or required to implement this document.
        It also does not imply review, approval, endorsement, or participation by WIPO,
        the Indian Patent Office, the IETF, any government, standards body, satellite
        operator, equipment vendor, or other industry participant.
      </t>
      <t>
        This informational list is not intended to satisfy, replace, interpret, or alter
        any separate disclosure obligation that may arise under
        <eref target="https://www.rfc-editor.org/info/rfc8179">RFC 8179 / BCP 79</eref>.
        Where an IETF IPR disclosure is required, it should be made through the
        <eref target="https://datatracker.ietf.org/ipr/">IETF IPR disclosure process</eref>.
      </t>
      <section anchor="wipo-pct-transparency">
        <name>WIPO/PCT Application Disclosure Trail</name>
        <t>
          The principal published WIPO record identified by the author is
          <eref target="https://patentscope.wipo.int/search/en/detail.jsf?docId=WO2026150382">
          WO 2026/150382 / PCT/IB2026/055615 — THE DAS PROTOCOLS</eref>.
          The author identifies that specification as the principal broad technical
          disclosure underlying the execution-finality architecture discussed here.
          The Mothership publication alone comprises approximately 8,598 pages of
          technical disclosure, independently of the related follow-on PCT applications
          and Indian provisional applications identified below.
        </t>
        <t>
          The following related PCT application identifiers are listed for technical
          transparency. Filing dates are reproduced where they are present in the
          author's cross-reference materials; the authoritative bibliographic, publication,
          priority, and legal status of each application remains the applicable WIPO record.
        </t>
        <ul spacing="normal">
          <li>
            <t>PCT/IB2026/053385 — filed 7 April 2026</t>
          </li>
          <li>
            <t>PCT/IB2026/054453 — filed 5 May 2026</t>
          </li>
          <li>
            <t>PCT/IB2026/055615 — filed 4 June 2026</t>
          </li>
          <li>
            <t>PCT/IB2026/055760 — filed 7 June 2026</t>
          </li>
          <li>
            <t>PCT/IB2026/055870 — filed 10 June 2026</t>
          </li>
          <li>
            <t>PCT/IB2026/056058 — filed 13 June 2026</t>
          </li>
          <li>
            <t>PCT/IB2026/056353 — filed 22 June 2026</t>
          </li>
          <li>
            <t>PCT/IB2026/056571 — filed 26 June 2026</t>
          </li>
          <li>
            <t>PCT/IB2026/056771 — filed 1 July 2026</t>
          </li>
          <li>
            <t>PCT/IB2026/056809 — filed 1 July 2026</t>
          </li>
          <li>
            <t>PCT/IB2026/056941 — filed 6 July 2026</t>
          </li>
          <li>
            <t>PCT/IB2026/057198 — filed 12 July 2026</t>
          </li>
          <li>
            <t>PCT/IB2026/057540 — filed 19 July 2026</t>
          </li>
          <li>
            <t>PCT/IB2026/058236</t>
          </li>
        </ul>
        <t>
          The list is a technical cross-reference only. It does not state that every
          listed application has been published, that every application claims priority
          to every other application, or that all subject matter in this Internet-Draft
          is entitled to any particular priority date. Readers should consult WIPO
          PATENTSCOPE and the official file of the relevant application for the formal
          record.
        </t>
      </section>
      <section anchor="india-provisional-transparency">
        <name>Indian Provisional Application Disclosure Trail</name>
        <t>
          The author has identified the following 32 Indian patent applications as
          provisional applications related to the broader technical disclosure. Some
          provisional filings may not themselves be publicly accessible; the identifiers
          and filing dates are included here because the author has elected to disclose
          them for transparency and technical provenance.
        </t>
        <ul spacing="compact">
          <li>
            <t>Indian Patent Application No. 202531123959 — filed 9 December 2025</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202531123977 — filed 9 December 2025</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202531125643 — filed 12 December 2025</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202531129538 — filed 20 December 2025</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202531130168 — filed 22 December 2025</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202531130665 — filed 23 December 2025</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631000572 — filed 3 January 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631001586 — filed 7 January 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631002990 — filed 12 January 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631004331 — filed 16 January 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631005583 — filed 20 January 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631005645 — filed 20 January 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631006616 — filed 22 January 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631007467 — filed 26 January 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631009579 — filed 30 January 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631011216 — filed 3 February 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631011630 — filed 3 February 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631016797 — filed 16 February 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631018571 — filed 18 February 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631024957 — filed 3 March 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631030760 — filed 14 March 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631034260 — filed 21 March 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631035846 — filed 24 March 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631038227 — filed 27 March 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631041923 — filed 1 April 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631043195 — filed 4 April 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631043507 — filed 6 April 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631046689 — filed 11 April 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631046739 — filed 12 April 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631047382 — filed 14 April 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631049021 — filed 17 April 2026</t>
          </li>
          <li>
            <t>Indian Patent Application No. 202631051652 — filed 23 April 2026</t>
          </li>
        </ul>
        <t>
          Identification of an Indian application in this section is not intended, by
          itself, to create, add, correct, modify, or establish a priority claim. Any
          priority relationship exists only to the extent validly and expressly reflected
          in the applicable Request, priority declaration, or other official filing record.
        </t>
      </section>
      <section anchor="patent-status-separation">
        <name>Separation of Technical Disclosure from Patent Status</name>
        <t>
          This Internet-Draft uses the listed patent-family material only as an additional
          technical-disclosure trail. The architecture, terminology, and Enforcement
          Profiles in this document are presented for engineering review independently of
          the outcome of examination, search, prosecution, grant, national-phase entry,
          abandonment, amendment, licensing, or enforcement of any listed application.
        </t>
        <t>
          For formal bibliographic data, publication status, priority information,
          applicant or inventor data, national-phase status, and the complete legal record,
          readers should consult WIPO PATENTSCOPE and the relevant national patent-office
          records rather than relying on this informational summary.
        </t>
      </section>
    </section>
    <section anchor="profiles">
      <name>Satellite and NTN Enforcement Profiles</name>
      <t>
        The following sixty profiles instantiate the same execution-finality
        invariant at different consequence boundaries. They are not sixty separate
        protocol principles. Several profiles are deliberate decompositions or
        technically distinct combinations of broader source mechanisms so that each
        problem and sink can be reviewed independently.
      </t>
      <section anchor="sovereignty">
        <name>Sovereignty, Cross-Border Handoff, and Gateway Profiles</name>
        <!-- drafting traceability: source disclosure claim(s) 16 -->
        <section anchor="profile-01">
          <name>Profile 1: Satellite and NTN Sovereignty Finality</name>
          <t>
            <strong>Problem space.</strong> A satellite link can be authenticated, routable, and physically available while the contemplated downlink, uplink, beam, relay, or cross-border event is inconsistent with the current orbital, beam, spectrum, gateway, or jurisdictional state.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is the proposed satellite transmission, payload disclosure, beam activation, beam-steering operation, relay, feeder-link transmission, or cross-border communication event. It remains in a Non-Effective State until the Protected Enforcement Domain validates authenticated ephemeris or orbital state, beam geometry and coverage state, applicable jurisdiction or spectrum policy, gateway or cross-border authority, freshness, and revocation state; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the gateway earth station, payload controller, inter-satellite routing switch, phase-shifter or beamforming controller, RF-chain interface, power-amplifier bias gate, terminal controller, or NTN routing component. The relevant operation remains non-effective rather than becoming radiative-, routing-, disclosure-, or network-effective.</t>
          <t>
            <strong>Relationship to existing technology.</strong> 3GPP NTN and routing mechanisms remain responsible for radio and network procedures; execution finality adds an act-specific consequence boundary. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 16, 139 -->
        <section anchor="profile-02">
          <name>Profile 2: Cross-Border Downlink and Terrestrial Sovereign-Ingress Finality</name>
          <t>
            <strong>Problem space.</strong> An orbital compute or payload system may possess a valid space-to-earth path even when the destination jurisdiction, data-residency scope, policy epoch, or terrestrial-ingestion authority has changed since computation began.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is the downlink, terrestrial ingestion, cross-border routing, storage, exposure, or application of an orbital output. It remains in a Non-Effective State until the Protected Enforcement Domain validates destination-jurisdiction policy, permitted ingestion scope, path and gateway identity, policy and revocation epochs, freshness, nonce state, and any applicable orbital-compute attestation result; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the space-to-earth receiver output, NTN core or sovereign gateway, protected terrestrial-handoff boundary, or destination admission interface. Path availability alone cannot cause the orbital output to become effective in terrestrial infrastructure.</t>
          <t>
            <strong>Relationship to existing technology.</strong> TVR or other routing information may establish path state, while RATS may contribute platform evidence; neither is treated here as blanket release authority. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 30 -->
        <section anchor="profile-03">
          <name>Profile 3: NTN Terrestrial-Satellite Mobility and Handover Finality</name>
          <t>
            <strong>Problem space.</strong> A valid mobility or handover procedure can identify a technically reachable terrestrial or satellite domain without necessarily establishing current authority for the exact cross-domain transition.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is NTN cell activation, handover, satellite-to-terrestrial re-entry, gateway switching, beam-footprint update, or other mobility event. It remains in a Non-Effective State until the Protected Enforcement Domain validates ephemeris and coverage state, feeder- or service-link authority, terrestrial interworking authority, security association, policy epoch, descriptor binding, freshness, and revocation state; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the NTN mobility function, gateway switch, payload controller, feeder- or service-link controller, beam controller, or protected effectuation component. The handover or re-entry remains non-effective when the current authority state does not match the Candidate Act.</t>
          <t>
            <strong>Relationship to existing technology.</strong> This profile complements 3GPP NTN mobility and interworking procedures rather than redefining them. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 16, 30 -->
        <section anchor="profile-04">
          <name>Profile 4: Beam-Footprint and Jurisdiction-Mapping Finality</name>
          <t>
            <strong>Problem space.</strong> Beam geometry and satellite motion can change the set of geographic or jurisdictional regions affected by an otherwise valid radio operation. A previously acceptable beam decision can therefore become stale before radiation.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is activation, steering, retargeting, or footprint modification of an NTN or satellite beam. It remains in a Non-Effective State until the Protected Enforcement Domain validates current orbital and beam state, terminal or coverage state, jurisdiction mapping, spectrum policy, permitted service area, policy epoch, freshness, and revocation state; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the beam controller, phase-shifter array controller, RF-chain enable point, power-amplifier bias gate, or equivalent radiative boundary. No RF or beam effect occurs when the bound beam, geographic scope, or policy state no longer validates.</t>
          <t>
            <strong>Relationship to existing technology.</strong> Radio resource and beamforming procedures remain a 3GPP or implementation matter; this profile addresses authority immediately before the physical effect. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 16, 30 -->
        <section anchor="profile-05">
          <name>Profile 5: Gateway, Feeder-Link, and Service-Link Effectuation Finality</name>
          <t>
            <strong>Problem space.</strong> Gateway authorization, service-link state, feeder-link state, and routing decisions can be valid independently, yet the combined operation may cross an operator, security, mission, or sovereign boundary.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is feeder-link transmission, service-link transmission, gateway switching, satellite relay, or payload forwarding. It remains in a Non-Effective State until the Protected Enforcement Domain validates gateway identity and authorization, link authorization, route authority, policy epoch, security association, freshness, revocation, and descriptor binding; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the feeder-link controller, service-link controller, gateway switch, payload routing component, earth station, or protected link-effectuation interface. The link operation is denied or retained in a non-effective state until the exact link and gateway scope validates.</t>
          <t>
            <strong>Relationship to existing technology.</strong> Existing link and gateway protocols provide connectivity; the added property is consequence-bound release. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
      </section>
      <section anchor="orbital-ai">
        <name>Orbital AI, Model State, Earth Observation, and Compute Profiles</name>
        <!-- drafting traceability: source disclosure claim(s) 157 -->
        <section anchor="profile-06">
          <name>Profile 6: Orbital AI Inference-Output Release Finality</name>
          <t>
            <strong>Problem space.</strong> An onboard GPU, NPU, tensor accelerator, inference engine, or AI payload may successfully produce an output even though current authority to release that output to a destination is absent, stale, revoked, or narrower than the computation authority.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is release, storage, routing, downlink, external API publication, or downstream delivery of an orbital inference output. It remains in a Non-Effective State until the Protected Enforcement Domain validates satellite, payload, accelerator, model and session identity; model version or checkpoint; input and output classes; destination; mission state; provenance; policy epoch; freshness; and revocation state; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the onboard output buffer, payload release gate, storage-commit interface, RF or optical downlink, ISL interface, ground delivery interface, orbital-cloud API, or destination admission interface. Successful inference does not itself cause output release.</t>
          <t>
            <strong>Relationship to existing technology.</strong> RATS-style attestation can provide execution evidence; this profile treats that evidence as an input to an act-bound release decision. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 162 -->
        <section anchor="profile-07">
          <name>Profile 7: Ground-Station and Orbital-Cloud API Response Finality</name>
          <t>
            <strong>Problem space.</strong> A satellite or orbital-cloud service can successfully compute a response while the response destination, caller scope, data class, service state, or terrestrial admission authority does not permit disclosure.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is generation, return, relay, publication, or delivery of a response from an orbital cloud, satellite API, ground-station relay API, payload service, or inference endpoint. It remains in a Non-Effective State until the Protected Enforcement Domain validates service and caller scope, output class, destination, applicable routing and policy state, freshness, revocation, and protected response-binding state; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the API response gate, relay or gateway output, RF or optical downlink, ISL, terrestrial cloud ingress, or destination admission interface. The API operation can complete internally while the response remains non-effective externally.</t>
          <t>
            <strong>Relationship to existing technology.</strong> HTTP or service authentication can identify endpoints; execution finality determines whether the particular response may cross the release boundary. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 139, 157 -->
        <section anchor="profile-08">
          <name>Profile 8: Space-to-Earth AI Sovereign Handoff Finality</name>
          <t>
            <strong>Problem space.</strong> Orbital AI processing can occur outside the jurisdiction in which an inference result, model state, or processed data will eventually be used. Link security does not itself settle whether the terrestrial destination may ingest the result.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is terrestrial handoff of an AI inference result, model weight, gradient, or processed data product. It remains in a Non-Effective State until the Protected Enforcement Domain validates orbital-compute identity or attestation, destination sovereign policy, data-residency or ingestion scope, route and gateway, policy epoch, revocation epoch, nonce, and freshness; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the satellite-gateway inference-ingestion boundary, space-to-earth receiver output, protected terrestrial handoff, or destination admission gate. The result cannot be admitted, stored, exposed, routed onward, or applied unless the handoff authority validates.</t>
          <t>
            <strong>Relationship to existing technology.</strong> This profile is complementary to RATS and NTN routing: trustworthy source state and a valid path are predicates, not the final release decision. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 158 -->
        <section anchor="profile-09">
          <name>Profile 9: Inter-Satellite Tensor Transfer Finality</name>
          <t>
            <strong>Problem space.</strong> Intermediate tensor, activation, embedding, or hidden-state data can be technically routable between satellites even when the destination workload, mission, tenant, route, or transfer window is not authorized for that state.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is transfer, routing, replication, sharding, synchronization, migration, or delivery of tensor or activation state over an inter-satellite link. It remains in a Non-Effective State until the Protected Enforcement Domain validates source and destination satellite identity, link endpoint, tensor class, model and workload identity, partition, transfer window, permitted route, tenant or mission scope, freshness, revocation, and receipt-chain state; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the optical terminal, RF ISL modem, tensor serializer, routing controller, destination tensor-ingress gate, or orbital compute-fabric interface. The intermediate state remains non-effective at the destination when the exact transfer scope fails validation.</t>
          <t>
            <strong>Relationship to existing technology.</strong> Optical or RF ISL protocols establish transport; this profile governs admission of the specific AI state carried by that transport. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 158 -->
        <section anchor="profile-10">
          <name>Profile 10: Inter-Satellite KV-Cache and Hidden-State Finality</name>
          <t>
            <strong>Problem space.</strong> Distributed inference may move key-value cache, hidden state, embeddings, or other model context between orbital nodes. Such state can disclose context or expand execution authority if accepted outside its bound workload or mission.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is delivery or migration of KV cache, hidden state, embeddings, activation state, or intermediate AI context to another orbital compute node. It remains in a Non-Effective State until the Protected Enforcement Domain validates source workload, destination workload, model version, session or partition, tenant and mission isolation, route, transfer window, freshness, revocation, and destination admission state; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the model-state transfer gate, destination tensor or context ingress, accelerator admission boundary, or orbital compute-fabric interface. Possession of transported context does not by itself make that context admissible to the receiving model or accelerator.</t>
          <t>
            <strong>Relationship to existing technology.</strong> This is an application-state admission profile layered above the underlying inter-satellite transport. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 158 -->
        <section anchor="profile-11">
          <name>Profile 11: Orbital Model-Weight and Checkpoint Migration Finality</name>
          <t>
            <strong>Problem space.</strong> Model weights, checkpoints, optimizer state, and adapter state may need to move between orbital nodes for resilience or distributed compute. A technically valid transfer can still target an unauthorized model, partition, tenant, or mission.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is replication, synchronization, migration, or delivery of model weights, checkpoints, optimizer state, adapter state, or other model state between satellites. It remains in a Non-Effective State until the Protected Enforcement Domain validates source and destination identity, model and version, checkpoint digest, partition and workload scope, route, transfer window, destination admission, freshness, revocation, and protected receipt-chain state; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the model-state serializer, ISL egress, destination model-store ingress, accelerator admission gate, or orbital compute-fabric interface. Transferred model state cannot become active or accepted at the destination without matching authority.</t>
          <t>
            <strong>Relationship to existing technology.</strong> The profile does not replace model distribution or storage protocols; it adds destination-bound activation/admission finality. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 159, 197 -->
        <section anchor="profile-12">
          <name>Profile 12: Orbital Training-Shard and Gradient-Release Finality</name>
          <t>
            <strong>Problem space.</strong> Distributed or federated orbital learning can create gradients, model deltas, training shards, optimizer updates, or learned representations that are technically transferable before their provenance, privacy, mission, or aggregation scope has been established.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is release, aggregation, transmission, storage, synchronization, or admission of a training shard, gradient, model delta, federated-learning update, optimizer update, or learned representation. It remains in a Non-Effective State until the Protected Enforcement Domain validates training job and model identity, source and destination, data and update class, provenance, privacy or no-raw-export conditions, aggregation scope, poisoning or anomaly state, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the gradient or model-delta release gate, orbital or ground aggregator ingress, ISL, downlink, training commit, or model-update interface. A computed training contribution remains non-effective until its release and aggregation scope validates.</t>
          <t>
            <strong>Relationship to existing technology.</strong> Federated-learning algorithms determine how updates are computed; execution finality determines whether the particular update may leave or enter a protected training boundary. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 198 -->
        <section anchor="profile-13">
          <name>Profile 13: Satellite LoRA and Adapter-Update Activation Finality</name>
          <t>
            <strong>Problem space.</strong> A low-rank adaptation or other adapter can be validly stored or transmitted yet unauthorized for a particular satellite, mission, tenant, model, runtime, or time window.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is generation, loading, transmission, admission, merge, activation, application, export, revocation, or disabling of a LoRA or other model adapter. It remains in a Non-Effective State until the Protected Enforcement Domain validates adapter identity and digest, base-model identity, mission or tenant scope, destination runtime, activation or merge scope, policy epoch, freshness, revocation, and protected update state; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the adapter release gate, model-store ingress, merge gate, runtime admission point, parameter-update interface, ISL, or ground aggregator. The adapter cannot alter effective model behavior merely because the artifact is present or cryptographically valid.</t>
          <t>
            <strong>Relationship to existing technology.</strong> Software-update or model-management mechanisms remain responsible for distribution; this profile adds bounded model-behavior activation. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 199 -->
        <section anchor="profile-14">
          <name>Profile 14: Sensor-Origin Provenance Admission Finality</name>
          <t>
            <strong>Problem space.</strong> Earth-observation, RF, optical, SAR, hyperspectral, thermal, maritime, weather, or telemetry data may be authentic yet unsuitable for a particular model-update, training, aggregation, or downstream-use scope.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is admission or use of sensor-origin data, features, or derived representations in training, model update, aggregation, storage, downlink, or runtime processing. It remains in a Non-Effective State until the Protected Enforcement Domain validates sensor identity and origin, capture time, spatial region, data class, model identity, permitted use, provenance chain, policy epoch, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the sensor-data admission gate, feature ingress, training or model-update boundary, product-release gate, store, downlink, or ground aggregator. Authentic sensor data remains non-effective for the new use until provenance and permitted-use predicates validate.</t>
          <t>
            <strong>Relationship to existing technology.</strong> Provenance mechanisms provide evidence; this profile binds that evidence to a concrete admission or release consequence. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 200 -->
        <section anchor="profile-15">
          <name>Profile 15: Poisoning-Risk and Quarantine Finality</name>
          <t>
            <strong>Problem space.</strong> A training contribution, gradient, sensor feature, checkpoint, adapter, or model delta may exhibit poisoning, anomaly, drift, adversarial, Byzantine, or compromised-source indicators after it has already entered an orbital learning workflow.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is admission, exclusion, quarantine, unquarantine, down-weighting, rejection, retraining, storage, transmission, aggregation, or merge of a suspect contribution. It remains in a Non-Effective State until the Protected Enforcement Domain validates source and contribution identity, anomaly or poisoning evidence, quarantine state, permitted weighting or use, model and training scope, policy epoch, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the training-admission gate, quarantine store, gradient or model-update gate, adapter merge, model store, downlink, or ground-aggregator interface. Suspect state cannot become effective in a model update merely because processing has completed.</t>
          <t>
            <strong>Relationship to existing technology.</strong> Detection systems can supply risk evidence; execution finality governs whether the flagged artifact crosses the model-update consequence boundary. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 201 -->
        <section anchor="profile-16">
          <name>Profile 16: Ground-Aggregator Model-Update Admission Finality</name>
          <t>
            <strong>Problem space.</strong> A terrestrial aggregator may receive multiple valid orbital updates whose provenance, quarantine status, aggregation policy, merge scope, or destination model do not all authorize application to the ground model.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is admission, aggregation, merge, application, storage, routing, rejection, or publication of orbital model updates at a ground or cloud coordinator. It remains in a Non-Effective State until the Protected Enforcement Domain validates source provenance receipts, poisoning and quarantine receipts, aggregation policy, model and checkpoint identity, merge scope, destination runtime, policy epoch, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the ground aggregator, federated-learning aggregation boundary, model or adapter merge gate, model registry, checkpoint store, or serving-runtime admission point. Receipt of an update does not make the update effective in the terrestrial model.</t>
          <t>
            <strong>Relationship to existing technology.</strong> The profile complements federated aggregation and model registries by adding a final act-bound admission check. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 160 -->
        <section anchor="profile-17">
          <name>Profile 17: Earth-Observation AI Product Release Finality</name>
          <t>
            <strong>Problem space.</strong> An Earth-observation AI system may validly derive a geospatial or sensor product while disclosure is restricted by spatial region, resolution, recipient, purpose, embargo, mission, or emergency conditions.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is release, downlink, publication, storage, API delivery, marketplace delivery, or emergency delivery of an Earth-observation AI product. It remains in a Non-Effective State until the Protected Enforcement Domain validates sensor provenance, observation time, spatial region, resolution, product and model identity, destination, purpose, restricted-area or embargo state, policy epoch, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the product-release gate, satellite store, API, RF or optical downlink, marketplace interface, emergency delivery interface, or destination admission gate. A successfully generated geospatial product remains non-effective until the permitted release scope is validated.</t>
          <t>
            <strong>Relationship to existing technology.</strong> This profile does not define Earth-observation policy; it supplies a boundary at which machine-verifiable release policy can be enforced. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 160 -->
        <section anchor="profile-18">
          <name>Profile 18: Earth-Observation Resolution and Purpose-Bounded Disclosure Finality</name>
          <t>
            <strong>Problem space.</strong> The same Earth-observation source can support outputs at different resolution, geographic coverage, or purpose. A general authorization to process imagery does not necessarily authorize every derived precision or recipient.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is release of an EO-derived output at a particular resolution, region, product class, destination, or use purpose. It remains in a Non-Effective State until the Protected Enforcement Domain validates source provenance, observation and region binding, permitted resolution or product class, purpose and destination scope, restricted-area state, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the product formatter or release gate, API output, store commit, downlink interface, marketplace boundary, or destination admission point. The system can compute a higher-resolution or differently purposed result without making that result externally releasable.</t>
          <t>
            <strong>Relationship to existing technology.</strong> This is a precision- and purpose-bound specialization of the EO release profile rather than a replacement for sensor or analytics standards. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 161 -->
        <section anchor="profile-19">
          <name>Profile 19: Solar-Power, Battery, Thermal-Window, and Compute-Scheduling Finality</name>
          <t>
            <strong>Problem space.</strong> Orbital compute availability varies with solar generation, battery state, eclipse, thermal conditions, radiation state, communications windows, payload duty cycle, and mission priority. A queued workload can be computationally valid but unsafe or unauthorized to launch under the current resource state.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is scheduling, activation, throttling, suspension, migration, prioritization, or allocation of an onboard AI or general compute workload. It remains in a Non-Effective State until the Protected Enforcement Domain validates workload identity, requested compute window, power and battery state, thermal state, eclipse state, communication window, mission priority, affected subsystem, quota, policy epoch, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the workload-admission point, accelerator scheduler, payload compute allocator, power controller, thermal controller, accelerator partition, clock-enable, or reset-release boundary. The workload remains non-effective with respect to high-energy compute when the authorized resource envelope is unavailable.</t>
          <t>
            <strong>Relationship to existing technology.</strong> Existing schedulers optimize resources; execution finality makes the permission to consume the bounded resource state explicit. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 161 -->
        <section anchor="profile-20">
          <name>Profile 20: Power-Budgeted Orbital Compute Admission Finality</name>
          <t>
            <strong>Problem space.</strong> An orbital workload can pass ordinary scheduling checks yet exceed the power, battery, thermal, or mission budget that is currently authorized for that workload class.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is admission or continuation of a compute job that would consume protected processor, GPU, NPU, memory, or payload energy resources. It remains in a Non-Effective State until the Protected Enforcement Domain validates workload and accelerator identity, authorized compute window, power or battery envelope, thermal limit, mission priority, quota or counter state, policy epoch, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the compute-job launch gate, accelerator scheduler, power-domain enable, thermal controller, payload compute allocator, or accelerator partition admission boundary. The expensive compute path is not entered, or is bounded or suspended, when the current resource authority is absent or exhausted.</t>
          <t>
            <strong>Relationship to existing technology.</strong> This profile is about authority to consume orbital compute resources; it does not replace energy-efficiency scheduling algorithms. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 161 -->
        <section anchor="profile-21">
          <name>Profile 21: Accelerator Launch, Partition, and Clock-Enable Finality</name>
          <t>
            <strong>Problem space.</strong> Low-level accelerator enablement can make a prepared workload physically effective before higher-layer software notices that mission, quota, thermal, or resource authority has changed.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is launch of an accelerator job, enablement of an accelerator partition, release from reset, or clock/power enablement for a bounded compute operation. It remains in a Non-Effective State until the Protected Enforcement Domain validates workload, accelerator and partition identity, mission priority, resource and thermal state, allowed compute window, quota, policy epoch, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the accelerator job-launch interface, partition-admission point, reset-release gate, clock-enable boundary, power controller, or protected scheduler. A prepared job does not become hardware-effective unless the final bound state still validates at launch.</t>
          <t>
            <strong>Relationship to existing technology.</strong> The profile places finality below or alongside the software scheduler where necessary; it does not prescribe a particular accelerator ISA or vendor design. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
      </section>
      <section anchor="resilience">
        <name>Spacecraft Hardware, Radiation, Memory, and Recovery Profiles</name>
        <!-- drafting traceability: source disclosure claim(s) 163 -->
        <section anchor="profile-22">
          <name>Profile 22: Single-Event-Upset Evidence and Recovery Finality</name>
          <t>
            <strong>Problem space.</strong> Radiation or a single-event upset can transiently corrupt processor, memory, accelerator, payload, or control state. Error detection or correction may indicate recovery without proving that every downstream consequence is safe to resume.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is release, activation, continuation, reset, recovery, rollback, quarantine exit, or output use following an SEU or related transient fault. It remains in a Non-Effective State until the Protected Enforcement Domain validates fault evidence, affected subsystem identity, corrected or recovered state, recovery mode, dependency evidence, policy epoch, freshness, revocation, and protected recovery state; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the reset-release gate, corrected-memory release, payload or accelerator output, command-continuation gate, safe-mode exit, telemetry release, or recovery activation boundary. Recovery processing may complete while the affected subsystem remains non-effective until recovery authority validates.</t>
          <t>
            <strong>Relationship to existing technology.</strong> Spacecraft FDIR remains responsible for detecting and responding to faults; execution finality governs consequential re-entry or release. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 164 -->
        <section anchor="profile-23">
          <name>Profile 23: ECC Scrub and Memory-Integrity Epoch Finality</name>
          <t>
            <strong>Problem space.</strong> ECC checks, scrubbing, refresh, repair, or radiation correction can produce a memory region that appears usable while its integrity epoch, affected data scope, downstream consumer, or recovery policy remains unresolved.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is use, release, migration, checkpointing, mirroring, externalization, or downstream processing of memory after an integrity or scrub event. It remains in a Non-Effective State until the Protected Enforcement Domain validates memory region and technology, integrity or correction evidence, memory epoch, affected workload or model state, destination, policy epoch, freshness, revocation, and protected state; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the memory read or write gate, cache or HBM aperture, checkpoint commit, DMA release, accelerator memory admission, payload memory release, or external egress boundary. Corrected memory is not automatically authorized for every downstream use.</t>
          <t>
            <strong>Relationship to existing technology.</strong> ECC and scrub mechanisms detect or repair errors; the profile determines when corrected state may regain consequential use. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 164 -->
        <section anchor="profile-24">
          <name>Profile 24: Post-Scrub Checkpoint and Memory-Externalization Finality</name>
          <t>
            <strong>Problem space.</strong> A corrected memory image, checkpoint, mirrored buffer, or recovered model state may be internally usable while externalization would propagate an uncertain or wrong recovery epoch to another subsystem or node.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is checkpoint commit, memory mirroring, migration, DMA release, storage externalization, or model-state export after memory correction. It remains in a Non-Effective State until the Protected Enforcement Domain validates memory-integrity epoch, affected region, checkpoint or buffer identity, destination, dependency receipts, recovery state, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the checkpoint-commit gate, DMA boundary, model-state export gate, external memory egress, accelerator ingress, or payload release interface. Recovered state remains local or quarantined until the exact externalization act validates.</t>
          <t>
            <strong>Relationship to existing technology.</strong> This is a propagation-control specialization of memory-integrity finality. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 165 -->
        <section anchor="profile-25">
          <name>Profile 25: Triple-Modular-Redundancy and Redundant-Vote Finality</name>
          <t>
            <strong>Problem space.</strong> A TMR, DMR, majority vote, redundant processor, sensor, accelerator, or payload controller may produce a selected result even when vote confidence, voter health, mission policy, or downstream effect authority is insufficient.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is acceptance, release, commitment, transmission, or actuation based on a redundant vote or selected redundant result. It remains in a Non-Effective State until the Protected Enforcement Domain validates redundant-source identities, vote or disagreement state, health evidence, selected output, mission and safety scope, policy epoch, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the voted-output release gate, command commit, payload-control boundary, actuator enable, RF or optical output, reset-release gate, safe-mode transition, or telemetry release. The selected vote result is not automatically allowed to cause the downstream effect.</t>
          <t>
            <strong>Relationship to existing technology.</strong> Redundancy mechanisms determine a selected result; execution finality determines whether that result may be acted upon. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 166 -->
        <section anchor="profile-26">
          <name>Profile 26: Latch-Up, Overcurrent, and Subsystem Re-Enable Finality</name>
          <t>
            <strong>Problem space.</strong> A latch-up, overcurrent, thermal event, or radiation-induced current anomaly can force isolation or power cycling. Removal of the electrical fault does not necessarily establish authority to restart the affected subsystem.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is continuation, disablement, reset, power-cycle, isolation, throttling, restart, or re-enablement of an affected subsystem. It remains in a Non-Effective State until the Protected Enforcement Domain validates fault and current evidence, affected subsystem, power and thermal state, isolation state, recovery scope, dependency state, policy epoch, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the power switch, current limiter, reset gate, clock gate, isolation control, safe-mode gate, payload enable, RF or optical enable, or accelerator enable boundary. Re-enablement fails closed until the recovered electrical and mission state validates.</t>
          <t>
            <strong>Relationship to existing technology.</strong> Electrical protection and FDIR detect and isolate faults; this profile governs the consequence of returning the subsystem to service. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 166, 168, 212 -->
        <section anchor="profile-27">
          <name>Profile 27: Safe-Mode Exit and Operational Re-Entry Finality</name>
          <t>
            <strong>Problem space.</strong> Safe mode intentionally suppresses normal spacecraft functions. A command to leave safe mode can be authenticated and technically executable while dependency, fault, mission, or authorization state is still unsuitable for operational re-entry.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is safe-mode exit, subsystem activation, reset release, processor execution, payload re-enable, or return to operational mode. It remains in a Non-Effective State until the Protected Enforcement Domain validates safe-mode and fault evidence, recovery image or subsystem state, dependency receipts, mission state, override authority where applicable, policy epoch, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the safe-mode exit gate, reset-release gate, processor execution gate, payload enable, memory admission, or subsystem activation boundary. Operational effects remain blocked even after a valid command unless re-entry predicates validate.</t>
          <t>
            <strong>Relationship to existing technology.</strong> Spacecraft safe-mode procedures remain unchanged; the profile supplies an explicit final gate for effectuation. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 167 -->
        <section anchor="profile-28">
          <name>Profile 28: Radiation-Degraded Output Release Finality</name>
          <t>
            <strong>Problem space.</strong> A spacecraft may continue operating in a degraded radiation or component-health state and produce useful but lower-confidence outputs. Treating all such outputs as either fully trusted or fully unavailable can be operationally undesirable.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is release, use, downlink, storage, or downstream application of output produced under a declared degraded state. It remains in a Non-Effective State until the Protected Enforcement Domain validates affected subsystem and degradation evidence, output class, confidence or quality metric, model or computation identity, destination, permitted degraded mode, mission-risk state, policy epoch, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the output or data-release gate, inference-output gate, sensor-product gate, telemetry gate, RF or optical downlink, payload-control interface, or destination admission gate. Only outputs within the explicitly permitted degradation and confidence scope become effective.</t>
          <t>
            <strong>Relationship to existing technology.</strong> Fault detection supplies degradation evidence; the finality layer binds that evidence to the exact output and destination. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 168 -->
        <section anchor="profile-29">
          <name>Profile 29: Post-Radiation Boot, Recovery-Image, and Rollback Finality</name>
          <t>
            <strong>Problem space.</strong> After radiation, watchdog reset, memory fault, safe-mode entry, latch-up isolation, or chiplet anomaly, a subsystem may have multiple boot or rollback choices. Cryptographic image validity alone does not determine whether the chosen recovery path is presently authorized.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is boot, restart, restore, rollback, reinitialization, re-enable, or transition to operational mode. It remains in a Non-Effective State until the Protected Enforcement Domain validates target subsystem, boot stage, recovery image digest, rollback target, fault evidence, safe-mode state, dependency receipts, anti-rollback state, policy epoch, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the boot-stage selector, recovery-image selector, rollback gate, reset-release gate, safe-mode exit, processor execution, payload enable, memory admission, or subsystem activation gate. No recovered image or rollback target becomes operational unless the bound recovery act validates.</t>
          <t>
            <strong>Relationship to existing technology.</strong> Secure boot establishes image integrity and provenance; this profile adds current recovery authority and consequence-bound activation. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
      </section>
      <section anchor="optical">
        <name>Optical and Inter-Satellite Network Profiles</name>
        <!-- drafting traceability: source disclosure claim(s) 183 -->
        <section anchor="profile-30">
          <name>Profile 30: Optical Inter-Satellite Link Establishment Finality</name>
          <t>
            <strong>Problem space.</strong> Two satellites may be able to acquire, authenticate, align, and form an optical crosslink while mission scope, endpoint identity, link window, data class, power, or safety authority is not valid for the particular connection.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is establishment, activation, admission, alignment, authentication, routing, transmission, reception, or maintenance of an optical ISL. It remains in a Non-Effective State until the Protected Enforcement Domain validates source and destination satellites, terminal and laser identity, pointing and acquisition state, permitted link window, data and mission scope, optical power or safety bound, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the optical terminal enable, laser-emission gate, pointing controller, acquisition/tracking boundary, modem, serializer, receiver admission, routing interface, or destination optical ingress. An available optical link does not become operational for the Candidate Act until its exact link authority validates.</t>
          <t>
            <strong>Relationship to existing technology.</strong> CCAMP and optical-link work can describe control and path properties; this profile addresses release authority at the optical consequence boundary. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 183 -->
        <section anchor="profile-31">
          <name>Profile 31: Optical Pointing, Acquisition, and Laser-Emission Finality</name>
          <t>
            <strong>Problem space.</strong> Acquisition and tracking can converge on a peer before authority to emit laser energy, reserve the terminal, or expose a particular data class has been established for that moment.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is laser emission, pointing commitment, acquisition/tracking continuation, optical-terminal activation, or data-bearing modulation. It remains in a Non-Effective State until the Protected Enforcement Domain validates peer identity, terminal and laser identity, pointing state, acquisition state, link window, optical power and safety scope, mission scope, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the laser-emission gate, optical-terminal enable, beam-pointing controller, acquisition/tracking controller, or modulator boundary. Pointing success alone cannot cause radiative optical effect.</t>
          <t>
            <strong>Relationship to existing technology.</strong> Physical-layer acquisition remains unchanged; the finality layer supplies the authorization gate immediately before emission or data-bearing use. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 184 -->
        <section anchor="profile-32">
          <name>Profile 32: Wavelength, Channel, and Optical Beam-Retune Finality</name>
          <t>
            <strong>Problem space.</strong> An established optical or RF link may permit retuning of wavelength, channel, carrier, beam direction, divergence, power, modulation, coding, polarization, or spatial channel. A technically valid retune can alter interference, coverage, peer, or mission scope.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is retuning, hopping, allocation, redirection, or mutation of optical or RF channel and beam parameters. It remains in a Non-Effective State until the Protected Enforcement Domain validates link and terminal identity, permitted wavelength or channel, peer, beam or pointing scope, power, modulation or coding scope, mission state, policy epoch, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the wavelength selector, channel controller, beam-steering or power controller, modulator, optical terminal, switch, router, or receiver admission boundary. The new channel or beam state does not become externally effective merely because hardware can retune.</t>
          <t>
            <strong>Relationship to existing technology.</strong> Optical and radio control protocols select parameters; finality binds the selected mutation to present authority. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 185 -->
        <section anchor="profile-33">
          <name>Profile 33: Partner-Constellation Admission and Attestation Finality</name>
          <t>
            <strong>Problem space.</strong> A partner, allied, commercial, hosted, or third-party constellation may present valid identity or attestation evidence while the current mission, operator, route, data-sharing, jurisdiction, or traffic scope does not permit admission.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is admission, establishment, routing, receipt, forwarding, synchronization, or reliance on traffic, telemetry, tensor state, model state, or payload data from a partner constellation. It remains in a Non-Effective State until the Protected Enforcement Domain validates partner identity and attestation, operator and constellation domain, traffic or data class, mission and data-sharing scope, route and jurisdiction state, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the receive or transmit gate, routing or relay boundary, packet filter, payload ingress, model-state ingress, or partner-service admission point. Trustworthy partner identity does not become unrestricted cross-constellation authority.</t>
          <t>
            <strong>Relationship to existing technology.</strong> RATS can supply partner evidence; execution finality binds that evidence to the exact cross-constellation act. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 186 -->
        <section anchor="profile-34">
          <name>Profile 34: Multi-Protocol Optical and Satellite Translation Finality</name>
          <t>
            <strong>Problem space.</strong> Gateways can translate, encapsulate, decapsulate, tunnel, or bridge traffic between optical, RF, packet, circuit, satellite, terrestrial, DTN, encrypted, or proprietary protocols. Translation can unintentionally launder routing or egress authority across protocol domains.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is translation, encapsulation, decapsulation, bridging, conversion, tunneling, mapping, or forwarding between protocol domains. It remains in a Non-Effective State until the Protected Enforcement Domain validates source and destination domains, traffic class, route and egress scope, protocol translation class, no-protocol-laundering or no-unauthorized-egress constraints, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the translation engine, encapsulation or decapsulation gate, router, regenerative forwarder, ISL, feeder link, tunnel endpoint, packet egress, or destination admission interface. Protocol conversion does not create new authority to cross an otherwise prohibited consequence boundary.</t>
          <t>
            <strong>Relationship to existing technology.</strong> The profile leaves protocol semantics intact and adds cross-domain authority preservation. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 187 -->
        <section anchor="profile-35">
          <name>Profile 35: Optical Mesh Route and Jurisdiction-Corridor Finality</name>
          <t>
            <strong>Problem space.</strong> A dynamic optical satellite mesh may offer multiple technically valid multi-hop paths, some of which traverse disallowed operators, ground exits, sovereign corridors, or mission domains.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is selection, activation, modification, rerouting, or use of an optical mesh path or jurisdiction-constrained corridor. It remains in a Non-Effective State until the Protected Enforcement Domain validates route and relay identities, jurisdiction and partner scope, traffic and data class, permitted corridor, prohibited ground-egress state, route freshness, policy epoch, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the route-commit point, routing controller, optical switch, relay gate, feeder link, ground gateway, or destination admission interface. A route being reachable or optimal is insufficient if the exact path is not authorized for the Candidate Act.</t>
          <t>
            <strong>Relationship to existing technology.</strong> TVR can provide time-varying path information; execution finality consumes such state when deciding whether the selected path may become effective. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
      </section>
      <section anchor="ntn-services">
        <name>NTN, RAN, Direct-to-Device, DTN, and Emergency-Service Profiles</name>
        <!-- drafting traceability: source disclosure claim(s) 188 -->
        <section anchor="profile-36">
          <name>Profile 36: Onboard gNB and AI-RAN Scheduler Finality</name>
          <t>
            <strong>Problem space.</strong> An onboard gNB, regenerative payload, NTN scheduler, or AI-native RAN scheduler can compute a valid allocation while bearer, terminal, mission, emergency, beam, QoS, or resource authority is absent or stale.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is scheduling, admission, prioritization, or allocation of a bearer, PRB, beam, time-frequency resource, random access opportunity, QoS treatment, emergency resource, or D2D/NTN service. It remains in a Non-Effective State until the Protected Enforcement Domain validates terminal and service identity, bearer and QoS scope, beam and service area, resource budget, mission or emergency class, policy epoch, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the gNB or MAC scheduler, bearer-admission gate, beam-resource allocator, RRC boundary, RF-chain enable, D2D admission, emergency admission, or UE service gate. A scheduler decision remains a Candidate Act until the bounded radio consequence is authorized.</t>
          <t>
            <strong>Relationship to existing technology.</strong> 3GPP specifies RAN procedures; this profile adds an execution-authority boundary and does not propose a replacement scheduler. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 189 -->
        <section anchor="profile-37">
          <name>Profile 37: Satellite UPF-Like User-Plane Forwarding Finality</name>
          <t>
            <strong>Problem space.</strong> An onboard packet core, regenerative payload, NTN user-plane gateway, or UPF-like element can possess valid forwarding state while a particular flow, tunnel, mirror, steer, or egress operation lacks current authority.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is forwarding, routing, tunneling, filtering, dropping, mirroring, steering, buffering, or admission of user, application, emergency, sensor, AI, telemetry, D2D, ISL, feeder, or ground traffic. It remains in a Non-Effective State until the Protected Enforcement Domain validates flow and service identity, tunnel or path scope, traffic class, destination, slice or mission context, policy epoch, freshness, revocation, and protected forwarding state; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the user-plane forwarding gate, packet output, tunnel interface, route commit, ISL, feeder link, ground egress, application ingress, or destination admission boundary. Installed forwarding state alone cannot cause the specific packet or flow consequence.</t>
          <t>
            <strong>Relationship to existing technology.</strong> Routing and forwarding protocols retain their normal role; finality adds per-act or per-bounded-flow effectuation authority. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 190 -->
        <section anchor="profile-38">
          <name>Profile 38: UE-Satellite-UE and Direct-to-Device Relay Finality</name>
          <t>
            <strong>Problem space.</strong> Direct-to-device or UE-satellite-UE relay can provide life-critical connectivity while also creating a path that bypasses ordinary terrestrial policy or operator controls.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is establishment, admission, routing, maintenance, or relay of D2D, direct-to-device, emergency, disaster, roaming, or local NTN traffic. It remains in a Non-Effective State until the Protected Enforcement Domain validates source and destination UE scope, service and emergency class, relay and beam identity, geographic or service area, duration or quota, policy epoch, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the relay-admission gate, onboard gNB relay, UE-to-UE bearer, regenerative forwarder, beam scheduler, D2D gate, packet output, or destination UE admission point. The relay remains unavailable outside the explicitly permitted service, duration, and endpoint scope.</t>
          <t>
            <strong>Relationship to existing technology.</strong> This profile is complementary to 3GPP D2D/NTN service procedures and focuses on bounded relay effectuation. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 191 -->
        <section anchor="profile-39">
          <name>Profile 39: NTN Network-Slice Admission and Mutation Finality</name>
          <t>
            <strong>Problem space.</strong> Creating or modifying an NTN slice can reallocate scarce compute, radio, routing, or mission resources and can cross tenant boundaries even when the control request is authenticated.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is creation, admission, activation, expansion, shrinkage, migration, merge, split, prioritization, suspension, deletion, or resource reallocation of an NTN slice. It remains in a Non-Effective State until the Protected Enforcement Domain validates tenant and mission identity, slice and service class, service area, QoS and resource scope, no-cross-tenant constraints, policy epoch, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the slice manager, gNB, UPF, QoS or resource controller, network-function admission point, emergency service gate, or service activation boundary. The slice mutation cannot become network-effective unless its exact tenant, mission, and resource scope validates.</t>
          <t>
            <strong>Relationship to existing technology.</strong> 3GPP slicing mechanisms define slice behavior; finality governs whether the requested mutation may take effect. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 192 -->
        <section anchor="profile-40">
          <name>Profile 40: DTN Store-and-Forward Release Finality</name>
          <t>
            <strong>Problem space.</strong> A bundle or stored object may be validly accepted when created but remain queued through long disruption. By the time connectivity returns, destination, route, custody, priority, retention, policy, or revocation state may have changed.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is storage, buffering, custody transfer, forwarding, release, retransmission, prioritization, routing, or delivery of a delay-tolerant object. It remains in a Non-Effective State until the Protected Enforcement Domain validates object and destination identity, storage and forwarding windows, expiration, priority, route or custody scope, policy epoch, freshness at release, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the storage commit, bundle admission, custody-transfer boundary, retransmission or forwarding-release gate, ISL, feeder link, ground egress, or destination admission point. Stored validity is not treated as perpetual delivery authority.</t>
          <t>
            <strong>Relationship to existing technology.</strong> BPv7 and DTN mechanisms provide disrupted-network transport; execution finality adds revalidation at the consequence-bearing release boundary. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 192 -->
        <section anchor="profile-41">
          <name>Profile 41: Delayed Delivery Revocation and Revalidation Finality</name>
          <t>
            <strong>Problem space.</strong> Long store-and-forward intervals create a specific time-of-check/time-of-use problem: an object that was authorized for eventual delivery can outlive a revocation, route change, emergency termination, or destination-policy change.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is release or retransmission of previously accepted delayed traffic after a connectivity or custody interval. It remains in a Non-Effective State until the Protected Enforcement Domain validates original authorization binding, current destination and route, expiration, current policy and revocation epoch, custody state, replay state, freshness, and any required new evidence; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the retransmission gate, forwarding-release boundary, next-hop admission, ground or ISL egress, or final destination ingress. Reappearance of connectivity does not automatically reactivate stale delivery authority.</t>
          <t>
            <strong>Relationship to existing technology.</strong> This profile is a DTN-specific revalidation specialization and is intended for technical evaluation against any existing BPv7/BPSec mechanism that already provides equivalent non-bypassable semantics. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 193 -->
        <section anchor="profile-42">
          <name>Profile 42: Emergency Satellite Bearer Finality</name>
          <t>
            <strong>Problem space.</strong> Emergency and public-safety services require rapid access, but broad emergency authorization can become a standing privilege if event, geography, endpoint, traffic, duration, or priority scope is not enforced at effectuation.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is creation, admission, maintenance, prioritization, transmission, or delivery of an emergency, rescue, public-safety, D2D, voice, data, or mission-critical satellite bearer. It remains in a Non-Effective State until the Protected Enforcement Domain validates declared event, terminal class, service area, priority, duration, traffic class, authorized endpoints, quota, policy epoch, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the emergency-bearer gate, gNB, beam scheduler, D2D gate, RF-chain output, message output, UPF, UE admission, or service-delivery boundary. Emergency authority remains bounded to the actual event and service scope.</t>
          <t>
            <strong>Relationship to existing technology.</strong> The profile does not define emergency policy or priority rules; it supplies an effectuation boundary for the rules selected by the operator or authority. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 194 -->
        <section anchor="profile-43">
          <name>Profile 43: Mass-Alert Broadcast Finality</name>
          <t>
            <strong>Problem space.</strong> Public warning systems can reach large populations, making a mistaken, replayed, geographically overbroad, or unauthorized alert consequential even when the broadcast infrastructure itself is functioning correctly.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is generation, authorization, scheduling, transmission, repetition, geo-targeting, expansion, limitation, or cancellation of a mass alert. It remains in a Non-Effective State until the Protected Enforcement Domain validates message identity and digest, event authority, geographic region or beam, terminal class, transmission window, repetition quota, policy epoch, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the broadcast gate, scheduler, RF output, beam controller, D2D/public-warning interface, gNB, or destination delivery boundary. The alert cannot become radiative or delivery-effective outside the authorized message, region, time, and repetition scope.</t>
          <t>
            <strong>Relationship to existing technology.</strong> Existing public-warning formats and broadcast procedures remain responsible for message transport; finality constrains the consequence of transmission. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 195 -->
        <section anchor="profile-44">
          <name>Profile 44: Location Disclosure and Rescue-Mode Finality</name>
          <t>
            <strong>Problem space.</strong> Satellite systems can derive location, proximity, beam, timing, Doppler, rescue, beacon, or device-region information at precision levels that exceed what a particular recipient or emergency purpose is authorized to receive.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is collection, derivation, disclosure, transmission, storage, release, precision increase, or correlation of location-related artifacts. It remains in a Non-Effective State until the Protected Enforcement Domain validates data source, subject or device scope, permitted precision, recipient, emergency or rescue purpose, minimization and retention constraints, no-unauthorized-correlation policy, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the location-release gate, rescue-mode output, emergency API, downlink, public-safety interface, or destination admission boundary. The system can compute more precise location internally without automatically making that precision externally effective.</t>
          <t>
            <strong>Relationship to existing technology.</strong> This profile complements location and emergency-service mechanisms by separating access to raw capability from authority to disclose a particular precision. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 196 -->
        <section anchor="profile-45">
          <name>Profile 45: Disaster Roaming and Offline-Survival Service Finality</name>
          <t>
            <strong>Problem space.</strong> During terrestrial outage, network partition, or ledger/connectivity loss, a satellite service may need to operate from cached policy and local protected state. Permanently failing closed can defeat emergency continuity, while unrestricted fail-open behavior can create standing bypass authority.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is admission or continuation of disaster roaming, offline survival, degraded satellite access, pre-authorized emergency service, D2D continuity, or other partition-tolerant service. It remains in a Non-Effective State until the Protected Enforcement Domain validates cached policy and revocation state, emergency scope, terminal or service identity, quota and duration, local protected state, sealed receipt buffer, reconciliation requirements, policy epoch, and freshness available locally; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the disaster-roaming gate, emergency bearer, gNB or core admission, UPF, D2D interface, offline receipt boundary, reconciliation gate, or service output. Offline operation is bounded to the survival scope and produces protected evidence for later reconciliation rather than creating unrestricted authority.</t>
          <t>
            <strong>Relationship to existing technology.</strong> DTN and offline protocols provide continuity; execution finality adds locally enforceable bounded authority and reconciliation state. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
      </section>
      <section anchor="updates">
        <name>Firmware, Microcode, Maintenance, and Privileged-Control Profiles</name>
        <!-- drafting traceability: source disclosure claim(s) 207 -->
        <section anchor="profile-46">
          <name>Profile 46: Satellite Microcode-Update Activation Finality</name>
          <t>
            <strong>Problem space.</strong> A microcode or low-level control-store update can be authentic and applicable to the hardware revision yet still be unauthorized for the current mission, boot slot, dependency state, anti-rollback state, or recovery mode.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is loading, activation, selection, commitment, rollback, restore, or hot-patch of processor, accelerator, memory-controller, DSP, baseband, cryptographic, recovery, or safe-mode microcode. It remains in a Non-Effective State until the Protected Enforcement Domain validates hardware revision, current and candidate versions, digest, function and slot, anti-rollback state, mission state, dependencies, policy epoch, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the microcode load path, control-store write, patch register, microsequencer, boot slot selector, reset gate, hot-patch boundary, safe-mode gate, rollback gate, or execution-enable point. The update artifact can be verified without becoming executable until activation authority validates.</t>
          <t>
            <strong>Relationship to existing technology.</strong> SUIT-style update metadata and secure-update mechanisms can govern artifact distribution and installation; finality adds the exact activation consequence. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 210 -->
        <section anchor="profile-47">
          <name>Profile 47: Beamforming Firmware and Codebook Update Finality</name>
          <t>
            <strong>Problem space.</strong> Beamforming firmware, codebooks, weights, phase and amplitude tables, precoders, nulls, hopping plans, tracking parameters, frequency settings, and power settings can alter the physical radiation pattern immediately when activated.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is loading or activation of beamforming firmware, codebooks, array weights, phase/amplitude settings, precoders, beam-hopping or tracking parameters, frequency, power, calibration, debug, or safe-mode beam state. It remains in a Non-Effective State until the Protected Enforcement Domain validates firmware or codebook identity, beam footprint, coverage and exclusion zones, frequency, RF power, emission mask, mission scope, dependency state, policy epoch, freshness, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the firmware-activation gate, codebook bank, weight table, phase/amplitude controller, precoder, null controller, beam scheduler, frequency controller, RF power or EIRP gate, RF chain, or antenna-output boundary. A verified update does not alter radiative behavior until the bound beam and emission scope validates.</t>
          <t>
            <strong>Relationship to existing technology.</strong> Secure update mechanisms protect the artifact; 3GPP or radio implementations control beam behavior; this profile binds update activation to the resulting physical consequence. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 211 -->
        <section anchor="profile-48">
          <name>Profile 48: Payload-Controller Patch Finality</name>
          <t>
            <strong>Problem space.</strong> A payload patch can change command handling, state machines, sensing, RF, optical, routing, storage, compression, AI, emergency, D2D, recovery, debug, or partner behavior across many subsystems. Signature validity alone does not bound those downstream effects.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is loading, installation, activation, rollback, restore, or switching of a payload-controller patch or active bank. It remains in a Non-Effective State until the Protected Enforcement Domain validates patch identity and digest, target payload and subsystem, current and candidate version, permitted function and effect scope, dependencies, mission and recovery state, policy epoch, freshness, revocation, and anti-rollback state; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the patch-activation boundary, active-bank selector, command or state-machine gate, subsystem enable, sensor/RF/optical/AI/routing/storage output, rollback gate, reset-release gate, or payload output. The patch may be stored and verified without becoming operational until the intended effect scope validates.</t>
          <t>
            <strong>Relationship to existing technology.</strong> This profile complements SUIT and vendor update systems by making payload effectuation a separately controlled event. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 212 -->
        <section anchor="profile-49">
          <name>Profile 49: Maintenance, Debug, JTAG, and Privileged Console Finality</name>
          <t>
            <strong>Problem space.</strong> Maintenance interfaces such as JTAG, scan chains, boundary scan, debug ports, engineering consoles, protected-memory access, register writes, key-store diagnostics, tensor buffers, and model-state access can bypass ordinary runtime controls if possession of maintenance credentials is treated as unrestricted authority.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is enablement or use of a maintenance, engineering, diagnostic, debug, JTAG, scan-chain, console, protected-memory, register, key-store, tensor-buffer, or model-state operation. It remains in a Non-Effective State until the Protected Enforcement Domain validates target subsystem and interface, command and argument digests, affected resource and output scope, maintenance evidence, time window, quota or duration, approval quorum where applicable, dependency receipts, freshness, replay state, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the debug-port, JTAG, scan-chain, command-handler, maintenance-shell, protected-memory, register-write, key-store diagnostic, tensor-buffer, or related privileged-access gate. Privileged maintenance remains bounded to the exact command, interface, resource, and time scope and fails closed outside it.</t>
          <t>
            <strong>Relationship to existing technology.</strong> Authentication of a maintainer or debug credential is necessary but is not treated as unrestricted authority for every privileged consequence. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: source disclosure claim(s) 212 -->
        <section anchor="profile-50">
          <name>Profile 50: Break-Glass, Emergency Override, and Finality-Bypass Control</name>
          <t>
            <strong>Problem space.</strong> Emergency and recovery procedures sometimes require overriding normal RF, optical, payload, AI, watchdog, thermal, power, or safe-mode limits. An unbounded break-glass mechanism can become the very bypass path that defeats finality.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is invocation of an emergency override, RF or optical override, payload or AI-accelerator override, watchdog or thermal/power-limit override, safe-mode exit, receipt repair, rollback, emergency service activation, or attempted finality-sink bypass. It remains in a Non-Effective State until the Protected Enforcement Domain validates override class, target subsystem, command and argument digests, affected resource and output commitments, emergency evidence, time window, quota or duration, approval quorum where applicable, substitute-finality path where required, freshness, replay prevention, policy epoch, and revocation; commits the required protected validation evidence; and permits scoped non-bearer authority bound to the Candidate Act and the intended sink. The Finality Sink is the RF or optical gate, payload-control gate, update or rollback gate, safe-mode exit, watchdog or resource override, receipt-repair gate, reset-release gate, emergency-service gate, or dedicated finality-bypass gate. The override itself is treated as a Candidate Act; direct bypass is rejected unless an explicitly authorized substitute finality path satisfies the bounded emergency scope.</t>
          <t>
            <strong>Relationship to existing technology.</strong> This profile is intended to prevent "break glass" from becoming standing bearer authority while preserving explicitly bounded emergency operation. Where an existing mechanism already guarantees the same non-bypassable consequence-bound property, that mechanism is invited as a technical correction or equivalence reference.</t>
        </section>
      </section>
      <section anchor="future-roadmap-profiles">
        <name>Future Space-Mobility, Manufacturing, Servicing, and End-of-Life Profiles</name>
        <t>Profiles 51 through 60 extend the same execution-finality invariant to consequence boundaries that are increasingly relevant to satellite manufacturers, spacecraft integrators, launch providers that also perform spacecraft integration or in-space services, orbital-mobility platforms, in-orbit servicing systems, and operators planning more autonomous missions. The selection is future-facing, but the enforcement mechanisms below are limited to combinations supported by the underlying disclosure rather than being inferred from any particular commercial roadmap.</t>
        <t>Scope discipline is intentional. This revision does not create profiles for launcher stage separation, fairing jettison, docking-capture mechanics, or propellant-transfer plumbing merely because those functions are commercially important. Those mechanisms should be added only where a separately reviewed disclosure provides adequate technical support. The profiles below instead govern disclosed maneuver, actuation, payload, sensing, end-of-life, component-admission, and command-release boundaries that can be relevant to future launcher-adjacent and satellite-manufacturing roadmaps.</t>
        <!-- drafting traceability: mothership Embodiments 136 and 107; Claim 16 -->
        <section anchor="profile-51">
          <name>Profile 51: Autonomous Orbital Maneuver and Delta-V Finality</name>
          <t>
            <strong>Problem space.</strong> Autonomous mission planners, flight-dynamics software, or ground systems can calculate a technically valid station-keeping or orbital-maneuver command while the current orbital state, protected asset zones, mission phase, jurisdictional conditions, or clearance state make that exact maneuver unauthorized. Correct trajectory computation and valid telecommand authentication therefore do not necessarily establish authority for physical orbital change.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is a thrust command, delta-V command, station-keeping change, orbital-path change, or related maneuver instruction. The act remains in a Non-Effective State while the Protected Enforcement Domain binds the exact maneuver vector or command digest to the satellite identity, current or predicted orbital state, mission phase, permitted orbital region or corridor, kinetic and positional safety predicates, applicable clearance or threshold authority, freshness, nonce state, policy epoch, and revocation state. Protected validation evidence is committed before scoped non-bearer maneuver authority becomes available. The Finality Sink is the propulsion actuator, thruster latch valve, attitude/propulsion control gate, or equivalent mandatory maneuver-effectuation boundary. If the act, state, clearance, or sink binding no longer corresponds, propulsion authority is withheld and the proposed maneuver remains non-effective.</t>
          <t>
            <strong>Relationship to existing technology.</strong> This profile complements flight dynamics, guidance-navigation-control, orbital propagation, command authentication, and mission planning. Those systems may calculate or recommend the maneuver; execution finality governs whether the exact maneuver is permitted to cross the physical maneuver boundary. Existing systems that already provide an equivalent act-bound, non-bypassable maneuver-authority property are invited as correction or equivalence references.</t>
        </section>
        <!-- drafting traceability: mothership Embodiment 136; Embodiment 107 -->
        <section anchor="profile-52">
          <name>Profile 52: Collision-Avoidance and Conjunction-Response Finality</name>
          <t>
            <strong>Problem space.</strong> Collision-avoidance automation can reduce risk, but an avoidance maneuver can itself create a new conjunction, violate a protected orbital corridor, conflict with another maneuver, or rely on stale conjunction or telemetry state. Treating a conjunction alert or optimizer output as direct propulsion authority can therefore collapse risk estimation into physical authority.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is a collision-avoidance, conjunction-response, evasive, hold, or related trajectory-change command. Before effectuation, the Protected Enforcement Domain evaluates the exact command against current orbital and telemetry state, applicable conjunction assessment or digital-twin state, predicted proximity to active satellites, crewed spacecraft, debris fields or protected zones, mission and positional constraints, command freshness, revocation state, policy epoch, nonce state, and any required threshold authority. It commits protected validation evidence and permits only act-specific, time-bounded authority for the identified Finality Sink. The Finality Sink is the propulsion or attitude-control boundary whose state change produces the avoidance maneuver. If relevant state becomes stale, inconsistent, revoked, or outside the permitted corridor, the maneuver remains non-effective or is reduced to an explicitly authorized safety-only mode.</t>
          <t>
            <strong>Relationship to existing technology.</strong> This profile does not replace conjunction assessment, space-domain awareness, space-traffic coordination, or collision-avoidance algorithms. It uses their outputs as predicates while separately governing the physical response. This distinction is relevant to current zero-debris roadmaps that increasingly rely on autonomous collision-risk mitigation. Equivalent consequence-bound mechanisms are expressly invited as technical corrections or equivalence references.</t>
        </section>
        <!-- drafting traceability: mothership Embodiment 136; Embodiment 107 -->
        <section anchor="profile-53">
          <name>Profile 53: Rendezvous, Proximity-Operations, and Servicing-Approach Finality</name>
          <t>
            <strong>Problem space.</strong> Inspection, relocation, mission extension, servicing, debris-removal preparation, and other future space-logistics missions require a spacecraft to approach another object. Mission authorization to perform a servicing operation does not necessarily authorize every proximity vector, timing window, target approach, or orbital-path change, particularly when protected assets or restricted orbital volumes are nearby.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is a proximity-operation, rendezvous, approach, relative-orbit, or servicing-approach maneuver command. It remains non-effective until the Protected Enforcement Domain validates the candidate command against the participating spacecraft identities, orbital context, target or protected-asset zone, mission scope, permitted approach or orbital corridor, kinetic and positional predicates, required clearance or threshold authority, current policy and revocation state, freshness, and nonce state. Protected validation evidence is committed before release of a scoped maneuver capability. The Finality Sink is the propulsion actuator, thruster latch valve, reaction-wheel or attitude-control gate, or equivalent boundary that makes the approach physically effective.</t>
          <t>
            <strong>Relationship to existing technology.</strong> This profile is relevant to rendezvous and proximity operations used by emerging on-orbit servicing and space-logistics systems. It does not define relative-navigation algorithms, docking interfaces, capture mechanisms, robotic arms, or refueling hardware. Its narrower function is to keep an exact approach command non-effective until consequence-bound authority validates. Existing RPO safety mechanisms that already provide this invariant are invited as equivalence references.</t>
        </section>
        <!-- drafting traceability: mothership Embodiment 107; true execution-finality boundary disclosure -->
        <section anchor="profile-54">
          <name>Profile 54: Propulsion Ignition and Thruster-Impulse Finality</name>
          <t>
            <strong>Problem space.</strong> A high-level maneuver may be properly planned while a lower-level ignition, valve-open, burn-duration, or impulse command is substituted, replayed, stale, or directed to the wrong propulsion element. If low-level propulsion hardware accepts commands merely because the flight computer or command channel is trusted, a bypass can occur below the mission-planning authorization layer.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is propulsion ignition, thruster-valve opening, bounded thruster impulse, burn enablement, or another propulsion actuator command. The Protected Enforcement Domain binds the exact command hash, propulsion subsystem or actuator, mission phase, permitted act class, requested temporal window, maneuver context, applicable hardware status, policy and revocation epochs, nonce, and target Finality Sink. It commits protected validation evidence before releasing a short-lived, non-bearer propulsion capability. The Finality Sink is the propulsion actuator, thruster latch valve, ignition-enable path, or equivalent physical enablement point. The capability authorizes only the specific propulsion act and cannot be reused for another thruster, burn window, maneuver, mission phase, or sink.</t>
          <t>
            <strong>Relationship to existing technology.</strong> This profile complements propulsion electronics, engine or thruster controllers, fault protection, GNC, and command authentication. It adds an exact-act authority check at the physical propulsion-enablement boundary rather than replacing propulsion-control logic. Readers are invited to identify existing flight-safety architectures that already enforce the same non-bypassable binding.</t>
        </section>
        <!-- drafting traceability: mothership Embodiment 107; optical-health and Finality Sink disclosures -->
        <section anchor="profile-55">
          <name>Profile 55: Attitude-Control, Reaction-Wheel, and Gimbal Actuation Finality</name>
          <t>
            <strong>Problem space.</strong> A spacecraft can create consequential effects without changing orbit. Attitude changes, reaction-wheel commands, gimbal motion, or pointing changes can redirect an optical terminal, sensor, antenna, or payload toward a different target or region. A valid pointing computation therefore does not necessarily establish authority for the corresponding physical orientation change.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is an attitude-control instruction, reaction-wheel actuation, steering-actuator command, gimbal movement, or pointing-state change. It remains non-effective while the Protected Enforcement Domain validates satellite and subsystem identity, mission phase, current attitude and pointing state, target direction or payload/terminal context, spacecraft health, reaction-wheel or steering state where applicable, power and thermal margin where required, policy and revocation epochs, freshness, nonce state, and any related beam, sensing, or mission authority. Protected validation evidence precedes a scoped capability. The Finality Sink is the reaction-wheel driver, gimbal motor, attitude-control actuator, steering actuator, or other mandatory orientation-control boundary.</t>
          <t>
            <strong>Relationship to existing technology.</strong> This profile complements attitude determination and control systems, star trackers, pointing controllers, optical acquisition/tracking, and payload pointing logic. Those systems determine how to point; execution finality determines whether this particular commanded orientation is authorized to become physically effective. Equivalent safety-interlock behavior is invited as a technical correction or equivalence reference.</t>
        </section>
        <!-- drafting traceability: mothership Embodiments 150, 136, and 107; Claims 16 and 185 -->
        <section anchor="profile-56">
          <name>Profile 56: Hosted-Payload Activation, Reconfiguration, and Third-Party Egress Finality</name>
          <t>
            <strong>Problem space.</strong> Future multi-mission spacecraft can host payloads owned or operated by parties different from the platform operator. A hosted payload may be authenticated and legitimately installed yet still attempt a mode change, sensor activation, AI-output release, storage commit, RF or optical egress, or payload-bus operation outside the current mission, destination, jurisdiction, or platform policy. Operating outside the primary application stack can otherwise become a bypass path.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is hosted-payload activation, payload-mode change, payload reconfiguration, payload-bus action, sensing activation, output release, or governed RF, optical, storage, or routing egress. The Protected Enforcement Domain validates hosted-payload identity and attestation where required, payload class and permitted mode, mission phase, destination or route, current platform and payload state, applicable jurisdiction or data-sharing scope, freshness, policy epoch, revocation state, nonce state, and the target Finality Sink. Protected validation evidence is committed before a capability scoped to the exact payload act is released. The Finality Sink may be the payload activation rail, payload controller, payload bus gate, storage-commit interface, RF or optical egress, or destination-admission interface. A third-party payload cannot obtain broader authority merely by bypassing the primary application stack.</t>
          <t>
            <strong>Relationship to existing technology.</strong> This profile is directly relevant to spacecraft platforms offering payload hosting, infrastructure services, edge computing, or mission-unique payload integration. It does not define mechanical payload deployment or separation. Existing hosted-payload isolation or bus-enforcement systems providing the same act-bound effectuation property are invited as equivalence references.</t>
        </section>
        <!-- drafting traceability: mothership Embodiments 136 and 107; Claim 160 -->
        <section anchor="profile-57">
          <name>Profile 57: High-Resolution Imaging and Sensor-Exposure Finality</name>
          <t>
            <strong>Problem space.</strong> Authorization to operate an Earth-observation or sensing spacecraft does not necessarily authorize every sensor exposure, SAR emission, pointing direction, imaging resolution, revisit, or observation of a restricted target. Controlling only downstream data release can be too late where the acquisition or emission itself is the protected consequence.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is camera exposure, sensing-payload activation, high-resolution imaging, SAR pulse emission, observation-mode change, or another bounded sensor-acquisition operation. The Protected Enforcement Domain binds the exact target or region, observation mode, permitted resolution or sensing class, satellite and payload identity, orbital and attitude state, mission phase, purpose, applicable jurisdiction or restricted-area rule, freshness, policy and revocation epochs, nonce state, and any required quorum or threshold approval for high-risk observation. It commits protected validation evidence before issuing a scoped sensing capability. The Finality Sink is the payload shutter trigger, camera power rail, sensor activation path, SAR emission path, or equivalent acquisition boundary. If validation fails, no governed exposure or emission occurs even if the sensing plan was otherwise executable.</t>
          <t>
            <strong>Relationship to existing technology.</strong> This profile complements Earth-observation tasking, sensor control, licensing, geofencing, and downstream data-release controls. It governs the acquisition boundary itself; Profiles 17 and 18 continue to govern later AI-product release and resolution/purpose-bounded disclosure. Existing sensor-tasking controls that already make acquisition technically non-completable without exact current authority are invited as technical corrections or equivalence references.</t>
        </section>
        <!-- drafting traceability: mothership Embodiment 136; end-of-life and irreversible mission-state disclosures -->
        <section anchor="profile-58">
          <name>Profile 58: End-of-Life Battery Decommissioning and Irreversible Power-State Finality</name>
          <t>
            <strong>Problem space.</strong> End-of-life actions are safety relevant but can also be destructive or irreversible. A stale, replayed, premature, or mis-scoped battery-decommissioning or irreversible power-state command can terminate mission capability, remove recovery options, or leave the spacecraft in an unintended state. Treating an end-of-life flag as standing authority creates a high-consequence control risk.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is battery decommissioning, irreversible power-state transition, protected key or state destruction associated with end-of-life, or another explicitly governed mission-termination action supported by the platform. The Protected Enforcement Domain validates spacecraft identity, mission phase and end-of-life authority, target subsystem, power and health state, command digest, lifecycle state, required quorum or threshold authority, policy and revocation epochs, freshness, nonce state, protected-state continuity, and target Finality Sink. Protected validation evidence is committed before release of a one-purpose, non-bearer decommissioning capability. The Finality Sink is the battery or power controller, key-destruction or protected-state gate where applicable, or other irreversible mission-state boundary. The authority expires after the specified act and cannot become standing power-control authority.</t>
          <t>
            <strong>Relationship to existing technology.</strong> This profile is relevant to zero-debris and autonomous end-of-life roadmaps, but it does not define deorbit propulsion, venting, propellant passivation, drag devices, or reentry mechanics. It governs only disclosed decommissioning and irreversible power/state actions. Where existing spacecraft end-of-life controllers already provide equivalent exact-act, quorum-bound finality, that mechanism should be identified.</t>
        </section>
        <!-- drafting traceability: mothership Embodiment 169 -->
        <section anchor="profile-59">
          <name>Profile 59: Spaceborne Component Re-Admission Across Manufacturing, Integration, Launch Preparation, and Servicing</name>
          <t>
            <strong>Problem space.</strong> Spaceborne processor packages and heterogeneous subsystems can include components sourced from multiple vendors and can be replaced, reintroduced, re-enumerated, repaired, upgraded, or restored from quarantine during manufacturing, integration, launch preparation, anomaly response, or later servicing. A component can be genuine yet wrong for the package, slot, revision, mission, role, firmware state, or current policy epoch, and test/debug state can remain enabled after integration.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is component or chiplet admission, re-admission, reactivation, re-enumeration, restoration from quarantine, or replacement activation. The Protected Enforcement Domain validates component identity and certificate state, package and slot binding, permitted role, hardware revision, compatible firmware or microcode, lifecycle and test/debug state, mission phase, package topology, current health and recovery state, revocation, freshness, policy epoch, nonce state, and applicable prior admission evidence. Protected validation evidence is committed before scoped admission authority becomes available. The Finality Sink is the reset-release, interconnect-attach, memory-admission, enumeration, execution-enable, or equivalent protected package/subsystem activation boundary. Electrical compatibility or certificate validity alone is insufficient for mission-ready admission.</t>
          <t>
            <strong>Relationship to existing technology.</strong> This profile complements supply-chain assurance, secure boot, component authentication, hardware attestation, acceptance testing, and launch-site integration procedures. It is particularly relevant where manufacturers or launch providers perform late integration or replacement before flight. Existing component-admission systems that already bind authenticity to package role, lifecycle state, mission phase, and the actual activation sink are invited as equivalence references.</t>
        </section>
        <!-- drafting traceability: mothership Embodiment 107; Embodiment 136 threshold-authority disclosures -->
        <section anchor="profile-60">
          <name>Profile 60: High-Consequence Mission Command Quorum and Anti-Coercion Finality</name>
          <t>
            <strong>Problem space.</strong> Some satellite actions remain too consequential to treat a single authenticated command source, operator credential, or software approval flag as sufficient authority. Orbital maneuvers, propulsion actuation, attitude-control override, restricted payload activation, high-power transmission, cryptographic-key release, emergency override, beam reconfiguration, and irreversible mission-state transitions can require stronger protection against coercion, replay, compromised operator endpoints, or fabricated quorum state.</t>
          <t>
            <strong>Execution-finality solution.</strong> The Candidate Act is the exact high-consequence command. The Protected Enforcement Domain generates or validates a challenge bound to the Candidate Operation Object, command hash, mission phase, target subsystem, time window, policy epoch, revocation epoch, nonce, and target Finality Sink. Where configured, a geographically separated activation token, hardware authenticator, secure element, user-presence-dependent device, or multiple registered authority responses must return valid, fresh, act-matching approvals. Verified-count or quorum state is maintained inside protected state so ordinary software cannot fabricate, replay, inflate, reorder, or transplant approvals. Protected validation evidence is committed before a scoped command-enabling capability is released, and the underlying physical or protocol Finality Sink still verifies that capability before effectuation.</t>
          <t>
            <strong>Relationship to existing technology.</strong> This profile complements telecommand authentication, operator procedures, dual-control rules, safety review, and mission key management. Human or multi-authority approval is treated as an input predicate rather than as a bypass around the Finality Sink. Existing threshold-command or two-person-control systems that already bind fresh approvals to the exact pending act and the actual consequence boundary are invited as technical equivalence references.</t>
        </section>
      </section>
    </section>
    <section anchor="deployment">
      <name>Operational and Deployment Considerations</name>
      <section anchor="placement">
        <name>Finality-Sink Placement</name>
        <t>
          The useful placement is the last boundary at which denial can still prevent
          the protected consequence. Validation can occur earlier, but an early
          decision alone is insufficient when later state can change. A sink may
          therefore verify a compact capability or reconstruct load-bearing state
          rather than rerun every upstream check.
        </t>
      </section>
      <section anchor="latency">
        <name>Latency and Availability Tradeoffs</name>
        <t>
          Additional validation can add latency and protected-state operations. The
          architecture is therefore most appropriate where the protected consequence
          justifies the cost, including high-value AI output release, cross-domain
          routing, RF or optical effectuation, update activation, emergency control,
          and spacecraft recovery. The document does not propose that every packet,
          arithmetic operation, or internal model token require an independent
          heavyweight validation transaction.
        </t>
      </section>
      <section anchor="disconnected">
        <name>Disconnected and Emergency Operation</name>
        <t>
          Satellite systems cannot assume continuous access to a central policy
          service. Deployments can use pre-authorized bounded offline authority,
          protected counters, monotonic state, cached revocation epochs, limited
          validity windows, sealed local evidence, and later reconciliation. A
          disconnected mode should be explicit in scope and duration rather than an
          implicit fail-open state.
        </t>
      </section>
      <section anchor="legacy">
        <name>Incremental and Legacy Deployment</name>
        <t>
          A Protected Enforcement Domain or Finality Sink can be integrated into
          hardware, firmware, a secure enclave, an HSM, a DPU or SmartNIC, an OS or
          hypervisor boundary, a satellite gateway, a payload controller, or a
          protected sidecar or proxy. The security claim must match the actual bypass
          resistance of the deployment. A sidecar that can be skipped by another
          path does not provide non-bypassable finality for that path.
        </t>
      </section>
      <section anchor="state-time">
        <name>Time, Ephemeris, Epoch, and Revocation State</name>
        <t>
          Satellite authorization can depend on time and rapidly changing state.
          Deployments should define the trust source, update cadence, acceptable
          uncertainty, monotonicity, and failure handling for clocks, ephemeris,
          beam state, policy epochs, revocation epochs, and other values that become
          load-bearing predicates.
        </t>
      </section>
    </section>
    <section anchor="security">
      <name>Security Considerations</name>
      <t>
        Every profile depends on accurate act binding and sink coverage. An attacker
        must not be able to substitute the Candidate Act, destination, model, route,
        beam, update, command arguments, or protected state after validation without
        invalidating the authority presented at the Finality Sink.
      </t>
      <t>
        Replay protection, freshness, revocation, quota consumption, monotonic state,
        and atomic or correctly ordered evidence commitment are security-critical
        where the profile relies on them. Implementations should also consider denial
        of service against the validation path and avoid designs in which expensive
        radio, optical, accelerator, or memory work is unconditionally consumed
        before inexpensive reject conditions can be evaluated.
      </t>
      <t>
        Alternate-path closure is central. If an AI output can leave through a debug
        interface, a route can bypass the protected forwarding point, or an RF chain
        can be enabled independently of the designated sink, the deployment does not
        provide finality for that external effect. Emergency and maintenance paths
        are therefore modeled as Candidate Acts rather than assumed exceptions.
      </t>
    </section>
    <section anchor="privacy">
      <name>Privacy Considerations</name>
      <t>
        Validation can involve location, jurisdiction, mission, route, emergency,
        identity, model, sensor, or device state. Implementations should minimize
        disclosure of such predicates and avoid turning denial behavior into a side
        channel that reveals satellite topology, terminal presence, rescue state,
        restricted regions, route availability, or partner-constellation policy.
      </t>
      <t>
        Protected validation evidence need not expose every underlying predicate to
        every downstream component. Where possible, the Finality Sink should receive
        only the information required to establish the bounded authority for the
        relevant consequence.
      </t>
    </section>
    <section anchor="iana">
      <name>IANA Considerations</name>
      <t>This document has no IANA actions.</t>
    </section>
  </middle>
  <back>
    <references>
      <name>Informative References</name>
      <reference anchor="EU-AI-ACT" target="https://eur-lex.europa.eu/eli/reg/2024/1689/2026-07-27/eng">
        <front>
          <title>Regulation (EU) 2024/1689 laying down harmonised rules on artificial intelligence (Artificial Intelligence Act)</title>
          <author>
            <organization>European Union</organization>
          </author>
          <date year="2024"/>
        </front>
      </reference>
      <reference anchor="NIST-AI-RMF" target="https://nvlpubs.nist.gov/nistpubs/ai/NIST.AI.100-1.pdf">
        <front>
          <title>Artificial Intelligence Risk Management Framework (AI RMF 1.0)</title>
          <author>
            <organization>National Institute of Standards and Technology</organization>
          </author>
          <date year="2023"/>
        </front>
        <seriesInfo name="NIST" value="AI 100-1"/>
      </reference>
      <reference anchor="RFC9334" target="https://www.rfc-editor.org/rfc/rfc9334">
        <front>
          <title>Remote ATtestation procedureS (RATS) Architecture</title>
          <author>
            <organization>IETF</organization>
          </author>
          <date year="2023"/>
        </front>
        <seriesInfo name="RFC" value="9334"/>
      </reference>
      <reference anchor="RFC9657" target="https://www.rfc-editor.org/rfc/rfc9657">
        <front>
          <title>Time-Variant Routing (TVR) Use Cases</title>
          <author>
            <organization>IETF</organization>
          </author>
          <date year="2024"/>
        </front>
        <seriesInfo name="RFC" value="9657"/>
      </reference>
      <reference anchor="RFC9171" target="https://www.rfc-editor.org/rfc/rfc9171">
        <front>
          <title>Bundle Protocol Version 7</title>
          <author>
            <organization>IETF</organization>
          </author>
          <date year="2022"/>
        </front>
        <seriesInfo name="RFC" value="9171"/>
      </reference>
      <reference anchor="RFC9172" target="https://www.rfc-editor.org/rfc/rfc9172">
        <front>
          <title>Bundle Protocol Security (BPSec)</title>
          <author>
            <organization>IETF</organization>
          </author>
          <date year="2022"/>
        </front>
        <seriesInfo name="RFC" value="9172"/>
      </reference>
      <reference anchor="RFC9200" target="https://www.rfc-editor.org/rfc/rfc9200">
        <front>
          <title>Authentication and Authorization for Constrained Environments Using the OAuth 2.0 Framework (ACE-OAuth)</title>
          <author>
            <organization>IETF</organization>
          </author>
          <date year="2022"/>
        </front>
        <seriesInfo name="RFC" value="9200"/>
      </reference>
      <reference anchor="RFC9019" target="https://www.rfc-editor.org/rfc/rfc9019">
        <front>
          <title>A Firmware Update Architecture for Internet of Things</title>
          <author>
            <organization>IETF</organization>
          </author>
          <date year="2021"/>
        </front>
        <seriesInfo name="RFC" value="9019"/>
      </reference>
      <reference anchor="RFC9397" target="https://www.rfc-editor.org/rfc/rfc9397">
        <front>
          <title>Trusted Execution Environment Provisioning (TEEP) Architecture</title>
          <author>
            <organization>IETF</organization>
          </author>
          <date year="2023"/>
        </front>
        <seriesInfo name="RFC" value="9397"/>
      </reference>
      <reference anchor="TVR-WG" target="https://datatracker.ietf.org/wg/tvr/about/">
        <front>
          <title>Time-Variant Routing Working Group</title>
          <author>
            <organization>IETF</organization>
          </author>
          <date year="2026"/>
        </front>
      </reference>
      <reference anchor="DTN-WG" target="https://datatracker.ietf.org/wg/dtn/about/">
        <front>
          <title>Delay/Disruption Tolerant Networking Working Group</title>
          <author>
            <organization>IETF</organization>
          </author>
          <date year="2026"/>
        </front>
      </reference>
      <reference anchor="RATS-WG" target="https://datatracker.ietf.org/wg/rats/about/">
        <front>
          <title>Remote ATtestation ProcedureS Working Group</title>
          <author>
            <organization>IETF</organization>
          </author>
          <date year="2026"/>
        </front>
      </reference>
      <reference anchor="ACE-WG" target="https://datatracker.ietf.org/wg/ace/about/">
        <front>
          <title>Authentication and Authorization for Constrained Environments Working Group</title>
          <author>
            <organization>IETF</organization>
          </author>
          <date year="2026"/>
        </front>
      </reference>
      <reference anchor="SUIT-WG" target="https://datatracker.ietf.org/wg/suit/about/">
        <front>
          <title>Software Updates for Internet of Things Working Group</title>
          <author>
            <organization>IETF</organization>
          </author>
          <date year="2026"/>
        </front>
      </reference>
      <reference anchor="CCAMP-WG" target="https://datatracker.ietf.org/wg/ccamp/about/">
        <front>
          <title>Common Control and Measurement Plane Working Group</title>
          <author>
            <organization>IETF</organization>
          </author>
          <date year="2026"/>
        </front>
      </reference>
      <reference anchor="TEEP-WG" target="https://datatracker.ietf.org/wg/teep/about/">
        <front>
          <title>Trusted Execution Environment Provisioning Working Group (concluded)</title>
          <author>
            <organization>IETF</organization>
          </author>
          <date year="2026"/>
        </front>
      </reference>
      <reference anchor="TGPP-TR-38.821">
        <front>
          <title>Solutions for NR to support non-terrestrial networks (NTN)</title>
          <author>
            <organization>3GPP</organization>
          </author>
          <date year="2021"/>
        </front>
        <seriesInfo name="3GPP TR" value="38.821"/>
      </reference>
      <reference anchor="DAS-NTN-RF" target="https://datatracker.ietf.org/doc/draft-das-ntn-rf-execution-finality/">
        <front>
          <title>RF Enable Is Not Transmit Authority: Finality for LEO/NTN and Inter-Satellite Control</title>
          <author fullname="Sangam Das" initials="S." surname="Das"/>
          <date year="2026"/>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-das-ntn-rf-execution-finality"/>
      </reference>
      <reference anchor="DAS-6G-ORAN" target="https://datatracker.ietf.org/doc/draft-das-ai-native-6g-execution-finality/">
        <front>
          <title>Execution-Finality for AI-Native 5G/6G and O-RAN</title>
          <author fullname="Sangam Das" initials="S." surname="Das"/>
          <date year="2026"/>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-das-ai-native-6g-execution-finality"/>
      </reference>
      <reference anchor="DAS-RATS-EF" target="https://datatracker.ietf.org/doc/draft-das-rats-attestation-bnd-execution-finality/">
        <front>
          <title>Attestation-Bound Execution Finality for GPU, AI Accelerator, DPU, SmartNIC, and Confidential-Computing Infrastructure</title>
          <author fullname="Sangam Das" initials="S." surname="Das"/>
          <date year="2026"/>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-das-rats-attestation-bnd-execution-finality"/>
      </reference>
      <reference anchor="DAS-HW-EF" target="https://datatracker.ietf.org/doc/draft-das-hardware-enforced-execution-finality/">
        <front>
          <title>Computation Is Not Authority: Hardware-Enforced Execution-Finality for Agentic AI, MCP Tool Calls, and Industrial Agents</title>
          <author fullname="Sangam Das" initials="S." surname="Das"/>
          <date year="2026"/>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-das-hardware-enforced-execution-finality"/>
      </reference>
      <reference anchor="DAS-PROTOCOL-LAYER" target="https://datatracker.ietf.org/doc/draft-das-execution-finality-protocol-layer/">
        <front>
          <title>The Missing Protocol Layer for the Agentic Internet: Computation Is Not Authority</title>
          <author fullname="Sangam Das" initials="S." surname="Das"/>
          <date year="2026"/>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-das-execution-finality-protocol-layer"/>
      </reference>
      <reference anchor="DAS-EU-AI-ACT" target="https://datatracker.ietf.org/doc/draft-das-eu-ai-act-execution-enforcement/">
        <front>
          <title>Technical Enforcement of the EU AI Act and Global AI Laws for High-Risk AI Systems Without Relying on Paper Policies</title>
          <author fullname="Sangam Das" initials="S." surname="Das"/>
          <date year="2026"/>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-das-eu-ai-act-execution-enforcement"/>
      </reference>
      <reference anchor="DAS-DIGITAL-SOV" target="https://datatracker.ietf.org/doc/draft-das-digital-sovereignty-finality/">
        <front>
          <title>When Data Leaves Its Originating Jurisdiction, Who Controls It? Digital Sovereignty Without Data Localisation by Separating the Compute Plane from the Authority Plane</title>
          <author fullname="Sangam Das" initials="S." surname="Das"/>
          <date year="2026"/>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-das-digital-sovereignty-finality"/>
      </reference>
      <reference anchor="DAS-NTN-IMPL" target="https://github.com/sangmdas/NTN-and-Inter-Satellite-Control-Runnable-Reference-Implementation">
        <front>
          <title>NTN and Inter-Satellite Control -- Runnable Reference Implementation</title>
          <author fullname="Sangam Das" initials="S." surname="Das"/>
          <date year="2026"/>
        </front>
        <seriesInfo name="GitHub repository" value="sangmdas/NTN-and-Inter-Satellite-Control-Runnable-Reference-Implementation"/>
      </reference>
      <reference anchor="DAS-6G-ORAN-IMPL" target="https://github.com/sangmdas/Execution-Finality-for-AI-Native-5G-6G-and-O-RAN---Runnable-Reference-Implementation">
        <front>
          <title>Execution-Finality for AI-Native 5G/6G and O-RAN -- Runnable Reference Implementation</title>
          <author fullname="Sangam Das" initials="S." surname="Das"/>
          <date year="2026"/>
        </front>
        <seriesInfo name="GitHub repository" value="sangmdas/Execution-Finality-for-AI-Native-5G-6G-and-O-RAN---Runnable-Reference-Implementation"/>
      </reference>
      <reference anchor="DAS-GPU-IMPL" target="https://github.com/sangmdas/Execution-Finality-for-GPU-AI-Accelerators-and-Confidential-Workloads">
        <front>
          <title>Execution-Finality for GPU AI Accelerators and Confidential Workloads</title>
          <author fullname="Sangam Das" initials="S." surname="Das"/>
          <date year="2026"/>
        </front>
        <seriesInfo name="GitHub repository" value="sangmdas/Execution-Finality-for-GPU-AI-Accelerators-and-Confidential-Workloads"/>
      </reference>
      <reference anchor="DAS-HW-IMPL" target="https://github.com/sangmdas/Hardware-Execution-Finality-for-AI-and-Autonomous-Systems">
        <front>
          <title>Hardware Execution-Finality for AI and Autonomous Systems -- Reference Implementation</title>
          <author fullname="Sangam Das" initials="S." surname="Das"/>
          <date year="2026"/>
        </front>
        <seriesInfo name="GitHub repository" value="sangmdas/Hardware-Execution-Finality-for-AI-and-Autonomous-Systems"/>
      </reference>
      <reference anchor="DAS-AI-GOV-IMPL" target="https://github.com/sangmdas/Execution-Finality-Technical-Enforcement-for-EU-AI-Act-and-AI-Governance-Constraints">
        <front>
          <title>Execution-Finality Technical Enforcement for EU AI Act and AI Governance Constraints -- Runnable Reference Implementation</title>
          <author fullname="Sangam Das" initials="S." surname="Das"/>
          <date year="2026"/>
        </front>
        <seriesInfo name="GitHub repository" value="sangmdas/Execution-Finality-Technical-Enforcement-for-EU-AI-Act-and-AI-Governance-Constraints"/>
      </reference>
      <reference anchor="DAS-ZENODO-FOUNDATIONAL" target="https://zenodo.org/records/22082995">
        <front>
          <title>The Internet Solved Communication. It Never Solved Authority</title>
          <author fullname="Sangam Das" initials="S." surname="Das"/>
          <date year="2026"/>
        </front>
        <seriesInfo name="Zenodo" value="22082995"/>
      </reference>
      <reference anchor="DAS-ZENODO-GPU" target="https://zenodo.org/records/22308384">
        <front>
          <title>Architecture and Working Reference Implementation for GPUs, AI Accelerators, and Confidential Workloads</title>
          <author fullname="Sangam Das" initials="S." surname="Das"/>
          <date year="2026"/>
        </front>
        <seriesInfo name="Zenodo" value="22308384"/>
      </reference>
      <reference anchor="DAS-ZENODO-CANDIDATE" target="https://zenodo.org/records/22323362">
        <front>
          <title>Technical Architecture for Governing Consequential AI Agent Actions</title>
          <author fullname="Sangam Das" initials="S." surname="Das"/>
          <date year="2026"/>
        </front>
        <seriesInfo name="Zenodo" value="22323362"/>
      </reference>
    </references>
    <section anchor="profile-traceability" numbered="false">
      <name>Profile Construction and Traceability</name>
      <t>The sixty profiles are engineering decompositions and supported combinations of the satellite, NTN, orbital-compute, optical-link, resilience, update, privileged-control, orbital-mobility, sensing, end-of-life, and manufacturing/component-admission mechanisms used as the drafting basis for this document. They intentionally avoid reproducing patent-claim syntax. XML comments before each profile preserve the source claim identifiers, embodiment identifiers, or reviewed disclosure families used during drafting so that the author can audit whether a proposed profile is directly supported or is a combination of already disclosed elements. Profiles 51 through 60 were additionally selected for relevance to publicly described future satellite-manufacturing, space-mobility, servicing, and zero-debris roadmaps, but roadmap relevance does not expand the technical disclosure. Those comments do not alter the rendered Internet-Draft.</t>
    </section>
    <section anchor="ack" numbered="false">
      <name>Acknowledgements</name>
      <t>
        This document is an individual submission. Critical technical review is
        expressly invited, including corrections to the characterization of 3GPP,
        IETF, optical-network, spacecraft FDIR, update, attestation, authorization,
        and deployed satellite mechanisms. Identification of existing mechanisms
        that already provide an equivalent non-bypassable execution-to-effect
        property is particularly useful.
      </t>
    </section>
  </back>
</rfc>
