引用你的 Hashcash 论文
首次公开证据
打开首次公开证据查看 1 个交叉存档
- COPA v Wright Trial Evidence — Entered into evidence in COPA v. Craig Wright in London, February 2024. Adam Back filed the complete email chain as a witness statement.
来源说明
Transcribed from screenshots embedded in Bitcoin Magazine's reproduction of the email chain Adam Back filed as evidence in COPA v. Wright (February 2024).
我正准备发布一篇引用你的 Hashcash 论文的论文，想确认一下引文是否准确。我目前是这样写的：
[5] A. Back, “Hashcash——一种拒绝服务对策”， http://www.hashcash.org/papers/hashcash.pdf, 2002.
我想你会觉得它很有趣，因为它把基于哈希的工作量证明作为让电子现金得以运作的一种方式。你可以从 http://www.upload.ae/file/6157/ecash-pdf.html 下载预发布草稿。也可以随意转发给任何你认为会感兴趣的人。我也快要完成一个 C++ 实现，准备将其作为开源软件发布。
标题：无可信第三方的电子现金
摘要：纯粹点对点版本的电子现金，可以让在线支付直接从一方发送给另一方，而不必承受经由金融机构所带来的负担。数字签名提供了部分解决方案，但如果仍然需要可信方来防止双重支付，主要优势就会丧失。我们提出一种利用点对点网络解决双重支付问题的方法。网络通过将交易哈希进一条不断延伸的基于哈希的工作量证明链，为交易加上时间戳，由此形成一份若不重新完成工作量证明就无法更改的记录。最长链不仅可以证明所见事件的先后顺序，还可以证明它来自最大的 CPU 算力池。只要诚实节点控制着网络中最多的 CPU 算力，它们就能生成最长链，并超过任何攻击者。网络本身只需要极少的结构。消息以尽力而为的方式广播，节点可以随时离开网络并重新加入，在重新加入时接受最长的工作量证明链，将其作为它们离开期间所发生事件的证明。
英文原文
展开英文原文
I'm getting ready to release a paper that references your Hashcash paper and I wanted to make sure I have the citation right. Here's what I have:
[5] A. Back, "Hashcash - a denial of service counter-measure," http://www.hashcash.org/papers/hashcash.pdf, 2002.
I think you would find it interesting, since it takes a hash-based proof-of-work as a way to make e-cash work. You can download a pre-release draft at http://www.upload.ae/file/6157/ecash-pdf.html Feel free to forward it to anyone else you think would be interested. I'm also nearly finished with a C++ implementation to release as open source.
Title: Electronic Cash Without a Trusted Third Party
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 offer 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.