原始文献 / 邮件 / Bitcoin P2P e-cash paper

Bitcoin P2P e-cash paper

Cryptography Mailing List · 2008-10-31 18:10:00 UTC

FromSatoshi Nakamoto
SubjectBitcoin P2P e-cash paper
Date2008-10-31 18:10:00 UTC
ListCryptography Mailing List · 原文

我一直在研究一种新型电子现金系统,它完全是点对点的,没有可信第三方。

论文地址:
http://www.bitcoin.org/bitcoin.pdf

主要特性:
双重支付通过点对点网络防止。
没有铸币方或其他可信第三方。
参与者可以保持匿名。
新币由 Hashcash 式工作量证明产生。
新币生成所用的工作量证明同时驱动整个网络,以防止双重支付。

比特币:一种点对点电子现金系统

摘要。纯粹点对点版本的电子现金将允许在线支付从一方直接发送给另一方,而无需经过金融机构的负担。数字签名提供了部分解决方案,但如果仍需要可信第三方来防止双重支付,其主要优势便会丧失。我们提出了一种使用点对点网络解决双重支付问题的方案。网络通过将交易哈希成一条基于哈希的工作量证明的持续链来为交易打时间戳,形成一条未经重做工作量证明就无法更改的记录。最长链不仅是所见事件序列的证明,也是它来自最大 CPU 算力池的证明。只要诚实节点控制着网络上最多的 CPU 算力,它们就能生成最长链,并超过任何攻击者。网络本身所需的结构极小。消息以尽力而为的方式广播,节点可以随意离开和重新加入网络,并接受最长工作量证明链作为其离开期间所发生事件的证明。

论文全文:
http://www.bitcoin.org/bitcoin.pdf

Satoshi Nakamoto

---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo at metzdowd.com

英文原文

I've been working on a new electronic cash system that's fully
peer-to-peer, with no trusted third party.

The paper is available at:
http://www.bitcoin.org/bitcoin.pdf

The main properties:
Double-spending is prevented with a peer-to-peer network.
No mint or other trusted parties.
Participants can be anonymous.
New coins are made from Hashcash style proof-of-work.
The proof-of-work for new coin generation also powers the
network to prevent double-spending.

Bitcoin: A Peer-to-Peer Electronic Cash System

Abstract. A purely peer-to-peer version of electronic cash would
allow online payments to be sent directly from one party to another
without the burdens of going through a financial institution.
Digital signatures provide part of the solution, but the main
benefits are lost if a trusted 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 honest nodes control
the most CPU power on the network, they can generate the longest
chain and outpace any attackers. The network itself requires
minimal structure. Messages are broadcasted 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.

Full paper at:
http://www.bitcoin.org/bitcoin.pdf

Satoshi Nakamoto

---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo at metzdowd.com