summaryrefslogtreecommitdiff
path: root/04/dd4ace4a8c22169c8b61377f028203355767a5
blob: 29d5bf12c19f29be63d9204db7aea1c300efa13d (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
Received: from sog-mx-2.v43.ch3.sourceforge.com ([172.29.43.192]
	helo=mx.sourceforge.net)
	by sfs-ml-1.v29.ch3.sourceforge.com with esmtp (Exim 4.76)
	(envelope-from <stanga@gmail.com>) id 1VdkPK-00072d-Tn
	for bitcoin-development@lists.sourceforge.net;
	Tue, 05 Nov 2013 17:27:14 +0000
Received-SPF: pass (sog-mx-2.v43.ch3.sourceforge.com: domain of gmail.com
	designates 209.85.217.172 as permitted sender)
	client-ip=209.85.217.172; envelope-from=stanga@gmail.com;
	helo=mail-lb0-f172.google.com; 
Received: from mail-lb0-f172.google.com ([209.85.217.172])
	by sog-mx-2.v43.ch3.sourceforge.com with esmtps (TLSv1:RC4-SHA:128)
	(Exim 4.76) id 1VdkPJ-00026o-QV
	for bitcoin-development@lists.sourceforge.net;
	Tue, 05 Nov 2013 17:27:14 +0000
Received: by mail-lb0-f172.google.com with SMTP id c11so6884136lbj.31
	for <bitcoin-development@lists.sourceforge.net>;
	Tue, 05 Nov 2013 09:27:06 -0800 (PST)
X-Received: by 10.152.5.69 with SMTP id q5mr1009407laq.46.1383672426739; Tue,
	05 Nov 2013 09:27:06 -0800 (PST)
MIME-Version: 1.0
Sender: stanga@gmail.com
Received: by 10.112.105.35 with HTTP; Tue, 5 Nov 2013 09:26:46 -0800 (PST)
In-Reply-To: <20131105170541.GA13660@petertodd.org>
References: <CABT1wWkOukEzxK5fLbnA4ZgJGN1hb_DMteCJOfA13FE_QZCi=Q@mail.gmail.com>
	<20131105170541.GA13660@petertodd.org>
From: Ittay <ittay.eyal@cornell.edu>
Date: Tue, 5 Nov 2013 12:26:46 -0500
X-Google-Sender-Auth: _fu2reVH2R_ApQf2pZ-RDDHyiKs
Message-ID: <CABT1wWnPJOKKT5v2hGePkUT8jNau=TEK5s-n2so2kQKnv-HfqQ@mail.gmail.com>
To: Peter Todd <pete@petertodd.org>
Content-Type: multipart/alternative; boundary=089e013d1b667b3d6c04ea7157d7
X-Spam-Score: -0.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
	(stanga[at]gmail.com)
	-0.0 SPF_PASS               SPF: sender matches SPF record
	0.0 URIBL_BLOCKED ADMINISTRATOR NOTICE: The query to URIBL was blocked.
	See
	http://wiki.apache.org/spamassassin/DnsBlocklists#dnsbl-block
	for more information. [URIs: petertodd.org]
	1.0 HTML_MESSAGE           BODY: HTML included in message
	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
X-Headers-End: 1VdkPJ-00026o-QV
Cc: Ittay <ittay.eyal@cornell.edu>,
	Gavin Andresen <gavin@bitcoinfoundation.org>,
	=?ISO-8859-1?Q?Emin_G=FCn_Sirer?= <egs@systems.cs.cornell.edu>,
	Bitcoin Dev <bitcoin-development@lists.sourceforge.net>
Subject: Re: [Bitcoin-development] BIP proposal - patch to raise selfish
 mining threshold.
X-BeenThere: bitcoin-development@lists.sourceforge.net
X-Mailman-Version: 2.1.9
Precedence: list
List-Id: <bitcoin-development.lists.sourceforge.net>
List-Unsubscribe: <https://lists.sourceforge.net/lists/listinfo/bitcoin-development>,
	<mailto:bitcoin-development-request@lists.sourceforge.net?subject=unsubscribe>
List-Archive: <http://sourceforge.net/mailarchive/forum.php?forum_name=bitcoin-development>
List-Post: <mailto:bitcoin-development@lists.sourceforge.net>
List-Help: <mailto:bitcoin-development-request@lists.sourceforge.net?subject=help>
List-Subscribe: <https://lists.sourceforge.net/lists/listinfo/bitcoin-development>,
	<mailto:bitcoin-development-request@lists.sourceforge.net?subject=subscribe>
X-List-Received-Date: Tue, 05 Nov 2013 17:27:15 -0000

--089e013d1b667b3d6c04ea7157d7
Content-Type: text/plain; charset=ISO-8859-1

That sounds like selfish mining, and the magic number is 25%. That's the
minimal pool size.
Today the threshold is 0% with good connectivity.

If I misunderstood your point, please elaborate.

Ittay



On Tue, Nov 5, 2013 at 12:05 PM, Peter Todd <pete@petertodd.org> wrote:

> On Tue, Nov 05, 2013 at 11:56:53AM -0500, Ittay wrote:
> > Hello,
> >
> > Please see below our BIP for raising the selfish mining threshold.
> > Looking forward to your comments.
>
> <snip>
>
> > 2. No new vulnerabilities introduced:
> > Currently the choice among equal-length chains is done arbitrarily,
> > depending on network topology. This arbitrariness is a source of
> > vulnerability. We replace it with explicit randomness, which is at the
> > control of the protocol. The change does not introduce executions that
> were
> > not possible with the old protocol.
>
> Credit goes to Gregory Maxwell for pointing this out, but the random
> choice solution does in fact introduce a vulnerability in that it
> creates incentives for pools over a certain size to withhold blocks
> rather than immediately broadcasting all blocks found.
>
> The problem is that when the pool eventually choses to reveal the block
> they mined, 50% of the hashing power switches, thus splitting the
> network. Like the original attack this can be to their benefit. For
> pools over a certain size this strategy is profitable even without
> investing in a low-latency network; Maxwell or someone else can chime in
> with the details for deriving that threshold.
>
> I won't get a chance to for a few hours, but someone should do the
> analysis on a deterministic switching scheme.
>
> --
> 'peter'[:-1]@petertodd.org
> 0000000000000005e25ca9b9fe62bdd6e8a2b4527ad61753dd2113c268bec707
>

--089e013d1b667b3d6c04ea7157d7
Content-Type: text/html; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr">That sounds like selfish mining, and the magic number is 2=
5%. That&#39;s the minimal pool size.=A0<div>Today the threshold is 0% with=
 good connectivity.=A0</div><div><br></div><div>If I misunderstood your poi=
nt, please elaborate.=A0</div>

<div><br></div><div>Ittay=A0</div><div><br></div></div><div class=3D"gmail_=
extra"><br><br><div class=3D"gmail_quote">On Tue, Nov 5, 2013 at 12:05 PM, =
Peter Todd <span dir=3D"ltr">&lt;<a href=3D"mailto:pete@petertodd.org" targ=
et=3D"_blank">pete@petertodd.org</a>&gt;</span> wrote:<br>

<blockquote class=3D"gmail_quote" style=3D"margin:0 0 0 .8ex;border-left:1p=
x #ccc solid;padding-left:1ex"><div class=3D"im">On Tue, Nov 05, 2013 at 11=
:56:53AM -0500, Ittay wrote:<br>
&gt; Hello,<br>
&gt;<br>
&gt; Please see below our BIP for raising the selfish mining threshold.<br>
&gt; Looking forward to your comments.<br>
<br>
</div>&lt;snip&gt;<br>
<div class=3D"im"><br>
&gt; 2. No new vulnerabilities introduced:<br>
&gt; Currently the choice among equal-length chains is done arbitrarily,<br=
>
&gt; depending on network topology. This arbitrariness is a source of<br>
&gt; vulnerability. We replace it with explicit randomness, which is at the=
<br>
&gt; control of the protocol. The change does not introduce executions that=
 were<br>
&gt; not possible with the old protocol.<br>
<br>
</div>Credit goes to Gregory Maxwell for pointing this out, but the random<=
br>
choice solution does in fact introduce a vulnerability in that it<br>
creates incentives for pools over a certain size to withhold blocks<br>
rather than immediately broadcasting all blocks found.<br>
<br>
The problem is that when the pool eventually choses to reveal the block<br>
they mined, 50% of the hashing power switches, thus splitting the<br>
network. Like the original attack this can be to their benefit. For<br>
pools over a certain size this strategy is profitable even without<br>
investing in a low-latency network; Maxwell or someone else can chime in<br=
>
with the details for deriving that threshold.<br>
<br>
I won&#39;t get a chance to for a few hours, but someone should do the<br>
analysis on a deterministic switching scheme.<br>
<span class=3D"HOEnZb"><font color=3D"#888888"><br>
--<br>
&#39;peter&#39;[:-1]@<a href=3D"http://petertodd.org" target=3D"_blank">pet=
ertodd.org</a><br>
0000000000000005e25ca9b9fe62bdd6e8a2b4527ad61753dd2113c268bec707<br>
</font></span></blockquote></div><br></div>

--089e013d1b667b3d6c04ea7157d7--