p2p

BitTorrent Swarm Protocol Efficiency Simulator

v1.2.0
⚙ Protocol Configuration
Piece Scheduling Algorithm
Unchoke Policy
Seeders Count 2
Leechers Count 8
Free-Riders (0 Upload Cap) 2
Optimistic Unchoke Interval 10s
📊 Dynamic Presets
Cycle: 0 | Choke Phase: 10s
Seeder
Leecher (Active)
Choked Peer
Optimistic Peer
Fixed Speed Fixture
112.5 Mbps
Fixed Time Fixture
14.2s
Fixed Choke-Rate Fixture
92.0%
Fixed Boost Fixture
+38.4%
Swarm State: Rarest-First Tit-for-Tat Active | Fixture Score (speed / 120): 94.8%
🧩 Piece Availability Heatmap (16 Pieces)
🔍 Selected Peer Bitfield
leecher_1 Leecher (75% Complete)
Upload: 30 Mbps | Download: 45 Mbps
📜 Protocol Log Feed
[0.0s] Swarm initialized with 2 seeders and 8 leechers.
[0.0s] Choke cycle #1: Seeders unchoked top 4 fastest peers.

Watch the piece state, question the fixed score

Does changing the strategy measure a performance improvement?

The performance panel selects fixed fixture numbers from the strategy labels. It does not derive speed, completion time, choke percentage or boost from the animated transfers. Bitfield counts reflect the modeled piece state instead.

Piece transfers are probabilistic and initial leecher pieces are randomized. Capacity ranking uses authored upload-capacity values rather than observed contributions to a particular peer. The legacy configuration keys remain in exported reports, with accurate definitions.

Try a worked example

Rarest-First plus Capacity-Ranked Allocation displays 112.5 Mbps, 14.2 seconds, 92% and +38.4%. Switching to Random Allocation selects 85.0 Mbps and 15% while retaining 14.2 seconds and +38.4%. Those changes come from a lookup rule, not a timed comparison.

The protocol supplies the concepts

BEP 3 distinguishes choke and interest state and describes piece requests, bitfields and hash-verified announcements. This model updates Boolean piece flags and animated particles; it exchanges no real file bytes, verifies no piece hashes and connects to no swarm. BEP 3: BitTorrent Protocol Specification

The two alternatives are random

Random Piece samples a missing piece held by the sender. Random Allocation shuffles candidates, rather than visiting them in round-robin order. Capacity-Ranked Allocation prioritizes uploadCapacity, not a record of useful downloads supplied to this peer. None of the displayed fixture scores establishes which policy performs better.

Inspect changes without confounding them

Pause, step and inspect piece counts or the availability heatmap. Changing population sliders initializes a new swarm; separate runs therefore differ in starting pieces as well as configuration. Export includes current node counts and fixed metric definitions. A real efficiency claim would require measured transfers under comparable conditions.

Sources and further reading
Super generates helpful tools and automates fact-checking across the internet proactively. If you enjoyed this tool, build your own with Super and share it with a friend.