<?xml version='1.0' encoding='utf-8'?>
<!DOCTYPE rfc [
  <!ENTITY nbsp    "&#160;">
  <!ENTITY zwsp   "&#8203;">
  <!ENTITY nbhy   "&#8209;">
  <!ENTITY wj     "&#8288;">
]>
<?xml-stylesheet type="text/xsl" href="rfc2629.xslt" ?>
<!-- generated by https://github.com/cabo/kramdown-rfc version 1.7.43 (Ruby 3.4.9) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-ietf-tls-trust-anchor-ids-05" category="std" consensus="true" submissionType="IETF" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.34.0 -->
  <front>
    <title>TLS Trust Anchor Identifiers</title>
    <seriesInfo name="Internet-Draft" value="draft-ietf-tls-trust-anchor-ids-05"/>
    <author initials="B." surname="Beck" fullname="Bob Beck">
      <organization>OpenSSL</organization>
      <address>
        <email>beck@openssl.org</email>
      </address>
    </author>
    <author initials="D." surname="Benjamin" fullname="David Benjamin">
      <organization>Google LLC</organization>
      <address>
        <email>davidben@google.com</email>
      </address>
    </author>
    <author initials="D." surname="O'Brien" fullname="Devon O'Brien">
      <organization/>
      <address>
        <email>devon.obrien@gmail.com</email>
      </address>
    </author>
    <author initials="K." surname="Nekritz" fullname="Kyle Nekritz">
      <organization>Meta</organization>
      <address>
        <email>knekritz@meta.com</email>
      </address>
    </author>
    <date year="2026" month="September" day="14"/>
    <area>Security</area>
    <workgroup>Transport Layer Security</workgroup>
    <abstract>
      <?line 99?>

<t>This document defines the TLS Trust Anchors extension, a mechanism for a TLS client or server to select a certificate to present based on the peer's trusted certification authorities. It describes certification authorities more succinctly than the TLS Certificate Authorities extension.</t>
    </abstract>
    <note removeInRFC="true">
      <name>About This Document</name>
      <t>
        The latest revision of this draft can be found at <eref target="https://tlswg.github.io/tls-trust-anchor-ids/draft-ietf-tls-trust-anchor-ids.html"/>.
        Status information for this document may be found at <eref target="https://datatracker.ietf.org/doc/draft-ietf-tls-trust-anchor-ids/"/>.
      </t>
      <t>
        Discussion of this document takes place on the
        Transport Layer Security Working Group mailing list (<eref target="mailto:tls@ietf.org"/>),
        which is archived at <eref target="https://mailarchive.ietf.org/arch/browse/tls/"/>.
        Subscribe at <eref target="https://www.ietf.org/mailman/listinfo/tls/"/>.
      </t>
      <t>Source for this draft and an issue tracker can be found at
        <eref target="https://github.com/tlswg/tls-trust-anchor-ids"/>.</t>
    </note>
  </front>
  <middle>
    <?line 103?>

<section anchor="introduction">
      <name>Introduction</name>
      <t>TLS <xref target="RFC9846"/> authentication uses X.509 certificates <xref target="RFC5280"/> to associate the <em>authenticating party's</em> TLS key with its application identifiers, such as DNS names. These associations are signed by some certification authority (CA). The peer, or <em>relying party</em>, curates a set of CAs that are trusted to only sign correct associations, which allows it to rely on the TLS to authenticate application identifiers. For a TLS server certificate, the authenticating party is the server and the relying party is the client. For a TLS client certificate, the roles are reversed.</t>
      <t>An authenticating party may need to interoperate with relying parties that trust different sets of CAs. <xref section="4.3.4" sectionFormat="of" target="RFC9846"/> defines the <tt>certificate_authorities</tt> extension to accommodate this. It allows the authenticating party to provision multiple certificates and select the one that will allow the relying party to accept its TLS key. This is analogous to parameter negotiation elsewhere in TLS.</t>
      <t>Without a negotiation mechanism, the authenticating party must obtain a single certificate that simultaneously satisfies all relying parties. This is challenging when relying parties are diverse. PKI transitions, including those necessary for user security, naturally lead to relying party diversity, so the result is that service availability conflicts with security and overall PKI evolution:</t>
      <ul spacing="normal">
        <li>
          <t>For an authenticating party to use a CA in its single certificate, all supported relying parties must trust the CA. PKI transitions then become difficult when authenticating parties support older, unupdated relying parties. This impacts both new keys from existing CA operators and new CA operators.</t>
        </li>
        <li>
          <t>When a relying party must remove no longer trustworthy CAs, rotate CA keys, add new CAs, or otherwise update to meet new security requirements, it will differ from older versions and potentially other relying parties. This adds to relying party diversity and the challenges that authenticating parties and CAs face. The relying party must then choose between compromising on user security or burdening the rest of the ecosystem, potentially impacting availability in the process.</t>
        </li>
      </ul>
      <t>However, <tt>certificate_authorities</tt>'s size is impractical for some applications. Existing PKIs may have many CAs, and existing CAs may have long X.509 names. As of August 2023, the Mozilla CA Certificate Program <xref target="MOZILLA-ROOTS"/> contained 144 CAs, with an average name length of around 100 bytes. Such TLS deployments often do not use trust anchor negotiation at all.</t>
      <t>To address this, this document introduces Trust Anchor Identifiers (Trust Anchor IDs). There are several parts to this mechanism:</t>
      <ol spacing="normal" type="1"><li>
          <t><xref target="trust-anchor-ids"/> defines <em>trust anchor IDs</em>, which are short, unique identifiers for X.509 trust anchors, or groups of trust anchors.</t>
        </li>
        <li>
          <t><xref target="tls-extension"/> defines a TLS extension that communicates the relying party's requested trust anchors using trust anchor IDs. IDs that represent individual trust anchors can mitigate long X.509 names. IDs that represent groups of trust anchors can mitigate large trust anchor lists.</t>
        </li>
        <li>
          <t><xref target="recovery"/> defines a recovery mechanism that, when the relying party is a TLS client, can mitigate signaling failures. The server provides its available trust anchors alongside its certificate, so that the client can retry on mismatch. This can further mitigate large trust anchor lists by allowing the client to initially omit some trust anchors or use an otherwise too broad trust anchor group. However, this mitigation can come at the cost of additional round trips in some cases.</t>
        </li>
      </ol>
      <t>Together, they reduce the size costs of trust anchor negotiation, supporting flexible and robust PKIs for more applications.</t>
    </section>
    <section anchor="conventions-and-definitions">
      <name>Conventions and Definitions</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>This document additionally uses the TLS presentation language, defined in <xref section="3" sectionFormat="of" target="RFC9846"/>, and ASN.1, defined in <xref target="X680"/>.</t>
      <section anchor="terminology-and-roles">
        <name>Terminology and Roles</name>
        <t>This document discusses three roles:</t>
        <dl>
          <dt>Authenticating party:</dt>
          <dd>
            <t>The party authenticating itself in the protocol. In TLS, this is the side sending the Certificate and CertificateVerify message.</t>
          </dd>
          <dt>Relying party:</dt>
          <dd>
            <t>The party whom the authenticating party presents its identity to. In TLS, this is the side that validates a Certificate and CertificateVerify message.</t>
          </dd>
          <dt>Certification authority (CA):</dt>
          <dd>
            <t>The service issuing certificates to the authenticating party.</t>
          </dd>
        </dl>
        <t>Additionally, there are several terms used throughout this document to describe this proposal:</t>
        <dl>
          <dt>Trust anchor:</dt>
          <dd>
            <t>A pre-distributed X.509 name and public key that relying parties use to determine whether a certification path is trusted. See <xref section="6.1.1" sectionFormat="of" target="RFC5280"/>. Trust anchors are sometimes configured as self-signed certificates.</t>
          </dd>
          <dt>Certification path:</dt>
          <dd>
            <t>An ordered list of X.509 certificates starting with the target certificate. Each certificate is issued by the next certificate, except the last, which is issued by a trust anchor.</t>
          </dd>
        </dl>
      </section>
    </section>
    <section anchor="overview">
      <name>Overview</name>
      <t>TLS certificate selection (see <xref section="4.5.1.2" sectionFormat="of" target="RFC9846"/>) combines information from both the authenticating and relying party:</t>
      <ol spacing="normal" type="1"><li>
          <t>The authenticating party is configured with one or more candidate certification paths.</t>
        </li>
        <li>
          <t>The relying party is configured with one or more supported trust anchors.</t>
        </li>
        <li>
          <t>In the TLS handshake, the relying party sends a ClientHello or CertificateRequest message that describes its preferences.</t>
        </li>
        <li>
          <t>Based on this information, the authenticating party selects the best candidate certification path to present.</t>
        </li>
      </ol>
      <t>To successfully complete the handshake, the authenticating party must select some path that both:</t>
      <ul spacing="normal">
        <li>
          <t>is issued by one of the relying party's trust anchors and</t>
        </li>
        <li>
          <t>satisfies any other constraints in the TLS protocol, such as whether there is a common signature algorithm</t>
        </li>
      </ul>
      <t>This document defines a mechanism to evaluate the first condition. In particular, it defines:</t>
      <ul spacing="normal">
        <li>
          <t>How the relying party describes its supported trust anchors (<xref target="relying-party-configuration"/>)</t>
        </li>
        <li>
          <t>How the authenticating party interprets this description to inform certificate selection (<xref target="authenticating-party-configuration"/>)</t>
        </li>
        <li>
          <t>For server certificates, a recovery mechanism for signaling failure (<xref target="recovery"/>)</t>
        </li>
      </ul>
    </section>
    <section anchor="trust-anchor-ids">
      <name>Trust Anchor Identifiers</name>
      <t>A trust anchor ID is a short, unique identifier that represents a trust anchor or a group of trust anchors. When a trust anchor ID represents a group of trust anchors, it is known as a <em>trust anchor group</em>.</t>
      <t>A trust anchor ID is an object identifier (OID) <xref target="X680"/> under the OID arc of some IANA-registered Private Enterprise Number (PEN) <xref target="RFC9371"/>. For compactness, they are represented as relative object identifiers (see Section 33 of <xref target="X680"/>), relative to the OID prefix <tt>1.3.6.1.4.1</tt>. For example, an organization with PEN 32473 might define a trust anchor ID with the OID <tt>1.3.6.1.4.1.32473.1</tt>. As a relative object identifier, it would be the OID <tt>32473.1</tt>.</t>
      <t>Depending on the protocol, trust anchor IDs may be represented in one of three ways:</t>
      <ul spacing="normal">
        <li>
          <t>For use in ASN.1-based protocols, a trust anchor ID's ASN.1 representation is the relative object identifier described above. This may be encoded in DER <xref target="X690"/>, or some other ASN.1 encoding. The example ID's DER encoding is the six-octet sequence <tt>{0x0d, 0x04, 0x81, 0xfd, 0x59, 0x01}</tt>.</t>
        </li>
        <li>
          <t>For use in binary protocols such as TLS, a trust anchor ID's binary representation consists of the contents octets of the relative object identifier's DER encoding, as described in Section 8.20 of <xref target="X690"/>. Note this omits the tag and length portion of the encoding. The example ID's binary representation is the four-octet sequence <tt>{0x81, 0xfd, 0x59, 0x01}</tt>.</t>
        </li>
        <li>
          <t>For use in ASCII-compatible text protocols, a trust anchor ID's ASCII representation is the relative object identifier in dotted decimal notation. The example ID's ASCII representation is <tt>32473.1</tt>.</t>
        </li>
      </ul>
      <t>The length of a trust anchor ID's binary representation MUST NOT exceed 255 bytes. It SHOULD be significantly shorter, for bandwidth efficiency.</t>
      <t>A trust anchor ID representing a single trust anchor SHOULD be allocated by the CA operator and be common among relying parties that trust the CA. They MAY be allocated by another party, e.g. when bootstrapping an existing ecosystem, if all parties agree on the ID. In particular, the protocol requires authenticating and relying parties to agree, and the authenticating party's configuration typically comes from the CA.</t>
      <t>A trust anchor ID representing a trust anchor group MAY be allocated by any party. However, to be useful, the group requires agreement between relying parties and authenticating parties. <xref target="trust-anchor-groups"/> discusses defining trust anchor groups in more detail.</t>
      <t>When embedded in a TLS structure, a trust anchor ID uses the TrustAnchorID structure defined below. The contents of the TrustAnchorID, after the one-byte length prefix, are the binary representation of the trust anchor ID.</t>
      <sourcecode type="tls-presentation"><![CDATA[
opaque TrustAnchorID<1..2^8-1>;
]]></sourcecode>
    </section>
    <section anchor="tls-extension">
      <name>TLS Extension</name>
      <section anchor="extension-syntax">
        <name>Extension Syntax</name>
        <t>The <tt>trust_anchors</tt> extension is defined using the structures below:</t>
        <sourcecode type="tls-presentation"><![CDATA[
enum { trust_anchors(TBD), (2^16-1) } ExtensionType;

/* Syntax when sent in ClientHello or CertificateRequest: */
TrustAnchorID RequestedTrustAnchorList<0..2^16-1>;

/* Syntax when sent in Certificate: */
struct {} Empty;

/* Syntax when sent in EncryptedExtensions: */
TrustAnchorID AvailableTrustAnchorList<1..2^16-1>;
]]></sourcecode>
        <t>A TrustAnchorID structure contains the binary representation of some trust anchor ID, as described in <xref target="trust-anchor-ids"/>.</t>
        <t>When the <tt>trust_anchors</tt> extension is sent in ClientHello or CertificateRequest, the <tt>extension_data</tt> is a RequestedTrustAnchorList. It indicates that the sender supports the specified trust anchors or trust anchor groups. The list is unordered, and MAY be empty. <xref target="relying-party-configuration"/> describes how the relying party determines this value. <xref target="authenticating-party-configuration"/> describes how the authenticating party evaluates this value.</t>
        <t>When the <tt>trust_anchors</tt> extension is sent in Certificate, the <tt>extension_data</tt> MUST be empty. The extension MUST only be sent in the first CertificateEntry. It indicates that the sender sent the certificate because the certificate matched a trust anchor ID sent by the peer. <xref target="strict-certification-paths"/> describes this in detail.</t>
        <t>When the <tt>trust_anchors</tt> extension is sent in EncryptedExtensions, the <tt>extension_data</tt> is an AvailableTrustAnchorList. It indicates individual trust anchors for which the server has a candidate path, in order of most to least preferred by the server. This list MUST NOT be empty. If the server has no available trust anchors to present, it MUST omit the extension. <xref target="recovery"/> describes this in detail.</t>
      </section>
      <section anchor="relying-party-configuration">
        <name>Relying Party Configuration</name>
        <t>Relying parties are configured with:</t>
        <ol spacing="normal" type="1"><li>
            <t>An <em>associated trust anchor ID</em> for each supported trust anchor that participates in this protocol</t>
          </li>
          <li>
            <t>A list of <em>requested trust anchor IDs</em> which, together, describe supported trust anchors</t>
          </li>
        </ol>
        <t>A trust anchor's associated ID MUST be the trust anchor ID which represents it. In this document, the ID is expected to be configured separately from the trust anchor for compatibility with existing PKIs. Future certificate profiles MAY define representations where the trust anchor ID is encoded directly in the trust anchor.</t>
        <t>Relying parties MAY support trust anchors without associated trust anchor IDs, but such trust anchors will not participate in this protocol. Those trust anchors MAY participate in other trust anchor negotiation protocols, such as the <tt>certificate_authorities</tt> extension.</t>
        <t>In a TLS connection, the relying party sends its requested trust anchor IDs in the ClientHello message (if a client) or CertificateRequest message (if a server). This communicates a set of supported trust anchors to the authenticating party.</t>
        <t>The requested trust anchor IDs MAY be determined by collecting the associated IDs of each supported trust anchor. Alternatively, a relying party MAY configure a requested list of IDs for individual trust anchors and IDs for trust anchor groups. Using groups can further reduce the size of messages sent by the relying party, but requires that authenticating parties be configured to recognize them. See also <xref target="authenticating-party-configuration"/>.</t>
        <t>If the relying party is a client, it is not necessary for the requested trust anchor IDs to be fully accurate. A client MAY omit trust anchors that it trusts or signal trust anchors which it does not trust. This can be useful in several scenarios:</t>
        <ul spacing="normal">
          <li>
            <t>The client MAY try to reduce size with a common trust anchor group, but the group contains some untrusted trust anchors. Sending the group would signal the full contents of the group.</t>
          </li>
          <li>
            <t>The client MAY send a (possibly empty) subset of its trust anchors due to fingerprinting risks (see <xref target="privacy-considerations"/>) or size concerns.</t>
          </li>
          <li>
            <t>The client MAY send trust anchors it does not trust. This can reduce fingerprinting if, e.g., default instances of the client send this value, but an individual user has configured their software to distrust the CA.</t>
          </li>
        </ul>
        <t>If the client list is inaccurate, it is possible the server will select an untrusted certificate. The connection will then fail. Clients that send potentially inaccurate lists SHOULD implement the recovery mechanism described in <xref target="recovery"/>. The associated IDs of individual trust anchors are used in recovery. Recovery requires a round-trip, so clients SHOULD send as accurate a list as feasible.</t>
      </section>
      <section anchor="authenticating-party-configuration">
        <name>Authenticating Party Configuration</name>
        <t>The authenticating party compares the requested trust anchor IDs with its candidate certification paths. To do this, each candidate certification path that participates in this protocol MUST be configured with:</t>
        <ul spacing="normal">
          <li>
            <t>The trust anchor ID for the CA that issued this candidate path.</t>
          </li>
          <li>
            <t>The trust anchor groups known to contain the issuing CA. The CA can be contained in a family of related trust anchor groups, such as in <xref target="versioned-groups"/>. To accomodate this, the IDs of the containing groups are described with a list of <em>trust anchor ID patterns</em>, defined below in <xref target="trust-anchor-id-patterns"/>. Note these patterns specify the IDs of the groups, not their contents.</t>
          </li>
        </ul>
        <t><xref target="certificate-properties"/> defines a format to represent these properties. <xref target="acme-extension"/> defines how to obtain them from ACME <xref target="RFC8555"/>.</t>
        <t>The authenticating party intersects this information with the requested trust anchor IDs to determine if the relying party trusts the issuing CA. A candidate path is said to <em>match</em> the requested trust anchor IDs if either:</t>
        <ul spacing="normal">
          <li>
            <t>One of the requested trust anchor IDs is equal to the path's trust anchor ID.</t>
          </li>
          <li>
            <t>One of the requested trust anchor IDs is contained in one of the path's trust anchor group patterns.</t>
          </li>
        </ul>
        <t>Authenticating parties MAY have candidate certification paths that do not participate in this protocol and lack these properties. These paths MAY participate in other trust anchor negotiation protocols, such as the <tt>certificate_authorities</tt> extension, or they MAY be used as a fallback when no matching issuer is found.</t>
        <section anchor="trust-anchor-id-patterns">
          <name>Trust Anchor ID Patterns</name>
          <t>A <em>trust anchor ID pattern</em> specifies a collection of related IDs. In this document, the IDs matched by a pattern are always the IDs of trust anchor groups. It is a sequence of pairs <tt>min</tt> and <tt>max</tt>. <tt>min</tt> is a non-negative integer and <tt>max</tt> is either a non-negative integer or infinity. A pattern is said to <em>contain</em> some trust anchor ID if both of the following are true:</t>
          <ol spacing="normal" type="1"><li>
              <t>The number of components of the trust anchor ID, as a relative OID, is equal to the number of pairs in the pattern.</t>
            </li>
            <li>
              <t>Each component of the trust anchor ID, as a relative OID, is between <tt>min</tt> and <tt>max</tt>, inclusive, of the corresponding pair in the pattern.</t>
            </li>
          </ol>
          <t>A trust anchor ID pattern is represented as a byte string by concatenating the <tt>min</tt> and <tt>max</tt> values of each pair, in order. Each <tt>min</tt> or <tt>max</tt> value is encoded as follows:</t>
          <ul spacing="normal">
            <li>
              <t>Infinity is encoded as a single byte, 0x80.</t>
            </li>
            <li>
              <t>A non-negative integer is encoded as described in paragraph 8.19.2 of <xref target="X690"/>. That is, each value is encoded in variable-length, big-endian, base-128 encoding. Each base-128 digit is in the seven least significant bits of each byte. The most significant bit of each byte is unset for the final byte and set for all other bytes. Values are encoded in the fewest number of non-zero bytes needed.</t>
            </li>
          </ul>
          <t>A trust anchor ID pattern can be represented in text as follows:</t>
          <ol spacing="normal" type="1"><li>
              <t>Represent each <tt>min</tt> and <tt>max</tt> pair as:
              </t>
              <ul spacing="normal">
                <li>
                  <t>if <tt>min</tt> equals <tt>max</tt>, <tt>min</tt> as a single decimal integer</t>
                </li>
                <li>
                  <t>if <tt>max</tt> is not infinity, the concatenation of "{", <tt>min</tt> as a decimal integer, "-", <tt>max</tt> as a decimal integer, and "}"</t>
                </li>
                <li>
                  <t>if <tt>max</tt> is infinity, the concatenation of "{", <tt>min</tt> as a decimal integer, and "-}"</t>
                </li>
              </ul>
            </li>
            <li>
              <t>Concatenate the representations of each pair, separating each by ".".</t>
            </li>
          </ol>
          <t>The byte string representation of an OID component is order-preserving by length and then lexicographic comparison, so the following procedures can be used to check if an ID is contained in the pattern:</t>
          <t>To remove an encoded base-128 integer from a byte string, <tt>in</tt>:</t>
          <ol spacing="normal" type="1"><li>
              <t>If <tt>in</tt> is empty, fail the procedure. There are no more values in <tt>in</tt>.</t>
            </li>
            <li>
              <t>If the first byte of <tt>in</tt> is 0x80, fail the procedure. The value was not minimally encoded.</t>
            </li>
            <li>
              <t>Find the earliest byte of <tt>in</tt> whose most-significant bit is unuset.</t>
            </li>
            <li>
              <t>If not found, fail the procedure. The value was truncated.</t>
            </li>
            <li>
              <t>Remove and return the prefix of <tt>in</tt> which ends at the found byte.</t>
            </li>
          </ol>
          <t>To compare two encoded base-128 integers, <tt>a</tt> and <tt>b</tt>:</t>
          <ol spacing="normal" type="1"><li>
              <t>Compare <tt>a</tt>'s length to <tt>b</tt>'s length. If they are not equal, return the result of the comparison.</t>
            </li>
            <li>
              <t>Return the result of lexicographically comparing <tt>a</tt> and <tt>b</tt>. Bytes in <tt>a</tt> and <tt>b</tt> are intepreted as integers from 0 to 255.</t>
            </li>
          </ol>
          <t>To check if a trust anchor ID pattern, <tt>pattern</tt>, contains a trust anchor ID <tt>id</tt>, both in their byte representations:</t>
          <ol spacing="normal" type="1"><li>
              <t>While <tt>id</tt> is not empty:
              </t>
              <ol spacing="normal" type="1"><li>
                  <t>Remove an encoded base-128 integer from <tt>id</tt>. Let <tt>v</tt> be the value removed.</t>
                </li>
                <li>
                  <t>Remove an encoded base-128 integer from <tt>pattern</tt>. Let <tt>min</tt> be the value removed.</t>
                </li>
                <li>
                  <t>Compare <tt>v</tt> and <tt>min</tt> as described above. If <tt>v</tt> is less than <tt>min</tt>, fail the procedure.</t>
                </li>
                <li>
                  <t>If <tt>pattern</tt> is not empty and the next byte of <tt>pattern</tt> is 0x80, remove this byte and continue to the next loop iteration.</t>
                </li>
                <li>
                  <t>Otherwise, remove an encoded base-128 integer from <tt>pattern</tt>. Let <tt>max</tt> be the value removed.</t>
                </li>
                <li>
                  <t>Compare <tt>max</tt> and <tt>v</tt> as described above. If <tt>max</tt> is less than <tt>v</tt>, fail the procedure.</t>
                </li>
              </ol>
            </li>
            <li>
              <t>If <tt>pattern</tt> is not empty, fail the procedure. Otherwise, the procedure succeeds.</t>
            </li>
          </ol>
          <t>For example, <tt>32473.{123-456}.{789-}</tt> is a pattern that matches three-component IDs, where the first component must be 32473, the second must be between 123 and 456, and the final component must be at least 789. The byte string representation is:</t>
          <artwork><![CDATA[
  // component[0].min = 32473
  0x81, 0xfd, 0x59,
  // component[0].max = 32473
  0x81, 0xfd, 0x59,
  // component[1].min = 123
  0x7b,
  // component[1].max = 456
  0x83, 0x48,
  // component[2].min = 789
  0x86, 0x15,
  // component[2].max = infinity
  0x80,
]]></artwork>
          <t>It contains the following IDs:</t>
          <ul spacing="normal">
            <li>
              <t><tt>32473.123.789</tt></t>
            </li>
            <li>
              <t><tt>32473.300.900</tt></t>
            </li>
            <li>
              <t><tt>32473.456.99999</tt></t>
            </li>
          </ul>
          <t>It does not contain any of the following IDs:</t>
          <ul spacing="normal">
            <li>
              <t><tt>32473.123</tt> (too few components)</t>
            </li>
            <li>
              <t><tt>32473.123.789.0</tt> (too many components)</t>
            </li>
            <li>
              <t><tt>32474.123.789</tt> (first component out of range)</t>
            </li>
            <li>
              <t><tt>32473.500.789</tt> (second component out of range)</t>
            </li>
            <li>
              <t><tt>32473.123.700</tt> (third component out of range)</t>
            </li>
          </ul>
          <t><xref target="trust-anchor-id-pattern-test-vectors"/> provides more extensive test vectors.</t>
        </section>
      </section>
      <section anchor="certificate-selection">
        <name>Certificate Selection</name>
        <t>This document extends TLS certificate selection (<xref section="4.5.1.2" sectionFormat="of" target="RFC9846"/>) as follows:</t>
        <ul spacing="normal">
          <li>
            <t>If the ClientHello or CertificateRequest contains a <tt>trust_anchors</tt> extension, the authenticating party SHOULD send a certification path that matches the requested trust anchor IDs, as described in <xref target="authenticating-party-configuration"/>. See <xref target="strict-certification-paths"/> for additional requirements in this case.</t>
          </li>
          <li>
            <t>If the ClientHello or CertificateRequest contains both <tt>trust_anchors</tt> and <tt>certificate_authorities</tt>, certification paths that satisfy either extension's criteria MAY be used. This additionally applies to future extensions which play a similar role.</t>
          </li>
          <li>
            <t>If no certification paths satisfy either extension, the authenticating party MAY return a <tt>handshake_failure</tt> alert, or send some fallback certificate, without considering <tt>trust_anchors</tt> or <tt>certificate_authorities</tt>.</t>
          </li>
        </ul>
        <t>Sending a fallback allows the authenticating party to retain support for relying parties that do not implement any form of trust anchor negotiation. In this case, the authenticating party must find a sufficiently ubiquitous trust anchor, if one exists. However, only those relying parties need to be considered in this ubiquity determination. Updated relying parties may continue to evolve without restricting fallback certificate selection. <xref target="trust-anchor-negotiation-property"/> describes a RECOMMENDED mechanism for determining fallbacks.</t>
        <t>When the authenticating party is a server, <xref target="recovery"/> describes an additional requirement for servers that implement this protocol.</t>
      </section>
      <section anchor="strict-certification-paths">
        <name>Strict Certification Paths</name>
        <t>If, and only if, the authenticating party sends a certification path that matches the relying party's <tt>trust_anchors</tt> extension, the authenticating party MUST send an empty <tt>trust_anchors</tt> extension in the first CertificateEntry of the Certificate message.</t>
        <t>In this case, the <tt>certificate_list</tt> flexibility described in <xref section="4.5.1" sectionFormat="of" target="RFC9846"/> no longer applies. The <tt>certificate_list</tt> MUST contain a complete certification path, correctly ordered and with no extraneous certificates. That is, each certificate MUST certify the one immediately preceding it, and the path's trust anchor MUST certify the final certificate.</t>
        <t>If a relying party receives this extension in the Certificate message, it MAY choose to disable path building <xref target="RFC4158"/> and validate the peer's certificate list as a pre-built certification path. Doing so avoids the unpredictable behavior of path-building, and helps ensure CAs and authenticating parties do not inadvertently provision incorrect paths.</t>
      </section>
      <section anchor="recovery">
        <name>Recovery</name>
        <t>If the relying party is a client, it MAY, as described in <xref target="relying-party-configuration"/>, request extra trust anchors or omit trusted ones. To accommodate this, this section defines a protocol for recovering from signaling failure in server certificate selection.</t>
        <t>When receiving a ClientHello with <tt>trust_anchors</tt>, the server collects all candidate certification paths which:</t>
        <ul spacing="normal">
          <li>
            <t>Have a trust anchor ID, and</t>
          </li>
          <li>
            <t>Satisfy the conditions in <xref section="4.5.1.2" sectionFormat="of" target="RFC9846"/>, with the exception of <tt>certificate_authorities</tt>, and any future extensions that play a similar role</t>
          </li>
        </ul>
        <t>If this collection is non-empty, the server MUST send a <tt>trust_anchors</tt> extension in EncryptedExtensions, containing the corresponding trust anchor IDs in preference order.</t>
        <t>If a client requests extra trust anchors or omits trusted ones, it SHOULD implement the following recovery mechanism:</t>
        <t>If the client receives either a connection error or an untrusted certificate, the client looks in the server's EncryptedExtensions for a trust anchor ID that it trusts. If there are multiple, it selects an option based on the server's preference order and its local preferences. It then makes a new connection to the same endpoint, requesting only the selected trust anchor ID in the ClientHello <tt>trust_anchors</tt> extension. If the EncryptedExtensions had no <tt>trust_anchors</tt> extension, or no match was found, the client returns the error to the application.</t>
        <t>Clients SHOULD retry at most once per connection attempt.</t>
        <t>This mechanism allows the connection to recover from a certificate selection failure, at additional latency cost.</t>
        <t>This mechanism also allows servers to safely send fallback certificates that may not be as ubiquitously acceptable. Without some form of trust anchor negotiation, servers are limited to selecting certification paths that are ubiquitously trusted in all supported clients. This often means sending extra cross-certificates to target the lowest common denominator at a bandwidth cost. If the ClientHello contains <tt>trust_anchors</tt>, the server MAY opportunistically send a less ubiquitous, more bandwidth-efficient path based on local heuristics, with the expectation that the client will retry when the heuristics fail.</t>
      </section>
    </section>
    <section anchor="trust-anchor-groups">
      <name>Trust Anchor Groups</name>
      <t>A trust anchor ID is typically much smaller than the corresponding X.509 name. Depending on the number of trust anchors, this can be sufficient to efficiently represent relying party state.</t>
      <t>PKIs where further size savings are needed can use trust anchor groups (<xref target="trust-anchor-ids"/>). Trust anchor groups require additional coordination within a PKI, but they can further reduce relying party message sizes by allowing one ID to signal multiple trust anchors. To be usable, a trust anchor group must:</t>
      <ul spacing="normal">
        <li>
          <t>be known to and sent by relying parties (see <xref target="relying-party-configuration"/>); and</t>
        </li>
        <li>
          <t>configured with candidate paths in authenticating parties (see <xref target="authenticating-party-configuration"/>), ideally provided by the CA during issuance (see <xref target="certificate-properties"/>).</t>
        </li>
      </ul>
      <t>This document does not prescribe how to define trust anchor groups, but gives some general guidance:</t>
      <t>A trust anchor group specifies a collection of trust anchors, which a relying party can send to represent the contents. For example:</t>
      <ul spacing="normal">
        <li>
          <t>A set of root CAs (or intermediate CAs, as in <xref target="intermediate-elision"/>) operated by a CA operator.</t>
        </li>
        <li>
          <t>A set of trust anchors common to large set of relying parties.</t>
        </li>
        <li>
          <t>A set of related application-specific trust anchors, such as a range of Merkle Tree Certificate landmarks <xref target="I-D.ietf-plants-merkle-tree-certs"/>.</t>
        </li>
      </ul>
      <t>Different group definitions trade off size savings, applicability, and coordination overhead. A group that reflects a single CA operator will cover fewer trust anchors, so a relying party might combine several operators' IDs to describe its trust anchors. However, it is generally usable by relying parties that trust this CA operator. Such a group also requires minimal coordination for the CA operator to provide group inclusion information (<xref target="authenticating-party-configuration"/>) with the certificate.</t>
      <t>Conversely, a group that reflects a single relying party vendor can potentially be the only ID sent. However, it may be less generally usable when relying parties differ. Groups reflecting multiple relying party vendors are more broadly usable, but may need to be combined with other IDs in a given relying party. For example, a relying party might send a group containing established CAs common to its ecosystem, and individual IDs for its remaining, not yet as common CAs.</t>
      <t>A client relying party MAY send a group containing CAs it does not trust, however it SHOULD then be prepared to recover (see <xref target="recovery"/>) in case of signaling failure.</t>
      <t>The matching process described in <xref target="authenticating-party-configuration"/> can be implemented generically for any trust anchor group. This allows deployments to tailor their group allocation based on their needs, without requiring software updates in authenticating parties. Where feasible, deployments SHOULD use groups that are more broadly applicable and require lower coordination overhead.</t>
      <section anchor="versioned-groups">
        <name>Versioned Groups</name>
        <t>Over time, a group may become out-of-date, making it describe current relying parties less effectively. For example, a CA operator may deploy or turn down a CA instance, or a relying party may trust a new CA or distrust an existing CA. Existing trust anchor groups SHOULD NOT be redefined, but the following versioning scheme MAY be used to define updated groups:</t>
        <t>A versioned sequence of trust anchor groups is identified by a OID arc. Each group has an ID of this OID arc, with a non-negative integer version number component appended. For example, versioned groups using the OID arc <tt>32473.2</tt> would have IDs <tt>32473.2.0</tt>, <tt>32473.2.1</tt>, <tt>32473.2.2</tt>, and so on. When defining a new group version, the version component is incremented.</t>
        <t>Each candidate path is then configured with the versioned groups that contain it. These groups are described by a trust anchor ID pattern (<xref target="trust-anchor-id-patterns"/>) as follows:</t>
        <ol spacing="normal" type="1"><li>
            <t>Let <tt>base</tt> be the OID arc that identifies the sequence. Let <tt>min</tt> be the first version that includes the trust anchor.</t>
          </li>
          <li>
            <t>At issuance, if the trust anchor is no longer in the latest group version, let <tt>max</tt> be the last version that includes the trust anchor. The pattern is <tt>base.{min-max}</tt>.</t>
          </li>
          <li>
            <t>At issuance, if the trust anchor is in the latest group version, the pattern is <tt>base.{min-}</tt>. That is, the last component has a <tt>max</tt> of 2<sup>64</sup>-1.</t>
          </li>
        </ol>
        <t>In the second case, the range contains not-yet-defined group versions, so there is a potential signaling error. Suppose, after issuance, a new group version is defined without the trust anchor. The unlimited upper bound is now incorrect. A relying party might not trust this trust anchor, while sending this new group version. However, the authenticating party will misinterpret the certificate as compatible based on its stale information. Such signaling errors may result in the wrong certificate being selected.</t>
        <t>This can be mitigated in one several ways:</t>
        <ul spacing="normal">
          <li>
            <t>Only pre-existing certificates are impacted. Newly-issued certificates postdate this version and will have the correct upper bound. When the certificate is renewed, group inclusions will be corrected.</t>
          </li>
          <li>
            <t><xref target="SCTNotAfter"/> describes a trust anchor removal strategy that only impacts newly-issued certificates. In this case, no renewal is needed. Pre-existing group inclusions remain accurate under this strategy.</t>
          </li>
          <li>
            <t>If the authenticating party's preferences place the correct candidate path (issued by a newer trust anchor) ahead of misinterpreted one (issued by the removed trust anchor), the correct candidate will still be chosen.</t>
          </li>
          <li>
            <t>When the relying party is a client, any remaining signaling errors can be corrected with the recovery mechanism described in <xref target="recovery"/>.</t>
          </li>
        </ul>
      </section>
    </section>
    <section anchor="certificate-properties">
      <name>Certificate Properties</name>
      <t>As described in <xref target="authenticating-party-configuration"/>, certification paths participating in this mechanism must be configured with a trust anchor ID. This section introduces a RECOMMENDED extensible CertificatePropertyList structure for representing this and other additional properties of a certification path. CertificatePropertyLists may be used as part of authenticating party configuration, and for CAs to communicate additional properties during certificate issuance.</t>
      <t>The extensibility aims to simplify application deployment as PKI mechanisms evolve. When certificate issuance and application software is updated to pass this structure to the underlying TLS implementation, new properties may be transparently defined without changes to certificate and configuration management.</t>
      <t>A CertificatePropertyList is defined using the TLS presentation language (<xref section="3" sectionFormat="of" target="RFC9846"/>) below:</t>
      <sourcecode type="tls-presentation"><![CDATA[
enum {
    trust_anchor_id(0),
    trust_anchor_groups(1),
    trust_anchor_negotiation(2),
    (2^16-1)
} CertificatePropertyType;

struct {
    CertificatePropertyType type;
    opaque data<0..2^16-1>;
} CertificateProperty;

CertificateProperty CertificatePropertyList<0..2^16-1>;
]]></sourcecode>
      <t>The entries in a CertificatePropertyList MUST be sorted numerically by <tt>type</tt> and MUST NOT contain values with a duplicate <tt>type</tt>. Inputs that do not satisfy these invariants are syntax errors and MUST be rejected by parsers.</t>
      <t>This document defines three properties:</t>
      <ul spacing="normal">
        <li>
          <t><tt>trust_anchor_id</tt>, defined in <xref target="trust-anchor-id-property"/></t>
        </li>
        <li>
          <t><tt>trust_anchor_groups</tt>, defined in <xref target="trust-anchor-groups-property"/></t>
        </li>
        <li>
          <t><tt>trust_anchor_negotiation</tt>, defined in <xref target="trust-anchor-negotiation-property"/></t>
        </li>
      </ul>
      <t>Future documents MAY define other properties for use with other mechanisms. Such a document MUST define the format of the <tt>data</tt> field and how authenticating parties interpret the property. Authenticating parties MUST ignore properties with unrecognized CertificatePropertyType values.</t>
      <section anchor="trust-anchor-id-property">
        <name>Trust Anchor ID Property</name>
        <t>The <tt>trust_anchor_id</tt> property's <tt>data</tt> field contains the binary representation of the trust anchor ID of the certification path's trust anchor, as described in <xref target="authenticating-party-configuration"/>. The binary representation is encoded directly into the <tt>data</tt> field with no additional length prefix.</t>
      </section>
      <section anchor="trust-anchor-groups-property">
        <name>Trust Anchor Groups Property</name>
        <t>The <tt>trust_anchor_groups</tt> property's <tt>data</tt> field contains a TrustAnchorIDPatternList structure, defined below. Its value is the certification path's trust anchor group patterns, as described in <xref target="authenticating-party-configuration"/> and <xref target="trust-anchor-id-patterns"/>.</t>
        <sourcecode type="tls-presentation"><![CDATA[
opaque TrustAnchorIDPattern<0..2^8-1>;

TrustAnchorIDPattern TrustAnchorIDPatternList<1..2^16-1>;
]]></sourcecode>
      </section>
      <section anchor="trust-anchor-negotiation-property">
        <name>Trust Anchor Negotiation Property</name>
        <t>The <tt>trust_anchor_negotiation</tt> property's <tt>data</tt> field MUST be empty.</t>
        <t>When a candidate certification path has this property, the authenticating party SHOULD NOT select it as a fallback when the path's issuer cannot be matched against the relying party. When a candidate path lacks this property, the authenticating party MAY use it as a fallback. See also <xref target="certificate-selection"/>.</t>
        <t>A path without the <tt>trust_anchor_negotiation</tt> property MAY still participate in this protocol and include the <tt>trust_anchor_id</tt> and <tt>trust_anchor_groups</tt> properties. In particular, the authenticating party MAY still choose to condition the path on trust anchor negotiation if it is combining multiple sets of candidate paths, each with their separate determinations about suitable fallbacks. <xref target="acme-example"/> gives an example scenario. This could be implemented either with separate local configuration or by modifying the CertificatePropertyList structures when combining the sets.</t>
        <t><xref target="acme-extension"/> discusses how an ACME server might set this property, as well as examples where the authenticating party might override this recommendation.</t>
      </section>
      <section anchor="pem-representation">
        <name>PEM Representation</name>
        <t>A certification path with its associated CertificatePropertyList may be represented in a PEM <xref target="RFC7468"/> structure in a file of type "application/pem-certificate-chain-with-properties". Files of this type MUST use the strict encoding and MUST NOT include explanatory text. The ABNF <xref target="RFC5234"/> for this format is as follows, where "stricttextualmsg" is as defined in <xref section="3" sectionFormat="of" target="RFC7468"/>:</t>
        <sourcecode type="abnf"><![CDATA[
certchainwithproperties = 2*stricttextualmsg
]]></sourcecode>
        <t>The first element MUST be the encoded CertificatePropertyList.
The second element MUST be an end-entity certificate. Each following element
MUST contain a certificate that directly certifies the one preceding it. The certificate representing the trust anchor MUST be omitted from the path.</t>
        <t>CertificatePropertyLists are encoded using the "CERTIFICATE PROPERTIES" label. The encoded data is a serialized CertificatePropertyList, defined in <xref target="certificate-properties"/>.</t>
        <t>Certificates are encoded as in <xref section="5.1" sectionFormat="of" target="RFC7468"/>, except DER <xref target="X690"/> MUST be used.</t>
        <t>The following is an example file with a certification path containing an end-entity certificate and an intermediate certificate. The example CertificatePropertyList encodes:</t>
        <ul spacing="normal">
          <li>
            <t>A <tt>trust_anchor_id</tt> property of <tt>32473.1</tt></t>
          </li>
          <li>
            <t>A <tt>trust_anchor_groups</tt> property with two patterns:
            </t>
            <ul spacing="normal">
              <li>
                <t><tt>2187.2.{100-200}</tt></t>
              </li>
              <li>
                <t><tt>32473.3.{42-}.{100-200}</tt></t>
              </li>
            </ul>
          </li>
          <li>
            <t>A <tt>trust_anchor_negotiation</tt> property</t>
          </li>
        </ul>
        <artwork><![CDATA[
-----BEGIN CERTIFICATE PROPERTIES-----
ACoAAAAEgf1ZAQABABoAGAmRC5ELAgJkgUgNgf1Zgf1ZAwMqgGSBSAACAAA=
-----END CERTIFICATE PROPERTIES-----
-----BEGIN CERTIFICATE-----
MIIBVzCB/6ADAgECAgkAh7Uv5X8pplkwCgYIKoZIzj0EAwIwGjEYMBYGA1UEAwwP
SW50ZXJtZWRpYXRlIENBMB4XDTI2MDUwNTIxMzg1NVoXDTI3MDUwNTIxMzg1NVow
FjEUMBIGA1UEAwwLZXhhbXBsZS5jb20wWTATBgcqhkjOPQIBBggqhkjOPQMBBwNC
AAT5mg5z0464cE7rtEpTeSPFNlRUBjxqycdb4rvNkG3Fbd1R2IRo7zYOi5SP3S7L
C4r5Hw+IiDq5X2nQT1w5ympeozIwMDAJBgNVHRMEAjAAMAsGA1UdDwQEAwIHgDAW
BgNVHREEDzANggtleGFtcGxlLmNvbTAKBggqhkjOPQQDAgNHADBEAiBRdPrVpQtJ
s+J9DFhT1Db6QmIZFfjFFKQ88B0gFezyfAIgSwIxntwrPFYagfK6vPcRpDxG2oLV
LkfnP5v1SPjOsMY=
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIBRTCB7KADAgECAgkAkaBeQj6ZErAwCgYIKoZIzj0EAwIwEjEQMA4GA1UEAwwH
Um9vdCBDQTAeFw0yNjA1MDUyMTM4MzJaFw0zMTA1MDQyMTM4MzJaMBoxGDAWBgNV
BAMMD0ludGVybWVkaWF0ZSBDQTBZMBMGByqGSM49AgEGCCqGSM49AwEHA0IABJEH
0D77iyFv01I/4sEqUaoUel50BBwsWSYrH/LtO6cdGI28NyzMyFuYrE6UCRusgAKo
XBmWjHEGJmoDPoAy2t+jIzAhMA8GA1UdEwEB/wQFMAMBAf8wDgYDVR0PAQH/BAQD
AgEGMAoGCCqGSM49BAMCA0gAMEUCIBWtPiDwXXEvbgy2+nu/w4MRBNsQ3hbVWyJT
ITN+1R6WAiEA2AfGBy3Hz8oYY5wPldIndrXjntCzzSEduB6pEvYQZWo=
-----END CERTIFICATE-----
]]></artwork>
        <t>The IANA registration for this media type is described in <xref target="media-type-updates"/>.</t>
      </section>
      <section anchor="acme-extension">
        <name>ACME Extension</name>
        <t>The format defined in <xref target="pem-representation"/> can be used with ACME's alternate format mechanism (see <xref section="7.4.2" sectionFormat="of" target="RFC8555"/>) as follows. When downloading certificates, a supporting client SHOULD include "application/pem-certificate-chain-with-properties" in its HTTP Accept header (<xref section="12.5.1" sectionFormat="of" target="RFC9110"/>). When a supporting server sees such a header, it MAY then respond with that format to include a CertificatePropertyList with the certification path. This CertificatePropertyList MAY include <tt>trust_anchor_id</tt> and <tt>trust_anchor_groups</tt> properties for use with this protocol, or other properties defined in another document.</t>
        <t>When the ACME server provides multiple paths, e.g. with ACME's alternate certificate chain mechanism (see <xref section="7.4.2" sectionFormat="of" target="RFC8555"/>), the ACME server SHOULD include the <tt>trust_anchor_negotiation</tt> property on any paths it expects to gate on trust anchor negotiation. It SHOULD omit the property on any paths which are possible fallbacks when no trust anchors match.</t>
        <t>The authenticating party MAY override this recommendation. In particular, if the authenticating party combines certification paths from two ACME orders, it might only consider some orders as a source for fallback paths.</t>
        <t>When a path is gated on trust anchor negotiation, this protocol removes the need for heuristics in determining which path to serve to which relying party.</t>
        <section anchor="acme-example">
          <name>Example</name>
          <t>There are two CA operators, CA1 and CA2. The authenticating party is configured to request certificates from ACME servers operated by each of CA1 and CA2.</t>
          <t>When the authenticating party requests certificates from CA1, it receives:</t>
          <ul spacing="normal">
            <li>
              <t>Path 1A chains to an older root CA operated by CA1. It does not set <tt>trust_anchor_negotiation</tt> because CA1 considers this to be a reasonable fallback for legacy relying parties.</t>
            </li>
            <li>
              <t>Path 1B chains to a newer root CA operated by CA1. It sets <tt>trust_anchor_negotiation</tt> because not all relying parties support it yet.</t>
            </li>
          </ul>
          <t>When the authenticating party requests certificates from CA2, it receives:</t>
          <ul spacing="normal">
            <li>
              <t>Path 2A chains to a root CA operated by CA2. It does not set <tt>trust_anchor_negotiation</tt> because CA2 considers this to be a reasonable fallback for legacy relying parties.</t>
            </li>
            <li>
              <t>Path 2B chains to a more specific intermediate CA. It sets <tt>trust_anchor_negotiation</tt> because not all relying parties preload the intermediate.</t>
            </li>
          </ul>
          <t>All paths include <tt>trust_anchor_id</tt> properties describing their corresponding issuer. The authenticating party's TLS software will consider all four in connections that use the <tt>trust_anchors</tt> extension.</t>
          <t>For other connections, the TLS software needs to determine fallback paths. Although both 1B and 2B lack the <tt>trust_anchor_negotiation</tt> property, the authenticating party knows that CA2 is more ubiquitously trusted among its supported relying parties than CA1. It configures its TLS software to use CA2 as the source of the fallback path, and so only path 2B will be used as fallback.</t>
        </section>
      </section>
      <section anchor="representing-multiple-paths">
        <name>Representing Multiple Paths</name>
        <t>While ACME represents each certification path separately, applications might combine multiple certification paths in one file as part of local configuration. For example:</t>
        <ul spacing="normal">
          <li>
            <t>An ACME client might serialize all paths returned from a single order in a file. The TLS server might then be configured to load certificates from the files from each order.</t>
          </li>
          <li>
            <t>A deployment might combine the paths from all ACME orders in a single file. The TLS server might then be configured to load its full certificate configuration from the file.</t>
          </li>
        </ul>
        <t>This section extends the PEM representation defined in <xref target="pem-representation"/> for such cases.</t>
        <t>A list of certification paths is represented in PEM by concatenating their corresponding PEM representations. Each path MUST begin with a CertificatePropertyList, which signals a new path to the decoder. If the path has no properties configured, the corresponding PEM-encoded CertificatePropertyList is as follows:</t>
        <artwork><![CDATA[
-----BEGIN CERTIFICATE PROPERTIES-----
AAA=
-----END CERTIFICATE PROPERTIES-----
]]></artwork>
        <t>Paths are ordered by the encoder's preference, with the most preferred encoded first. Depending on the application, the decoder might use this preference order, or it might override it with another ordering.</t>
        <t>This format does not directly represent private keys. However, applications MAY combine this format with private keys in one of several ways:</t>
        <ul spacing="normal">
          <li>
            <t>If the application represents paths with the same private key, it can associate all decoded paths with the corresponding private key.</t>
          </li>
          <li>
            <t>If the application represents paths with different private keys, it can first load all available private keys, then match each decoded path with the private key that matches the end-entity certificate's subjectPublicKeyInfo.</t>
          </li>
        </ul>
        <t>The following example file contains two certification paths:</t>
        <artwork><![CDATA[
-----BEGIN CERTIFICATE PROPERTIES-----
ACoAAAAEgf1ZAQABABoAGAmRC5ELAgJkgUgNgf1Zgf1ZAwMqgGSBSAACAAA=
-----END CERTIFICATE PROPERTIES-----
-----BEGIN CERTIFICATE-----
MIIBVzCB/6ADAgECAgkAh7Uv5X8pplkwCgYIKoZIzj0EAwIwGjEYMBYGA1UEAwwP
SW50ZXJtZWRpYXRlIENBMB4XDTI2MDUwNTIxMzg1NVoXDTI3MDUwNTIxMzg1NVow
FjEUMBIGA1UEAwwLZXhhbXBsZS5jb20wWTATBgcqhkjOPQIBBggqhkjOPQMBBwNC
AAT5mg5z0464cE7rtEpTeSPFNlRUBjxqycdb4rvNkG3Fbd1R2IRo7zYOi5SP3S7L
C4r5Hw+IiDq5X2nQT1w5ympeozIwMDAJBgNVHRMEAjAAMAsGA1UdDwQEAwIHgDAW
BgNVHREEDzANggtleGFtcGxlLmNvbTAKBggqhkjOPQQDAgNHADBEAiBRdPrVpQtJ
s+J9DFhT1Db6QmIZFfjFFKQ88B0gFezyfAIgSwIxntwrPFYagfK6vPcRpDxG2oLV
LkfnP5v1SPjOsMY=
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIBRTCB7KADAgECAgkAkaBeQj6ZErAwCgYIKoZIzj0EAwIwEjEQMA4GA1UEAwwH
Um9vdCBDQTAeFw0yNjA1MDUyMTM4MzJaFw0zMTA1MDQyMTM4MzJaMBoxGDAWBgNV
BAMMD0ludGVybWVkaWF0ZSBDQTBZMBMGByqGSM49AgEGCCqGSM49AwEHA0IABJEH
0D77iyFv01I/4sEqUaoUel50BBwsWSYrH/LtO6cdGI28NyzMyFuYrE6UCRusgAKo
XBmWjHEGJmoDPoAy2t+jIzAhMA8GA1UdEwEB/wQFMAMBAf8wDgYDVR0PAQH/BAQD
AgEGMAoGCCqGSM49BAMCA0gAMEUCIBWtPiDwXXEvbgy2+nu/w4MRBNsQ3hbVWyJT
ITN+1R6WAiEA2AfGBy3Hz8oYY5wPldIndrXjntCzzSEduB6pEvYQZWo=
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE PROPERTIES-----
AAA=
-----END CERTIFICATE PROPERTIES-----
-----BEGIN CERTIFICATE-----
MIIBojCCAUigAwIBAgIBAjAKBggqhkjOPQQDAjAcMRowGAYDVQQDDBFJbnRlcm1l
ZGlhdGUgQ0EgMjAeFw0yNjA5MTEyMjA3MzJaFw0yNzA5MTEyMjA3MzJaMBYxFDAS
BgNVBAMMC2V4YW1wbGUuY29tMFkwEwYHKoZIzj0CAQYIKoZIzj0DAQcDQgAErvaU
F7iXvurpBgeG5eCx8cMmcOKb11Nvlk/dCdcAelIcvAAHABGc8cVSkjGlNGQhgeCm
MBKQipIiDskIhIZoRaOBgDB+MB0GA1UdDgQWBBTw8ysZe1gMI/OX0Jx9Y/0yq4Q6
zjAfBgNVHSMEGDAWgBT9JPmvVv2aTEDF/R+XTZzy9iMRWjAPBgNVHRMBAf8EBTAD
AQH/MBYGA1UdEQQPMA2CC2V4YW1wbGUuY29tMBMGA1UdJQQMMAoGCCsGAQUFBwMB
MAoGCCqGSM49BAMCA0gAMEUCIQCAbiJcNrPnAr0N9oBJ70ikytGQxTQLEfdMF3Id
dRHp/QIgNFQIR4pV/CxvnbJnqUYySx7NgynEBj4v9fndOj8+Mvw=
-----END CERTIFICATE-----
-----BEGIN CERTIFICATE-----
MIIBhDCCASugAwIBAgIBATAKBggqhkjOPQQDAjAUMRIwEAYDVQQDDAlSb290IENB
IDIwHhcNMjYwOTExMjIwNzMyWhcNMzEwOTEwMjIwNzMyWjAcMRowGAYDVQQDDBFJ
bnRlcm1lZGlhdGUgQ0EgMjBZMBMGByqGSM49AgEGCCqGSM49AwEHA0IABAqUU6fc
WctyRGFMz3CGQwUCb5pPhi7imSamipwIrQopqOOUqTr27RLa0CSQwL/87OH/Yxc8
1jp3cC3qdEp4sAmjZjBkMB0GA1UdDgQWBBT9JPmvVv2aTEDF/R+XTZzy9iMRWjAf
BgNVHSMEGDAWgBSQ1f8odAe5s7NU91kxX2mPDd8xezASBgNVHRMBAf8ECDAGAQH/
AgEAMA4GA1UdDwEB/wQEAwIBBjAKBggqhkjOPQQDAgNHADBEAiA1VrVfvq1QtS5v
gZYh1yEIL8wV863GEE2C6/zSB7TzaAIgTUBrpMo56XIb+Wez1CPWtqYFd2a6NvJx
IKzgi/++xTs=
-----END CERTIFICATE-----
]]></artwork>
      </section>
    </section>
    <section anchor="use-cases">
      <name>Use Cases</name>
      <t><tt>trust_anchors</tt>, like <tt>certificate_authorities</tt>, implements trust anchor negotiation. That is, it allows an authenticating party to incorporate relying party trust anchors into certificate selection. <tt>trust_anchors</tt> allows a wider range of TLS applications to use trust anchor negotiation, notably those that would be unable to use <tt>certificate_authorities</tt> due to size or privacy limitations.</t>
      <t>Without trust anchor negotiation, authenticating parties are limited to CAs in the intersection of all supported relying parties. However, trust anchors can vary significantly between different relying party implementations and different versions of a single relying party implementation, particularly as PKIs evolve to meet user security needs.</t>
      <t>As security-positive PKI changes increase variance, this intersection shrinks. This leads to a conflict between user security and service availability. When the authenticating party cannot serve a certificate in the intersection, either the relying party must risk user security by not changing the PKI, or the authenticating party must degrade service availability by dropping support for some relying parties.</t>
      <t>The rest of this section discusses uses cases for trust anchor negotiation.</t>
      <section anchor="making-use-of-newly-trusted-cas">
        <name>Making Use of Newly-Trusted CAs</name>
        <t>When one relying party trusts a new CA, other relying parties, such as older ones, may not yet trust it. Trust anchor negotiation allows an authenticating party to negotiate a certificate from the newer CA with relying parties that do trust it, while continuing to negotiate another certificate with relying parties that do not. This allows PKI transitions to progress smoothly. Connections can make use of, for example, a new CA's stronger signature algorithms, stronger validation practices, better automation, or more efficient certificate sizes, without interruptions to other connections.</t>
        <t>Without negotiation, the authenticating party is limited to its relying parties' intersection and must wait for every supported relying party to be updated before the transition even begins. This wait could often take many years. In some cases, such as with IoT devices, relying parties may never receive updates.</t>
        <t>In some contexts, other fields can provide a partial signal. For example, post-quantum-capable relying parties may be detected with the <tt>signature_algorithms</tt> and <tt>signature_algorithms_cert</tt> extensions. However, this relies on all post-quantum CAs being added at roughly the same time and that they are sufficiently interchangeable to be negotiated with these extensions. Trust anchor negotiation directly addresses this problem and allows for both gradual and possibly heterogeneous deployment of post-quantum CAs across relying parties.</t>
      </section>
      <section anchor="removing-untrustworthy-cas">
        <name>Removing Untrustworthy CAs</name>
        <t>When CAs are determined to be untrustworthy, relying parties must remove them to mitigate the risk to user security. Over time, this shrinks their intersection with older relying parties. Without negotiation, the result is authenticating parties have fewer and fewer CA choices available. Even determining the intersecting CAs can be difficult. Often, the only option is to try the new certificate and monitor errors. For authenticating parties that serve many diverse relying parties, this is a disruptive and risky process.</t>
        <t>Trust anchor negotiation removes this constraint. If an authenticating party's CA is distrusted, it can use a new CA in addition to the existing one. The addition does not risk outages for older relying parties and may be chosen from a wider set of CAs, as it only needs to be compatible with the relying parties that distrusted the other CA.</t>
        <t>Over time, the authenticating party can monitor which certificates it serves, and re-evaluate which CA or CAs to use. For example, it may find the new CA was sufficient, or that older relying parties have since all been updated. However, user security depends on the relying party's trust anchors, not the authenticating party's choice of CA, so this can occur asynchronously, based on serving needs and costs, rather than delay the response to a security incident.</t>
      </section>
      <section anchor="key-rotation">
        <name>Key Rotation</name>
        <t>Despite the severity of root CA private key compromise and the benefits of routinely rotating cryptographic key material, such rotation in PKIs is often very rare. In 2023, the oldest root in <xref target="CHROME-ROOTS"/> and <xref target="MOZILLA-ROOTS"/> was 25 years old, dating to 1998.</t>
        <t>Key rotation in PKIs used in TLS is challenging, as it combines the challenges described in both <xref target="making-use-of-newly-trusted-cas"/> and <xref target="removing-untrustworthy-cas"/>. Without trust anchor negotiation, authenticating parties cannot switch to the new root as long as any supported older relying party requires the old root. That, in turn, means relying parties cannot distrust the old root, leaving them vulnerable.</t>
        <t>Trust anchor negotiation offers a smooth transition for CA key rotation. The CA can provide certification paths for the old and new roots. The authenticating party can then serve both paths without impacting older relying parties. New relying parties can then distrust the old root.</t>
      </section>
      <section anchor="other-root-transitions">
        <name>Other Root Transitions</name>
        <t>The mechanisms in this document can aid PKI transitions beyond key rotation. For example, a CA operator may generate a postquantum root CA and issue from the classical and postquantum roots concurrently. The authenticating party will then, transparently and with no configuration change, serve both. As in <xref target="key-rotation"/>, newer relying parties can then remove the classical roots, while older relying parties continue to function.</t>
        <t>This same procedure may also be used to transition between newer, more size-efficient signature algorithms, as they are developed.</t>
      </section>
      <section anchor="intermediate-elision">
        <name>Intermediate Elision</name>
        <t>In many PKIs, root CAs issue shorter-lived intermediate certificates which, in turn, issue end-entity certificates. This comes at a bandwidth cost: the TLS handshake includes an extra certificate, which includes a public key, signature, and X.509 metadata. Post-quantum signature algorithms will dramatically increase this cost. ML-DSA-65 <xref target="FIPS204"/>, for example, has a total public key and signature size of 5,261 bytes.</t>
        <t>Trust anchor negotiation can avoid this size cost. Relying parties predistribute intermediate CAs and configure them as short-lived trust anchors. Authenticating parties can then send shorter paths to those relying parties.</t>
        <t>More generally, a CA operator provides authenticating parties with two certification paths: a longer path ending at a long-lived root and shorter path the other ending at a short-lived root. Relying parties trust both the long-lived root and the most recent short-lived root. The authenticating party sends the shorter path when possible, falling back to the longer path when the relying party’s short-lived root is stale.</t>
      </section>
      <section anchor="conflicting-relying-party-requirements">
        <name>Conflicting Relying Party Requirements</name>
        <t>An authenticating party may need to support relying parties with different, potentially conflicting requirements. For example, in contexts where online revocation checks are expensive, unreliable, or privacy-sensitive, user security is best served by short-lived certificates. In other contexts, long-lived certificates may be more appropriate for, e.g., systems that are offline for long periods of time or have unreliable clocks.</t>
        <t>Trust anchor negotiation allows these conflicts to be resolved by different trust anchors where necessary. This avoids the need to compromise on user security or service availability.</t>
      </section>
      <section anchor="backup-certificates">
        <name>Backup Certificates</name>
        <t>An authenticating party may obtain certification paths from multiple CAs for redundancy. If one CA is compromised and removed from newer relying parties, the TLS server software will be able to gracefully serve a backup certification path, avoiding the immediate breakage that would otherwise be caused by this removal.</t>
      </section>
      <section anchor="public-key-pinning">
        <name>Public Key Pinning</name>
        <t>To reduce security risk from misissued certificates, relying parties sometimes employ public key pinning <xref target="RFC7469"/>. Pinning effectively reduces a relying party's trust anchor list to a subset of the original set.</t>
        <t>As other relying parties in the PKI evolve, the pinning relying party limits the authenticating party to satisfy both the pinning constraint and newer constraints in the PKI. This can lead to conflicts if, for example, the pinned CA is distrusted by a newer relying party. The authenticating party is then forced to either break the pinning relying party, or break the newer ones.</t>
        <t>Trust anchor negotiation reduces this conflict, provided the pinning relying party negotiates with its reduced trust anchor list. The authenticating party can then use a certificate from the pinned CA with the pinning relying party, and another CA with other relying parties.</t>
      </section>
    </section>
    <section anchor="privacy-considerations">
      <name>Privacy Considerations</name>
      <section anchor="relying-parties">
        <name>Relying Parties</name>
        <t>The <tt>trust_anchors</tt> extension is analogous to the <tt>certificate_authorities</tt> extension (<xref section="4.3.4" sectionFormat="of" target="RFC9846"/>), but more size-efficient. Like <tt>certificate_authorities</tt>, <tt>trust_anchors</tt> reveals some information about the relying party's trust anchors. However, unlike <tt>certificate_authorities</tt>, <tt>trust_anchors</tt> allows a relying party to only reveal a trust anchor in response to the authenticating party's list, which reduces the fingerprinting exposure. This section provides guidance for a relying party to configure this mechanism, based on its privacy goals.</t>
        <t>When using this extension, a relying party's trust anchors may be divided into three categories:</t>
        <ol spacing="normal" type="1"><li>
            <t>Trust anchors whose IDs the relying party never sends, but still trusts. These are trust anchors that do not participate in this mechanism.</t>
          </li>
          <li>
            <t>Trust anchors whose IDs the relying party sends <em>conditionally</em>, i.e. only if the server offers them. For example, the relying party may indicate support for a trust anchor if its ID is listed in the server's HTTPS/SVCB record or trust anchor list in EncryptedExtensions.</t>
          </li>
          <li>
            <t>Trust anchors whose IDs the relying party sends <em>unconditionally</em>, i.e. independently of the authenticating party's behavior.</t>
          </li>
        </ol>
        <t>Each of these categories carries a different fingerprinting exposure:</t>
        <t>Trust anchors that do not participate are not revealed by this extension. However, they have some fingerprinting exposure due to being trusted. Given a certification path, an authenticating party can probe whether the relying party trusts the trust anchor by seeing if the relying party accepts it.</t>
        <t>Trust anchor IDs sent in response to the authenticating party can only be observed actively. That is, the authenticating party could vary its list and observe how the client responds, in order to probe for the client's trust anchor list. This is similar to the exposure of trust anchors not participating in this extension, except that the trust anchor can be probed by only knowing the trust anchor ID.</t>
        <t>Trust anchor IDs sent unconditionally can be observed passively. This mode is analogous to the <tt>certificate_authorities</tt> extension. Relying parties SHOULD NOT unconditionally advertise trust anchor lists that are unique to an individual user. Rather, unconditionally-advertised lists SHOULD be empty or computed only from the trust anchors common to the relying party's anonymity set (<xref section="3.3" sectionFormat="of" target="RFC6973"/>).</t>
        <t>Relying parties SHOULD determine which trust anchors participate in this mechanism, and whether to advertise them unconditionally or conditionally, based on their privacy goals.</t>
        <t>Additionally, a relying party that computes the <tt>trust_anchors</tt> extension based on prior state may allow observers to correlate across connections. Relying parties SHOULD NOT maintain such state across connections that are intended to be uncorrelated.</t>
      </section>
      <section anchor="authenticating-parties">
        <name>Authenticating Parties</name>
        <t>If the authenticating party is a server, the <tt>trust_anchors</tt> extension in EncryptedExtensions enumerates the trust anchors for the server's available certification paths. (See <xref target="recovery"/>.) This assumes these trust anchors are not sensitive. Servers SHOULD NOT use this mechanism to negotiate certification paths with sensitive trust anchors.</t>
        <t>In servers that host multiple services, this protocol only enumerates certification paths for the requested service. If, for example, a server uses the <tt>server_name</tt> extension to select services, this list is expected to be filtered by <tt>server_name</tt>. This ensures that co-located services are not revealed.</t>
        <t>The above does not apply if the authenticating party is a client. This protocol does not enumerate the available certification paths for a client.</t>
      </section>
    </section>
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <section anchor="incorrect-selection-metadata">
        <name>Incorrect Selection Metadata</name>
        <t>If the authenticating party has provisioned certification paths with incorrect trust anchor IDs, it may negotiate inaccurately and send an untrusted path to the relying party when another candidate would have been trusted. This will not result in the untrusted path becoming trusted, but the connection will fail.</t>
      </section>
      <section anchor="trust-anchor-negotiation">
        <name>Trust Anchor Negotiation</name>
        <t>Both the <tt>trust_anchors</tt> and <tt>certificate_authorities</tt> (<xref section="4.3.4" sectionFormat="of" target="RFC9846"/>) extensions implement trust anchor negotiation, so security considerations are largely unchanged from <tt>certificate_authorities</tt>. This section discusses security considerations for trust anchor negotiation in general.</t>
        <section anchor="relying-party-policies">
          <name>Relying Party Policies</name>
          <t>PKI-based TLS authentication depends on the relying party's certificate policies. If the relying party trusts an untrustworthy CA, that CA can intercept TLS connections made by that relying party by issuing certificates associating the target name with the wrong TLS key.</t>
          <t>This attack vector is available with or without trust anchor negotiation. The negotiation mechanism described in this document allows certificate selection to reflect a relying party's certificate policies. It does not determine the certificate policies themselves. Relying parties remain responsible for trusting only trustworthy CAs, and untrustworthy CAs remain a security risk when trusted.</t>
        </section>
        <section anchor="agility">
          <name>Agility</name>
          <t>As with other TLS parameters, negotiation reduces a conflict between availability and security, which allows PKIs to better mitigate security risks to users. When relying parties in an existing TLS ecosystem improve their certificate policies, trust anchor negotiation helps authenticating parties navigate differences between those relying parties and existing relying parties. Each set of requirements may be satisfied without compatibility risk to the other. <xref target="use-cases"/> discusses such scenarios in more detail.</t>
          <t>Negotiation also reduces pressures on relying parties to sacrifice user security for compatibility. If a relying party does not trust an authenticating party's current CA, connections between the two will fail until either the relying party trusts the CA or the authenticating party uses an already trusted CA. Without trust anchor negotiation, the authenticating party is limited to one certificate, and therefore switching CAs risks compatibility problems with other relying parties. The relying party then faces compatibility pressure to add this CA, even if it deems the CA a security risk. With trust anchor negotiation, the authenticating party can use its existing CA <em>in addition to</em> another CA trusted by the relying party. This allows the ecosystem to improve interoperability without sacrificing user security.</t>
        </section>
        <section anchor="serving-multiple-certificates">
          <name>Serving Multiple Certificates</name>
          <t>Trust anchor negotiation reduces compatibility pressures against authenticating parties serving certificates from a less common CA, as they can be served with other certificates. In some cases, the CA may have been distrusted, but still used to support older relying parties. As discussed in <xref target="use-cases"/> and <xref target="agility"/>, this capability aids PKI transitions that mitigate security risks to users.</t>
          <t>Even if the CA is untrustworthy, these certificates do not enable the CA to decrypt or intercept the connection. If a certificate asserts the correct information about the authenticating party, notably the correct public key, the authenticating party can safely present it. Issuing a certificate for the authenticating party's public key does not grant the CA access to the corresponding private key. Conversely, if the attacker already has access to the authenticating party's private key, they do not need to be in control of a CA to intercept a connection.</t>
          <t>Rather, it is the relying party's choice of trusted CAs that determines susceptibility to interception. If the relying party trusts a misbehaving or attacker-controlled CA, the attacker can intercept the connection with a public key certified by that CA, regardless of which CA is used by the intended authenticating party. Conversely, if the relying party does not trust the attacker's CA, the attacker cannot successfully intercept the connection using a public key certified by this CA.</t>
          <t>Choosing trusted CAs is a complex, security-critical process, the full considerations of which are outside the scope of this document. Relying parties thus SHOULD NOT interpret the authenticating party's choice of CA as an endorsement of the CA. Trusting a CA means trusting <em>all</em> certificates issued by that CA, so it is not enough to observe correct certificates from an authenticating party. An untrustworthy CA may sign one correct certificate, but also sign incorrect certificates, possibly in the future, that can attack the relying party.</t>
        </section>
        <section anchor="targeting-tls-interception">
          <name>Targeting TLS Interception</name>
          <t>A network attacker in possession of a misissued certificate could use trust anchor negotiation to differentiate clients and only enable TLS interception with clients that accept the certificate. The network attacker may wish to do this to reduce the odds of detection.</t>
          <t>However, trust anchor negotiation only impacts detection where this differentiation was not already possible. In TLS, the client offers all its available TLS features, including cipher suites and other extensions, in the TLS ClientHello. Any variation in client TLS policies, related or unrelated to trust anchors, may be used as a fingerprint. Transport properties, such as IP geolocation, may also be used. While fingerprinting's heuristic nature makes broad, legitimate use difficult, a network attacker's single interception service can easily use it for targeted attacks.</t>
          <t>If the attacker targets any clients that enforce Certificate Transparency <xref target="RFC6962"/>, the misissued certificates will need to be publicly logged. In this case, detection is more robust, and client differentiation, with or without trust anchor negotiation, has no significant impact.</t>
        </section>
      </section>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <section anchor="tls-extensiontype-updates">
        <name>TLS ExtensionType Updates</name>
        <t>IANA is requested to create the following entry in the TLS ExtensionType Values registry, originally created in <xref target="RFC4366"/>:</t>
        <table>
          <thead>
            <tr>
              <th align="left">Value</th>
              <th align="left">Extension Name</th>
              <th align="left">TLS 1.3</th>
              <th align="left">DTLS-Only</th>
              <th align="left">Recommended</th>
              <th align="left">Reference</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td align="left">TBD</td>
              <td align="left">trust_anchors</td>
              <td align="left">CH, EE, CR, CT</td>
              <td align="left">N</td>
              <td align="left">Y</td>
              <td align="left">[this-RFC]</td>
            </tr>
          </tbody>
        </table>
      </section>
      <section anchor="media-type-updates">
        <name>Media Type Updates</name>
        <t>IANA is requested to create the following entry in the "Media Types" registry, defined in <xref target="RFC6838"/>:</t>
        <dl>
          <dt>Type name:</dt>
          <dd>
            <t>application</t>
          </dd>
          <dt>Subtype name:</dt>
          <dd>
            <t>pem-certificate-chain-with-properties</t>
          </dd>
          <dt>Required parameters:</dt>
          <dd>
            <t>None</t>
          </dd>
          <dt>Optional parameters:</dt>
          <dd>
            <t>None</t>
          </dd>
          <dt>Encoding considerations:</dt>
          <dd>
            <t>7bit</t>
          </dd>
          <dt>Security considerations:</dt>
          <dd>
            <t>Carries a cryptographic certificate and its associated certificate chain and additional properties. This media type carries no active content.</t>
          </dd>
          <dt>Interoperability considerations:</dt>
          <dd>
            <t>None</t>
          </dd>
          <dt>Published specification:</dt>
          <dd>
            <t>[this-RFC, <xref target="pem-representation"/>]</t>
          </dd>
          <dt>Applications that use this media type:</dt>
          <dd>
            <t>ACME clients and servers, HTTP servers, other applications that need to be configured with a certificate chain</t>
          </dd>
          <dt>Additional information:</dt>
          <dd>
            <dl spacing="compact">
              <dt>Deprecated alias names for this type:</dt>
              <dd>n/a</dd>
              <dt>Magic number(s):</dt>
              <dd>n/a</dd>
              <dt>File extension(s):</dt>
              <dd>.pem</dd>
              <dt>Macintosh file type code(s):</dt>
              <dd>n/a</dd>
            </dl>
          </dd>
          <dt>Person &amp; email address to contact for further information:</dt>
          <dd>
            <t>See Authors' Addresses section.</t>
          </dd>
          <dt>Intended usage:</dt>
          <dd>
            <t>COMMON</t>
          </dd>
          <dt>Restrictions on usage:</dt>
          <dd>
            <t>n/a</t>
          </dd>
          <dt>Author:</dt>
          <dd>
            <t>See Authors' Addresses section.</t>
          </dd>
          <dt>Change controller:</dt>
          <dd>
            <t>IETF</t>
          </dd>
        </dl>
      </section>
      <section anchor="certificatepropertytype-registry">
        <name>CertificatePropertyType Registry</name>
        <t>IANA is requested to create the "CertificatePropertyType" registry within the "Transport Layer Security (TLS) Extensions" group. The initial entries in the registry are as follows:</t>
        <table>
          <thead>
            <tr>
              <th align="left">Decimal</th>
              <th align="left">Description</th>
              <th align="left">References</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td align="left">0</td>
              <td align="left">trust_anchor_id</td>
              <td align="left">[this-RFC]</td>
            </tr>
            <tr>
              <td align="left">1</td>
              <td align="left">trust_anchor_groups</td>
              <td align="left">[this-RFC]</td>
            </tr>
            <tr>
              <td align="left">2</td>
              <td align="left">trust_anchor_negotiation</td>
              <td align="left">[this-RFC]</td>
            </tr>
          </tbody>
        </table>
        <t>New values are allocated according to the following process:</t>
        <ul spacing="normal">
          <li>
            <t>Values in the range 0-65279 are assigned via Specification Required <xref target="RFC8126"/>.</t>
          </li>
          <li>
            <t>Values in the range 65280-65535 are reserved for Private Use <xref target="RFC8126"/>.</t>
          </li>
        </ul>
      </section>
    </section>
  </middle>
  <back>
    <references anchor="sec-combined-references">
      <name>References</name>
      <references anchor="sec-normative-references">
        <name>Normative References</name>
        <reference anchor="X680" target="https://www.itu.int/rec/T-REC-X.680">
          <front>
            <title>Information technology - Abstract Syntax Notation One (ASN.1): Specification of basic notation</title>
            <author>
              <organization>ITU-T</organization>
            </author>
            <date year="2021"/>
          </front>
          <seriesInfo name="ISO/IEC" value="8824-1:2021"/>
        </reference>
        <reference anchor="X690" target="https://www.itu.int/rec/T-REC-X.690">
          <front>
            <title>Information technology - ASN.1 encoding rules: Specification of Basic Encoding Rules (BER), Canonical Encoding Rules (CER) and Distinguished Encoding Rules (DER)</title>
            <author>
              <organization>ITU-T</organization>
            </author>
            <date year="2021"/>
          </front>
          <seriesInfo name="ISO/IEC" value="8825-1:2021"/>
        </reference>
        <reference anchor="RFC9846">
          <front>
            <title>The Transport Layer Security (TLS) Protocol Version 1.3</title>
            <author fullname="E. Rescorla" initials="E." surname="Rescorla"/>
            <date month="July" year="2026"/>
            <abstract>
              <t>This document specifies version 1.3 of the Transport Layer Security (TLS) protocol. TLS allows client/server applications to communicate over the Internet in a way that is designed to prevent eavesdropping, tampering, and message forgery.</t>
              <t>This document obsoletes RFC 8446, which specified TLS 1.3. This document obsoletes RFC 5246 (specifying TLS 1.2) and RFCs 5077, 6961, 7627, and 8422, all of which pertain to TLS 1.2 or earlier, and updates RFCs 5705 and 6066. This document also specifies new requirements for TLS 1.2 implementations.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9846"/>
          <seriesInfo name="DOI" value="10.17487/RFC9846"/>
        </reference>
        <reference anchor="RFC5280">
          <front>
            <title>Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile</title>
            <author fullname="D. Cooper" initials="D." surname="Cooper"/>
            <author fullname="S. Santesson" initials="S." surname="Santesson"/>
            <author fullname="S. Farrell" initials="S." surname="Farrell"/>
            <author fullname="S. Boeyen" initials="S." surname="Boeyen"/>
            <author fullname="R. Housley" initials="R." surname="Housley"/>
            <author fullname="W. Polk" initials="W." surname="Polk"/>
            <date month="May" year="2008"/>
            <abstract>
              <t>This memo profiles the X.509 v3 certificate and X.509 v2 certificate revocation list (CRL) for use in the Internet. An overview of this approach and model is provided as an introduction. The X.509 v3 certificate format is described in detail, with additional information regarding the format and semantics of Internet name forms. Standard certificate extensions are described and two Internet-specific extensions are defined. A set of required certificate extensions is specified. The X.509 v2 CRL format is described in detail along with standard and Internet-specific extensions. An algorithm for X.509 certification path validation is described. An ASN.1 module and examples are provided in the appendices. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5280"/>
          <seriesInfo name="DOI" value="10.17487/RFC5280"/>
        </reference>
        <reference anchor="RFC2119">
          <front>
            <title>Key words for use in RFCs to Indicate Requirement Levels</title>
            <author fullname="S. Bradner" initials="S." surname="Bradner"/>
            <date month="March" year="1997"/>
            <abstract>
              <t>In many standards track documents several words are used to signify the requirements in the specification. These words are often capitalized. This document defines these words as they should be interpreted in IETF documents. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="2119"/>
          <seriesInfo name="DOI" value="10.17487/RFC2119"/>
        </reference>
        <reference anchor="RFC8174">
          <front>
            <title>Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words</title>
            <author fullname="B. Leiba" initials="B." surname="Leiba"/>
            <date month="May" year="2017"/>
            <abstract>
              <t>RFC 2119 specifies common key words that may be used in protocol specifications. This document aims to reduce the ambiguity by clarifying that only UPPERCASE usage of the key words have the defined special meanings.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="8174"/>
          <seriesInfo name="DOI" value="10.17487/RFC8174"/>
        </reference>
        <reference anchor="RFC9371">
          <front>
            <title>Registration Procedures for Private Enterprise Numbers (PENs)</title>
            <author fullname="A. Baber" initials="A." surname="Baber"/>
            <author fullname="P. Hoffman" initials="P." surname="Hoffman"/>
            <date month="March" year="2023"/>
            <abstract>
              <t>This document describes how Private Enterprise Numbers (PENs) are registered by IANA. It shows how to request a new PEN and how to modify a current PEN. It also gives a brief overview of PEN uses.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9371"/>
          <seriesInfo name="DOI" value="10.17487/RFC9371"/>
        </reference>
        <reference anchor="RFC8555">
          <front>
            <title>Automatic Certificate Management Environment (ACME)</title>
            <author fullname="R. Barnes" initials="R." surname="Barnes"/>
            <author fullname="J. Hoffman-Andrews" initials="J." surname="Hoffman-Andrews"/>
            <author fullname="D. McCarney" initials="D." surname="McCarney"/>
            <author fullname="J. Kasten" initials="J." surname="Kasten"/>
            <date month="March" year="2019"/>
            <abstract>
              <t>Public Key Infrastructure using X.509 (PKIX) certificates are used for a number of purposes, the most significant of which is the authentication of domain names. Thus, certification authorities (CAs) in the Web PKI are trusted to verify that an applicant for a certificate legitimately represents the domain name(s) in the certificate. As of this writing, this verification is done through a collection of ad hoc mechanisms. This document describes a protocol that a CA and an applicant can use to automate the process of verification and certificate issuance. The protocol also provides facilities for other certificate management functions, such as certificate revocation.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8555"/>
          <seriesInfo name="DOI" value="10.17487/RFC8555"/>
        </reference>
        <reference anchor="RFC4158">
          <front>
            <title>Internet X.509 Public Key Infrastructure: Certification Path Building</title>
            <author fullname="M. Cooper" initials="M." surname="Cooper"/>
            <author fullname="Y. Dzambasow" initials="Y." surname="Dzambasow"/>
            <author fullname="P. Hesse" initials="P." surname="Hesse"/>
            <author fullname="S. Joseph" initials="S." surname="Joseph"/>
            <author fullname="R. Nicholas" initials="R." surname="Nicholas"/>
            <date month="September" year="2005"/>
            <abstract>
              <t>This document provides guidance and recommendations to developers building X.509 public-key certification paths within their applications. By following the guidance and recommendations defined in this document, an application developer is more likely to develop a robust X.509 certificate-enabled application that can build valid certification paths across a wide range of PKI environments. This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4158"/>
          <seriesInfo name="DOI" value="10.17487/RFC4158"/>
        </reference>
        <reference anchor="RFC7468">
          <front>
            <title>Textual Encodings of PKIX, PKCS, and CMS Structures</title>
            <author fullname="S. Josefsson" initials="S." surname="Josefsson"/>
            <author fullname="S. Leonard" initials="S." surname="Leonard"/>
            <date month="April" year="2015"/>
            <abstract>
              <t>This document describes and discusses the textual encodings of the Public-Key Infrastructure X.509 (PKIX), Public-Key Cryptography Standards (PKCS), and Cryptographic Message Syntax (CMS). The textual encodings are well-known, are implemented by several applications and libraries, and are widely deployed. This document articulates the de facto rules by which existing implementations operate and defines them so that future implementations can interoperate.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7468"/>
          <seriesInfo name="DOI" value="10.17487/RFC7468"/>
        </reference>
        <reference anchor="RFC5234">
          <front>
            <title>Augmented BNF for Syntax Specifications: ABNF</title>
            <author fullname="D. Crocker" initials="D." role="editor" surname="Crocker"/>
            <author fullname="P. Overell" initials="P." surname="Overell"/>
            <date month="January" year="2008"/>
            <abstract>
              <t>Internet technical specifications often need to define a formal syntax. Over the years, a modified version of Backus-Naur Form (BNF), called Augmented BNF (ABNF), has been popular among many Internet specifications. The current specification documents ABNF. It balances compactness and simplicity with reasonable representational power. The differences between standard BNF and ABNF involve naming rules, repetition, alternatives, order-independence, and value ranges. This specification also supplies additional rule definitions and encoding for a core lexical analyzer of the type common to several Internet specifications. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="STD" value="68"/>
          <seriesInfo name="RFC" value="5234"/>
          <seriesInfo name="DOI" value="10.17487/RFC5234"/>
        </reference>
        <reference anchor="RFC9110">
          <front>
            <title>HTTP Semantics</title>
            <author fullname="R. Fielding" initials="R." role="editor" surname="Fielding"/>
            <author fullname="M. Nottingham" initials="M." role="editor" surname="Nottingham"/>
            <author fullname="J. Reschke" initials="J." role="editor" surname="Reschke"/>
            <date month="June" year="2022"/>
            <abstract>
              <t>The Hypertext Transfer Protocol (HTTP) is a stateless application-level protocol for distributed, collaborative, hypertext information systems. This document describes the overall architecture of HTTP, establishes common terminology, and defines aspects of the protocol that are shared by all versions. In this definition are core protocol elements, extensibility mechanisms, and the "http" and "https" Uniform Resource Identifier (URI) schemes.</t>
              <t>This document updates RFC 3864 and obsoletes RFCs 2818, 7231, 7232, 7233, 7235, 7538, 7615, 7694, and portions of 7230.</t>
            </abstract>
          </front>
          <seriesInfo name="STD" value="97"/>
          <seriesInfo name="RFC" value="9110"/>
          <seriesInfo name="DOI" value="10.17487/RFC9110"/>
        </reference>
        <reference anchor="RFC6973">
          <front>
            <title>Privacy Considerations for Internet Protocols</title>
            <author fullname="A. Cooper" initials="A." surname="Cooper"/>
            <author fullname="H. Tschofenig" initials="H." surname="Tschofenig"/>
            <author fullname="B. Aboba" initials="B." surname="Aboba"/>
            <author fullname="J. Peterson" initials="J." surname="Peterson"/>
            <author fullname="J. Morris" initials="J." surname="Morris"/>
            <author fullname="M. Hansen" initials="M." surname="Hansen"/>
            <author fullname="R. Smith" initials="R." surname="Smith"/>
            <date month="July" year="2013"/>
            <abstract>
              <t>This document offers guidance for developing privacy considerations for inclusion in protocol specifications. It aims to make designers, implementers, and users of Internet protocols aware of privacy-related design choices. It suggests that whether any individual RFC warrants a specific privacy considerations section will depend on the document's content.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6973"/>
          <seriesInfo name="DOI" value="10.17487/RFC6973"/>
        </reference>
        <reference anchor="RFC6838">
          <front>
            <title>Media Type Specifications and Registration Procedures</title>
            <author fullname="N. Freed" initials="N." surname="Freed"/>
            <author fullname="J. Klensin" initials="J." surname="Klensin"/>
            <author fullname="T. Hansen" initials="T." surname="Hansen"/>
            <date month="January" year="2013"/>
            <abstract>
              <t>This document defines procedures for the specification and registration of media types for use in HTTP, MIME, and other Internet protocols. This memo documents an Internet Best Current Practice.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="13"/>
          <seriesInfo name="RFC" value="6838"/>
          <seriesInfo name="DOI" value="10.17487/RFC6838"/>
        </reference>
        <reference anchor="RFC8126">
          <front>
            <title>Guidelines for Writing an IANA Considerations Section in RFCs</title>
            <author fullname="M. Cotton" initials="M." surname="Cotton"/>
            <author fullname="B. Leiba" initials="B." surname="Leiba"/>
            <author fullname="T. Narten" initials="T." surname="Narten"/>
            <date month="June" year="2017"/>
            <abstract>
              <t>Many protocols make use of points of extensibility that use constants to identify various protocol parameters. To ensure that the values in these fields do not have conflicting uses and to promote interoperability, their allocations are often coordinated by a central record keeper. For IETF protocols, that role is filled by the Internet Assigned Numbers Authority (IANA).</t>
              <t>To make assignments in a given registry prudently, guidance describing the conditions under which new values should be assigned, as well as when and how modifications to existing values can be made, is needed. This document defines a framework for the documentation of these guidelines by specification authors, in order to assure that the provided guidance for the IANA Considerations is clear and addresses the various issues that are likely in the operation of a registry.</t>
              <t>This is the third edition of this document; it obsoletes RFC 5226.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="26"/>
          <seriesInfo name="RFC" value="8126"/>
          <seriesInfo name="DOI" value="10.17487/RFC8126"/>
        </reference>
      </references>
      <references anchor="sec-informative-references">
        <name>Informative References</name>
        <reference anchor="CHROME-ROOTS" target="https://chromium.googlesource.com/chromium/src/+/main/net/data/ssl/chrome_root_store">
          <front>
            <title>Chrome Root Store</title>
            <author>
              <organization>Chromium</organization>
            </author>
            <date year="2023" month="August" day="30"/>
          </front>
        </reference>
        <reference anchor="MOZILLA-ROOTS" target="https://wiki.mozilla.org/CA/Included_Certificates">
          <front>
            <title>Mozilla Included CA Certificate List</title>
            <author>
              <organization>Mozilla</organization>
            </author>
            <date year="2023" month="August" day="30"/>
          </front>
        </reference>
        <reference anchor="FIPS204" target="https://csrc.nist.gov/projects/post-quantum-cryptography">
          <front>
            <title>Module-Lattice-based Digital Signature Standard</title>
            <author>
              <organization>National Institute of Standards and Technology (NIST)</organization>
            </author>
            <date year="2023" month="August"/>
          </front>
          <seriesInfo name="FIPS PUB" value="204"/>
        </reference>
        <reference anchor="SCTNotAfter" target="https://dadrian.io/blog/posts/sct-not-after/">
          <front>
            <title>How to distrust a CA without any certificate errors</title>
            <author initials="D." surname="Adrian" fullname="David Adrian">
              <organization/>
            </author>
            <date year="2025" month="March"/>
          </front>
        </reference>
        <reference anchor="I-D.ietf-plants-merkle-tree-certs">
          <front>
            <title>Merkle Tree Certificates</title>
            <author fullname="David Benjamin" initials="D." surname="Benjamin">
              <organization>Google LLC</organization>
            </author>
            <author fullname="Devon O'Brien" initials="D." surname="O'Brien">
              <organization>Apple Inc.</organization>
            </author>
            <author fullname="Bas Westerbaan" initials="B." surname="Westerbaan">
              <organization>Cloudflare</organization>
            </author>
            <author fullname="Luke Valenta" initials="L." surname="Valenta">
              <organization>Cloudflare</organization>
            </author>
            <author fullname="Filippo Valsorda" initials="F." surname="Valsorda">
              <organization>Geomys</organization>
            </author>
            <date day="6" month="July" year="2026"/>
            <abstract>
              <t>   This document describes Merkle Tree certificates, a new form of X.509
   certificates which integrate public logging of the certificate, in
   the style of Certificate Transparency.  The integrated design reduces
   logging overhead in the face of both shorter-lived certificates and
   large post-quantum signature algorithms, while still achieving
   comparable security properties to existing X.509 constructions and
   Certificate Transparency.  Merkle Tree certificates additionally
   admit an optional size optimization that avoids signatures
   altogether, at the cost of only applying to up-to-date relying
   parties and older certificates.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-plants-merkle-tree-certs-05"/>
        </reference>
        <reference anchor="RFC7469">
          <front>
            <title>Public Key Pinning Extension for HTTP</title>
            <author fullname="C. Evans" initials="C." surname="Evans"/>
            <author fullname="C. Palmer" initials="C." surname="Palmer"/>
            <author fullname="R. Sleevi" initials="R." surname="Sleevi"/>
            <date month="April" year="2015"/>
            <abstract>
              <t>This document defines a new HTTP header that allows web host operators to instruct user agents to remember ("pin") the hosts' cryptographic identities over a period of time. During that time, user agents (UAs) will require that the host presents a certificate chain including at least one Subject Public Key Info structure whose fingerprint matches one of the pinned fingerprints for that host. By effectively reducing the number of trusted authorities who can authenticate the domain during the lifetime of the pin, pinning may reduce the incidence of man-in-the-middle attacks due to compromised Certification Authorities.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7469"/>
          <seriesInfo name="DOI" value="10.17487/RFC7469"/>
        </reference>
        <reference anchor="RFC6962">
          <front>
            <title>Certificate Transparency</title>
            <author fullname="B. Laurie" initials="B." surname="Laurie"/>
            <author fullname="A. Langley" initials="A." surname="Langley"/>
            <author fullname="E. Kasper" initials="E." surname="Kasper"/>
            <date month="June" year="2013"/>
            <abstract>
              <t>This document describes an experimental protocol for publicly logging the existence of Transport Layer Security (TLS) certificates as they are issued or observed, in a manner that allows anyone to audit certificate authority (CA) activity and notice the issuance of suspect certificates as well as to audit the certificate logs themselves. The intent is that eventually clients would refuse to honor certificates that do not appear in a log, effectively forcing CAs to add all issued certificates to the logs.</t>
              <t>Logs are network services that implement the protocol operations for submissions and queries that are defined in this document.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6962"/>
          <seriesInfo name="DOI" value="10.17487/RFC6962"/>
        </reference>
        <reference anchor="RFC4366">
          <front>
            <title>Transport Layer Security (TLS) Extensions</title>
            <author fullname="S. Blake-Wilson" initials="S." surname="Blake-Wilson"/>
            <author fullname="M. Nystrom" initials="M." surname="Nystrom"/>
            <author fullname="D. Hopwood" initials="D." surname="Hopwood"/>
            <author fullname="J. Mikkelsen" initials="J." surname="Mikkelsen"/>
            <author fullname="T. Wright" initials="T." surname="Wright"/>
            <date month="April" year="2006"/>
            <abstract>
              <t>This document describes extensions that may be used to add functionality to Transport Layer Security (TLS). It provides both generic extension mechanisms for the TLS handshake client and server hellos, and specific extensions using these generic mechanisms.</t>
              <t>The extensions may be used by TLS clients and servers. The extensions are backwards compatible: communication is possible between TLS clients that support the extensions and TLS servers that do not support the extensions, and vice versa. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4366"/>
          <seriesInfo name="DOI" value="10.17487/RFC4366"/>
        </reference>
      </references>
    </references>
    <?line 883?>

<section anchor="trust-anchor-id-pattern-test-vectors">
      <name>Trust Anchor ID Pattern Test Vectors</name>
      <t>This section contains test vectors for trust anchor ID patterns (<xref target="trust-anchor-id-patterns"/>). Patterns and IDs are provided in their byte representations in hexadecimal.</t>
      <t>The following IDs are contained in the pattern <tt>81fd5981fd597b8348861580</tt> (32473.{123-456}.{789-}):</t>
      <ul spacing="normal">
        <li>
          <t><tt>81fd597b8615</tt> (32473.123.789)</t>
        </li>
        <li>
          <t><tt>81fd59822c8704</tt> (32473.300.900)</t>
        </li>
        <li>
          <t><tt>81fd598348868d1f</tt> (32473.456.99999)</t>
        </li>
        <li>
          <t><tt>81fd59834881ffffffffffffffff7f</tt> (32473.456.(2<sup>64</sup>-1))</t>
        </li>
        <li>
          <t><tt>81fd59834882808080808080808000</tt> (32473.456.(2<sup>64</sup>))</t>
        </li>
      </ul>
      <t>The following IDs are not contained the pattern <tt>81fd5981fd597b8348861580</tt> (32473.{123-456}.{789-}):</t>
      <ul spacing="normal">
        <li>
          <t><tt>81fd597b</tt> (32473.123, too few components)</t>
        </li>
        <li>
          <t><tt>81fd597b861500</tt> (32473.123.789.0, too many components)</t>
        </li>
        <li>
          <t><tt>81fd5a7b8615</tt> (32474.123.789, first component out of range)</t>
        </li>
        <li>
          <t><tt>81fd5983748615</tt> (32473.500.789, second component out of range)</t>
        </li>
        <li>
          <t><tt>81fd597b853c</tt> (32473.123.700, third component out of range)</t>
        </li>
        <li>
          <t><tt>8081fd597b8615</tt> (invalid ID, not minimally encoded)</t>
        </li>
        <li>
          <t><tt>81fd597b8695</tt> (invalid ID, component was truncated)</t>
        </li>
      </ul>
      <t>The following IDs are contained in the pattern <tt>81fd5981fd598280808080808080800182808080808080808003</tt> (32473.{2<sup>64</sup>+1 - 2<sup>64</sup>+3}):</t>
      <ul spacing="normal">
        <li>
          <t><tt>81fd5982808080808080808001</tt> (32473.(2<sup>64</sup>+1))</t>
        </li>
        <li>
          <t><tt>81fd5982808080808080808002</tt> (32473.(2<sup>64</sup>+2))</t>
        </li>
        <li>
          <t><tt>81fd5982808080808080808003</tt> (32473.(2<sup>64</sup>+3))</t>
        </li>
      </ul>
      <t>The following IDs are not contained the pattern <tt>81fd5981fd598280808080808080800182808080808080808003</tt> (32473.{2<sup>64</sup>+1 - 2<sup>64</sup>+3}):</t>
      <ul spacing="normal">
        <li>
          <t><tt>81fd5902</tt> (32473.2)</t>
        </li>
        <li>
          <t><tt>81fd5982808080808080808000</tt> (32473.2<sup>64</sup>)</t>
        </li>
        <li>
          <t><tt>81fd5982808080808080808004</tt> (32473.(2<sup>64</sup>+4))</t>
        </li>
      </ul>
      <t>The ID <tt>81fd59</tt> (32473) is not contained in the pattern <tt>81fd59</tt>. The pattern is invalid with an odd number of components.</t>
      <t>The ID <tt>81fd59</tt> (32473) is not contained in the pattern <tt>81fd</tt>. The pattern is invalid with a truncated <tt>min</tt> value.</t>
      <t>The ID <tt>81fd59</tt> (32473) is not contained in the pattern <tt>81fd5981ffff</tt>. The pattern is invalid with a truncated <tt>max</tt> value.</t>
      <t>The ID <tt>00</tt> (0) is not contained in the pattern <tt>8042</tt>. The pattern is invalid because <tt>min</tt> cannot be infinity.</t>
    </section>
    <section numbered="false" anchor="acknowledgements">
      <name>Acknowledgements</name>
      <t>The authors thank Nick Harper, Ilari Liusvaara, and Emily Stark for many valuable discussions and insights which led to this document. Thanks also to Aaron Gable for providing feedback on ACME extensions.</t>
    </section>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA+19aXcayZbgd35Fjt45U7YLEKDFsrtezQOEbKqMVuRtTk85
gQSlBZk4MxHCLveZvzF/b37J3C0iI3JBcr3X86ndp+vZSWYsN27cfanVapXE
T+beS2dn+ObKGUarOHHawfgmjJz+xAsSf+p7UbxTGbuJNwujzUsnTiaVSmUS
jgN3Ad9NInea1HwvmdaSeVxLcISaSyPU/ElcaxxU4tVo4cexHwbJZgmf9HvD
k0qwWoy86GVlAgO/rIzDIPaCeBW/dGAEr3L30tmruJHnwsKuvPEq8pPNTmUd
RrezKFwtcbmRG8TLMEqcN+7Gi5z0rTsvWMGQjvPwq47DK9p5ByP7wcx5hZ/g
84Xrz+E5bOkfuLd6GM3wsRuNb+DxTZIs45e7u/gWPvLvvLp6bRcf7I6icB17
u/D9Ln4385Ob1YgHXM92iyCFr80BGHFiTECv1/nruh8Wfrj7wBHUb5LFfKdS
cVcJPAHA1GAmx/EDAPZOp+50vPHtDj3iE93phCPjIWzJDfyvbgLnBz+eLb3g
6uoN/+YxmEbw8j9C+CGO5wiCij3HMc4RfHYXfmDNc+ze+ZPMT5nZXoXhbO45
b950rQkn+OXIC/4xo9/r43CRn/Psp07ke5kpvbswsH9RQ+Iv9XCEP/xjhs8K
Rv297px6t4A7X61Rf9/AGq0fMtsYeIlrzXYb8Nv/WMAvPFEQRgt4/45Q9/3h
UeMlfQB/1A3tB1N+B7aQeOObIJyHs41Tc9qjOIncceJcbYLEvXdOw4TfOgs8
50n76rTefPrSuVp6Y7jOY/4pnDojN/bHTiAv7+jp3GjmARIqHFyv13U/WdX9
INmNvPHusHbZ69be12GJ6hO6xE6r0WqqJxrZ1B+ACNz84XVtqJ7FHsA69mFT
xmv9q7Pdfq/70jk6au3Xmi9pTALIix8BCG7Z8YJxOMFbHa3mXlwAgA4BoKde
u8TXnCed3uXTqtN1gzCAd+e537vwu+MGE+fYjxN4vvLjG2+Se+0YXvtxmL74
T4bpgYapr4CHGAcvd19fng16tcuzs+EVfyxg7t5E4cJzLsMQECwJI69StKMx
vuWvFnW+knG4isZ0MfUvu3E03v0ZaWawG3jJLmzQ3QWKwS94f0QwwR+xnkDv
f6/WOKrtMVxMENR4/10ZHvcwOPvYf/OmXbCJQfjVn89dpx+M56sJHFe37XS9
KGF8AAoDZ1m4r7V/69cX/DWR9257Vw3yhzFC/EOLluXgmk/651etxv7LYqgC
zOoBrA3Aere7jMLP3jiJd5chUPgvKzdIVovaONosk3AWucubjbnlXwUDBuEE
MLL2xk0Sf+zV4NZ7iLvAVAC5r/xZ4CaryIOjBZx2o0nZkk/p2sAn/QDQPlkB
0OAKqa9iuhHD9BI+Oe1fDZ/mgVIpRtMdBINzft3ZgXsN4NhB0Fx1h0DK2tPE
i6zDfB2unSR0JgAXElhcPM01MMlwBf8INs7YOFkvisIoLoTuxJ1EvhsgYx3B
ogms8W48TmpAFGsuzrtr7GCAnN05rOJWDgrAxNyAuVqbRq7U6/VKpVarOa6Q
6EpleOPHDohPqwWIV8B2pn4A5CK58ZysBBY73n0CTBXAXoU9LgC4wFTihQMX
F/6Nr4/nPo4C/waQ3oFsA2CJvTkgCbxgQgGeLyMvxpcZAZBkwpxLz4t+ih2C
IzxNP0ESydvzEzirutPHxcbjyB/BckvfcxZwf514NR77wTiZb2ASN9C7M29c
2/hI71OgtfAnk7lXqfwNkC2JAH/HOA/ADsb49u2/XZ50XxztH37/TjOjlCoL
WcUw2Pv6QeOFuflYvjloHTXgGwCFG8fh2Ce4wMqemaMAAV+6UbL5KX5GS771
NoRajp8Aji+XczWXn4rHVdzwDYzqHJ9eERoAvIY3AG49E3wBnyNo4MIBoEcb
J0aqWgxIuD7d9lMag06oiif8LPLmG72+Z1UHpFjanQtHnuBl7LYRkdyEJlJH
CtsNAzgInNgZh1FEyGEsq+qsb3xc/nwOMivsEz/BuRSOIBgQaCmUvDJI1J0T
jZuCkcZBVGm4Img7Pl8B+QZpCf7T2rF6h3HenEluQW6mKEROjMCIPBgW0B7w
qx0Ur2DhbpzAY4ABW/YiEGgRvnz65kp8T8DM1GfiT6dehAuAY4jlHOqAc6Bn
EHz263v1fXye4q157T8Z6/7DuEqf0mtB4B8DM12EE8Zan2+knFkpWOnah3c+
DbJYzRN/Offsu4GwFpKBw4SBx5tbA4Pi8QuOgtfjLRO6FnJPEF/hjHwc0wV6
Gq5iWoAbwY0AgAJ4Z2HCWOd489hb3wDcANg4AJzMO0XBrRc12duCPQs8h3CU
gGiBtwF+sHfJO4p9hIAbeLAwvBAwQjzFw4RdZg843QvMPp97wQx/hAUHOVRA
/Jr4hF915/z3PqAF6Ju+3C2fZAV8HzYHBCHwxl4cu9GGqDgQLCTdrI9WHWLF
MN3GmXvuRN3DdJ88Db0ah3IsMeyJrwZuEe4PMHnHvUPNdOTPkZaAcj2FywoH
RaispqOTD2FA3D6uGzSg+Yo0lkrlGV+vkrsCC1shcUO+CyBHHMgDvUpwjVdL
VL3hXmXhRofGVwh30m3noIfPA9QukVLiNfPHuFk6hYJ14aAynRPOJ0g2V8Fq
iTcmN7s638XSRcCMQgBM4K0RjWNnChIlXD4W73GPTAqQIyPM8D3zYR3B9Y4W
lTkv2mLkLQDKoGc58zCYIY/GPa9hlTcbJBVVoFMJIimMidMD3CZqkpgoPyzO
i9Y+QJx3g/BfeEDz8SV9nJH3ZeXDZAAVxDu5wUydeEsEFIdQiNgR7GUZJghF
wjmapgRQsKR4Cz5qiq1uiyKRJceEryO3mrqgJBCbKwAcnT4IQnhtRl6y9vCf
4WKJ8j6im8McP71ACKvRKgJ2xPeNrgdxRvw7oFG8AZYIhMTcNaMAfmBdGl/k
oyjE+wpHDEInMpFqOb3+CW/BV89hvEJpj/RHvOfE6w2eCWDtKfwCpI+J+9y4
gCYLlF/p4BFGBhIa7yAeiZgjwkab+E57NUO4oaTNxFJpPRll5zxCdWEBLMpS
mIAvAalAIgr3pbm/z8sgmoGEACnFzKMZHTxieAxzulG4goU2Gw2QaRJcyxXK
QsgSJt5yHm4IH+FNgDiIvWhuINohkjubGk167xJXA4APQ8Q6OMGY+F2V/ptK
zr5IhoBNZWZL54n9y3HMMhUQbBLFPCJ+hHKE3DSB5jdABZvIxrP2NIN9P7N2
AeM/08IUjg8PE6RB/peVZ0pJhBJ8fuYAfNnJaknHaf0GAGnRauZxTcsFxlJY
EjIkBrx9KDGsAmH0OS4O+Io0w2Mx0ZwMTohuUGZ3dfwPjxx5Sp3wA6AC/mQF
gLTHGAPSLOBmzBDl8ihbMFTJ1jMjoRJnL20OlwQBtIcAAvkWmdrGgo16aChR
OHeVeUmhqGmKllV7CShKu3N8ewoUA5RnFveV9EoSF+hKrDIwUZl7mT25CJEY
XqO3LLZJrN1NDGGXpo+8JCKZHKjfwk3GN0Ka8bfpKiLi/SCUUPEgoU5RSJmA
hF5fMQIYhkmWvWYWWJAYpBwpCUNnFIWujUF8lHVHE02+Wrw6RE9cNLF1tc+Q
CTXceF/sDExYksgHlABqzOoS6K4x0QZQ5G94YA9ZHxIC1iCQAuNoOTwyqUxV
CQp0iHMgs3hCSHGjcISfEFHGa0r6rEW5US3thsEdXmfFRo8R01hoQQ3fY7Ux
RLvIzuD6arhT5f91Ts/o75e9i+v+Ze8Y/371uv3mjf6LeuPq9dn1G/i9In9L
v+yeDQa902P+GJ46mUeD9ocd5h47Z+fD/tlp+80OszM/rmjySSoiHJ3Hyg5c
QaQCoMIqJX+C33S658AJRH9uNZsv4FbxP46az/e/f6/g/eHJSMnkf9KZAMw8
N8JBUAwcu0u0NyFbi5EwrgMH6XA9aw9Jzx9GI3VeaaBCJBh95m4wWwE3qsod
p8WmGtcenn1qJuAFklE48wHa2b9/xyP9mzP0ooUv1it8/xK1x5y9xo/Hq5jX
FXmiYgKnaBeIyS8rL1mDJ5KSkYTg1nvzqSFmJOE4nANZJG1ILozSipFMwOYn
6tKazJxEqfTfb73InyKdAyVjhvC9NAmbvaT1TbgoV6oE4EzGmHuR6L9ljUS2
7oA0TsQw8SML7W4xhah1K/3Gj+MVrtTSZJOwdDOo9xuYRSiakQLgEiyQ8SEv
vAHaMyNd1JY50Ogo14N/gXNbhrE7BwwYGqQGl9tGANbIRumPVni5UvbHovdq
BESFKIXwQVs/IikJJ0wIMT28XETk3YzVaOmieUob8UACA8RML8NhvVlvqgvB
NrC6M7SZEcIB6GviL9C4B/qiPwO2RvQA0bQmVisT3LkTw2XQxoE9gAyOnyPL
wZkLTHJx4jL1JfkSz42ts+ZbICS7IEuZijwhXLxiCxp+FYDIY7NP754ME/jj
3I0TJZFZX7oWZyCSfnaHuOWt2cpozsnWEdzik9iC7H79AGDbsonNU+RrI5I7
fMM/RQoYqZkFOEqMx76nKHsOt1jLjEMiCKLdRrErYK4TuoIFiCKCZF7lemDM
VI/PiqV7RBAUmQbpahLfuLfKBGfNgTSMyAIJHa89EERwAoMqXLJAqsgC34zU
7oykCK4V2dvGhIP7dXTjKYO2bwF9i8WIz5RJ1wgn3AYzw3rOegnat2GB0xVy
KVRJ557YkjPbL7dWicmNpBqeA3eKCELWFwtb6RymhQJ8RqgMJvCtYdgKlFaP
ARZJBKpdEiuew0yV+U5qwVZEhgkkycFkdwxY6iVXkTufIWm+WZR5M0xnBcDO
A5awUtb2qR8huMOAyTEhD5G88QqEVjJcyDAEiNeF9kcbI0pw03mC2gB9VqPP
agrB6WjhqhrjF98zJRrFwgho2mUiJllGtTJa8e2bPWb5Gk5S/41JI6vFigvZ
E7IaCO9VaT5PkaCVasXf/pZTaYE9ZrU9PvsyHTajusUZiuqQbZ6UgLwmq2xl
2Qmt0Yq/JfSAhd0GKEG6+OKzvN7xrF62H2BNI3Shmjt5ctY/fqplQdjqhNHf
gecY8IOLoGvab5+2a5E3A6ZG3O088u/wzHuMJagNnVJUk/PkvHf6VHmq9p43
kePiISOpcMcJ4HaspGRyTsi+meECypJXPr/UmBmQlnJJzFULf1pNvxRJCDeA
1NK/dz4163t1lAT2681PvBjv3kXCVSWoGPEqTPthB85ea//5Hmhtsxt1JwtO
TfNvnM2cpk6f03Rt1sHL9sXWynA1nzgjLx1Lf1+pHHtLEX9DW2Cu5owUZCYb
2VAFiqdpKErta3cTayM3ylnwAqkH4h1Xo9MVzEwARJfDS/QE4gXTFpaSXRqa
lTuCiyrquyyXglV4qce9SzrVFw1UXZT1kOm4HdnCfFwOkteGH+vAFy2b39fC
ceIh14FrDJzT+fStcd+YVB347z7+96iJ/53Sk4MX9Lz5/VM9AyMQa9BzocGj
uQapA0Wgki8ysEJu5CsVnbT/IGEzIa4yNphdCSwzG63mFFd1R47qrYa6JS9I
8j0NxYFGZo5YRE+WwcSsSYYBDhEiw3E5tIu3J2CfhquoCO6Pg3X7qtvv14hi
JGSdSFDSfRAz4aMfx0wfTbMJ3pSJN/YXoA2pqLCCPZfNYd5X/MiwET8aMZSN
hIR4WE7r4ECZlfuJI5aQEVvgiE0GGGNATArJCLLGERzk2p/AzB46jEDQHG8K
+YGemiRw5cCy3konRJvZmBxJoncYDiBCnZGn5CR3gbbOLQ5j5e0aIgMYtD/k
xncDvuwkMIBCUwfUI0PlKAwTFOOWS9YaUv+A4dzwp2Rx0a6WGVI8IZv945y8
ZVJT5UOKH1JQfFa3aeyqdv4Ux1E4lsSDEbfoFmHB2RNnm4DkEceU5/YlINyI
5m/YIMncBdcL5HbeN3+fbhq3Q4KscjflfL2w02KXVs5TwMZstEJrkxHx0Jxh
XazecAdJ0QJ9H4NPKxWSkjyQJybCFySsAj4eoxheQAEMixn+wLIfPNbfaOvX
yJuHa77cKfGd5j+FSTAMSoUG1PAyajJJokWVTYmoRxVeaRk1s1LY33/8x384
6M0w366ESxcFTWsNvzTr9db/Oqo1f/03/IhkWwBET/k6yHqn/yVBsEyDPtG0
f4j0aEZU+LGGhTg7kFEqOMUMoJclq/SC1cL55liDPxl2jkEGe9L6X83DWvOp
8z1d0nCz9P6tUtl9pgJ06TKL9+RhZfil82y3Yh/opfLbGI8xhPGXBoIKF/Dr
lgnTGWho3rXzDVa8WCab8g97AcUaehO9s7hgbW3l8ciurWmsjc6xXYqm4oeM
t+NVzkXhEMJmRIEiD566XslDOPLoQ2KC8kl//AeGt35iJarstIipof9MOejE
GYJmEnRrs1orMhwHL+d03DAqoiZ8s8n8BitYBWKQY1It9NLDw2aP2RYd2VC1
b0pUcbFPio6Mur6Hwz5G+y0YvVARVxYEa44fPsNsfFjutEj8SEHDoo8aiX4k
L8fI02OmFg1jdFAIo81Dh0v25Bs7TGnkjV0y+2aek7sP9YYcweeIThZJMFIQ
AY8W53FSs+xYNbL9WQAXa1mG4TwamgXEYMsdCErJQgZOpe5klO3YkpukrtYb
MgGktjvcZZXUPUR4pBELdCwC5597bpyI7TBKxTgeR1Qxui9aBE3xoD/NzhmE
pY7d1FZIai1jDTpUExObcp7q0lMB3qZcOOd0F7rmFbL9OyocLWPIZWtyO3Ce
6cDXSRaTnhGAPbS3F5vTGINZcvSXclbaC0LiIxqW29ro/6w4uIDCJPgkUSRT
flztVykx5mVFQ5Arjc3ATVB3t0DYELwx7Et+IkZrw3pZFQkZ8dW7B3Ir0bMj
C56xh/GMCYbHasnVmm6q7DygtXEoEVlIPDPcp+6crJjPGZccoDj1MWAV6bOY
W2yeR9bZqHiLuGgxIUx8jPGd6ximjKsjizA4nQqbs1FZh9SXYg1c+RG8QGaA
7Ldz0iJNjMkhDN67MM7eIFxQ5ivWh0pjhgytWFkkksdF1gI8+kqyhlMO2GxQ
7rtAi0E5XiuIm9KC8mQ8Qb1Mwi2ePuD14HeZ3jxVYR5mLI8O+S4zfW/3hbL3
p3QXIiBozk7UEsBLpm0Rla3LR7rDFtoBZGEOYwVkf0D3azZQEmfUl4x+VYtT
1AQnwatVyh9QslEvFUpE1yTmi7ZlBs1ko0eQa/BBxBZ/tZbMiK9Vx23BjjYB
oSDKcTgLcCp4f8H+Wnceh48UmhBnC7xB4qyRgCW2k+MFtCOOk+1Hz/SOHVvu
mDMMkKhLmBCeEzMzG9tw9+opyaTsoMjSBHbEJkByPV4b/W7EMWn9nCJ+xDMf
jz1QAPyQTbbDNGgJV4MxUQRSOkM6P45YVOaYPC7w0aX6v1Y2SJ9YBTpzwvZa
XBkBGPwhm6zVVm8Ybjl9mkOh8itHggLLfLIM49gfAbxJ2ngKV2gkl5vMkxYE
Jysy7gNvmJHLga0ikR/fxso5vUSvxJiQBmMyGGli9EvTsVB0VACEESOZitdk
T7ntuATqmeX4U7ZZUayNS+HpQZy46LDVBl+ekqfTEj0fDIxrXHIK8EWRy7xC
N56PVvFpspYwJp0Kpg1JfWsipQmBJilIrW6IQN8zJTziXSqNKjAwwopNENuJ
sAz+CC8vueTqwgN0XH4m1jpdiMTlianRRzvrQukGBd6/jGqbypASLpAjy+UE
M/I43MUP9ER1kDVlytQqxpF4NYzEo+DEsexMlsx4HGtyAR8QuOHRFIRuBC6L
sZkYqUJptjTkgUSqSIexlhIwnau1PQjCGYYYjcyBxcS5tgcAPCj7avkzL3vz
LcsKbIoYd9tCPtndn8jdMhSaeuEQwsjYEwpXQKgYjanCo8TKjHMIdU0DvMmg
OHUXPgZ8Ttk7kAUoz5EKVYRykj/gTbSJk6BJ+UlpepKSpi0fj8vmT1k6Jc5o
dBaqrbWHLLwAEihCYIi1ZcQsNPHU1NuGxwfT8dRjMadssotUGyZiR1RGUXM4
hG/fjPtfW1KCGDJ4K9KYg0+YJam4Zplbf0DWkfHCKwzkvuHkVslmQgGBFY12
d9BTsZcHBwckBpTeFgpciCXCxQ6KSR2228WANO7MLxI2hNVnsa2dwV2yGLg+
iT3PyIzx7KG5YTrPR8GMrs6ZGftS/g1oP1+IxLHci1NnomPI6PwD41k3xYjA
KRqaxQGFXPXCcFClalEGx1bixPRAciW2qU/ss3THtwUYNlT4fvP/V6Eih3Vi
eLaIxZCZZgqcb4SrJaNyELJZi/3UQPsihPoUWQ2xi2wAyzEwDIYvmgLKyMMz
bSjlyKW5CscxSBxnMpRo/7E2tlGYoAxLtMqdY9yARTKK9Ix+IqEzyucLLy5d
HzjuJ7hOn+jQPi3c+091eUBvB2FQgxNgDy1e35nkwdKrhOB0KcpeJdWIgtA3
eAvVus3rJxj9rNBujteOwhMFzaehyhKQZGIvjUnk2j34JnJluBuGtFtkjjdi
P87wUfa2puMxnFRQNO+hjmYlDgRVs/3gZMqbl4G/JGfG8Go15VIREO1lyKI+
Lie3mgIfpQHtTDCPS+5r9GzgeKRGB3h7Aldr0plVsSicatS4htSkKZDgb2By
4xPTBISyFx0g60x9wYzMK9rpjWukKJAGyRrtYhSzP7YEUbSJUQUK56jefMEh
sWnIxZDlGxG0couF7+9Av0Nbao1di6AI+LMa6lsuEBSMyak1W0dGIAYBQT+f
YDELFu9FjL+D02aLrxEpAIMmKVxxz4zOZCLOvGe9xj4UVMqU0AbgBPSl3zh/
mn9CvztTVglaeMtniVfI2C2N4K3R4pOiPoL8qxeF/CmlonO+eim2iUiXCXSi
MBHr/Jso1StZxEvRJ0U5wnM3pkIWz5AS8At0SWN1WeQjA21UsIggiPG1kCxk
YIoqVZUUqNCfifLOtx1r6MyYVWenRi/giMUvUKbL95387P/szDRwDUYG+tPV
X3siO9iGWfu2ipGYAjMYiZyd+o4IbCZByPs04Uwx+C0ldRiohDefPdDRndAR
8cFL6AVi+70/5iow/li0JT+mTKcwQ9App3VCXu7U5kIsAvgesGefVsE2ZUsK
MsjgS4qDltRmDEQR7NZ3UhENkl0tKghAB5gzXoKW/klYIFk/qqQ8q5gUXqWZ
solCAwZJCI2ENeHnxCFE4WdnHE0XpoMjaSsdWyjS2mWEBYxAPECDDG+qjiHu
J74EuXhuBPpvdo412bGRktSylISIB0A4qWOwen9Kk5Cc85gVweUnzINVHOA9
FoBjOE6yilQwJMV4pmtBMxuH2idy9phKRxSPzk2UaSdZh6UnB+T6kytEYiTH
1ZXv4AcQgQUFAW/gBf1vdRIbObCEyUjVXLBULdA8VyErHeRl0XsWeqvoIfwK
8NlYZt3pbEQ7N57SSnBbaZab2iTjZwM30To4EOjoW1BGegE08jegi9p8mH/9
kz+BF0is4uvjM2fIkg+G7rsbH4gqfqNoJ90JospN4+wfuGw4QN15Ayzp090n
5RFjhOL7CqgEI7Z+YES1WRmWaGbpwHsGntwpLiNUNhcCiwTgjvY750RvV8S0
wruBw/Md0kuyQKUj0SgrSF9Q812mBEK4SAPQXBwP0g9WOnyaBpmH4dLxE7Gj
0grgHp4lkv9afTQNzAERuVQpEA8NIDLvQzDelQNRMT0DjHclQGxtgWAxSTK2
a/3CiTDeBFVeK6RcYkG/NVt7tf2Dw+/1b8+PXtS+i66jBBjSc1ndknzKWsr3
yLmY+jtV2oj6mZJoAHw0UVXEPswq0b8oqR/WQNCDdaShiizA5YeDBbHcCOtl
UryFXfsxB4jBge3upoP9z8a/1wGFnb/z4uDXXMxv0Rfu/Y980VRzwPbo/eej
wndoVNg6j7mHo+0f5d5sqdFg2/zmIb7ZPCh8k8ZU0hW/3qhySFc/sWO3UqkD
zpN0ERUm3Nqrw2Sf0id7jUb9RaNhPIFl11/gn080sHZDKFMnpTdl1dX8PJ+c
J5ilDhK3oa8+zS2l3pAXqQRHwZv7etHOkyw6opscTQxuMPOMoQ9gT/yBIOeD
X9AUDVrKjR+Vf1AptXnWsIZs7c4bY22a79/TcgQkOYmhBokfCjHyGhvozWzd
K5XIlM3xogEmXPSpNPPpgQzJrHo6zXnNi/3jBqstjVHaknhnOSxKzfwpQdpm
IiyKM3yU81ayc7cGaZEuaVRCMCr7aCMglkKo/zXokUCSBSAxmDL7XrXcTsnZ
hhtlntLngIHfETJO3zVNgWk9oTTPn8orcET5lONi9CjKabycuxtSPBdYcZnS
7tXmQScoWlzZurbgBy5TpFRAMJ3K+Yfk2AGM5h5mw1G6Hqr9aEfTVk0rCVmF
zigvLMmpGYij+aYM4LA55W82DKePKPcWeUQaVUAPYlJhKoKYl1N/IxI9Smfc
UjYjNZsi9j2U4jr16Z7FK8nDwJCk1cgHXE6oNJwxCWUtoJGdwqRiI2ifAi65
dFp2H6paH7u1CMxKT0Wdi2dKA1RlB9fFBcEoD8uUALEa2p2nDxIrSeGN5ZzL
/JGn9C+XCWAAUHmN7Jg/1yzhkcn0VKs3543NYM2yBHEVP1QtizTEmk6FNIYz
TOljFdpheKXN8C3iGlcEF4Pg4B08xzuIXnijOAjGBZSuWKWGP44q20nQf4UX
kLuWOUEgysOWsNdtgb5KBDG5Z1rVIn9hrDuP7s5PUoGGowUzPMXipDYfNUrK
CQVlibVgAtqtFpvSlPU8tKuqRii6haWMA54geQ1hQgBKxCUU7WoQGSOveTN4
cnrADle86P5i4U18DqQEoRr0Ca6KkoroRY623FAixxtxGRT6kY0vwwlA5hFv
aO5gC46Og3cxLI0L0HGQCcX7ElKOVv6clswu2f3mwRHWo4W1q/onvAmur2uC
QwVHuFQgBMdJCs6h7hyHOHyMkcahP2HMXwXwzQSuGy1k5N24d34onpPkpqYW
xUC88eZLtLLHyFGxgFx59pJmB4E7gWufMLFOS4f6gaocq2pIUFgyU5VHhqMB
MIuEpq3ZB1UlgTHe5XMf0mA0KgHhxWksQiYYgULX+S6l3nrtSWU+SfshSosa
ez7JnoLSsnn6BuUXsszYxrzbFMvoDmWojFJdeVT2V8ZSMmmbj5jEIq6QgA7l
nO2JUAB+vRIxSEzgE6msmactWSm9mgYKcEUVMVBvkREJv1CMyAlxHD+Tl+EE
dcjQrF21ZI8IamKPMMBj0OztxLowN8EIQMl7+ooiedNCI+J7E9IiMWWCmfE2
1Iwt3KRrUBjolaqv+ZCvl9lgNk3MtEfYCEOjcucO124tDFyrmkPNw/DWcJsh
lIFaFYBPao5nDZx24Kcy/YqxXtUbpm2rgitYbIBxyapDrufOAp2QCgGJyZ1z
q/gLetrJ97EAIZ186KTha1CIGS/GgkuANEugp4kmKFxLYK6yQOYS7p91iufj
uUsRT7sgisB3406Qe26RVFDSlpAIMvyLh8A6d1RNmBHwMaso77Q8HVZlssPz
uGwgSlBUYg8Bu+SCMApOaDaAu6ZqsaXyp6Fu2GAVJFXOnWIzgBDNKlX0TAVN
jMEIxhuq0Vc0JTI8nleLoCGc4RQFBbr7RdJ3rITEDbExNOTFhq7BwcxAw5Bt
1h1VaJr1twd0nqpeB+L0HIiX5IXITq0qZBndmEIszVWo+yhV8dJoeYmpFO2Y
q6UuPDeIdd03pjLjKIzjmr3zUJXOwoMCyLGuT8HPEy8ISfXB24uVtdPseIJ/
kfFAmwm2cSoKBKfFr7A9hfhkhDaTDTrdd5UtT3rqmkrMT0SUUoSAr/iNt4po
yNhiQZiQIxnkmeKYFHnLaK7LeaaDcDhuriAOdXrKZRWJ1zPNUV9g9FOM7kCu
eRMU8I60rhsIbdlCJamD32IQVaUVkP81VZFJ8zT05TSIMJONkrCsS3Uq2Uqu
0hkoxjt2Uf5gnOVQAporV3lXQjGfFCXJPrXLxKl3RVM07/Q4BFotGjadGWkZ
sDYdar8pyrjI1HyW5Bdcv12nFPUFZDahirXXlewzIfpDyfDHa55Lj+cgPbRM
kNgEL+rYWY7h4EyPrF1Awuq3F5L6N5G2shXU7GBI4rQlArhM86iSUVWs3UHo
KbZdsyrFZBWpkDoMuVcDl4WuPs2V4NRmdsQ8zsmTmFRJSisMEcZznpFUQlR1
5gWUuzFbwfZhGS9zN42PozxaL3NdpKxyBmcQqTiJIBNvm8btmrWOXnJ0k6RX
YMMh0oueUPAc2llYJZX62yIlm7/UvLnP8bpPpfyHChQ06oHUrVlsuVAlpYRS
oVctJVN03V6nxC0abL4mcBtnwaSiNV32E+DnAy+6nWNJBc9WdOeAmws3usX2
KP+jXzumDnY1ENIBarUFfVRLyCcHH3HO/LFudcGnN0nL3sJC3AnON7UIUFWt
mq0bVXG0GuQCBYkbz51g1CKPKqXFpiIwqmgjs+IKkXyRQbx1JpI1ppiXXC1+
KmMltRl1bpEu4v9TGvcsSJ/LvjGskhzWIUhOlWpZIc+TD6vuC3xj4gmXSle1
zkj00VkXEoViw8rIGdCgUC0+JiorSYIaSRNKo74fW44uZbm2UYUqHkexZO9t
PSgb7ndwPTElFm6qmQAjnm8SwSWP3Yav1MUiWSIH6MJGHNzqoC6sXS0M39D8
omhpzCRZRMFC1noWJmpmXxgu8jOieCiukEnsTPRFlwigva5NttZaIVaK3GSl
o5HMF6PEyv3lkFCl1AOR06j5Q0pSmuijkyUpW3XBo3FWw8Yj45OMhJ1qkDJr
DSOblFm2MlxNLjOsiowCD9DQcxNu4YHMBKMZJqb6oFmrrluIYERLKaW2Zs0v
Ej+no8alN8Nf8cIpwUtr4fAxIZmIfaTtBpsCjqX8V6yimC0OSA7353xF/Ujf
aqpKlFV4/YiQKq4aDga8+Wzyk8Q27vaxRWqgUooo+kmeVdVakJwAynwiumml
xMJ2RaFVBXSR71CTiEpoNdn/3qpEIC1Mn1ELMn/hpTSCrzGVeodd1sJpbUJG
CNDZ2eCbEtzxKoqyWIj3mkgACMV4mTF9OHelTHKI8zEQKBEBfXkTqhXJvWo4
D7HK9SkzV9HV561bvERGkzmj2hZmuuj+HUXydFqznSN0JWMpzTxNDT6STkUH
P74BZLQSJ1KpSzWy4RlIntKZWFauQdF6/Dgt9yYCi1S3lFhqPiwqp0Ghn6GY
5eQt1QakODBc1qF0nTRkAWvABxhBaZ9Yum5ZXlqBSdXclGiI1idJsqWsGSRr
6od641M1/UfT/EdLTJExdj6TaqO69BafLW9X1sGKrdqEFXkLvDQS+gA437Pz
BHXdbepTk5H8jSHTfUpTDnbD+InK0inMh8tVqTZDv/P6mpHx9jQX/k0BZ0h+
dMSZgjMb8BRqqCZsjEwF0X7sAVOg4o+5GaYUUrRKTWA5kERrIlWVSGZtioy9
yo0l5jZug5w9pHk2ag6rez92LVL1XqdpEDTq32BvNRgSqy/uPW6xW5eYlE4C
M6QeMr34FNe4kA1vD+5e65d4tfz1cP+XXfzfWlM5EnWQW+pOZDlfG22wcyXw
+JrKkbRWGKtocFXaWUtkBrcl0yLKpstliJNwAbgUMAU3yKympvhZ8RGsAmVB
g+ExT4IikwkJ1qmXCXWBIjlJSxpMnOwIgjWFz6ZtEnDQ7EKtjiQlnmHSLajD
lBR/zkrDIj+pupyarVMp6sSde6bgLUJ+BrwcbqCat/HJrqPQsiWif4+4ghin
laIuootq9aLzE5VKo4vbngXsW61pvmU3/os8aX6FBPrUW883NUlCtt7Drqja
k6ZPnH3CACmizNooNk7MgxXim4UfpUnB2SBDzOgsUjhmpIejfT9DZ1XaDDYT
PGFdUQqiRXxOUDmfSW8Fjj+QZm9B2Vaz4S1ByOvEpBCdkeOcmxDNLZ/F7TQZ
XpWTRvejLMmM2iopmWm4OdBtNrYhnGFBT8y+BkFOHQZ2gDIblTUxsJp9UubH
7MKlGGR7gGrJ7FwnIVEHhkE6QdoM7wGPMIrXWjfJ3w+dry5YYKYt/0BRBGrW
Y7c+E9OX8+1vJTYxEK3+klJRHCSXJt6SvCsIlq5dRR5nBYgc8xfNQzmxjf5n
dvyQ+JSQNBk7l41vsOSaUWiR/d5GhVVaHYXssG8xNfKmEOKavkUxCyUT6irX
KhkYgUKjFJd6MMDKohwuk7rbhmYdpJLViQXUpjjMvUSFVCDiiBvXX7CTCbVB
DCwxm9umChWuGxtU6qOLJUZMqFzRfOwSN4bTuh1GqIlETz1SpcudcTTi3CMC
wrcIQ261xirQQRZn7F3gTE00Ud8mJ0KWNeP6Z+w5stga50AYtXoXbuDOaDay
EpShU2Et1dKeTWZ88F42MvgRZVe5lbfhmvrDnzxpPK3mn7Nc/aRZ9Jvh4XvS
khdU7dbK96KtShVXVS2Vvih5DR1I8C6+IQVtsRKiVZy1cIp/M3vq6KdlcLfG
o+h7wm2gC74YDUpPTBUridn7CHDVpo8RBsLB8jkiWFdDVFqLZN4JiZqsGLU9
+QY56HKV2DGmKhI3IWXHDyjZl7o8YAYJ15kVqq+nJK35M1P+EZVyjj0KUy9r
n47W7fQecAZABkk+ZZp/5TQoHZuZ+5gxaesA/Mq2QQyU2zpScbxopSI1A9Xm
rUKBUjA8JQTSXdg0U6aES1ueNSAJ6Mq/c+OpMiYS2viJC3mChjjnaEB0CJU4
smyxWa2/nq3+o0ti4MTA/NEgZSyflr0KdKW0SelVY4SUFm7ZihHyYkExaMQH
vTqMITW3+Ljywzn1UNlNiiK2fsqqK381fWBYuqTiEpDCRqz9qWBOMyzDrOld
AE0xqm+DqFySh6Hq2nWfpa6HLZlkqvxgsE+clg54FIwzZVn+KsgJ4bdWGPqB
WuayVybdXNK8UvRCKYTyVbSzJ3Vq1HHZdlwmOSo9M7sissQ3utuLZd24sY4T
p0EfTslBDiMF1/ykqFqMERAsxWJgCRLqo6sjzxC7krzioTsOZRQnLJ3z+KUi
taXeHJkFWvUbTZVCh0IRirR5TtM88ojzYCcMqVgPVgIS61fB0EjrKL9n2331
RQHONocoBQYvK42P1uGl+rScbP1Fs8aQPxU3KrvULD9dLF1gMvETElyuVEEs
AijleO0sjxgzY6kurc+R0mnmRFp6i4zRcL05aoHM+9zlRNWb1IVXpTGR6SyS
0EtaiV4Dxy/ZInSIGd/OIpyAYqFE4wfVspiRPgUMW/6kClm+dJjuMEF8OeBa
YRKppTyMSRbRsdmbBwfoxmrnZn3h4rQeGgt164jbfZIlBzUyL5io+EOgR+e9
QVpyRCr7tYtIha7WZ9QtLINOcV8nlybjIPzn+4cYhJ+qUFzjDs2CyJdRWtgx
lLHdpbcwQ+lqIB75QQ3XZJgDdrD2w1yVruTgMMlpUKXaOTMobbtkCc7qVnr3
GFqBPqoN1WhhTt7unJ7I6g9ae/uS+0fziAiG6rg256uM6B2eEsdZufNFPNuR
97a3w2UAiXrljoJpBbdP28ZdG/LX353Ws+wcqY7BbgBPApjNyttKACk5xDp9
Ljbs7PeUQj+pedxoNt8HNPWZyZeVbFqLocyyAqLEIPlFPANo9zJzTqSWp/F1
xiSSkfPUgjHCG9FQFwKXao2lVhCzDlCqKe90e5fD/km/2x72nPPLs3P8Z+9q
B/gTyD7ShkAJdsCbdXaX787LRGOcL6NjlEWA2Qu2F+lmMgWMHCTGJd1u1Wxa
pgFECZ+CMvrwfIvY0u1UFXvzBMIIOShFD8k7sEO4cqVa1YRl5IW3HEuIWLmu
QDkQqtVVwbtZKVi41TrUgigW9ADdsNU8el5v1b81G41aq9H4/okfSzJ8/dt+
q/bd/DU/VaHEwBUJavin03vVP3WKsYteqLS7YRv+9GbT5sf2RbvT7oTtV+3F
Zfeg96Y9++12dj07xd/o9/Xgy+zVVeeq3e7CN3/nOXqnx1tnKF4I/zbo9ztv
v3Y7u4ft4/as123Pbts3z6/vDt4fAZW+XXdnH/q/hx/7Xz83eu11f/3qc+/D
oPPhVbt5Df9en1eu3h00Pr7/Lfn47nL54f3lvN877Qw6+++Ph/3W4Ph6fTrs
3w++zpqnb0N8tpd5tq6cfO5dDzp9NeKbj+9vbkbvO/HHq4PPo1Zj/W7YHnZm
4y83t5/Pzi/6nc5sJn8fdDrr026l3R4eLGYHXxv7h/vj3vMo6S2H3tX5yen8
8rrz+f7LZjwZ7Ud3p7ev9k5Gk+Zlq38ZPv/64cw/uDrfu3r+ptLdjw5er3/u
+8dfDt63gothc32wWSy98Gt/PThu/9aZnb59fTnotT+324N2jCudHK8vEB6v
Z8ftdxV+odc7/to+nc2SuffqJBm/up+/WZzejYbt39MlXwCQT1+3jzu9tt+5
nJxHb5cXyW+V+OffXhyf3Aybx6PDi0X/48n088nJ7xdHR53G7MT7upm2+7Or
df8+SNbR+ckHdzb9/fDufHy5PL5/1QrfvK28uZ0G5wd3zavzz2fx4EMxYjwO
Gy6H3c7z31NsuHU73sXnw4+9qJ3Dht7n3sWgva/O7nXlevHibtLtHF8M297J
urE5/dxuwolvBsPB/uDrby48+zoY4rML/WzQCe9fARgRipVOezA4bgC3fvV2
M3r39tZ9d9L4eIUDdj4OOoNXnc2XV1eD/Rewulfdrvx93XvdbvTbnd96ryuN
4+fP/c3JXaPZ392Pe1+u3fDamx80AFfid1cfote7b5Kzw/HkVb91dLr5Otic
rD5EvcPr7uUqnrV/DyvvO4t3n1/3Xv22CI/Pw/amlfz8uf+1fTNoH9HJ99a9
zu764mTQHnTa06P18ezD8dvLxnn74vVup31xXMGlDdqhXh5sqdtuzNqD3nW3
33mXnPvH6/fve3ej2ab1c7DaXe8PLjun8cXezejtu81vw0p/ePpz8/LwXdvv
tVvtKex57/XXo/DDh4P1+XzSDybR+89B0v369ao3WXUOl727Dxcf34XbDl2L
DdhA1eEGqpEZ0Ej+ECDbLFr5OS2dfqzhjzUJiWLPzt9Y0DUagQ1T05XF+1DS
s60laQwY+SSISONo2FdEehXooVJnTaYB+PP6fpo2x1V5zeALFXsSroN56E6y
HtgqJcdTEgX9xDF4Kj9MxMa/ILA6PvuiXw+H506b8l4c9ABixF269mbLyihu
NhsU8S+asrEu0SNg56rfp4ymU2QTjsakhAilnLmJUQpZbabcIF0QdZp6lUgN
KzVlwwLU+H9N67VtpZZeTYFiOduqgVqqVaMypJqZ+aYWlhZhUSquUmipuWMh
9pkiDp30jyFiNbeIDGo91gQRcqUdyWBIJBeH3EcYgLBNyTfbduomSMUDS4A/
moFVSX6tteuKwXYwPRl+tpXBpiylbdpqrvl4uVdeRf7GhV5eVgFAyCN4U+Yi
p3uKyhxQxTouUiH9fOkdqacZrqIxO2O12UslWsuFVMFmHPKxBeTVjGWIPfqs
+FAcM85ipEdxryldY0LKrUjXe0Ic/IvqoGRa1bhKc0/k6m9/s+wqdCqSCIpw
MWI0ATDddpOuZrfdkr4FJVUsso1TpJKNqa+k1dFVop6ZmUEGI7gY5owPVc/Q
mb35eWAYOlaVg0vqAha7cJptvqTcGDVwwjketeSYWEuCMehe6OBpNM5suYiq
KxxuQeGQmC05Jh0jWd04DCxTF53z3Ju541xSQl2vuWOuWWJHti2Z7HKPWCru
yqWsPDuUV5Wl8SkQ/Z87iFbJQbSsgyjZTusvnkDrX3wCLfsEKC5b5/ZkcpL+
JScAMhDKIgRzc3y0UJORmdPUyvipxQVJSBMrBrVKMLMi2Uxffrt/4hJiOiBC
UnqEROLSsX82JQTo3GPxKyu7W3kqNpcjZNZsfF7VkQl6WorCt/sdZEgw9q66
CVezG66bBXcG6QgcnKq8/xgmusWUjlmIsjHEL18KtRXmDXNvaQo01KnDBRlH
gb6wmn5y6zJr67BphdRS31/4kKqpZ8LBCKmeM8tGEKhgPRXXo30iUiDEsKIN
lOAjpYG42inRbaMxX6Z4jLYDpW33qmY8TZxJ69LSVRGPljhJsjgZMUgFVvuC
pEExqouQrozqYoKThts4CSfpK6OgzoniWgbaHs3Xgk7DtNInkixjcz26r3kK
yPHYc/VPZnRSpwJtRUbkkg0kZamUD3HthtTCi5Rl/7W1IqZxKyxTgrXcItYO
VFiHCm1TJQbxd7TuZ/zcD2t2VMBqRcH6sccZTqqvTCFixFmvAs5aVKw/R+Xy
y4vFWk1oK4bQmR8oG2eprZYlLI6DVMUslBiGgJh4aJ+MdMq+drUGoUmV0+Mw
ojbN5dYeMNHbDoeXP2ZOfLRZkGwCRAlIQlSVpiQKlZdolwMxigFQJYu0lava
EHklClLwDXpRNUEpiMzcxM+XHiHlLxXhlR7hi7aqVD96F6ZTWKzsD0q20E6I
NEGZerTBnbj1NmZWqUXYuCWiurHpuDS3OYDRnyYXAq6ijI0IRIPYiuKlwEqF
UoyRSb5CI4l2zhGtYOhNsl9nOmekw9R/aCETnWJs7lEvhT1PRGVwLWkTXvvt
hMvCYC0VoovmmtMlG984uSJzxb6Gn5DzjjAw7Xw1gq387m36wTTMOTks90Ya
TrQurFX5g5fsv2z2/2Wz/y+b/X/Z7P8zbfb/cob/EBaFn7vd9rU/AyzptGfw
/58z1+Bzezy4DNev2gA9+Pdx5+S3UXA5Hy+a88rHV/Obyavr2UWjNxt81ph0
MBj2NvDvPcGkzelX+xkQpvuT4/YVXUjEpG7r7f6Hd8316NX16kPrRTI4uV33
1h9eCw532xcan4/bF+Pji1m7F92515WT5/77u1W07My8Vwde9/5oPFiMz34f
NZund/Pb3Ul3Mm578/74rt1+3e68Gh+N317dfn41P311cTPzuovKoPP7hb8E
khLf9m/6H8NL96wzO+78POg0mH7MLt51OsP10Sb+6DVng/7u2fvGb/cvPuw2
Nl/2Lw4rXz+3p0RXrgY9vB2zzvDFb+eLu7d3LXfYOz7Zvfz5/fDj180Lf3D5
7nP7XIgUomSvM2wDGgI+CqWe9C4uzgftVjcHD7hR+PtvFxcDRlmgbhfXJ531
oFMpxeGLbnvk/zY+jc6DdtQ4fRF2fnve8G83yauL++HFm950MjjZ608qk8vX
y92L/uz05KJ/ub98u9u9vwtGvwVfrj9sru6fn842Qa/zef/uxTSYnH0++nlw
t/5nCNfNMaDc1SpFuSzl/dy+HlwC0VIo155fjVovGsixKv3j/vr1zfh08PnD
+mzYux987q9PgTq8w2dfe/hsrZ8V4G5FIa+Nu48gWu0v19eH03Hl3TjZXL46
GXzd6766WF93RwfL8xv/ub+4chf+ct2PLsLll7Oz6y/DqPX88o3b6F5drN/s
Hj0/e7374X58VGl+Xu6Nu3tfJr3lftxefP74uXObQbdtGDSt2Oh2ddGcHoWT
tncQPz+9ftG8vX/fWpwfT47uva/tKxPduscgsAC2IeVrCzsABklkEtlEp5O9
/JoHtptvo7fTuy/Ni+Tq4K4y+/jhprnp9d8crd8eHe696vVa3cPdr1ed58Ov
LvDA4XUnWg7Cg8P3/dHP77yvze75u+TLh5NJyz08vfvtvtL//evM3/355/th
/KAL82/ONZpLUKWsVHLF0eb+7ZYGidU0ejDe4i3RKcJ+okpMuIXFHzbiVguj
ZRhxxFKuO6f2k1AQeEmt6lwZeJkVpGSyX6sqQqj/W/qJWI/K3RCg+7gjXbyb
5Ou1CqVcsaVUxihvKyn9rrkte+RIb2uuwifadqWiyvmVL6UkVSFT0I9qmgSp
ZTROi1HZxfqyxlwjqdgu9uRSZ7uN2VyOSt9wY5JU1cmkSVopXpwUk76rUrk5
Ca+w5E42Ryz1cGG1D8piU7lruO+F5yXcZxt2vIpQ4wmkqUs71s9qyzD2qewD
JsGpFDIqkIAFWzipZ+yJ+8kCYHwD+vGtKm4499yJmLvRWDHH0EkFEnsVXJYt
uvMxkY41PcrYM9KKiz11HBrOzis7LLDgfKsqmDefsEq5mdhdPbOwEZeZJCCo
KD6qdif1mcpr4k+8GdXJKtoWDjuJwuWSvO5GAX/yF+ZLhA1pvXGiI1N1fWMd
D7yKPU5mZid3KeEhc+2AS7Jcc/kdTggfiuEZ7oY4a9DUUNgKWFVNqYrdPbPg
tDYZe8a4IK6q2IlliXh1FI5ZFjP+ME1Ub2cPXhsc2cnVbbMZoKw3glqLKisg
nQHosK1JxAhkTrV1YHjfLiGEt4nSNX1NV5dROIuw6E28CGF4rHjTNXwgSFaw
5C3RznBapaM1yuHwMfxEuaRcV4OsihQR7c5nSFxvFnge6mepWE72iMiFWcZ4
NHAnsfADADpcCCHB+jrUREaXq7S4ChZuTAsa0R2LVku9rZw7xqDdGQd2uUPY
oNdc3coC80824XFVO6i16/NV8ihzvJiUb8SZp/JyR940lGj49IAc6i1KJl1F
0GhwzhLgwq0JHg51Edp4bsRZFXSH6SamF4EQpR9i4t0dw7yoKUVAFbXEz6lq
QnFBEB4UKx3eJ7G6d5S4w1iiCsO5PKAu85Gpx4MVHmpfVsCdVova2F0Sby5a
yojzLOx8/E8au/5IsUsib4p++gNxxnDWWfyTYzSoGwxfd2txxKK5KoY7ofhk
IM/omlN1nNGCifWnpImAK7VHKdHUbENCWMI8TAkiIy+91unuYs9aaClh0kZe
WBdeXS/NK4LxFxyizBce0ZA8icgJsFob/iYxLxvnBt2QIdYiwxYLhg8Ha/xn
QeFSOeAC1kDOt0VINeivuQr4GhD+ZmMQchogSjNndIm7lflBAU4SU1QN9GBv
KEJIMRLmocgwWbRLeWbdMYqDMbdiqUDcKta95aRVDqDIylqlFENVU4nLxD2q
VMLlIqmmgGIEcJg+lVFQxuS607vz7LAYW2iQAngSQIiyGYpXQNjP8P5XJckA
O2gsVWYmenGijeJAufD1RRj4WL6M86D5fpZsg7sukWxDNGbiU2HGPL9lQYxa
2/oxEWLVOhQOaKPK59UlAbEIq9PYIQ7FwbhNP+Cy0SU8+CcqcYkxnFI4DR1R
YrxHfqVrq/lp+xnl4tJVVUA2kMAB9Yb2phBywfm7M5FpCtGEYcoUi+uSKH8s
qzVSWVXXeZUILR0MMPLMCj9G6ZEipq43yudORLjbrlvl8LbJqvrw2QVoeXp9
Oeq4KrX5ah4mwZKYQW9zlTqpjQEAzpB2KaQ5Vd1rBfhYYD4liCK3Yr53ITDp
4oCmMWYH0IgkdWaSBu22ReQJeeFi5YPLtuzJ1Gulwk7lgSJ8Q/nEpISVFEIK
sc4OHOEGRgJphqIlqmlJJtUwmQ+WC1zEyCpBZ75RFb0nHjamEBKyBCz3WDvR
e4GdU4k0Jqy/A0O5DFVa2zF84gvhI/ebzykiKuzI9DEhSgEW+rHiT1jiKfCm
0pYcOBnsGuvcRzQ8xgRjIwHd1RnHAFGMog5EiohClfwdsFqnq8eToBO52L4T
JIVWoyVdMvGIkYCH1O7F+fat+/rybNCrXZ6dDa90tvPg7GP/zZu2fooI0zpg
eQaHqGImkkjDzRcvjgA0CJfccigwBP5BpUvwILGSOilN6uLpsEpyIsrvXiYG
nPjlt29cNLIGg2IhSa7jJHcP5JZYrz4S3lezWBm/knKQH7YXKL0S6MFY++Xx
RhEw3ZjK2FFEZ2DKmPlLtUnr/MqR0BBs/6mSkrrCLsPcASB7HWUZujKlOQSW
yaPKy8ya71ZzrJw74hiLMjIfom2B4lBJ3zClXS68Q5inzpYpM/JNQ8IsjIkV
bTiUohEKUvGWkM8xV9iXPjt87ql3mNQKquJFXKJYQDjFafIg42ELgcb3mprc
ws0G0A5TfUxqzqY1f1TqtS6dQR5yf5JT5EbeBuPhbdA9ULmUCx2T8orCnpL1
FDGhLG+Mq0vV2fHcBclxnIqR1kfEtaWuKqqRpXCnQC58Xs3UDjJ7f9khPCw+
V42TqjttyReETdfUpjFJUCJLy04llSaN/dD6lf5dzJjMfn3TVaCaMHEwEUcz
qE7FCF3K0Tcqqxp4rgxQtFBpWIH6rNGroliJ5si5jUjSd94czlPq4/bN8M0e
F44ntY3ENiSP1bQGPR9rfIMkI6rN/TsifMUJjRIsbxAK/ro4ZCHWeewLLy7q
AvJSR0XqlpdpJU1K1aTOI+mIKlgpfclZUjQER41oQLHMwu0xFl7iYvJq3Tk3
tZgioDIyTiIXzQ5clEibGUUSxTifwZva8VW7dngA+HbSP79qNfYR1SxjCJfV
TAAT58YS2bCoZ2br8tQ5qLYOm9TveatQTPcdW7KJGoNf84ou87G2RG/80Sqx
o211OzYdrsX0GsUyRAFBgEz5+ZISOgbNxH0xCgnVJCZV0DwTNjhAHNeV1bPU
SCeslPBCndVaFM+CPWDYtEQBN6qRaSLPZXfMNTNLNmRo8zMTKswqs8BmWBHD
wCGK5tGxY2hMwRudG7SUPsY6INFaLOWlqHyVKoW/4jcUNSvygQkIXcrEEgb+
7//+P3FuLY4vxUSlNbNYyvEjtfNzWtml0Ry4UmmXWEbNKvbKtJylpnb8VdUq
1z825jfbEWfVjUCbo6RSAehVPlmM71QZ9PGNhyk9lGZ+v+Rm1FWq9TT3uex+
6umpxV7AXoesfuEjg41FO6LAQROCuaqe2vYopjIDPSzCKjoj0X93iXGVkS+Z
gJyrBeSNau4bxdRBfKI9Urg/SoBwh/xwwhUjfEr1YRUq3SOwuZD7uD5k6mYb
lAK/Uk5BckTvDe07dQ3Z3ieGf+Chku9GG2V1TptJKnww1JIw64KRTrA5Dwwh
ZQfQfLU0A0kfwMBwRJUaShOodPg2kkcuTTlZBdhAZkM2B/Q9sHUhXfNEFGOu
W0rDFEobRuy/JDRamQeYxCGWQFC3xh7GL2+0C2nEOy1ql0oA1SYi1dXUGQG/
usVqh4bjk5BwjXBG+4JLYghFvJLRk+rWSv0UZlWoUZ37ARqgAFFC1TZJHw7Z
QhhwIFzk69nmbXdoMEaUjLGgE9bIN5jikmfCbjBc3uEFKksyv1l/X9YRZyvo
Z8tvUcg1a9KrkeqGg9Q98mfUtjWmFCA46kKHkfLVoVzNzkopsC0rshUq8gts
b42t6hBqHqFGSi1bSk9hWiEPzZUoWQpYLvoxpeyR3E0/64tRk5ADzTaKmdV6
M8WqSpmQqjUPc4z56ornkpCtHDhEUdN3eFJqlrrV9seHrGx/tMdq2nGq/Ci0
GT1O6/vwaJM8gjxGF2S7YaE3L4VuGtVbDAIuEqKsc2ZdxALzuXMukQZdSUhy
RRkkw3rKfn0vLiitZrcjRUHPnYcz6nkuxfhKAx7S756Y/Vn36vt4e9JCqdKb
Jq+m1J03DwSiZJcKrNnDlANyJpktg7iG1oPWO9MEGDwUBVMabpJzxJFBlteW
rYXsq2zzWFfJLTEczo3UihShqW30DKtU+pybBHJIiF2SMyWWtQysuphJF9Tc
Wk0p3izuXLWLw6vwlVkI8FbJj6oOkNmXOtcnKAtz7Y3z+TJKmUcsgopAR03K
k94Pw4xQgMoAtbrKRTuwo5EkXUYvLvDG7n3Vq4ISx6whzVKvRTXqNDRgx60f
WQ/L3M90WTkURJ+BjFmHc5KG8mJ2JX4uVizUozJSaUFgh7uhfknstzZCLbKY
NqWD466QiExsjkxn/YnLLFztXr3tdii7PJo42UgLYoTFbYkBJnt/ASaroBAq
sCUyu7PpJtxaYl41D1d9Tfjt2EQg+GsUcW++VMgsuTovbVZSjhaUdImOHLra
hgRkNNI1mzRsxP1AvVqL51ZhYuwZFgZbd15RN66islLV0ggSsWmOqMVYUhwV
JPEuSbYsGOogHi3BL+qHzh1o0eadZbt41JQX9EjCxp6PgLuohSNRgVzdHslq
NFJSywDlUYpNo97K1JIei77zYNzw8cboPEyJPTEpeJzKyGEqI09befnVIhlQ
qCrZSrj1t/b3yfnl2iTaSEMgDXI0UiqP6Xaw1sTim6U1Eo4RvDDXVsnq2fL6
ZYeSuWtqZA13rN2uAU/ZuxPvr3L9vFnDKJCaXYg7ucMBs0GYcz9ODO10Ffhf
+HpQiTTdIw71PJiO/GDV7Ng1PfZExpN1qFKwSONQB1txNQpsmaZEskwMpG5Z
VyRIgEAWbBY+EbbEKgxf10ULD1883+M+pSWwSTO3mdHbC9jKklgs1Fc9NGGK
9rgsyGnXxoNqtqlblsW3J+bLOdGB+0ERGJmglMuReiKYArVybAAsVm0QoRQ6
RtIjIeKmoSpCxAy62oZi2I6DVHRyLvIc+SFS5EKbZjAxIkf0zGIDz5gstcy8
pf2JLm+o2/RsEa4LmarjUUF7VwHVRghFsDQDT5MICwwTdefJVaZLYf2pmFJA
4154ykRjT6K4nLZfYZVgPh/zRsdZidGOLiwylEjJWRk2I4pzVJhCBDylG7R3
GnV1I4k0s4vE0A02oLbNnSdFOTwdm4ummVwQoghlq1ghNj/4A9tkmyeoG6ln
1zaXXGSuNqRRbOpjfSQm6daYQn1h2FWkQjPGYY26L6ZrjXPyh6ofNEIPlA4z
wVD3zdZyQEYzG5laQ1OPoiHKw2zDM5E+ZUBUQa+UmadAB+2rTlnwluqZPBAP
y/bLhR4R0mukM10piulmXFlGGeuokhRR/UA1PJqrsG2uySkOeJV6W8QG2Cqu
A2nT7kJp4z+KONFyHQddomrC52g20crMR50nDaEwbcCYkjMeSnWJLy+mXql0
lOEop8VirGMpdy/S5M2eJ2mAYRq5vyU4IQ5TC+DYQg1OaMC+0tjDNmAHrdhE
S5eX0XnT2PGySbYFkuMxiEtJykPZzorzcI5mipga19eYpVFmiYGq3HRnW/CQ
aQlayoi6LkJxbHpgRzVSHJGUXCGBjgNCUZzE5Zi8boHh+iPh1fbgow05XsmE
aFXQlXx5LWnikSQOkqnUTMXt3nA2zpFnlpIk6Dq6g8m53WBKM9hgFaUF5Lck
EXnWmZT0ybKjGMQQU5glxKW3qJtygWGi5DTMCghaQKObV/A+SVsw351XIJ9I
SzXRjLgynMJBjhZUFXLSGFcW7LJnnrZnyxjR2TEnBIYRtz0jTwfZpw1jIbU1
ciM4yoRKvBWZTAsSW6w8DyaQPL/ubK+zAcTHQ8H3Oq7WWq6K9YtUhckCy7nZ
rhbXrJtFI42JJNrCjwpPo1p+v2+8+bLUJxy4d7xaZS1AYCgIFLqhCRR6nblQ
HjJMiOfA9Doq8xdb9H2ztZVEbTKgVSSy9ilj+X+MHqNAfKtyPgu8UvmfIEjG
VUBdZgynlmsuDvVhYxELFjnC/EGQ1wGu3BQdaLZnbSoalF4tR9VmSIzdYHtL
0K1qnoyEzSRfKfi5Dp9mdng54L+luU+GlYNjTEtFCpLxcGXzyHMnabEqrFj2
cKzdNgHLSPZA158VgiIO/YiTNDgmTwVm8yWxcUEi8eNtln8inVkVDR0u7tjL
j8fnzlqjBIMg9ClBhJtbTDx2FBMIMzSHYfNXAKNCqakHfNqS2vnDDqn+w3R3
GF6n3FHb+UhkmNHEAtNshF4Qi6T4EIGAunMKw3FAO+afKemVBOHqCmC2w/hB
D1Qx3GPd76WEGqnY33zlLJdbiotpAs9MRXGJbUcsOwam5AIKzHweOWAkSqm4
asa/p8Z0FXqmbM4lMYztWJMmqXNlUi0OcnWZQWHMk4RDLzWDQRd/LrGMKtw8
xFAqlZ7gr+wKGxXaCSFiJjbBKnZeT9J6+UsqqkfKORVS0hKWLX4L2bP768JS
hPYoJaTYMVV0P8zM4/R7M0Bt682K3anHfXPZJIvZDiLkZXyQW2giVq5KPeua
iM/gOBJND8YYmaHYU3n5JNT/KMMDLUhKIyU5keokMs2lQDdrwNLOskZ9J8J5
OTsVDTLyVBRPhIaBKceFUba5OkDXPL5KRdkQuZtPocCu4/dT3qA8BEo2RBYc
4/DqoptTKjwpF/AxBIJdGigRRhpCNdnJnCat2tCzJf+cWkgF24xzVF1EJlof
wBEjb+ZGE6IosEGdleFL8LtQXG0pKzqXwjPeKgiY2/gpLtwZmZ9WhBMczFK6
U3ZBbtsqsTZsFILNngx9WkJXCSNQdb2vpvniY1Qwx9yaFRfBK+S6gLZGqcFG
0VSrJPalOnU8Bn6j05t1je187N/NyrKr2T0IH5FUwkH7GHEI+ryn8u34oop7
jkGEZJ6C8rX28QfwzT8ySTtGS2VBkjiU68FkksqJolQj/hbdWznPq4olvjpW
pMyqN8SBMK6VpaX8mMyJSHyl11Ibjx02pLMRxaoyXXE4LxvVcEmsp+ZFCeb4
Q1J4lerRN24xlmIMPFzybYqsPsdQAo6ocgvFAU3ittpWdoKYjvJVsg2VLGrS
05jNnMSkKCPFWBnfd/U2W7jH6W3JtpPJbQJhv/ZjOtaJZCglOmaLNJAJxwRy
Ci3TzsLKEXZyhtm6XH+qO3VRUFG6X/rJFRum8AYVn0pyC2y7arr2VO4H3Erq
w6XtDQifqUcR0uT3w1BvEqf8JQpE2FrNMztFp1asqkIbHKJL07z2QLhEnN1w
oQhlK5JFkFKtlU9xICAVp4hJN1Hh+lbOWKaltGt6h+ucwkEiVlocM8287p87
My+ch6oqZDY7APVqf551OAPR0IXTHQkex0R80LKi0J1g7s0MaB6maBGS6sRQ
zsq3EQbz830q3mFhoYq2xFvmubE/36imgyRv0MWixOfE5QDSfkYi4Fc4B8nC
Zi+guDGrHfpQ53qMNxL4d/jisMUypVcSVii211ReYL4BK52HsxkCrx8okTSm
Rp4KaVVtY1DFVnHCOpygQAaJq4+2d1VVEVSjyIrcFzKjU9ORAhM64px2GVEn
2WtOrQeQ4icUk6k8HehTg8uUqOa4usxjgEm9BrrbI77lZsnS8oTi8Dj0Ed3I
NJ5I9wj4/b3DQ2rO9id/5/yZjuacou3wT5qiWd9z5M+fzjE8qZ0hifgTuKL0
NoBR8V+qmKnzZ+XPGv9R/6v/bH3wZ+kvNRjSGXaOaQ2WMRwfdF9XnV6v6nQv
4f+H8ODUSVf8wXGMf/1PxJMa7P7fYZVUhIQawfxLzmMnHSveMQ7Bqh9MHuaj
PW6LR9OimfZl5aVZ7ahSuVqNEvPHR3ViQY81Ga0mhskQvz4F/lypnC3ZM1z4
Y081E7RlJXzh+chPYEXF5nl8oavDduz80WzSeabxYr7fCMVMpj2CzUahw0zX
HhUqhF2FKRCFg+3Jl9XPWg7yS+ZNU9xzjL1cVQ18egNf0IhSLSn6/O8gWlj1
qdJK8dZKcTCjlHesqwyROZd65uh/MWdzc8MatM8of53rYidgNKMATD0WV/LL
ZA57ddF28vcdMnSMk51fKw78kPx6jFtk96U795HKuQtVyUd1onz5yy68+ctk
8muw68LfJ+rjgTtDLrVajLzoSfy09D1sbpkyb+vNOsDZHnKMgYYg41BZWz73
cOKVDr87mf8KpwqwBBL23x20vc9VhQyJmwSuxaxtuooI2hkAofO9Te6q+Cen
rYtrxFqC6ivFahW7Mzrd7tlgcHaKl487WLKOEaQvwBLhTGjQR03RJUeaozVJ
+qrfG55wak6+jjbRkUshOA/Tr52SIVKiRbilyFoq2rxxN9jWR1GCJ8AMnqZM
A4geNTtigdUPfKoAgyTSiK7XM6DuZdX9BuYCd3ABn+Df0HHEEor1x+AzscFn
ChjLFkbS0INl+k2Ucoo/nWbxN9zdqeSbVvE3prSd5UiYTMwd5hlAcxVPALpB
GHHeR5hhQqLvUgFukQAUsAmPGrXDg9bzFwJxFFtgvDsgT1cm0XM072AmddRs
HWLbs+IxYcQjHPdg74DGRdJINky8Wudi88HKXvZgWPKQkltQUrIc3/1jR7ci
xzyrt+SSjDOV+tPK1vgOuy0LPMQwmGp+id5w+q2wlfrTupqV6TIG4VFLKJV1
4KtAK0zTzFbex19vvHt3wnibK8qtRpNVp7G8sgDn01FzOjl4wf99Pjra2z86
OmweHDU+OU+4L+e3Zmuvtn9w+L3+7fnRi9r3p3TKn/QX8LZ+F16tw0tP0xeO
Wq3x0fPGvn5lr9Gov2g0zFdozqNJc6pfgunqL/BP9rXmNPPnuf3Rk9Yv8Wr5
6+H+L7v4v7Xm0+wIgDT2/zUa20aA70tASuXwNFj/pTA14QlqSRhi5R6yN4HM
AAz8afYAjD3IEdQb/CElXhd96VpHt6++q0q9ef0JWqfIGYmXzgLm833r7GER
PID0On5wBFjAwd7YXnijQab9aPvnjQzy+QHVc4Oj4boqWMFoQSqHNErIAOxF
9qN0MrQkwGWlJhiT0rN/3HUqwLVmwbO9FC1s3Pu56dSczKM9G1eKptDDPckO
Z12G/Jet0i9bD3y5V/rl3j99gf4/QNHYeWv7RtN7liETW7/aLwXPvgIP8Av5
Xr37VNlOH0K2TyztqKdUipRRW5p2oBlOxGLqB6OpQf2fnPuhmdOb5HyCO/mJ
5Yp/dlZCDPjzQ7O79/nZ6TQbj5m1sd8qn031H+MtihuCfEpTlEDJQuy0xxiI
P/cmM8lb//aST8Sb/H1n6s5jb+d72tZRskmCW+fUH986r91oiRbT/tyNfOeN
v4rvXFCg2ZrUW6DF7CpxI26/RhSfKmahTVN8qr6qqguSC/Z2Uc0n52JntJ0N
Q5w6ZvMg/Np2IxB8XrkqDIlFE7zKU9AKKfM/lGZRRuXAyv8DJK/1aGsRAQA=

-->

</rfc>
