cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: Network Working Group P. Deutsch cannam@128: Request for Comments: 1951 Aladdin Enterprises cannam@128: Category: Informational May 1996 cannam@128: cannam@128: cannam@128: DEFLATE Compressed Data Format Specification version 1.3 cannam@128: cannam@128: Status of This Memo cannam@128: cannam@128: This memo provides information for the Internet community. This memo cannam@128: does not specify an Internet standard of any kind. Distribution of cannam@128: this memo is unlimited. cannam@128: cannam@128: IESG Note: cannam@128: cannam@128: The IESG takes no position on the validity of any Intellectual cannam@128: Property Rights statements contained in this document. cannam@128: cannam@128: Notices cannam@128: cannam@128: Copyright (c) 1996 L. Peter Deutsch cannam@128: cannam@128: Permission is granted to copy and distribute this document for any cannam@128: purpose and without charge, including translations into other cannam@128: languages and incorporation into compilations, provided that the cannam@128: copyright notice and this notice are preserved, and that any cannam@128: substantive changes or deletions from the original are clearly cannam@128: marked. cannam@128: cannam@128: A pointer to the latest version of this and related documentation in cannam@128: HTML format can be found at the URL cannam@128: . cannam@128: cannam@128: Abstract cannam@128: cannam@128: This specification defines a lossless compressed data format that cannam@128: compresses data using a combination of the LZ77 algorithm and Huffman cannam@128: coding, with efficiency comparable to the best currently available cannam@128: general-purpose compression methods. The data can be produced or cannam@128: consumed, even for an arbitrarily long sequentially presented input cannam@128: data stream, using only an a priori bounded amount of intermediate cannam@128: storage. The format can be implemented readily in a manner not cannam@128: covered by patents. cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: Deutsch Informational [Page 1] cannam@128: cannam@128: RFC 1951 DEFLATE Compressed Data Format Specification May 1996 cannam@128: cannam@128: cannam@128: Table of Contents cannam@128: cannam@128: 1. Introduction ................................................... 2 cannam@128: 1.1. Purpose ................................................... 2 cannam@128: 1.2. Intended audience ......................................... 3 cannam@128: 1.3. Scope ..................................................... 3 cannam@128: 1.4. Compliance ................................................ 3 cannam@128: 1.5. Definitions of terms and conventions used ................ 3 cannam@128: 1.6. Changes from previous versions ............................ 4 cannam@128: 2. Compressed representation overview ............................. 4 cannam@128: 3. Detailed specification ......................................... 5 cannam@128: 3.1. Overall conventions ....................................... 5 cannam@128: 3.1.1. Packing into bytes .................................. 5 cannam@128: 3.2. Compressed block format ................................... 6 cannam@128: 3.2.1. Synopsis of prefix and Huffman coding ............... 6 cannam@128: 3.2.2. Use of Huffman coding in the "deflate" format ....... 7 cannam@128: 3.2.3. Details of block format ............................. 9 cannam@128: 3.2.4. Non-compressed blocks (BTYPE=00) ................... 11 cannam@128: 3.2.5. Compressed blocks (length and distance codes) ...... 11 cannam@128: 3.2.6. Compression with fixed Huffman codes (BTYPE=01) .... 12 cannam@128: 3.2.7. Compression with dynamic Huffman codes (BTYPE=10) .. 13 cannam@128: 3.3. Compliance ............................................... 14 cannam@128: 4. Compression algorithm details ................................. 14 cannam@128: 5. References .................................................... 16 cannam@128: 6. Security Considerations ....................................... 16 cannam@128: 7. Source code ................................................... 16 cannam@128: 8. Acknowledgements .............................................. 16 cannam@128: 9. Author's Address .............................................. 17 cannam@128: cannam@128: 1. Introduction cannam@128: cannam@128: 1.1. Purpose cannam@128: cannam@128: The purpose of this specification is to define a lossless cannam@128: compressed data format that: cannam@128: * Is independent of CPU type, operating system, file system, cannam@128: and character set, and hence can be used for interchange; cannam@128: * Can be produced or consumed, even for an arbitrarily long cannam@128: sequentially presented input data stream, using only an a cannam@128: priori bounded amount of intermediate storage, and hence cannam@128: can be used in data communications or similar structures cannam@128: such as Unix filters; cannam@128: * Compresses data with efficiency comparable to the best cannam@128: currently available general-purpose compression methods, cannam@128: and in particular considerably better than the "compress" cannam@128: program; cannam@128: * Can be implemented readily in a manner not covered by cannam@128: patents, and hence can be practiced freely; cannam@128: cannam@128: cannam@128: cannam@128: Deutsch Informational [Page 2] cannam@128: cannam@128: RFC 1951 DEFLATE Compressed Data Format Specification May 1996 cannam@128: cannam@128: cannam@128: * Is compatible with the file format produced by the current cannam@128: widely used gzip utility, in that conforming decompressors cannam@128: will be able to read data produced by the existing gzip cannam@128: compressor. cannam@128: cannam@128: The data format defined by this specification does not attempt to: cannam@128: cannam@128: * Allow random access to compressed data; cannam@128: * Compress specialized data (e.g., raster graphics) as well cannam@128: as the best currently available specialized algorithms. cannam@128: cannam@128: A simple counting argument shows that no lossless compression cannam@128: algorithm can compress every possible input data set. For the cannam@128: format defined here, the worst case expansion is 5 bytes per 32K- cannam@128: byte block, i.e., a size increase of 0.015% for large data sets. cannam@128: English text usually compresses by a factor of 2.5 to 3; cannam@128: executable files usually compress somewhat less; graphical data cannam@128: such as raster images may compress much more. cannam@128: cannam@128: 1.2. Intended audience cannam@128: cannam@128: This specification is intended for use by implementors of software cannam@128: to compress data into "deflate" format and/or decompress data from cannam@128: "deflate" format. cannam@128: cannam@128: The text of the specification assumes a basic background in cannam@128: programming at the level of bits and other primitive data cannam@128: representations. Familiarity with the technique of Huffman coding cannam@128: is helpful but not required. cannam@128: cannam@128: 1.3. Scope cannam@128: cannam@128: The specification specifies a method for representing a sequence cannam@128: of bytes as a (usually shorter) sequence of bits, and a method for cannam@128: packing the latter bit sequence into bytes. cannam@128: cannam@128: 1.4. Compliance cannam@128: cannam@128: Unless otherwise indicated below, a compliant decompressor must be cannam@128: able to accept and decompress any data set that conforms to all cannam@128: the specifications presented here; a compliant compressor must cannam@128: produce data sets that conform to all the specifications presented cannam@128: here. cannam@128: cannam@128: 1.5. Definitions of terms and conventions used cannam@128: cannam@128: Byte: 8 bits stored or transmitted as a unit (same as an octet). cannam@128: For this specification, a byte is exactly 8 bits, even on machines cannam@128: cannam@128: cannam@128: cannam@128: Deutsch Informational [Page 3] cannam@128: cannam@128: RFC 1951 DEFLATE Compressed Data Format Specification May 1996 cannam@128: cannam@128: cannam@128: which store a character on a number of bits different from eight. cannam@128: See below, for the numbering of bits within a byte. cannam@128: cannam@128: String: a sequence of arbitrary bytes. cannam@128: cannam@128: 1.6. Changes from previous versions cannam@128: cannam@128: There have been no technical changes to the deflate format since cannam@128: version 1.1 of this specification. In version 1.2, some cannam@128: terminology was changed. Version 1.3 is a conversion of the cannam@128: specification to RFC style. cannam@128: cannam@128: 2. Compressed representation overview cannam@128: cannam@128: A compressed data set consists of a series of blocks, corresponding cannam@128: to successive blocks of input data. The block sizes are arbitrary, cannam@128: except that non-compressible blocks are limited to 65,535 bytes. cannam@128: cannam@128: Each block is compressed using a combination of the LZ77 algorithm cannam@128: and Huffman coding. The Huffman trees for each block are independent cannam@128: of those for previous or subsequent blocks; the LZ77 algorithm may cannam@128: use a reference to a duplicated string occurring in a previous block, cannam@128: up to 32K input bytes before. cannam@128: cannam@128: Each block consists of two parts: a pair of Huffman code trees that cannam@128: describe the representation of the compressed data part, and a cannam@128: compressed data part. (The Huffman trees themselves are compressed cannam@128: using Huffman encoding.) The compressed data consists of a series of cannam@128: elements of two types: literal bytes (of strings that have not been cannam@128: detected as duplicated within the previous 32K input bytes), and cannam@128: pointers to duplicated strings, where a pointer is represented as a cannam@128: pair . The representation used in the cannam@128: "deflate" format limits distances to 32K bytes and lengths to 258 cannam@128: bytes, but does not limit the size of a block, except for cannam@128: uncompressible blocks, which are limited as noted above. cannam@128: cannam@128: Each type of value (literals, distances, and lengths) in the cannam@128: compressed data is represented using a Huffman code, using one code cannam@128: tree for literals and lengths and a separate code tree for distances. cannam@128: The code trees for each block appear in a compact form just before cannam@128: the compressed data for that block. cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: Deutsch Informational [Page 4] cannam@128: cannam@128: RFC 1951 DEFLATE Compressed Data Format Specification May 1996 cannam@128: cannam@128: cannam@128: 3. Detailed specification cannam@128: cannam@128: 3.1. Overall conventions In the diagrams below, a box like this: cannam@128: cannam@128: +---+ cannam@128: | | <-- the vertical bars might be missing cannam@128: +---+ cannam@128: cannam@128: represents one byte; a box like this: cannam@128: cannam@128: +==============+ cannam@128: | | cannam@128: +==============+ cannam@128: cannam@128: represents a variable number of bytes. cannam@128: cannam@128: Bytes stored within a computer do not have a "bit order", since cannam@128: they are always treated as a unit. However, a byte considered as cannam@128: an integer between 0 and 255 does have a most- and least- cannam@128: significant bit, and since we write numbers with the most- cannam@128: significant digit on the left, we also write bytes with the most- cannam@128: significant bit on the left. In the diagrams below, we number the cannam@128: bits of a byte so that bit 0 is the least-significant bit, i.e., cannam@128: the bits are numbered: cannam@128: cannam@128: +--------+ cannam@128: |76543210| cannam@128: +--------+ cannam@128: cannam@128: Within a computer, a number may occupy multiple bytes. All cannam@128: multi-byte numbers in the format described here are stored with cannam@128: the least-significant byte first (at the lower memory address). cannam@128: For example, the decimal number 520 is stored as: cannam@128: cannam@128: 0 1 cannam@128: +--------+--------+ cannam@128: |00001000|00000010| cannam@128: +--------+--------+ cannam@128: ^ ^ cannam@128: | | cannam@128: | + more significant byte = 2 x 256 cannam@128: + less significant byte = 8 cannam@128: cannam@128: 3.1.1. Packing into bytes cannam@128: cannam@128: This document does not address the issue of the order in which cannam@128: bits of a byte are transmitted on a bit-sequential medium, cannam@128: since the final data format described here is byte- rather than cannam@128: cannam@128: cannam@128: cannam@128: Deutsch Informational [Page 5] cannam@128: cannam@128: RFC 1951 DEFLATE Compressed Data Format Specification May 1996 cannam@128: cannam@128: cannam@128: bit-oriented. However, we describe the compressed block format cannam@128: in below, as a sequence of data elements of various bit cannam@128: lengths, not a sequence of bytes. We must therefore specify cannam@128: how to pack these data elements into bytes to form the final cannam@128: compressed byte sequence: cannam@128: cannam@128: * Data elements are packed into bytes in order of cannam@128: increasing bit number within the byte, i.e., starting cannam@128: with the least-significant bit of the byte. cannam@128: * Data elements other than Huffman codes are packed cannam@128: starting with the least-significant bit of the data cannam@128: element. cannam@128: * Huffman codes are packed starting with the most- cannam@128: significant bit of the code. cannam@128: cannam@128: In other words, if one were to print out the compressed data as cannam@128: a sequence of bytes, starting with the first byte at the cannam@128: *right* margin and proceeding to the *left*, with the most- cannam@128: significant bit of each byte on the left as usual, one would be cannam@128: able to parse the result from right to left, with fixed-width cannam@128: elements in the correct MSB-to-LSB order and Huffman codes in cannam@128: bit-reversed order (i.e., with the first bit of the code in the cannam@128: relative LSB position). cannam@128: cannam@128: 3.2. Compressed block format cannam@128: cannam@128: 3.2.1. Synopsis of prefix and Huffman coding cannam@128: cannam@128: Prefix coding represents symbols from an a priori known cannam@128: alphabet by bit sequences (codes), one code for each symbol, in cannam@128: a manner such that different symbols may be represented by bit cannam@128: sequences of different lengths, but a parser can always parse cannam@128: an encoded string unambiguously symbol-by-symbol. cannam@128: cannam@128: We define a prefix code in terms of a binary tree in which the cannam@128: two edges descending from each non-leaf node are labeled 0 and cannam@128: 1 and in which the leaf nodes correspond one-for-one with (are cannam@128: labeled with) the symbols of the alphabet; then the code for a cannam@128: symbol is the sequence of 0's and 1's on the edges leading from cannam@128: the root to the leaf labeled with that symbol. For example: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: Deutsch Informational [Page 6] cannam@128: cannam@128: RFC 1951 DEFLATE Compressed Data Format Specification May 1996 cannam@128: cannam@128: cannam@128: /\ Symbol Code cannam@128: 0 1 ------ ---- cannam@128: / \ A 00 cannam@128: /\ B B 1 cannam@128: 0 1 C 011 cannam@128: / \ D 010 cannam@128: A /\ cannam@128: 0 1 cannam@128: / \ cannam@128: D C cannam@128: cannam@128: A parser can decode the next symbol from an encoded input cannam@128: stream by walking down the tree from the root, at each step cannam@128: choosing the edge corresponding to the next input bit. cannam@128: cannam@128: Given an alphabet with known symbol frequencies, the Huffman cannam@128: algorithm allows the construction of an optimal prefix code cannam@128: (one which represents strings with those symbol frequencies cannam@128: using the fewest bits of any possible prefix codes for that cannam@128: alphabet). Such a code is called a Huffman code. (See cannam@128: reference [1] in Chapter 5, references for additional cannam@128: information on Huffman codes.) cannam@128: cannam@128: Note that in the "deflate" format, the Huffman codes for the cannam@128: various alphabets must not exceed certain maximum code lengths. cannam@128: This constraint complicates the algorithm for computing code cannam@128: lengths from symbol frequencies. Again, see Chapter 5, cannam@128: references for details. cannam@128: cannam@128: 3.2.2. Use of Huffman coding in the "deflate" format cannam@128: cannam@128: The Huffman codes used for each alphabet in the "deflate" cannam@128: format have two additional rules: cannam@128: cannam@128: * All codes of a given bit length have lexicographically cannam@128: consecutive values, in the same order as the symbols cannam@128: they represent; cannam@128: cannam@128: * Shorter codes lexicographically precede longer codes. cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: Deutsch Informational [Page 7] cannam@128: cannam@128: RFC 1951 DEFLATE Compressed Data Format Specification May 1996 cannam@128: cannam@128: cannam@128: We could recode the example above to follow this rule as cannam@128: follows, assuming that the order of the alphabet is ABCD: cannam@128: cannam@128: Symbol Code cannam@128: ------ ---- cannam@128: A 10 cannam@128: B 0 cannam@128: C 110 cannam@128: D 111 cannam@128: cannam@128: I.e., 0 precedes 10 which precedes 11x, and 110 and 111 are cannam@128: lexicographically consecutive. cannam@128: cannam@128: Given this rule, we can define the Huffman code for an alphabet cannam@128: just by giving the bit lengths of the codes for each symbol of cannam@128: the alphabet in order; this is sufficient to determine the cannam@128: actual codes. In our example, the code is completely defined cannam@128: by the sequence of bit lengths (2, 1, 3, 3). The following cannam@128: algorithm generates the codes as integers, intended to be read cannam@128: from most- to least-significant bit. The code lengths are cannam@128: initially in tree[I].Len; the codes are produced in cannam@128: tree[I].Code. cannam@128: cannam@128: 1) Count the number of codes for each code length. Let cannam@128: bl_count[N] be the number of codes of length N, N >= 1. cannam@128: cannam@128: 2) Find the numerical value of the smallest code for each cannam@128: code length: cannam@128: cannam@128: code = 0; cannam@128: bl_count[0] = 0; cannam@128: for (bits = 1; bits <= MAX_BITS; bits++) { cannam@128: code = (code + bl_count[bits-1]) << 1; cannam@128: next_code[bits] = code; cannam@128: } cannam@128: cannam@128: 3) Assign numerical values to all codes, using consecutive cannam@128: values for all codes of the same length with the base cannam@128: values determined at step 2. Codes that are never used cannam@128: (which have a bit length of zero) must not be assigned a cannam@128: value. cannam@128: cannam@128: for (n = 0; n <= max_code; n++) { cannam@128: len = tree[n].Len; cannam@128: if (len != 0) { cannam@128: tree[n].Code = next_code[len]; cannam@128: next_code[len]++; cannam@128: } cannam@128: cannam@128: cannam@128: cannam@128: Deutsch Informational [Page 8] cannam@128: cannam@128: RFC 1951 DEFLATE Compressed Data Format Specification May 1996 cannam@128: cannam@128: cannam@128: } cannam@128: cannam@128: Example: cannam@128: cannam@128: Consider the alphabet ABCDEFGH, with bit lengths (3, 3, 3, 3, cannam@128: 3, 2, 4, 4). After step 1, we have: cannam@128: cannam@128: N bl_count[N] cannam@128: - ----------- cannam@128: 2 1 cannam@128: 3 5 cannam@128: 4 2 cannam@128: cannam@128: Step 2 computes the following next_code values: cannam@128: cannam@128: N next_code[N] cannam@128: - ------------ cannam@128: 1 0 cannam@128: 2 0 cannam@128: 3 2 cannam@128: 4 14 cannam@128: cannam@128: Step 3 produces the following code values: cannam@128: cannam@128: Symbol Length Code cannam@128: ------ ------ ---- cannam@128: A 3 010 cannam@128: B 3 011 cannam@128: C 3 100 cannam@128: D 3 101 cannam@128: E 3 110 cannam@128: F 2 00 cannam@128: G 4 1110 cannam@128: H 4 1111 cannam@128: cannam@128: 3.2.3. Details of block format cannam@128: cannam@128: Each block of compressed data begins with 3 header bits cannam@128: containing the following data: cannam@128: cannam@128: first bit BFINAL cannam@128: next 2 bits BTYPE cannam@128: cannam@128: Note that the header bits do not necessarily begin on a byte cannam@128: boundary, since a block does not necessarily occupy an integral cannam@128: number of bytes. cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: Deutsch Informational [Page 9] cannam@128: cannam@128: RFC 1951 DEFLATE Compressed Data Format Specification May 1996 cannam@128: cannam@128: cannam@128: BFINAL is set if and only if this is the last block of the data cannam@128: set. cannam@128: cannam@128: BTYPE specifies how the data are compressed, as follows: cannam@128: cannam@128: 00 - no compression cannam@128: 01 - compressed with fixed Huffman codes cannam@128: 10 - compressed with dynamic Huffman codes cannam@128: 11 - reserved (error) cannam@128: cannam@128: The only difference between the two compressed cases is how the cannam@128: Huffman codes for the literal/length and distance alphabets are cannam@128: defined. cannam@128: cannam@128: In all cases, the decoding algorithm for the actual data is as cannam@128: follows: cannam@128: cannam@128: do cannam@128: read block header from input stream. cannam@128: if stored with no compression cannam@128: skip any remaining bits in current partially cannam@128: processed byte cannam@128: read LEN and NLEN (see next section) cannam@128: copy LEN bytes of data to output cannam@128: otherwise cannam@128: if compressed with dynamic Huffman codes cannam@128: read representation of code trees (see cannam@128: subsection below) cannam@128: loop (until end of block code recognized) cannam@128: decode literal/length value from input stream cannam@128: if value < 256 cannam@128: copy value (literal byte) to output stream cannam@128: otherwise cannam@128: if value = end of block (256) cannam@128: break from loop cannam@128: otherwise (value = 257..285) cannam@128: decode distance from input stream cannam@128: cannam@128: move backwards distance bytes in the output cannam@128: stream, and copy length bytes from this cannam@128: position to the output stream. cannam@128: end loop cannam@128: while not last block cannam@128: cannam@128: Note that a duplicated string reference may refer to a string cannam@128: in a previous block; i.e., the backward distance may cross one cannam@128: or more block boundaries. However a distance cannot refer past cannam@128: the beginning of the output stream. (An application using a cannam@128: cannam@128: cannam@128: cannam@128: Deutsch Informational [Page 10] cannam@128: cannam@128: RFC 1951 DEFLATE Compressed Data Format Specification May 1996 cannam@128: cannam@128: cannam@128: preset dictionary might discard part of the output stream; a cannam@128: distance can refer to that part of the output stream anyway) cannam@128: Note also that the referenced string may overlap the current cannam@128: position; for example, if the last 2 bytes decoded have values cannam@128: X and Y, a string reference with cannam@128: adds X,Y,X,Y,X to the output stream. cannam@128: cannam@128: We now specify each compression method in turn. cannam@128: cannam@128: 3.2.4. Non-compressed blocks (BTYPE=00) cannam@128: cannam@128: Any bits of input up to the next byte boundary are ignored. cannam@128: The rest of the block consists of the following information: cannam@128: cannam@128: 0 1 2 3 4... cannam@128: +---+---+---+---+================================+ cannam@128: | LEN | NLEN |... LEN bytes of literal data...| cannam@128: +---+---+---+---+================================+ cannam@128: cannam@128: LEN is the number of data bytes in the block. NLEN is the cannam@128: one's complement of LEN. cannam@128: cannam@128: 3.2.5. Compressed blocks (length and distance codes) cannam@128: cannam@128: As noted above, encoded data blocks in the "deflate" format cannam@128: consist of sequences of symbols drawn from three conceptually cannam@128: distinct alphabets: either literal bytes, from the alphabet of cannam@128: byte values (0..255), or pairs, cannam@128: where the length is drawn from (3..258) and the distance is cannam@128: drawn from (1..32,768). In fact, the literal and length cannam@128: alphabets are merged into a single alphabet (0..285), where cannam@128: values 0..255 represent literal bytes, the value 256 indicates cannam@128: end-of-block, and values 257..285 represent length codes cannam@128: (possibly in conjunction with extra bits following the symbol cannam@128: code) as follows: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: Deutsch Informational [Page 11] cannam@128: cannam@128: RFC 1951 DEFLATE Compressed Data Format Specification May 1996 cannam@128: cannam@128: cannam@128: Extra Extra Extra cannam@128: Code Bits Length(s) Code Bits Lengths Code Bits Length(s) cannam@128: ---- ---- ------ ---- ---- ------- ---- ---- ------- cannam@128: 257 0 3 267 1 15,16 277 4 67-82 cannam@128: 258 0 4 268 1 17,18 278 4 83-98 cannam@128: 259 0 5 269 2 19-22 279 4 99-114 cannam@128: 260 0 6 270 2 23-26 280 4 115-130 cannam@128: 261 0 7 271 2 27-30 281 5 131-162 cannam@128: 262 0 8 272 2 31-34 282 5 163-194 cannam@128: 263 0 9 273 3 35-42 283 5 195-226 cannam@128: 264 0 10 274 3 43-50 284 5 227-257 cannam@128: 265 1 11,12 275 3 51-58 285 0 258 cannam@128: 266 1 13,14 276 3 59-66 cannam@128: cannam@128: The extra bits should be interpreted as a machine integer cannam@128: stored with the most-significant bit first, e.g., bits 1110 cannam@128: represent the value 14. cannam@128: cannam@128: Extra Extra Extra cannam@128: Code Bits Dist Code Bits Dist Code Bits Distance cannam@128: ---- ---- ---- ---- ---- ------ ---- ---- -------- cannam@128: 0 0 1 10 4 33-48 20 9 1025-1536 cannam@128: 1 0 2 11 4 49-64 21 9 1537-2048 cannam@128: 2 0 3 12 5 65-96 22 10 2049-3072 cannam@128: 3 0 4 13 5 97-128 23 10 3073-4096 cannam@128: 4 1 5,6 14 6 129-192 24 11 4097-6144 cannam@128: 5 1 7,8 15 6 193-256 25 11 6145-8192 cannam@128: 6 2 9-12 16 7 257-384 26 12 8193-12288 cannam@128: 7 2 13-16 17 7 385-512 27 12 12289-16384 cannam@128: 8 3 17-24 18 8 513-768 28 13 16385-24576 cannam@128: 9 3 25-32 19 8 769-1024 29 13 24577-32768 cannam@128: cannam@128: 3.2.6. Compression with fixed Huffman codes (BTYPE=01) cannam@128: cannam@128: The Huffman codes for the two alphabets are fixed, and are not cannam@128: represented explicitly in the data. The Huffman code lengths cannam@128: for the literal/length alphabet are: cannam@128: cannam@128: Lit Value Bits Codes cannam@128: --------- ---- ----- cannam@128: 0 - 143 8 00110000 through cannam@128: 10111111 cannam@128: 144 - 255 9 110010000 through cannam@128: 111111111 cannam@128: 256 - 279 7 0000000 through cannam@128: 0010111 cannam@128: 280 - 287 8 11000000 through cannam@128: 11000111 cannam@128: cannam@128: cannam@128: cannam@128: Deutsch Informational [Page 12] cannam@128: cannam@128: RFC 1951 DEFLATE Compressed Data Format Specification May 1996 cannam@128: cannam@128: cannam@128: The code lengths are sufficient to generate the actual codes, cannam@128: as described above; we show the codes in the table for added cannam@128: clarity. Literal/length values 286-287 will never actually cannam@128: occur in the compressed data, but participate in the code cannam@128: construction. cannam@128: cannam@128: Distance codes 0-31 are represented by (fixed-length) 5-bit cannam@128: codes, with possible additional bits as shown in the table cannam@128: shown in Paragraph 3.2.5, above. Note that distance codes 30- cannam@128: 31 will never actually occur in the compressed data. cannam@128: cannam@128: 3.2.7. Compression with dynamic Huffman codes (BTYPE=10) cannam@128: cannam@128: The Huffman codes for the two alphabets appear in the block cannam@128: immediately after the header bits and before the actual cannam@128: compressed data, first the literal/length code and then the cannam@128: distance code. Each code is defined by a sequence of code cannam@128: lengths, as discussed in Paragraph 3.2.2, above. For even cannam@128: greater compactness, the code length sequences themselves are cannam@128: compressed using a Huffman code. The alphabet for code lengths cannam@128: is as follows: cannam@128: cannam@128: 0 - 15: Represent code lengths of 0 - 15 cannam@128: 16: Copy the previous code length 3 - 6 times. cannam@128: The next 2 bits indicate repeat length cannam@128: (0 = 3, ... , 3 = 6) cannam@128: Example: Codes 8, 16 (+2 bits 11), cannam@128: 16 (+2 bits 10) will expand to cannam@128: 12 code lengths of 8 (1 + 6 + 5) cannam@128: 17: Repeat a code length of 0 for 3 - 10 times. cannam@128: (3 bits of length) cannam@128: 18: Repeat a code length of 0 for 11 - 138 times cannam@128: (7 bits of length) cannam@128: cannam@128: A code length of 0 indicates that the corresponding symbol in cannam@128: the literal/length or distance alphabet will not occur in the cannam@128: block, and should not participate in the Huffman code cannam@128: construction algorithm given earlier. If only one distance cannam@128: code is used, it is encoded using one bit, not zero bits; in cannam@128: this case there is a single code length of one, with one unused cannam@128: code. One distance code of zero bits means that there are no cannam@128: distance codes used at all (the data is all literals). cannam@128: cannam@128: We can now define the format of the block: cannam@128: cannam@128: 5 Bits: HLIT, # of Literal/Length codes - 257 (257 - 286) cannam@128: 5 Bits: HDIST, # of Distance codes - 1 (1 - 32) cannam@128: 4 Bits: HCLEN, # of Code Length codes - 4 (4 - 19) cannam@128: cannam@128: cannam@128: cannam@128: Deutsch Informational [Page 13] cannam@128: cannam@128: RFC 1951 DEFLATE Compressed Data Format Specification May 1996 cannam@128: cannam@128: cannam@128: (HCLEN + 4) x 3 bits: code lengths for the code length cannam@128: alphabet given just above, in the order: 16, 17, 18, cannam@128: 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 cannam@128: cannam@128: These code lengths are interpreted as 3-bit integers cannam@128: (0-7); as above, a code length of 0 means the cannam@128: corresponding symbol (literal/length or distance code cannam@128: length) is not used. cannam@128: cannam@128: HLIT + 257 code lengths for the literal/length alphabet, cannam@128: encoded using the code length Huffman code cannam@128: cannam@128: HDIST + 1 code lengths for the distance alphabet, cannam@128: encoded using the code length Huffman code cannam@128: cannam@128: The actual compressed data of the block, cannam@128: encoded using the literal/length and distance Huffman cannam@128: codes cannam@128: cannam@128: The literal/length symbol 256 (end of data), cannam@128: encoded using the literal/length Huffman code cannam@128: cannam@128: The code length repeat codes can cross from HLIT + 257 to the cannam@128: HDIST + 1 code lengths. In other words, all code lengths form cannam@128: a single sequence of HLIT + HDIST + 258 values. cannam@128: cannam@128: 3.3. Compliance cannam@128: cannam@128: A compressor may limit further the ranges of values specified in cannam@128: the previous section and still be compliant; for example, it may cannam@128: limit the range of backward pointers to some value smaller than cannam@128: 32K. Similarly, a compressor may limit the size of blocks so that cannam@128: a compressible block fits in memory. cannam@128: cannam@128: A compliant decompressor must accept the full range of possible cannam@128: values defined in the previous section, and must accept blocks of cannam@128: arbitrary size. cannam@128: cannam@128: 4. Compression algorithm details cannam@128: cannam@128: While it is the intent of this document to define the "deflate" cannam@128: compressed data format without reference to any particular cannam@128: compression algorithm, the format is related to the compressed cannam@128: formats produced by LZ77 (Lempel-Ziv 1977, see reference [2] below); cannam@128: since many variations of LZ77 are patented, it is strongly cannam@128: recommended that the implementor of a compressor follow the general cannam@128: algorithm presented here, which is known not to be patented per se. cannam@128: The material in this section is not part of the definition of the cannam@128: cannam@128: cannam@128: cannam@128: Deutsch Informational [Page 14] cannam@128: cannam@128: RFC 1951 DEFLATE Compressed Data Format Specification May 1996 cannam@128: cannam@128: cannam@128: specification per se, and a compressor need not follow it in order to cannam@128: be compliant. cannam@128: cannam@128: The compressor terminates a block when it determines that starting a cannam@128: new block with fresh trees would be useful, or when the block size cannam@128: fills up the compressor's block buffer. cannam@128: cannam@128: The compressor uses a chained hash table to find duplicated strings, cannam@128: using a hash function that operates on 3-byte sequences. At any cannam@128: given point during compression, let XYZ be the next 3 input bytes to cannam@128: be examined (not necessarily all different, of course). First, the cannam@128: compressor examines the hash chain for XYZ. If the chain is empty, cannam@128: the compressor simply writes out X as a literal byte and advances one cannam@128: byte in the input. If the hash chain is not empty, indicating that cannam@128: the sequence XYZ (or, if we are unlucky, some other 3 bytes with the cannam@128: same hash function value) has occurred recently, the compressor cannam@128: compares all strings on the XYZ hash chain with the actual input data cannam@128: sequence starting at the current point, and selects the longest cannam@128: match. cannam@128: cannam@128: The compressor searches the hash chains starting with the most recent cannam@128: strings, to favor small distances and thus take advantage of the cannam@128: Huffman encoding. The hash chains are singly linked. There are no cannam@128: deletions from the hash chains; the algorithm simply discards matches cannam@128: that are too old. To avoid a worst-case situation, very long hash cannam@128: chains are arbitrarily truncated at a certain length, determined by a cannam@128: run-time parameter. cannam@128: cannam@128: To improve overall compression, the compressor optionally defers the cannam@128: selection of matches ("lazy matching"): after a match of length N has cannam@128: been found, the compressor searches for a longer match starting at cannam@128: the next input byte. If it finds a longer match, it truncates the cannam@128: previous match to a length of one (thus producing a single literal cannam@128: byte) and then emits the longer match. Otherwise, it emits the cannam@128: original match, and, as described above, advances N bytes before cannam@128: continuing. cannam@128: cannam@128: Run-time parameters also control this "lazy match" procedure. If cannam@128: compression ratio is most important, the compressor attempts a cannam@128: complete second search regardless of the length of the first match. cannam@128: In the normal case, if the current match is "long enough", the cannam@128: compressor reduces the search for a longer match, thus speeding up cannam@128: the process. If speed is most important, the compressor inserts new cannam@128: strings in the hash table only when no match was found, or when the cannam@128: match is not "too long". This degrades the compression ratio but cannam@128: saves time since there are both fewer insertions and fewer searches. cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: Deutsch Informational [Page 15] cannam@128: cannam@128: RFC 1951 DEFLATE Compressed Data Format Specification May 1996 cannam@128: cannam@128: cannam@128: 5. References cannam@128: cannam@128: [1] Huffman, D. A., "A Method for the Construction of Minimum cannam@128: Redundancy Codes", Proceedings of the Institute of Radio cannam@128: Engineers, September 1952, Volume 40, Number 9, pp. 1098-1101. cannam@128: cannam@128: [2] Ziv J., Lempel A., "A Universal Algorithm for Sequential Data cannam@128: Compression", IEEE Transactions on Information Theory, Vol. 23, cannam@128: No. 3, pp. 337-343. cannam@128: cannam@128: [3] Gailly, J.-L., and Adler, M., ZLIB documentation and sources, cannam@128: available in ftp://ftp.uu.net/pub/archiving/zip/doc/ cannam@128: cannam@128: [4] Gailly, J.-L., and Adler, M., GZIP documentation and sources, cannam@128: available as gzip-*.tar in ftp://prep.ai.mit.edu/pub/gnu/ cannam@128: cannam@128: [5] Schwartz, E. S., and Kallick, B. "Generating a canonical prefix cannam@128: encoding." Comm. ACM, 7,3 (Mar. 1964), pp. 166-169. cannam@128: cannam@128: [6] Hirschberg and Lelewer, "Efficient decoding of prefix codes," cannam@128: Comm. ACM, 33,4, April 1990, pp. 449-459. cannam@128: cannam@128: 6. Security Considerations cannam@128: cannam@128: Any data compression method involves the reduction of redundancy in cannam@128: the data. Consequently, any corruption of the data is likely to have cannam@128: severe effects and be difficult to correct. Uncompressed text, on cannam@128: the other hand, will probably still be readable despite the presence cannam@128: of some corrupted bytes. cannam@128: cannam@128: It is recommended that systems using this data format provide some cannam@128: means of validating the integrity of the compressed data. See cannam@128: reference [3], for example. cannam@128: cannam@128: 7. Source code cannam@128: cannam@128: Source code for a C language implementation of a "deflate" compliant cannam@128: compressor and decompressor is available within the zlib package at cannam@128: ftp://ftp.uu.net/pub/archiving/zip/zlib/. cannam@128: cannam@128: 8. Acknowledgements cannam@128: cannam@128: Trademarks cited in this document are the property of their cannam@128: respective owners. cannam@128: cannam@128: Phil Katz designed the deflate format. Jean-Loup Gailly and Mark cannam@128: Adler wrote the related software described in this specification. cannam@128: Glenn Randers-Pehrson converted this document to RFC and HTML format. cannam@128: cannam@128: cannam@128: cannam@128: Deutsch Informational [Page 16] cannam@128: cannam@128: RFC 1951 DEFLATE Compressed Data Format Specification May 1996 cannam@128: cannam@128: cannam@128: 9. Author's Address cannam@128: cannam@128: L. Peter Deutsch cannam@128: Aladdin Enterprises cannam@128: 203 Santa Margarita Ave. cannam@128: Menlo Park, CA 94025 cannam@128: cannam@128: Phone: (415) 322-0103 (AM only) cannam@128: FAX: (415) 322-1734 cannam@128: EMail: cannam@128: cannam@128: Questions about the technical content of this specification can be cannam@128: sent by email to: cannam@128: cannam@128: Jean-Loup Gailly and cannam@128: Mark Adler cannam@128: cannam@128: Editorial comments on this specification can be sent by email to: cannam@128: cannam@128: L. Peter Deutsch and cannam@128: Glenn Randers-Pehrson cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: cannam@128: Deutsch Informational [Page 17] cannam@128: