Talk:Majority attack: Difference between revisions

From Bitcoin Wiki
Jump to navigation Jump to search
Alfe (talk | contribs)
mNo edit summary
Alfe (talk | contribs)
No edit summary
Line 17: Line 17:
Doesn't this render the concept of a majority attack completely useless in practice?  Please correct me if I'm wrong, but otherwise the article should mention this aspect.
Doesn't this render the concept of a majority attack completely useless in practice?  Please correct me if I'm wrong, but otherwise the article should mention this aspect.


I'd also be interested in information about the typical or longest ever revoked blockchain.  I guess it never was six iterations, but what was the longest ever discarded chain? --[[User:Alfe|Alfe]] ([[User talk:Alfe|talk]]) 09:38, 1 June 2016 (UTC)
I'd also be interested in information about the typical or longest ever overtaken blockchain.  I guess it never was six iterations, but what was the longest chain ever overtaken by another, longer one which was unknown up to that point in time so that it came as a complete surprise? --[[User:Alfe|Alfe]] ([[User talk:Alfe|talk]]) 09:38, 1 June 2016 (UTC)

Revision as of 09:59, 1 June 2016

Practicality

As I understand this, a typical use of such an attack would be to revoke a payment after it has been done, apparently. If everyone sticks to the rule to await six confirmations before deeming a payment secured (and the payer can barely influence this as the receiver decides how to handle this), then a later revoke can only be done by secretly computing a longer block chain than the public one. So this would mean the following steps:

  1. Alice issues a payment, sending some BC to Bob.
    • Alice secretly creates a payment which sends the same BC to herself (or Alice').
    • Alice start computing a blockchain not containing the payment to Bob, but the one to herself.
  2. Miners create a block confirming the payment to Bob.
  3. Miners create five successive blocks based on this one, cementing the payment to Bob.
    • Alice overtakes the Miners in creating blocks based on her payment to herself but keeps everything secret.
  4. Bob hands out goods in exchange to the payment.
  5. Alice suddenly reveals her longer blockchain, not containing the payment to Bob, but the one to herself.
  6. Everybody switches to this blockchain because it is longer than the up to then public one.
  7. Bob has gotten no payment but has handed out the goods, thus the fraud is complete.

Okay, this is possible. But: This would mean to have a switch to another block chain which was secret for six iterations. This would be an obvious case, wouldn't it? Every BC user would be able to detect such a case. The results would be that everybody in the community would be able to understand that this is probably only happening to commit a fraud. A majority attack would never go unnoticed by the public. As a result of this obvious abuse of the system, everybody would lose confidence in the currency, everyone would try to get rid of their BCs, the market price would drop massively. Nobody capable of doing a majority attack would be interested in such an outcome.

Doesn't this render the concept of a majority attack completely useless in practice? Please correct me if I'm wrong, but otherwise the article should mention this aspect.

I'd also be interested in information about the typical or longest ever overtaken blockchain. I guess it never was six iterations, but what was the longest chain ever overtaken by another, longer one which was unknown up to that point in time so that it came as a complete surprise? --Alfe (talk) 09:38, 1 June 2016 (UTC)