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

mining theory – Why not use lowest block hash to determine which chain to build on top of in case of a temporary fork due to two blocks found roughly at same time?

 

It’s my understanding that if two miners find blocks at roughly the same time that other nodes on the network will use whichever valid block they see first as the extension of the main chain and the second block as a temporary fork building on a secondary chain.

The next block that is found (assuming it’s alone) will determine which chain (at least for now) should become the main chain.

I’m trying to understand why we don’t just let whichever block has the lower hash be the winner to extend the chain?

Is there some attack or break down of incentives if we do this that I am not seeing? Or is it just an arbitrarily decided solution and this one would (in theory) also work fine?



Source link

Leave a Comment

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