Quote from: knightdk on September 10, 2015, 02:50:06 AM

I don't think blocks are easily compressed. The data is rather random since hashes are random and in order to preserve all of the data so it can be verified, it must be losslessly compressed. However, since there isn't that much of a pattern to the data, it becomes rather difficult to losslessly compress blocks with a good compression ratio.

your probably right.

Quote from: Peter R on September 10, 2015, 02:41:47 AM

The p2p protocol presently only supports propagation of solved blocks in full; i.e., blocks are not compressed.

However, the Corallo Relay Network does support a sort of compression. Rather than transmitting all the transactions in a solved blocks, since most the other miners know about them already, it just transmits indices that refer to each transaction (sort of like a map for how the TXs fit in the block). Greg Maxwell claims that the Corallo Relay Network attains a coding gain of about 250 (1 MB is compressed to about 4 kilobytes); however, I believe it is less in practice.

Techniques like invertible bloom lookup tables (IBLTs) could also be used to compress solved blocks in the future; Rusty Russell is presently researching this possibility.

Compression of solved blocks has the effect of reducing the network propagation impedance. It results in lower fees to users (positive) but also lower fees to spammers (negative). This chart shows how fees decline with improvements to network propagation impedance (x-axis in the chart):

Source: https://dl.dropboxusercontent.com/u/43331625/feemarket.pdf

this "Corallo Relay Network" sounds like what bitcoin needs to scale properly. 250 coding gain, that's great!