https://en.bitcoin.it/w/api.php?action=feedcontributions&feedformat=atom&user=Devrandom 2026-04-09T09:57:33Z User contributions MediaWiki 1.43.8 https://en.bitcoin.it/w/index.php?title=Gitian_Project&diff=64135 2017-10-29T03:37:42Z

<p>Devrandom: Created page with &quot;The [https://gitian.org/ Gitian Project] is used to create deterministic builds of Bitcoin Core. This allows identical binaries to be independently built and signed by multip...&quot;</p> <hr /> <div>The [https://gitian.org/ Gitian Project] is used to create deterministic builds of Bitcoin Core. This allows identical binaries to be independently built and signed by multiple developers, thereby eliminating the build process as a single point of security failure.</div>

Devrandom https://en.bitcoin.it/w/index.php?title=Developers&diff=64134 2017-10-29T03:34:29Z

<p>Devrandom: devrandom / Gitian Project</p> <hr /> <div>* '''This list is not complete.''' Please make updates/corrections as needed.<br /> * Attempt to sort by contribution<br /> * Legend:<br /> ** &quot;Author&quot; = original author; &quot;Lead&quot; = current project lead<br /> {|<br /> | style=&quot;background:#90ff90&quot; | active maintainer<br /> | style=&quot;background:#ffffaa&quot; | has made contributions<br /> | style=&quot;background:#ff9090&quot; | no involvement<br /> |}<br /> <br /> {|<br /> ! Name !! Reference !! bitcoinj !! BFGMiner !! Tools !! Libbitcoin !! Gentoo !! Supybot !! Other<br /> |-<br /> | Satoshi Nakamoto<br /> |style=&quot;background:#ffffaa&quot;|Author<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |style=&quot;background:#90ff90&quot;|Bitcoin original designer<br /> |-<br /> | Wladimir J. van der Laan<br /> | {{Yes|Lead}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Pieter Wuille<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | [[User:Gavinandresen|Gavin Andresen]]<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |style=&quot;background:#90ff90&quot;|Author<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Cory Fields<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Matt Corallo<br /> | {{Table Value Yes}}<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Jonas Schnelli<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Luke Dashjr<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> |style=&quot;background:#90ff90&quot;|Lead<br /> | {{Table Value No}}<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value Yes}}<br /> | {{Table Value Yes}}<br /> |style=&quot;background:#90ff90&quot;|URI, Wallet protocols, [[Eloipool]]<br /> |-<br /> | fanquake<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Jorge Timón<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Gregory Maxwell<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Peter Todd<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | cozz<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Patrick Strateman<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |style=&quot;background:#ffffaa&quot;|Author<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Giel van Schijndel<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | rebroad<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | sirius-m<br /> |style=&quot;background:#ffffaa&quot;|Retired<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | tcatm<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value Yes}}<br /> |-<br /> | Jeff Garzik<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> |style=&quot;background:#ffffaa&quot;|Author<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |style=&quot;background:#90ff90&quot;|[[pushpool]]<br /> |-<br /> | Diapolo<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Mike Hearn<br /> | {{Table Value No}}<br /> |style=&quot;background:#90ff90&quot;|Author<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Andreas Schildbach<br /> | {{Table Value No}}<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | devrandom<br /> | {{Table Value No}}<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |style=&quot;background:#90ff90&quot;|[[Gitian Project]]<br /> |-<br /> | Daniel Folkinshteyn<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value Yes}}<br /> |-<br /> | Amir Taaki<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |style=&quot;background:#90ff90&quot;|Author<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |style=&quot;background:#90ff90&quot;|[[Libbitcoin_Explorer|SX]], [[Libbitcoin_Server|Obelisk]]<br /> |-<br /> | Eric Voskuil<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |style=&quot;background:#90ff90&quot;|Lead<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |style=&quot;background:#90ff90&quot;|[[Libbitcoin_Explorer|BX]], [[Libbitcoin_Server|BS]]<br /> |-<br /> | Phillip Mienk<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | William Swanson<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Neill Miller<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Pablo Castellano<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Noel Maersk<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Kamil Domański<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | bobalot<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | drwasho<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | saracen<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Matt Giuca<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Con Kolivas<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Mizery De Aria<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |style=&quot;background:#90ff90&quot;|Author<br /> | {{Table Value No}}<br /> |-<br /> | Laurent Bachelier<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> |-<br /> | Florian Schmaus<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> |-<br /> | BioMike<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value Yes}}<br /> | {{Table Value No}}<br /> |-<br /> | Chris Moore<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Marius Hanne<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | David FRANCOIS<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Nils Schneider<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Fabian H jr.<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | ovdeathiam<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Dev Random<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Michal Zima<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Venkatesh Srinivas<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Vegard Nossum<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | JoelKatz<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Joerie de Gram<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Johannes Henninger<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Jeroenz0r<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Han Lin Yap<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Abraham Jewowich<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Michael Bemmerl<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Eric Hosmer<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Dawid Spiechowicz<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Stéphane Gimenez<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Patrick Varilly<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Jay Weisskopf<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Dylan Noblesmith<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | James Burkle<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Jordan Lewis<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Dean Lee<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | xHire<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | HostFat<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Jakob Kramer<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | ariel<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | dabaopku<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Federico Faggiano<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | m0ray<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Danube<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Carlos Pizarro<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Blitzboom<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Daniel Holbert<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Jaromil<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Carlo Alberto Ferraris<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Forrest Voight<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Amir Yalon<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | John Maguire<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Ricardo M. Correia<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Dan Helfman<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | gjs278<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Dan Loewenherz<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Eric Swanson<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Santiago M. Mola<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Shane Wegner<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Sven Slootweg<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | ojab<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | sandos<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | Witchspace<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |-<br /> | [[laszlo]]<br /> |style=&quot;background:#ffffaa&quot;|<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> | {{Table Value No}}<br /> |}<br /> <br /> ==See Also==<br /> <br /> * [https://bitcoin.org/en/development List of developers on bitcoin.org]<br /> * [[Original client developers]]<br /> * [[People]]<br /> <br /> [[Category:Developer]]</div>

Devrandom https://en.bitcoin.it/w/index.php?title=Block_chain_download&diff=27522 2012-06-07T05:10:00Z

<p>Devrandom: </p> <hr /> <div>== Bitcoin Chain Download ==<br /> <br /> See also [[Satoshi Client Block Exchange]] for an overview.<br /> <br /> === Downloader Behavior ===<br /> <br /> * When receiving an inv<br /> ** For each block<br /> *** If already have as orphan, send getblocks(locator(chainHead), orphanRoot(block))<br /> *** If not already have<br /> **** send getdata(block)<br /> *** If already have and this is last block in message NOTE: this triggers specific behavior in peer getdata<br /> **** send getdata(block)<br /> <br /> * When receiving a block<br /> ** If already have, ignore<br /> ** Else if have parent not in main chain<br /> *** store as orphan<br /> *** getblocks(locator(chainHead), orphanRoot(block))<br /> ** Else<br /> *** Accept block<br /> *** Accept orphan blocks that depend on this one<br /> <br /> * When starting download from a peer<br /> ** getblocks(locator(chainHead), 0)<br /> <br /> <br /> === Responder Behavior ===<br /> <br /> * When receiving getdata, for each requested block<br /> ** Send block<br /> ** If block == hashContinue(peer)<br /> *** send inv(chainHead)<br /> *** set hashContinue(peer)=0<br /> <br /> * When receiving getblocks(locator, hashStop)<br /> ** Iterate from locate(locator)-&gt;next, going forward in chain<br /> *** If reached hashStop or ran off end of chain, break<br /> *** If reached limit of 500 or buffer limit<br /> **** Set current hashContinue(peer) to current block hash<br /> **** break<br /> *** Send inv for block<br /> <br /> * When receiving getheaders(hashLocator, hashStop)<br /> ** If hashLocator = 0, return block(hashStop)<br /> ** Send up to 2000 block headers, iterating from block(hashLocator) to hashStop<br /> <br /> === Locator ===<br /> <br /> Downloader: create locator(block)<br /> * For 1..10<br /> ** block = block-&gt;prev<br /> ** add block-&gt;hash<br /> * step = 1<br /> * Do<br /> ** block = block-&gt;prev 'step' times<br /> ** add block-&gt;hash<br /> ** step = step * 2<br /> * add genesis-&gt;hash<br /> <br /> Responder: locate(locator)<br /> * Foreach hash in locator<br /> ** If hash exists in main chain, return block<br /> * Otherwise return genesis block<br /> <br /> == Analysis ==<br /> <br /> Observations:<br /> <br /> * the locator is dense near downloader chain head, and exponentially sparse as it goes towards the genesis<br /> * downloading is accomplished in cooperation:<br /> ** downloader sends getblocks with locator based on downloader chain head<br /> ** responder sends invs for first 500 blocks going forward from latest common block (approximate, per locator)<br /> ** downloader sends getdata for blocks it does not have<br /> ** responder sends blocks and a gratuitious inv for reponder chain head<br /> ** downloader incorporates blocks into chain and now has a new chain head<br /> ** downloader sends another getblocks in response to the gratuitious inv with new locator based on new chain head<br /> <br /> Here are some cases. dChainHead is the downloader chain head, rChainHead is the responder chain head.<br /> <br /> === Single Block Case ===<br /> <br /> * Responder sends an inv for a newly solved block<br /> * Downloader sends getdata<br /> * Responder sends block<br /> <br /> === Small Catchup Case ===<br /> <br /> * Downloader sends getblocks(locator(dChainHead), 0)<br /> * Responder sends invs for blocks from dChainHead to rChainHead<br /> * Downloader sends getdata for each inv<br /> * Responder sends blocks for each getdata<br /> <br /> === Large Catchup Case ===<br /> <br /> * Downloader sends getblocks(locator(dChainHead), 0)<br /> * Responder sends invs for blocks from dChainHead to dChainHead + 500<br /> * (getdata / blocks sent by responder / blocks added to chain by downloader)<br /> * The last getdata triggers an inv(rChainHead)<br /> * Downloader sends getdata(rChainHead)<br /> * Responder sends block<br /> * Downloader puts block on orphan list<br /> * Downloader sends getblocks(locator(dChainHead), rChainHead)<br /> * goto step 2<br /> <br /> === Side Chain Case ===<br /> <br /> * Downloader sends getblocks(locator(dChainHead), 0)<br /> * Responder does not have dChainHead in best chain. Responder iterates over locator until it finds a block in common for the two chains.<br /> * Responder sends invs for blocks from commonBlock to rChainHead<br /> * Downloader adds the blocks that it did not have and reorganizes<br /> <br /> For this to work, the invs must fit the network buffer.<br /> <br /> === Large Side Chain Case ===<br /> <br /> More invs than fits the network buffer.<br /> <br /> If the side chain has blocks than fits in the network buffer this does not seem to work. getblocks(locator(dChainHead), rChainHead) will not return enough blocks for the Downloader to switch chains. If the Downloader does not switch chains, it will send the same getblocks message again.<br /> <br /> <br /> [[Category:Technical]]<br /> [[Category:Vocabulary]]</div>

Devrandom https://en.bitcoin.it/w/index.php?title=Block_chain_download&diff=27521 2012-06-07T05:03:19Z

<p>Devrandom: </p> <hr /> <div>== Bitcoin Chain Download ==<br /> <br /> See also [[Satoshi Client Block Exchange]] for an overview.<br /> <br /> === Downloader Behavior ===<br /> <br /> * When receiving an inv<br /> ** For each block<br /> *** If already have as orphan, send getblocks(locator(chainHead), orphanRoot(block))<br /> *** If not already have<br /> **** send getdata(block)<br /> *** If already have and this is last block in message NOTE: this triggers specific behavior in peer getdata<br /> **** send getdata(block)<br /> <br /> * When receiving a block<br /> ** If already have, ignore<br /> ** Else if have parent not in main chain<br /> *** store as orphan<br /> *** getblocks(locator(chainHead), orphanRoot(block))<br /> ** Else<br /> *** Accept block<br /> *** Accept orphan blocks that depend on this one<br /> <br /> * When starting download from a peer<br /> ** getblocks(locator(chainHead), 0)<br /> <br /> <br /> === Responder Behavior ===<br /> <br /> * When receiving getdata, for each requested block<br /> ** Send block<br /> ** If block == hashContinue(peer)<br /> *** send inv(chainHead)<br /> *** set hashContinue(peer)=0<br /> <br /> * When receiving getblocks(locator, hashStop)<br /> ** Iterate from locate(locator)-&gt;next, going forward in chain<br /> *** If reached hashStop or ran off end of chain, break<br /> *** If reached limit of 500 or buffer limit<br /> **** Set current hashContinue(peer) to current block hash<br /> **** break<br /> *** Send inv for block<br /> <br /> * When receiving getheaders(hashLocator, hashStop)<br /> ** If hashLocator = 0, return block(hashStop)<br /> ** Send up to 2000 block headers, iterating from block(hashLocator) to hashStop<br /> <br /> === Locator ===<br /> <br /> Downloader: create locator(block)<br /> * For 1..10<br /> ** block = block-&gt;prev<br /> ** add block-&gt;hash<br /> * step = 1<br /> * Do<br /> ** block = block-&gt;prev 'step' times<br /> ** add block-&gt;hash<br /> ** step = step * 2<br /> * add genesis-&gt;hash<br /> <br /> Responder: locate(locator)<br /> * Foreach hash in locator<br /> ** If hash exists in main chain, return block<br /> * Otherwise return genesis block<br /> <br /> == Analysis ==<br /> <br /> Observations:<br /> <br /> * the locator is dense near downloader chain head, and exponentially sparse as it goes towards the genesis<br /> * downloading is accomplished in cooperation:<br /> ** downloader sends getblocks with locator based on downloader chain head<br /> ** responder sends invs for first 500 blocks going forward from latest common block (approximate, per locator)<br /> ** downloader sends getdata for blocks it does not have<br /> ** responder sends blocks and a gratuitious inv for reponder chain head<br /> ** downloader incorporates blocks into chain and now has a new chain head<br /> ** downloader sends another getblocks in response to the gratuitious inv with new locator based on new chain head<br /> <br /> Here are some cases. dChainHead is the downloader chain head, rChainHead is the responder chain head.<br /> <br /> === Single Block Case ===<br /> <br /> * Responder sends an inv for a newly solved block<br /> * Downloader sends getdata<br /> * Responder sends block<br /> <br /> === Small Catchup Case ===<br /> <br /> * Downloader sends getblocks(locator(dChainHead), 0)<br /> * Responder sends invs for blocks from dChainHead to rChainHead<br /> * Downloader sends getdata for each inv<br /> * Responder sends blocks for each getdata<br /> <br /> === Large Catchup Case ===<br /> <br /> * Downloader sends getblocks(locator(dChainHead), 0)<br /> * Responder sends invs for blocks from dChainHead to dChainHead + 500<br /> * (getdata / blocks sent by responder / blocks added to chain by downloader)<br /> * The last getdata triggers an inv(rChainHead)<br /> * Downloader sends getdata(rChainHead)<br /> * Responder sends block<br /> * Downloader puts block on orphan list<br /> * Downloader sends getblocks(locator(dChainHead), rChainHead)<br /> * goto step 2<br /> <br /> === Side Chain Case ===<br /> <br /> Less than 500 blocks.<br /> <br /> * Downloader sends getblocks(locator(dChainHead), 0)<br /> * Responder does not have dChainHead in best chain. Responder iterates over locator until it finds a block in common for the two chains.<br /> * Responder sends invs for blocks from commonBlock to commonBlock + 500<br /> * Downloader adds the blocks that it did not have and reorganizes<br /> <br /> === Large Side Chain Case ===<br /> <br /> More than 500 blocks.<br /> <br /> If the side chain has more than 500 blocks this does not seem to work. getblocks(locator(dChainHead), rChainHead) will not return enough blocks for the Downloader to switch chains. If the Downloader does not switch chains, it will send the same getblocks message again.<br /> <br /> <br /> [[Category:Technical]]<br /> [[Category:Vocabulary]]</div>

Devrandom https://en.bitcoin.it/w/index.php?title=Block_chain_download&diff=27520 2012-06-07T04:59:50Z

<p>Devrandom: </p> <hr /> <div>== Bitcoin Chain Download ==<br /> <br /> === Downloader Behavior ===<br /> <br /> * When receiving an inv<br /> ** For each block<br /> *** If already have as orphan, send getblocks(locator(chainHead), orphanRoot(block))<br /> *** If not already have<br /> **** send getdata(block)<br /> *** If already have and this is last block in message NOTE: this triggers specific behavior in peer getdata<br /> **** send getdata(block)<br /> <br /> * When receiving a block<br /> ** If already have, ignore<br /> ** Else if have parent not in main chain<br /> *** store as orphan<br /> *** getblocks(locator(chainHead), orphanRoot(block))<br /> ** Else<br /> *** Accept block<br /> *** Accept orphan blocks that depend on this one<br /> <br /> * When starting download from a peer<br /> ** getblocks(locator(chainHead), 0)<br /> <br /> <br /> === Responder Behavior ===<br /> <br /> * When receiving getdata, for each requested block<br /> ** Send block<br /> ** If block == hashContinue(peer)<br /> *** send inv(chainHead)<br /> *** set hashContinue(peer)=0<br /> <br /> * When receiving getblocks(locator, hashStop)<br /> ** Iterate from locate(locator)-&gt;next, going forward in chain<br /> *** If reached hashStop or ran off end of chain, break<br /> *** If reached limit of 500 or buffer limit<br /> **** Set current hashContinue(peer) to current block hash<br /> **** break<br /> *** Send inv for block<br /> <br /> * When receiving getheaders(hashLocator, hashStop)<br /> ** If hashLocator = 0, return block(hashStop)<br /> ** Send up to 2000 block headers, iterating from block(hashLocator) to hashStop<br /> <br /> === Locator ===<br /> <br /> Downloader: create locator(block)<br /> * For 1..10<br /> ** block = block-&gt;prev<br /> ** add block-&gt;hash<br /> * step = 1<br /> * Do<br /> ** block = block-&gt;prev 'step' times<br /> ** add block-&gt;hash<br /> ** step = step * 2<br /> * add genesis-&gt;hash<br /> <br /> Responder: locate(locator)<br /> * Foreach hash in locator<br /> ** If hash exists in main chain, return block<br /> * Otherwise return genesis block<br /> <br /> == Analysis ==<br /> <br /> Observations:<br /> <br /> * the locator is dense near downloader chain head, and exponentially sparse as it goes towards the genesis<br /> * downloading is accomplished in cooperation:<br /> ** downloader sends getblocks with locator based on downloader chain head<br /> ** responder sends invs for first 500 blocks going forward from latest common block (approximate, per locator)<br /> ** downloader sends getdata for blocks it does not have<br /> ** responder sends blocks and a gratuitious inv for reponder chain head<br /> ** downloader incorporates blocks into chain and now has a new chain head<br /> ** downloader sends another getblocks in response to the gratuitious inv with new locator based on new chain head<br /> <br /> Here are some cases. dChainHead is the downloader chain head, rChainHead is the responder chain head.<br /> <br /> === Single Block Case ===<br /> <br /> * Responder sends an inv for a newly solved block<br /> * Downloader sends getdata<br /> * Responder sends block<br /> <br /> === Small Catchup Case ===<br /> <br /> * Downloader sends getblocks(locator(dChainHead), 0)<br /> * Responder sends invs for blocks from dChainHead to rChainHead<br /> * Downloader sends getdata for each inv<br /> * Responder sends blocks for each getdata<br /> <br /> === Large Catchup Case ===<br /> <br /> * Downloader sends getblocks(locator(dChainHead), 0)<br /> * Responder sends invs for blocks from dChainHead to dChainHead + 500<br /> * (getdata / blocks sent by responder / blocks added to chain by downloader)<br /> * The last getdata triggers an inv(rChainHead)<br /> * Downloader sends getdata(rChainHead)<br /> * Responder sends block<br /> * Downloader puts block on orphan list<br /> * Downloader sends getblocks(locator(dChainHead), rChainHead)<br /> * goto step 2<br /> <br /> === Side Chain Case ===<br /> <br /> Less than 500 blocks.<br /> <br /> * Downloader sends getblocks(locator(dChainHead), 0)<br /> * Responder does not have dChainHead in best chain. Responder iterates over locator until it finds a block in common for the two chains.<br /> * Responder sends invs for blocks from commonBlock to commonBlock + 500<br /> * Downloader adds the blocks that it did not have and reorganizes<br /> <br /> === Large Side Chain Case ===<br /> <br /> More than 500 blocks.<br /> <br /> If the side chain has more than 500 blocks this does not seem to work. getblocks(locator(dChainHead), rChainHead) will not return enough blocks for the Downloader to switch chains. If the Downloader does not switch chains, it will send the same getblocks message again.<br /> <br /> <br /> [[Category:Technical]]<br /> [[Category:Vocabulary]]</div>

Devrandom https://en.bitcoin.it/w/index.php?title=Block_chain_download&diff=27519 2012-06-07T04:58:35Z

<p>Devrandom: Created page with &quot;== Bitcoin Chain Download == === Downloader Behavior === * When receiving an inv ** For each block *** If already have as orphan, send getblocks(locator(chainHead), orphanRo...&quot;</p> <hr /> <div>== Bitcoin Chain Download ==<br /> <br /> === Downloader Behavior ===<br /> <br /> * When receiving an inv<br /> ** For each block<br /> *** If already have as orphan, send getblocks(locator(chainHead), orphanRoot(block))<br /> *** If not already have<br /> **** send getdata(block)<br /> *** If already have and this is last block in message NOTE: this triggers specific behavior in peer getdata<br /> **** send getdata(block)<br /> <br /> * When receiving a block<br /> ** If already have, ignore<br /> ** Else if have parent not in main chain<br /> *** store as orphan<br /> *** getblocks(locator(chainHead), orphanRoot(block))<br /> ** Else<br /> *** Accept block<br /> *** Accept orphan blocks that depend on this one<br /> <br /> * When starting download from a peer<br /> ** getblocks(locator(chainHead), 0)<br /> <br /> <br /> === Responder Behavior ===<br /> <br /> * When receiving getdata, for each requested block<br /> ** Send block<br /> ** If block == hashContinue(peer)<br /> *** send inv(chainHead)<br /> *** set hashContinue(peer)=0<br /> <br /> * When receiving getblocks(locator, hashStop)<br /> ** Iterate from locate(locator)-&gt;next, going forward in chain<br /> *** If reached hashStop or ran off end of chain, break<br /> *** If reached limit of 500 or buffer limit<br /> **** Set current hashContinue(peer) to current block hash<br /> **** break<br /> *** Send inv for block<br /> <br /> * When receiving getheaders(hashLocator, hashStop)<br /> ** If hashLocator = 0, return block(hashStop)<br /> ** Send up to 2000 block headers, iterating from block(hashLocator) to hashStop<br /> <br /> === Locator ===<br /> <br /> Downloader: create locator(block)<br /> * For 1..10<br /> ** block = block-&gt;prev<br /> ** add block-&gt;hash<br /> * step = 1<br /> * Do<br /> ** block = block-&gt;prev 'step' times<br /> ** add block-&gt;hash<br /> ** step = step * 2<br /> * add genesis-&gt;hash<br /> <br /> Responder: locate(locator)<br /> * Foreach hash in locator<br /> ** If hash exists in main chain, return block<br /> * Otherwise return genesis block<br /> <br /> == Analysis ==<br /> <br /> Observations:<br /> <br /> * the locator is dense near downloader chain head, and exponentially sparse as it goes towards the genesis<br /> * downloading is accomplished in cooperation:<br /> ** downloader sends getblocks with locator based on downloader chain head<br /> ** responder sends invs for first 500 blocks going forward from latest common block (approximate, per locator)<br /> ** downloader sends getdata for blocks it does not have<br /> ** responder sends blocks and a gratuitious inv for reponder chain head<br /> ** downloader incorporates blocks into chain and now has a new chain head<br /> ** downloader sends another getblocks in response to the gratuitious inv with new locator based on new chain head<br /> <br /> Here are some cases. dChainHead is the downloader chain head, rChainHead is the responder chain head.<br /> <br /> === Single Block Case ===<br /> <br /> * Responder sends an inv for a newly solved block<br /> * Downloader sends getdata<br /> * Responder sends block<br /> <br /> === Small Catchup Case ===<br /> <br /> * Downloader sends getblocks(locator(dChainHead), 0)<br /> * Responder sends invs for blocks from dChainHead to rChainHead<br /> * Downloader sends getdata for each inv<br /> * Responder sends blocks for each getdata<br /> <br /> === Large Catchup Case ===<br /> <br /> * Downloader sends getblocks(locator(dChainHead), 0)<br /> * Responder sends invs for blocks from dChainHead to dChainHead + 500<br /> * (getdata / blocks sent by responder / blocks added to chain by downloader)<br /> * The last getdata triggers an inv(rChainHead)<br /> * Downloader sends getdata(rChainHead)<br /> * Responder sends block<br /> * Downloader puts block on orphan list<br /> * Downloader sends getblocks(locator(dChainHead), rChainHead)<br /> * goto step 2<br /> <br /> === Side Chain Case ===<br /> <br /> Less than 500 blocks.<br /> <br /> * Downloader sends getblocks(locator(dChainHead), 0)<br /> * Responder does not have dChainHead in best chain. Responder iterates over locator until it finds a block in common for the two chains.<br /> * Responder sends invs for blocks from commonBlock to commonBlock + 500<br /> * Downloader adds the blocks that it did not have and reorganizes<br /> <br /> === Large Side Chain Case ===<br /> <br /> More than 500 blocks.<br /> <br /> If the side chain has more than 500 blocks this does not seem to work. getblocks(locator(dChainHead), rChainHead) will not return enough blocks for the Downloader to switch chains. If the Downloader does not switch chains, it will send the same getblocks message again.</div>

Devrandom https://en.bitcoin.it/w/index.php?title=Block_chain&diff=27518 2012-06-07T04:44:49Z

<p>Devrandom: </p> <hr /> <div>[[File:blockchain.png|thumb|Blocks in the main chain (black) are the longest series of blocks that go from the genesis block (green) to the current block. Orphan blocks (purple) are blocks that are not in the longest chain.]]<br /> <br /> A '''block chain''' is a transaction database shared by all [[Node|nodes]] participating in a [[crypto-currency]] such as Bitcoin. A full copy of a currency's block chain contains every [[transaction]] ever executed in the currency. With this information, one can find out how much value belonged to each [[address]] at any point in history.<br /> <br /> Every [[block]] contains a [[hash]] of the previous block. This has the effect of creating a chain of blocks from the [[genesis block]] to the current block. Each block is guaranteed to come after the previous block chronologically because the previous block's hash would otherwise not be known. Each block is also computationally impractical to modify once it has been in the chain for a while because every block after it would also have to be regenerated. These properties are what make double-spending of bitcoins very difficult. The block chain is the main innovation of Bitcoin.<br /> <br /> Honest generators only build onto a block (by referencing it in blocks they create) if it is the latest block in the longest valid chain. &quot;Length&quot; is calculated as total combined difficulty of that chain, not number of blocks, though this distinction is only important in the context of a few potential attacks. A chain is valid if all of the blocks and transactions within it are valid, and only if it starts with the genesis block.<br /> <br /> For any block on the chain, there is only one path to the genesis block. Coming from the genesis block, however, there can be forks. One-block forks are created from time to time when two blocks are created just a few seconds apart. When that happens, generating nodes build onto whichever one of the blocks they received first. Whichever block ends up being included in the next block becomes part of the main chain because that chain is longer. More serious forks have occurred after fixing bugs that required backward-incompatible changes.<br /> <br /> Blocks in shorter chains (or invalid chains) are called &quot;orphan blocks&quot;, and while they are stored, they are not used for anything. When a block becomes an orphan block, all of its valid transactions are re-added to the pool of queued transactions and will be included in another block. The 50 BTC reward for the orphan block will be lost, which is why a network-enforced 100-block maturation time for generations exists.<br /> <br /> Because a block can only reference one previous block, it is impossible for two forked chains to merge.<br /> <br /> It's possible to use the block chain algorithm for non-financial purposes: see [[Alternative chain]].<br /> <br /> The block chain is broadcasted to all nodes on the networking using a flood protocol: see [[Block chain download]].<br /> <br /> [[Category:Technical]]<br /> [[Category:Vocabulary]]<br /> <br /> ==See Also==<br /> <br /> * [[BlockChain.info]] - Utility site and [[EWallet]] provider of similar name</div>

Devrandom