Jeff Garzik first reached out to the Bitcoin community several days ago to call for review and testing. Developer Pieter Wuille explained why this implementation was so long in the making, despite having been on the backburner for years, on SourceForge:
Historically, this mode of operation has been known for years (Greg Maxwell wrote up a description of a very similar method in https://en.bitcoin.it/wiki/User:Gmaxwell/Reverse_header-fetching_sync in early 2012, but it was known before that), but it took a long time to refactor these code enough to support it…So, the code is available as a github pull request (https://github.com/bitcoin/bitcoin/pull/4468), or packaged on https://bitcoin.sipa.be/builds/headersfirst, where you can also find binaries to test with.
Other potential future changes include CHECKLOCKTIMEVERIFY, presented by Peter Todd a few weeks ago, and Invertible Bloom Lookup Tables, proposed by Gavin Andresen. With this newest update, which will be pushed out in Bitcoin Core version 0.10, running a Bitcoin node will become a lot less cumbersome. Eventually, some hope, it will even be possible to run a full Bitcoin node on a mobile device, the way that one can use an android device to earn Bitcoins while supporting the Tor network. For now, though, a Raspberry Pi will have to do.
What do you think about this new development? Comment below!
Images from Shutterstock.
Last modified (UTC): October 18, 2014 05:07