summaryrefslogtreecommitdiff
path: root/5e/69fc5e9c29192a7ca690f45e5f913f410b6ce8
blob: a4e09c2fd51967f5a924aa6a470c89db30c1dc70 (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
Return-Path: <daniele.pinna@gmail.com>
Received: from smtp1.linuxfoundation.org (smtp1.linux-foundation.org
	[172.17.192.35])
	by mail.linuxfoundation.org (Postfix) with ESMTPS id 0D3F2279
	for <bitcoin-dev@lists.linuxfoundation.org>;
	Sun, 11 Dec 2016 03:17:48 +0000 (UTC)
X-Greylist: whitelisted by SQLgrey-1.7.6
Received: from mail-oi0-f47.google.com (mail-oi0-f47.google.com
	[209.85.218.47])
	by smtp1.linuxfoundation.org (Postfix) with ESMTPS id 7C984125
	for <bitcoin-dev@lists.linuxfoundation.org>;
	Sun, 11 Dec 2016 03:17:47 +0000 (UTC)
Received: by mail-oi0-f47.google.com with SMTP id v84so57284956oie.3
	for <bitcoin-dev@lists.linuxfoundation.org>;
	Sat, 10 Dec 2016 19:17:47 -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
	:cc; bh=yO03YzMhYNyMgzVyDj5+BApGsiKSDyFyKhAibw34vS0=;
	b=FW/LPJOP3JgE4JpJZc3tREmox80YKUv2VkP/Be3R4mzjOkgrKiZ69+rCmhVrvy6L5J
	3ddMmNUvPJO6TzAA8wa73r2bDW1QwG4NGWCOhq1UnxAUMGEzdSNJbJfO8TERikuJ1PtC
	9dn6FZoVmj9zvtvu9Ho7kFhYafTFKoaleS/IrGnvGI82CAFiN75jEgs68RxQfx94MT/Z
	S2o103pJr2VF6ouDC9WjPKcKUJOKbssrLXYr5bc0ZoeOS0Cj0rm8WPKIP4aRMR43efFH
	t00oK8/TPAlynmduIKn1+BsQL9TcC4eH9pEI/uDaChnAnSjswUgRf5ojrikpoUBCQ6ak
	Ybbw==
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:cc;
	bh=yO03YzMhYNyMgzVyDj5+BApGsiKSDyFyKhAibw34vS0=;
	b=H4lfasUrdspqb+WkQnovEaG3juI+xW2d6luErWCSKrniYAd4I7kZAuydHl+SvOGMhI
	16KNx5OS/mxu9xNxsHufAHA/xx2QnD5zMAa5n1BuxSkz+HQBdng2fl2thVXlpzNupZTX
	VSEdMzCsREopP6OvWPuqb5pqFJQRjtjXHol0UDBdXYetfxhF4JDUoKtOq0sW1V8Uq8xm
	RVxLaec8tsbatVlrLO2JV6hxDnPNjIPspHORHBUBuV/NE2OdIwchqE3lrVTdbcJhoLdf
	VAeVuz4MtivnaBONO/+rC9kZmWIp7NX18xz6RAYxKiZn/agu2hyYNRlTt7sWCCqa3sKn
	8R0Q==
X-Gm-Message-State: AKaTC029mAL1DYdt5kHaL5jYrLNiMPzRSPIcD74GVzJuLvEDHAnp/NMda3M30yFXQiZCDdtCeacBzhuJEQJJHQ==
X-Received: by 10.157.37.102 with SMTP id j35mr47010156otd.44.1481426266692;
	Sat, 10 Dec 2016 19:17:46 -0800 (PST)
MIME-Version: 1.0
Received: by 10.157.31.29 with HTTP; Sat, 10 Dec 2016 19:17:45 -0800 (PST)
Received: by 10.157.31.29 with HTTP; Sat, 10 Dec 2016 19:17:45 -0800 (PST)
In-Reply-To: <CAPg+sBiZmRdLOgG9iN2hOWVr_eCLTwDrbuETd_w9-bUJOfTjgw@mail.gmail.com>
References: <CAEgR2PEMPo3veqJat7OAps1DzTSNFJmJiRbkFgYKvYfxqdbUiw@mail.gmail.com>
	<CAEgR2PELB1_s+o0Bj4Kj9vS27eoqP7gV_VS_6QHQtTUAOnMORg@mail.gmail.com>
	<CAEgR2PFpGWxngq=fKGi7CC_d+=5YWzWwbEEsQNEifCuHAAPAHw@mail.gmail.com>
	<CAEgR2PHnrsdaBiDgywvE9amK8_yPE_hBo0yYOYwUk4T8n7wnAQ@mail.gmail.com>
	<CAEgR2PEgPkRe76hW0Jj7_Z1EdmmNTpTAOKGm_of2dG=XXUOtnA@mail.gmail.com>
	<CAEgR2PHew+fcJWnAt+t8umcwKu4TkshH=AFJ-8MeYysud2MkBQ@mail.gmail.com>
	<CAEgR2PEVwt_shiqwGjK6dPscRUTHayis0PaQO5Dj_fVEGGgaCQ@mail.gmail.com>
	<CAEgR2PEvpEwv=a0syn43negEnvGcoQ8LBxKRp4-JpnxCNORJSg@mail.gmail.com>
	<CAPg+sBiZmRdLOgG9iN2hOWVr_eCLTwDrbuETd_w9-bUJOfTjgw@mail.gmail.com>
From: Daniele Pinna <daniele.pinna@gmail.com>
Date: Sun, 11 Dec 2016 04:17:45 +0100
Message-ID: <CAEgR2PEuZBZqUJ-qehBpk8dL8U-F5z9mZAn-UuRwUXiUSOcXRQ@mail.gmail.com>
To: Pieter Wuille <pieter.wuille@gmail.com>
Content-Type: multipart/alternative; boundary=001a114134526322a70543596e50
X-Spam-Status: No, score=-2.0 required=5.0 tests=BAYES_00,DKIM_SIGNED,
	DKIM_VALID, DKIM_VALID_AU, FREEMAIL_FROM, HTML_MESSAGE,
	RCVD_IN_DNSWL_NONE autolearn=ham version=3.3.1
X-Spam-Checker-Version: SpamAssassin 3.3.1 (2010-03-16) on
	smtp1.linux-foundation.org
X-Mailman-Approved-At: Sun, 11 Dec 2016 03:21:59 +0000
Cc: Bitcoin Dev <bitcoin-dev@lists.linuxfoundation.org>
Subject: Re: [bitcoin-dev] Managing block size the same way we do difficulty
 (aka Block75)
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: Sun, 11 Dec 2016 03:17:48 -0000

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

How is the adverse scenario you describe different from a plain old 51%
attack? Each proposed protocol change  where 51% or more  of the network
can potentially game the rules and break the system should be considered
just as acceptable/unacceptable as another.

There comes a point where some form of basic honesty must be assumed on
behalf of participants benefiting from the system working properly and
reliably.

Afterall, what magic line of code prohibits all miners from simultaneously
turning all their equipment off...  just because?

Maybe this 'one':

"As long as a majority of CPU power is controlled by nodes that are not
cooperating to attack the network, they'll generate the longest chain and
outpace attackers. The network itself requires minimal structure."

Is there such a thing as an unrecognizable 51% attack?  One where the
remaining 49% get dragged in against their will?

Daniele

On Dec 10, 2016 6:39 PM, "Pieter Wuille" <pieter.wuille@gmail.com> wrote:

> On Sat, Dec 10, 2016 at 4:23 AM, Daniele Pinna via bitcoin-dev <
> bitcoin-dev@lists.linuxfoundation.org> wrote:
>
>> We have models for estimating the probability that a block is orphaned
>> given average network bandwidth and block size.
>>
>> The question is, do we have objective measures of these two quantities?
>> Couldn't we target an orphan_rate < max_rate?
>>
>
> Models can predict orphan rate given block size and network/hashrate
> topology, but you can't control the topology (and things like FIBRE hide
> the effect of block size on this as well). The result is that if you're
> purely optimizing for minimal orphan rate, you can end up with a single
> (conglomerate of) pools producing all the blocks. Such a setup has no
> propagation delay at all, and as a result can always achieve 0 orphans.
>
> Cheers,
>
> --
> Pieter
>
>

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

<div dir=3D"auto">How is the adverse scenario you describe different from a=
 plain old 51% attack? Each proposed protocol change =C2=A0where 51% or mor=
e =C2=A0of the network can potentially game the rules and break the system =
should be considered just as acceptable/unacceptable as another.=C2=A0<div =
dir=3D"auto"><br></div><div dir=3D"auto">There comes a point where some for=
m of basic honesty must be assumed on behalf of participants benefiting fro=
m the system working properly and reliably.=C2=A0</div><div dir=3D"auto"><b=
r></div><div dir=3D"auto">Afterall, what magic line of code prohibits all m=
iners from simultaneously turning all their equipment off... =C2=A0just bec=
ause?=C2=A0</div><div dir=3D"auto"><br></div><div dir=3D"auto">Maybe this &=
#39;one&#39;:</div><div dir=3D"auto"><br></div><div dir=3D"auto">&quot;As l=
ong as a majority of CPU power is controlled by nodes that are not cooperat=
ing to attack the network, they&#39;ll generate the longest chain and outpa=
ce attackers. The network itself requires minimal structure.&quot;</div><di=
v dir=3D"auto"><br></div><div dir=3D"auto">Is there such a thing as an unre=
cognizable 51% attack?=C2=A0 One where the remaining 49% get dragged in aga=
inst their will?=C2=A0</div><div dir=3D"auto"><br></div><div dir=3D"auto">D=
aniele=C2=A0</div></div><div class=3D"gmail_extra"><br><div class=3D"gmail_=
quote">On Dec 10, 2016 6:39 PM, &quot;Pieter Wuille&quot; &lt;<a href=3D"ma=
ilto:pieter.wuille@gmail.com">pieter.wuille@gmail.com</a>&gt; wrote:<br typ=
e=3D"attribution"><blockquote class=3D"gmail_quote" style=3D"margin:0 0 0 .=
8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir=3D"ltr">On Sat, D=
ec 10, 2016 at 4:23 AM, Daniele Pinna via bitcoin-dev <span dir=3D"ltr">&lt=
;<a href=3D"mailto:bitcoin-dev@lists.linuxfoundation.org" target=3D"_blank"=
>bitcoin-dev@lists.linuxfounda<wbr>tion.org</a>&gt;</span> wrote:<br><div c=
lass=3D"gmail_extra"><div class=3D"gmail_quote"><blockquote class=3D"gmail_=
quote" style=3D"margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1=
ex"><div dir=3D"auto"><div dir=3D"auto"><span style=3D"font-size:13.696px;f=
ont-family:sans-serif">We have models for estimating the probability that a=
 block is orphaned given average network bandwidth and block size.=C2=A0</s=
pan><br></div><div dir=3D"auto"><span style=3D"font-size:13.696px;font-fami=
ly:sans-serif"><br></span></div><div dir=3D"auto"><span style=3D"font-famil=
y:sans-serif;font-size:13.696px">The question is, do we have objective meas=
ures of these two quantities? Couldn&#39;t we target an orphan_rate &lt; ma=
x_rate?=C2=A0</span><span style=3D"font-size:13.696px;font-family:sans-seri=
f"><br></span></div></div></blockquote><div><br></div><div>Models can predi=
ct orphan rate given block size and network/hashrate topology, but you can&=
#39;t control the topology (and things like FIBRE hide the effect of block =
size on this as well). The result is that if you&#39;re purely optimizing f=
or minimal orphan rate, you can end up with a single (conglomerate of) pool=
s producing all the blocks. Such a setup has no propagation delay at all, a=
nd as a result can always achieve 0 orphans.<br><br></div><div>Cheers,<br><=
br>-- <br></div><div>Pieter<br><br></div></div></div></div>
</blockquote></div></div>

--001a114134526322a70543596e50--