<?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-01" 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-01"/>
    <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/519BTB6aBNY435sdYIG6XqcbIEkN23sXvUUf
OBJnhtcaUSUpj2eD/O89H6REacbZpOjbBbqNRxIPz/f5nUMWRSFKW5lmvZBd
WBVvhQgm1Hohz+22ddp7Yxv5sykD/KvcXt441fjWuiDUcun03UKWw4dF1X8o
ShX02rr9QppmZYWobNmoLRCunFqFYqt1o5piE0K7NL44TqR49lz4brk19CLs
W43UKt1q+L8mSPlIqtrbhZy9v7h5NzuBf8/+Av9YB39dwRPRdNuldgtRATcL
8ai0jdeN7/xCBtdpAew/E8ppBSTO2rY2wDXs5KVqKnmlVV3cmK2eiZ11t2tn
uxa+++Xm5nImbvUeHlYLIYtcAzLTALzxGyBeyaWzoTb44HcfgLRyVf7hnW46
4E7K8RZSssSz32B3sJD8K77G51tlanhuNFgMNVjs1n/evZxbt8a3ypUbeIsv
/OL0tDY++Dm/Pj2Dd+ZO+9PLbgnSnuYkTnHx2oRNt4TlLVvo1BTVA9bBz2vQ
qw/ZbnHZnOnMjf0KgdPvcIX5JmzrmRCqCxvrUFkF/CfBHcCWl3P5kYjQI3az
SxWcKW/zF6CAhfyrtetayw8fzumZZl1Gtv+8prdz4GG8w9/n8jcNbpht8Her
7rKHXyG+hy93+GFOXmBYuC342x3Z/i/kIwt59e78hx9fvoAn/5t8hR6+ffvD
W3iIrsEfvXj5DH7/zZm1aejJm1evX8ET+Ovlj2/fLPjPtz++er4QoigKqZY+
OFUGIW42xkvf6tKsosfLSq9Mo8Hx5VaXG9UYv5XAn+w8el6lvVk3YOtKfv6M
LHz5IsFGLYaTFwrjRer7oF2j6syzicKqC53TxPiwht7kcePLjd4CrbBRQfqu
xRQTNz8kbIDAYz1fz4Eb1hvwgyH7+XOvtC9fnsxZ7q2pqloL8Ui+b4KzVUdU
/j9pgSSFBNxtMWuCGKUzS1gdNpGjjVaVdh62AtmQqQZydzCgFBR7kKTzaq0F
7uH0GvIKrtnqyihKVUmeJuA2uuHCEj2bOOv5ikIpkTbSeUaco7GyovMpcYNm
e/RI/up1ceaL4QshftvoJiqWNg0WjEiyXel/dZCjTuC31+5OA4dgJ1XBX8F4
LUnXqIlkFnwvlpqVgVZ9wJaOCbPUv1598EwKQrrcEMFWBbSZiD4G1ExDLw74
H/ZmS5DNvuE7aZC9a6hlJbJUyXdG1+gAMfK/fBF+lWVRuYO0LO9U3UVjzYhb
rJwh1DOy0Wyj/Eb7GRoBdE0fMDvxY14v7eoBWXLWYHdIOmgQXoQaEq2zd6bS
FC+gt4LI4jdRYcRZr93dRjtNW2VyoAmjiaKuhp1g41a53niwAysEs+KXLyck
ZIwtj0nR1l3QZECM4Z2ua1zodE25mV5A9kf/8sGCkpHCfvxefvz1+gYZ0vct
kNeV8Ja9wTb1frRJEhK2dnoIuF4Haq2g4oRe/igeexWu71nnEHrKUu5MXZUY
WGjh6Ga8JmoFNhFx60Hh264Opq2TkCQKuYiCIgceBenmaXTaLfHbWMgfxuky
1HsROQEJuqaGDIafsWlAOXsQnbhY6o26MyAiOMzTTE6IQbc0UJEgfJnH+TE3
M55UYdC70XJJ06Yp6676SkxNPB+VPHEiyBFACDEheCPShx1NFf0e4iGyQ5Hx
fT5vIAWu4fcxp0cCAVAlMu417F75IQdl3AEt4oc4f0wrgOEaXK5P6fi/DA5H
7koFVQQ+XGlaFJ9C5rCdK9EeqP7e8eCdyDKvfM+fd0DS1Xv8tF8J2+k7+BRX
OruNGwWMDBNIdgDjwumtvUPQ26FI9LS2O043XocQjQ+RAgAU1uWSxWKryadF
roxDMY9y2DBTc3lx35LLpFdeoF/6YCC6OXGsOorzUTndbUyt2Y3R2xM5crws
5VAwgXrZk7sWuwuf+NKTnUGlgUsOaCfbGysUVCDAHgY0tBe12Rp2AjQdUhsV
HuLF6wfyIaiZ2ajEijJHAwF6wmpNZLkXQsKtBbixrCmI7HZS47k6zA+dH/aw
LX1Vk0IALCnIHx53efn89cs3z549k4+fy71W7kmMIq4lkVYsLN8TS6ZptCuw
heFVjIyGAiLpFZAachHuArqG3hMS2RYjBLB5xYIzAIBY1CtQYgPGYdZGTkCW
R0/jmr3cE59Elnk2PcjhRpG8nNnLfL0ZQEuStecKVQZuMD+qmK/p+TF0lMWL
12+Sfi/u1Rbyt6dfj7Dp2chLkM7cC3E2oAXSGvIMtQXz6BRHQIdwYIcF5+qf
Zqctg+bTp4ATwB9+evPs1dtnz06icX9KPGG3W7x+/uIJoDHbAQxh3LPPc/6e
SlgsMS1y2xK3qKF+n1Q5PPRZ4vNnbnEQ23LytPQblOMSsqOQow38QdD8ICu1
9+K78yTjhAEmJjSOob+0wHiSmuAESz71vXk0y/8ATgaOQPM/U+206Gf/RQOp
tj19egrNZjP/Pz9L6ufyH5+iKlD9VWRgz/lT0tqvalAA4xTTOXCK4IOsFPUw
lp1El9e6LM7uoAlWkG0O8XpE6GVt0CxbdUshHc1KQaSG3I4/IT+DSJDPNtRt
CWDe2dZh/5AxfYJfMMhHVc4e4mLWb8VKFsFGF+Cn8BPcBntDKlAkLHcQZK7E
Rq4ulbaBBQIL2aTDSxH/rSx9G8A/gNjJlfw0dQ2Ji+oLGhF47bkWI4hdl11N
nRkbG/1gmsj8ECEEtxlc9MlYxOTJaovCR3MTkCN47DVGWmLm280V00hcR1Ky
ChLWW+LHg0lSZ5bZLr2L6TSrQlBG/aZBVBvhJ/bOIMAUM5IHEOWTaVHedrA9
Iua9DrE5MGnJCHP9xhBKO264w8bZbr0ZV6Xa2tuI40cbCqLKZSbPY2NwkBkT
TaJuU/TWyicINgKCcoe9ENg4YJxSJqzSGgYFCbsSFMTFs4MMNevTWI8ry845
tD4jYHSYvaUSGtUzCCIOBKG47vH/usFm7NBwWGBSxenzzFgb3Mex6YBDKK4c
Dsck4IQJ2BR3F7HrwIWpTYnBR85IgGbo8ZBq8tlhQDBR9ARXziPPmDSUY3Sb
U+A8NDh17m/k36m/ZO+IZDwOlzZUFlRZ2q4JfZA8zXpH3PihTlRwj0iNR+QZ
SQH8MAADqkEBK4sgiCj0eIcTt9OQxCAp3Vz9eiHYkX1XAjj3CIiZffS1d2cf
ri8YRFluVqH+PZ/LDxBHH89uzn8BSphRyZFQG0f6694vJ/1k6nnWYNJmNHN6
ARtc3BCNMfnMADHBAXAob9H5XibHBszI/THos9wonLPicAyqLjGM01jVBwHL
gJJSQ08OlONOiNaTqCzS1RxWL6Gnqb3un5OO5uJVxgB3n5wNMy56JmjH2Kmx
ZJh4OcxwXs2MHGN1mKz0DPYVMUAX04P5XpzEJ83B/0iI13N5DW4UDneM9WMs
DXZOOD1wao8b04KLa9zpsb7H+EyJ6ilgZ+x/GhVwbJccAos69A8dCAHCYHYF
OP1mLi9tyw5snA/0at/r7uJ6WA9/DCiS2SCmLs9ubi6uPs17BcYH36s37J+T
TUBnGtBuQwV4+jFgOGhoJ5ZMZW7EzwOK/2HsPVir1EjZYz/JXTkpiwrIw7rK
+DquqeUfaiojcVxP8QtW10RDkcaBEo8pqTyupLcsrIZ2IQpqV6tEZ+QLSfoj
ksp30DfgkRBSiQ9P+t406vRa49kdpaheITQiHfQ5EgTfECgPwF80FTkvq4Jk
HHQMuYmlNtigAvyfCkoauBrU+p97Xu+8HEq25LJfEjrpNf4j7pYlOarkH9NI
sq9DOQyKxXFIuP0EcwSWskG8kpzpsyTOQI1hqCA80eJJ4QQ19fWsts0aV47K
a9JDrZt12NCBxafszISh9nCw01fCHpEcPzSm3NzX9jQN41I5koOr+2igkEAE
BvJwqpLAJBeyNYBANz7cEvlZz8HhDfgf9mgHh0gmHqWhsncWNtwdrh26BCjf
s6Urqpks0nFQPADKTsyOa2QuZr/7UPHag/Ojb1g+HvDs4+hloiWvASXBXzis
z9v+NF4W39yVcON7BqimDcVFVMWo8QEk7addVGpK+uF+zFuzCaGZmOwm8QAQ
1Dv5biHXv5v2BGdHiPpP5NKd4OWDCv8qKv67qIjXc7Zbxuz71XBY1nOUtX95
w3u0E4xlO4YYTU831uL0EuRKhsr70Wz6wmOPYb6Qmw4H6QNhbuGGXdMk2uvA
xGdT0WbTuUpq+fNBwriHHELM61rj8LvX+ZT6gnRLB81nn85Qr9Qk8pWSXNUy
UzV+ucOpNA4rxvA5gpPeF2hYkkicc4xd0TksXsbIDn5mv+xbUAqEBt/XWYEd
LyHsbGlr+RjJPJGX4O9bjSB1Fg9z3R5k+kR3G/zSiZ/pmJgGkQt5hvlOqy3a
abnHaXeyYj8ewI1jbLdpL+7QG3HkVLzfCj3xP9psSAaj/cTxU3jS/y88VOEh
SlRdOlamG0/wY2kAie4PrAeNPwBJAJO/c3GEnuoWGeTbBcXS3mtP83THp2PI
FHY2aOXsRlMmSX8N4OShYhDSZathWNIfTPPpEZ5DUwjdg8uTZa9pNIyTt84d
lYPGMfFlOXpJPv8PtuE/KQ/+o9fxPzFE6n0q7plES4Xs3PGI0+eBzH3zdB4q
z6H2rLNic5ChaW4CcqIThLyzxIHwwDxorFRdvK/lRZZNIMnhKzxHQiwL5TvF
0KTvjs0/zkbF5EOdWSqSZfavwIcOuD+/ev/xAiBYUAAkoNHe9Sn9T9iULVWF
uFaN0l+lgiJgJ7bmHnbhuxwtXcwi7UM+ugMFPJHxCEsWBfOGC9OzOJEQiN1p
mpZDD7xVgR/jWRwdP410ALmFcCmEC50inAizknvbDSyCrgEiwm97i4koFt3I
Y4GkC9ozm9EIJMDnbLVWt7K/5oQoaGm7EBkkiqDRT4lvtMfERE7faQjih0gk
GfF2nzohIe8MYEz0RfhNkmea6N3owAlwl9x//JFCR7ORdHHEp7W4wEHiAfRA
q4iVkZUJn2s9NYuHPDKXf2ORLeJZqGYIyc2KODm+zXQedvgl6Bya7j/SGOmm
H9FzOH00waxTlkAE0Ox7XD+8AgRIbWKrvM9xNGeoysWusC+zIJOIXQbmZees
i0D/3FnvCz7MoQyu070sS0cBgDxcnGarqcnIYQyk6zL0CKJvkShLMF1x9LAU
R5uEbqqT0YAoQfsjlzLEGED2l1PSNDKhhWxveeRQX5i0M7EbNXGVlAX5rlJc
f4TAwGTdgqJrAwrZ6SVeJd0BBdL9cBJK09l4ZDiosp/gYcbOaCeztmpfW1Xx
7DO3WL8QNOGwCpW31HIPu4hhl0EJAazWoHom5sO9MBnDPtO6IUaVz2qeQRyJ
eyK0owEmZTqMmB2eyy31aIr/niKKLnFRZc0dJ9tqOHxI9ZTimw72JvNZFcfT
Ryo3daCrrq730XTQs42gLzMUbSbBubbJcFutmlgjaFOkpA3lAfShFBexGsUS
j5mBbybwGJKuIKTbGNZl5GJVQOxFLQRE2jnnkOIM4WXBh6oHeDjrnONVldnw
JY+B+w8jKzkTBD0usWyVh8jj2uAA4OCofdxrTe/WDXAvO8USk65hckSAF8DS
DQecFS47f5ADULGYlGimT5cFk5vH2jSPkI8yn6ZsmAVZ9jEIRdP2GKvsWgRd
xpMLMxxqQwba96Gxjx+nksgT9v6gASsL7dqftwbr6Bam7+syqrH/jg820jW2
EgvCQSvFd110o/E2RE6FPqdTFbw5uwQhhfg38pXTXCQwAAA=

-->

</rfc>
