<?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.6.36 (Ruby 3.2.2) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-meenan-httpbis-compression-dictionary-00" category="info" submissionType="independent" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.17.4 -->
  <front>
    <title abbrev="compression-dictionary">Compression Dictionary Transport</title>
    <seriesInfo name="Internet-Draft" value="draft-meenan-httpbis-compression-dictionary-00"/>
    <author initials="P." surname="Meenan" fullname="Patrick Meenan">
      <organization>Google LLC</organization>
      <address>
        <email>pmeenan@google.com</email>
      </address>
    </author>
    <author initials="Y." surname="Weiss" fullname="Yoav Weiss">
      <organization>Google LLC</organization>
      <address>
        <email>yoavweiss@google.com</email>
      </address>
    </author>
    <date year="2023" month="June" day="30"/>
    <area>Applications and Real-Time</area>
    <workgroup>HTTP</workgroup>
    <keyword>compression dictionary</keyword>
    <keyword>shared brotli</keyword>
    <keyword>zstandard dictionary</keyword>
    <abstract>
      <?line 48?>

<t>This specification defines a mechanism for using designated <xref target="HTTP"/> responses
as an external dictionary for future HTTP responses for compression schemes
that support using external dictionaries (e.g. <xref target="Brotli"/> and <xref target="Zstandard"/>).</t>
    </abstract>
    <note removeInRFC="true">
      <name>About This Document</name>
      <t>
        The latest revision of this draft can be found at <eref target="https://pmeenan.github.io/i-d-compression-dictionary/draft-meenan-httpbis-compression-dictionary.html"/>.
        Status information for this document may be found at <eref target="https://datatracker.ietf.org/doc/draft-meenan-httpbis-compression-dictionary/"/>.
      </t>
      <t>
        Discussion of this document takes place on the
        HTTP Working Group mailing list (<eref target="mailto:ietf-http-wg@w3.org"/>),
        which is archived at <eref target="https://lists.w3.org/Archives/Public/ietf-http-wg/"/>.
      </t>
      <t>Source for this draft and an issue tracker can be found at
        <eref target="https://github.com/pmeenan/i-d-compression-dictionary"/>.</t>
    </note>
  </front>
  <middle>
    <?line 54?>

<section anchor="introduction">
      <name>Introduction</name>
      <t>This specification defines a mechanism for using designated <xref target="HTTP"/> responses
as an external dictionary for future HTTP responses for compression schemes
that support using external dictionaries (e.g. <xref target="Brotli"/> and <xref target="Zstandard"/>).</t>
      <t>This document describes the HTTP headers used for negotiating dictionary usage
and registers media types for content encoding Brotli and Zstandard using a
negotiated dictionary.</t>
    </section>
    <section anchor="dictionary-negotiation">
      <name>Dictionary Negotiation</name>
      <section anchor="use-as-dictionary">
        <name>Use-As-Dictionary</name>
        <t>When responding to a HTTP Request, a server can advertise that the response can
be used as a dictionary for future requests for URLs that match the pattern
specified in the Use-As-Dictionary response header.</t>
        <t>The Use-As-Dictionary response header is a Structured Field <xref target="RFC8941"/>
sf-dictionary with values for "match", "ttl" and "hashes".</t>
        <section anchor="match">
          <name>match</name>
          <t>The "match" value of the Use-As-Dictionary header is a sf-string value that
provides an URL-matching pattern for requests where the dictionary can be used.</t>
          <t>The sf-string is parsed as a URL <xref target="RFC3986"/>, and supports absolute URLs
as well as relative URLs. When stored, any relative URLs MUST be expanded
so that only absolute URL patterns are used for matching against requests.</t>
          <t>The match URL supports using * as a wildcard within the match string for
pattern-matching multiple URLs. URLs with a natural * in them are not directly
supported unless they can rely on the behavior of * matching an arbitrary
string.</t>
          <t>The "match" value is required and MUST be included in the Use-As-Dictionary
sf-dictionary for the dictionary to be considered valid.</t>
        </section>
        <section anchor="ttl">
          <name>ttl</name>
          <t>The "ttl" value of the Use-As-Dictionary header is a sf-integer value that
provides the time in seconds that the dictionary is valid for (time to live).</t>
          <t>This is independent of the cache lifetime of the resource being used for the
dictionary. If the underlying resource is evicted from cache then it is also
removed but this allows for setting an explicit time to live for use as a
dictionary independent of the underlying resource in cache. Expired resources
can still be useful as dictionaries while they are in cache and can be used for
fetching updates of the expired resource. It can also be useful to artificially
limit the life of a dictionary in cases where the dictionary is updated
frequently, to limit the number of possible incoming dictionary values.</t>
          <t>The "ttl" value is optional and defaults to 31536000 (1 year).</t>
        </section>
        <section anchor="hashes">
          <name>hashes</name>
          <t>The "hashes" value of the Use-As-Dictionary header is a inner-list value
that provides a list of supported hash algorithms in order of server
preference.</t>
          <t>The dictionaries are identified by the hash of their contents and this value
allows for negotiation of the algorithm to use.</t>
          <t>The "hashes" value is optional and defaults to (sha-256).</t>
        </section>
        <section anchor="examples">
          <name>Examples</name>
          <section anchor="path-prefix">
            <name>Path Prefix</name>
            <t>A response that contained a response header:</t>
            <t>Use-As-Dictionary: match="/product/*", ttl=604800, hashes=(sha-256 sha-512)</t>
            <t>Would specify matching any URL with a path prefix of /product/ on the same
<xref target="Origin"/> as the original request, expiring as a dictionary in 7 days
independent of the cache lifetime of the resource, and advertise support for
both sha-256 and sha-512 hash algorithms.</t>
          </section>
          <section anchor="versioned-directories">
            <name>Versioned Directories</name>
            <t>A response that contained a response header:</t>
            <t>Use-As-Dictionary: match="/app/*/main.js"</t>
            <t>Would match main.js in any directory under /app/, expiring as a dictionary in
one year and support using the sha-256 hash algorithm.</t>
          </section>
        </section>
      </section>
      <section anchor="sec-available-dictionary">
        <name>Sec-Available-Dictionary</name>
        <t>When a HTTP client makes a request for a resource for which it has an
appropriate dictionary, it can add a "Sec-Available-Dictionary" request header
to the request to indicate to the server that it has a dictionary available to
use for compression.</t>
        <t>The "Sec-Available-Dictionary" request header is a Structured Field <xref target="RFC8941"/>
sf-string value that contains the hash of the contents of a single available
dictionary calculated using one of the algorithms advertised as being supported
by the server.</t>
        <t>The client MUST only send a single "Sec-Available-Dictionary" request header
with a single hash value for the best available match that it has available.</t>
        <section anchor="dictionary-freshness-requirement">
          <name>Dictionary freshness requirement</name>
          <t>To be considered as a match, the dictionary must not yet be expired as a
dictionary. When iterating through dictionaries looking for a match, the
expiration time of the dictionary is calculated by taking the last time the
dictionary was written and adding the "ttl" seconds from the
"Use-As-Dictionary" response. If the current time is beyond the expiration time
of the dictionary, it MUST be ignored.</t>
        </section>
        <section anchor="dictionary-url-matching">
          <name>Dictionary URL matching</name>
          <t>When a dictionary is stored as a result of a "Use-As-Dictionary" directive, it
includes a "match" string with the URL pattern of request URLs that the
dictionary can be used for.</t>
          <t>When comparing request URLs to the available dictionary match patterns, the
comparison should account for the * wildcard when matching against request
URLs. This can be accomplished with the following algorithm which returns TRUE
for a successful match and FALSE for no-match:</t>
          <ol spacing="normal" type="1"><li>Let MATCH represent the absolute URL pattern from the "match" value for the
given dictionary.</li>
            <li>LET URL represent the request URL being checked.</li>
            <li>If there are no * characters in MATCH:
  a. If the MATCH and URL strings are identical, return TRUE.
  b. Else, return FALSE.</li>
            <li>If there is a single * character in MATCH and it is at the end of the
string:
  a. If the MATCH string is identical to the start of the URL string, return
  TRUE.
  b. Else, return FALSE.</li>
            <li>Split the MATCH string by the * character into an array of MATCHES
(excluding the * deliminator from the individual entries).</li>
            <li>Pop the first entry in MATCHES from the front of the array into PATTERN.
  a. If PATTERN is identical to the start of the URL string, remove the
  beginning of the URL string until the end of the match to PATTERN.
  b. Else, return FALSE.</li>
            <li>If there is not a * character at the end of MATCH:
  a. Pop the last entry in MATCHES from the end of the array into PATTERN.
  b. If PATTERN is identical to the end of the URL string, remove the end of
  the URL string to the beginning of the match to PATTERN.
  c. Else, return FALSE.</li>
            <li>Pop each entry off of the front of the MATCHES array into PATTERN. For
each PATTERN, in order:
  a. Search for PATTERN in URL from the beginning of URL and stop at the first
  match.
  b. If no match is found, return FALSE.
  c. Remove the beginning of the URL string until the end of the match to the
  first occurrence of PATTERN.</li>
            <li>Return TRUE.</li>
          </ol>
        </section>
        <section anchor="multiple-matching-dictionaries">
          <name>Multiple matching dictionaries</name>
          <t>When there are multiple dictionaries that match a given request URL, the client
MUST pick the dictionary with the longest match pattern string length.</t>
        </section>
      </section>
    </section>
    <section anchor="negotiating-the-compression-algorithm">
      <name>Negotiating the compression algorithm</name>
      <t>When a compression dictionary is available for use for a given request, the
algorithm to be used is negotiated through the regular mechanism for
negotiating content encoding in HTTP.</t>
      <t>This document introduces two new content encoding algorithms:</t>
      <t>"br-d" - Brotli using an external compression dictionary.
"zstd-d" - Zstandard using an external compression dictionary.</t>
      <t>The dictionary to use is negotiated separately and advertised in the
"Sec-Available-Dictionary" request header.</t>
      <section anchor="accept-encoding">
        <name>Accept-Encoding</name>
        <t>The client adds the algorithms that it supports to the "Accept-Encoding"
request header. e.g.:</t>
        <t>Accept-Encoding: gzip, deflate, br, zstd, br-d, zstd-d</t>
      </section>
      <section anchor="content-encoding">
        <name>Content-Encoding</name>
        <t>If a server supports one of the dictionary algorithms advertised by the client
and chooses to compress the content of the response using the dictionary that
the client has advertised then it sets the "Content-Encoding" response header
to the appropriate value for the algorithm selected. e.g.:</t>
        <t>Content-Encoding: br-d</t>
      </section>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <section anchor="content-encoding-1">
        <name>Content Encoding</name>
        <t>IANA will add the following entries to the "HTTP Content Coding Registry"
within the "Hypertext Transfer Protocol (HTTP) Parameters" registry:</t>
        <t>Name: sbr
Description: A stream of bytes compressed using the Brotli protocol with an
external dictionary</t>
        <t>Name: szstd
Description: A stream of bytes compressed using the Zstandard protocol with
an external dictionary</t>
      </section>
      <section anchor="header-field-registration">
        <name>Header Field Registration</name>
      </section>
    </section>
    <section anchor="compatibility-considerations">
      <name>Compatibility Considerations</name>
      <t>To minimize the risk of middle-boxes incorrectly processing
dictionary-compressed responses, compression dictionary transport MUST only
be used in secure contexts (HTTPS).</t>
    </section>
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <t>The security considerations for <xref target="Brotli"/> and <xref target="Zstandard"/> apply to the
dictionary-based versions of the respective algorithms.</t>
      <section anchor="changing-content">
        <name>Changing content</name>
        <t>The dictionary must be treated with the same security precautions as
the content, because a change to the dictionary can result in a
change to the decompressed content.</t>
      </section>
      <section anchor="reading-content">
        <name>Reading content</name>
        <t>The CRIME attack shows that it's a bad idea to compress data from
mixed (e.g. public and private) sources -- the data sources include
not only the compressed data but also the dictionaries. For example,
if you compress secret cookies using a public-data-only dictionary,
you still leak information about the cookies.</t>
        <t>Not only can the dictionary reveal information about the compressed
data, but vice versa, data compressed with the dictionary can reveal
the contents of the dictionary when an adversary can control parts of
data to compress and see the compressed size. On the other hand, if
the adversary can control the dictionary, the adversary can learn
information about the compressed data.</t>
      </section>
      <section anchor="security-mitigations">
        <name>Security Mitigations</name>
        <t>If any of the mitigations do not pass, the client MUST drop the response and
return an error.</t>
        <section anchor="cross-origin-protection">
          <name>Cross-origin protection</name>
          <t>To make sure that a dictionary can only impact content from the same origin
where the dictionary was served, the "match" pattern used for matching a
dictionary to requests MUST be for the same origin that the dictionary
is served from.</t>
        </section>
        <section anchor="response-readability">
          <name>Response readability</name>
          <t>For clients, like web browsers, that provide additional protection against the
readability of the payload of a response and against user tracking, additional
protections MUST be taken to make sure that the use of dictionary-based
compression does not reveal information that would not otherwise be available.</t>
          <t>In these cases, dictionary compression MUST only be used when both the
dictionary and the compressed response are fully readable by the client.</t>
          <t>In browser terms, that means that both are either same-origin to the context
they are being fetched from or that both include an
"Access-Control-Allow-Origin" response header that matches the "Origin" request
header they are fetched from.</t>
        </section>
      </section>
    </section>
    <section anchor="privacy-considerations">
      <name>Privacy Considerations</name>
      <t>Since dictionaries are advertised in future requests using the hash of the
content of the dictionary, it is possible to abuse the dictionary to turn it
into a tracking cookie.</t>
      <t>To mitigate any additional tracking concerns, clients MUST treat dictionaries
in the same way that they treat cookies. This includes partitioning the storage
as cookies are partitioned as well as clearing the dictionaries whenever
cookies are cleared.</t>
    </section>
  </middle>
  <back>
    <references>
      <name>Informative References</name>
      <reference anchor="Brotli">
        <front>
          <title>Brotli Compressed Data Format</title>
          <author fullname="J. Alakuijala" initials="J." surname="Alakuijala"/>
          <author fullname="Z. Szabadka" initials="Z." surname="Szabadka"/>
          <date month="July" year="2016"/>
          <abstract>
            <t>This specification defines a lossless compressed data format that compresses data using a combination of the LZ77 algorithm and Huffman coding, with efficiency comparable to the best currently available general-purpose compression methods.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="7932"/>
        <seriesInfo name="DOI" value="10.17487/RFC7932"/>
      </reference>
      <reference anchor="Zstandard">
        <front>
          <title>Zstandard Compression and the 'application/zstd' Media Type</title>
          <author fullname="Y. Collet" initials="Y." surname="Collet"/>
          <author fullname="M. Kucherawy" initials="M." role="editor" surname="Kucherawy"/>
          <date month="February" year="2021"/>
          <abstract>
            <t>Zstandard, or "zstd" (pronounced "zee standard"), is a lossless data compression mechanism. This document describes the mechanism and registers a media type, content encoding, and a structured syntax suffix to be used when transporting zstd-compressed content via MIME.</t>
            <t>Despite use of the word "standard" as part of Zstandard, readers are advised that this document is not an Internet Standards Track specification; it is being published for informational purposes only.</t>
            <t>This document replaces and obsoletes RFC 8478.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="8878"/>
        <seriesInfo name="DOI" value="10.17487/RFC8878"/>
      </reference>
      <reference anchor="HTTP">
        <front>
          <title>Hypertext Transfer Protocol (HTTP/1.1): Message Syntax and Routing</title>
          <author fullname="R. Fielding" initials="R." role="editor" surname="Fielding"/>
          <author fullname="J. Reschke" initials="J." role="editor" surname="Reschke"/>
          <date month="June" year="2014"/>
          <abstract>
            <t>The Hypertext Transfer Protocol (HTTP) is a stateless application-level protocol for distributed, collaborative, hypertext information systems.  This document provides an overview of HTTP architecture and its associated terminology, defines the "http" and "https" Uniform Resource Identifier (URI) schemes, defines the HTTP/1.1 message syntax and parsing requirements, and describes related security concerns for implementations.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="7230"/>
        <seriesInfo name="DOI" value="10.17487/RFC7230"/>
      </reference>
      <reference anchor="Origin">
        <front>
          <title>The Web Origin Concept</title>
          <author fullname="A. Barth" initials="A." surname="Barth"/>
          <date month="December" year="2011"/>
          <abstract>
            <t>This document defines the concept of an "origin", which is often used as the scope of authority or privilege by user agents.  Typically, user agents isolate content retrieved from different origins to prevent malicious web site operators from interfering with the operation of benign web sites.  In addition to outlining the principles that underlie the concept of origin, this document details how to determine the origin of a URI and how to serialize an origin into a string.  It also defines an HTTP header field, named "Origin", that indicates which origins are associated with an HTTP request. [STANDARDS-TRACK]</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="6454"/>
        <seriesInfo name="DOI" value="10.17487/RFC6454"/>
      </reference>
      <reference anchor="RFC3986">
        <front>
          <title>Uniform Resource Identifier (URI): Generic Syntax</title>
          <author fullname="T. Berners-Lee" initials="T." surname="Berners-Lee"/>
          <author fullname="R. Fielding" initials="R." surname="Fielding"/>
          <author fullname="L. Masinter" initials="L." surname="Masinter"/>
          <date month="January" year="2005"/>
          <abstract>
            <t>A Uniform Resource Identifier (URI) is a compact sequence of characters that identifies an abstract or physical resource.  This specification defines the generic URI syntax and a process for resolving URI references that might be in relative form, along with guidelines and security considerations for the use of URIs on the Internet.  The URI syntax defines a grammar that is a superset of all valid URIs, allowing an implementation to parse the common components of a URI reference without knowing the scheme-specific requirements of every possible identifier.  This specification does not define a generative grammar for URIs; that task is performed by the individual specifications of each URI scheme. [STANDARDS-TRACK]</t>
          </abstract>
        </front>
        <seriesInfo name="STD" value="66"/>
        <seriesInfo name="RFC" value="3986"/>
        <seriesInfo name="DOI" value="10.17487/RFC3986"/>
      </reference>
      <reference anchor="RFC8941">
        <front>
          <title>Structured Field Values for HTTP</title>
          <author fullname="M. Nottingham" initials="M." surname="Nottingham"/>
          <author fullname="P-H. Kamp" surname="P-H. Kamp"/>
          <date month="February" year="2021"/>
          <abstract>
            <t>This document describes a set of data types and associated algorithms that are intended to make it easier and safer to define and handle HTTP header and trailer fields, known as "Structured Fields", "Structured Headers", or "Structured Trailers".  It is intended for use by specifications of new HTTP fields that wish to use a common syntax that is more restrictive than traditional HTTP field values.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="8941"/>
        <seriesInfo name="DOI" value="10.17487/RFC8941"/>
      </reference>
    </references>
    <?line 331?>



  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA+Va3W/cuLV/519BTB6aBNbY+dzsAAvU9TrdAElq2N676C36
wJE4M7zWSCpJeTIb5H/v+SApSjPOJkXfLtBtPJJ4eL7P7xyyKApRtpVp1gvZ
+1XxRghvfK0X8qLddlY7Z9pG/mxKD/8qu5e3VjWua60Xarm0+n4hy+HDokof
ilJ5vW7tfiFNs2qFqNqyUVsgXFm18sVW60Y1xcb7bmlccZxIcXYmXL/cGnrh
951GapXuNPxf46V8JFXt2oWcvbu8fTs7gX/P/wL/tBb+uoYnoum3S20XogJu
FuJR2TZON653C+ltrwWwfyaU1QpInHddbYBr2MlJ1VTyWqu6uDVbPRO71t6t
bdt38N0vt7dXM3Gn9/CwWghZ5BqQmQbgjdsA8Uoubetrgw9+dx5IK1vlH97r
pgfupBxvISVLPPsNdgcLyb/ia3y+VaaG50aDxVCDxW79592LeWvX+FbZcgNv
8YVbnJ7Wxnk359en5/DO3Gt3etUvQdrTnMQpLl4bv+mXsLxjC52aonrAOvh5
DXp1PtstLJsznblpv0Lg9DtcYb7x23omhOr9prWorAL+k+AOYMurufxAROgR
u9mV8taUd/kLUMBC/rVt17WW799f0DPNugxs/3lNb+fAw3iHv8/lbxrcMNvg
7626zx5+hfgevtzhhzl5gWFht+Bv92T7v5CPLOT124sffnzxHJ78b/QVevjm
zQ9v4CG6Bn/0/MUZ/P6bNWvT0JPXL1+9hCfw14sf37xe8J9vfnz5bCFEURRS
LZ23qvRC3G6Mk67TpVkFj5eVXplGg+PLrS43qjFuK4E/2Tv0vEo7s27A1pX8
/BlZ+PJFgo06DCcnFMaL1J+8to2qM88mCqve91YT48MaepPHjSs3egu0/EZ5
6foOU0zY/JCwAQKP9Xw9B25Yb8APhuznz0lpX748mbPcW1NVtRbikXzXeNtW
PVH5/6QFkhQScL/FrAlilNYsYbXfBI42WlXaOtgKZEOmGsjd3oBSUOxBkt6p
tRa4h9VryCu4ZqsroyhVRXkaj9vohgtL8GziLPEVhFIibqTzjDhHY2VF52Pk
Bs326JH81eni3BXDF0L8ttFNUCxt6lswIsl2rf/VQ446gd9O23sNHIKdVAV/
eeO0JF2jJqJZ8L1YalYGWvUBW1omzFL/ev3eMSkI6XJDBDvl0WYi+BhQMw29
OOB/2JstQTb7hu+kQfZuoJaVyFIl3xpdowOEyP/yRbhVlkXlDtKyvFd1H4w1
I26xcnpfz8hGs41yG+1maATQNX3A7ISPeb1sVw/IkrMGu0PSQYPwItSQ6Gx7
bypN8QJ6K4gsfhMURpwl7e422mraKpMDTRhMFHQ17AQbd8om48EOrBDMil++
nJCQIbYcJsW27r0mA2IM73Rd40Kra8rN9AKyP/qX8y0oGSnsx+/lh19vbpEh
/akD8roSrmVvaJt6P9okCglbWz0EXNKBWiuoOD7JH8Rjr8L1iXUOoacs5c7U
VYmBhRYObsZrglZgExG2HhS+7WtvujoKSaKQiygocuBRkG6eBqfdEr9NC/nD
WF36ei8CJyBB39SQwfAzNg0oZw+iExdLvVH3BkQEh3mayQkxaJcGKhKEL/M4
P+ZmxpEqDHo3Wi5q2jRl3VdfiamJ56OSJ04EOQIIISYEb0T6sKOpgt9DPAR2
KDK+z+cNpMA1/D7m9EjAA6pExp2G3Ss35KCMO6BF/BDnj2kFMFyDy6WUjv/L
4HDgrlRQReDDlaZF4Slkjra3JdoD1Z8cD96JLPPKd/x5DyRtvcdP00rYTt/D
p7jSttuwkcfIMJ5kBzAurN629wh6exSJntbtjtON094H40OkAACFdblkodhq
8mmRK+NQzKMcNszUXF5+6shl4isn0C+dNxDdnDhWPcX5qJzuNqbW7Mbo7ZEc
OV6WciiYQL3syX2H3YWLfOnJzqBSzyUHtJPtjRUKKhBgDwMa2ovabA07AZoO
qY0KD/Hi9AP5ENTMbFRiRZmjgQA9YbVGstwLIeGuBbixrCmI2u2kxnN1mB86
P+zRdvRVTQoBsKQgfzjc5cWzVy9en52dycfP5F4r+yREEdeSQCsUlu+JJdM0
2hbYwvAqRkZDAZH0CkgNuQh3AV1D7wmJbIsRAti8YsEZAEAs6hUosQHjMGsj
JyDLo6dxzV7uiU8iyzybBHK4USQvZ/YyX28G0BJlTVyhysAN5kcV8zU9P4aO
snj+6nXU7+UntYX87ejXI2x6NvIKpDOfhDgf0AJpDXmG2oJ5dIojoEM4sMOC
c/VPs9OOQfPpU8AJ4A8/vT57+ebs7CQY96fIE3a7xatnz58AGmt7gCGMe/Z5
zt9TCQslpkNuO+IWNZT2iZXDQZ8lPn/mFgexLSfPln6DcmxEdhRytIE7CJof
ZKX2Tnx3nmScMMDEiMYx9JctMB6lJjjBkk99bx7M8j+Ak4Ej0PzPVDtb9LP/
ooFU150+PYVms5n/n5tF9XP5D09RFaj+KjCw5/wpae1XNSiAcYrpHDgF8EFW
CnoYy06iyxtdFuf30AQryDaHeD0g9LI2aJatuqOQDmalIFJDbsefkJ9BJMhn
G+q2BDBv285i/5AxfYJfMMhHVc4e4mKWtmIlC98GF+Cn8BPcBntDKlAkLHcQ
ZK7IRq4uFbeBBQIL2aTDixH/rSx9G8A/gNjRldw0dQ2Ji+oLGhF4TVyLEcSu
y76mzoyNjX4wTWRuiBCC2wwuUjIWIXmy2oLwwdwE5AgeO42RFpn5dnOFNBLW
kZSsgoj1lvjxYJLYmWW2i+9COs2qEJRRt2kQ1Qb4ib0zCDDFjOQBRPlkWpS3
PWyPiHmvfWgOTFwywly/MYTSlhtuv7Ftv96Mq1LdtncBx482FESVy0yex8bg
IDMmmkTdxeitlYsQbAQE5Q57IbCxxzilTFjFNQwKInYlKIiLZwcZapbSWMKV
ZW8tWp8RMDrMvqUSGtQzCCIOBKG4Tvh/3WAzdmg4LDCx4qQ8M9YG93FsOuAQ
iiuHwzEJOGECNsXdReg6cGFsU0LwkTMSoBl6PKQafXYYEEwUPcGV88AzJg1l
Gd3mFDgPDU6d+xv5d+wv2TsCGYfDpQ2VBVWWbd/4FCRPs94RN36oExXcI1Lj
EXhGUgA/DMCAalDAqkUQRBQS3uHEbTUkMUhKt9e/Xgp2ZNeXAM4dAmJmH33t
7fn7m0sGUS03q1D/ns3le4ijD+e3F78AJcyo5EiojSP9dfLLST8Ze541mLQZ
zZyewwaXt0RjTD4zQEhwABzKO3S+F9GxATNyfwz6LDcK56w4HIOqSwzjNFal
IGAZUFJq6MmBctwJ0XoSlEW6msPqJfQ0tdPpOeloLl5mDHD3ydkw4yIxQTuG
To0lw8TLYYbzambkGKvDZCUxmCqihy4mgfkkTuST5uB/JMSrubwBN/KHO4b6
MZYGOyecHli1x41pweUN7vRYf8L4jInqKWBn7H8a5XFsFx0Cizr0Dz0IAcJg
dgU4/Xour9qOHdhY5+nVPunu8mZYD38MKJLZIKauzm9vL68/zpMCw4Pv1Rv2
z9EmoDMNaLehAjz9GDAcNLQTS8YyN+LnAcX/MPYerFVqpOyxn+SuHJVFBeRh
XWV8HdfU8g81lZE4rqfwBatroqFA40CJx5RUHlfSGxZWQ7sQBG1Xq0hn5AtR
+iOSyrfQN+CREFIJD09Sbxp0eqPx7I5SVFIIjUgHfY4EwTcEyj3wF0xFzsuq
IBkHHUNuYqkNNqgA/6eCkgauB7X+556XnJdDqS257JeETpLGf8TdsiRHlfxD
HEmmOpTDoFAch4SbJpgjsJQN4pXkTJ8lcQZqDEMF4YkOTwonqCnVs7pt1rhy
VF6jHmrdrP2GDiw+ZmcmDLWHg51UCRMiOX5oTLk51fY4DeNSOZKDq/tooBBB
BAbycKoSwSQXsjWAQDs+3BL5Wc/B4Q34H/ZoB4dIJhylobJ3LWy4O1w7dAlQ
vmdLW1QzWcTjoHAAlJ2YHdfIXMx+d77itQfnR9+wfDzg2YfRy0RLTgNKgr9w
WJ+3/XG8LL65K+HG9xxQTeeLy6CKUeMDSNpNu6jYlKThfshbswmhmZjsJvEA
ENQ7+W4h17+b7gRnR4j6T+TSnuDlgwr/Kir+u6iI1wu2W8bsu9VwWJY4ytq/
vOE92gmGsh1CjKanm7bF6SXIFQ2V96PZ9IXHHsN8ITcdDtIHwtzCDbvGSbTT
nonPpqLNpnOV2PLng4RxDzmEmNO1xuF30vmU+oJ0SwfN5x/PUa/UJPKVklzV
MlM1frnDqTQOK8bwOYCT5As0LIkkLjjGrukcFi9jZAc/s1/2HSgFQoPv66zA
jlcQdm3Z1vIxknkir8DftxpB6iwc5to9yPSR7ja4pRU/0zExDSIX8hzznVZb
tNNyj9PuaMU0HsCNQ2x3cS/u0Btx5FQ8bYWe+B9tNiSD0X7i+Ck86f8XHqrw
ECWoLh4r040n+LE0gET3B9aDxh+AJIDJ37k4Qk91hwzy7YJi2X7Sjubplk/H
kCnsbNDK2Y2mTJJ0DeDkoWLg42WrYViSDqb59AjPoSmEPoHLk2VvaDSMk7fe
HpWDxjHhZTl6ST7/D7bhPykP/iPp+J8YIvU+FvdMoqVCdu55xOnyQOa+eToP
lRdQe9ZZsTnI0DQ3ATnRCXzeWeJAeGAeNFaqPtzXciLLJpDk8BWeIyGWhfId
Y2jSd4fmH2ejYvKhziwVyDL71+BDB9xfXL/7cAkQzCsAEtBo71JK/xM2ZUtV
Ia5Vo/RXKa8I2Imt+QS78F2Oji5mkfYhH92DAp7IcIQli4J5w4XxWZhICMTu
NE3LoQfeqsCP8SyOjp9GOoDcQrgUwoVOEU6EWcl92w8sgq4BIsLv9g4TUSi6
gccCSRe0ZzajEUiAz9lqre5kuuaEKGjZ9j4wSBRBox8j32iPiYmsvtcQxA+R
iDLi7T51QkLeG8CY6IvwmyTPNJHc6MAJcJfcf9yRQkezkXhxxMW1uMBC4gH0
QKuIlZGVCZ9rPTWLgzwyl39jkVvEs1DNEJKbFXFyfJvpPOzwS9A5NN1/pDHS
TRrRczh9MN6sY5ZABNDsE64fXgECpDaxU87lOJozVGVDV5jKLMgkQpeBedna
1gagf2Fb5wo+zKEMruO9rJaOAgB52DDNVlOTkcMYSNelTwgitUiUJZiuOHpY
iqNNQjfVyWhAFKH9kUsZYgwg0+WUOI2MaCHbWx451Bcm7kzsBk1cR2VBvqsU
1x8hMDBZt6Do2oBCdnqJV0l3QIF0P5yE0nQ2HBkOqkwTPMzYGe1o1k7t61ZV
PPvMLZYWgiYsVqHyjlruYRcx7DIowYPVGlTPxHy4FyZj2GdaN8So8rWaZxBH
4p4I7WiASZkOI2aH53JLPZriv6OIoktcVFlzx8m2Gg4fYj2l+KaDvcl8VoXx
9JHKTR3oqq/rfTAd9Gwj6MsMBZtJcK5tNNxWqybUCNoUKWlDeQB9KMZFqEah
xGNm4JsJPIakKwjxNkZrM3KhKiD2ohYCIu2Cc0hxjvCy4EPVAzycdc7hqsps
+JLHwOnDwErOBEGPKyxb5SHyuDE4ADg4ah/3WtO7dQPcy06xxKRrmBwR4AWw
eMMBZ4XL3h3kAFQsJiWa6dNlwejmoTbNA+SjzKcpG2ZBln0MQtG0PcQquxZB
l/HkwgyH2pCB9ik09uHjWBJ5wp4OGrCy0K7pvNW3lm5hulSXUY3pOz7YiNfY
SiwIB60U33XRjcbbEDkV+pxOVfDm7BKEFOLfOavz9CQwAAA=

-->

</rfc>
