From 4214146a4b38d67420825a4775985e0acc1a14f1 Mon Sep 17 00:00:00 2001 From: nadams Date: Thu, 18 May 2017 05:56:32 -0700 Subject: [PATCH] Edited appdx-bitcoinwhitepaper.asciidoc with Atlas code editor --- appdx-bitcoinwhitepaper.asciidoc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/appdx-bitcoinwhitepaper.asciidoc b/appdx-bitcoinwhitepaper.asciidoc index 1b3c1639..7b22a12e 100644 --- a/appdx-bitcoinwhitepaper.asciidoc +++ b/appdx-bitcoinwhitepaper.asciidoc @@ -13,7 +13,7 @@ Satoshi Nakamoto _satoshin@gmx.com_ -www.bitcoin.org +pass:[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'11 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.