# Bram Cohen

> 1975– · Programmer, Creator of BitTorrent
>
> **Recorded contribution:** BitTorrent protocol; peer-to-peer file sharing revolution

## How to use this dossier

Read for a causal chain, not a hero story: inherited problem → contribution → mechanism → downstream capability → limit. Then close the page and complete the reconstruction exercise from memory.

## 1. Historical orientation

Programmer Bram Cohen designed BitTorrent in 2001 to distribute large files without making one server supply every recipient. The protocol decomposes files into verifiable pieces and turns downloaders into uploaders, coordinating a swarm whose aggregate capacity can grow with demand. Cohen later worked on other peer-to-peer and cryptocurrency projects.

## 2. The problem inherited

Popular large downloads overwhelmed origin servers because every recipient consumed another full copy of scarce outbound bandwidth.

## 3. The central contribution

Cohen created BitTorrent's peer-to-peer swarming protocol, combining piece exchange, integrity checks, and incentive-aware peer selection.

## 4. Reconstruct the mechanism

1. Describe a file as fixed-size pieces with cryptographic hashes in metadata.
2. Discover peers that want the same content and learn which pieces each holds.
3. Request rare or useful pieces in parallel and verify them on arrival.
4. Upload completed pieces to peers, using choking and unchoking policies to allocate capacity.

## 5. What changed downstream

- BitTorrent made distribution capacity grow with a popular swarm and influenced content delivery and peer-to-peer protocol design.
- It became a major case study in protocol incentives, decentralized coordination, and the legal distinction between a tool and its uses.

## 6. Attribution, limits, and uncertainty

- BitTorrent does not make content anonymous, lawful, available, or authentic beyond matching the referenced hashes.
- The ecosystem includes client authors, tracker and DHT contributors, seeders, and standards writers; Cohen's original protocol evolved collectively.

## 7. Reconstruction lab

Split a local file into eight hashed pieces and simulate four peers with different subsets. Devise a rarest-first schedule, corrupt one piece, and show how the swarm detects and repairs it. Compare sequential downloading with rarest-first after one peer disconnects, and measure whether the remaining swarm can still complete. Add a peer that accepts uploads but never reciprocates; observe how choking and optimistic unchoking affect it. Distinguish integrity from authenticity: a piece hash detects accidental or adversarial corruption relative to trusted metadata, but does not prove that the original torrent describes lawful, safe, or truthful content. Measure duplicate piece requests near completion and explain the endgame strategy. Your final protocol diagram should separate peer discovery, piece selection, verification, incentives, and application-level trust.

## 8. Evidence trail

- [The BitTorrent Protocol Specification](https://www.bittorrent.org/beps/bep_0003.html) — BitTorrent Enhancement Proposals
- [Bram Cohen](https://en.wikipedia.org/wiki/Bram_Cohen) — Wikipedia contributors
- [Incentives Build Robustness in BitTorrent](https://www.bittorrent.org/bittorrentecon.pdf) — BitTorrent

---

*Research checked 2026-08-09. Dates, roles, and claims about living people are historical snapshots. Linked sources remain the authority; this dossier is original instructional synthesis.*