MIME-Version: 1.0
In-Reply-To: <2226058.Q8lHjYE4Pt@strawberry>
References: <CAFVRnypbQQ-vsSLqv48cYaqTCty4R1DmFRqfAvxe4mAqyQNXxQ@mail.gmail.com>
	<2226058.Q8lHjYE4Pt@strawberry>
From: Tier Nolan <tier.nolan@gmail.com>
Date: Tue, 18 Apr 2017 14:07:09 +0100
Message-ID: <CAE-z3OVXLKqyBb3R5yzOYdnRALot4KUhJ53r9y2jXkf6Yt=KnA@mail.gmail.com>
Cc: Bitcoin Dev <bitcoin-dev@lists.linuxfoundation.org>
Content-Type: multipart/alternative; boundary=001a113d07e8dc09eb054d709554
Subject: Re: [bitcoin-dev] Small Nodes: A Better Alternative to Pruned Nodes
Precedence: list

--001a113d07e8dc09eb054d709554
Content-Type: text/plain; charset=UTF-8

This has been discussed before.

https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2015-May/008101.html

including a list of nice to have features by Maxwell

https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2015-May/008110.html

You meet most of these rules, though you do have to download blocks from
multiple peers.

The suggestion in that thread were for a way to compactly indicate which
blocks a node has.  Each node would then store a sub-set of all the
blocks.  You just download the blocks you want from the node that has them.

Each node would be recommended to store the last few days worth anyway.

--001a113d07e8dc09eb054d709554
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr"><div><div><div><div><div><div><div>This has been discussed=
 before.<br><br><a href=3D"https://lists.linuxfoundation.org/pipermail/bitc=
oin-dev/2015-May/008101.html">https://lists.linuxfoundation.org/pipermail/b=
itcoin-dev/2015-May/008101.html</a><br><br></div>including a list of nice t=
o have features by Maxwell<br><br><a href=3D"https://lists.linuxfoundation.=
org/pipermail/bitcoin-dev/2015-May/008110.html">https://lists.linuxfoundati=
on.org/pipermail/bitcoin-dev/2015-May/008110.html</a><br><br></div></div></=
div></div>You meet most of these rules, though you do have to download bloc=
ks from multiple peers.<br><br></div>The suggestion in that thread were for=
 a way to compactly indicate which blocks a node has.=C2=A0 Each node would=
 then store a sub-set of all the blocks.=C2=A0 You just download the blocks=
 you want from the node that has them.<br><br></div>Each node would be reco=
mmended to store the last few days worth anyway.<br></div>

--001a113d07e8dc09eb054d709554--