 bzip2 compresses data in blocks of size between 100 and 900 kB and uses the Burrows–Wheeler transform to convert frequently-recurring character sequences into strings of identical letters.It then applies move-to-front transform and Huffman coding.bzip2's ancestor bzip used arithmetic coding instead of Huffman.