Min. : 1.009
1st Qu. : 7.036
Median : 35.006
Mean : 35.018
3rd Qu. : 49.258
Max. : 154.684
Min. : 1.119
1st Qu. : 4.886
Median : 14.585
Mean : 20.116
3rd Qu. : 31.442
Max. :138.694
I had the same thought. Everything they publish points to Bitcoin.core and they've not made any recent statements (almost suspicious by their absence).I am wondering about 21 Co. They are smart people and were voting for 8MB with their scriptsig for a while. But now that they are developing a LN-type solution
I am wondering what is the advantage for thin blocks over IBLT and why not just implement IBLT first.extreme thin blocks is really working!!
2016-02-17 21:00:14 Reassembled thin block for 00000000000000000103fbd5825a1ef895303c9791115a25974acebdeb797cb1 (949180 bytes). Message was 16580 bytes, compression ratio 57.248493
(that's the highest compression of a near 1MB block I got in a few hours)
Couple of monster txns in this one:
2016-02-17 21:41:03 Reassembled thin block for 00000000000000000236b1c505e8bc8b8b8991a9d01d5f5a51c01f8504a87f5f (291671 bytes). Message was 3093 bytes, compression ratio 94.300354
Yes. 21.co could be hedging bets on a block size limited Bitcoin. They also might want off-chain for all their IoT traffic, so will use that for device-to-device payments, but not deliberately forcing normal user traffic off-chain like BS seems to want.If you were in charge of 21.co what would you do? So I assume they are just hedging their bets?
The rise of ubiquitous and ultra cheap web connected smart phones is an irreversible force sweeping the globe.Back in 2011, this was just a dream:
http://mashable.com/2016/02/17/world-cheapest-phone-freedom251/#5kN2rjOufOqp
In practice the requesting of missing tx's is quite rare occurence, due to fast propagation of transactions versus the block interval. Also the relative simplicity of xthins is a big plus.Thin blocks work if the receiving node already has all the transactions in their mempool. But if any are missing then the receiver has to make a request for the missing transactions. This slows down propagation since there is a series of events of initial data transfer, processing, new requests, new data transfer and further processing.
Xthin blocks "work" if the receiving node does NOT have all the transactions in its mempool too [1]. When the receiving node makes its get-block request, it attaches a bloom filter that describes the contents of its mempool. The transmitting node then sends the Xthin block + any missing transactions in full as inferred from the bloom filter. This is fast and efficient.I am wondering what is the advantage for thin blocks over IBLT and why not just implement IBLT first.
Thin blocks work if the receiving node already has all the transactions in their mempool. But if any are missing then the receiver has to make a request for the missing transactions. This slows down propagation since there is a series of events of initial data transfer, processing, new requests, new data transfer and further processing.
IBLT however let's the receiver reassemble missing transactions from the data already sent. This saves network requests which is the main source of delays.