Bitcoin: A Peer-to-Peer Electronic Cash System — TEI-tagged view

Satoshi Nakamoto · 2008 · economics · source · full text at the source · TEI xml · tagged edition · index · concepts · authors
Where this record's text came from. faceted 2026-08 by reading the locally held text (pdftext); every evidence string verified as an exact substring of that text before merging. The text is clean apart from the loss of figure content (diagram labels appear as runs of words such as 'Owner 1's Public Key Hash ...'); no quote was taken from those runs. Method is recorded as system-or-tool-building because the paper's core is a proposed system design; it also contains an analytical component (Binomial Random Walk / Poisson calculation of attacker success probability with C code), which the single method facet cannot express. No empirical evaluation, deployment data, or replication is reported, hence replication status untested. Only one claim_relation is recorded: Hashcash is the sole prior work the paper names by author and explicitly positions its own mechanism against; the remaining references ([1]-[5], [7], [8]) are bare numeric citations. 2026-08-14 and 2026-08-25 schema-0.3 passes: every quote verified as an exact substring of the staged text and anchored at merge time; concept terms verified present; every edge endpoint an existing node.
Other fields define these differently the same word, defined another way in another discipline
nodes 2 fields
Tags on this paper every tag the record carries, whether or not the words occur in the text below — a number is how many papers in the corpus carry that tag; a tag with no number is unique to this paper
blockchain3 proof-of-work2 double-spending peer-to-peer network cryptocurrency electronic coin chain of digital signatures longest chain timestamp server system-or-tool-building173

Our tag layer for this paper

Cross-disciplinary analysis
content-tags & facets: phenomenon · claim-type · cross-domain-transfer · mechanism · claim-relation · replication-status · limitation — grounded in the full text
phenomenondouble-spending in electronic cash— “The problem of course is the payee can't verify that one of the owners did not double-spend the coin.”
claim-typemethod— “We propose a solution to the double-spending problem using a peer-to-peer network.”
method — evidence— “In this paper, we propose a solution to the double-spending problem using a peer-to-peer distributed timestamp server to generate computational proof of the chronological order of transactions.”
transferfrom cryptography / computer science: using cryptographic proof (hashes, digital signatures, proof-of-work) to build a currency and payment system with no trusted third party— “What is needed is an electronic payment system based on cryptographic proof instead of trust”transfers[0]
mechanismproof-of-work blockchain: hash transactions into a chain secured by proof-of-work so the honest majority of computing power extends the longest chain and the record becomes practically immutable, preventing double-spending without a trusted third party— “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”mechanisms[0]
contradicts the trusted-third-party (financial-institution) model— “the main benefits are lost if a trusted third party is still required to prevent double-spending”claim_relations[0]
builds-on Adam Back's Hashcash [6]— “To implement a distributed timestamp server on a peer-to-peer basis, we will need to use a proofof-work system similar to Adam Back's Hashcash [6], rather than newspaper or Usenet posts.”claim_relations[1]
sensethe chain - NEVER 'blockchain': the paper's own names for its central object are a chain of digital signatures and a chain of ownership, and the compound the entire field later settled on appears nowhere in the document that introduced the thing— “We define an electronic coin as a chain of digital signatures. Each owner transfers the coin to the next by digitally signing a hash of the previous transaction and the public key of the next owner and adding these to the end of the coin. A payee can verify the signatures to verify the chain of ownership”senses[0]
sensemajority - AS CPU POWER, NOT AS HEADS: the paper rules out one-vote-per-participant explicitly, so 'majority decision' and 'consensus' here mean the greatest expenditure of computation and not what those words mean in any deliberative sense— “If the majority were based on one-IP-address-one-vote, it could be subverted by anyone able to allocate many IPs. Proof-of-work is essentially one-CPU-one-vote”senses[1]
senseprivacy - AS A BREAK IN THE FLOW OF INFORMATION, NOT AS SECRECY: everything is announced publicly and privacy is obtained only by keeping the keys unattributed, which the paper likens to a stock exchange tape that prints every trade without the parties— “The necessity to announce all transactions publicly precludes this method, but privacy can still be maintained by breaking the flow of information in another place: by keeping public keys anonymous”senses[2]
controlan adversarial calculation of the probability that an attacker generating an alternate chain overtakes the honest chain — held— “We will show later that the probability of a slower attacker catching up diminishes exponentially as subsequent blocks are added.” — rules out that a slower attacker could rewrite the transaction history by catching up with the honest chaincontrols[0]
relationelectronic coin —operationalised-as→ chain of digital signatures — the coin IS the signature chain - the paper defines it that way outrightconcept_edges[0]
auditlongest chain —operationalised-as→ proof-of-work — Audit 2026-09-28: DOUBTFUL - read against its span and kept, but the span says the longest chain has the greatest proof-of-work invested; operationalised-as is a loose reading.concept_edges[1]
outcomecontrol — held
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
controls[0]
for which uselimitation — every security claim in the paper: THE SYSTEM IS SECURE AS LONG AS HONEST NODES COLLECTIVELY CONTROL MORE CPU POWER THAN ANY COOPERATING GROUP OF ATTACKER NODES
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[0]
duplicate oflimitation — limitations[0]
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[1]
for which uselimitation — the same scope as limitations[0] - the majority-honest assumption
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[1]
for which uselimitation — simplified payment verification specifically: THE VERIFICATION IS RELIABLE AS LONG AS HONEST NODES CONTROL THE NETWORK, BUT IS MORE VULNERABLE IF THE NETWORK IS OVERPOWERED
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[2]
for which uselimitation — the privacy claim: SOME LINKING IS STILL UNAVOIDABLE WITH MULTI-INPUT TRANSACTIONS, WHICH NECESSARILY REVEAL THAT THEIR INPUTS WERE OWNED BY THE SAME OWNER
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[3]
for which uselimitation — the claim that this system removes the need for trust: it is secure as long as honest nodes collectively control more CPU power than any cooperating group of attacker nodes, a condition about the distribution of hardware rather than a property of the cryptography
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[4]
for which uselimitation — the claim that an attack is infeasible: an attacker with a CPU majority is argued to be deterred by preferring to generate new coins over defrauding people, which is an assumption about the attacker's motives and not about what the attacker can do
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[5]
for which uselimitation — any description of this system as anonymous: privacy is maintained by keeping public keys anonymous, and the paper states that if the owner of a key is revealed, linking could reveal the other transactions belonging to that owner
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[6]
for which uselimitation — a payment accepted through simplified verification: the paper states
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[7]
for which uselimitation — the claim that block headers can be kept in memory: it rests on 2008 machines shipping with 2GB of RAM and on Moore's Law predicting growth of 1.2GB per year
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[8]
replicationuntested
limitationsecurity holds only while honest nodes control the majority of CPU power (the 51% assumption)
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[0]
limitationSecurity holds only under the assumption that honest nodes control the majority of CPU power.
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[1]
limitationSimplified payment verification can be deceived while an attacker overpowers the network.
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[2]
limitationThe privacy scheme cannot prevent all linkage between transactions of one owner.
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[3]
limitationThe security claim is conditional on a distributional fact about who owns computing power, which no participant can check.
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[4]
limitationThe deterrent is economic rather than cryptographic: it assumes an attacker who prefers the more profitable option.
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[5]
limitationPrivacy is pseudonymity, and the paper names the exact way it fails.
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[6]
limitationThe lightweight verification method is defeasible for as long as an attack lasts.
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[7]
limitationThe feasibility argument for storage rests on a hardware extrapolation made in 2008.
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
limitations[8]
Content tags
content-observations: finding · quantity · variable · definition · key-term — grounded in the full text
findingA peer-to-peer network solves the double-spending problem by timestamping transactions into an ongoing chain of hash-based proof-of-work that cannot be changed without redoing the work.
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
content_tags.findings[0]
findingThe system stays secure while honest nodes together hold more CPU power than any colluding group of attackers.
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
content_tags.findings[1]
definitionproof-of-work
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
content_tags.definitions[0]
definitionMerkle Tree
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
content_tags.definitions[1]
key-termsnetwork, proof-of-work, hash, chain, transactions, nodes, block, timestamp, peer-to-peer
Concepts
terms this paper carries, each with the sentence it was cut from — the layer that joins one paper to another. Terms with no quote yet are on CONCEPTS.html.
conceptproof-of-work
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
concepts[1]
conceptelectronic coin
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
concepts[5]
conceptchain of digital signatures
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
concepts[6]
conceptlongest chain
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
concepts[7]
concepttimestamp server
Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher.
concepts[8]

When we have changed our mind. Some entries in the table begin with a word in capitals and the reason for it. EVIDENCE CORRECTED — the finding still stands, but we had quoted the wrong sentence from the paper, and the quotation has been replaced with the right one. RETRACTED — the entry itself was wrong; it stays on the page, marked, with the reason, rather than being deleted. WITHDRAWN AND REPLACED — the entry was wrong, and a corrected version of it appears in the entries below. Each mark carries its own reason, in brackets, because the reasons differ from one entry to the next. An entry we have WITHDRAWN is removed from this page and kept in the record, with its reason. A line reading Audit and a date is a later re-reading of the entry against its whole sentence: DOUBTFUL means it was kept, and the reason says what is loose about it. Quotation marks inside the tagger's sentence. Where a tag is the tagger's own sentence, a phrase in quotation marks inside it is borrowed from the paper — the tagger's wording around it is not. The paper's own sentence is the evidence quote for that row; on this page it is withheld with the article, and the article is at its publisher. Nothing inside quotation marks anywhere on this page is ours: if it is quoted, it is the paper's. Whose words a concept carries. A concept entry records a term the paper itself uses, so the term, the sense given for it, and its evidence are the paper's own words, quoted where the paper fixes them. This is the opposite of a sense entry in the tag table, which is the tagger's sentence about how the paper uses a term. Where a concept entry could not be grounded in the paper's words, the entry says so on its own row.

Tag layer © the Meta-Tagging Project, CC BY 4.0. The paper text is © its authors/publisher and is linked, not reproduced. Excerpts shown are short quotations for identification and verification. · back to index · concepts · authors · עברית
© 2026 Shir Sivroni · ORCID 0009-0000-2597-2824