...>

Given our assumption that p>q, the probability drops exponentially as the number of blocks the attacker has to catch up with inc reases. With the odds against him, if he doesn't make a lucky lunge forward early on, his chances become vanishingly small as he falls further behind.

We now consider how long the recipient of a new transaction needs to wait before being sufficiently certain the sender can't change the transaction. We assume the sender is an attacker who wants to make the recipie...

read full book
block explorer
Given our assumption that p>q, the probability drops exponentially as the number of blocks the attacker has to catch up with inc reases. With the odds against him, if he doesn't make a lucky lunge forward early on, his chances become vanishingly small as he falls further behind.

We now consider how long the recipient of a new transaction needs to wait before being sufficiently certain the sender can't change the transaction. We assume the sender is an attacker who wants to make the recipie...