Received: from sog-mx-3.v43.ch3.sourceforge.com ([172.29.43.193] helo=mx.sourceforge.net) by sfs-ml-1.v29.ch3.sourceforge.com with esmtp (Exim 4.76) (envelope-from ) id 1YsT3J-0007zx-Rt for bitcoin-development@lists.sourceforge.net; Wed, 13 May 2015 09:34:09 +0000 Received-SPF: pass (sog-mx-3.v43.ch3.sourceforge.com: domain of gmail.com designates 209.85.216.182 as permitted sender) client-ip=209.85.216.182; envelope-from=tier.nolan@gmail.com; helo=mail-qc0-f182.google.com; Received: from mail-qc0-f182.google.com ([209.85.216.182]) by sog-mx-3.v43.ch3.sourceforge.com with esmtps (TLSv1:RC4-SHA:128) (Exim 4.76) id 1YsT3I-0004cv-SD for bitcoin-development@lists.sourceforge.net; Wed, 13 May 2015 09:34:09 +0000 Received: by qcvo8 with SMTP id o8so19199254qcv.0 for ; Wed, 13 May 2015 02:34:03 -0700 (PDT) MIME-Version: 1.0 X-Received: by 10.140.217.17 with SMTP id n17mr26626047qhb.69.1431509643480; Wed, 13 May 2015 02:34:03 -0700 (PDT) Received: by 10.140.85.241 with HTTP; Wed, 13 May 2015 02:34:03 -0700 (PDT) In-Reply-To: <5552DEFA.4080508@domob.eu> References: <20150512171640.GA32606@savin.petertodd.org> <5552DEFA.4080508@domob.eu> Date: Wed, 13 May 2015 10:34:03 +0100 Message-ID: From: Tier Nolan Cc: Bitcoin Dev Content-Type: multipart/alternative; boundary=001a1139b816caea950515f34f6e X-Spam-Score: 2.5 (++) X-Spam-Report: Spam Filtering performed by mx.sourceforge.net. See http://spamassassin.org/tag/ for more details. -1.5 SPF_CHECK_PASS SPF reports sender host as permitted sender for sender-domain 0.0 FREEMAIL_FROM Sender email is commonly abused enduser mail provider (tier.nolan[at]gmail.com) -0.0 SPF_PASS SPF: sender matches SPF record 1.2 MISSING_HEADERS Missing To: header 1.0 HTML_MESSAGE BODY: HTML included in message -0.1 DKIM_VALID_AU Message has a valid DKIM or DK signature from author's domain 0.1 DKIM_SIGNED Message has a DKIM or DK signature, not necessarily valid -0.1 DKIM_VALID Message has at least one valid DKIM or DK signature 1.9 MALFORMED_FREEMAIL Bad headers on message from free email service 0.0 AWL AWL: Adjusted score from AWL reputation of From: address X-Headers-End: 1YsT3I-0004cv-SD Subject: Re: [Bitcoin-development] Proposed additional options for pruned nodes X-BeenThere: bitcoin-development@lists.sourceforge.net X-Mailman-Version: 2.1.9 Precedence: list List-Id: List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 13 May 2015 09:34:09 -0000 --001a1139b816caea950515f34f6e Content-Type: text/plain; charset=UTF-8 On Wed, May 13, 2015 at 6:19 AM, Daniel Kraft wrote: > 2) Divide the range of all blocks into intervals with exponentially > growing size. I. e., something like this: > > 1, 1, 2, 2, 4, 4, 8, 8, 16, 16, ... > Interesting. This can be combined with the system I suggested. A node broadcasts 3 pieces of information Seed (16 bits): This is the seed M_bits_lsb (1 bit): Used to indicate M during a transition N (7 bits): This is the count of the last range held (or partially held) M = 1 << M_bits M should be set to the lowest power of 2 greater than double the block chain height That gives M = 1 million at the moment. During changing M, some nodes will be using the higher M and others will use the lower M. The M_bits_lsb field allows those to be distinguished. As the block height approaches 512k, nodes can begin to upgrade. For a period around block 512k, some nodes could use M = 1 million and others could use M = 2 million. Assuming M is around 3 times higher than the block height, then the odds of a start being less than the block height is around 35%. If they runs by 25% each step, then that is approx a double for each hit. Size(n) = ((4 + (n & 0x3)) << (n >> 2)) * 2.5MB This gives an exponential increase, but groups of 4 are linearly interpolated. *Size(0) = 10 MB* Size(1) = 12.5MB Size(2) = 15 MB Size(3) = 17.5MB Size(4) = 20MB *Size(5) = 25MB* Size(6) = 30MB Size(7) = 35MB *Size(8) = 40MB* Start(n) = Hash(seed + n) mod M A node should store as much of its last start as possible. Assuming start 0, 5, and 8 were "hits" but the node had a max size of 60MB. It can store 0 and 5 and have 25MB left. That isn't enough to store all of run 8, but it should store 25MB of the blocks in run 8 anyway. Size(255) = pow(2, 31) * 17.5MB = 35,840 TB Decreasing N only causes previously accepted runs to be invalidated. When a node approaches a transition point for N, it would select a block height within 25,000 of the transition point. Once it reaches that block, it will begin downloading the new runs that it needs. When updating, it can set N to zero. This spreads out the upgrade (over around a year), with only a small number of nodes upgrading at any time. New nodes should use the higher M, if near a transition point (say within 100,000). --001a1139b816caea950515f34f6e Content-Type: text/html; charset=UTF-8 Content-Transfer-Encoding: quoted-printable
On W= ed, May 13, 2015 at 6:19 AM, Daniel Kraft <d@domob.eu> wrote:
2) Divide the range of all blocks into intervals with exponentially
growing size.=C2=A0 I. e., something like this:

1, 1, 2, 2, 4, 4, 8, 8, 16, 16, ...

Int= eresting.=C2=A0 This can be combined with the system I suggested.

A node broadcasts 3 pieces of information

Seed (16 bi= ts): This is the seed
M_bits_lsb (1 bit):=C2=A0 Used to indicate M = during a transition
N (7 bits):=C2=A0 This is the count of the last rang= e held (or partially held)

M =3D 1 << M_bits

M should be set to the lowest = power of 2 greater than double the block chain height

Tha= t gives M =3D 1 million at the moment.=C2=A0 During changing M, some nodes = will be using the higher M and others will use the lower M.

The M_bits_lsb field allows those to be distinguished.

As the block height approaches 512k, nodes can begin to upgrade.=C2=A0 For= a period around block 512k, some nodes could use M =3D 1 million and other= s could use M =3D 2 million.

Assuming M is aro= und 3 times higher than the block height, then the odds of a start being le= ss than the block height is around 35%.=C2=A0 If they runs by 25% each step= , then that is approx a double for each hit.

S= ize(n) =3D ((4 + (n & 0x3)) << (n >> 2)) * 2.5MB

This gives an exponential increase, but groups of 4 are linearly in= terpolated.

Size(0) =3D 10 MB
Size(1= ) =3D 12.5MB
Size(2) =3D 15 MB
Size(3) =3D 17.5= MB
Size(4) =3D 20MB
Size(5) =3D 25MB
=
Size(6) =3D 30MB
Size(7) =3D 35MB
Size(8) =3D 40MB

Start(n) =3D Hash(seed += n) mod M

A node should store as much of its last start = as possible.=C2=A0 Assuming start 0, 5, and 8 were "hits" but the= node had a max size of 60MB.=C2=A0 It can store 0 and 5 and have 25MB left= .=C2=A0 That isn't enough to store all of run 8, but it should store 25= MB of the blocks in run 8 anyway.

Size(255) =3D pow(2, 31= ) * 17.5MB =3D 35,840 TB

Decreasing N only causes previou= sly accepted runs to be invalidated.=C2=A0

When a node a= pproaches a transition point for N, it would select a block height within 2= 5,000 of the transition point.=C2=A0 Once it reaches that block, it will be= gin downloading the new runs that it needs.=C2=A0 When updating, it can set= N to zero.=C2=A0 This spreads out the upgrade (over around a year), with o= nly a small number of nodes upgrading at any time.=C2=A0

New nodes should use the higher M, if near a transition point (say within = 100,000).
--001a1139b816caea950515f34f6e--