summaryrefslogtreecommitdiff
path: root/28/86aeb012d0852c8b8300af28beabbf24b0a841
blob: 8c882998944a85aafd8b7de6fcf9c8ef177c5417 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
Return-Path: <sergio.d.lerner@gmail.com>
Received: from smtp1.linuxfoundation.org (smtp1.linux-foundation.org
	[172.17.192.35])
	by mail.linuxfoundation.org (Postfix) with ESMTPS id 3B3E5899
	for <bitcoin-dev@lists.linuxfoundation.org>;
	Fri, 25 Nov 2016 22:32:04 +0000 (UTC)
X-Greylist: whitelisted by SQLgrey-1.7.6
Received: from mail-qk0-f171.google.com (mail-qk0-f171.google.com
	[209.85.220.171])
	by smtp1.linuxfoundation.org (Postfix) with ESMTPS id 6B979133
	for <bitcoin-dev@lists.linuxfoundation.org>;
	Fri, 25 Nov 2016 22:32:03 +0000 (UTC)
Received: by mail-qk0-f171.google.com with SMTP id n204so89950857qke.2
	for <bitcoin-dev@lists.linuxfoundation.org>;
	Fri, 25 Nov 2016 14:32:03 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113;
	h=mime-version:in-reply-to:references:from:date:message-id:subject:to; 
	bh=Q6VfY7K5jnA7/z/XkcGQsbvYgh9KYqf13p+Hdp/6Of0=;
	b=Bxf7b8ZYIvWXadRM7OXUCoTY4xGD5D6hXZ3pbv6S2x1veqXutlRahFh5V57HOFv741
	WImVhyKCjljA2+3TpIeuJOqWcfarfJkWSpIx70QMXuOKL5Ju/1ngTXxjNx7UiukGfF2r
	+kLZ6HOS1qP8abDg5bwBKyVc+H/iAfK24yP8955w5z+Mca9+I+3cZ/SNUQ5Ke5f0rlM9
	FxkVNlHZhP8uSB8p41PuC0h05oRfa4c6U9iktlf47jpQqIaLPxfdGyX4eTTudOLENCww
	CRc6PZ7ScdU0r168icfxyR2VgDw9uPchw4PRz7fPlFjTvKR4reEGArTqVnScpg1beXFU
	paBw==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed;
	d=1e100.net; s=20130820;
	h=x-gm-message-state:mime-version:in-reply-to:references:from:date
	:message-id:subject:to;
	bh=Q6VfY7K5jnA7/z/XkcGQsbvYgh9KYqf13p+Hdp/6Of0=;
	b=d6y9zwj4F+rvObDDZ6LXh+uGn08rvWh7OcZKRKV5mK4ICZHRTBYAM1dDBOFAQIoR1+
	A53elqM32n3nMZu2pfxTAkrqd15CNfhu9bUWhRF0QLJffpqcdOmeFHKoJJZ62zXzRt92
	maRQgfi8t0jt+1w2QP3UYPyxpR5MgUtyDfQrvxTwdlx0/CVSKUYOlE0ONkBtqU3vXz5K
	BA1riTqNqCShJo3723NUJVn6RbwJ77oQIFStSL6ga/mFQ15LIclqH4BL7oFuaLqSqOqV
	IhjfI+7c8cm0uQqtFZC8N/mMZcpRG3VlJ9xcoTHAUK9ePXwBOuzCoiqaSKYq8p8kYv/i
	Tiwg==
X-Gm-Message-State: AKaTC01JZdNSme++C+BYp4CqeF0IYx5TkJHp52nYRrB8ItbMMWCya2QGZMRZheelpb8B9YHM5PDpFHUQro2LbA==
X-Received: by 10.55.27.40 with SMTP id b40mr9028579qkb.256.1480113122565;
	Fri, 25 Nov 2016 14:32:02 -0800 (PST)
MIME-Version: 1.0
Received: by 10.237.35.13 with HTTP; Fri, 25 Nov 2016 14:31:22 -0800 (PST)
In-Reply-To: <61681436.SvSR6Fsd9n@strawberry>
References: <C10BF9D1-435D-47C9-B98C-9B118B5922A1@gmx.com>
	<CAKzdR-r7or+DF64qxT=HLUvrtdkSQD0hpO43kUjfWS-397+yHA@mail.gmail.com>
	<61681436.SvSR6Fsd9n@strawberry>
From: Sergio Demian Lerner <sergio.d.lerner@gmail.com>
Date: Fri, 25 Nov 2016 19:31:22 -0300
Message-ID: <CAKzdR-rL9ndo9JZodLiSc0BEThiF1kQMs4yvkjJyc_8nzmp8DA@mail.gmail.com>
To: Tom Zander <tomz@freedommail.ch>, 
	Bitcoin Protocol Discussion <bitcoin-dev@lists.linuxfoundation.org>
Content-Type: multipart/alternative; boundary=001a1147cfd6e5e692054227b05d
X-Spam-Status: No, score=-1.5 required=5.0 tests=BAYES_00,DKIM_SIGNED,
	DKIM_VALID, DKIM_VALID_AU, FREEMAIL_FROM, HTML_MESSAGE,
	RCVD_IN_DNSWL_NONE, 
	RCVD_IN_SORBS_SPAM autolearn=no version=3.3.1
X-Spam-Checker-Version: SpamAssassin 3.3.1 (2010-03-16) on
	smtp1.linux-foundation.org
X-Mailman-Approved-At: Sat, 26 Nov 2016 11:53:18 +0000
Subject: Re: [bitcoin-dev] The Excessive-Block Gate: How a Bitcoin Unlimited
 Node Deals With Large Blocks
X-BeenThere: bitcoin-dev@lists.linuxfoundation.org
X-Mailman-Version: 2.1.12
Precedence: list
List-Id: Bitcoin Protocol Discussion <bitcoin-dev.lists.linuxfoundation.org>
List-Unsubscribe: <https://lists.linuxfoundation.org/mailman/options/bitcoin-dev>,
	<mailto:bitcoin-dev-request@lists.linuxfoundation.org?subject=unsubscribe>
List-Archive: <http://lists.linuxfoundation.org/pipermail/bitcoin-dev/>
List-Post: <mailto:bitcoin-dev@lists.linuxfoundation.org>
List-Help: <mailto:bitcoin-dev-request@lists.linuxfoundation.org?subject=help>
List-Subscribe: <https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev>,
	<mailto:bitcoin-dev-request@lists.linuxfoundation.org?subject=subscribe>
X-List-Received-Date: Fri, 25 Nov 2016 22:32:04 -0000

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

On Fri, Nov 25, 2016 at 12:25 PM, Tom Zander via bitcoin-dev <
bitcoin-dev@lists.linuxfoundation.org> wrote:

> On Thursday, 24 November 2016 22:39:05 CET Sergio Demian Lerner via
> bitcoin-
> dev wrote:
> > Without a detailed analysis, unlimited block size seems a risky change =
to
> > Bitcoin, to me.
>
> What exactly do you think is a =E2=80=98change=E2=80=99 in bitcoin here?
>
> A change is anything that modifies with a HF the current state of the
Bitcoin Core implementation of the consensus protocol. Sadly (or happily,
for some) there is no "abstract" definition of Bitcoin.



> The concept of proof-of-work is that the longer a chain, the higher
> probability that that one will be extended for the simple reason that
> another chain will have to show a higher amount of proof of work to =E2=
=80=98win=E2=80=99.
>
> We know what Bitcoin the protocol dictates, but if what the protocol
dictates is not in the best interest of miners or full-nodes? then they
will simply choose a rule that maximizes their revenue (or any other
measure of performance, such as lower latency, or less transaction reversal
probability).


As far as I understand the document from Peter, there is no change there at
> all. Only chains with more POW will win.
>

I haven't gone to the code to check, but the video Peter sent does not say
that. It says that miners will mine on top of a block ONLY if the "gate"
has been opened for that block (e.g. there is additional blocks to push a
big block). So a miner having a preferring low block sizes will choose to
mine on top of the A1,A2,A3 chain (3 units of work), while miners
supporting bigger sizes will mine on top of the chain B1,S2,S3,S4 (4 units
of work).

Saying that the chain starting with B1 is not considered by a node X does
not mean that the node X is blind to the information that can be extracted
from the fact that there is a chain of 4 blocks starting from B1.
If there is more information, there may be a better local choice. If there
are better local choices, there is probably a better global equilibrium (or
not equilibrium at all).


> Or, to answer your example, miners will prefer to extend the chain with t=
he
> most POW.
>

Clearly this is not universal: some miners will, and some other miners
won't, because some miners have postponed adding some blocks.



>
> The other fact stays the same as well, if you protect from reorgs by
> expecting more confirmations. Nothing changes here either. The
> common-sense 6
> confirmations for things like exchange-deposits keep having the same
> security.
>

Suppose that I provide a service that accepts payments with 2
confirmations, and in certain time I have the information that the network
is at the same time considering the forks B1 S2 and A1 A2. Then the best I
can do is NOT to accept the 2-confirmation and wait for a resolution of the
fork. Choosing either fork may put me at the risk of immediate reversal.

The existence of fork information changes equilibrium decision to choose
the longest-chain.  This is the same that happens with the GHOST protocol:
the information on the existence of uncles changes the local incentives to
choose the longest chain to some different strategy, and when all nodes
change their strategy, then the supposedly last equilibrium state is that
all follow the GHOST strategy for choosing the heaviest chain.


>
> The basic idea that we have a 3 or 4 deep fork is a huge problem in
> Bitcoin.
> It hasn=E2=80=99t happened for ages, and we like it that way. The miners =
like it
> that way too. Its disruptive.
> The is a problem that is not created by the =E2=80=98excessive block=E2=
=80=99 concept. It
> does, however, provide a possible solution to this very far-fetched
> problem.
>
> You should also realize that the policy of a miner is stored in the
> coinbase.
>
> This is important, but yet the full node does not use this information
automatically. The amount of confirmations that a node accepts is not
affected by the miner's policies or the size of the blocks mined, but it
should.


> That said, I=E2=80=99m sure there are improvements to be made to the poli=
cy that BU
> uses.


Probably a simple wise addition would be to estimate the accepted block
size for the majority of the miners (S), and only count block confirmations
for wallet transactions taking into account only blocks whose size is lower
or equal than S. So for example, if Alice receives a transaction T in block
B1 and it is confirmed by block B2, but size(B1)>S and size(B2)>S, then the
wallet should tell Alice that transaction T has 0 confirmations. This local
strategy reduces the chances that Alice accept T but is then easily
reversed for the opposite fork growing one block ahead.

Regards,
 Sergio

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

<div dir=3D"ltr"><br><div class=3D"gmail_extra"><br><div class=3D"gmail_quo=
te">On Fri, Nov 25, 2016 at 12:25 PM, Tom Zander via bitcoin-dev <span dir=
=3D"ltr">&lt;<a href=3D"mailto:bitcoin-dev@lists.linuxfoundation.org" targe=
t=3D"_blank">bitcoin-dev@lists.linuxfoundation.org</a>&gt;</span> wrote:<br=
><blockquote class=3D"gmail_quote" style=3D"margin:0px 0px 0px 0.8ex;border=
-left:1px solid rgb(204,204,204);padding-left:1ex">On Thursday, 24 November=
 2016 22:39:05 CET Sergio Demian Lerner via bitcoin-<br>
<span class=3D"gmail-">dev wrote:<br>
&gt; Without a detailed analysis, unlimited block size seems a risky change=
 to<br>
&gt; Bitcoin, to me.<br>
<br>
</span>What exactly do you think is a =E2=80=98change=E2=80=99 in bitcoin h=
ere?<br>
<br></blockquote><div>A change is anything that modifies with a HF the curr=
ent state of the Bitcoin Core implementation of the consensus protocol. Sad=
ly (or happily, for some) there is no &quot;abstract&quot; definition of Bi=
tcoin.<br><br>=C2=A0<br></div><blockquote class=3D"gmail_quote" style=3D"ma=
rgin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:=
1ex">
The concept of proof-of-work is that the longer a chain, the higher<br>
probability that that one will be extended for the simple reason that<br>
another chain will have to show a higher amount of proof of work to =E2=80=
=98win=E2=80=99.<br>
<br></blockquote><div>We know what Bitcoin the protocol dictates, but if wh=
at the protocol dictates is not in the best interest of miners or full-node=
s? then they will simply choose a rule that maximizes their revenue (or any=
 other measure of performance, such as lower latency, or less transaction r=
eversal probability).<br><br><br></div><blockquote class=3D"gmail_quote" st=
yle=3D"margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padd=
ing-left:1ex">
As far as I understand the document from Peter, there is no change there at=
<br>
all. Only chains with more POW will win.<br></blockquote><div>=C2=A0</div><=
div>I haven&#39;t gone to the code to check, but the video Peter sent does =
not=20
say that. It says that miners will mine on top of a block ONLY if the &quot=
;gate&quot; has been opened for that block (e.g. there is additional blocks=
 to=20
push a big block). So a miner having a preferring low block sizes will choo=
se to mine on
 top of the A1,A2,A3  chain (3 units of work), while miners supporting=20
bigger sizes will mine on top of the chain B1,S2,S3,S4 (4 units of=20
work).<br><br></div><div>Saying that the chain starting with B1 is not cons=
idered by a node X does not mean that the node X is blind to the informatio=
n that can be extracted from the fact that there is a chain of 4 blocks sta=
rting from B1.<br></div><div>If there is more information, there may be a b=
etter local choice. If there are better local choices, there is probably a =
better global equilibrium (or not equilibrium at all).<br></div><div>=C2=A0=
</div><blockquote class=3D"gmail_quote" style=3D"margin:0px 0px 0px 0.8ex;b=
order-left:1px solid rgb(204,204,204);padding-left:1ex">
Or, to answer your example, miners will prefer to extend the chain with the=
<br>
most POW.<br></blockquote><div><br></div><div>Clearly this is not universal=
: some miners will, and some other miners won&#39;t, because some miners ha=
ve postponed adding some blocks.<br><br>=C2=A0 <br></div><blockquote class=
=3D"gmail_quote" style=3D"margin:0px 0px 0px 0.8ex;border-left:1px solid rg=
b(204,204,204);padding-left:1ex">
<br>
The other fact stays the same as well, if you protect from reorgs by<br>
expecting more confirmations. Nothing changes here either. The common-sense=
 6<br>
confirmations for things like exchange-deposits keep having the same<br>
security.<br></blockquote><div><br></div><div>Suppose that I provide a serv=
ice that accepts payments with 2 confirmations, and in certain time I have =
the information that the network is at the same time considering the forks =
B1 S2 and A1 A2. Then the best I can do is NOT to accept the 2-confirmation=
 and wait for a resolution of the fork. Choosing either fork may put me at =
the risk of immediate reversal. <br><br>The existence of fork information c=
hanges equilibrium decision to choose the longest-chain.=C2=A0 This is the =
same that happens with the GHOST protocol: the information on the existence=
 of uncles changes the local incentives to choose the longest chain to some=
 different strategy, and when all nodes change their strategy, then the sup=
posedly last equilibrium state is that all follow the GHOST strategy for ch=
oosing the heaviest chain.<br>=C2=A0<br></div><blockquote class=3D"gmail_qu=
ote" style=3D"margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,20=
4);padding-left:1ex">
<br>
The basic idea that we have a 3 or 4 deep fork is a huge problem in Bitcoin=
.<br>
It hasn=E2=80=99t happened for ages, and we like it that way. The miners li=
ke it<br>
that way too. Its disruptive.<br>
The is a problem that is not created by the =E2=80=98excessive block=E2=80=
=99 concept. It<br>
does, however, provide a possible solution to this very far-fetched problem=
.<br>
<br>
You should also realize that the policy of a miner is stored in the<br>
coinbase.<br>
<br></blockquote><div>This is important, but yet the full node does not use=
 this information automatically. The amount of confirmations that a node ac=
cepts is not affected by the miner&#39;s policies or the size of the blocks=
 mined, but it should.<br>=C2=A0<br></div><blockquote class=3D"gmail_quote"=
 style=3D"margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);p=
adding-left:1ex">
That said, I=E2=80=99m sure there are improvements to be made to the policy=
 that BU<br>
uses. </blockquote><div><br></div><div>Probably a simple wise addition woul=
d be to estimate the accepted block size for the majority of the miners (S)=
, and only count block confirmations for wallet transactions taking into ac=
count only blocks whose size is lower or equal than S. So for example, if A=
lice receives a transaction T in block B1 and it is confirmed by block B2, =
but size(B1)&gt;S and size(B2)&gt;S, then the wallet should tell Alice that=
 transaction T has 0 confirmations. This local strategy reduces the chances=
 that Alice accept T but is then easily reversed for the opposite fork grow=
ing one block ahead.<br></div><div>=C2=A0<br></div><div>Regards,<br></div><=
div>=C2=A0Sergio<br></div></div><br></div></div>

--001a1147cfd6e5e692054227b05d--