The machine: how the pieces were put together
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.
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„The proof-of-work also solves the problem of determining representation in majority decision making… one-CPU-one-vote.”
What is borrowed, what is new
attribution by documentSo 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