<?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-03" 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-03"/>
    <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="July" day="05"/>
    <area>Applications and Real-Time</area>
    <workgroup>HTTP</workgroup>
    <keyword>compression dictionary</keyword>
    <keyword>shared brotli</keyword>
    <keyword>zstandard dictionary</keyword>
    <abstract>
      <?line 51?>

<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. Brotli <xref target="RFC7932"/> and Zstandard
<xref target="RFC8878"/>).</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 58?>

<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. Brotli <xref target="RFC7932"/> and Zstandard
<xref target="RFC8878"/>).</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>
      <t>This document uses the line folding strategies described in <xref target="FOLDING"/>.</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 <xref target="Origin"/> of the URL in the "match" pattern MUST be the same as the
origin of the request that specifies the "Use-As-Dictionary" response and MUST
not include a * wildcard.</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>The "ttl" 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 which can help limit the number of possible incoming dictionary
variations.</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>
            <sourcecode type="http-message"><![CDATA[
NOTE: '\' line wrapping per RFC 8792

Use-As-Dictionary: \
  match="/product/*", ttl=604800, hashes=(sha-256 sha-512)
]]></sourcecode>
            <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>
            <sourcecode type="http-message"><![CDATA[
Use-As-Dictionary: match="/app/*/main.js"
]]></sourcecode>
            <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 a lowercase Base16-encoded <xref target="RFC4648"/> 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>
        <t>For example:</t>
        <sourcecode type="http-message"><![CDATA[
NOTE: '\' line wrapping per RFC 8792

Sec-Available-Dictionary: \
  a591a6d40bf420404a011733cfb7b190d62c65bf0bcda32b57b277d9ad9f146e
]]></sourcecode>
        <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>
              <t>If there are no * characters in MATCH:
              </t>
              <ul spacing="normal">
                <li>If the MATCH and URL strings are identical, return TRUE.</li>
                <li>Else, return FALSE.</li>
              </ul>
            </li>
            <li>
              <t>If there is a single * character in MATCH and it is at the end of the
string:
              </t>
              <ul spacing="normal">
                <li>If the MATCH string is identical to the start of the URL string, return
 TRUE.</li>
                <li>Else, return FALSE.</li>
              </ul>
            </li>
            <li>Split the MATCH string by the * character into an array of MATCHES
(excluding the * deliminator from the individual entries).</li>
            <li>
              <t>If there is not a * character at the end of MATCH:
              </t>
              <ul spacing="normal">
                <li>Pop the last entry in MATCHES from the end of the array into PATTERN.</li>
                <li>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.</li>
                <li>Else, return FALSE.</li>
              </ul>
            </li>
            <li>
              <t>Pop the first entry in MATCHES from the front of the array into PATTERN.
              </t>
              <ul spacing="normal">
                <li>If PATTERN is not identical to the start of the URL string, return FALSE.</li>
              </ul>
            </li>
            <li>
              <t>Pop each entry off of the front of the MATCHES array into PATTERN. For
each PATTERN, in order:
              </t>
              <ul spacing="normal">
                <li>Search for the first match of PATTERN in URL, starting from the position
of the end of the previous match.</li>
                <li>If no match is found, return FALSE.</li>
              </ul>
            </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>
      <table>
        <thead>
          <tr>
            <th align="left">Content-Encoding</th>
            <th align="left">Description</th>
          </tr>
        </thead>
        <tbody>
          <tr>
            <td align="left">br-d</td>
            <td align="left">Brotli using an external compression dictionary</td>
          </tr>
          <tr>
            <td align="left">zstd-d</td>
            <td align="left">Zstandard using an external compression dictionary</td>
          </tr>
        </tbody>
      </table>
      <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>
        <sourcecode type="http-message"><![CDATA[
Accept-Encoding: gzip, deflate, br, zstd, br-d, zstd-d
]]></sourcecode>
      </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>
        <sourcecode type="http-message"><![CDATA[
Content-Encoding: br-d
]]></sourcecode>
        <t>If the response is cacheable, it MUST include a "Vary" header to prevent caches
serving dictionary-compressed resources to clients that don't support them or
serving the response compressed with the wrong dictionary:</t>
        <sourcecode type="http-message"><![CDATA[
Vary: accept-encoding, sec-available-dictionary
]]></sourcecode>
      </section>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <section anchor="content-encoding-1">
        <name>Content Encoding</name>
        <t>IANA is asked to update the "HTTP Content Coding Registry" registry
(<xref target="RFC9110"/>) according to the table below:</t>
        <table>
          <thead>
            <tr>
              <th align="left">Name</th>
              <th align="left">Description</th>
              <th align="left">Reference</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td align="left">br-d</td>
              <td align="left">A stream of bytes compressed using the Brotli protocol with an external dictionary</td>
              <td align="left">
                <xref target="RFC7932"/></td>
            </tr>
            <tr>
              <td align="left">zstd-d</td>
              <td align="left">A stream of bytes compressed using the Zstandard protocol with an external dictionary</td>
              <td align="left">
                <xref target="RFC8878"/></td>
            </tr>
          </tbody>
        </table>
      </section>
      <section anchor="header-field-registration">
        <name>Header Field Registration</name>
        <t>IANA is asked to update the
"Hypertext Transfer Protocol (HTTP) Field Name Registry" registry
(<xref target="RFC9110"/>) according to the table below:</t>
        <table>
          <thead>
            <tr>
              <th align="left">Field Name</th>
              <th align="left">Status</th>
              <th align="left">Reference</th>
            </tr>
          </thead>
          <tbody>
            <tr>
              <td align="left">Use-As-Dictionary</td>
              <td align="left">permanent</td>
              <td align="left">
                <xref target="use-as-dictionary"/> of this document</td>
            </tr>
            <tr>
              <td align="left">Sec-Available-Dictionary</td>
              <td align="left">permanent</td>
              <td align="left">
                <xref target="sec-available-dictionary"/> of this document</td>
            </tr>
          </tbody>
        </table>
      </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 Brotli <xref target="RFC7932"/> and Zstandard
<xref target="RFC8878"/> 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>References</name>
      <references>
        <name>Normative References</name>
        <reference anchor="FOLDING">
          <front>
            <title>Handling Long Lines in Content of Internet-Drafts and RFCs</title>
            <author fullname="K. Watsen" initials="K." surname="Watsen"/>
            <author fullname="E. Auerswald" initials="E." surname="Auerswald"/>
            <author fullname="A. Farrel" initials="A." surname="Farrel"/>
            <author fullname="Q. Wu" initials="Q." surname="Wu"/>
            <date month="June" year="2020"/>
            <abstract>
              <t>This document defines two strategies for handling long lines in width-bounded text content. One strategy, called the "single backslash" strategy, is based on the historical use of a single backslash ('\') character to indicate where line-folding has occurred, with the continuation occurring with the first character that is not a space character (' ') on the next line. The second strategy, called the "double backslash" strategy, extends the first strategy by adding a second backslash character to identify where the continuation begins and is thereby able to handle cases not supported by the first strategy. Both strategies use a self-describing header enabling automated reconstitution of the original content.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8792"/>
          <seriesInfo name="DOI" value="10.17487/RFC8792"/>
        </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>
      </references>
      <references>
        <name>Informative References</name>
        <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>
        <reference anchor="RFC4648">
          <front>
            <title>The Base16, Base32, and Base64 Data Encodings</title>
            <author fullname="S. Josefsson" initials="S." surname="Josefsson"/>
            <date month="October" year="2006"/>
            <abstract>
              <t>This document describes the commonly used base 64, base 32, and base 16 encoding schemes.  It also discusses the use of line-feeds in encoded data, use of padding in encoded data, use of non-alphabet characters in encoded data, use of different encoding alphabets, and canonical encodings. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4648"/>
          <seriesInfo name="DOI" value="10.17487/RFC4648"/>
        </reference>
        <reference anchor="RFC7932">
          <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="RFC8878">
          <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>
      </references>
    </references>
    <?line 382?>



  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA+U7W2/bxprv8ysGykOTQJTt2LFjAwWOj+u0AZLUsN0WZ/fs
w5AcSbOmOFwOaUVt3N++32WGHFJy6nR7dh/WQGtZ5Hz3+zdJkkRkNjfl4ky2
zTx5I0RjmkKfyQu7qmrtnLGl/M5kDfxW9Ube1qp0la0bodK01vdnMutfTPLu
RZGpRi9svTmTppxbIXKblWoFgPNazZtkpXWpymTZNFVqXLIbSLJ/KFybrgw9
aDaVRmi5rjT8r2ykfCZV4eyZnLy7vH07mcLv87/DL1vDp2v4RjzLbOl06Vp3
Jpu61QIIPhSq1goOnVdVYYBOgO2kKnN5rVWR3JqVnoi1re8WtW0reO+H29ur
ibjTG/gyPxMyiXmWEc/wxC0BeC7T2jaFwS9+dQ2AVnUev3ivy1YDJDlEISXz
OPkFsINO5Pf4GL9fKVPA90aDjlBmyXrxt/XhzNYLfKrqbAlP8YE729srjGvc
jB/vncMzc6/d3lWbArd7MYg9PLwwzbJN4XjFOtkzSf6IPvD1AvTqmgibPzZj
ODNjvwBg7yuUP1s2q2IihGqbpa1RWAn8J8EAQJdXM/mBgNBXbFhXqqlNdhc/
AAGcye+tXRRavn9/Qd9plqUn+28LejoDGoYY/jGTv2gwvAjBP6y6j778AvAN
vLnGF2PworT1CqztnjT/9sf33737+P2ZvH578ebk9BV8BZ9ODw72z9Cu0SCk
A3BlYzInBDpRdBof09GTV4f78PePtVmYkr45Pnp9xMAOT98cE7Cfrt/zN29O
jw7omxtwhqxp0VTnRhe54+dHx0dv6PnfldMHx1KXHBz46cnp4St+6q2bQL45
4SP/FgxdiCRJpEpdU6usEeJ2aZx0lc7M3HubzPXclBqcTq50tlSlcSsJ/MnW
odXn2plFCXaWy99+Q04fHiTYR4Wu7IRCX5X6U6PrUhWRVxGEeYtcsfi6M/Qk
9lmXLfUKYDVL1UjXVhjQPPJtwAYAPNezxczzDUR5YQBdGDZ6zukJSuTh4cWM
5bAyeV5oIZ7Jd2VT27wlqP+fpUKcQzpoVxjDga2sNilAa5aewqVWua4doEbz
BCJLyCSNASGhGHrOWqcWWiCuWi8g5uGZlc6NojAa+CsbRBMsOVA7oNAzqURA
pONovUVy6zy1BagLsBQEGM0dUh7KJfCUQyiR/+49/T9maARRKv0YuEJzeAZe
6nRy7pL+DSF+WerSK4xwNBaMg2R0rf+rhTg8hb+dru81cAr6Vzl8aozTknSI
NAZ143ORahYqWssjNlIzYJYeBA7HoCD0ZEsCWKkGbUF422Um8cEW/T1u1igJ
8gnvSYPkRSHqLYYoNjCMYA8Pws2jTCHXkHrkvSpar/QJUYv1QNMUE9L1ZKnc
UrsJKgFkTS8wOf5lPi/t/BFeYtIAO2gbFcKHUEKiqu29yTX5IcgtIbD4jhcY
UdZJd73UtSZUER+oQq8iL6seEyCuVN0pDzCwQDDIPzxMiUnvsw6Dry3aRpMC
MTasdVHgwVoXlEPoAWQ4tC/XWBAyQtgMn8sPP93cIkH6UwXgdS6cZWuwZbEZ
IAlMAupa947byUAtFGTVpuPfs8dWhec70tkVXzKXa1PkGTooatibGZ/xUgEk
wqPuBb5qi8ZURWCSWCETUZDIwaIgjL30RrsieksLccjUOmuKjfCUAAdtWUBk
xNdYNSCcDbBOVKR6qe4NsAgG8zLiE3ywTg2EAnBfptGz+ttvnKMhOgYbA7Y9
T8EGg6kEweMzB7UHSgM+C0sgAgAvTFZJcEeOTJMtA570XoamghgE8m3KrGhz
+BLYCOKe7fIM4wihQYcMEJBGD+DxMDByVrSLkd1DWANAWKqDAyF8wGhy76rg
wp4ccuavc1MD0X8Bf+/yUwTQQLGPhDsN2HPXh82IOoBF9BDlz+kEEFyAl7yY
xZTBe3Fz4knMVEaZYq7pZKc6Z9s6QztCswkOI4aoZ/Idv94CyLrY4KvdSUCn
7+FVPFnblUfUoEcbUCu4PbRG8PrK3mND0iJfKJaisGsOk043jTda8HBoDuBc
zJ4vPsj6lIglss3mTgpLJmomLz9VZDfhkRPoT64xEJU44M1bik+D8mK9NIVm
90MvDeDI+qJQSYID8bIHtlWOHUqgS48wg0gbTpUonR43ZlbInFCLGZDQRhRm
ZRqf5OektkHCJFqcfiSOg5iZjFzMyUlLCCzIDgQuxL3URSV7DGW7SjVFkspC
JZYW5FR2NSx3xD1IhZvV2bZDAEpb0ZsFyQdqSQVh0CFjhwevD4/39/fl8wO5
0ap+4T2LU6KH5fPj1/iXKUtdJ9ht8ikuHPs8KOkRgOpDKmIB0S8gkDXLFToM
tFE5M891DPinnoNMS9AVkzawCTIENDwuPdIN0UlgmWbT1Xzc05PRM3mR6Zd9
7RV47ahCkYFVzHYK5ktyfg7Nf/Lq9XGQ7+UntYI05OivZ9ifLuUVcGc+CXHe
h2OSGtIMKRJj67gcOhPi999/l9SzQ3lORe/HH28vz+Q3//yGa9B1raqKag0Q
JRQFkjpKsaW+M/lPGiaAr3w72au4Hdl7CZUSmNK3x/tHb/b3p94uvg3s4Ewj
eX3w6gWSATWpbaEY43SziTPfhjKaT7QVMlsRsyjgDlfIn5jVRJQTOcFJTnAg
2zrUt+TAhMBtueCJzNXGia+Oulwt9cVy6HUwkKQWCA+cU1HF3I9Nd+a1+jN0
HUARKO47qiAsmun/WL87NBe0Bpree7m3AmCz/3STWCdcGfknKB/USe6p2nCI
lnT+i2IVwA3Fibim9HUZqc4LZygQkoe80Vlyfq9MoSCKbbcyvnnJCoO6Wqk7
ChOhjkHHVH36wD85ZkKcXFKDK4D42lYYB+OAO8U3uP9B+U4eo2LSoWLJi8YO
CymLqQ3bccqBxCw3V6TDQEYsLhXQwAGBuXLUVIco8lSSntb7bHUfwb4o6tq1
rjE7+SlOQr2v9kBwxAP+5iMmFRxdvKQsh3oGdnrGBg1KkbUF9cdsD2gq7Fwi
iuqdZ1GzwiVOnwN8zGbJevl4i6CakpoLp9FDAzFP16gPP/4ccclSCmVnii/3
zIW+NlJveAakvYVDmqP4n4/Cj9HOwVi9Pj1Qx/nRfjo/erV/tH+k9g8OTg4P
s3l6kh6c7ufHr7Lj1+l8P81ydfgqfX2Svjo5yU9Vfjo/ODrWHAAwEkVZGqoO
tyyxefElO84tQNLjOpusmUQwHdcwqxbkhA3CRje+BzThiIhL1F+44tQ1z2ea
ZW3bxXKYtQtr73y7NkAoCCqn4ThQD2upyOrQdtRdiESFcqFiBVjxQABbXjDG
BmMOhfo8nOGiKdT7VDnj4S81TF0ZnrV1jWbKXQNa9sZSieHF0zMithihGNX1
TIsSe+7ZluIwg4aU2sXMoTS4XWfVAYVQfLDf7uKAgz+U8ohd+E4ND4bWzgcS
8prQk4YmFKAG5+rnQCNBj8rwmacZA6CquRmIIXBM3Rla2BHDGIGtw4NxOJtc
UopTWWbbsum8+WU0IkDEjw0cBI8CaI7naUZQ4NgGap28F8DcYpFIELp6kJNQ
rSEgQ4C9vf7pUrAhuzaDXsZh/8Dko629PX9/c8lFpuWZBISOg5l8D3704fz2
4geAhNmBDAmlsWOM0tnlqAf3bIsFqLQcjCgRweUtwRiCjxTgIzFURtkdGt9B
MGyoqXkMAvLMlgrH9jhLhQqCCD6j1cbL4AXMBLJKgxuyoLgwB3edemmRsGb+
+GXhdPeApDQkgXt2DtwRHR0ZhJJaW+mbdMwRPvsABqZkJ7H9DK0jsUvwDfR9
8UiG3w2EEjT4eQIjN2BMzTZSn+6GHGG7iaOiWm0QNx24vEH4z/Un9NIQrl5C
h4GdYqkanNEGs8AyBbqsFvgAfjDGvtgSJgZvNcA7FNtAt1e26kMqgtx0cr+8
6fH2EvfEEytX57e3l9cfZ73o/Tc7JR7BGMobJxXRG0H0wxcDlFRDo1BSDTKP
5oLb1DyircDw3NRf5Bg+9G3FU3mmwdpXWtqINg0djCfLzufh2ICaQOsOqiRU
LkgZQfFfTrtuOyj9RuPmuAumLAqWo434oXn2lOmnLB5kU1lnaH3Bigojl16/
EIjujW0dA41kBaGG8Rjsx6Ez2SGF6ziEUKL8EAa7XZiPqwyfe/p41s2BB7VI
tM5QkgNpFCO5DuJyVFC6rnCnPCpKunRR2HKhO6GF6O0ttdDlolnS2udjtMHi
krtfu3WJpkv4u68XUODrUmeYzXEmGvAxHdbjfrxKORpts99xhVqN88QCaqx6
uHoU8eZta5UGhoHt3NZ+zPhFJwp7bQHhevts3y1AdvycbP3s+OqPfz6Lz/KC
MSWXAdNn+R2t42hqI5/48/kvpSmtk3wIPqwh/eIx2tw+onumCW+T5ANYn7e3
mH8M7K/kbjii2/jh2cjQnIY6Dj7h1iievISlgXhyg8djhnOou6pex4MeEmp9
Nxzoua6/67ZMPiRPRoAmYoRN4oZ7V+s3OngmF7+aaorjQGxUpqDyKSlrSsqf
esWFZm3LSoV4N+9XuR2ZfXs9mDns7LR9neFDF83Il9bSqtp2hiCjfj+aivE4
qh/xxPrEnUkPmFvkHmvYNzjd+M3TmLXJeN4Vpi7xLGfYo/ehy+lC44rjcUWM
0Z2RwFnQ70YMUvEP5S/aWN+P9Ruwyc9kcX4SA2Ri/kKm6ZQTqJ7hUL67uxQv
N0jgJC1vebktv+lvVNDaEWJrgDYgMYLXJZk1JP0Y6S4x/EwDBcVWGaLsFPvc
pMsZ8fU8NkT57vzjORojDQR4uRDbp4zsE9/EDOTuUO3WbzhY5zTVC2cuOO5e
050M9mD+JJ7TBArvOD08vKAGrM6jkq6hxJZqaMDipPCnAtNTYtcokn2WH3HV
Kv9cxnhKUgGZ+NXGMMX873HoM9FneY5FilYrDALpBhdmkeX1gcCnKXDUxma2
8NP93ReNCG58CyhKWE9G2GezJ+H0CPly0f+FSNFZfuB4wZNab/b+Ws8XvEZM
fthUEEaBLb5VC6YhrwLTz9GlXniYZJd/mT99mamvFRwqOaJybPE3jWqg/qfP
u35ijxid/VdSvL3Y7CgGnaxUiYEMjQtqmUS5KHKG+xtxwdtT/OgCZAvwY5F5
F/x/oSjEM7rpDeaamsI0m61kcAudminNyvzKsb427g4p5HuNSWo/aUfr6prv
z6Df4lAMk8ajeZIvIE4fq0+bcMm8Xwh0V9f4sgbeVKMy5hPkWPKVG9q6ovzb
eicftHLwD7PBQ6o7vuYWI5YuxSa4WcRlqpDEe14JurjA4jGsGO0P5QX0Wouo
udoqp2kMjzeBIHY2cVFA14I6hkCKmWr9TXYXb3WgAMVHeIsDJ0HQrm7T7W83
0SwZ14Zi9KKOtOfBMvnXEPm2qL+4fvfhUkIrrKBxdktcufv6+xuc8KUqx9mI
GpSlEBQVzRXEynwCLHyztKIr66QHqBPvQQAvZKixkoRpw4PhO1/J0b0m2iLF
rTbe6cSX8SYMXf4YyMBoR0OTsO6ZCjOXG9v2JIKsa42LNnuHYwTfbHkaEwSd
EM5o5C8QAN9yKbS6k90lbuz6U9s2nkCCCBL9GOhGfYxUhJUo5L7HQAQeBRIy
JSbvDURVtEX4mzjfVVtuGQFi2doKjscfNKbw101dOIsHakhd0OrRKSJloGXa
J2s9VouD2DKTPzLLFuc30GXgSMjwfnI3mvF6ZftNkHldij+SGMmm216zO30w
jVmEyIGdWbnpxoz9IwjQNOmrlHPx3IijVl77CWN87074KReWM3Vtaz/Yuqit
c4m/3YeFjw63xC1tyaF3qP2iV41VRgZjIIRnTdfZdRM6ihIMV+y8qoSbMuo6
8+lg3xBGWTuucopht99daQ3LrdDFRbjljnt1wgTMRK6XxHUQFsS7XHFO4j2s
76imsjAgkLVO8R/ZrAECyb6/eETLPn9DpxdltxDCyiuC3U0q1aawKudV2uCm
ZDgIkqgxM2V31Fn1WESPpRdCA1orUTwj9SEuDMaAZ5w3xCAbWs1j5B1+T4DW
tA+jSIces8Z7LKkebK/fkUfR1W/KtrHhRKj6pXvIseTfdBFmtO5Tftu5I5vT
xHXeFsXGqw5Lz3gkwQR5nUkwrlVQ3EpDuuePhBQhaUNxAG0o+IXPRj7tY2Tg
e4G81aILgOEupK0jcF1/Xwqa94CnXXAMSc5x2ZfwJaStOUU0KQ63avs3eavY
vehJiYmgcuQK01a2XY3cGCx5t262DQdj4xv5fZcU3XcTo2nOaOOM18bDpUJc
OqWt24oBKFgMSrQipn9iEMzc56aZLwMp8mmKhpGTRS8DU7S8DdMPMi0qXYaT
etNfAoMItOlcY+NfDimRF7bd3hozC2HtriI1tqZ/A+K6vIxi7N7jPXm4/J5h
QtgacfFNU11qvHwYQ6HXaUkPlTKULdmdEP8N+zSFYDA5AAA=

-->

</rfc>
