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 payments 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 solution to the double-spending problem using 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. As long as a majority of CPU power is controlled by nodes that are not cooperating to attack the network, they'll generate the longest chain and outpace attackers. The network itself requires minimal 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.

比特幣：一種點(diǎn)對(duì)點(diǎn)的電子現(xiàn)金系統(tǒng)

作者：中本聰 satoshin@gmx.com
翻譯：何翀 jack.hechong@foxmail.com

摘要：一個(gè)純粹的點(diǎn)對(duì)點(diǎn)版本的電子現(xiàn)金系統(tǒng)，能夠無需通過任何一個(gè)金融系統(tǒng)，就允許交易直接從一端發(fā)送到另一端。數(shù)字簽名雖然提供了一部分的解決方案，但是，如果仍然需要一個(gè)受信任的第三方機(jī)構(gòu)來防范出現(xiàn)雙重支付問題的話，電子支付的主要優(yōu)勢(shì)就沒有了。我們提出了一個(gè)方案，通過使用點(diǎn)對(duì)點(diǎn)網(wǎng)絡(luò)的方法來防止雙重支付問題。這個(gè)點(diǎn)對(duì)點(diǎn)的網(wǎng)絡(luò)將每一筆交易都打上時(shí)間戳，把交易的記錄用哈希的方法錄入到一個(gè)不斷延展并且基于哈希的工作量證明鏈上，形成一個(gè)除非重做否則不能更改的記錄。最長(zhǎng)的鏈條不僅用來作為已發(fā)生事件順序的證據(jù)，而且用來證明他來自于最大的CPU算力池。只要大多數(shù)的CPU算力不被攻擊網(wǎng)絡(luò)的節(jié)點(diǎn)控制，良性的節(jié)點(diǎn)將會(huì)生成最長(zhǎng)的鏈條而且超越攻擊者。這個(gè)網(wǎng)絡(luò)本身需要最小化的結(jié)構(gòu)。信息將盡最大努力去廣播，節(jié)點(diǎn)可以根據(jù)自己的意愿離開或者重新加入，加入時(shí)接受以最長(zhǎng)的工作量證明鏈條作為他們離開期間所發(fā)生一切的證據(jù)。