RFC 9842: Compression Dictionary Transport
- P. Meenan, Ed.,
- Y. Weiss, Ed.
Abstract
This document specifies a mechanism for dictionary
Status of This Memo
This is an Internet Standards Track document.¶
This document is a product of the Internet Engineering Task Force (IETF). It represents the consensus of the IETF community. It has received public review and has been approved for publication by the Internet Engineering Steering Group (IESG). Further information on Internet Standards is available in Section 2 of RFC 7841.¶
Information about the current status of this document, any
errata, and how to provide feedback on it may be obtained at
https://
Copyright Notice
Copyright (c) 2025 IETF Trust and the persons identified as the document authors. All rights reserved.¶
This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents
(https://
1. Introduction
This specification defines a mechanism for using designated HTTP [HTTP] responses as an external dictionary for future HTTP responses for compression schemes that support using external dictionaries (e.g., Brotli [RFC7932] and Zstandard [ZSTD]).¶
This document describes the HTTP headers used for negotiating dictionary usage
and registers content
The negotiation of dictionary usage leverages HTTP's content negotiation (see Section 12 of [HTTP]) and is usable with all versions of HTTP.¶
1.1. Use Cases
Any HTTP response can be specified for use as a compression dictionary for future HTTP requests, which provides a lot of flexibility. Two common use cases that are seen frequently are described below.¶
1.1.1. Version Upgrade
Using a previous version of a resource as a dictionary for a newer version
enables delivery of a delta
For example:¶
1.1.2. Common Content
If several resources share common patterns in their responses, then it can be useful to reference an external dictionary that contains those common patterns, effectively compressing them out of the responses. Some examples of this are common template HTML for similar pages across a site and common keys and values in API calls.¶
For example:¶
1.2. Notational Conventions
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in BCP 14 [RFC2119] [RFC8174] when, and only when, they appear in all capitals, as shown here.¶
This document uses the following terminology from Section 3 of [STRUCTURED
This document uses the line folding strategies described in [FOLDING].¶
This document also uses terminology from [HTTP] and [HTTP-CACHING].¶
2. Dictionary Negotiation
2.1. Use-As-Dictionary
When responding to an HTTP Request, a server can advertise that the response can
be used as a dictionary for future requests for URLs that match the rules
specified in the "Use
The "Use
2.1.1. "match"
The "match" value of the "Use
The URL Pattern used for matching does not support using regular expressions.¶
The following algorithm is used to validate that a given String value is a valid URL Pattern that does not use regular expressions and is for the same Origin (Section 4.3.1 of [HTTP]) as the dictionary. It will return TRUE for a valid match pattern and FALSE for an invalid pattern that MUST NOT be used.¶
The "match" value is required and MUST be included in the
"Use
Operating at the HTTP level, the specified match patterns will operate on the percent-encoded version of the URL path (see Section 2 of [URL]).¶
For example, the URL "http://
2.1.2. "match-dest"
The "match-dest" value of the "Use
An empty list for "match-dest" MUST match all destinations.¶
For clients that do not support request destinations, the client MUST treat it as an empty list and match all destinations.¶
The "match-dest" value is optional and defaults to an empty list.¶
2.1.3. "id"
The "id" value of the "Use
The server identifier MUST be treated as an opaque string by the client.¶
The server identifier MUST NOT be relied upon by the server to guarantee the contents of the dictionary. The dictionary hash MUST be validated before use.¶
The "id" value string length (after any decoding) supports up to 1024 characters.¶
The "id" value is optional and defaults to the empty string.¶
2.1.4. "type"
The "type" value of the "Use
"raw" is defined as a dictionary format that represents an unformatted blob of bytes suitable for any compression scheme to use.¶
If a client receives a dictionary with a type that it does not understand, it MUST NOT use the dictionary.¶
The "type" value is optional and defaults to "raw".¶
2.1.5. Examples
2.1.5.1. Path Prefix
A response that contained a response header (as shown below) would specify matching any document request for a URL with a path prefix of /product/ on the same Origin (Section 4.3.1 of [HTTP]) as the original request:¶
2.1.5.2. Versioned Directories
A response that contained a response header (as shown below) would match any path that starts with "/app/" and ends with "/main.js":¶
2.2. Available-Dictionary
When an HTTP client makes a request for a resource for which it has an
appropriate dictionary, it can add an "Available
The "Available
The client MUST only send a single "Available
For example:¶
2.2.1. Dictionary Freshness Requirement
To be considered as a match, the dictionary resource MUST be either fresh [HTTP-CACHING] or allowed to be served stale (see [RFC5861]).¶
2.2.2. Dictionary URL Matching
When a dictionary is stored as a result of a "Use
To see if an outbound request matches a given dictionary, the following algorithm will return TRUE for a successful match and FALSE for no-match:¶
2.2.3. Multiple Matching Dictionaries
When there are multiple dictionaries that match a given request URL, the client MUST pick a single dictionary using the following rules:¶
2.3. Dictionary-ID
When an HTTP client makes a request for a resource for which it has an
appropriate dictionary and the dictionary was stored with a server-provided
"id" in the "Use
The "Dictionary-ID" request header is a Structured Field [STRUCTURED
For example, given an HTTP response that set a dictionary ID:¶
A future request that matches the given dictionary will include both the hash and the ID:¶
3. The "compression-dictionary" Link Relation Type
This specification defines the "compression
The "compression
Clients can fetch the provided resource at a time that they determine would be appropriate.¶
The response to the fetch for the compression dictionary needs to include a "Use
The following example shows a link to a resource at
https://
4. Dictionary-Compressed Brotli
The "dcb" content encoding identifies a resource that is a
"Dictionary
A "Dictionary
The dictionary used for the "dcb" content encoding is a "raw" dictionary type as defined in Section 2.1.4 and is treated as a prefix dictionary as defined in Section 8.2 of [SHARED-BROTLI].¶
The 36-byte fixed header is as follows:¶
- Magic_Number:
-
4 fixed bytes -- 0xff, 0x44, 0x43, 0x42.¶
- SHA_256_Hash:
Clients that announce support for dcb content encoding MUST be able to decompress resources that were compressed with a window size of up to 16 MB.¶
With Brotli compression, the full dictionary is available during compression
and decompression independent of the compression window, allowing for
delta
5. Dictionary-Compressed Zstandard
The "dcz" content encoding identifies a resource that is a
"Dictionary
A "Dictionary
The dictionary used for the "dcz" content encoding is a "raw" dictionary type as defined in Section 2.1.4 and is treated as a raw dictionary as per Section 5 of [ZSTD].¶
The 40-byte header consists of a fixed 8-byte sequence followed by the 32-byte SHA-256 hash of the external dictionary that was used to compress the resource:¶
- Magic_Number:
-
8 fixed bytes -- 0x5e, 0x2a, 0x4d, 0x18, 0x20, 0x00, 0x00, 0x00.¶
- SHA_256_Hash:
The 40-byte header is a Zstandard skippable frame (little-endian 0x184D2A5E) with a 32-byte length (little-endian 0x00000020) that is compatible with existing Zstandard decoders.¶
Clients that announce support for dcz content encoding MUST be able to decompress resources that were compressed with a window size of at least 8 MB or 1.25 times the size of the dictionary, whichever is greater, up to a maximum of 128 MB.¶
The window size used will be encoded in the content (currently, this can be expressed in powers of two only) and it MUST be lower than this limit. An implementation MAY treat a window size that exceeds the limit as a decoding error.¶
With Zstandard compression, the full dictionary is available during compression and decompression until the size of the input exceeds the compression window. Beyond that point, the dictionary becomes unavailable. Using a compression window that is 1.25 times the size of the dictionary allows for full delta compression of resources that have grown by 25% between releases while still giving the client control over the memory it will need to allocate for a given response.¶
6. Negotiating the Content Encoding
When a compression dictionary is available to compress the response to a given request, the encoding to be used is negotiated through the regular mechanism for negotiating content encoding in HTTP through the "Accept
The dictionary to use is negotiated separately and advertised in the
"Available
6.1. Accept-Encoding
When a dictionary is available for use on a given request and the client
chooses to make dictionary
When a client does not have a stored dictionary that matches the request or
chooses not to use one for the request, the client MUST NOT send its
dictionary
6.2. Content-Encoding
If a server supports one of the dictionary encodings 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
If the response is cacheable, it MUST include a "Vary" header to prevent caches from
serving dictionary
7. IANA Considerations
7.1. Content Encoding Registration
IANA has added the following entries to the "HTTP Content Coding
Registry" maintained at <https://
7.2. Header Field Registration
IANA has added the following entries to the
"Hypertext Transfer Protocol (HTTP) Field Name Registry" maintained at
<https://
7.3. Link Relation Registration
IANA has added the following entry to the "Link Relation Types" registry
maintained at <https://
8. Compatibility Considerations
It is not unusual for devices to be on the network path that intercept,
inspect, and process HTTP requests (web proxies, firewalls, intrusion detection
systems, etc.). To minimize the risk of these devices incorrectly processing
dictionary
9. Security Considerations
The security considerations for Brotli [RFC7932], Shared Brotli
[SHARED-BROTLI], and Zstandard [ZSTD] apply to the
dictionary
9.1. Changing Content
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.¶
The dictionary is validated using an SHA-256 hash of the content to make sure
that the client and server are both using the same dictionary. The strength
of the SHA-256 hash algorithm isn't explicitly needed to counter attacks
since the dictionary is being served from the same origin as the content. That
said, if a weakness is discovered in SHA-256 and it is determined that the
dictionary negotiation should use a different hash algorithm, the
"Use
9.2. Reading Content
The compression attacks in Section 2.6 of [RFC7457] show 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 secret cookies are compressed using a public
The dictionary can reveal information about the compressed data and vice versa. That is, data compressed with the dictionary can reveal contents of the dictionary when an adversary can control parts of the 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.¶
9.3. Security Mitigations
If any of the mitigations do not pass, the client MUST drop the response and return an error.¶
9.3.1. Cross-Origin Protection
To make sure that a dictionary can only impact content from the same origin where the dictionary was served, the URL Pattern used for matching a dictionary to requests (Section 2.1.1) is guaranteed to be for the same origin that the dictionary is served from.¶
9.3.2. Response Readability
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
In these cases, dictionary compression MUST only be used when both the dictionary and the compressed response are fully readable by the client.¶
In browser terms, that means either the dictionary and compressed response are same-origin to the context they are being fetched from or the response is cross-origin and passes the Cross-Origin Resource Sharing (CORS) check (see Section 4.9 of [FETCH]).¶
9.3.3. Server Responsibility
As with any usage of compressed content in a secure context, a potential timing attack exists if the attacker can control any part of the dictionary or if it can read the dictionary and control any part of the content being compressed while performing multiple requests that vary the dictionary or injected content. Under such an attack, the changing size or processing time of the response reveals information about the content, which might be sufficient to read the supposedly secure response.¶
In general, a server can mitigate such attacks by preventing variations per
request, as in preventing active use of multiple dictionaries for the same
content, disabling compression when any portion of the content comes from
uncontrolled sources, and securing access and control over the dictionary
content in the same way as the response content. In addition, the following
requirements on a server are intended to disable dictionary
The following algorithm will return FALSE for cross-origin requests where
precautions such as not using dictionary
10. Privacy Considerations
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.¶
To mitigate any additional tracking concerns, clients MUST treat dictionaries in the same way that they treat cookies [RFC6265]. This includes partitioning the storage using partitioning similar to or stricter than the partitioning used for cookies, as well as clearing the dictionaries whenever cookies are cleared.¶
11. References
11.1. Normative References
- [FETCH]
-
WHATWG, "Fetch Standard", WHATWG Living Standard, <https://
fetch >. Commit snapshot: <https://.spec .whatwg .org / fetch >.spec .whatwg .org /commit -snapshots /5a9680638ebfc2b 3b7f4efb2bef0b57 9a2663951 / - [FOLDING]
-
Watsen, K., Auerswald, E., Farrel, A., and Q. Wu, "Handling Long Lines in Content of Internet-Drafts and RFCs", RFC 8792, DOI 10
.17487 , , <https:///RFC8792 www >..rfc -editor .org /info /rfc8792 - [HTTP]
-
Fielding, R., Ed., Nottingham, M., Ed., and J. Reschke, Ed., "HTTP Semantics", STD 97, RFC 9110, DOI 10
.17487 , , <https:///RFC9110 www >..rfc -editor .org /info /rfc9110 - [HTTP-CACHING]
-
Fielding, R., Ed., Nottingham, M., Ed., and J. Reschke, Ed., "HTTP Caching", STD 98, RFC 9111, DOI 10
.17487 , , <https:///RFC9111 www >..rfc -editor .org /info /rfc9111 - [RFC2119]
-
Bradner, S., "Key words for use in RFCs to Indicate Requirement Levels", BCP 14, RFC 2119, DOI 10
.17487 , , <https:///RFC2119 www >..rfc -editor .org /info /rfc2119 - [RFC8174]
-
Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words", BCP 14, RFC 8174, DOI 10
.17487 , , <https:///RFC8174 www >..rfc -editor .org /info /rfc8174 - [SHA-256]
-
Eastlake 3rd, D. and T. Hansen, "US Secure Hash Algorithms (SHA and SHA-based HMAC and HKDF)", RFC 6234, DOI 10
.17487 , , <https:///RFC6234 www >..rfc -editor .org /info /rfc6234 - [SHARED-BROTLI]
-
Alakuijala, J., Duong, T., Kliuchnikov, E., Szabadka, Z., and L. Vandevenne, Ed., "Shared Brotli Compressed Data Format", RFC 9841, DOI 10
.17487 , , <https:///RFC9841 www >..rfc -editor .org /info /rfc9841 - [STRUCTURED
-FIELDS] -
Nottingham, M. and P. Kamp, "Structured Field Values for HTTP", RFC 9651, DOI 10
.17487 , , <https:///RFC9651 www >..rfc -editor .org /info /rfc9651 - [URL]
-
Berners-Lee, T., Fielding, R., and L. Masinter, "Uniform Resource Identifier (URI): Generic Syntax", STD 66, RFC 3986, DOI 10
.17487 , , <https:///RFC3986 www >..rfc -editor .org /info /rfc3986 - [URLPATTERN]
-
WHATWG, "URL Pattern Standard", WHATWG Living Standard, <https://
urlpattern >. Commit snapshot: <https://.spec .whatwg .org / urlpattern >.spec .whatwg .org /commit -snapshots /696b4029d52e585 4044bac6b72cdb19 8cb962ed0 / - [WEB-LINKING]
-
Nottingham, M., "Web Linking", RFC 8288, DOI 10
.17487 , , <https:///RFC8288 www >..rfc -editor .org /info /rfc8288 - [ZSTD]
-
Collet, Y. and M. Kucherawy, Ed., "Zstandard Compression and the 'application
/zstd' Media Type" , RFC 8878, DOI 10.17487 , , <https:///RFC8878 www >..rfc -editor .org /info /rfc8878
11.2. Informative References
- [RFC5861]
-
Nottingham, M., "HTTP Cache-Control Extensions for Stale Content", RFC 5861, DOI 10
.17487 , , <https:///RFC5861 www >..rfc -editor .org /info /rfc5861 - [RFC6265]
-
Barth, A., "HTTP State Management Mechanism", RFC 6265, DOI 10
.17487 , , <https:///RFC6265 www >..rfc -editor .org /info /rfc6265 - [RFC7457]
-
Sheffer, Y., Holz, R., and P. Saint-Andre, "Summarizing Known Attacks on Transport Layer Security (TLS) and Datagram TLS (DTLS)", RFC 7457, DOI 10
.17487 , , <https:///RFC7457 www >..rfc -editor .org /info /rfc7457 - [RFC7932]
-
Alakuijala, J. and Z. Szabadka, "Brotli Compressed Data Format", RFC 7932, DOI 10
.17487 , , <https:///RFC7932 www >..rfc -editor .org /info /rfc7932