case no. 2008-10-31 · corpus: ~600 documents · status: open
PREV_HASHthe Satoshi investigation
Block #003

The machine: how the pieces were put together

Documents on file: whitepaper, sections 2–4 (Transactions, Timestamp Server, Proof-of-Work) · prev_hash: block #002

Three short sections describe the solution that two decades of attempts had missed. A coin is defined as a chain of signatures. Transactions are stamped in time by being hashed into a growing chain. And appending to that chain requires computational work — while the block itself is accepted only once other nodes have checked that its transactions are valid and not already spent. What matters for the investigation is not that this works. It is where each piece came from.

Artifact 003-A · the three moving parts
  transaction   ->  signed transfer of a coin
        |
        v
  timestamp     ->  hashed into a growing chain
        |
        v
  proof-of-work ->  work spent to append; block still validated by peers
        |
        v
  valid longest PoW chain -> the record nodes extend
Source text · whitepaper, section 4
„The proof-of-work also solves the problem of determining representation in majority decision making… one-CPU-one-vote.”
Bitcoin: A Peer-to-Peer Electronic Cash System, p. 3, Proof-of-Work

What is borrowed, what is new

attribution by document
chain of hashes as a timestamp — the whitepaper points to earlier work proof-of-work as a cost mechanism — the whitepaper points to earlier work digital signatures on transfers — standard cryptography of the era the particular combination of these elements — the whitepaper gives no earlier source the rule of choosing the valid chain with the greatest proof-of-work — the whitepaper gives no earlier source

So the parts were on the table for years — we saw that in block #001-L. The author does not hide it; the whitepaper points to the earlier work itself. What it does not do is name an earlier source for this particular combination, or for the rule of following the valid chain that carries the greatest proof-of-work. That is a fact about the document’s bibliography. It is not, by itself, proof of historical priority. One passage in section 4 is worth marking. The author observes that a vote counted by network address could be faked by anyone able to allocate many addresses, and ties the vote instead to a costly resource: processing power. That does not tell us the author was not a cryptographer — Sybil resistance and consensus are cryptographers’ problems too. It tells us the reasoning is not confined to cryptography: it also covers representation, identity and how a network decides. The closing section returns to it, describing nodes as voting with their CPU power and expressing acceptance of a block by working to extend it.

Block sources: bitcoin.org/bitcoin.pdf

Finding #4 — pinned to the boardThe whitepaper explicitly points to earlier work for the timestamping mechanism and for proof-of-work. It gives no earlier source for the particular combination of these elements with the rule of choosing the valid chain that carries the greatest proof-of-work. In section 4 the author analyses not only cryptography but also the problem of representation: network identities can be multiplied, so the vote is tied to a costly resource — processing power.
In block #004The machine runs — but why would anyone run it? The author answers with incentives, and starts reasoning about attackers the way an economist would, not a cryptographer. Friday, 14:10.

A research and archival project. The investigation relies solely on publicly available primary sources. We make no claims about any person’s identity; any future hypotheses will be labelled as hypotheses and grounded in documented findings.

© All rights reserved. You may share text excerpts of up to 500 characters and individual graphics — always with the project’s name and a link to the source. Publishing full episodes, collections of them or translations — in any form, paid or free — requires our written permission. Satoshi’s materials are quoted as primary sources under the right of quotation; we claim no rights to them. Licensing contact: the address in the “Join” section.

© 2008–2026 PREV_HASH · case open · node v0.2.0