New PoW method: Data compression

[ir.hn]

A guy here named GingerAle had a post here about compressing the blockchain or using it as a proof of work method.  The post seems to be gone so I'm not sure if he was embarrassed that compressing the blockchain likely wouldn't work, or if he was excited about the possibility of having discovered a new proof of work method and didn't want people to find out.

In any case I described in his post that if you convert a hash output to binary, this code can be compressed.  The act of compressing it can be a proof of work that would be relatively easy for others to verify.  The problem is that it would be highly parralelizable lending to ASIC dominance.  I think my previously described method of finding one sufficiently large factor of a 100+ digit number would be more resistant to GPU's and ASIC's and also even faster to verify.  But compression is still an interesting option.

For example if you have a base 2 system you can easily compress that using a base 10 system

1110011011010100111100001101000

becomes

3120210210101204140210130

basically the number of each string of 1's or 0's is called out.

This could be an interesting proof of work option and can be included in other PoW protocols.