Received-SPF: pass (sog-mx-1.v43.ch3.sourceforge.com: domain of gmail.com
	designates 209.85.215.43 as permitted sender)
	client-ip=209.85.215.43; envelope-from=stanga@gmail.com;
	helo=mail-la0-f43.google.com; 
MIME-Version: 1.0
Sender: stanga@gmail.com
From: Ittay <ittay.eyal@cornell.edu>
Date: Tue, 5 Nov 2013 11:56:53 -0500
Message-ID: <CABT1wWkOukEzxK5fLbnA4ZgJGN1hb_DMteCJOfA13FE_QZCi=Q@mail.gmail.com>
To: Bitcoin Dev <bitcoin-development@lists.sourceforge.net>
Content-Type: multipart/alternative; boundary=001a11c259aa9e856804ea70ecfa
Cc: Gavin Andresen <gavin@bitcoinfoundation.org>,
	=?ISO-8859-1?Q?Emin_G=FCn_Sirer?= <egs@systems.cs.cornell.edu>
Subject: [Bitcoin-development] BIP proposal - patch to raise selfish mining
	threshold.
Precedence: list

--001a11c259aa9e856804ea70ecfa
Content-Type: text/plain; charset=ISO-8859-1

Hello,

Please see below our BIP for raising the selfish mining threshold.
Looking forward to your comments.

Best,
Ittay

---

Bitcoin Improvement Proposal

Owners: Ittay Eyal and Emin Gun Sirer

We suggest a change in the propagation and mining algorithm for chains of
the same difficulty, to raise the threshold on Selfish Mining attacks.

* Current situation:
When a miner is notified of a new chain of the same difficulty as the one
it is mining on, it will ignore it.

* Background:
The selfish mining attack and its implications were described in detail in
the following research paper:
http://arxiv.org/abs/1311.0243v1

* Proposal:
To thwart selfish mining attacks launched by less than 25% of the mining
power, we propose the following change to the protocol:
When a miner learns of more than one chain of the same difficulty, it
should propagate all of them, and choose one of them to mine on uniformly
at random among all chains of the same difficulty.

When hearing of a chain of maximal difficulty that it did not know of
before:
1. Add it to a local list of maximal difficulty chains.
2. Propagate it to its neighbors.
3. Choose a branch uniformly at random from the local list, and mine on it.

* Example:
t0: learn of chain A of difficulty x.
    propagate A to neighbors.
    start mining on A.
t1: learn of chain B of difficulty x.
    propagate B to neighbors.
    toss a coin between A and B; if B wins, switch to mining on B.
t2: learn of chain C of difficulty x.
    propagate C to neighbors.
    toss a 3 faced coin among A, B, and C; switch to mining on the winning
chain.

* Concerns and answers:
1. No harm to miners when all are honest.
Mining blocks is a random Poisson process, which is memoryless. Having
mined on the block in the past does not provide an advantage in locating a
solution in the future. Therefore, a miner is not harmed by switching the
chain on which it mines.

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.

3. Complete backward compatibility:
Any subset of the miners can switch to the proposed protocol.

4. Progressive improvement:
Each miner that adopts the change raises the threshold a little bit. The
threshold will reach 25% with universal adoption.

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

<div dir=3D"ltr"><div>Hello,=A0</div><div><br></div><div>Please see below o=
ur BIP for raising the selfish mining threshold.=A0</div><div>Looking forwa=
rd to your comments.=A0</div><div><br></div><div>Best,=A0</div><div>Ittay=
=A0</div><div>


<br></div><div>---=A0</div><div><br></div><div>Bitcoin Improvement Proposal=
=A0</div><div><br></div><div>Owners: Ittay Eyal and Emin Gun Sirer=A0</div>=
<div><br></div><div>We suggest a change in the propagation and mining algor=
ithm for chains of the same difficulty, to raise the threshold on Selfish M=
ining attacks.=A0</div>


<div><br></div><div>* Current situation:=A0</div><div>When a miner is notif=
ied of a new chain of the same difficulty as the one it is mining on, it wi=
ll ignore it.=A0</div><div><br></div><div>* Background:=A0</div><div>The se=
lfish mining attack and its implications were described in detail in the fo=
llowing research paper:=A0</div>


<div><a href=3D"http://arxiv.org/abs/1311.0243v1" target=3D"_blank">http://=
arxiv.org/abs/1311.0243v1</a></div><div><br></div><div>* Proposal:=A0</div>=
<div>To thwart selfish mining attacks launched by less than 25% of the mini=
ng power, we propose the following change to the protocol:=A0</div>


<div>When a miner learns of more than one chain of the same difficulty, it =
should propagate all of them, and choose one of them to mine on uniformly a=
t random among all chains of the same difficulty.=A0</div><div><br></div>


<div>When hearing of a chain of maximal difficulty that it did not know of =
before:=A0</div><div>1. Add it to a local list of maximal difficulty chains=
.=A0</div><div>2. Propagate it to its neighbors.=A0</div><div>3. Choose a b=
ranch uniformly at random from the local list, and mine on it.=A0</div>


<div><br></div><div>* Example:=A0</div><div>t0: learn of chain A of difficu=
lty x.=A0</div><div>=A0 =A0 propagate A to neighbors.=A0</div><div>=A0 =A0 =
start mining on A.=A0</div><div>t1: learn of chain B of difficulty x.=A0</d=
iv><div>=A0 =A0 propagate B to neighbors.=A0</div>


<div>=A0 =A0 toss a coin between A and B; if B wins, switch to mining on B.=
=A0</div><div>t2: learn of chain C of difficulty x.=A0</div><div>=A0 =A0 pr=
opagate C to neighbors.=A0</div><div>=A0 =A0 toss a 3 faced coin among A, B=
, and C; switch to mining on the winning chain.=A0</div>


<div><br></div><div>* Concerns and answers:=A0</div><div>1. No harm to mine=
rs when all are honest.=A0</div><div>Mining blocks is a random Poisson proc=
ess, which is memoryless. Having mined on the block in the past does not pr=
ovide an advantage in locating a solution in the future. Therefore, a miner=
 is not harmed by switching the chain on which it mines.=A0</div>


<div><br></div><div>2. No new vulnerabilities introduced:=A0</div><div>Curr=
ently the choice among equal-length chains is done arbitrarily, depending o=
n network topology. This arbitrariness is a source of vulnerability. We rep=
lace it with explicit randomness, which is at the control of the protocol. =
The change does not introduce executions that were not possible with the ol=
d protocol.=A0</div>


<div><br></div><div>3. Complete backward compatibility:=A0</div><div>Any su=
bset of the miners can switch to the proposed protocol.=A0</div><div><br></=
div><div>4. Progressive improvement:=A0</div><div>Each miner that adopts th=
e change raises the threshold a little bit. The threshold will reach 25% wi=
th universal adoption.=A0</div>


<div><br></div></div>

--001a11c259aa9e856804ea70ecfa--