3 ms·
You're technically right - the correct calculation is in section 11 of Satoshi's original paper [1], though the probability of success still reduces exponential
by makomk 13y ago
You're technically right - the correct calculation is in section 11 of Satoshi's original paper [1], though the probability of success still reduces exponentially with the number of confirmations in the same way that dragontamer's calculation does.
[1] http://bitcoin.org/bitcoin.pdf http://bitcoin.org/bitcoin.pdf
- dragontamer 13y agoThanks for the link. Binomial walk makes sense. So it isn't 2^n, but a convolution summation over n-choose-r. Yeah... I don't feel like doing the "correct" math on this one. But the concept is still correct. It is exponentially harder for the malicious user to double-spend based. It is much harder to break ten "one minute" confirmation, than one "ten minute" confirmation.