<?xml version='1.0' encoding='utf-8'?>
<rfc category="exp" docName="draft-mashayekhi-auditable-model-deliberation-00" ipr="trust200902" submissionType="IETF" version="3">
  <front>
    <title abbrev="Auditable Model Deliberation">Auditable Public Artifacts for Model-Independent Deliberation</title>
    <seriesInfo name="Internet-Draft" value="draft-mashayekhi-auditable-model-deliberation-00" />
    <author fullname="Mohsen Mashayekhi" initials="M." surname="Mashayekhi">
      <organization>Independent Researcher</organization>
      <address>
        <email>mmohsen.m@gmail.com</email>
        <uri>https://github.com/MasonMash/MSB</uri>
      </address>
    </author>
    <date year="2026" month="August" day="12" />
    <area>Applications and Real-Time</area>
    <keyword>artificial intelligence</keyword>
    <keyword>deliberation</keyword>
    <keyword>interoperability</keyword>
    <keyword>auditability</keyword>
    <keyword>public artifacts</keyword>
    <abstract>
      <t>
        Heterogeneous artificial-intelligence systems can exchange messages
        without sharing stable semantics for claims, evidence, objections,
        revisions, decisions, failures, and termination. This document defines
        an experimental public-artifact protocol for model-independent
        deliberation. It separates interoperable public state from private
        model computation and does not require disclosure of chain-of-thought,
        hidden state, prompts, model weights, or private memory.
      </t>
      <t>
        The document defines seven public artifact types, append-only revision,
        evidence provenance, blocking-objection closure, explicit failure and
        termination, a restricted canonical JSON profile, and SHA-256-based
        artifact identifiers. It does not define transport, signatures,
        authorization, model execution, or a completed consensus system.
      </t>
    </abstract>
  </front>
  <middle>
    <section>
      <name>Introduction</name>
      <t>
        Messaging interoperability does not imply deliberation
        interoperability. A transcript or tool-call sequence does not
        inherently define what was claimed, what evidence was admitted, what
        was challenged, what changed, which objections remain unresolved, or
        whether a final decision is closed over its public record.
      </t>
      <t>
        This document defines a narrow public-artifact layer. An independent
        reviewer can inspect the public record without accessing private model
        cognition or provider-internal state.
      </t>
      <section>
        <name>Objective</name>
        <t>
          The protocol objective is to make a deliberation auditable through
          immutable, typed, content-addressed public artifacts.
        </t>
      </section>
      <section>
        <name>Scope</name>
        <t>This document specifies:</t>
        <ul>
          <li>core public artifact semantics;</li>
          <li>an abstract artifact data model;</li>
          <li>evidence provenance classes;</li>
          <li>append-only history and revision;</li>
          <li>reference-graph and decision-closure behavior;</li>
          <li>explicit failure and termination;</li>
          <li>version and extension behavior; and</li>
          <li>a restricted canonical JSON and identifier profile.</li>
        </ul>
      </section>
      <section>
        <name>Non-Goals</name>
        <t>This document does not standardize:</t>
        <ul>
          <li>transport or message delivery;</li>
          <li>model inference or orchestration;</li>
          <li>tool execution;</li>
          <li>prompt construction;</li>
          <li>model selection;</li>
          <li>authentication, authorization, or signatures;</li>
          <li>private reasoning representation; or</li>
          <li>a fixed number or sequence of deliberation rounds.</li>
        </ul>
      </section>
    </section>
    <section anchor="requirements">
      <name>Conventions and 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 BCP 14 subseries comprises the requirement-language specifications cited above; see <xref target="BCP14" />.</t>
      <dl>
        <dt>Public artifact</dt>
        <dd>An inspectable protocol object intended to cross the interoperability boundary. Public means shared with the authorized participants at that boundary; it does not imply unrestricted Internet disclosure.</dd>
        <dt>Private model state</dt>
        <dd>Implementation-internal material not required for protocol interoperability.</dd>
        <dt>Deliberation</dt>
        <dd>A set of public artifacts and references through which claims can be supported, challenged, revised, and decided.</dd>
        <dt>Closure</dt>
        <dd>The artifacts transitively reachable through protocol references from a declared decision or tip set.</dd>
        <dt>Blocking objection</dt>
        <dd>An objection that prevents a decision from claiming closed status until the objection receives a public disposition.</dd>
      </dl>
    </section>
    <section>
      <name>Architectural Invariant</name>
      <t>
        A decision <bcp14>MUST</bcp14> be auditable from public artifacts
        without requiring private model state.
      </t>
      <t>
        An implementation <bcp14>MAY</bcp14> use arbitrary private computation
        to produce an artifact. It <bcp14>MUST NOT</bcp14> require another
        participant to disclose private chain-of-thought as a condition of
        interoperability.
      </t>
    </section>
    <section anchor="artifact-model">
      <name>Abstract Artifact Model</name>
      <t>
        A published artifact in version <tt>0.1</tt> is a JSON object with
        these core members:
      </t>
      <dl>
        <dt>
          <tt>protocol_version</tt>
        </dt>
        <dd>The protocol profile. The value defined by this document is <tt>0.1</tt>.</dd>
        <dt>
          <tt>artifact_id</tt>
        </dt>
        <dd>The content-addressed identity defined in <xref target="canonical-profile" />.</dd>
        <dt>
          <tt>artifact_type</tt>
        </dt>
        <dd>One of the seven core types defined in <xref target="artifact-types" />.</dd>
        <dt>
          <tt>payload</tt>
        </dt>
        <dd>Type-specific public data.</dd>
        <dt>
          <tt>references</tt>
        </dt>
        <dd>An array of references to prior public artifacts.</dd>
        <dt>
          <tt>extensions</tt>
        </dt>
        <dd>An optional object containing namespaced extension data.</dd>
      </dl>
      <t>
        Additional metadata <bcp14>MUST NOT</bcp14> silently change the
        semantics of a core member.
      </t>
      <t>
        Transport addresses, provider identifiers, model names, prompts, tool
        invocation metadata, and private model state are not core members.
      </t>
      <section>
        <name>Reference Object</name>
        <t>
          Each reference <bcp14>MUST</bcp14> identify a target
          <tt>artifact_id</tt>. It <bcp14>MAY</bcp14> include one relation
          from this core vocabulary:
        </t>
        <ul>
          <li>
            <tt>supports</tt>;</li>
          <li>
            <tt>objects-to</tt>;</li>
          <li>
            <tt>revises</tt>;</li>
          <li>
            <tt>supersedes</tt>;</li>
          <li>
            <tt>considers</tt>; or</li>
          <li>
            <tt>decides</tt>.</li>
        </ul>
      </section>
      <section>
        <name>Example Shape</name>
        <artwork type="json">
{
  "protocol_version": "0.1",
  "artifact_id": "sha256:&lt;64-lowercase-hex&gt;",
  "artifact_type": "CLAIM",
  "payload": {
    "statement": "A public proposition"
  },
  "references": [],
  "extensions": {}
}
</artwork>
        <t>
          The example illustrates the common envelope. It does not assign a
          valid identifier to the placeholder body.
        </t>
      </section>
    </section>
    <section anchor="artifact-types">
      <name>Core Artifact Semantics</name>
      <section>
        <name>CLAIM</name>
        <t>
          A <tt>CLAIM</tt> introduces a proposition that can be supported,
          challenged, revised, or decided.
        </t>
        <t>
          Its payload <bcp14>MUST</bcp14> contain a non-empty
          <tt>statement</tt> string.
        </t>
      </section>
      <section>
        <name>EVIDENCE</name>
        <t>
          An <tt>EVIDENCE</tt> artifact provides support relevant to one or
          more artifacts.
        </t>
        <t>
          Its payload <bcp14>MUST</bcp14> contain a non-empty
          <tt>content</tt> string and one <tt>provenance_class</tt> value
          from <xref target="provenance" />. Supporting evidence
          <bcp14>MUST</bcp14> carry an applicable <tt>supports</tt>
          reference.
        </t>
      </section>
      <section>
        <name>OBJECTION</name>
        <t>
          An <tt>OBJECTION</tt> challenges an artifact or protocol assumption.
        </t>
        <t>
          Its payload <bcp14>MUST</bcp14> contain a non-empty
          <tt>statement</tt> string and a Boolean <tt>blocking</tt> member.
          It <bcp14>MUST</bcp14> carry at least one <tt>objects-to</tt>
          reference.
        </t>
      </section>
      <section>
        <name>REVISION</name>
        <t>
          A <tt>REVISION</tt> creates a new position without mutating history.
        </t>
        <t>
          Its payload <bcp14>MUST</bcp14> contain a non-empty
          <tt>statement</tt> string. It <bcp14>MUST</bcp14> carry at least
          one <tt>revises</tt> or <tt>supersedes</tt> reference.
        </t>
      </section>
      <section>
        <name>DECISION</name>
        <t>
          A <tt>DECISION</tt> records an outcome and its declared closure.
        </t>
        <t>
          Its payload <bcp14>MUST</bcp14> contain a non-empty
          <tt>outcome</tt> string, a <tt>status</tt> value of
          <tt>provisional</tt> or <tt>final</tt>, an
          <tt>objection_dispositions</tt> array, and an
          <tt>unresolved_issues</tt> array.
        </t>
        <t>
          A final decision <bcp14>MUST NOT</bcp14> omit a reachable unresolved
          blocking objection.
        </t>
      </section>
      <section>
        <name>FAILURE</name>
        <t>
          A <tt>FAILURE</tt> records that processing could not complete.
        </t>
        <t>
          Its payload <bcp14>MUST</bcp14> contain non-empty <tt>code</tt>
          and <tt>description</tt> strings and a Boolean
          <tt>retryable</tt> member. A failure <bcp14>MUST NOT</bcp14> be
          silently converted into success.
        </t>
      </section>
      <section>
        <name>TERMINATION</name>
        <t>
          A <tt>TERMINATION</tt> payload <bcp14>MUST</bcp14> contain a
          <tt>state</tt> value of <tt>completed</tt>, <tt>suspended</tt>,
          <tt>cancelled</tt>, <tt>deadlock</tt>, or <tt>exhausted</tt>.
        </t>
        <t>
          A completed termination <bcp14>MUST</bcp14> reference a final
          decision. A deadlock or exhausted termination
          <bcp14>MUST</bcp14> preserve relevant unresolved blocking
          objections.
        </t>
      </section>
    </section>
    <section anchor="provenance">
      <name>Evidence Provenance</name>
      <t>The version <tt>0.1</tt> provenance classes are:</t>
      <dl>
        <dt>
          <tt>TRACE_VERIFIED_OBSERVATION</tt>
        </dt>
        <dd>Evidence supported by an explicitly admitted execution or trace source.</dd>
        <dt>
          <tt>EXTERNAL_EVIDENCE</tt>
        </dt>
        <dd>Evidence supplied from an explicit external source admitted by the protocol context.</dd>
        <dt>
          <tt>MODEL_GENERATED_ANALYSIS</tt>
        </dt>
        <dd>A calculation, critique, estimate, simulation, or other analytical product generated by a participant.</dd>
        <dt>
          <tt>HYPOTHESIS</tt>
        </dt>
        <dd>A proposition offered for future validation rather than as an observed result.</dd>
      </dl>
      <t>
        Model-generated quantitative language <bcp14>MUST NOT</bcp14> be
        represented as independently observed empirical evidence unless it is
        separately grounded in an admissible source.
      </t>
    </section>
    <section>
      <name>Immutable History</name>
      <t>
        An artifact identifier <bcp14>MUST</bcp14> bind to one artifact body.
        Once accepted into append-only history, the artifact
        <bcp14>MUST NOT</bcp14> be silently replaced.
      </t>
      <t>
        An identical resubmission <bcp14>MAY</bcp14> be treated as
        idempotent. A changed body <bcp14>MUST</bcp14> receive a new identity.
        Corrections <bcp14>MUST</bcp14> be new artifacts with explicit
        references to prior artifacts.
      </t>
    </section>
    <section anchor="closure">
      <name>Reference Graph and Decision Closure</name>
      <t>
        Version <tt>0.1</tt> uses a directed acyclic public artifact graph.
        A closure verifier <bcp14>MUST</bcp14> reject a reference cycle.
      </t>
      <t>
        Multiple concurrent tips are permitted. A required unavailable
        reference causes closure verification to fail. An implementation
        <bcp14>MUST NOT</bcp14> construct a successful partial closure when a
        required artifact is unavailable.
      </t>
      <t>
        A decision declares its audited closure through references. A final
        decision <bcp14>MUST NOT</bcp14> hide an unresolved blocking objection
        reachable from that closure.
      </t>
      <t>
        Majority agreement is neither required nor sufficient for closure.
        Voting or scoring <bcp14>MAY</bcp14> inform a decision, but
        <bcp14>MUST NOT</bcp14> hide a reachable unresolved blocking
        objection. This document does not standardize role reliability,
        voting weights, or adjudication thresholds.
      </t>
    </section>
    <section>
      <name>Failure and Recovery</name>
      <t>
        Protocol failure and transport failure are distinct. If processing
        cannot continue, an implementation must expose an explicit failure
        outcome rather than silently truncating the record.
      </t>
      <t>
        A retry <bcp14>MUST NOT</bcp14> erase a canonical failure that belongs
        to the auditable record.
      </t>
    </section>
    <section>
      <name>Versioning and Extensions</name>
      <t>
        An implementation <bcp14>MUST</bcp14> reject an unsupported major
        version and <bcp14>MUST NOT</bcp14> infer minor-version compatibility.
        A different minor version <bcp14>MAY</bcp14> be accepted only under an
        explicit compatibility rule.
      </t>
      <t>
        Extension data <bcp14>MUST</bcp14> remain separate from core members.
        Unknown extensions <bcp14>MUST NOT</bcp14> change core semantics.
        This document defines no critical-extension mechanism and requests no
        extension registry.
      </t>
    </section>
    <section anchor="canonical-profile">
      <name>Restricted Canonical JSON and Artifact Identity</name>
      <t>
        JSON processing follows <xref target="RFC8259" /> subject to the
        additional restrictions in this section. Text is UTF-8 as specified
        by <xref target="RFC3629" />.
      </t>
      <section>
        <name>Admitted Values</name>
        <t>
          An admitted value is null, a Boolean, a Unicode string, an integer,
          an array of admitted values, or an object with string member names
          and admitted values.
        </t>
        <t>
          Floating-point values, decimal fractions, exponents, non-finite
          numbers, comments, binary values, and implementation-specific JSON
          extensions are not admitted. Integers are restricted to the
          inclusive range -9007199254740991 through 9007199254740991.
        </t>
        <t>
          An artifact submitted for identifier calculation
          <bcp14>MUST</bcp14> be a top-level object.
        </t>
      </section>
      <section>
        <name>Input Rejection</name>
        <t>An implementation <bcp14>MUST</bcp14> reject:</t>
        <ul>
          <li>malformed JSON;</li>
          <li>a UTF-8 byte-order mark;</li>
          <li>invalid UTF-8;</li>
          <li>duplicate object member names;</li>
          <li>unpaired surrogate code points;</li>
          <li>integers outside the admitted range;</li>
          <li>normalization collisions; and</li>
          <li>values outside the admitted domain.</li>
        </ul>
      </section>
      <section>
        <name>Unicode Normalization and Member Ordering</name>
        <t>
          Every string and member name <bcp14>MUST</bcp14> be normalized to
          Unicode Normalization Form C as defined by
          <xref target="UNICODE-NORMALIZATION" />.
        </t>
        <t>
          If distinct input member names become identical after normalization,
          the object <bcp14>MUST</bcp14> be rejected.
        </t>
        <t>
          Object members <bcp14>MUST</bcp14> be sorted by ascending unsigned
          bytes of the normalized, unescaped member name encoded as UTF-8.
        </t>
      </section>
      <section>
        <name>Serialization</name>
        <t>
          Quotation mark, reverse solidus, backspace, form feed, line feed,
          carriage return, and horizontal tab use their short JSON escapes.
          Other control characters U+0000 through U+001F use lowercase
          <tt>\u00xx</tt> form. Other Unicode scalar values are emitted
          directly as UTF-8. Solidus is not escaped.
        </t>
        <t>
          Integers use base-10 with no plus sign, leading zero, or exponent.
          Arrays retain order. Commas and colons have no surrounding
          whitespace. The result has no byte-order mark and no trailing
          newline.
        </t>
      </section>
      <section>
        <name>Identifier Calculation</name>
        <ol>
          <li>Validate the complete artifact.</li>
          <li>Create a logical copy of the top-level object.</li>
          <li>Remove exactly the top-level <tt>artifact_id</tt> member if present.</li>
          <li>Serialize the remaining object under this profile.</li>
          <li>Calculate SHA-256 as defined by <xref target="RFC6234" /> over the exact bytes.</li>
          <li>Encode <tt>sha256:</tt> followed by 64 lowercase hexadecimal digits.</li>
        </ol>
        <t>
          A nested member named <tt>artifact_id</tt>
          <bcp14>MUST NOT</bcp14> be removed.
        </t>
      </section>
      <section>
        <name>Identifier Verification</name>
        <t>
          The submitted artifact <bcp14>MUST</bcp14> contain one top-level
          <tt>artifact_id</tt> whose value matches
          <tt>sha256:[0-9a-f]{64}</tt>. A verifier
          <bcp14>MUST</bcp14> independently calculate and compare the complete
          identifier. A mismatch is an integrity failure.
        </t>
      </section>
      <section>
        <name>Profile Boundary</name>
        <t>
          This restricted profile does not claim conformance with the JSON
          Canonicalization Scheme in <xref target="RFC8785" />.
        </t>
        <t>
          The public repository contains four positive and eleven negative
          vectors. Passing those vectors establishes tested profile behavior
          for one implementation, not independent interoperability.
        </t>
      </section>
    </section>
    <section>
      <name>Conformance</name>
      <t>A conformance claim <bcp14>MUST</bcp14> identify one or more targets:</t>
      <ol>
        <li>canonical JSON and identifier conformance;</li>
        <li>artifact-semantic validation conformance; or</li>
        <li>closure-verification conformance.</li>
      </ol>
      <t>
        Canonical-profile conformance <bcp14>MUST NOT</bcp14> be presented as
        complete protocol conformance. Independent cross-implementation
        interoperability is an evidence goal, not a prerequisite for
        publication of this experimental revision.
      </t>
    </section>
    <section>
      <name>Related Work and Protocol Boundaries</name>
      <t>
        KQML and FIPA-ACL historically separated communicative acts from
        content and ontology. Contemporary systems such as MCP, A2A, and ACP
        address tool, context, application, or agent communication layers.
        This document addresses the narrower semantics of public deliberation
        artifacts.
      </t>
      <t>
        <xref target="I-D.farley-acta-knowledge-units" /> defines Knowledge
        Units produced by a particular multi-model process.
        <xref target="I-D.farley-acta-signed-receipts" /> defines signed
        receipts. <xref target="I-D.ovidi-lip-4d" /> addresses intent context
        and authorization dialogue. <xref target="I-D.c4tz-marc" /> addresses
        control and uncertainty disclosure.
      </t>
      <t>
        This document does not prescribe a fixed round sequence, a
        knowledge-base output format, signatures, or an authorization
        dialogue. No priority, replacement, compatibility, or endorsement
        claim is made.
      </t>
    </section>
    <section anchor="research-context">
      <name>Research Context</name>
      <t>
        KQML <xref target="KQML" /> and FIPA ACL
        <xref target="FIPA-ACL" /> established typed communicative acts and
        explicit agent communication semantics.
      </t>
      <t>
        MCP <xref target="MCP" /> standardizes access to tools, resources,
        prompts, and context. A2A <xref target="A2A" /> standardizes task and
        application interoperability. ACP <xref target="ACP" /> is historical
        lineage that has joined A2A. These complementary layers do not define
        the artifact and closure semantics in this document.
      </t>
      <t>
        Multi-agent debate <xref target="MAD" /> motivates structured model
        interaction, while later evaluation <xref target="MAD-EVAL" /> cautions
        that debate does not consistently outperform simple baselines.
        Free-MAD <xref target="FREE-MAD" /> challenges majority consensus,
        CIPHER <xref target="CIPHER" /> explores embedding exchange, and G2CP
        <xref target="G2CP" /> explores graph-grounded communication.
      </t>
      <t>
        This document claims no priority, replacement, compatibility, or
        adoption with respect to these systems.
      </t>
    </section>
    <section>
      <name>Experimental Evidence and Limitations</name>
      <t>
        The design was informed by a completed twelve-round heterogeneous
        relay, a fail-closed full-history stress attempt, and targeted
        deterministic prototype tests.
      </t>
      <t>
        The completed relay used single-hop direct context. The stress attempt
        stopped at Round 2. The deterministic tests did not use paid model
        execution. The public fifteen-vector suite tests one reference
        implementation.
      </t>
      <t>
        This evidence does not prove efficiency, accuracy, scale, adversarial
        security, privacy safety, universal compatibility, or independent
        interoperability.
      </t>
    </section>
    <section>
      <name>Operational Considerations</name>
      <t>Implementations should define limits for:</t>
      <ul>
        <li>artifact size;</li>
        <li>graph depth;</li>
        <li>closure size;</li>
        <li>reference fan-out;</li>
        <li>retry behavior; and</li>
        <li>resource consumption.</li>
      </ul>
      <t>
        A limit-induced failure <bcp14>SHOULD</bcp14> be explicit rather than
        appearing as successful truncation.
      </t>
    </section>
    <section anchor="security">
      <name>Security Considerations</name>
      <t>
        Relevant actors include artifact producers, recipients, closure
        verifiers, orchestrators, evidence providers, storage operators, and
        attackers able to submit or replay artifacts. Protected assets include
        artifact integrity, provenance, decision closure, authorization
        policy, private state, sensitive application data, and availability.
      </t>
      <t>
        Trust boundaries exist between private computation and shared
        artifacts, transports and validators, external evidence and policy,
        and artifact storage and closure verification.
      </t>
      <t>
        Threats include forgery, impersonation, replay, equivocation,
        malicious references, provenance spoofing, prompt injection, evidence
        poisoning, role hijacking, omitted objections, false closure,
        adversarial extensions, and graph-based denial of service.
      </t>
      <t>
        Implementations <bcp14>SHOULD</bcp14> authenticate producers when
        attribution is required, reject identifier mismatches and cycles,
        enforce resource limits, separate untrusted evidence from policy,
        preserve blocking objections, and fail closed on unavailable required
        references.
      </t>
      <t>
        Content addressing does not establish identity, authorization,
        freshness, non-repudiation, or evidence truth. See
        <xref target="RFC3552" /> for security-consideration guidance.
      </t>
    </section>
    <section anchor="privacy">
      <name>Privacy Considerations</name>
      <t>
        Public means shared at the interoperability boundary and does not imply
        unrestricted Internet disclosure. A conforming implementation
        <bcp14>MUST NOT</bcp14> require disclosure of private chain-of-thought
        or private model state.
      </t>
      <t>
        Implementations <bcp14>SHOULD</bcp14> minimize payloads and provider
        metadata, disclose artifacts only to authorized recipients, define
        retention and deletion policy, and protect logs and backups.
      </t>
      <t>
        Stable identifiers and reference graphs can create linkability and
        correlation across sessions. Deployments <bcp14>SHOULD</bcp14> avoid
        unnecessary personal or cross-context identifiers and document
        secondary-use restrictions.
      </t>
      <t>
        Sanitization occurs before publication or forwarding. Removing
        chain-of-thought alone does not remove personal data, secrets,
        confidential evidence, or sensitive metadata.
      </t>
      <t>
        This revision defines no wire-level privacy labels. See
        <xref target="RFC6973" /> for privacy-design guidance.
      </t>
    </section>
    <section>
      <name>IANA Considerations</name>
      <t>This document requests no IANA actions.</t>
    </section>
    <section>
      <name>Future Work</name>
      <t>Work deferred beyond revision <tt>-00</tt> includes:</t>
      <ul>
        <li>authentication and signature profiles;</li>
        <li>transport bindings and media types;</li>
        <li>extension registries;</li>
        <li>bounded-history checkpoints;</li>
        <li>binary encodings;</li>
        <li>compact wire grammars;</li>
        <li>privacy-class labels;</li>
        <li>independent implementations; and</li>
        <li>cross-implementation testing.</li>
      </ul>
    </section>
    <section>
      <name>Acknowledgements</name>
      <t>
        This document derives from an experimental research program on
        heterogeneous model deliberation and from public review of the MSB
        research repository. The author thanks reviewers who identify
        ambiguities, unsupported claims, privacy risks, and interoperability
        failures.
      </t>
    </section>
  </middle>
  <back>
    <references>
      <name>References</name>
      <references>
        <name>Normative References</name>
        <reference anchor="BCP14" target="https://www.rfc-editor.org/info/bcp14">
          <front>
            <title>Key words for use in RFCs to Indicate Requirement Levels</title>
            <author initials="S." surname="Bradner" fullname="Scott Bradner" />
            <date month="March" year="1997" />
          </front>
          <seriesInfo name="BCP" value="14" />
        </reference>
        <reference anchor="RFC2119" target="https://www.rfc-editor.org/info/rfc2119">
          <front>
            <title>Key words for use in RFCs to Indicate Requirement Levels</title>
            <author initials="S." surname="Bradner" fullname="Scott Bradner" />
            <date month="March" year="1997" />
          </front>
          <seriesInfo name="BCP" value="14" />
          <seriesInfo name="RFC" value="2119" />
          <seriesInfo name="DOI" value="10.17487/RFC2119" />
        </reference>
        <reference anchor="RFC8174" target="https://www.rfc-editor.org/info/rfc8174">
          <front>
            <title>Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words</title>
            <author initials="B." surname="Leiba" fullname="Barry Leiba" />
            <date month="May" year="2017" />
          </front>
          <seriesInfo name="BCP" value="14" />
          <seriesInfo name="RFC" value="8174" />
          <seriesInfo name="DOI" value="10.17487/RFC8174" />
        </reference>
        <reference anchor="RFC8259" target="https://www.rfc-editor.org/info/rfc8259">
          <front>
            <title>The JavaScript Object Notation (JSON) Data Interchange Format</title>
            <author initials="T." surname="Bray" fullname="Tim Bray" />
            <date month="December" year="2017" />
          </front>
          <seriesInfo name="STD" value="90" />
          <seriesInfo name="RFC" value="8259" />
          <seriesInfo name="DOI" value="10.17487/RFC8259" />
        </reference>
        <reference anchor="RFC3629" target="https://www.rfc-editor.org/info/rfc3629">
          <front>
            <title>UTF-8, a transformation format of ISO 10646</title>
            <author initials="F." surname="Yergeau" fullname="Francois Yergeau" />
            <date month="November" year="2003" />
          </front>
          <seriesInfo name="STD" value="63" />
          <seriesInfo name="RFC" value="3629" />
          <seriesInfo name="DOI" value="10.17487/RFC3629" />
        </reference>
        <reference anchor="RFC6234" target="https://www.rfc-editor.org/info/rfc6234">
          <front>
            <title>US Secure Hash Algorithms (SHA and SHA-based HMAC and HKDF)</title>
            <author initials="D." surname="Eastlake" fullname="Donald Eastlake" />
            <author initials="T." surname="Hansen" fullname="Tony Hansen" />
            <date month="May" year="2011" />
          </front>
          <seriesInfo name="RFC" value="6234" />
          <seriesInfo name="DOI" value="10.17487/RFC6234" />
        </reference>
        <reference anchor="UNICODE-NORMALIZATION" target="https://www.unicode.org/reports/tr15/">
          <front>
            <title>Unicode Normalization Forms</title>
            <author>
              <organization>Unicode Consortium</organization>
            </author>
            <date year="2026" />
          </front>
          <seriesInfo name="Unicode Standard Annex" value="15" />
        </reference>
      </references>
      <references>
        <name>Informative References</name>
        <reference anchor="KQML" target="https://doi.org/10.1145/191246.191322">
          <front><title>KQML as an Agent Communication Language</title><author initials="T." surname="Finin" fullname="Tim Finin" /><author initials="R." surname="Fritzson" fullname="Richard Fritzson" /><author initials="D." surname="McKay" fullname="Don McKay" /><author initials="R." surname="McEntire" fullname="Robin McEntire" /><date year="1994" /></front><seriesInfo name="DOI" value="10.1145/191246.191322" />
        </reference>
        <reference anchor="FIPA-ACL" target="https://www.fipa.org/specs/fipa00037/">
          <front><title>FIPA Communicative Act Library Specification</title><author><organization>Foundation for Intelligent Physical Agents</organization></author><date year="2002" /></front><seriesInfo name="FIPA" value="SC00037" />
        </reference>
        <reference anchor="MCP" target="https://modelcontextprotocol.io/specification/">
          <front><title>Model Context Protocol Specification</title><author><organization>Model Context Protocol Project</organization></author><date year="2026" /></front>
        </reference>
        <reference anchor="A2A" target="https://a2a-protocol.org/">
          <front><title>Agent2Agent Protocol</title><author><organization>Agent2Agent Project</organization></author><date year="2026" /></front>
        </reference>
        <reference anchor="ACP" target="https://github.com/i-am-bee/acp">
          <front><title>Agent Communication Protocol</title><author><organization>BeeAI Community</organization></author><date year="2025" /></front>
        </reference>
        <reference anchor="MAD" target="https://arxiv.org/abs/2305.14325">
          <front><title>Improving Factuality and Reasoning in Language Models through Multiagent Debate</title><author initials="Y." surname="Du" fullname="Yilun Du" /><author initials="S." surname="Li" fullname="Shuang Li" /><author initials="A." surname="Torralba" fullname="Antonio Torralba" /><author initials="J. B." surname="Tenenbaum" fullname="Joshua B. Tenenbaum" /><author initials="I." surname="Mordatch" fullname="Igor Mordatch" /><date year="2023" /></front><seriesInfo name="arXiv" value="2305.14325" />
        </reference>
        <reference anchor="MAD-EVAL" target="https://arxiv.org/abs/2502.08788">
          <front><title>Stop Overvaluing Multi-Agent Debate -- We Must Rethink Evaluation and Embrace Model Heterogeneity</title><author initials="H." surname="Zhang" fullname="Hangfan Zhang" /><author initials="Z." surname="Cui" fullname="Zhiyao Cui" /><author initials="J." surname="Chen" fullname="Jianhao Chen" /><author initials="X." surname="Wang" fullname="Xinrun Wang" /><author initials="Q." surname="Zhang" fullname="Qiaosheng Zhang" /><author initials="Z." surname="Wang" fullname="Zhen Wang" /><author initials="D." surname="Wu" fullname="Dinghao Wu" /><author initials="S." surname="Hu" fullname="Shuyue Hu" /><date year="2025" /></front><seriesInfo name="arXiv" value="2502.08788" />
        </reference>
        <reference anchor="FREE-MAD" target="https://arxiv.org/abs/2509.11035">
          <front><title>Free-MAD: Consensus-Free Multi-Agent Debate</title><author initials="Y." surname="Cui" fullname="Yu Cui" /><author initials="H." surname="Fu" fullname="Hang Fu" /><author initials="H." surname="Zhang" fullname="Haibin Zhang" /><author initials="L." surname="Wang" fullname="Licheng Wang" /><author initials="C." surname="Zuo" fullname="Cong Zuo" /><date year="2025" /></front><seriesInfo name="arXiv" value="2509.11035" />
        </reference>
        <reference anchor="CIPHER" target="https://openreview.net/forum?id=sehRvaIPQQ">
          <front><title>Let Models Speak Ciphers: Multiagent Debate through Embeddings</title><author initials="C." surname="Pham" fullname="Chau Pham" /><author initials="B." surname="Liu" fullname="Boyi Liu" /><author initials="Y." surname="Yang" fullname="Yingxiang Yang" /><author initials="Z." surname="Chen" fullname="Zhengyu Chen" /><author initials="T." surname="Liu" fullname="Tianyi Liu" /><author initials="J." surname="Yuan" fullname="Jianbo Yuan" /><author initials="B. A." surname="Plummer" fullname="Bryan A. Plummer" /><author initials="Z." surname="Wang" fullname="Zhaoran Wang" /><author initials="H." surname="Yang" fullname="Hongxia Yang" /><date year="2024" /></front><seriesInfo name="ICLR" value="2024" /><seriesInfo name="arXiv" value="2310.06272" />
        </reference>
        <reference anchor="G2CP" target="https://arxiv.org/abs/2602.13370">
          <front><title>G2CP: A Graph-Grounded Communication Protocol for Verifiable and Efficient Multi-Agent Reasoning</title><author initials="K." surname="Ben Khaled" fullname="Karim Ben Khaled" /><author initials="D." surname="Monticolo" fullname="Davy Monticolo" /><date year="2026" /></front><seriesInfo name="arXiv" value="2602.13370" />
        </reference>
        <reference anchor="RFC3552" target="https://www.rfc-editor.org/info/rfc3552">
          <front>
            <title>Guidelines for Writing RFC Text on Security Considerations</title>
            <author initials="E." surname="Rescorla" fullname="Eric Rescorla" />
            <author initials="B." surname="Korver" fullname="B. Korver" />
            <date month="July" year="2003" />
          </front>
          <seriesInfo name="BCP" value="72" />
          <seriesInfo name="RFC" value="3552" />
          <seriesInfo name="DOI" value="10.17487/RFC3552" />
        </reference>
        <reference anchor="RFC6973" target="https://www.rfc-editor.org/info/rfc6973">
          <front>
            <title>Privacy Considerations for Internet Protocols</title>
            <author initials="A." surname="Cooper" fullname="Alissa Cooper" />
            <author initials="H." surname="Tschofenig" fullname="Hannes Tschofenig" />
            <date month="July" year="2013" />
          </front>
          <seriesInfo name="RFC" value="6973" />
          <seriesInfo name="DOI" value="10.17487/RFC6973" />
        </reference>
        <reference anchor="RFC8785" target="https://www.rfc-editor.org/info/rfc8785">
          <front>
            <title>JSON Canonicalization Scheme (JCS)</title>
            <author initials="A." surname="Rundgren" fullname="Anders Rundgren" />
            <author initials="B." surname="Jordan" fullname="Bradley Jordan" />
            <author initials="S." surname="Erdtman" fullname="Samuel Erdtman" />
            <date month="June" year="2020" />
          </front>
          <seriesInfo name="RFC" value="8785" />
          <seriesInfo name="DOI" value="10.17487/RFC8785" />
        </reference>
        <reference anchor="I-D.farley-acta-knowledge-units" target="https://datatracker.ietf.org/doc/draft-farley-acta-knowledge-units/">
          <front>
            <title>Knowledge Units for Multi-Model Deliberation</title>
            <author initials="T." surname="Farley" fullname="Thomas Farley" />
            <date month="April" year="2026" />
          </front>
          <seriesInfo name="Internet-Draft" value="draft-farley-acta-knowledge-units-00" />
        </reference>
        <reference anchor="I-D.farley-acta-signed-receipts" target="https://datatracker.ietf.org/doc/draft-farley-acta-signed-receipts/">
          <front>
            <title>Signed Decision Receipts for Machine-to-Machine Access Control</title>
            <author initials="T." surname="Farley" fullname="Thomas Farley" />
            <date year="2026" />
          </front>
          <seriesInfo name="Internet-Draft" value="draft-farley-acta-signed-receipts" />
        </reference>
        <reference anchor="I-D.ovidi-lip-4d" target="https://datatracker.ietf.org/doc/draft-ovidi-lip-4d/">
          <front>
            <title>LIP-4D: An Intent Context and Authorization Protocol for AI Agents</title>
            <author initials="O." surname="Ovidi" fullname="Ovidi" />
            <date month="July" year="2026" />
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ovidi-lip-4d-00" />
        </reference>
        <reference anchor="I-D.c4tz-marc" target="https://datatracker.ietf.org/doc/draft-c4tz-marc/">
          <front>
            <title>MARC: A Control and Uncertainty Disclosure Profile for Generative Models and Agents</title>
            <author initials="C." surname="c4tz" fullname="c4tz" />
            <date month="May" year="2026" />
          </front>
          <seriesInfo name="Internet-Draft" value="draft-c4tz-marc-02" />
        </reference>
      </references>
    </references>
  </back>
</rfc>
