[Cryptography] 2008 revision of Bitcoin whitepaper - original paper by satoshi nakamoto

[mark M]

On Thu, Aug 17, 2017 at 2:58 PM, Ray Dillinger <bear at sonic.net> wrote:

>
>
> On 08/17/2017 02:34 PM, Sidney Markowitz wrote:
>
> > This looks like it. It has the older phrase "without the burdens" in the
> > abstract that was posted to this mailing list in 2008 rather than the
> newer
> > "without going through"
> >
> > https://www.gwern.net/docs/20081003-nakamoto-bitcoindraft.pdf
>
> Yes.  The hash matches.  That's definitely it.  And this time I'm
> grabbing a copy and putting it in each of the first three places I
> looked for it.
>
>                                         Bear
>
>
> _______________________________________________
> The cryptography mailing list
> cryptography at metzdowd.com
> http://www.metzdowd.com/mailman/listinfo/cryptography
>


what about adam back's connection to satoshi? is adam back satoshi?
From: "Satoshi Nakamoto" <satoshi at anonymousspeech.com>
Sent: Friday, August 22, 2008 4:38 PM
To: "Wei Dai" <weidai at ibiblio.org>
Cc: "Satoshi Nakamoto" <satoshi at anonymousspeech.com>
Subject: Citation of your b-money page

I was very interested to read your b-money page.  I'm getting ready to
release a paper that expands on your ideas into a complete working system.
Adam Back (hashcash.org) noticed the similarities and pointed me to your
site.

I need to find out the year of publication of your b-money page for the
citation in my paper.  It'll look like:
[1] W. Dai, "b-money," http://www.weidai.com/bmoney.txt, (2006?).

You can download a pre-release draft
athttp://www.upload.ae/file/6157/ecash-pdf.html  Feel free to forward
it to
anyone else you think would be interested.

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.

Satoshi
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.metzdowd.com/pipermail/cryptography/attachments/20170817/d0f72efa/attachment.html>