Arpit’s Newsletter

Arpit’s Newsletter

Home
Career Growth
System Design
Deep Dives
Papers and Musings
Outage Dissections
About

Deep Dives

Exploiting and stealing from the BitTorrent network
P2P networks are prone to exploitation as there is no central authority to keep track of the activity.
 • 
Arpit Bhayani
Kademlia - a Distributed Hash Table implementation to power the overlay network of BitTorrent
Kademlia is a P2P Distributed Hash Table implementation that distributes the KV stores across nodes in a network and retrieves them without any central…
 • 
Arpit Bhayani
The Piece Selection algorithm that makes BitTorrent fault tolerant
In a BitTorrent network, the file is split into pieces and then distributed across the network.
 • 
Arpit Bhayani
The Choke Algorithm that powers BitTorrent
In a P2P network, every peer would want to download the file as fast as possible but this would lead to a skewed load on some peers.
 • 
Arpit Bhayani
1
Overview of the BitTorrent architecture
The BitTorrent Architecture BitTorrent architecture consists of the following entities
 • 
Arpit Bhayani
Understanding the Torrent File Format and Bencoding
A torrent file is an independent session of transfer.
 • 
Arpit Bhayani
Introduction to BitTorrent and the problem it beautifully solves
BitTorrent is a peer-to-peer protocol that makes the distribution of large files easier, faster, and more efficient.
 • 
Arpit Bhayani
Implementing Hash Maps with Hash Tables
A map, when implemented with Hash Tables, is called a Hash Map; and just like a regular map it supports operations like put, get, and iterate.
 • 
Arpit Bhayani
Implementing Hash Sets with Hash Tables
The set data structure, when implemented with Hash Tables, is called a Hash Set; and just like a regular set, it supports operations like Union…
 • 
Arpit Bhayani
Implementing Resize of a Hash Table
Resizing a Hash Table is important to maintain consistent performance and efficiency, but how do we actually implement it?
 • 
Arpit Bhayani
Why are Hash Tables always doubled?
To maintain consistent performance, the hash table has to be resized - be it growing or shrinking.
 • 
Arpit Bhayani
Getting the best performance from the Hash Table
Hash Tables are designed to give a constant time performance and to do this, it needs to have many slots available.
 • 
Arpit Bhayani
© 2025 Arpit Bhayani
Privacy ∙ Terms ∙ Collection notice
Start writingGet the app
Substack is the home for great culture