中本聰?shù)谋忍貛虐灼ㄖ形淖g稿纽绍，譯者? 楊懷玉）

比特幣：點對點電子現(xiàn)金系統(tǒng)

作? ? ? ? 者：中本聰

電子郵箱：satoshin@gmx.com

網(wǎng)? ? ? ? 址：www.bitcoin.org

【摘要】純粹的點對點電子現(xiàn)金改進版丛肮，必須支持一方直接發(fā)送給另外一方的在線支付方式覆享，而無須通過任何金融機構(gòu)“儆睿“數(shù)字簽名”提供了部分解決方案摹恰，但如果還是必須由一個被信任的第三方來防止“雙重支付”捅位，則喪失了其關鍵價值。我們提出的“雙重支付”問題解決方案是使用“點對點”網(wǎng)絡杆查。此網(wǎng)絡使用“hashing(散列)”將交易打上“時間戳”扮惦，以此將所有交易合并為一個不間斷的基于散列的“工作量證明”鏈條，形成的記錄不可更改——除非重建“工作量證明”亲桦。不僅僅最長的鏈條用于被見證的事件系列之證明崖蜜，另一方面，該證明亦來自最大規(guī)模的CPU能量池客峭。只要不是為節(jié)點所控制的占比較大的CPU能量協(xié)同一致攻擊該網(wǎng)絡豫领，那么網(wǎng)絡將生成最長的，超過攻擊者的鏈條舔琅。此網(wǎng)絡本身只需極少的基礎設施等恐。信息盡最大努力進行廣播，節(jié)點可以隨意離開或重新加入網(wǎng)絡备蚓，并承認最長的“工作量證明”鏈條作為該節(jié)點離線期間所發(fā)生所有交易的證明课蔬。

附原文

Bitcoin: A Peer-to-Peer Electronic Cash System

Satoshi Nakamoto

satoshin@gmx.com

www.bitcoin.org

Abstract. A purely peer-to-peer version of electronic cash would allow online pay-ments to be sent directly from one party to another without going through a financial? institution. Digital signatures provide part of the solution, but the main benefits are lost if a trusted third party is still required to prevent double-spending.We propose a so-lution to the double-spending problem us-ing a peer-to-peer network. The network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof-of-work. The longest chain not only serves as proof of the sequence of events witnessed, but proof that it came from the largest pool of CPU power. Aslong as a majority of CPU power is controlled by nodes that are not cooperating toattack the network, they'll generate the longest chain and outpace attackers. Thenetwork itself requires mini-mal structure. Messages are broadcast on a best effort basis, and nodes can leave and rejoin the network at will, accepting the longest proof-of-work chain as proof of what happened while they were gone.