Selfish mining attack: Probability of block being mined - CS251 exam question

Selfish mining attack: Probability of block being mined – CS251 exam question

 

I am currently studying for the CS251 Cryptocurrencies and Blockchain Technologies exam. In a past exam, there is this question without an answer and I would really appreciate your help so that I can better understand it:

Recall that a selfish miner temporarily refrains from publishing mined blocks in an
effort to get several blocks ahead of other miners, thereby causing other miners to
waste effort mining orphan blocks. When a selfish miner is only one block S ahead of
the public chain, if another miner mines and publishes a block O at the same height as
S, the selfish miner immediately publishes S. Let γ be the probability that, when this
happens, an honest miner will try to mine the next block on S instead of on O.

A) How can an attacker ensure that γ ≈ 1 (in other words, S almost always overrides O) on today’s Bitcoin network?

Thank you very much in advance for your help!



Source link

Leave a Comment

Your email address will not be published. Required fields are marked *