> In this implementation, to maximise performance, we consider each individual byte of the file separately, and look it up in π. I don't get it. we simply repl

> In this implementation, to maximise performance, we consider each individual byte of the file separately, and look it up in π. I don't get it. we simply replace one byte (the data) in another byte, or even more than that (the index in pi) What am I missing? Besides, why do you have to "search" pi? why not just make a table mapping all possible 2/3/4 bytes (256^(2/3/4) combinations) to it's corresponding positions in pi, and every subsequent compression will run much more efficiently. BTW, it is very easy to show that a simple huffman code based compression yields a better compression ratio than this method.