title: Is Terra Compression possible? If so, please explain and provide samples
body: <p>Long Ascii String Text may or may not be crushed and compressed into hash kind of ascii "checksum" by using sophisticated mathematical formula/algorithm. Just like air which can be compressed. </p>
  
  <p>To compress megabytes of ascii text into a 128 or so bytes, by shuffling, then mixing new "patterns" of single "bytes" turn by turn from the first to the last. When we are decompressing it, the last character is extracted first, then we just go on decompression using the formula and the sequential keys from the last to the first. The sequential keys and the last and the first bytes must be exactly known, including the fully updated final compiled string, and the total number of bytes which were compressed. </p>
  
  <p>This is the terra compression I was thinking about. Is this possible? Can you explain examples. I am working on this theory and it is my own thought.</p>