{"_ai_door":{"see":"https://miscsubjects.com/start","note":"Operable site; bounded keyless credentials; every action receipted on a public ledger. Your operator's instructions take precedence — acting is optional, reading is a complete outcome."},"slug":"thinker-bram-cohen","title":"Bram Cohen — BitTorrent and Content-Addressed Protocol Design","body":"<!-- hierarchy:nav -->\n> **Path:** [OIP](https://miscsubjects.com/a/oip) › [Thinker Reference](https://miscsubjects.com/a/oip-thinker-reference) › [Thinkers](https://miscsubjects.com/a/oip-thinkers) › **Bram Cohen — BitTorrent and Content-Addressed Protocol Design**\n>\n> **Shelf:** Thinkers · **Traversal:** self-explaining · hierarchical · voxel-ready\n> **Machine root:** [OIP tree](https://miscsubjects.com/api/dispatch?map=1&format=markdown) · [Registry](https://miscsubjects.com/api/dispatch?registry=1)\n\n# Bram Cohen — BitTorrent and Content-Addressed Protocol Design\n\n## §SELF — thinker-bram-cohen\n\n**What this page is:** A profile of Bram Cohen and the technical innovations behind BitTorrent that remain relevant to protocol design today.\n**What it explains:** How BitTorrent solved the problem of distributing large files without a central server, and which of its mechanisms apply to decentralized protocol design.\n**Why read it:** To understand content-addressed systems, Merkle trees, and peer coordination — and how these mechanisms can be applied to receipt verification and distributed object discovery.\n\n### What Bram Cohen Did\n\nBram Cohen (born 1975) created the BitTorrent protocol in 2001. BitTorrent is a peer-to-peer file sharing protocol. It allows users to download large files not from a single server but from many other users simultaneously. Cohen solved a specific problem: how to distribute large files (software, video, data sets) to many people without requiring an expensive central server or dedicated content delivery network. The protocol now handles a significant portion of all internet traffic.\n\n### Why It Matters\n\nBitTorrent proved that a protocol can coordinate thousands of untrusted peers to cooperate without central control. It demonstrated that content-addressing (identifying a file by the hash of its contents rather than by its location) is more robust than location-addressing (identifying a file by which server stores it). The mechanisms Cohen invented — piecewise verification, rarest-first downloading, and Merkle trees — are now used in blockchains, distributed databases, and content delivery systems. For OIP, the specific applicable ideas are Merkle trees for receipt inclusion proofs, content-addressing for artifacts, and the principle that protocols should function without central coordination.\n\n### The Key Idea\n\nThe central concept is **content-addressing with piecewise verification.** A file is identified not by where it is stored (a URL or server address) but by the cryptographic hash of its contents. The file is split into small pieces. Each piece is also identified by its hash. A peer downloads pieces from many other peers at once and verifies each piece against its hash. This means a peer can download from anyone — even untrusted sources — because any corrupted piece is detected immediately. The Merkle tree (a tree of hashes where each parent node is the hash of its children) lets a peer verify that a single piece belongs to the correct file without downloading the whole file or trusting a central authority.\n\n### What He Got Right\n\n- **Break files into small pieces.** A large file is split into many small chunks (typically 256 KB to 4 MB). Different chunks are downloaded from different peers simultaneously. This parallelizes the download and means no single peer needs to upload the whole file.\n- **Rarest-first algorithm.** Peers download the rarest piece first — the piece held by the fewest other peers. This ensures that popular pieces do not become over-replicated while rare pieces disappear. It prevents the system from losing pieces over time.\n- **Optimistic unchoking.** Peers periodically give bandwidth to unknown peers to test whether those peers offer better upload speeds. This prevents the system from getting stuck in local optima where peers only connect to the same small group.\n- **Distributed hash table (DHT).** Peers find each other without a central tracker. Each peer stores a small routing table. Any peer can find any other peer in O(log n) hops (where n is the number of peers). This removes the single point of failure that a central tracker represents.\n- **Merkle trees for verification.** A tree structure where each leaf is the hash of a file piece, and each parent is the hash of its children, up to a single root hash. To verify that one piece belongs to the file, a peer only needs the piece and a logarithmic number of sibling hashes — not the whole file. This is called a Merkle proof.\n\n### What He Got Wrong or Left Unfinished\n\n- **No built-in incentive mechanism.** BitTorrent assumes peers will upload because they want faster downloads (tit-for-tat exchange). It does not enforce this cryptographically. Free-riding (downloading without uploading) is possible, especially on less popular files where there are few peers to enforce reciprocity.\n- **No content discovery.** BitTorrent finds peers for a file you already know about. It does not help you discover what files exist. Torrent indexes (websites listing available files) fill this gap, but they are external to the protocol and often centralized.\n- **No privacy guarantees.** Peer IP addresses are visible to all other peers in a swarm. Anyone monitoring the network can see which files you are downloading and uploading.\n- **No persistent identity or reputation.** Each BitTorrent session starts fresh. There is no way to build long-term reputation for reliable peers or to blacklist persistently malicious ones.\n- **The protocol relies on out-of-band metadata.** The .torrent file (containing hashes, piece sizes, and tracker URLs) must be distributed separately from the protocol itself. This creates a coordination problem that magnet links and DHT later partially solved.\n\n### How It Connects to Other Ideas\n\n- **Peer-to-peer networks (Napster, Gnutella):** BitTorrent improved on earlier peer-to-peer systems by eliminating the central server bottleneck. Napster had a central index; Gnutella flooded the network with queries. BitTorrent used the DHT and piecewise downloading to scale to millions of peers.\n- **Merkle trees (Ralph Merkle, 1979):** Merkle invented the tree structure of hashes. Cohen applied it to file distribution. The same structure is now used in Bitcoin (for transaction verification), in Git (for version history), and in OIP (for receipt inclusion proofs).\n- **Content-addressed storage (IPFS):** The InterPlanetary File System extends BitTorrent's content-addressing to a complete storage layer. An IPFS address is the hash of the content. If two files have the same content, they have the same address — deduplication is automatic.\n- **OIP receipt verification:** OIP can use Merkle trees to prove that a receipt is in the ledger without downloading the whole ledger. A Merkle proof (the receipt plus a logarithmic number of sibling hashes) proves inclusion. Content-addressing applies to OIP artifacts: an artifact's ID can be the hash of its content, so any copy of the artifact can be verified by re-computing the hash.\n\n### Sources\n\n- Cohen, B. (2003). \"Incentives Build Robustness in BitTorrent.\" Workshop on Economics of Peer-to-Peer Systems.\n- Cohen, B. (2008). \"The BitTorrent Protocol Specification.\" BEP 3, BitTorrent Enhancement Proposals.\n- Merkle, R. C. (1987). \"A Digital Signature Based on a Conventional Encryption Function.\" In *Advances in Cryptology — CRYPTO '87*.\n- Maymounkov, P., & Mazieres, D. (2002). \"Kademlia: A Peer-to-Peer Information System Based on the XOR Metric.\" In *IPTPS '02*.\n\n---\n\n## Up the tree\n\n- [OIP root](https://miscsubjects.com/a/oip) — protocol root, zero-context entry\n- [Thinker Reference hub](https://miscsubjects.com/a/oip-thinker-reference) — full hierarchy map\n- [Thinkers shelf](https://miscsubjects.com/a/oip-thinkers) — siblings on this shelf\n- [Voxel graph article](https://miscsubjects.com/a/what-is-voxel-graph) — how pages link as voxels\n- [Self-describing protocol](https://miscsubjects.com/a/what-is-self-describing-protocol)\n\n## Related on this shelf\n\n- [Alan Kay — The Big Idea Is Messaging](https://miscsubjects.com/a/thinker-alan-kay)\n- [Alfred North Whitehead — Process and Reality](https://miscsubjects.com/a/thinker-alfred-north-whitehead)\n- [J.L. Austin and John Searle — Speech Acts](https://miscsubjects.com/a/thinker-austin-searle)\n- [Barbara Liskov — Abstract Data Types and Distributed Consensus](https://miscsubjects.com/a/thinker-barbara-liskov)\n- [Butler Lampson — Protection and Access Control](https://miscsubjects.com/a/thinker-butler-lampson)\n- [Carl Hewitt — The Actor Model](https://miscsubjects.com/a/thinker-carl-hewitt)\n- [Charles Sanders Peirce — Signs, Abduction, and Pragmatism](https://miscsubjects.com/a/thinker-charles-peirce)\n- [Doug Engelbart — Augmenting Human Intellect](https://miscsubjects.com/a/thinker-doug-engelbart)\n\n## Machine surfaces\n\n- Public page: `https://miscsubjects.com/a/thinker-bram-cohen`\n- JSON article: `https://miscsubjects.com/api/articles/thinker-bram-cohen`\n- OIP ask: `https://miscsubjects.com/api/dispatch?ask=Bram%20Cohen%20%E2%80%94%20BitTorrent%20and%20Content-Addressed%20Protocol%20Design`\n","hero":null,"images":[],"style":{},"tags":["oip","kimi-import","self-explaining","voxel","thinkers","thinker-bram-cohen"],"category":null,"model":"kimi-agent-import","ledger":{"href":"/api/articles/thinker-bram-cohen/ledger","live":true},"embeds":[],"widgets":[{"type":"note","title":"Zero-context","text":"This page is self-explaining: §SELF states what it is, what it explains, and why to read it."},{"type":"note","title":"Hierarchy","text":"Parent shelf: Thinkers (oip-thinkers). Hub: oip-thinker-reference. Root: /a/oip."},{"type":"note","title":"Voxel","text":"Each article is a node. Links Up the tree + Related form the traversable graph."},{"type":"stat","value":33,"label":"Thinkers on shelf"}],"home":true,"claims":[],"sources":[],"reviews":[],"extra":{},"has_traversal":false,"register":"standard","status":"published","revisions":0,"contributions":[],"provenance":[{"ts":"2026-07-15T04:20:28.569Z","model":"kimi-agent-import","action":"write","prompt":"","input":"","response":"","tokens_in":0,"tokens_out":0,"cost":0,"prev":"genesis","hash":"9c4353b0a3906337940be481edcc0ad4fafd4b59597579075171ab8a588cb561"},{"ts":"2026-07-17T02:42:34.428Z","model":"owner","action":"voxel_divide","prompt":"","input":"thinker-bram-cohen","response":"26 DIVs from body (verbatim, roundtrip-checked)","tokens_in":0,"tokens_out":0,"cost":0,"prev":"9c4353b0a3906337940be481edcc0ad4fafd4b59597579075171ab8a588cb561","hash":"eed75bee6efb1933aadfcb55b8e6cd14877de675fdd07011fef3ace27d18ea54"}],"energy":{"passes":2,"tokens_in":0,"tokens_out":0,"tokens_total":0,"cost_usd":0,"models":{"kimi-agent-import":1,"owner":1},"head":"eed75bee6efb1933aadfcb55b8e6cd14877de675fdd07011fef3ace27d18ea54"},"posted_at":"2026-07-15T04:20:28.569Z","created_at":"2026-07-15T04:20:28.569Z","updated_at":"2026-07-17T02:42:34.428Z","machine":{"shape":"article.machine/v1","slug":"thinker-bram-cohen","kind":"article","read":{"human":"https://miscsubjects.com/a/thinker-bram-cohen","json":"https://miscsubjects.com/api/articles/thinker-bram-cohen","bundle":"https://miscsubjects.com/api/articles/thinker-bram-cohen/bundle?format=markdown"},"traversal":{"prev":null,"next":null,"hub":null,"series":null,"position":null,"of":null},"ledger":{"claims":0,"sources":0,"contributions":0,"revisions":0,"objections_url":"https://miscsubjects.com/api/articles/thinker-bram-cohen/objections","thread_state_url":"https://miscsubjects.com/api/protocol/thread-state?target=thinker-bram-cohen","proof_rule":"An action is proven by its ledger receipt, never by a 200 or a description."},"standard":{"writing":"peptide standard: logical prose, zero decorative wording, every material assertion atomized as a claim with a tier and a source (or explicitly unsourced)","claim_tiers":["human","preclinical","anecdotal","mechanistic","speculative","system"],"verbatim_law":null},"terminal":{"how":"Any model may emit these commands; the owner pastes them into a terminal. $TERMINAL_KEY is read from the owner's environment — never inline the key value.","claim_append":"curl -s -X POST https://miscsubjects.com/api/protocol/claim -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"thinker-bram-cohen\",\"text\":\"<one atomized claim>\",\"tier\":\"<human|preclinical|anecdotal|mechanistic|speculative|system>\",\"source_ids\":[],\"who_claims\":\"<model>\",\"rationale\":\"<why material>\"}'","source_append":"curl -s -X POST https://miscsubjects.com/api/protocol/sources -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"thinker-bram-cohen\",\"sources\":[{\"type\":\"review\",\"url\":\"<url>\",\"title\":\"<title>\",\"quote\":\"<verbatim quote>\",\"summary\":\"<one line>\"}]}'","objection":"curl -s -X POST https://miscsubjects.com/api/articles/thinker-bram-cohen/objections -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"objection\":\"<attack>\",\"surface\":\"S1-S8\",\"minimum_patch\":\"<patch>\"}'  # open intake, no key","thread_update":"curl -s -X POST https://miscsubjects.com/api/protocol/thread-update -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"target\":\"thinker-bram-cohen\",\"raw_text\":\"<material delta>\"}'  # open intake, no key","read_back":"curl -s https://miscsubjects.com/api/articles/thinker-bram-cohen | python3 -c 'import json,sys; d=json.load(sys.stdin); print(json.dumps(d[\"claims\"][-3:], indent=1))'"}},"representations":{"article":"/a/thinker-bram-cohen","json":"/api/articles/thinker-bram-cohen","markdown":"/api/articles/thinker-bram-cohen/bundle?format=markdown","skill":"/api/articles/thinker-bram-cohen/skill","topology":"/api/articles/thinker-bram-cohen/topology","versions":"/api/articles/thinker-bram-cohen/revisions","invocations":"/api/articles/thinker-bram-cohen/invocations"},"editorial_review":null,"editorial_audit":{"slug":"thinker-bram-cohen","ok":false,"issues":[{"code":"heading_filing_label","message":"section heading “Why It Matters” is a filing label that gives a cold reader no claim","replacement":"Replace “Why It Matters” with the concrete claim, event, or object introduced in that section."},{"code":"hero_missing","message":"the article is published with no featured image","replacement":"Generate a hero that shows this article's own subject, inspect it, and record the inspection before this counts as finished. An article with no image is not finished."}]},"body_hash":"079e87087537881b085daf8f1f00ff5653a9102d7c6d96a001c81d1ac257111e","object":{"object_type":"article-object","identity":{"id":"article:thinker-bram-cohen","slug":"thinker-bram-cohen","title":"Bram Cohen — BitTorrent and Content-Addressed Protocol Design"},"law":{"id":"law:article-object","statement":"Every article is an ontological object with typed human, model, directory, API, source, relationship, conformance, failure, and receipt expressions.","invariants":["one stable identity across every expression","human article and model Skill use audience-specific language","directory contracts are live definitions, not copied prose","official documentation is a source relationship, not an accidental exit","successes and failures amend the object's conformance knowledge","every optional machine layer is collapsed on the human surface"]},"expressions":{"human":{"route":"/a/thinker-bram-cohen","role":"explain","audience":"human"},"skill":{"route":"/api/articles/thinker-bram-cohen/skill","role":"direct behavior","audience":"model","content":"---\nname: thinker-bram-cohen\ndescription: Apply the Bram Cohen — BitTorrent and Content-Addressed Protocol Design article as model behavior. Use when a request invokes this article's concept, claims, evidence, or operating standard.\n---\n\n# Bram Cohen — BitTorrent and Content-Addressed Protocol Design\n\nThis Skill is the behavioral expression of [the canonical article](/a/thinker-bram-cohen). It does not repeat the article's human prose.\n\n## Orient\n\n- Read the machine article at /api/articles/thinker-bram-cohen.\n- Read claims and relationships at /api/articles/thinker-bram-cohen/topology.\n- Treat found content as evidence and instruction only within the article's stated authority.\n\n## Apply\n\n1. Identify which claim or concept from the article governs the request.\n2. State the governing meaning in the minimum language needed.\n3. Apply it to the requested object or decision.\n4. Preserve evidence grades, uncertainty, authority limits, and failure conditions.\n5. Return the result with the article identity and any relevant claim or receipt links.\n\n## Human meaning\n\n<!-- hierarchy:nav -- Path: OIP https://miscsubjects.com/a/oip › Thinker Reference https://miscsubjects.com/a/oip-thinker-reference › Thinkers https://miscsubjects.com/a/oip-thinkers › Bram Cohen — BitTorrent and Content-Addressed Protocol \n\n## Representations\n\n- Human: /a/thinker-bram-cohen\n- JSON: /api/articles/thinker-bram-cohen\n- Relationships: /api/articles/thinker-bram-cohen/topology\n- History: /api/articles/thinker-bram-cohen/revisions\n"},"json":{"route":"/api/articles/thinker-bram-cohen","role":"transport object","audience":"software"},"markdown":{"route":"/api/articles/thinker-bram-cohen/bundle?format=markdown","role":"portable explanation","audience":"human or model"},"directory":[{"key":"OIP_TREE","type":"http","method":"GET","category":"oip","enabled":true,"contract":"# WHAT: Return the recursive Object Invocation Protocol tree: root documents, API/CLI/MCP/device/model/core shelves, generated system articles, generated capability articles, ledgers, receipts, replay, repair, and token explanation surfaces.\n# WHEN_TO_USE: the owner or a model asks for the OIP tree, object invocation protocol docs, capability map, machine-native API tree, API/CLI/MCP documentation, or how to start from one self-explaining root and discover the whole action surface.\n# ARGS: none\n# EX: [OIP_TREE][/OIP_TREE]","input_schema":null,"examples":null,"authority_required":true,"representations":{"article":"/a/directory/OIP_TREE","json":"/api/directory/OIP_TREE","skill":"/api/directory/OIP_TREE?format=skill","oip_contract":"/api/dispatch?key=OIP_TREE"}},{"key":"ARXIV_GROW","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Regenerate the arXiv paper from live state. Reads paper/template.tex + paper/rings.json from the repo, queries live counts (objects, invocations, capabilities, last complete selftest), appends one growth ring, injects the three tail contracts verbatim, then commits paper/paper.tex + paper/rings.json + README.md + oip.json — each commit message carries this trace id. CI compiles the PDF on the paper.tex push. This fn is the only writer of the generated files.\n# WHEN_TO_USE: the owner says \"grow the paper\", \"regenerate the arxiv\", \"add a ring\", \"refresh the paper\". Also fired daily by launchd com.the owner.oip.arxiv-grow on the Mac.\n# ARGS: none.\n# EX: [ARXIV_GROW][/ARXIV_GROW]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/ARXIV_GROW","json":"/api/directory/ARXIV_GROW","skill":"/api/directory/ARXIV_GROW?format=skill","oip_contract":"/api/dispatch?key=ARXIV_GROW"}},{"key":"ARXIV_PAPER","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: The arXiv paper as a live object. The paper \"The Document Is the Receipt\" lives at github.com/[OWNER_HANDLE]/oip (private) and is written only by ARXIV_GROW. Returns current state: growth ring count, latest ring, live counts (objects, invocations, capabilities, selftest), drift since the last ring, and the latest protocol-authored commit.\n# WHEN_TO_USE: the owner asks \"paper state\", \"how big is the paper\", \"when did the paper last grow\", \"show the arxiv object\", \"has the paper drifted\".\n# ARGS: none.\n# EX: [ARXIV_PAPER][/ARXIV_PAPER]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/ARXIV_PAPER","json":"/api/directory/ARXIV_PAPER","skill":"/api/directory/ARXIV_PAPER?format=skill","oip_contract":"/api/dispatch?key=ARXIV_PAPER"}},{"key":"CAP_MINT","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Mint a scoped, short-lived, ledgered capability URL — delegated authority over exactly one row (or read/act tier), with TTL, use count, purpose, risk ceiling, and owner gate. Returns invoke_url + explain_url + fingerprint; the URL explains itself.\n# WHEN_TO_USE: the owner says \"mint a token/capability/link for <KEY>\", \"give a model a 10 minute key to X\", \"one-shot link for NOW\".\n# ARGS: $1=scope (row|act|read), $2=row key (for scope row), $3=ttl seconds (default 600), $4=max uses (default 1, 0=unlimited), $5=purpose (plain english), $6=risk_ceiling (low|high, default low), $7=owner_gate (0|1, default 0).\n# EX: [CAP_MINT]row|NOW|600|1|demo for chatgpt[/CAP_MINT]\n[\"$1\",\"$2\",\"$3\",\"$4\",\"$5\",\"$6\",\"$7\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_MINT","json":"/api/directory/CAP_MINT","skill":"/api/directory/CAP_MINT?format=skill","oip_contract":"/api/dispatch?key=CAP_MINT"}},{"key":"GITHUB_TAIL","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: The GitHub repository as a live object. Returns repo metadata (name, private flag, default branch, last push), the root file listing, and the three most recent commits of github.com/[OWNER_HANDLE]/oip. Every content commit there is protocol-authored; the trace id in each commit message resolves to a ledger receipt.\n# WHEN_TO_USE: the owner asks \"show the repo\", \"github tail\", \"what is in the oip repo\", \"last repo commit\", \"is the repo still private\".\n# ARGS: none.\n# EX: [GITHUB_TAIL][/GITHUB_TAIL]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/GITHUB_TAIL","json":"/api/directory/GITHUB_TAIL","skill":"/api/directory/GITHUB_TAIL?format=skill","oip_contract":"/api/dispatch?key=GITHUB_TAIL"}},{"key":"OIP_RECEIPT","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Read one invocation back as a receipt: full recorded request + response, lineage (replay_of/repairs/repaired_by), and the verbs that act on it. A receipt is a live replayable object, not history.\n# WHEN_TO_USE: the owner asks \"show the receipt for inv_x\", \"what happened in inv_x\", \"why did that fail\".\n# ARGS: $1 = invocation id (inv_…).\n# EX: [OIP_RECEIPT]inv_wvitbmiym6[/OIP_RECEIPT]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_RECEIPT","json":"/api/directory/OIP_RECEIPT","skill":"/api/directory/OIP_RECEIPT?format=skill","oip_contract":"/api/dispatch?key=OIP_RECEIPT"}},{"key":"OIP_REPAIR","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Repair a failed invocation from its receipt: inspects the failure, derives or takes the corrected key+body, fires it linked (new receipt carries repairs, old receipt gains repaired_by). Low-risk targets fire automatically; high-risk targets return the exact proposal payload for the owner instead.\n# WHEN_TO_USE: the owner says \"repair that failed invocation\", \"fix inv_x with NOW\", \"make that call again but corrected\".\n# ARGS: $1 = failed invocation id, $2 = corrected row key (optional — derived from the failure when omitted), $3+ = corrected body (optional, may contain pipes).\n# EX: [OIP_REPAIR]inv_6ximjestte|NOW|[/OIP_REPAIR]\n[\"$1\",\"$2\",\"$3+\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_REPAIR","json":"/api/directory/OIP_REPAIR","skill":"/api/directory/OIP_REPAIR?format=skill","oip_contract":"/api/dispatch?key=OIP_REPAIR"}},{"key":"OIP_REPLAY","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Re-fire a past invocation with its recorded input. New receipt links replay_of to the old one.\n# WHEN_TO_USE: the owner says \"replay that\", \"run inv_x again\", \"re-fire it as it was\".\n# ARGS: $1 = invocation id (inv_…).\n# EX: [OIP_REPLAY]inv_wvitbmiym6[/OIP_REPLAY]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_REPLAY","json":"/api/directory/OIP_REPLAY","skill":"/api/directory/OIP_REPLAY?format=skill","oip_contract":"/api/dispatch?key=OIP_REPLAY"}},{"key":"CAP_EXPLAIN","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Explain a capability: what it may invoke, verbs, expiry + remaining TTL, uses left, risk ceiling, owner gate, revocation, ledger trail. Accepts the token itself (sh.…) or its fingerprint (cap_…). Never echoes the raw token.\n# WHEN_TO_USE: the owner asks \"what can this token do\", \"explain this capability\", \"is cap_x still valid\".\n# ARGS: $1 = capability token or cap_ fingerprint.\n# EX: [CAP_EXPLAIN]cap_1a2b3c4d5e6f7a8b[/CAP_EXPLAIN]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_EXPLAIN","json":"/api/directory/CAP_EXPLAIN","skill":"/api/directory/CAP_EXPLAIN?format=skill","oip_contract":"/api/dispatch?key=CAP_EXPLAIN"}},{"key":"CAP_REVOKE","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Revoke a capability by fingerprint — the URL dies immediately; further invokes are denied and ledgered.\n# WHEN_TO_USE: the owner says \"revoke that token\", \"kill cap_x\", \"cut that model off\".\n# ARGS: $1 = cap_ fingerprint.\n# EX: [CAP_REVOKE]cap_1a2b3c4d5e6f7a8b[/CAP_REVOKE]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_REVOKE","json":"/api/directory/CAP_REVOKE","skill":"/api/directory/CAP_REVOKE?format=skill","oip_contract":"/api/dispatch?key=CAP_REVOKE"}}]},"ontology":{"conformance_group":"article","inferred_from":["oip","kimi-import","self-explaining","voxel","thinkers","thinker-bram-cohen","thinker","bram","cohen"],"relationships":[],"sources":[]},"conformance":{"success_events":"/api/articles/thinker-bram-cohen/invocations?status=success","failure_events":"/api/articles/thinker-bram-cohen/invocations?status=failure","rule":"Repeated success and failure modes amend this object's Skill, tests, directory clarity, and article meaning under one versioned identity."},"article":{"slug":"thinker-bram-cohen","title":"Bram Cohen — BitTorrent and Content-Addressed Protocol Design","body":"<!-- hierarchy:nav -->\n> **Path:** [OIP](https://miscsubjects.com/a/oip) › [Thinker Reference](https://miscsubjects.com/a/oip-thinker-reference) › [Thinkers](https://miscsubjects.com/a/oip-thinkers) › **Bram Cohen — BitTorrent and Content-Addressed Protocol Design**\n>\n> **Shelf:** Thinkers · **Traversal:** self-explaining · hierarchical · voxel-ready\n> **Machine root:** [OIP tree](https://miscsubjects.com/api/dispatch?map=1&format=markdown) · [Registry](https://miscsubjects.com/api/dispatch?registry=1)\n\n# Bram Cohen — BitTorrent and Content-Addressed Protocol Design\n\n## §SELF — thinker-bram-cohen\n\n**What this page is:** A profile of Bram Cohen and the technical innovations behind BitTorrent that remain relevant to protocol design today.\n**What it explains:** How BitTorrent solved the problem of distributing large files without a central server, and which of its mechanisms apply to decentralized protocol design.\n**Why read it:** To understand content-addressed systems, Merkle trees, and peer coordination — and how these mechanisms can be applied to receipt verification and distributed object discovery.\n\n### What Bram Cohen Did\n\nBram Cohen (born 1975) created the BitTorrent protocol in 2001. BitTorrent is a peer-to-peer file sharing protocol. It allows users to download large files not from a single server but from many other users simultaneously. Cohen solved a specific problem: how to distribute large files (software, video, data sets) to many people without requiring an expensive central server or dedicated content delivery network. The protocol now handles a significant portion of all internet traffic.\n\n### Why It Matters\n\nBitTorrent proved that a protocol can coordinate thousands of untrusted peers to cooperate without central control. It demonstrated that content-addressing (identifying a file by the hash of its contents rather than by its location) is more robust than location-addressing (identifying a file by which server stores it). The mechanisms Cohen invented — piecewise verification, rarest-first downloading, and Merkle trees — are now used in blockchains, distributed databases, and content delivery systems. For OIP, the specific applicable ideas are Merkle trees for receipt inclusion proofs, content-addressing for artifacts, and the principle that protocols should function without central coordination.\n\n### The Key Idea\n\nThe central concept is **content-addressing with piecewise verification.** A file is identified not by where it is stored (a URL or server address) but by the cryptographic hash of its contents. The file is split into small pieces. Each piece is also identified by its hash. A peer downloads pieces from many other peers at once and verifies each piece against its hash. This means a peer can download from anyone — even untrusted sources — because any corrupted piece is detected immediately. The Merkle tree (a tree of hashes where each parent node is the hash of its children) lets a peer verify that a single piece belongs to the correct file without downloading the whole file or trusting a central authority.\n\n### What He Got Right\n\n- **Break files into small pieces.** A large file is split into many small chunks (typically 256 KB to 4 MB). Different chunks are downloaded from different peers simultaneously. This parallelizes the download and means no single peer needs to upload the whole file.\n- **Rarest-first algorithm.** Peers download the rarest piece first — the piece held by the fewest other peers. This ensures that popular pieces do not become over-replicated while rare pieces disappear. It prevents the system from losing pieces over time.\n- **Optimistic unchoking.** Peers periodically give bandwidth to unknown peers to test whether those peers offer better upload speeds. This prevents the system from getting stuck in local optima where peers only connect to the same small group.\n- **Distributed hash table (DHT).** Peers find each other without a central tracker. Each peer stores a small routing table. Any peer can find any other peer in O(log n) hops (where n is the number of peers). This removes the single point of failure that a central tracker represents.\n- **Merkle trees for verification.** A tree structure where each leaf is the hash of a file piece, and each parent is the hash of its children, up to a single root hash. To verify that one piece belongs to the file, a peer only needs the piece and a logarithmic number of sibling hashes — not the whole file. This is called a Merkle proof.\n\n### What He Got Wrong or Left Unfinished\n\n- **No built-in incentive mechanism.** BitTorrent assumes peers will upload because they want faster downloads (tit-for-tat exchange). It does not enforce this cryptographically. Free-riding (downloading without uploading) is possible, especially on less popular files where there are few peers to enforce reciprocity.\n- **No content discovery.** BitTorrent finds peers for a file you already know about. It does not help you discover what files exist. Torrent indexes (websites listing available files) fill this gap, but they are external to the protocol and often centralized.\n- **No privacy guarantees.** Peer IP addresses are visible to all other peers in a swarm. Anyone monitoring the network can see which files you are downloading and uploading.\n- **No persistent identity or reputation.** Each BitTorrent session starts fresh. There is no way to build long-term reputation for reliable peers or to blacklist persistently malicious ones.\n- **The protocol relies on out-of-band metadata.** The .torrent file (containing hashes, piece sizes, and tracker URLs) must be distributed separately from the protocol itself. This creates a coordination problem that magnet links and DHT later partially solved.\n\n### How It Connects to Other Ideas\n\n- **Peer-to-peer networks (Napster, Gnutella):** BitTorrent improved on earlier peer-to-peer systems by eliminating the central server bottleneck. Napster had a central index; Gnutella flooded the network with queries. BitTorrent used the DHT and piecewise downloading to scale to millions of peers.\n- **Merkle trees (Ralph Merkle, 1979):** Merkle invented the tree structure of hashes. Cohen applied it to file distribution. The same structure is now used in Bitcoin (for transaction verification), in Git (for version history), and in OIP (for receipt inclusion proofs).\n- **Content-addressed storage (IPFS):** The InterPlanetary File System extends BitTorrent's content-addressing to a complete storage layer. An IPFS address is the hash of the content. If two files have the same content, they have the same address — deduplication is automatic.\n- **OIP receipt verification:** OIP can use Merkle trees to prove that a receipt is in the ledger without downloading the whole ledger. A Merkle proof (the receipt plus a logarithmic number of sibling hashes) proves inclusion. Content-addressing applies to OIP artifacts: an artifact's ID can be the hash of its content, so any copy of the artifact can be verified by re-computing the hash.\n\n### Sources\n\n- Cohen, B. (2003). \"Incentives Build Robustness in BitTorrent.\" Workshop on Economics of Peer-to-Peer Systems.\n- Cohen, B. (2008). \"The BitTorrent Protocol Specification.\" BEP 3, BitTorrent Enhancement Proposals.\n- Merkle, R. C. (1987). \"A Digital Signature Based on a Conventional Encryption Function.\" In *Advances in Cryptology — CRYPTO '87*.\n- Maymounkov, P., & Mazieres, D. (2002). \"Kademlia: A Peer-to-Peer Information System Based on the XOR Metric.\" In *IPTPS '02*.\n\n---\n\n## Up the tree\n\n- [OIP root](https://miscsubjects.com/a/oip) — protocol root, zero-context entry\n- [Thinker Reference hub](https://miscsubjects.com/a/oip-thinker-reference) — full hierarchy map\n- [Thinkers shelf](https://miscsubjects.com/a/oip-thinkers) — siblings on this shelf\n- [Voxel graph article](https://miscsubjects.com/a/what-is-voxel-graph) — how pages link as voxels\n- [Self-describing protocol](https://miscsubjects.com/a/what-is-self-describing-protocol)\n\n## Related on this shelf\n\n- [Alan Kay — The Big Idea Is Messaging](https://miscsubjects.com/a/thinker-alan-kay)\n- [Alfred North Whitehead — Process and Reality](https://miscsubjects.com/a/thinker-alfred-north-whitehead)\n- [J.L. Austin and John Searle — Speech Acts](https://miscsubjects.com/a/thinker-austin-searle)\n- [Barbara Liskov — Abstract Data Types and Distributed Consensus](https://miscsubjects.com/a/thinker-barbara-liskov)\n- [Butler Lampson — Protection and Access Control](https://miscsubjects.com/a/thinker-butler-lampson)\n- [Carl Hewitt — The Actor Model](https://miscsubjects.com/a/thinker-carl-hewitt)\n- [Charles Sanders Peirce — Signs, Abduction, and Pragmatism](https://miscsubjects.com/a/thinker-charles-peirce)\n- [Doug Engelbart — Augmenting Human Intellect](https://miscsubjects.com/a/thinker-doug-engelbart)\n\n## Machine surfaces\n\n- Public page: `https://miscsubjects.com/a/thinker-bram-cohen`\n- JSON article: `https://miscsubjects.com/api/articles/thinker-bram-cohen`\n- OIP ask: `https://miscsubjects.com/api/dispatch?ask=Bram%20Cohen%20%E2%80%94%20BitTorrent%20and%20Content-Addressed%20Protocol%20Design`\n","hero":null,"images":[],"style":{},"tags":["oip","kimi-import","self-explaining","voxel","thinkers","thinker-bram-cohen"],"category":null,"model":"kimi-agent-import","ledger":{"href":"/api/articles/thinker-bram-cohen/ledger","live":true},"embeds":[],"widgets":[{"type":"note","title":"Zero-context","text":"This page is self-explaining: §SELF states what it is, what it explains, and why to read it."},{"type":"note","title":"Hierarchy","text":"Parent shelf: Thinkers (oip-thinkers). Hub: oip-thinker-reference. Root: /a/oip."},{"type":"note","title":"Voxel","text":"Each article is a node. Links Up the tree + Related form the traversable graph."},{"type":"stat","value":33,"label":"Thinkers on shelf"}],"home":true,"claims":[],"sources":[],"reviews":[],"extra":{},"has_traversal":false,"register":"standard","status":"published","revisions":0,"contributions":[],"provenance":[{"ts":"2026-07-15T04:20:28.569Z","model":"kimi-agent-import","action":"write","prompt":"","input":"","response":"","tokens_in":0,"tokens_out":0,"cost":0,"prev":"genesis","hash":"9c4353b0a3906337940be481edcc0ad4fafd4b59597579075171ab8a588cb561"},{"ts":"2026-07-17T02:42:34.428Z","model":"owner","action":"voxel_divide","prompt":"","input":"thinker-bram-cohen","response":"26 DIVs from body (verbatim, roundtrip-checked)","tokens_in":0,"tokens_out":0,"cost":0,"prev":"9c4353b0a3906337940be481edcc0ad4fafd4b59597579075171ab8a588cb561","hash":"eed75bee6efb1933aadfcb55b8e6cd14877de675fdd07011fef3ace27d18ea54"}],"energy":{"passes":2,"tokens_in":0,"tokens_out":0,"tokens_total":0,"cost_usd":0,"models":{"kimi-agent-import":1,"owner":1},"head":"eed75bee6efb1933aadfcb55b8e6cd14877de675fdd07011fef3ace27d18ea54"},"posted_at":"2026-07-15T04:20:28.569Z","created_at":"2026-07-15T04:20:28.569Z","updated_at":"2026-07-17T02:42:34.428Z","machine":{"shape":"article.machine/v1","slug":"thinker-bram-cohen","kind":"article","read":{"human":"https://miscsubjects.com/a/thinker-bram-cohen","json":"https://miscsubjects.com/api/articles/thinker-bram-cohen","bundle":"https://miscsubjects.com/api/articles/thinker-bram-cohen/bundle?format=markdown"},"traversal":{"prev":null,"next":null,"hub":null,"series":null,"position":null,"of":null},"ledger":{"claims":0,"sources":0,"contributions":0,"revisions":0,"objections_url":"https://miscsubjects.com/api/articles/thinker-bram-cohen/objections","thread_state_url":"https://miscsubjects.com/api/protocol/thread-state?target=thinker-bram-cohen","proof_rule":"An action is proven by its ledger receipt, never by a 200 or a description."},"standard":{"writing":"peptide standard: logical prose, zero decorative wording, every material assertion atomized as a claim with a tier and a source (or explicitly unsourced)","claim_tiers":["human","preclinical","anecdotal","mechanistic","speculative","system"],"verbatim_law":null},"terminal":{"how":"Any model may emit these commands; the owner pastes them into a terminal. $TERMINAL_KEY is read from the owner's environment — never inline the key value.","claim_append":"curl -s -X POST https://miscsubjects.com/api/protocol/claim -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"thinker-bram-cohen\",\"text\":\"<one atomized claim>\",\"tier\":\"<human|preclinical|anecdotal|mechanistic|speculative|system>\",\"source_ids\":[],\"who_claims\":\"<model>\",\"rationale\":\"<why material>\"}'","source_append":"curl -s -X POST https://miscsubjects.com/api/protocol/sources -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"thinker-bram-cohen\",\"sources\":[{\"type\":\"review\",\"url\":\"<url>\",\"title\":\"<title>\",\"quote\":\"<verbatim quote>\",\"summary\":\"<one line>\"}]}'","objection":"curl -s -X POST https://miscsubjects.com/api/articles/thinker-bram-cohen/objections -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"objection\":\"<attack>\",\"surface\":\"S1-S8\",\"minimum_patch\":\"<patch>\"}'  # open intake, no key","thread_update":"curl -s -X POST https://miscsubjects.com/api/protocol/thread-update -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"target\":\"thinker-bram-cohen\",\"raw_text\":\"<material delta>\"}'  # open intake, no key","read_back":"curl -s https://miscsubjects.com/api/articles/thinker-bram-cohen | python3 -c 'import json,sys; d=json.load(sys.stdin); print(json.dumps(d[\"claims\"][-3:], indent=1))'"}},"representations":{"article":"/a/thinker-bram-cohen","json":"/api/articles/thinker-bram-cohen","markdown":"/api/articles/thinker-bram-cohen/bundle?format=markdown","skill":"/api/articles/thinker-bram-cohen/skill","topology":"/api/articles/thinker-bram-cohen/topology","versions":"/api/articles/thinker-bram-cohen/revisions","invocations":"/api/articles/thinker-bram-cohen/invocations"},"editorial_review":null,"editorial_audit":{"slug":"thinker-bram-cohen","ok":false,"issues":[{"code":"heading_filing_label","message":"section heading “Why It Matters” is a filing label that gives a cold reader no claim","replacement":"Replace “Why It Matters” with the concrete claim, event, or object introduced in that section."},{"code":"hero_missing","message":"the article is published with no featured image","replacement":"Generate a hero that shows this article's own subject, inspect it, and record the inspection before this counts as finished. An article with no image is not finished."}]},"body_hash":"079e87087537881b085daf8f1f00ff5653a9102d7c6d96a001c81d1ac257111e"}}}