Zlib

Data format and compression library From Wikipedia, the free encyclopedia

zlib (/ˈzlɪb/ or "zeta-lib", /ˈztəˌlɪb/)[3][4] is a data format and a lossless data compression software library created by Jean-loup Gailly and Mark Adler. The library implements the Deflate algorithm and supports compressing and decompressing data using the zlib data format, the gzip file format, or simply as a Deflate stream.[5]

Developers[1]
Initial release1 May 1995 (1995-05-01)
Stable release
1.3.2[2] / 17 February 2026; 19 days ago (17 February 2026)
Written inC
Quick facts Developers, Initial release ...
zlib (library)
Developers[1]
Initial release1 May 1995 (1995-05-01)
Stable release
1.3.2[2] / 17 February 2026; 19 days ago (17 February 2026)
Written inC
Operating systemCross-platform
TypeData compression
Licensezlib License
Websitezlib.net Edit this on Wikidata
Repository
Close

zlib is also a crucial component of many software platforms, including Linux, macOS, and iOS. It has also been used in gaming consoles such as the PlayStation 4, PlayStation 3, Wii U, Wii, Xbox One and Xbox 360.[citation needed]

The first public version of Zlib, 0.9, was released on 1 May 1995 and was originally intended for use with the libpng image library. It is free software, distributed under the zlib License.

RFC 1950 specifies the zlib data format.[6]

Data format

Quick facts Internet media type, Size limitation ...
zlib (data format)
Internet media type
application/zlib[7]
Size limitationUnlimited
Developed by[8]
Type of formatData compression
CompressionLossless
Container forDeflate stream
StandardRFC 1950
Close

The zlib data format consists of a 2-byte header, an optional extra header field, Deflate-compressed data, and a 4-byte trailer.

Endianness is big-endian.[9] Bit 0 is the least significant bit in a byte.[10]

More information Offset (bytes), Field ...
Offset (bytes) Field[11] Size (bytes) Description
0 CMF 1

This byte is divided into two 4-bit fields:

  • Bits 0 to 3: CM (compression method). Must be 8 (Deflate).
  • Bits 4 to 7: CINFO (compression info). Base-2 logarithm of the LZ77 window size, minus eight. The maximum allowed value is 7 (i.e. 32 KiB window size). 6 indicates 16 KiB, 5 indicates 8 KiB, etc...
1 FLG 1

Flags.

  • Bits 0 to 4: FCHECK. This value must be chosen such that CMF*256 + FLG is a multiple of 31.
  • Bit 5: FDICT. See DICTID below.
  • Bits 6 to 7: FLEVEL (compression level). Fastest (0), fast (1), default (2) or maximum (3). Not needed for decompression, but indicates if recompression might be worthwhile.
2 DICTID 0 or 4 Adler-32 checksum of the preset DEFLATE dictionary used during compression. Present if the FDICT flag is set. The decompressor can use this checksum to determine which dictionary has been used by the compressor (e.g. deflateSetDictionary in zlib.h).
Varies Compressed data Varies Deflate stream.
ADLER32 4 Adler-32 checksum of the uncompressed data (excluding any dictionary data).
Close

Library

Encapsulation

Deflate compression typically uses the zlib data format or the gzip file format, which add a header and a trailer to the compressed data. This provides stream identification and error detection that are not provided by a Deflate stream.

The zlib format (at least 6 bytes) is smaller than the gzip format (at least 18 bytes) as the latter stores filesystem metadata.

Algorithm

As of September 2018, zlib only supports one algorithm, called DEFLATE, which uses a combination of a variation of LZ77 (Lempel–Ziv 1977) and Huffman coding.[12] This algorithm provides good compression on a wide variety of data with minimal use of system resources. This is also the algorithm used in the Zip archive format. The header makes allowance for other algorithms, but none are currently implemented.

Resource use

zlib provides facilities for control of processor and memory use. A compression level value may be supplied that trades speed for compression. There are also facilities for conserving memory, useful in restricted memory environments, such as some embedded systems.

Strategy

The compression can be optimized for specific types of data. If one is using the library to always compress specific types of data, then using a specific strategy may improve compression and performance. For example, if the data contain long lengths of repeated bytes, the run-length encoding (RLE) strategy may give good results at a higher speed. For general data, the default strategy is preferred.

Error handling

Errors in compressed data may be detected and skipped. Further, if "full-flush" points are written to the compressed stream, then corrupt data can be skipped, and the decompression will resynchronize at the next flush point—although no error recovery of the corrupt data is provided. Full-flush points are useful for large data streams on unreliable channels, where some data loss is unimportant, such as in some multimedia applications. However, creating many flush points can affect the speed as well as the amount (ratio) of compression.

Data length

There is no limit to the length of data that can be compressed or decompressed. Repeated calls to the library allow an unlimited number of blocks of data to be handled. Some ancillary code (counters) may suffer from overflow for long data streams, but this does not affect the actual compression or decompression.

When compressing a long (or infinite) data stream, it is advisable to write regular full-flush points.

Applications

Today, zlib is something of a de facto standard, to the point that zlib and DEFLATE are often used interchangeably in standards documents, with thousands of applications relying on it for compression, either directly or indirectly.[13] These include:

zlib is also used in many embedded devices, such as the Apple iPhone and Sony PlayStation 3, because the code is portable, liberally licensed, and has a relatively small memory footprint.

Forks

A commonly used library built on an old codebase, zlib is also frequently forked by third-parties that claim improvements to this library:

See also

References

Related Articles

Wikiwand AI