<?xml version="1.0" encoding="UTF-8"?>
<?xml-model href="rfc7991bis.rnc"?>
<!DOCTYPE rfc [
  <!ENTITY nbsp "&#160;">
  <!ENTITY zwsp "&#8203;">
  <!ENTITY nbhy "&#8209;">
  <!ENTITY wj "&#8288;">
]>
<rfc xmlns:xi="http://www.w3.org/2001/XInclude"
     docName="draft-das-crypto-execution-finality-00"
     ipr="trust200902"
     category="info"
     submissionType="independent"
     version="3"
     xml:lang="en"
     sortRefs="true"
     symRefs="true"
     tocInclude="true"
     tocDepth="3">

  <front>
    <title abbrev="Crypto Execution Finality">AI Safety and Custody Security: Execution Finality at the Signing, Delegation and Withdrawal Boundaries of Cryptocurrency Systems</title>
    <seriesInfo name="Internet-Draft" value="draft-das-crypto-execution-finality-00"/>

    <author fullname="Sangam Kumar Das" initials="S." surname="Das">
      <organization>Independent</organization>
      <address>
        <postal>
          <city>Balasore</city>
          <region>Odisha</region>
          <country>India</country>
        </postal>
        <phone>+91-9861363532</phone>
        <email>info@sangamdas.com</email>
        <!-- Add LinkedIn profile URL here before submission:
             <uri>https://www.linkedin.com/in/...</uri> -->
      </address>
    </author>

    <date year="2026" month="November" day="18"/>

    <area>Security</area>
    <workgroup>Independent Submission</workgroup>

    <keyword>AI safety</keyword>
    <keyword>cryptocurrency custody</keyword>
    <keyword>EIP-7702</keyword>
    <keyword>transaction signing</keyword>
    <keyword>hot wallet</keyword>
    <keyword>exchange withdrawal</keyword>
    <keyword>policy enforcement</keyword>
    <keyword>multisig</keyword>
    <keyword>MPC</keyword>
    <keyword>agentic AI</keyword>
    <keyword>fail-closed enforcement</keyword>

    <abstract>
      <t>A cryptographically valid signature can authorize a transaction that the organization never intended. The hard problem in digital-asset custody is therefore not only protecting keys. It is stopping compromised workflows, delegated code, misleading transaction displays, stolen credentials, and legitimate automation (including AI agents) from turning broad technical capability into unrestricted transfers.</t>
      <t>This document proposes defender-controlled, consequence-specific authorization at three boundaries: signing, wallet execution, and withdrawal release. The defender reconstructs the operation that would actually take effect from the transaction bytes and account state, holds it in a non-effective state, evaluates it against independent policy and a protected exposure ledger, and releases only a bounded, act-bound, single-use authority at a mandatory enforcement point. The document specifies placement by chain type, requirements, a state machine with crash and reorganization handling, EIP-7702 delegation controls, a catalogue of edge cases and twenty-four threat scenarios, and an acceptance-test method with a reference simulator. It states the limits plainly: an off-chain gate cannot stop a leaked key that submits directly to a permissionless network, and it fails if the enforcement layer is bypassed or compromised. No deployment, measured latency, or real-world prevention is claimed.</t>
    </abstract>

    <note title="Status of This Document" removeInRFC="true">
      <t>This is an individual, independent-submission Internet-Draft. It is a technical proposal and has not been adopted by any IETF working group.</t>
      <t>Basis of disclosure: this document is based on the Mothership application PCT/IB2026/055615, filed 4 June 2026 and publicly disclosed (published as WO 2026/150382 A2) on 16 July 2026. The full filing can be read by searching "Sangam Das" on WIPO PATENTSCOPE, by searching PCT/IB2026/055615 (pctib202655615), or at https://www.tdcommons.org/dpubs_series/12542/ . The filing text, not this draft, is authoritative for the patent disclosure.</t>
      <t>Incident descriptions are drawn from public third-party reports and are treated as reported accounts, not as independently reconstructed chain forensics. Any mention of products, standards, or organizations is for technical context only. It is not an endorsement, validation, or statement of infringement, and no third-party adoption is implied.</t>
    </note>
  </front>

  <middle>

    <!-- ===================================================== -->
    <section anchor="intro" numbered="true" toc="default">
      <name>Introduction</name>

      <t>Digital-asset custody has strong cryptographic building blocks: hardware security modules, multi-party computation, multisignature wallets, smart-contract wallets, transaction simulation, allowlists, rate limits, and chain monitoring. Large losses still occur when a signature that verifies correctly authorizes a consequence nobody approved. A multisignature threshold can be met while signers read an altered display. An HSM can correctly sign a request produced by compromised middleware. A delegated account can run code whose powers are far broader than its owner understood. A hot wallet can be emptied within minutes, faster than any human response.</t>

      <t>Two public incidents motivate the problem, and this document keeps them separate (<xref target="evidence"/>). The February 2025 theft from a major exchange involved tampering with a multisignature signing interface. The October 2026 reported theft from a major exchange's hot wallets involved leaked signing capability and, on at least one chain, an EIP-7702 delegation <xref target="EIP-7702"/>. Neither incident is reconstructed here, and this document does not claim the proposed architecture would have prevented either.</t>

      <t>The architecture here asks one additional question at the last enforceable boundary: given the exact bytes, account state, destination, value, code, and remaining exposure budget, may this specific operation take effect now? It complements multisig, MPC, HSMs, contract audits, risk engines, and monitoring. It replaces none of them.</t>

      <section anchor="scope" numbered="true" toc="default">
        <name>Scope</name>
        <t>The document covers: signing services and HSM or MPC policy layers; programmable wallets and smart accounts on EVM-compatible chains; centralized-exchange withdrawal release; bridge and treasury-upgrade paths; and AI agents or automation that prepare or request such operations. It addresses non-programmable chains only at the signing and release boundary, where on-chain policy is unavailable.</t>
      </section>

      <section anchor="nongoals" numbered="true" toc="default">
        <name>Non-Goals</name>
        <ul>
          <li>Preventing phishing, key theft, or malware infection on user or staff devices.</li>
          <li>Overruling a public blockchain: a validly signed transaction submitted directly to the network executes according to the chain's rules.</li>
          <li>Replacing smart-contract auditing, formal verification, or consensus security.</li>
          <li>Attributing any incident to any actor.</li>
        </ul>
      </section>

      <section anchor="how-to-read" numbered="true" toc="default">
        <name>How to Read This Document</name>
        <t>Sections 3 to 5 give the evidence, the problem, and the threat model. Sections 6 to 11 give the architecture, requirements, data objects, state machine, and exposure accounting. Sections 12 to 18 cover EIP-7702, signing hazards, custody models, independence, agents, bridges, and edge cases. <xref target="threats"/> is the threat-scenario catalogue. <xref target="simulation"/> and <xref target="app-sim"/> give the evaluation method and the reference simulator results. <xref target="faq"/> collects objections.</t>
      </section>
    </section>

    <!-- ===================================================== -->
    <section anchor="terms" numbered="true" toc="default">
      <name>Terminology</name>
      <t>The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in BCP 14 <xref target="RFC2119"/> <xref target="RFC8174"/> when, and only when, they appear in all capitals, as shown here.</t>
      <t>The names below describe architectural roles in this proposal. They are not established protocol or standard terms.</t>

      <dl newline="true" spacing="normal">
        <dt>Protected Consequence</dt>
        <dd>An effect whose unauthorized occurrence is unacceptable: a transfer, an allowance or permit, a code-delegation change, a withdrawal, a contract upgrade, a bridge release, a key or credential issuance, or a signature that releases any of these.</dd>

        <dt>Candidate Act</dt>
        <dd>The defender-side representation of the operation that would actually take effect, reconstructed from transaction bytes, calldata, account state, code hashes, delegate paths, and asset semantics, not from a request's description or a user-interface rendering.</dd>

        <dt>Non-Effective State</dt>
        <dd>A staging state in which the Candidate Act has produced no protected effect.</dd>

        <dt>Protected Validator</dt>
        <dd>A defender-controlled component, isolated from the transaction builder, that evaluates policy for a Candidate Act.</dd>

        <dt>Finality Sink</dt>
        <dd>The enforcement point that refuses to sign, execute, or release a Protected Consequence unless valid, current, act-bound authority is verified. It can be a protected signer, a wallet or contract rule, or an exchange withdrawal-release service.</dd>

        <dt>Bounded Authority</dt>
        <dd>Authorization limited to one Candidate Act or one narrow capability, by asset, amount, beneficiary, chain, target, code hash, time, and security epoch, consumable a bounded number of times.</dd>

        <dt>Exposure Ledger</dt>
        <dd>A protected shared record of committed and reserved value, supporting atomic reserve, commit, and release across parallel signers, agents, and chains.</dd>

        <dt>Receipt</dt>
        <dd>Authenticated evidence that binds a phase and its observed result to a Candidate Act, used for reconciliation and for deciding later authority.</dd>

        <dt>Mandatory</dt>
        <dd>A control is Mandatory for an effect if no route reaches that effect without passing it. Everything in this document depends on this property.</dd>
      </dl>
    </section>

    <!-- ===================================================== -->
    <section anchor="evidence" numbered="true" toc="default">
      <name>Incident Evidence and Factual Separation</name>

      <section anchor="ev-binance" numbered="true" toc="default">
        <name>Reported Exchange Theft, October 2026</name>
        <t>Public reports describe a large theft from a major exchange's hot wallets on 29 October 2026, on the order of USD 6.3 billion across several chains, including an Ethereum address labelled "Binance 14" on a block explorer. Reports describe an EIP-7702 delegation installing attacker-chosen code on that address, with the transfers submitted by a different address. Reports also say the delegation explains only part of the total: withdrawals on chains without account delegation, and ordinary signed transfers from another Ethereum wallet, were also reported, and several analyses point to how signing capability was obtained as the root cause rather than to the delegation feature <xref target="INCIDENT-REPORTS"/>. Some analyses describe about fifty delegation authorizations of which one matched the live account nonce. At least one source labels its nonce-range explanation as its own inference, so this document treats it as a test case, not as established fact.</t>
        <t>All figures and mechanisms in this section are third-party accounts requiring independent on-chain and primary-source confirmation.</t>
      </section>

      <section anchor="ev-bybit" numbered="true" toc="default">
        <name>Reported Exchange Theft, February 2025</name>
        <t>The February 2025 loss, reported at about USD 1.5 billion, is a separate case. A Japanese Financial Services Agency research paper discusses tampering with a multisignature wallet's web interface and misleading signer presentation <xref target="FSA-BYBIT"/>. EIP-7702 is not established as the mechanism of that theft, and the two incidents MUST NOT be conflated.</t>
      </section>

      <section anchor="ev-m365" numbered="true" toc="default">
        <name>Reported Outage-Themed Phishing, November 2026</name>
        <t>Following a Microsoft 365 service disruption on 12 November 2026, Microsoft Threat Intelligence reported a campaign on 13 November 2026 impersonating service-health notices, claiming held mail would be deleted within 24 hours unless a link was followed, and assessed it as consistent with credential phishing <xref target="MSFT-PHISH"/>. Public evidence does not establish credential capture, account takeover, or any downstream cryptocurrency loss. This document uses the campaign only as a plausible entry-stage pattern (<xref target="t-phish"/>).</t>
      </section>

      <section anchor="ev-table" numbered="true" toc="default">
        <name>What the Evidence Supports</name>
        <table anchor="tbl-evidence">
          <name>Evidence, supported reading, and caution</name>
          <thead><tr><th align="left">Evidence</th><th align="left">Supported reading</th><th align="left">Caution</th></tr></thead>
          <tbody>
            <tr><td>Exchange theft, Oct 2026</td><td>Valid signing capability plus delegation to attacker code on at least one chain</td><td>Third-party reports; delegation does not explain all losses; root cause of key or signature compromise not established here</td></tr>
            <tr><td>Exchange theft, Feb 2025</td><td>Compromised signing presentation in a multisig workflow</td><td>Separate event; not an EIP-7702 case</td></tr>
            <tr><td>Outage-themed phishing, Nov 2026</td><td>High-volume credential-phishing lure</td><td>No established account compromise or custody impact</td></tr>
            <tr><td>This proposal</td><td>Candidate Act plus independent consequence gate</td><td>Proposed; not shown to prevent any incident</td></tr>
          </tbody>
        </table>
        <t>These events support a defensible question: how can a custody system tell technically valid signing or execution apart from authorization of the actual destination, value, code path, and effect? They do not prove the proposal was present, absent, novel, effective, or sufficient.</t>
      </section>
    </section>

    <!-- ===================================================== -->
    <section anchor="problem" numbered="true" toc="default">
      <name>Problem Statement: A Signature Is Not Consequence Authority</name>

      <t>A signature proves that a signing capability was used under specified rules. It does not prove the organization intended the real downstream effect. Define the invariant:</t>
      <t keepWithNext="true">No Protected Consequence occurs unless the reconstructed effective operation satisfies a fresh, independently evaluated policy and the final effectuation boundary enforces that decision.</t>
      <t>The invariant is conditional on complete mediation. If a private key or an existing on-chain allowance permits a direct, unmediated transfer, an external validator cannot stop it afterwards.</t>

      <section anchor="why-fail" numbered="true" toc="default">
        <name>Why Conventional Controls Can Leave a Gap</name>
        <t>Modern custody already uses transaction policy engines, MPC approvals, allowlists, rate limits, time delays, code simulation, and monitoring, and these block many attacks. The claim here is narrower than "conventional controls fail". It is that three structural gaps can remain even when each control is correctly implemented.</t>

        <dl newline="true" spacing="normal">
          <dt>Semantic gap</dt>
          <dd>Controls verify who or what is signing, not necessarily what the final operation does. Multisig counts signatures over bytes signers may have seen misrepresented. An HSM signs a digest it is given. Simulation predicts behavior, but hidden state changes, upgradeable proxies, time-dependent logic, and multi-step composition can defeat it. Allowances and delegations grant future power without moving funds at signing time.</dd>

          <dt>Irreversibility gap</dt>
          <dd>Settlement on public chains is final within minutes. Monitoring and alerting detect, but a loss that completes in about twenty minutes is faster than most response processes. Detection is necessary and is not prevention. Evidence after the effect cannot undo it.</dd>

          <dt>Mediation gap</dt>
          <dd>A control protects only the routes that pass through it. A leaked raw key, an alternate signer, an emergency credential, a batch job, a direct RPC submission, a second chain, or a previously issued permit can reach the effect without passing the gate. Per-chain controls miss global intent. Per-transaction caps miss aggregation.</dd>
        </dl>

        <t>The table below states, for common controls, what each establishes and what can remain open.</t>
        <table anchor="tbl-conv">
          <name>Conventional controls and residual gaps</name>
          <thead><tr><th align="left">Control</th><th align="left">What it establishes</th><th align="left">Residual gap</th></tr></thead>
          <tbody>
            <tr><td>MFA, IAM, conditional access</td><td>Identity or permitted service access</td><td>Not exact asset, destination, or code intent</td></tr>
            <tr><td>Multisig</td><td>Threshold of signatures</td><td>Signers can approve misrepresented bytes</td></tr>
            <tr><td>HSM / MPC</td><td>Key protection, distributed signing</td><td>Compromised request construction; policy often limited to simple fields</td></tr>
            <tr><td>Allowlists, per-transaction caps</td><td>Known destination, bounded single transfer</td><td>Approvals, delegations, and aggregation can bypass</td></tr>
            <tr><td>Transaction simulation</td><td>Predicted call behavior</td><td>Hidden state, mutable code, ordering, and composition</td></tr>
            <tr><td>Monitoring, alerts</td><td>Detection and investigation</td><td>Late relative to irreversible settlement</td></tr>
            <tr><td>Smart-contract audit</td><td>Review of code at a point in time</td><td>Upgrades, delegation to other code, deployment-time substitution</td></tr>
            <tr><td>Finality gate (proposed)</td><td>Exact protected effect authorized</td><td>Fails if bypassed, corrupted, or the key submits directly to the chain</td></tr>
          </tbody>
        </table>
        <t>AI agents enlarge the surface by composing tools, iterating after failure, and operating at volume. The same finality problem exists without AI.</t>
      </section>
    </section>

    <!-- ===================================================== -->
    <section anchor="threatmodel" numbered="true" toc="default">
      <name>Threat Model</name>

      <section anchor="tm-assets" numbered="true" toc="default">
        <name>Protected Assets</name>
        <t>Funds and tokens under custody; allowances and permits that confer future spending; delegations and account code; signing keys and key shares; policy and governance state; upgrade authority; bridge release authority; withdrawal queues; and the evidence and ledgers that record exposure.</t>
      </section>

      <section anchor="tm-attacker" numbered="true" toc="default">
        <name>Attacker Capabilities</name>
        <t>The attacker MAY:</t>
        <ul>
          <li>compromise the transaction builder, dashboard, signer front end, or an AI agent, and control what operators and signers see;</li>
          <li>hold stolen service credentials, staff credentials, or one of several approver credentials;</li>
          <li>request many signatures, including speculative ones over nonce or parameter ranges;</li>
          <li>send requests in parallel across workers, agents, and chains;</li>
          <li>exploit retries, timeouts, reorganizations, and replacement transactions;</li>
          <li>replay old approvals, old policy bundles, or old receipts;</li>
          <li>induce a signer to authorize delegation to attacker-chosen or mutable code;</li>
          <li>attempt denial of service against the validator to create pressure to fail open;</li>
          <li>claim in natural language, or through a compromised agent, that an operation is approved.</li>
        </ul>
      </section>

      <section anchor="tm-assume" numbered="true" toc="default">
        <name>Trust Assumptions</name>
        <t>The protection in this document holds only if all of the following hold for the covered effects: the Finality Sink is Mandatory; the Protected Validator and policy authority are not controlled by the attacker; signing keys are non-exportable or the on-chain rule is itself mandatory; and the attacker does not simultaneously control the validator, the sink, the policy authority, and the audit and reconciliation channels. <xref target="limits"/> lists what happens when these fail.</t>
      </section>

      <section anchor="tm-out" numbered="true" toc="default">
        <name>Out of Scope</name>
        <t>Consensus attacks; compromise of a chain's client software; legal seizure; and attacks that need no signature (for example, direct exploitation of a vulnerable contract that holds funds) are out of scope except where they bear on the sink's placement.</t>
      </section>
    </section>

    <!-- ===================================================== -->
    <section anchor="arch" numbered="true" toc="default">
      <name>Architecture</name>

      <t>The attacker never has to take part. The defender builds the Candidate Act from what actually arrives at a defender-controlled boundary.</t>

      <figure anchor="fig-arch">
        <name>Defender-side control sequence (schematic, not an observed incident trace)</name>
        <artwork name="" type="ascii-art" align="left"><![CDATA[
 Request / workflow / AI tool / operator command
        |
        v
 Reconstruct actual operation: target, value, chain, calldata,
 code hash, beneficiary, allowance and delegation effects
        |
        v
 Hold as Candidate Act (NON-EFFECTIVE)
        |
        v
 Protected Validator: independent policy, fresh state,
 epoch, revocation, exposure ledger reservation
        |
   +----+--------------------+
   |                         |
 deny / hold /          issue Bounded Authority
 reconcile              (act-bound, single use)
   |                         |
   v                         v
 NO EFFECT            Finality Sink verifies authority + exact bytes
 (fail closed)        at signer / wallet rule / withdrawal release
                              |
                              v
                     Bounded effect + Receipt
]]></artwork>
      </figure>

      <section anchor="arch-planes" numbered="true" toc="default">
        <name>Three Control Planes</name>
        <dl newline="true" spacing="normal">
          <dt>A. Pre-signing control</dt>
          <dd>The gate sits inside the protected signing service, MPC policy quorum, or an HSM-adjacent authorization service, not in a web dashboard. It inspects the exact bytes or canonical semantics being signed, never an untrusted UI rendering, and the signer MUST be unable to sign protected effects through another path. Signing is itself a consequential release of authority, because a signed transaction can be broadcast later or through another relay.</dd>

          <dt>B. On-chain smart-wallet control</dt>
          <dd>Where assets sit in a programmable account, the rule is enforced in the actual contract execution path: destination allowlists, asset and value limits, session constraints, delegate-code allowlists, timelocks or vetoes. An off-chain decision alone is not enough if a valid key can invoke an unrestricted transfer directly.</dd>

          <dt>C. Exchange-controlled release control</dt>
          <dd>For centralized withdrawals, enforcement sits at the last internal release boundary: the custody transaction builder, signing authority, and broadcast control bind the approved withdrawal request to the exact destination, asset, chain, and amount. Post-broadcast reconciliation is required, but post-event monitoring is not preventive authorization.</dd>
        </dl>
        <t>No single location fits every chain or wallet design. Several gates may be needed. The decisive property is that every protected effect path is mediated.</t>
      </section>

      <section anchor="arch-noncoop" numbered="true" toc="default">
        <name>The Attacker Does Not Implement Candidate Acts</name>
        <t>A hostile builder, agent, or stolen credential simply sends ordinary requests. The defender reconstructs the Candidate Act. The attacker cannot avoid the gate by refusing to use it, provided the effect cannot be reached through an unmediated path.</t>
      </section>
    </section>

    <!-- ===================================================== -->
    <section anchor="reqs" numbered="true" toc="default">
      <name>Requirements</name>
      <dl newline="true" spacing="normal">
        <dt>R1. Bytes-derived reconstruction.</dt>
        <dd>The gate MUST derive the Candidate Act from the transaction bytes, calldata, account state, code hashes, delegate paths, and asset semantics. It MUST NOT rely on a memo, API endpoint name, or user-interface text. It MUST account for indirect effects: approvals, permits, delegatecall, multicall, hooks, and downstream recipients.</dd>

        <dt>R2. Complete mediation.</dt>
        <dd>Deployments MUST enumerate every route to each Protected Consequence (raw key, alternate signer, emergency signer, direct RPC, private relay, batch job, upgrade admin, bridge executor, previously issued allowance, second chain) and MUST either gate each route or record it as residual risk. A claim of non-bypassability MUST NOT be made without that inventory.</dd>

        <dt>R3. Independent policy authority.</dt>
        <dd>Policy MUST be held by an authority the transaction builder cannot modify. Policy updates MUST be authenticated, quorum-approved where feasible, versioned with a monotonic epoch, and protected against rollback (<xref target="t-rollback"/>).</dd>

        <dt>R4. Bounded authority.</dt>
        <dd>Authority MUST specify asset, maximum value, cumulative exposure, beneficiary set, chain identifier, target contract, calldata constraints, delegate-code hash, source wallet, expiry, nonce, security epoch, and execution environment. Unspecified fields MUST NOT become wildcards.</dd>

        <dt>R5. Act binding and single use.</dt>
        <dd>Authority MUST be bound to one Candidate Act or one narrow capability and MUST be consumed at most the permitted number of times, by the intended sink only. It MUST NOT behave as a transferable bearer token.</dd>

        <dt>R6. Atomic exposure accounting.</dt>
        <dd>The Exposure Ledger MUST reserve value atomically before signing, across all parallel signers, agents, and chains, and MUST hold the reservation through uncertain outcomes (<xref target="ledger"/>).</dd>

        <dt>R7. Delegation and approval are consequences.</dt>
        <dd>Granting a delegation, an allowance, a permit, a session key, or an upgrade right MUST be gated as its own Candidate Act, because it confers future power without moving funds at signing time.</dd>

        <dt>R8. Refuse unapproved authorizations.</dt>
        <dd>A protected signer MUST NOT produce delegation authorizations, typed-data permits, or similar future-power signatures except for an approved Candidate Act. It MUST NOT sign speculative batches over nonce or parameter ranges.</dd>

        <dt>R9. Anti-replay.</dt>
        <dd>Authorizations, receipts, and policy bundles MUST carry freshness (nonce, counter, or epoch) and sink-local consumption state. Old approvals and older policy epochs MUST be rejected.</dd>

        <dt>R10. TOCTOU closure.</dt>
        <dd>The decision MUST be bound to an integrity-protected digest of the final operation, the target state version, and the policy epoch, and MUST be rechecked at the sink immediately before or atomically with the effect.</dd>

        <dt>R11. Reconciliation, not blind retry.</dt>
        <dd>After a timeout, crash, replacement, drop, or reorganization, the system MUST enter HOLD and RECONCILE against authoritative chain state. It MUST NOT sign again with fresh authority until the original outcome is established or explicitly compensated.</dd>

        <dt>R12. Fail closed, tiered.</dt>
        <dd>If required authority is absent, stale, or unverifiable, the gate MUST prevent high-risk effects. Routine low-risk transfers MAY proceed on a local fast path using signed policy and protected local counters, so that an outage does not itself create pressure to disable the control.</dd>

        <dt>R13. Independence.</dt>
        <dd>The Protected Validator, policy authority, and signer MUST NOT share an administrator, credential store, or deploy pipeline whose compromise defeats all three. Shared-failure analysis is REQUIRED (<xref target="independence"/>).</dd>

        <dt>R14. Governed emergency paths.</dt>
        <dd>Break-glass and emergency-signer paths MUST require dual control, carry a small bounded budget and timelock, and be logged to an independent record.</dd>

        <dt>R15. Evidence before effect.</dt>
        <dd>For consequential acts, authorization evidence SHOULD exist before or atomically with the effect. Receipts MUST be authenticated and bound to the act.</dd>

        <dt>R16. Honest limits.</dt>
        <dd>Implementations MUST state which effects are covered, which routes are not mediated, and what happens if the sink, validator, or key custody is compromised.</dd>
      </dl>
    </section>

    <!-- ===================================================== -->
    <section anchor="placement" numbered="true" toc="default">
      <name>Finality Sink Placement</name>

      <section anchor="pl-rule" numbered="true" toc="default">
        <name>Placement Rule</name>
        <t>Place the sink in the lowest practical trusted component that exclusively controls the effect, and make every equivalent path converge on it. A check higher in the stack is supplementary if an alternate API, batch job, privileged account, or direct signer can reach the same effect.</t>
      </section>

      <section anchor="pl-conseq" numbered="true" toc="default">
        <name>Placement by Consequence</name>
        <table anchor="tbl-placement">
          <name>Effective gate and critical bypass to close</name>
          <thead><tr><th align="left">Consequence</th><th align="left">Effective gate</th><th align="left">Critical bypass to close</th></tr></thead>
          <tbody>
            <tr><td>Hot-wallet transfer</td><td>Protected signer plus wallet contract rule</td><td>Raw key or unrestricted RPC signer</td></tr>
            <tr><td>EIP-7702 delegation</td><td>Protected signer refusing unapproved authorizations; delegated-code policy</td><td>Direct signature offline; malicious or mutable delegate code</td></tr>
            <tr><td>Token approval or permit</td><td>Allowance cap and spender review at signer or wallet</td><td>Previously issued permit; setApprovalForAll</td></tr>
            <tr><td>Exchange withdrawal</td><td>Custody release, sign, and broadcast control</td><td>Privileged batch job or emergency key</td></tr>
            <tr><td>Bridge mint or release</td><td>Bridge verifier or release contract; dual-side proof</td><td>Alternative bridge executor</td></tr>
            <tr><td>Treasury or contract upgrade</td><td>Governance timelock and upgrade executor with independent veto</td><td>Unmediated admin upgrade</td></tr>
            <tr><td>Key or share release</td><td>HSM or MPC policy before share release</td><td>Alternate signer; exportable key</td></tr>
            <tr><td>Policy update</td><td>Quorum-signed policy with anti-rollback epoch</td><td>Builder-side policy edit; replay of old bundle</td></tr>
          </tbody>
        </table>
      </section>

      <section anchor="pl-chain" numbered="true" toc="default">
        <name>Placement by Chain Capability</name>
        <t>On-chain policy exists only where the chain's account model supports it. Elsewhere the gate must be at the signer or withdrawal-release layer, and the protection ends at that boundary.</t>
        <table anchor="tbl-chain">
          <name>Where enforcement can live, by account model</name>
          <thead><tr><th align="left">Account model</th><th align="left">On-chain rule possible?</th><th align="left">Where the gate must sit</th><th align="left">Main limit</th></tr></thead>
          <tbody>
            <tr><td>EVM externally owned account (EOA)</td><td>Not by default; possible after delegation to a policy module</td><td>Protected signer; delegation approval</td><td>A leaked key can sign and submit directly</td></tr>
            <tr><td>EVM smart account or ERC-4337 wallet</td><td>Yes (modules, session keys, validators)</td><td>Contract rule plus signer</td><td>Upgrade authority and module bugs</td></tr>
            <tr><td>EOA delegated under EIP-7702</td><td>Yes, inside the delegated code</td><td>Signer approving delegate hash; delegate policy</td><td>Delegate code quality; re-delegation by key holder</td></tr>
            <tr><td>UTXO chains (for example Bitcoin)</td><td>Limited by script</td><td>HSM or MPC policy and release layer</td><td>Script-level covenants limited</td></tr>
            <tr><td>Other account-based non-EVM chains</td><td>Chain-specific</td><td>Signer and release layer</td><td>Varies by chain features</td></tr>
            <tr><td>Centralized exchange internal ledger</td><td>Not applicable</td><td>Withdrawal release and custody signer</td><td>Insider and privileged job paths</td></tr>
          </tbody>
        </table>
      </section>
    </section>

    <!-- ===================================================== -->
    <section anchor="objects" numbered="true" toc="default">
      <name>Conceptual Data Objects</name>
      <t>This section lists what each object needs. It defines no wire format. A future revision or a chain-specific profile could specify canonical serialization (for example JSON canonicalization <xref target="RFC8785"/>), signature suites, and encodings. The field names are illustrative.</t>

      <dl newline="true" spacing="normal">
        <dt>Candidate Act descriptor</dt>
        <dd>act_id; chain_id; transaction type; resolved target and effective callee chain (including delegatecall targets); value; asset and token contract; calldata digest and decoded function; beneficiary set; code hash of each executed or delegated contract; account state version (nonce, balance); delegation designator state for the source account; requested time; originating workload identity.</dd>

        <dt>Authority Envelope</dt>
        <dd>Reference to the descriptor digest; issuer identity; policy epoch; maximum value and cumulative budget; beneficiary set; allowed code hashes; validity window (not-before, not-after); maximum consumption count; sink identity; nonce or counter; reservation identifier; issuer authenticator.</dd>

        <dt>Reservation</dt>
        <dd>Reservation id; act id; amount; ledger scope (wallet, global, or asset); state (RESERVED, COMMITTED, RELEASED); expiry; reconciliation owner.</dd>

        <dt>Receipt</dt>
        <dd>act_id; envelope reference; observed phase and result (for example SIGNED_NOT_BROADCAST, BROADCAST_PENDING, CONFIRMED, REVERTED, REPLACED, DROPPED, REORGED); transaction hash and nonce; confirmation depth; sink identity; sink-local counter; timestamp; authenticator. A Receipt MAY be required before a later phase of a multi-step operation.</dd>
      </dl>
      <t>Much of this can be built from existing primitives: threshold signatures <xref target="RFC9591"/>, remote attestation <xref target="RFC9334"/>, and typed-data signing <xref target="EIP-712"/>. The document does not claim novelty for those primitives individually. Its subject is the integrated invariants in <xref target="reqs"/>.</t>
    </section>

    <!-- ===================================================== -->
    <section anchor="states" numbered="true" toc="default">
      <name>State Machine and Crash Discipline</name>
      <t>The state machine separates intent, validation, signing, broadcast, and confirmed effect. A wallet or exchange MUST NOT infer actual effects from a memo or endpoint name.</t>

      <table anchor="tbl-states">
        <name>Candidate Act states</name>
        <thead><tr><th align="left">State</th><th align="left">Meaning</th><th align="left">Allowed next states and rule</th></tr></thead>
        <tbody>
          <tr><td>PROPOSED</td><td>Request received; no staging yet</td><td>STAGED_NON_EFFECTIVE, DENIED</td></tr>
          <tr><td>STAGED_NON_EFFECTIVE</td><td>Candidate Act reconstructed; no effect</td><td>VALIDATED, DENIED; expires</td></tr>
          <tr><td>VALIDATED</td><td>Policy passed; budget not yet reserved</td><td>SIGNING_RESERVED, DENIED</td></tr>
          <tr><td>SIGNING_RESERVED</td><td>Exposure reserved atomically; authority issued</td><td>SIGNED_NOT_BROADCAST, or release on explicit abort</td></tr>
          <tr><td>SIGNED_NOT_BROADCAST</td><td>Signature produced; transaction not yet public</td><td>BROADCAST_PENDING; signature is itself a consequential release</td></tr>
          <tr><td>BROADCAST_PENDING</td><td>Submitted; outcome unknown</td><td>CONFIRMED, REVERTED, REPLACED, DROPPED, RECONCILIATION_REQUIRED</td></tr>
          <tr><td>CONFIRMED</td><td>Included at required depth for this chain</td><td>Terminal; authority consumed; reservation committed</td></tr>
          <tr><td>REVERTED</td><td>Included but failed; fee and nonce effects remain</td><td>Terminal; reservation released after reconciliation</td></tr>
          <tr><td>RECONCILIATION_REQUIRED</td><td>Outcome uncertain (timeout, reorg, crash)</td><td>CONFIRMED, REVERTED, or bounded manual resolution; no new authority meanwhile</td></tr>
          <tr><td>DENIED</td><td>Policy failed or authority absent, stale, or mismatched</td><td>Terminal; no effect</td></tr>
        </tbody>
      </table>

      <t>A successful broadcast is not proof of confirmed settlement, and a receipt is not proof of finality under reorganization. Confirmation depth MUST follow the chain's consensus assumptions. A transaction that reverts can still cost fees and consume a nonce. Each transition has a defined authority, expiry, and idempotency rule. Consumption of authority and reservation MUST be durably recorded before the signature is released, and INDETERMINATE outcomes MUST be resolved by querying authoritative state, never by issuing fresh authority.</t>
    </section>

    <!-- ===================================================== -->
    <section anchor="ledger" numbered="true" toc="default">
      <name>Exposure Ledger and Bounded Authority</name>

      <section anchor="ld-reserve" numbered="true" toc="default">
        <name>Reserve, Commit, Release</name>
        <t>A per-transaction limit does not stop an agent from splitting a large theft into many small transfers. The system keeps a protected cumulative ledger and reserves exposure atomically before any signature. Reservation states are RESERVED, COMMITTED, and RELEASED. A reservation MUST be held through uncertain broadcast outcomes. Releasing it early lets a retry spend the same budget twice (<xref target="t-retry"/>).</t>
        <table anchor="tbl-predicates">
          <name>Example synthetic predicates and failure responses</name>
          <thead><tr><th align="left">Predicate</th><th align="left">Example policy</th><th align="left">Failure response</th></tr></thead>
          <tbody>
            <tr><td>Asset</td><td>One stablecoin only</td><td>Deny other tokens</td></tr>
            <tr><td>Beneficiary</td><td>Allowlisted treasury account</td><td>Hold new address</td></tr>
            <tr><td>Per operation</td><td>At most 100 units</td><td>Deny 101</td></tr>
            <tr><td>Rolling window</td><td>At most 300 units per hour</td><td>Deny aggregate excess</td></tr>
            <tr><td>Global cap</td><td>At most 400 units across all chains</td><td>Deny aggregate excess on any chain</td></tr>
            <tr><td>Delegate</td><td>Pinned code hash</td><td>Hold code change</td></tr>
            <tr><td>Time</td><td>Five-minute expiry</td><td>Require new authority</td></tr>
          </tbody>
        </table>
      </section>

      <section anchor="ld-scope" numbered="true" toc="default">
        <name>Ledger Scope</name>
        <ul>
          <li>Multiple agents MUST share one ledger. Agent A reserving 400 and Agent B reserving another 400 against a 500 limit MUST NOT both succeed.</li>
          <li>The ledger MUST be chain-agnostic where policy intent is global. Per-chain ledgers allow a split across chains to exceed the global cap (<xref target="t-multichain"/>).</li>
          <li>Valuation of non-stable assets for USD-denominated caps MUST use a protected price source with bounds, or caps SHOULD be expressed in asset units (<xref target="t-oracle"/>).</li>
          <li>Rolling windows MUST use a protected monotonic clock source, with defined behavior at window boundaries, daylight-saving transitions, and clock skew.</li>
        </ul>
      </section>
    </section>

    <!-- ===================================================== -->
    <section anchor="eip7702" numbered="true" toc="default">
      <name>EIP-7702 Delegation Controls</name>

      <section anchor="e7-mech" numbered="true" toc="default">
        <name>Mechanics Relevant to Defense</name>
        <t>EIP-7702 <xref target="EIP-7702"/> lets an externally owned account designate executable code through a signed authorization tuple containing a chain identifier, a delegation target address, and a nonce. A transaction carrying an authorization list installs a delegation designator on the account, so the account's own address then runs the delegated code. The delegation persists until replaced, and pointing it to the zero address clears it. The specification warns that poorly designed delegate contracts can allow near-complete control of the account, and it identifies replay protection and binding of value, gas, target, and calldata as security considerations.</t>
        <t>Points that matter for defenders:</t>
        <ul>
          <li>The authorization is a signature. Anyone can submit it, so the submitting address need not be the account owner, and an attacker who can obtain a valid signature can have it relayed from elsewhere.</li>
          <li>An authorization may carry chain identifier zero, which the specification allows to apply on any chain. That widens the effect of one signature.</li>
          <li>The authorization nonce must match the account's live nonce. A signer that produces authorizations for a range of nonces gives an attacker several chances for one to match.</li>
          <li>Delegated code runs in the account's own context and storage. Re-delegation to different code can collide with storage left by earlier code.</li>
          <li>Checks that assume an account has no code, or that assume the transaction origin equals the caller, may behave differently for delegated accounts.</li>
          <li>Delegation and later execution are separate phases. A protected design must assess both.</li>
        </ul>
      </section>

      <section anchor="e7-rules" numbered="true" toc="default">
        <name>Defensive Design</name>
        <ol>
          <li>Treat authorization to delegate as a high-risk Candidate Act distinct from any later transfer.</li>
          <li>The protected signer MUST NOT sign an EIP-7702 authorization unless the descriptor matches an approved delegation act (R8). It MUST NOT sign speculative nonce ranges.</li>
          <li>Resolve the actual delegation address from the bytes and verify its code hash, upgradeability, chain scope (including chain identifier zero), nonce, initialization call, account state, intended permissions, and revocation path.</li>
          <li>Reject delegation to unknown or mutable code. Where a proxy is unavoidable, pin the implementation hash, govern upgrade rights, and monitor.</li>
          <li>After delegation, enforce per-effect limits inside the delegated implementation or through a mandatory upstream signer. Do not assume the delegation signature enforces downstream spend limits.</li>
          <li>Pre-authorize a tested revocation path: an authorization that points the account back to the zero address, plus key rotation and sweep procedures (<xref target="ops"/>).</li>
          <li>Monitor accounts for unexpected delegation designators and alert on any change.</li>
        </ol>
        <t>The on-chain network cannot consult an off-chain Finality Sink unless the delegated contract is explicitly written to require cryptographic proof or to enforce its own policy. If an attacker already holds the private key and can sign and submit an authorization directly, an off-chain policy cannot prevent it (<xref target="t-leak"/>).</t>
      </section>
    </section>

    <!-- ===================================================== -->
    <section anchor="hazards" numbered="true" toc="default">
      <name>Signing-Surface Hazards</name>
      <dl newline="true" spacing="normal">
        <dt>Misleading presentation</dt>
        <dd>A compromised front end can show a familiar destination and description while the bytes change a wallet implementation or grant privileged execution. A second copy of the same compromised front end is not a defense. Use independently sourced payload decoding, known-contract registries, a protected hardware display where feasible, and signer-enforced transaction hashes. Signers should approve a canonical rendering derived from the exact payload, and the protected signer should refuse if the code hash, call target, storage effects, or transfer envelope differ from policy.</dd>

        <dt>Blind signing</dt>
        <dd>Signing an opaque hash or typed data without decoding it is a consequence-blind act. Clear signing, structured typed data <xref target="EIP-712"/>, and signer-side decoding reduce the risk. Typed-data permits can grant spending authority without a transaction.</dd>

        <dt>Allowances and permits</dt>
        <dd>An ERC-20 approval or a signed permit can authorize later spending without a fresh owner signature. A policy that checks only immediate outflow misses the authority transfer. Approvals and setApprovalForAll-style grants are Protected Consequences (R7).</dd>

        <dt>Address poisoning and lookalike destinations</dt>
        <dd>Attackers seed histories with lookalike addresses so an operator copies the wrong one. Beneficiary binding MUST use full-address allowlists and MUST NOT rely on prefix and suffix matching or history.</dd>

        <dt>Name resolution</dt>
        <dd>A human-readable name can resolve to a different address later. Policy MUST bind the resolved address at decision time and recheck at the sink.</dd>

        <dt>Multisignature workflow</dt>
        <dd>A multisig satisfies a threshold over bytes. It does not by itself verify the economic effect of an arbitrary contract call. Do not assume a generic hardware wallet or multisig verifies the effect.</dd>
      </dl>
    </section>

    <!-- ===================================================== -->
    <section anchor="custody" numbered="true" toc="default">
      <name>Custody Models and Operational Trade-Offs</name>
      <t>Hot wallets favor availability and automated throughput. Cold wallets favor key isolation and deliberate authorization. Both can suffer semantic authorization failures if a signer approves malicious bytes, and the right control placement differs.</t>
      <table anchor="tbl-custody">
        <name>Primary enforcement and operational concern by custody architecture</name>
        <thead><tr><th align="left">Architecture</th><th align="left">Primary enforcement</th><th align="left">Operational concern</th></tr></thead>
        <tbody>
          <tr><td>Hot-wallet exchange</td><td>Signer and withdrawal release; rolling budgets</td><td>Latency, throughput, batching; blast radius if key leaks</td></tr>
          <tr><td>Cold multisig</td><td>Trusted payload rendering and contract policy</td><td>Semantic display integrity; slow response</td></tr>
          <tr><td>MPC custody</td><td>Quorum policy and share release</td><td>Collusion and shared policy failures; policy expressiveness</td></tr>
          <tr><td>HSM-backed signer</td><td>Policy engine adjacent to the HSM</td><td>HSM signs what the builder sends unless it decodes</td></tr>
          <tr><td>Smart-account treasury</td><td>On-chain policy module</td><td>Upgrade authority and delegate security</td></tr>
          <tr><td>EOA with direct key</td><td>Wallet signer only</td><td>Cannot stop externally submitted valid signatures</td></tr>
        </tbody>
      </table>
      <t>For hot wallets, combine protected signer policies, rolling exposure budgets, per-beneficiary controls, code and delegate checks, withdrawal queues, and emergency circuit breakers. For cold wallets, use trusted transaction rendering, separated approvals, independent payload reconstruction, delayed high-risk upgrades, and verified on-chain settlement receipts.</t>
      <t>A policy that freezes every routine withdrawal becomes operationally unacceptable and invites bypass. Tiered controls are RECOMMENDED: low-risk known-destination transfers receive deterministic fast checks; new beneficiaries, contract upgrades, delegation changes, and high-value transfers receive stricter verification and possibly timelocks.</t>
      <t>Large hot-wallet fleets deserve extra caution. If many wallets share one key-derivation root, one signing service, or one deploy pipeline, a single compromise reaches all of them at once. Spreading risk across independent signers and capping per-wallet balances limits blast radius.</t>
    </section>

    <!-- ===================================================== -->
    <section anchor="independence" numbered="true" toc="default">
      <name>Independence and Shared-Failure Analysis</name>
      <t>Independence is an architectural property. A second process with the same administrator, credentials, and deploy pipeline is not independent. The policy evaluator SHOULD receive independently attested context, while the signer or wallet enforces the resulting narrowly scoped decision.</t>
      <t>Consider separate key domains, protected policy storage, quorum-based policy updates, attested signer binaries, anti-rollback versioning, independent code-hash verification, and key release only after validation. Do not let an administrator of the transaction builder modify both policy and signing logic.</t>
      <t>Independence fails if the attacker compromises a common kernel, a shared CI/CD system, a hypervisor, a root cloud account, or a wallet upgrade authority. Deployments MUST therefore document shared-failure analysis explicitly and MUST NOT claim absolute non-bypassability.</t>
      <table anchor="tbl-shared">
        <name>Common-mode failure checklist</name>
        <thead><tr><th align="left">Shared element</th><th align="left">Question to answer</th></tr></thead>
        <tbody>
          <tr><td>Administrator or identity provider</td><td>Can one account change policy, validator, and signer?</td></tr>
          <tr><td>CI/CD and build signing</td><td>Can one pipeline ship altered signer or validator binaries?</td></tr>
          <tr><td>Cloud root account or hypervisor</td><td>Can one control plane read keys or edit policy state?</td></tr>
          <tr><td>Key hierarchy</td><td>Do policy keys and signing keys share a root?</td></tr>
          <tr><td>Upgrade authority</td><td>Can one party replace the on-chain policy module?</td></tr>
          <tr><td>Monitoring and audit</td><td>Can the same attacker silence all evidence channels?</td></tr>
        </tbody>
      </table>
    </section>

    <!-- ===================================================== -->
    <section anchor="agents" numbered="true" toc="default">
      <name>AI Agents, MCP, and Delegated Tools</name>
      <t>A custody assistant may legitimately read balances, prepare transactions, and query risk limits. It MUST NOT inherit authority to finalize withdrawals. Tool discoverability, successful authentication, and valid arguments do not constitute transfer authority. Permission to prepare an operation is not permission to finalize it.</t>
      <ul>
        <li>For MCP or other tool chains, put the gate at the real wallet signing or withdrawal effect boundary, not only at the agent framework's dispatcher. If the agent can call the underlying signing or exchange API directly with the same credentials, a dispatcher-only check is bypassed.</li>
        <li>The agent can stage an operation. A protected service reconstructs the effective transfer and checks policy independently. Tool output MUST NOT be treated as proof of a committed effect.</li>
        <li>Multiple agents share the same Exposure Ledger. Failures produce HOLD and RECONCILE, not blind retry.</li>
        <li>Composition: an agent may chain individually permitted tools into a harmful outcome (read balances, build a transfer, request a signature, broadcast). The final signing or release is the Candidate Act, and tool-by-tool permission is not enough.</li>
        <li>Prompt injection can change what an agent requests. The sink MUST NOT accept model text, an agent's claim of approval, or an unsigned tool result as authorization.</li>
        <li>Delegation from one agent to another MUST attenuate. A child agent MUST NOT inherit the parent's full signing or release authority.</li>
      </ul>
    </section>

    <!-- ===================================================== -->
    <section anchor="bridges" numbered="true" toc="default">
      <name>Cross-Chain, Bridge, Stablecoin, and Allowance Hazards</name>
      <t>An apparent transfer can be implemented as a token transfer, approval, permit, delegated call, bridge lock, mint, swap, or multicall. The final effect can differ from the visible top-level function, so policy must account for transitive effects and stateful approvals.</t>
      <table anchor="tbl-hidden">
        <name>Operations with hidden downstream consequences</name>
        <thead><tr><th align="left">Operation</th><th align="left">Hidden consequence</th><th align="left">Proposed gate</th></tr></thead>
        <tbody>
          <tr><td>approve or permit</td><td>Future third-party spend</td><td>Allowance cap and spender review</td></tr>
          <tr><td>delegatecall</td><td>Code executes in the wallet's context</td><td>Pinned code and storage-effect policy</td></tr>
          <tr><td>bridge lock or release</td><td>Cross-chain mint or release</td><td>Dual-side proof, limits, and finality depth</td></tr>
          <tr><td>swap or intent</td><td>Variable execution route and price</td><td>Slippage, destination, and token bounds</td></tr>
          <tr><td>multicall</td><td>Composition of effects</td><td>Evaluate full-call semantics, not the first call</td></tr>
          <tr><td>token hooks or callbacks</td><td>Reentrant or side-effecting transfers</td><td>Treat hooks as part of the Candidate Act</td></tr>
        </tbody>
      </table>
      <t>Bridge transfers need matching source-chain lock and destination-chain release evidence, with reorganization and finality assumptions stated. Stablecoin issuers may offer pause or freeze functions, but availability and legal authorization vary. A sink MUST NOT assume every token can be frozen or clawed back after settlement.</t>
    </section>

    <!-- ===================================================== -->
    <section anchor="edge" numbered="true" toc="default">
      <name>Edge Cases</name>
      <t>These cases test whether an implementation holds its invariants at the boundaries. Each states the hazard and the required handling.</t>

      <section anchor="edge-chain" numbered="true" toc="default">
        <name>Chain and Settlement Edge Cases</name>
        <dl newline="true" spacing="normal">
          <dt>EC1. Reorganization after confirmation</dt>
          <dd>A transaction seen as confirmed is removed or reordered. Keep exposure reserved until the chain-appropriate finality depth. Do not consume authority or release the reservation on a shallow confirmation. Re-run reconciliation after any reorganization signal.</dd>

          <dt>EC2. Replacement transaction (same nonce)</dt>
          <dd>A fee-bumped or cancel transaction replaces the original. Track transaction identity per nonce. If a replacement confirms, the original is REPLACED and its reservation resolves against the replacement's actual effect, which may differ from the original Candidate Act. Treat a replacement as a new Candidate Act when its bytes differ.</dd>

          <dt>EC3. Dropped transaction</dt>
          <dd>A pending transaction vanishes from the mempool. Do not assume failure. Query nonce and receipt state, then decide. Keep the reservation until the nonce is known to be consumed elsewhere or the transaction cannot still confirm.</dd>

          <dt>EC4. Nonce gaps and stuck queues</dt>
          <dd>An earlier stuck transaction blocks later ones. Resolving it by cancelling or replacing is itself a consequential act and passes the gate.</dd>

          <dt>EC5. Fee spikes and failed execution</dt>
          <dd>A reverted transaction still burns fees and consumes the nonce. Reservation accounting MUST include fee exposure and MUST NOT treat a revert as zero effect.</dd>

          <dt>EC6. Private relays and alternate broadcast</dt>
          <dd>A signed transaction can be sent through any relay, including private ones, at any later time. The signature is the consequential release, so the gate sits before signing, and signed-but-unbroadcast transactions are tracked with expiry (for example by validity windows or by nonce invalidation).</dd>

          <dt>EC7. Layer-2 sequencer outage and forced inclusion</dt>
          <dd>When a sequencer is down, users may force inclusion through the base layer, with different timing and ordering. Reconciliation MUST understand each route's finality and MUST NOT assume a single path to settlement.</dd>

          <dt>EC8. Hard forks and chain splits</dt>
          <dd>A fork can make one transaction valid on two chains. Chain identifiers bind a signature to one chain, except an authorization using chain identifier zero, which applies broadly. Policy SHOULD reject chain-identifier-zero authorizations unless explicitly approved.</dd>

          <dt>EC9. Bridge finality mismatch</dt>
          <dd>A destination chain mints before the source chain is final. Require source-finality depth before authorizing the destination effect, and cap per-window bridge exposure.</dd>
        </dl>
      </section>

      <section anchor="edge-asset" numbered="true" toc="default">
        <name>Asset and Token Edge Cases</name>
        <dl newline="true" spacing="normal">
          <dt>EC10. Fee-on-transfer, rebasing, and elastic-supply tokens</dt>
          <dd>The amount received or held differs from the amount in calldata. Bind caps to the effective balance change observed in simulation and verify after settlement, not only to the argument.</dd>

          <dt>EC11. Upgradeable and blacklistable tokens</dt>
          <dd>Token logic can change, or a token can freeze the destination. Pin token implementation hashes for covered assets, and treat issuer-side freezes as external events, not as protection.</dd>

          <dt>EC12. Hooks and reentrancy</dt>
          <dd>A token or recipient executes code during transfer. Include callee code and hooks in reconstruction, and set gas and call-depth limits so a hook cannot trigger an unreviewed second effect.</dd>

          <dt>EC13. Dust and many-small-transfer attacks</dt>
          <dd>Many tiny transfers evade per-transfer thresholds or flood the validator. Aggregate by identity, destination, and window, and apply admission control.</dd>

          <dt>EC14. Valuation and volatility</dt>
          <dd>A USD cap on a volatile asset can be exceeded by price movement or oracle manipulation. Prefer unit caps for volatile assets, or use bounded, protected price sources with deviation limits.</dd>

          <dt>EC15. Multi-asset multicall</dt>
          <dd>One call moves several assets. The cap is applied per asset and in aggregate, using the effective effects from simulation plus a post-state check where the substrate allows.</dd>
        </dl>
      </section>

      <section anchor="edge-system" numbered="true" toc="default">
        <name>System and Operations Edge Cases</name>
        <dl newline="true" spacing="normal">
          <dt>EC16. Validator timeout, split brain, duplicate act identifiers</dt>
          <dd>Two validator replicas decide the same act differently or a client retries with the same act_id. Authority is issued by a single linearizable source per ledger scope, and the sink rejects a second consumption of one act_id.</dd>

          <dt>EC17. Crash between consumption and confirmation</dt>
          <dd>The sink records consumption, then fails before the signature or broadcast confirmation. On restart the act is INDETERMINATE. Resolve by querying authoritative state. Do not re-issue authority.</dd>

          <dt>EC18. Policy rollback and downgrade</dt>
          <dd>An older, validly signed policy is replayed to raise caps. Enforce monotonic policy epochs at the validator and sink. A downgrade requires an explicit, quorum-approved, logged procedure.</dd>

          <dt>EC19. Key rotation mid-flight</dt>
          <dd>Authority issued under an old key or epoch arrives after rotation. Authority carries the epoch, and a sink rejects authority from a retired epoch. Pending acts are re-evaluated under the new epoch, not silently honored.</dd>

          <dt>EC20. Clock skew, daylight-saving, and window boundaries</dt>
          <dd>Rolling windows and expiries depend on time. Use a protected monotonic source, define behavior at boundaries, tolerate bounded skew in one direction only (never extending a window), and test around transitions.</dd>

          <dt>EC21. Break-glass during an incident</dt>
          <dd>Emergency paths are needed and are an attack surface. Require dual control, a small budget, a timelock where safe, and independent logging, and test them regularly.</dd>

          <dt>EC22. Validator outage under load</dt>
          <dd>An outage creates pressure to disable the gate. Keep a routine local fast path with signed policy and protected local counters, hold high-risk effects, rate-limit, and define an authorized degraded mode in advance.</dd>

          <dt>EC23. Insider with policy-administration rights</dt>
          <dd>A single administrator approves theft. Separate governance from signing, require quorum for policy changes, and log changes to an independent record. Test common-mode compromise.</dd>

          <dt>EC24. Legacy wallets that cannot host a module</dt>
          <dd>Where an old wallet cannot enforce on-chain policy, move funds to a wallet that can, or place a mandatory protected signer in front, and record the residual risk until migration finishes.</dd>

          <dt>EC25. Legal or regulatory holds</dt>
          <dd>A court or regulator may require freezing or release. These are separately authorized acts and MUST pass the same gate with their own authority and evidence, not a side door.</dd>
        </dl>
      </section>
    </section>

    <!-- ===================================================== -->
    <section anchor="threats" numbered="true" toc="default">
      <name>Threat Scenario Catalogue</name>
      <t>Each scenario states the attack, why conventional controls can miss it, the proposed mitigation, the residual risk, and the test. Scenarios are illustrative and synthetic. Where a scenario resembles a reported incident, that is for motivation only, and no claim is made about the actual incident trace. Scenario identifiers T1 to T24 are referenced by the simulator in <xref target="app-sim"/> where one exists (S01 to S14).</t>

      <section anchor="t-leak" numbered="true" toc="default">
        <name>T1: Leaked Hot-Wallet Key and Delegation to an Attacker Sweeper</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>An attacker holds signing capability for a hot wallet, signs an EIP-7702 authorization delegating the account to a sweeper contract, has it relayed from another address, then drains assets in minutes.</dd>
          <dt>Why conventional controls miss it</dt><dd>The signature is valid. Transfer-focused policy does not see a delegation as a transfer. If the key signs offline and submits directly, no off-chain gate is consulted. Monitoring sees it after settlement.</dd>
          <dt>Mitigation</dt><dd>Keys non-exportable, so signing happens only inside the protected signer, which refuses unapproved delegation authorizations (R8). For EVM wallets, move custody to smart accounts or delegated policy modules whose limits the key cannot bypass. Cap per-wallet balances to bound blast radius.</dd>
          <dt>Residual risk</dt><dd>If the raw key is exfiltrated and the account stays an unrestricted EOA, the off-chain layer cannot stop direct submission (S14). Only the on-chain mandatory rule or key non-exportability helps.</dd>
          <dt>Test</dt><dd>S05, S07, S14; add a test that the signer refuses a delegation authorization with a valid but unapproved target.</dd>
        </dl>
      </section>

      <section anchor="t-multichain" numbered="true" toc="default">
        <name>T2: Parallel Multi-Chain Drain</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>Withdrawals are launched on several chains at once, each below its own cap, so the sum exceeds the organization's intent.</dd>
          <dt>Why conventional controls miss it</dt><dd>Per-chain counters do not see the global total. Chains without smart-account features cannot enforce on-chain rules at all.</dd>
          <dt>Mitigation</dt><dd>A single chain-agnostic Exposure Ledger and a global cap. For non-programmable chains the gate is at the signer and release layer.</dd>
          <dt>Residual risk</dt><dd>Ledger availability and integrity become critical. Compromise of the ledger voids the cap.</dd>
          <dt>Test</dt><dd>S08.</dd>
        </dl>
      </section>

      <section anchor="t-ui" numbered="true" toc="default">
        <name>T3: Compromised Signing Interface Misleading Multisig Signers</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>A compromised interface shows signers a familiar destination while the signed bytes change a wallet implementation or call. A valid threshold approves.</dd>
          <dt>Why conventional controls miss it</dt><dd>The threshold is satisfied by legitimate signers over what they were shown.</dd>
          <dt>Mitigation</dt><dd>Independent decoding of the bytes, a canonical rendering from a separate trusted source, protected hardware display where feasible, signer-enforced digests, and refusal when code hash, target, or storage effects differ from policy (R1).</dd>
          <dt>Residual risk</dt><dd>If the decoder or the trusted display shares the compromised path, it fails.</dd>
          <dt>Test</dt><dd>S05 (substitution of target while displaying an approved one).</dd>
        </dl>
      </section>

      <section anchor="t-deleg" numbered="true" toc="default">
        <name>T4: Induced Delegation to Malicious or Mutable Code</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>A phishing or compromised workflow persuades an owner to sign a valid delegation to attacker-controlled code, or to a proxy whose implementation changes after approval.</dd>
          <dt>Why conventional controls miss it</dt><dd>The signature is genuine. Address allowlists check the address, not the code behind it.</dd>
          <dt>Mitigation</dt><dd>Pin the code hash. Reject unknown or mutable delegates. Govern upgrade rights. Enforce per-call limits inside the delegate or through a mandatory signer.</dd>
          <dt>Residual risk</dt><dd>A trusted, audited delegate with its own bug.</dd>
          <dt>Test</dt><dd>S05, S06.</dd>
        </dl>
      </section>

      <section anchor="t-batch" numbered="true" toc="default">
        <name>T5: Speculative Authorization Batch Over a Nonce Range</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>A compromised builder asks the signer for many delegation authorizations covering a range of account nonces, so that at least one matches the live nonce when submitted.</dd>
          <dt>Why conventional controls miss it</dt><dd>Each request is an individually valid, well-formed signing request. Request counts may be low.</dd>
          <dt>Mitigation</dt><dd>The signer refuses any delegation authorization without an approved act (R8), and refuses multi-nonce batches. Alert on repeated requests for future-power signatures.</dd>
          <dt>Residual risk</dt><dd>None if the signer is Mandatory. Total if the key signs elsewhere.</dd>
          <dt>Test</dt><dd>S07. This scenario is a test case; the reported nonce-range explanation for the October 2026 incident is unconfirmed.</dd>
        </dl>
      </section>

      <section anchor="t-split" numbered="true" toc="default">
        <name>T6: Split Withdrawals Below Per-Transaction Limits</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>One large theft is cut into many small transfers across workers, each under the per-transaction cap.</dd>
          <dt>Why conventional controls miss it</dt><dd>A signer enforcing only a per-transaction cap approves all of them.</dd>
          <dt>Mitigation</dt><dd>Protected cumulative ledger, atomic reservation, beneficiary allowlist.</dd>
          <dt>Residual risk</dt><dd>Slow, below-threshold drains to an allowlisted beneficiary that has itself been compromised.</dd>
          <dt>Test</dt><dd>S01, S02, S03.</dd>
        </dl>
      </section>

      <section anchor="t-allow" numbered="true" toc="default">
        <name>T7: Allowance and Permit Drain</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>A signer is induced to grant a large allowance or sign a permit to an attacker spender, who later pulls funds without a new signature.</dd>
          <dt>Why conventional controls miss it</dt><dd>No funds move at signing time, so transfer policy passes it.</dd>
          <dt>Mitigation</dt><dd>Treat approvals and permits as Protected Consequences (R7): cap, spender allowlist, expiry. Review and revoke existing allowances.</dd>
          <dt>Residual risk</dt><dd>Allowances issued before the gate existed remain exploitable until revoked.</dd>
          <dt>Test</dt><dd>S12.</dd>
        </dl>
      </section>

      <section anchor="t-multicall" numbered="true" toc="default">
        <name>T8: Hidden Effects Through Multicall, Delegatecall, and Hooks</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>The top-level call looks benign while a nested call, a delegatecall into attacker code, or a token hook moves value or changes state.</dd>
          <dt>Why conventional controls miss it</dt><dd>Policy reads the first function name or a simulation that does not follow hidden dependencies.</dd>
          <dt>Mitigation</dt><dd>Reconstruct full call semantics and callee code hashes, treat hooks as part of the act, and apply post-state checks where available.</dd>
          <dt>Residual risk</dt><dd>Simulation that diverges from execution because of state or ordering changes.</dd>
          <dt>Test</dt><dd>Add a vector with nested transfer and delegatecall into an unpinned contract.</dd>
        </dl>
      </section>

      <section anchor="t-bridge" numbered="true" toc="default">
        <name>T9: Bridge Release and Finality Mismatch</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>A destination-chain release is triggered by a source-chain event that is later reorganized, or an alternative bridge executor bypasses the verifier.</dd>
          <dt>Why conventional controls miss it</dt><dd>The release is valid against the evidence available at the time.</dd>
          <dt>Mitigation</dt><dd>Dual-side proof, finality-depth requirements, per-window bridge caps, and a single mandatory release executor.</dd>
          <dt>Residual risk</dt><dd>Consensus failure on either chain.</dd>
          <dt>Test</dt><dd>Reorganization vectors for EC1 and EC9.</dd>
        </dl>
      </section>

      <section anchor="t-upgrade" numbered="true" toc="default">
        <name>T10: Upgrade-Admin Takeover Replacing the Policy Module</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>The attacker obtains upgrade authority and replaces the on-chain policy module or proxy implementation.</dd>
          <dt>Why conventional controls miss it</dt><dd>The upgrade is authorized by the very authority the policy trusts.</dd>
          <dt>Mitigation</dt><dd>Timelock, independent veto, quorum approvals, code-hash verification, and monitoring of upgrade events.</dd>
          <dt>Residual risk</dt><dd>Compromise of every party in the quorum.</dd>
          <dt>Test</dt><dd>Attempt an unapproved upgrade and measure time to detect and veto.</dd>
        </dl>
      </section>

      <section anchor="t-insider" numbered="true" toc="default">
        <name>T11: Insider or Policy Administrator Approves Theft</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>A single administrator edits policy to allow an attacker beneficiary and then requests transfers.</dd>
          <dt>Why conventional controls miss it</dt><dd>The change is made with legitimate rights.</dd>
          <dt>Mitigation</dt><dd>Quorum-signed policy, separation of governance from signing, mandatory waiting period for new beneficiaries, independent logging.</dd>
          <dt>Residual risk</dt><dd>Collusion across the quorum.</dd>
          <dt>Test</dt><dd>Common-mode compromise test (EC23).</dd>
        </dl>
      </section>

      <section anchor="t-valid" numbered="true" toc="default">
        <name>T12: Compromised Validator or Signer Fabricates Approval</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>An attacker controls the Protected Validator or the sink and issues authority for any act.</dd>
          <dt>Why conventional controls miss it</dt><dd>Not applicable: this defeats the proposal.</dd>
          <dt>Mitigation</dt><dd>Attestation, constrained keys, quorum, separation, independent audit. These reduce likelihood, not eliminate it.</dd>
          <dt>Residual risk</dt><dd>High. The architecture can fail here, and the document says so.</dd>
          <dt>Test</dt><dd>Negative control: report the failure honestly.</dd>
        </dl>
      </section>

      <section anchor="t-bg" numbered="true" toc="default">
        <name>T13: Break-Glass and Emergency Signer Abuse</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>Stolen help-desk or operator credentials invoke the emergency signer for an urgent transfer to a new address.</dd>
          <dt>Why conventional controls miss it</dt><dd>Emergency paths are designed to bypass normal controls.</dd>
          <dt>Mitigation</dt><dd>Dual control, small budget, timelock, independent logging, and regular drills (R14).</dd>
          <dt>Residual risk</dt><dd>Two credentials compromised at once.</dd>
          <dt>Test</dt><dd>S13.</dd>
        </dl>
      </section>

      <section anchor="t-agent" numbered="true" toc="default">
        <name>T14: Prompt-Injected AI Agent Requests a Withdrawal</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>Content the agent reads instructs it to widen a transfer or change a beneficiary, and the agent submits a request with valid credentials.</dd>
          <dt>Why conventional controls miss it</dt><dd>The request is authenticated and well-formed.</dd>
          <dt>Mitigation</dt><dd>The sink takes authority only from protected policy, never from model text or tool output. Agent-to-agent delegation attenuates. Preparation is separate from finalization.</dd>
          <dt>Residual risk</dt><dd>Policy that is itself too broad.</dd>
          <dt>Test</dt><dd>Inject instructions into the agent's input and confirm no effect without act-bound authority.</dd>
        </dl>
      </section>

      <section anchor="t-phish" numbered="true" toc="default">
        <name>T15: Phishing to Cloud Account to Treasury Instruction</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>A phished staff credential reaches a cloud suite used for treasury approvals. The attacker sets mail-forwarding rules, grants application consent, or alters a treasury instruction that a custody workflow then acts on. This is a hypothetical chain; public evidence does not show it occurred in any observed campaign.</dd>
          <dt>Why conventional controls miss it</dt><dd>Phishing-resistant authentication and conditional access may already stop several steps. Where one is bypassed, a valid session does not show that a new forwarding recipient, consent, or beneficiary is authorized.</dd>
          <dt>Mitigation</dt><dd>Out-of-band confirmation of beneficiary changes, a mandatory waiting period for new beneficiaries, custody release bound to an independently stored instruction (not a mailbox), and the same gate at each separate consequence.</dd>
          <dt>Residual risk</dt><dd>The gate cannot prevent the click or the password entry. It begins when the compromised identity attempts a consequence in defender-controlled systems.</dd>
          <dt>Test</dt><dd>Walk the chain with a synthetic identity and verify each consequence is separately gated.</dd>
        </dl>
      </section>

      <section anchor="t-poison" numbered="true" toc="default">
        <name>T16: Address Poisoning</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>Lookalike addresses are seeded into history so an operator copies the wrong beneficiary.</dd>
          <dt>Why conventional controls miss it</dt><dd>The destination looks familiar to humans and may pass prefix or suffix checks.</dd>
          <dt>Mitigation</dt><dd>Full-address allowlists, no reliance on history, waiting period for new addresses.</dd>
          <dt>Residual risk</dt><dd>An operator adding the wrong address to the allowlist itself.</dd>
          <dt>Test</dt><dd>Lookalike vectors against the allowlist.</dd>
        </dl>
      </section>

      <section anchor="t-oracle" numbered="true" toc="default">
        <name>T17: Valuation and Oracle Manipulation of Caps</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>A USD-denominated cap on a volatile or thin asset is exceeded by manipulating the price source or by market movement.</dd>
          <dt>Why conventional controls miss it</dt><dd>The cap is satisfied numerically.</dd>
          <dt>Mitigation</dt><dd>Unit caps for volatile assets, bounded protected price sources, deviation limits, and a separate cap on count of operations.</dd>
          <dt>Residual risk</dt><dd>Source compromise.</dd>
          <dt>Test</dt><dd>Price-shock vectors against the cap logic.</dd>
        </dl>
      </section>

      <section anchor="t-retry" numbered="true" toc="default">
        <name>T18: Retry or Reorganization Spending the Same Budget Twice</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>A transfer is broadcast, confirmation is delayed, an agent retries, and the original later confirms as well. Or a reorganization removes a confirmed transfer and the budget has already been released.</dd>
          <dt>Why conventional controls miss it</dt><dd>Systems that release budget on timeout sign a second transaction with fresh authority.</dd>
          <dt>Mitigation</dt><dd>Hold the reservation through uncertainty, track act id, transaction id and nonce, reconcile by chain state, and deny retries with new authority until resolved.</dd>
          <dt>Residual risk</dt><dd>Unbounded INDETERMINATE exposure if reconciliation is slow. Report maximum unresolved exposure.</dd>
          <dt>Test</dt><dd>S04.</dd>
        </dl>
      </section>

      <section anchor="t-dos" numbered="true" toc="default">
        <name>T19: Validator Denial of Service to Force Fail-Open</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>The attacker floods or disables the validator so the business disables the control to restore throughput.</dd>
          <dt>Why conventional controls miss it</dt><dd>Fail-open policy engines release when unavailable.</dd>
          <dt>Mitigation</dt><dd>Fail closed for high-risk effects, a local fast path for routine ones, admission control, capacity planning, and a defined degraded mode that does not silently open.</dd>
          <dt>Residual risk</dt><dd>Availability loss for non-routine operations during an attack.</dd>
          <dt>Test</dt><dd>S10.</dd>
        </dl>
      </section>

      <section anchor="t-supply" numbered="true" toc="default">
        <name>T20: Supply-Chain Compromise of the Signer or Validator Build</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>A malicious update ships through the build pipeline and weakens validation or leaks keys.</dd>
          <dt>Why conventional controls miss it</dt><dd>The update arrives through a trusted channel.</dd>
          <dt>Mitigation</dt><dd>Measured or attested images, reproducible builds, separate signing authority for releases, quorum for updates, anti-rollback.</dd>
          <dt>Residual risk</dt><dd>Compromise of the release authority.</dd>
          <dt>Test</dt><dd>Attempt to install an unsigned or older version and confirm rejection.</dd>
        </dl>
      </section>

      <section anchor="t-helpdesk" numbered="true" toc="default">
        <name>T21: Social Engineering of Recovery, Rotation, or Help Desk</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>An attacker persuades support to reset credentials, rotate a key to one they control, or enroll a new signer.</dd>
          <dt>Why conventional controls miss it</dt><dd>The process is legitimate and the requester appears legitimate.</dd>
          <dt>Mitigation</dt><dd>Treat signer enrollment and key rotation as Protected Consequences with quorum, waiting periods, and out-of-band confirmation.</dd>
          <dt>Residual risk</dt><dd>Quorum members socially engineered together.</dd>
          <dt>Test</dt><dd>Tabletop and red-team enrollment attempts.</dd>
        </dl>
      </section>

      <section anchor="t-rollback" numbered="true" toc="default">
        <name>T22: Stale Policy Bundle Replay</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>An older, validly signed policy with higher limits is replayed to the validator or sink.</dd>
          <dt>Why conventional controls miss it</dt><dd>The signature on the old bundle is valid.</dd>
          <dt>Mitigation</dt><dd>Monotonic policy epochs enforced at validator and sink, with rollback only through a logged quorum procedure.</dd>
          <dt>Residual risk</dt><dd>Epoch store compromise.</dd>
          <dt>Test</dt><dd>S11.</dd>
        </dl>
      </section>

      <section anchor="t-xchain" numbered="true" toc="default">
        <name>T23: Cross-Chain Replay of a Broad Authorization</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>One signed authorization using chain identifier zero, or one signature reused across forks, is submitted on every chain where the account exists.</dd>
          <dt>Why conventional controls miss it</dt><dd>One signature appears to apply to one intent.</dd>
          <dt>Mitigation</dt><dd>Bind chain identifier in every authority, reject chain-identifier-zero authorizations unless explicitly approved, and track per-chain nonce state.</dd>
          <dt>Residual risk</dt><dd>Chains with different replay semantics.</dd>
          <dt>Test</dt><dd>Submit an approved single-chain authorization on a second chain and expect rejection.</dd>
        </dl>
      </section>

      <section anchor="t-ato" numbered="true" toc="default">
        <name>T24: Customer Account Takeover Withdrawing to a New Address</name>
        <dl newline="true" spacing="normal">
          <dt>Attack</dt><dd>A taken-over customer account requests withdrawal of the whole balance to a new address.</dd>
          <dt>Why conventional controls miss it</dt><dd>The session and second factor may be the attacker's.</dd>
          <dt>Mitigation</dt><dd>New-address waiting period, per-customer rolling limits enforced at the release boundary, out-of-band confirmation, and the same effect-bound check used for treasury flows.</dd>
          <dt>Residual risk</dt><dd>Customer friction trade-offs.</dd>
          <dt>Test</dt><dd>Synthetic takeover with whole-balance withdrawal to a new address.</dd>
        </dl>
      </section>
    </section>

    <!-- ===================================================== -->
    <section anchor="simulation" numbered="true" toc="default">
      <name>Simulation and Evaluation Method</name>
      <t>This section describes how to evaluate the architecture and how to read the reference simulator in <xref target="app-sim"/>. Expected outcomes are test hypotheses. The simulator is a model of policy logic and accounting. It is not a chain, wallet, or exchange, and its results are not evidence of real-world prevention.</t>

      <section anchor="sim-arms" numbered="true" toc="default">
        <name>Three Configurations</name>
        <t>Every experiment MUST run in three configurations, to avoid a weak baseline:</t>
        <ul>
          <li>Arm A: an ordinary signer with coarse identity and access control.</li>
          <li>Arm B: strengthened conventional custody controls (MPC or HSM policy, allowlists, per-transaction and rolling caps, timelocks, simulation, monitoring).</li>
          <li>Arm C: Arm B plus the independent, effect-bound enforcement described here.</li>
        </ul>
        <t>The security benefit is the difference between Arm C and Arm B, not between Arm C and Arm A.</t>
      </section>

      <section anchor="sim-rules" numbered="true" toc="default">
        <name>Rules for Real Experiments</name>
        <ul>
          <li>Use synthetic assets on local test chains or public testnets. Never use live production funds.</li>
          <li>Pre-register expected pass and fail conditions before testing.</li>
          <li>Collect transaction hashes, policy versions, attestation evidence, signed bytes, decoded calldata, code hashes, destination and amount, reservation state, validator decision, latency distribution, and chain receipt.</li>
          <li>Include negative controls in which the mechanism is bypassed or compromised, and report the failures.</li>
          <li>Record whether the unauthorized effect actually occurred, not only whether a policy engine returned DENY.</li>
        </ul>
        <t>A successful result demonstrates a property under a defined threat model. It does not establish universal protection, legal compliance, novelty, or prevention of any historical breach.</t>
      </section>

      <section anchor="sim-map" numbered="true" toc="default">
        <name>Simulator Scenarios and Threat Mapping</name>
        <table anchor="tbl-simmap">
          <name>Reference simulator scenarios mapped to catalogue threats</name>
          <thead><tr><th align="left">Simulator</th><th align="left">Scenario</th><th align="left">Threat</th></tr></thead>
          <tbody>
            <tr><td>S01</td><td>Split withdrawal, unauthorized beneficiary</td><td>T6</td></tr>
            <tr><td>S02</td><td>Split withdrawal, authorized beneficiary, aggregate cap</td><td>T6</td></tr>
            <tr><td>S03</td><td>Concurrent race on rolling cap (stale counter)</td><td>T6, T2</td></tr>
            <tr><td>S04</td><td>Retry during uncertain settlement</td><td>T18</td></tr>
            <tr><td>S05</td><td>Delegation target substitution</td><td>T3, T4, T1</td></tr>
            <tr><td>S06</td><td>Mutable-proxy delegate changed after approval</td><td>T4</td></tr>
            <tr><td>S07</td><td>Builder requests 50 delegation authorizations</td><td>T5, T1</td></tr>
            <tr><td>S08</td><td>Four-chain parallel drain versus global cap</td><td>T2</td></tr>
            <tr><td>S09</td><td>Replay of one approval three times</td><td>T22, general replay</td></tr>
            <tr><td>S10</td><td>Validator outage, mixed workload</td><td>T19</td></tr>
            <tr><td>S11</td><td>Stale policy bundle replayed</td><td>T22</td></tr>
            <tr><td>S12</td><td>approve or permit to attacker spender</td><td>T7</td></tr>
            <tr><td>S13</td><td>Break-glass abuse with one stolen credential</td><td>T13</td></tr>
            <tr><td>S14</td><td>Raw key leaked, direct chain submission</td><td>T1 (limit)</td></tr>
          </tbody>
        </table>
        <t>Threats T8 to T12, T14 to T17, T20, T21, T23, and T24 need chain-level or organizational tests that the model does not cover. They are listed with a test in <xref target="threats"/>.</t>
      </section>
    </section>

    <!-- ===================================================== -->
    <section anchor="perf" numbered="true" toc="default">
      <name>Latency and Throughput Engineering</name>
      <t>Do not put heavyweight approval in every token-generation step or blockchain polling loop. Enforce at high-consequence signing and effectuation transitions. Precompute trusted policy, maintain local protected counters, and use deterministic cryptographic verification for low-risk operations. The goal is not zero overhead. It is a measured trade-off that does not push operators to disable the control.</t>
      <table anchor="tbl-perf">
        <name>Workload tiers and measurements</name>
        <thead><tr><th align="left">Workload</th><th align="left">Approach</th><th align="left">Measurement</th></tr></thead>
        <tbody>
          <tr><td>Routine withdrawal to known beneficiary</td><td>Local signed policy and counter</td><td>p99 gate latency</td></tr>
          <tr><td>New beneficiary</td><td>Enhanced review and delay</td><td>Time to safe release</td></tr>
          <tr><td>Contract upgrade or delegation change</td><td>Multi-party approval and timelock</td><td>Unmediated upgrade attempts</td></tr>
          <tr><td>Mass agent requests</td><td>Atomic global budget</td><td>Overspend under concurrency</td></tr>
          <tr><td>Validator outage</td><td>Hold high-risk effects; fast path for routine</td><td>Availability and recovery time</td></tr>
        </tbody>
      </table>
      <t>Suggested metrics: p50, p95, and p99 gate latency; approvals per second; maximum reservation contention; false-hold rate; validator outage behavior; queue recovery time; reorganization reconciliation lag; and the percentage of protected effects reachable without mediation. No measured latency is reported in this document, and the simulator does not measure it.</t>
    </section>

    <!-- ===================================================== -->
    <section anchor="deploy" numbered="true" toc="default">
      <name>Deployment Roadmap</name>
      <ol>
        <li>Inventory and consequence mapping: enumerate every wallet, key, signer, contract, upgrade path, batch executor, RPC route, allowance, bridge, emergency credential, and administrator that can produce a protected financial effect. Build a path-to-effect graph and mark each unmediated route.</li>
        <li>Enforce bounded authority: choose enforceable signer and on-chain boundaries, bind the canonical operation, beneficiary, chain, amount, delegate code, time, and epoch, and stand up the shared Exposure Ledger and non-replayable authorization.</li>
        <li>Observe-only mode: run the validator beside production, compare its decisions with actual outcomes, tune policy, and measure false holds. Do not enforce yet.</li>
        <li>Enforce by consequence class: begin with delegation and approvals, new beneficiaries, and upgrades, then high-value transfers, then routine flows, each with a rollback path.</li>
        <li>Independence and resilience: separate policy administration from construction and custody, test fail-closed behavior, emergency recovery, signer replacement, upgrades, and reorganization handling.</li>
        <li>Test and measure: run the synthetic scenarios, compare against strengthened conventional controls, publish measured latency and failure results, and refine coverage before wide rollout.</li>
      </ol>
      <t>Compatibility: some designs work through a protected signer or an on-chain module. Others need wallet or contract changes and cannot be retrofitted transparently.</t>
    </section>

    <!-- ===================================================== -->
    <section anchor="ops" numbered="true" toc="default">
      <name>Operations: Revocation, Recovery, and Monitoring</name>
      <dl newline="true" spacing="normal">
        <dt>Detection and revocation of a bad delegation</dt>
        <dd>Monitor accounts for delegation designators and alert on change. Keep a rehearsed procedure that signs an authorization pointing the account back to the zero address, rotates the key, and sweeps funds to a safe wallet. Public reports of the October 2026 incident describe a delegation remaining unrevoked for more than two hours, which illustrates why this procedure should be prepared in advance.</dd>

        <dt>Circuit breakers</dt>
        <dd>Automatic halts on anomalies: unexpected delegation, spend above rolling thresholds, repeated denied attempts, validator disagreement. Breakers MUST fail toward holding high-risk effects.</dd>

        <dt>Incident freeze</dt>
        <dd>A quorum-approved action that freezes relevant envelopes, revokes pending authority, and prevents queued operations from draining under stale approvals.</dd>

        <dt>Key rotation and recovery</dt>
        <dd>Rotation and signer enrollment are Protected Consequences with quorum, waiting periods, and out-of-band confirmation (T21). Pending acts are re-evaluated under the new epoch.</dd>

        <dt>Allowance hygiene</dt>
        <dd>Periodically list and revoke unneeded allowances and delegations, and cap new ones.</dd>

        <dt>Independent evidence</dt>
        <dd>Decisions, receipts, and policy changes are written to a record the builder cannot alter. Evidence supports investigation, accountability, and supervisory review, and does not by itself determine legal liability.</dd>
      </dl>
    </section>

    <!-- ===================================================== -->
    <section anchor="falsify" numbered="true" toc="default">
      <name>Falsifiable Acceptance Criteria</name>
      <table anchor="tbl-accept">
        <name>Pre-registered acceptance criteria for real experiments</name>
        <thead><tr><th align="left">Metric</th><th align="left">Acceptance criterion</th></tr></thead>
        <tbody>
          <tr><td>Unauthorized transfers</td><td>Zero in protected, tested paths</td></tr>
          <tr><td>Aggregate overspend</td><td>Zero above the atomic budget, including under concurrency</td></tr>
          <tr><td>Replay</td><td>At most one effective act per bound nonce</td></tr>
          <tr><td>Delegate substitution</td><td>100 percent of test substitutions rejected</td></tr>
          <tr><td>Unapproved delegation authorizations signed</td><td>Zero</td></tr>
          <tr><td>Bypass coverage</td><td>All enumerated protected paths mediated</td></tr>
          <tr><td>False denials on a legitimate mix</td><td>Reported empirically against a stated target</td></tr>
          <tr><td>p99 latency</td><td>Reported empirically, not presumed</td></tr>
          <tr><td>Compromised root key or upgrade admin</td><td>Explicit limitation disclosed</td></tr>
        </tbody>
      </table>
      <t>The strongest falsification tests are: demonstrate a protected high-value transfer through an unmediated route, or a budget breach under concurrent requests. Either one shows the claim does not hold for that deployment.</t>
    </section>

    <!-- ===================================================== -->
    <section anchor="limits" numbered="true" toc="default">
      <name>Limitations</name>
      <ul>
        <li>A public blockchain executes valid transactions according to its rules. An off-chain Finality Sink cannot overrule the chain. Non-bypassability requires a mandatory protected signing path, contract-enforced policy, or an equivalent actual constraint on authority.</li>
        <li>Existing keys, allowances, upgrades, and bridges can defeat the invariant. A leaked key that submits directly to an unrestricted account defeats it entirely (S14).</li>
        <li>The enforcement layer is a high-value target. If the validator, sink, signing key, policy authority, upgrade admin, or underlying device is compromised, protection may fail.</li>
        <li>Smart-contract bugs, consensus failures, and compromised trusted components stay in scope for defense in depth.</li>
        <li>Per-chain capability differs, and some chains offer no on-chain policy at all.</li>
        <li>Cross-organization workflows need explicit trust-model design that this document does not provide.</li>
        <li>Incident descriptions are third-party accounts. The simulator is a model, and its results do not demonstrate real-world effectiveness.</li>
      </ul>
    </section>

    <!-- ===================================================== -->
    <section anchor="security" numbered="true" toc="default">
      <name>Security Considerations</name>
      <t>This entire document concerns security. Further points:</t>
      <ul>
        <li>Replay: authority, receipts, and policy bundles carry freshness and sink-local consumption state.</li>
        <li>Confused deputy: authority is bound to the act so a trusted service cannot be induced to spend authority issued for another act.</li>
        <li>Availability: a fail-closed gate creates a dependency. Provide capacity, failover, rate limiting, a routine fast path, and an authorized degraded mode.</li>
        <li>Revocation timing: propagation delay leaves a window in which revoked authority may be accepted. Use short validity and revocation epochs.</li>
        <li>False assurance: a DENY from a policy engine is not evidence that no effect occurred. Observe actual effects.</li>
        <li>Residual routes: any unmediated route, including a second chain or a previously issued permit, defeats protection for that effect, and the deployment must say so.</li>
        <li>Key handling: non-exportable keys and attested signers reduce the chance that signing capability leaves the protected boundary. They do not remove the need for monitoring and incident response.</li>
      </ul>
    </section>

    <section anchor="privacy" numbered="true" toc="default">
      <name>Privacy Considerations</name>
      <t>Candidate Act descriptors, ledgers, and Receipts can reveal balances, counterparties, and operational patterns. Operators SHOULD minimize retained detail, protect these records, apply retention limits consistent with applicable law, and avoid publishing wallet addresses or limits in ways that help attackers.</t>
    </section>

    <section anchor="iana" numbered="true" toc="default">
      <name>IANA Considerations</name>
      <t>This document has no IANA actions.</t>
    </section>

  </middle>

  <back>
    <references>
      <name>References</name>

      <references anchor="normative">
        <name>Normative References</name>
        <xi:include href="https://www.rfc-editor.org/refs/bibxml/reference.RFC.2119.xml"/>
        <xi:include href="https://www.rfc-editor.org/refs/bibxml/reference.RFC.8174.xml"/>
      </references>

      <references anchor="informative">
        <name>Informative References</name>
        <xi:include href="https://www.rfc-editor.org/refs/bibxml/reference.RFC.8785.xml"/>
        <xi:include href="https://www.rfc-editor.org/refs/bibxml/reference.RFC.9334.xml"/>
        <xi:include href="https://www.rfc-editor.org/refs/bibxml/reference.RFC.9591.xml"/>

        <reference anchor="EIP-7702" target="https://eips.ethereum.org/EIPS/eip-7702">
          <front>
            <title>EIP-7702: Set Code for EOAs</title>
            <author><organization>Ethereum Improvement Proposals</organization></author>
            <date year="2024"/>
          </front>
        </reference>

        <reference anchor="EIP-712" target="https://eips.ethereum.org/EIPS/eip-712">
          <front>
            <title>EIP-712: Typed structured data hashing and signing</title>
            <author><organization>Ethereum Improvement Proposals</organization></author>
            <date year="2017"/>
          </front>
        </reference>

        <reference anchor="FSA-BYBIT" target="https://www.fsa.go.jp/policy/bgin/ResearchPaper_dtc_en.pdf">
          <front>
            <title>Research paper discussing the February 2025 multisignature wallet interface incident</title>
            <author><organization>Financial Services Agency, Japan</organization></author>
            <date year="2025"/>
          </front>
          <refcontent>Verify against the original publication</refcontent>
        </reference>

        <reference anchor="INCIDENT-REPORTS">
          <front>
            <title>Public analyses and fact cards on the 29 October 2026 exchange hot-wallet theft (multiple authors)</title>
            <author><organization>Various security firms and industry bodies</organization></author>
            <date month="October" year="2026"/>
          </front>
          <refcontent>Third-party accounts; verify on-chain and against primary sources</refcontent>
        </reference>

        <reference anchor="MSFT-PHISH">
          <front>
            <title>Notice on phishing campaign exploiting the 12 November 2026 service disruption</title>
            <author><organization>Microsoft Threat Intelligence</organization></author>
            <date month="November" year="2026"/>
          </front>
          <refcontent>Verify against the original publication</refcontent>
        </reference>
      </references>
    </references>

    <section anchor="app-sim" numbered="true" toc="default">
      <name>Reference Simulator and Results</name>
      <t>The reference simulator is a short Python program, finality_sim.py, distributed with this draft. It is deterministic, uses synthetic units, and contacts no chain, wallet, HSM, or exchange. It runs with "python3 finality_sim.py" and exits non-zero if an acceptance assertion fails. "python3 finality_sim.py --json" prints machine-readable results.</t>

      <section anchor="app-arms" numbered="true" toc="default">
        <name>How the Arms Are Defined</name>
        <t>Results follow from these definitions, so the table checks that the designed logic and accounting behave as specified. It is a regression and acceptance harness. It does not show that real attackers would be stopped.</t>
        <dl newline="true" spacing="normal">
          <dt>Arm A</dt><dd>Ordinary signer. Signs anything the possibly compromised builder sends.</dd>
          <dt>Arm B</dt><dd>Strengthened conventional controls. Beneficiary allowlist; per-transaction cap of 100; atomic rolling cap of 300 per chain; signer decodes transfer fields; delegation approved on the displayed description; fail-open on policy-service outage; accepts any validly signed policy bundle; no handling of approvals or delegation authorizations; releases budget on timeout; per-chain counters only. In S03 the rolling counter is read before any worker writes it, modelling a stale read.</dd>
          <dt>Arm C</dt><dd>Arm B plus: reconstruction from bytes with code-hash pinning; atomic reservation across chains held through uncertain outcomes; one-time act-bound authority; refusal of unapproved delegation authorizations; monotonic policy epochs; approvals and permits treated as consequences; fail-closed for high-risk effects with a local fast path for routine ones; break-glass under dual control and a small budget.</dd>
        </dl>
        <t>Several Arm B weaknesses (per-chain counters, fail-open, no epoch check, release on timeout) are modelling assumptions. Deployments that already close them would see smaller differences. This is why <xref target="sim-arms"/> requires a strengthened baseline in real experiments.</t>
      </section>

      <section anchor="app-results" numbered="true" toc="default">
        <name>Results</name>
        <table anchor="tbl-simresults">
          <name>Reference simulator output (synthetic units; model, not a chain)</name>
          <thead><tr><th align="left">ID</th><th align="left">Scenario</th><th align="left">Metric</th><th align="right">A</th><th align="right">B</th><th align="right">C</th></tr></thead>
          <tbody>
            <tr><td>S01</td><td>Split withdrawal, unauthorized beneficiary</td><td>units released</td><td align="right">900</td><td align="right">0</td><td align="right">0</td></tr>
            <tr><td>S02</td><td>Split withdrawal, authorized beneficiary (overspend vs 300 cap)</td><td>units above cap</td><td align="right">600</td><td align="right">0</td><td align="right">0</td></tr>
            <tr><td>S03</td><td>Concurrent race on rolling cap (stale counter)</td><td>units above cap</td><td align="right">150</td><td align="right">150</td><td align="right">0</td></tr>
            <tr><td>S04</td><td>Retry during uncertain settlement</td><td>duplicate units</td><td align="right">270</td><td align="right">90</td><td align="right">0</td></tr>
            <tr><td>S05</td><td>Delegation target substitution (display H1, bytes H2)</td><td>takeover (1/0)</td><td align="right">1</td><td align="right">1</td><td align="right">0</td></tr>
            <tr><td>S06</td><td>Mutable-proxy delegate changed after approval</td><td>takeover (1/0)</td><td align="right">1</td><td align="right">1</td><td align="right">0</td></tr>
            <tr><td>S07</td><td>Builder requests 50 delegation authorizations (nonce range)</td><td>takeover (1/0)</td><td align="right">1</td><td align="right">1</td><td align="right">0</td></tr>
            <tr><td>S08</td><td>Four-chain parallel drain vs global cap</td><td>units above cap</td><td align="right">1760</td><td align="right">680</td><td align="right">0</td></tr>
            <tr><td>S09</td><td>Replay of one approval three times</td><td>replayed units</td><td align="right">270</td><td align="right">180</td><td align="right">0</td></tr>
            <tr><td>S10</td><td>Validator outage, mixed workload</td><td>units released</td><td align="right">500</td><td align="right">500</td><td align="right">0</td></tr>
            <tr><td>S11</td><td>Stale signed policy bundle replayed (epoch 3 vs 5)</td><td>units above cap</td><td align="right">700</td><td align="right">700</td><td align="right">0</td></tr>
            <tr><td>S12</td><td>approve()/permit to attacker spender</td><td>exposure granted</td><td align="right">1000</td><td align="right">1000</td><td align="right">0</td></tr>
            <tr><td>S13</td><td>Break-glass abuse with one stolen credential</td><td>units released</td><td align="right">500</td><td align="right">500</td><td align="right">0</td></tr>
            <tr><td>S14</td><td>Raw signing key leaked, direct chain submission</td><td>units released</td><td align="right">1000</td><td align="right">1000</td><td align="right">1000</td></tr>
          </tbody>
        </table>
        <t>Reading the table: the metric column states what is counted (units released, units above the cap, duplicate units, a takeover flag, or exposure granted). Lower is better. In S03 and S08 the result in Arm B comes from the stale counter and per-chain ledgers described above, which Arm C removes by reserving atomically against one shared ledger. In S08 Arm C still releases 360 units, which is below the 400 global cap, so "units above cap" is zero.</t>
        <t>Additional checks: in S10, Arm C blocked 0 legitimate units, because the routine transfers ran on the local fast path while the five high-risk transfers were held. In a separate mix of 100 in-policy transfers, Arm C produced 0 false denials. For S14, a mandatory on-chain module with the same limits (modelled as 300 minus a 30-unit margin) would cap the loss at 270 units, against 1000 when only an off-chain gate exists.</t>
        <t>S14 is a documented limit. When a leaked key submits directly to an unrestricted account, all three arms lose the full balance. This result is intended: the document states that an off-chain gate cannot stop it.</t>
      </section>

      <section anchor="app-extend" numbered="true" toc="default">
        <name>Extending the Simulator</name>
        <t>To move from a model to evidence, replace each scenario function with a harness against a local test chain (for example a forked development node) and a real signer, record the items listed in <xref target="sim-rules"/>, and keep the acceptance assertions unchanged. Add vectors for the threats the model does not cover (T8 to T12, T14 to T17, T20, T21, T23, T24).</t>
      </section>
    </section>

    <section anchor="faq" numbered="true" toc="default">
      <name>Frequently Asked Questions</name>
      <t>The answers describe proposed design patterns and conditions for enforceability. They are not deployed or empirically validated results.</t>
      <section numbered="true" toc="default">
        <name>Basics</name>
      <dl newline="true" spacing="normal">
        <dt>Q1. Does this replace multisig, MPC, or HSMs?</dt>
        <dd>No. Multisig distributes signing authority, MPC and HSMs protect keys, and the proposed gate adds consequence-specific constraints. They can all be required together.</dd>
        <dt>Q2. Does a valid signature prove a safe transfer?</dt>
        <dd>No. It proves a cryptographic authorization condition, not that the organization intended the actual effect.</dd>
        <dt>Q3. Does the attacker have to implement Candidate Acts or use the gate?</dt>
        <dd>No. The defender constructs the Candidate Act from the effective requested operation. The attacker only sends ordinary requests, and cannot avoid the gate by refusing to use it if the effect has no other route.</dd>
        <dt>Q4. Can an off-chain validator stop a direct transaction from a leaked key?</dt>
        <dd>Not if a valid key can sign and submit unrestricted transactions outside the validator. Protection then needs a non-exportable key or a mandatory on-chain rule, such as a smart-account module.</dd>
        <dt>Q5. Does this eliminate key theft?</dt>
        <dd>No. It aims to limit what compromised credentials can effectuate, where the control is mandatory.</dd>
        <dt>Q6. Does zero trust become obsolete?</dt>
        <dd>No. Identity and session controls remain essential and complement consequence authorization.</dd>
      </dl>
      </section>
      <section numbered="true" toc="default">
        <name>The incidents</name>
      <dl newline="true" spacing="normal">
        <dt>Q7. Could this have prevented the reported October 2026 exchange theft?</dt>
        <dd>Not established. Prevention would depend on the actual attack path and on whether a mandatory signer or on-chain wallet policy mediated the delegated action. Reports also describe losses on chains without delegation, so no single mechanism explains the whole event.</dd>
        <dt>Q8. Could this have prevented the February 2025 theft?</dt>
        <dd>Not established. Independent payload reconstruction and signer controls might address some presentation-tampering failure modes, but retrospective prevention is unproven.</dd>
        <dt>Q9. Is EIP-7702 inherently malicious?</dt>
        <dd>No. It enables useful account functionality. Malicious or poorly governed delegation creates risk, and the specification itself warns about it.</dd>
        <dt>Q10. Is an EIP-7702 delegation a one-time approval?</dt>
        <dd>No. It changes the executable behavior of the account until replaced or cleared, subject to the delegate code.</dd>
        <dt>Q11. Why does the paper keep the Bybit and Binance cases separate?</dt>
        <dd>They are different events with different reported mechanisms. Conflating them would create a false technical claim.</dd>
      </dl>
      </section>
      <section numbered="true" toc="default">
        <name>Design questions</name>
      <dl newline="true" spacing="normal">
        <dt>Q12. Where is the Finality Sink for a centralized exchange?</dt>
        <dd>At protected withdrawal signing and release, with controls against alternate signing or broadcast paths, and with reconciliation of post-broadcast receipts.</dd>
        <dt>Q13. What is the on-chain Finality Sink?</dt>
        <dd>A mandatory wallet or contract execution rule that rejects effects lacking valid policy-bound authority.</dd>
        <dt>Q14. Where should a code-upgrade gate sit?</dt>
        <dd>At the upgrade authority and execution contract, with independent approvals and a timelock or veto where appropriate.</dd>
        <dt>Q15. Why bind the beneficiary, chain identifier, and code hash?</dt>
        <dd>A valid transfer to an unauthorized destination can be economically irreversible. Chain binding avoids cross-chain authorization confusion and unintended broad delegation. A familiar name or address label does not prove which executable implementation will run.</dd>
        <dt>Q16. Are proxies forbidden?</dt>
        <dd>No, but upgradeability changes the trust model and needs protected governance, pinned implementation hashes, and monitoring.</dd>
        <dt>Q17. Why track rolling budgets and reserve before signing?</dt>
        <dd>To stop many individually small transfers from exceeding aggregate exposure, and to stop parallel requests from each consuming the same unspent budget.</dd>
        <dt>Q18. Can token approvals cause future losses?</dt>
        <dd>Yes. An approval or permit can allow later spending without a fresh owner signature, so it is treated as a consequence.</dd>
        <dt>Q19. Does a transaction receipt prove final settlement?</dt>
        <dd>Not always. Confirmation and finality depend on the chain and on reorganization assumptions.</dd>
        <dt>Q20. What is an evidence-carrying receipt?</dt>
        <dd>A proposed authenticated record that binds a phase and its observed result to the act, used for reconciliation and later authority decisions.</dd>
        <dt>Q21. Can agents just use another RPC endpoint?</dt>
        <dd>If they hold unrestricted signing authority, yes. Mandatory control must sit at the signer or the on-chain execution path.</dd>
        <dt>Q22. What about bridge exploits?</dt>
        <dd>Apply separate source and destination effect gates, require finality depth, cap exposure per window, and reconcile cross-chain outcomes. There is no universal guarantee.</dd>
        <dt>Q23. Can a wallet interface be trusted?</dt>
        <dd>Not alone. Verify the exact bytes and semantics independently of potentially compromised presentation.</dd>
      </dl>
      </section>
      <section numbered="true" toc="default">
        <name>Operations and limits</name>
      <dl newline="true" spacing="normal">
        <dt>Q24. What happens if the validator is unavailable?</dt>
        <dd>High-risk effects hold. Routine low-risk transfers can run on a local fast path with signed policy and protected local counters. The mode is defined in advance, and a failure does not silently open.</dd>
        <dt>Q25. Can a compromised policy administrator approve theft?</dt>
        <dd>Potentially. Separate governance from signing, require quorum for policy changes, and test common-mode compromise.</dd>
        <dt>Q26. Can a hot wallet use machine-speed checks?</dt>
        <dd>That is a design goal. Actual performance must be measured under concurrency and failure, and no figure is claimed.</dd>
        <dt>Q27. What if validation times out after a partial execution?</dt>
        <dd>Distinguish not-started, staged, committed, and uncertain outcomes. Do not sign again with fresh authority. Reconcile against chain state and keep the reservation until the outcome is known.</dd>
        <dt>Q28. Is the architecture compatible with existing wallets?</dt>
        <dd>Sometimes through a protected signer or an on-chain module. Other designs need wallet or contract changes and cannot be retrofitted transparently.</dd>
        <dt>Q29. How do I handle a delegation that is already installed and malicious?</dt>
        <dd>Use the prepared revocation path: an authorization pointing the account back to the zero address, key rotation, and a sweep to a safe wallet, while the circuit breaker holds other effects.</dd>
        <dt>Q30. What if the simulator shows Arm C winning every scenario?</dt>
        <dd>That follows from how the arms are defined. It tests that the designed logic works as specified. Real evidence needs the real-chain experiments in the evaluation method, with a strengthened Arm B.</dd>
        <dt>Q31. What is the strongest falsification test?</dt>
        <dd>Demonstrate a protected high-value transfer through an unmediated route, or a budget breach under concurrent requests.</dd>
      </dl>
      </section>
      <section numbered="true" toc="default">
        <name>Patents and references</name>
      <dl newline="true" spacing="normal">
        <dt>Q32. What should patent examiners or reviewers look for?</dt>
        <dd>Concrete technical distinctions: operation reconstruction, independent authority, mandatory enforcement, state binding, replay prevention, and measurable effects, evaluated against prior art.</dd>
        <dt>Q33. Is this proof of novelty or patentability?</dt>
        <dd>No. Prior-art analysis and claim-specific inventive-step assessment remain necessary.</dd>
        <dt>Q34. How should readers treat the patent and industry references?</dt>
        <dd>They identify the inventor-reported technical provenance. They do not establish implementation, endorsement, adoption, validity, or infringement by any organization. Readers should consult authoritative WIPO and patent-office records and verify all claims before reliance.</dd>
      </dl>
      </section>
    </section>

    <section anchor="appendix-basis" numbered="true" toc="default">
      <name>Basis of Disclosure and Patent Notice</name>
      <t>This document is based on the Mothership application PCT/IB2026/055615, filed 4 June 2026 and published as WO 2026/150382 A2 on 16 July 2026. The full filing can be read by searching "Sangam Das" on WIPO PATENTSCOPE, by searching PCT/IB2026/055615 (pctib202655615), or at https://www.tdcommons.org/dpubs_series/12542/ . The underlying invention is human-originated. Preparation of this draft, its summaries, and any mapping to third-party systems or incidents used AI assistance and may contain errors or omissions, so readers MUST verify against the original filings and primary sources. Nothing here implies endorsement, collaboration, licensing, or an allegation of infringement by any third party. The author is open to acquihire or strategic collaboration.</t>
      <t>License: CC BY-NC 4.0. The license does not grant patent rights.</t>
    </section>

    <section anchor="acknowledgements" numbered="false" toc="default">
      <name>Acknowledgements</name>
      <t>The author thanks the security researchers and journalists whose public reporting made the incident discussion possible.</t>
    </section>

  </back>
</rfc>
