Scroll to navigation

MINILZIP(1) User Commands MINILZIP(1)

NAME

minilzip - reduces the size of files

SYNOPSIS

minilzip [options] [files]

DESCRIPTION

Minilzip is a test program for the compression library lzlib, compatible (interoperable) with lzip 1.4 or newer.

Lzip is a lossless data compressor with a user interface similar to the one of gzip or bzip2. Lzip uses a simplified form of the 'Lempel-Ziv-Markov chain-Algorithm' (LZMA) stream format to maximize interoperability. The maximum dictionary size is 512 MiB so that any lzip file can be decompressed on 32-bit machines. Lzip provides accurate and robust 3-factor integrity checking. Lzip can compress about as fast as gzip (lzip -0) or compress most files more than bzip2 (lzip -9). Decompression speed is intermediate between gzip and bzip2. Lzip is better than gzip and bzip2 from a data recovery perspective. Lzip has been designed, written, and tested with great care to replace gzip and bzip2 as the standard general-purpose compressed format for Unix-like systems.

OPTIONS

display this help and exit
output version information and exit
exit with error status if trailing data
set member size limit in bytes
write to standard output, keep input files
decompress, test compressed file integrity
overwrite existing output files
force re-compression of compressed files
keep (don't delete) input files
set match length limit in bytes [36]
write to <file>, keep input files
suppress all messages
set dictionary size limit in bytes [8 MiB]
set volume size limit in bytes
test compressed file integrity
be verbose (a 2nd -v gives more)
-0 .. -9
set compression level [default 6]
alias for -0
alias for -9
allow trailing data seeming corrupt header
compare version of lzlib.h with liblz.{a,so}

If no file names are given, or if a file is '-', minilzip compresses or decompresses from standard input to standard output. Numbers may be followed by a multiplier: k = kB = 10^3 = 1000, Ki = KiB = 2^10 = 1024, M = 10^6, Mi = 2^20, G = 10^9, Gi = 2^30, etc... Dictionary sizes 12 to 29 are interpreted as powers of two, meaning 2^12 to 2^29 bytes.

The bidimensional parameter space of LZMA can't be mapped to a linear scale optimal for all files. If your files are large, very repetitive, etc, you may need to use the options --dictionary-size and --match-length directly to achieve optimal performance.

To extract all the files from archive 'foo.tar.lz', use the commands 'tar -xf foo.tar.lz' or 'minilzip -cd foo.tar.lz | tar -xf -'.

Exit status: 0 for a normal exit, 1 for environmental problems (file not found, invalid command-line options, I/O errors, etc), 2 to indicate a corrupt or invalid input file, 3 for an internal consistency error (e.g., bug) which caused minilzip to panic.

The ideas embodied in lzlib are due to (at least) the following people: Abraham Lempel and Jacob Ziv (for the LZ algorithm), Andrei Markov (for the definition of Markov chains), G.N.N. Martin (for the definition of range encoding), Igor Pavlov (for putting all the above together in LZMA), and Julian Seward (for bzip2's CLI).

REPORTING BUGS

Report bugs to lzip-bug@nongnu.org
Lzlib home page: http://www.nongnu.org/lzip/lzlib.html

COPYRIGHT

Copyright © 2024 Antonio Diaz Diaz. License GPLv2+: GNU GPL version 2 or later <http://gnu.org/licenses/gpl.html>
This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law. Using lzlib 1.15-pre1 Using LZ_API_VERSION = 1015

SEE ALSO

The full documentation for minilzip is maintained as a Texinfo manual. If the info and minilzip programs are properly installed at your site, the command

info lzlib

should give you access to the complete manual.

April 2024 minilzip 1.15-pre1