RECAP
View of someone who wants to make a transaction
B1 B2 B8 B9 B10 Block = #… Prev = #… … Txn #871 … ...
Txn=#871 George Anna 1 ….
B’ B’’ ... Wait a few blocks until you can say that the transaction is confirmed
t Wait a few blocks until you Txn=#871 George Anna 1 . can say - - PowerPoint PPT Presentation
RECAP View of someone who wants to make a transaction Block = # Prev = # B 1 B 2 ... B 8 B 9 B 10 B ... B Txn #871 t Wait a few blocks until you Txn=#871 George Anna 1 . can say that the transaction is
B1 B2 B8 B9 B10 Block = #… Prev = #… … Txn #871 … ...
Txn=#871 George Anna 1 ….
B’ B’’ ... Wait a few blocks until you can say that the transaction is confirmed
B1 B2 B8 ... Block = #8ae1… Prev = B8 …. Txn #123 = … …. nonce SHA256 ( ) = 0x0b39d9ca51f07fef3429ae15…
B1 B2 B8 ... Block = #8ae1… Prev = B8 …. Txn #123 = … …. nonce' SHA256 ( ) = 0x000000ef34244s1jd99a533g…
B1 B2 B8 ... Block = #8ae1… Prev = B8 …. Txn #123 = … …. nonce’’ SHA256 ( ) = 0x1104000gf4jd8011889mdk3c…
B1 B2 B8 ... Block = #8ae1… Prev = B8 …. Txn #123 = … …. nonce’’ SHA256 ( ) = 0x1104000gf4jd8011889mdk3c…
Txn=#871 George Anna 1 ….
I n c l u d e t h i s t r a n s a c t i
B1 B2 B8 ... Block = #8ae1… Prev = B8 …. Txn #123 = … …. Txn #871 =… nonce’’’ SHA256 ( ) =
Txn=#871 Georgios Arvind 1 ….
I n c l u d e t h i s t r a n s a c t i
0x0000000aa38md69nb11efg48…
B1 B2 B8 ... Block = #8ae1… Prev = B8 …. Txn #123 = … …. Txn #871 =… nonce’’ SHA256 ( ) = 0x0000000aa38md69nb11efg48… B9 You lost the race
B1 B2 B8 ... Block = #8ae1… Prev = _å …. Txn #123 = … …. Txn #871 =… nonce’’ SHA256 ( ) = 0x0000000aa38md69nb11efg48… B9 You lost the race Remove transactions in B9 Update pointer to previous block
B1 B2 B8 ... Block = #8ae1… Prev = _å …. Txn #123 = … …. Txn #871 =… nonce SHA256 ( ) = 0x0000000aa38md69nb11efg48… B9 You lost the race Remove transactions in B9 Update pointer to previous block Keep trying!
longest
chain
gets extended by block
every tho mins What
can
a
miner do
choose any
block theyknow
about
to mine
Double
spending
attacks
keys
chancethis
happens
mining power
is
2
is 23
L
5140
Selfish
Mining
Set of miners
Xm
power that minerm has
L
m
all times
each
miner
is
aware of tree
graphthee
directed
towards root
minerm
nodes represent
blocks
at each tinet
a random
miner is selected to
mine
a block
Miner
mis
selected afpref Xm
ateech
the step
each miner
can pick
node
v
in
Gm
public
chain
m
tr
th
Assumptions
if
miner
m
is
in
a tie with
block far longest chain
everyone else manes
chain
minerm
well
mine
In
his
but
will onlybroadcast
a block
he has found
F
another
block
Same
distancefrom D
e
everyblock
Dz
I
reward
frack
blocks
longest chain
blocks
in
true steps
Kills
blows
longest chain
G
his view
hm
heightGm
lengthylargest
chain
G
publicview
h
height G
Assume that
alltieslostbym
Thisimproves rewards for mfan
Mainweray.ws t9Idagest
any
23.3
Markov
chain has
YdainonosnginneGonmin
setofstates S
Braak ties infavor
his
V state
u
Block annonquesnfing strategy
prob next state is V
msn.im
if
hm h
announceh
MacIver
ifmhndsnext.to
t
State
i
statei
means hm
I
O
there is fork
a ht
x x
x
x
x
x
0 D D D 22
p
Let pi belong
run
stationary probof beingin state
d
Post pact
2
pot
p
1
2
stationary dish
longrun probof
being
long run prob
pre Epaquo
9W
pi
pi id pitilla
i 32
qp.ES
arts
00
a
Po't
EEP i't
selfish
reward
payoff i
gp
9
y S
y
Amity
honestrewag
payoff
p
axtoy
count
a block
when it's
first announced
guaranteed
to
beon longest chain
miner
w
assuming
loses all
ties
is
l
L
It
212 D
fue when
2
0 3
The Miners Dilemma
mining pools
used to reduce
the variance
pool
manager
that
Bitcoin
as single mines
use partial proof of work
to figure
how
to split rewards among
miners
m
m
ima
block rewards
M
X's
Pool 1
attacks
Pooly
w
m
pool 5
also
gets the
NE
as
long
as both
pools 80
y
aoes
pool
does
lathi's24
a e
b E