Reference no: EM132421837

Imagine an attacker has amassed 44% of the network's hash power, and is looking to trick someone by double spending a 1-confirmation transaction.

He sends 10btc to the recipient, recipient waits for 1 confirmations, and sends the attacker some other cryptocurrency in exchange.

Now the attacker creates an alternative transaction that spends the same bitcoins to himself instead, and has to make a block containing his double-spend transaction, as well as more blocks on top of that first one, in order to make a 'longest chain' containing his double spend.

What is his probability of succeeding? Enter answer in percents, accurate to two decimal places.