LZMA

<p>The Lempel–Ziv–Markov chain algorithm (LZMA) is an <a href="/facts/Algorithm/fnl5NmRt">algorithm</a> used to perform <a href="/facts/Lossless_data_compression/LS702KsN">lossless data compression</a>. It has been used in the <a href="/facts/7z/qG1rNuWr">7z</a> format of the <a href="/facts/7-Zip/0Y8ItlHs">7-Zip</a> archiver since 2001. This algorithm uses a <a href="/facts/Dictionary_coder/Y0u9Ysz5">dictionary compression</a> scheme somewhat similar to the <a href="/facts/LZ77/HGH09JM9">LZ77</a> algorithm published by <a href="/facts/Abraham_Lempel/689EaYp3">Abraham Lempel</a> and <a href="/facts/Jacob_Ziv/GKDe7C9b">Jacob Ziv</a> in 1977 and features a high compression ratio (generally higher than <a href="/facts/Bzip2/waffQ2m0">bzip2</a>) and a variable compression-dictionary size (up to 4 <a href="/facts/Gigabyte/s2hb2SEg">GB</a>), while still maintaining decompression speed similar to other commonly used compression algorithms.
</p><p>LZMA2 is a simple container format that can include both uncompressed data and LZMA data, possibly with multiple different LZMA encoding parameters.  LZMA2 supports arbitrarily scalable multithreaded compression and decompression and efficient compression of data which is partially incompressible.
</p>

LZMA open-in-new

LZMA