compress

compress is a Unix shell compression program based on the LZW compression algorithm. Compared to gzip's fastest setting, compress is slightly slower at compression, slightly faster at decompression, and has a significantly lower compression ratio. 1.8 MiB of memory is used to compress the Hutter Prize data, slightly more than gzip's slowest setting.

The uncompress utility will restore files to their original state after they have been compressed using the ''compress'' utility. If no files are specified, the standard input will be uncompressed to the standard output.

Description

Files compressed by ''compress'' are typically given the extension ".Z" (modeled after the earlier pack program which used the extension ".z"). Most ''tar'' programs will pipe their data through ''compress'' when given the command line option "-Z". (The ''tar'' program in its own does not compress; it just stores multiple files within one tape archive.)

Files can be returned to their original state using ''uncompress''. The usual action of ''uncompress'' is not merely to create an uncompressed copy of the file, but also to restore the timestamp and other attributes of the compressed file.

For files produced by ''compress'' on other systems, ''uncompress'' supports 9- to 16-bit compression.

History

The LZW algorithm used in was patented by Sperry Research Center in 1983. Terry Welch published an IEEE article on the algorithm in 1984, but failed to note that he had applied for a patent on the algorithm. Spencer Thomas of the University of Utah took this article and implemented in 1984, without realizing that a patent was pending on the LZW algorithm. The GIF image format also incorporated LZW compression in this way, and Unisys later claimed royalties on implementations of GIF. Joseph M. Orost led the team and worked with Thomas et al. to create the 'final' (4.0) version of and published it as free software to the 'net.sources' USENET group in 1985. was granted in 1985, and this is why could not be used without paying royalties to Sperry Research, which was eventually merged into Unisys.

has fallen out of favor in particular user-groups because it makes use of the LZW algorithm, which was covered by a Unisys patentbecause of this, gzip and bzip2 increased in popularity on Linux-based operating systems due to their alternative algorithms, along with better file compression. ''compress'' has, however, maintained a presence on Unix and BSD systems and the and commands have also been ported to the IBM i operating system.

The US LZW patent expired in 2003, so it is now in the public domain in the United States. All patents on the LZW worldwide have also expired (see Graphics Interchange Format#Unisys and LZW patent enforcement).

As of POSIX.1-2024 ''compress'' supports the DEFLATE algorithm used in gzip.

Special output format

The output binary consists of bit groups. Each bit group consists of codes with fixed amount of bits (9–16). Each group, except the last group, is aligned to the number of bits per code multiplied by 8 and right padded with zeroes. The last group is aligned to 8 bit octets and padded with zeroes. More information can be found at an issue on the ''ncompress'' GitHub repository.

Example:
: Suppose the output has ten 9-bit codes, five 10-bit codes, and thirteen 11-bit codes. There are three groups to output containing 90 bits, 50 bits, and 143 bits of data.
:* First group will be 90 bits of data + 54 zero bits of padding in order to be aligned to 72 bits (9 bits × 8).
:* Second group will be 50 bits of data + 30 zero bits of padding in order to be aligned to 80 bits (10 bits × 8).
:* Third group will be 143 bits of data + 1 zero bit of padding in order to be aligned to 8 bits (since this is the last group in the output).

It is actually a bug. LZW does not require any alignment. This bug existed for more than 35 years and was in the original UNIX ''compress'', ''ncompress'', ''gzip'' and the Windows port. All ''application/x-compress'' files were created using this bug.

Some compress implementations write random bits from uninitialized buffer in paddings. There is no guarantee that the paddings will be zeroes. The decompressor must ignore the values in the paddings for compatibility.

Standardization and availability

compress was standardized in X/Open CAE Specification in 1994, and further in The Open Group Base Specifications, Issue 6 and 7. Linux Standard Base does not requires compress.

compress is often not installed by default in Linux distributions, but can be installed from an additional package. compress is available for FreeBSD, OpenBSD, MINIX, Solaris and AIX.

compress is allowed for Point-to-Point Protocol in and for HTTP/1.1 in , though it is rarely used in modern deployments as the better deflate/gzip is available.

The gunzip utility is able to decompress .Z files.

See also

* Data compression
* Image compression
* List of Unix commands
* gzip

References

External links

*
*
*
*
*

ncompress
- public domain compress/uncompress implementation for POSIX systems

compress
- original Unix compress (in a compress'd archive)

compress
- original Unix compress executable (gzip'd)

Source Code for compress v4.0
(gzip'd sharchives)

ZIP File containing a Windows port of the compress utility

source code to the current version of fcompress.c from compress

bit groups alignment
- Explanation of bit groups alignment.

lzws
- New library and CLI, implemented without legacy code.

ruby-lzws
- Ruby bindings with streaming support.

{{Archive formats
Data compression software
Unix archivers and compression-related utilities
Standard Unix programs
Unix SUS2008 utilities
IBM i Qshell commands