Thanks to visit codestin.com
Credit goes to pratikpandey.substack.com

Distributed Systems Made Easy!

Distributed Systems Made Easy!

Home
Notes
Chat
Archive
Leaderboard
About
Most Popular
View all
Merkle Trees: The Data Structure for Verifiable State
 • Pratik Pandey
Merkle Trees in Practice: A Deep Dive into Implementation and Optimisation
 • Pratik Pandey
Quad Tree: The Secret Behind Sub-Millisecond Location Searches
 • Pratik Pandey
Build Distributed Systems: Cache to Distributed Cache
 • Pratik Pandey
Get Notified of New Articles:
Dive Deep Series: Sync.Map in Golang
We deconstruct Go's sync.Map to reveal its two-map, lock-free design, explaining its performance optimisations for read-heavy workloads, its key design…
 • Pratik Pandey
Quad Tree: The Secret Behind Sub-Millisecond Location Searches
QuadTree solves the spatial search problem by applying the "divide and conquer" principle to 2D space. QuadTree recursively subdivides 2D space into…
 • Pratik Pandey
Merkle Trees in Practice: A Deep Dive into Implementation and Optimisation
In our last post, we discussed about how you can compare two large datasets for integrity using Merkle trees.
 • Pratik Pandey
Merkle Trees: The Data Structure for Verifiable State
A Merkle Tree is a binary tree of cryptographic hashes, constructed from the bottom up to efficiently verify data integrity.
 • Pratik Pandey
Beating Tail Latency: How Golang Supercharges SwissTables with Extendible Hashing
Extendible hashing is a dynamic hashing technique that allows the hash table to grow and shrink gracefully as data is added or removed, without…
 • Pratik Pandey
SwissTables: High Performance HashMaps
Understand how SwissTables provide a major performance improvement using its innovative control word metadata and SIMD-powered lookups.
 • Pratik Pandey
Fragile Base Class Problem: Composition over Inheritance
Why do we always hear "Composition Over Inheritance"? Let's discover some hidden pitfalls associated with Inheritance and why you should prefer a HAS-A…
 • Pratik Pandey
Database Intermediate Series: Change Data Capture(II)
Change Data Capture (CDC) refers to identifying and capturing changes made to data in a database and then delivering these changes in a format that…
 • Pratik Pandey
Database Intermediate Series: Change Data Capture(I)
Change Data Capture (CDC) refers to identifying and capturing changes made to data in a database and then delivering these changes in a format that…
 • Pratik Pandey
Distributed Systems Made Easy!
Distributed Systems Made Easy!
Your guide to building distributed systems concepts. Follow if you want to ingest complex distributed systems concepts in an easy manner and build distributed systems from scratch!
Recommendations
View all 25
AI Supremacy
AI Supremacy
Michael Spencer
Confessions of a Code Addict
Confessions of a Code Addict
Abhinav Upadhyay
Engineering At Scale
Engineering At Scale
Animesh Gaitonde
Big Technology
Big Technology
Alex Kantrowitz
High Growth Engineer
High Growth Engineer
Jordan Cutler
Top posts
Merkle Trees: The Data Structure for Verifiable State
 • Pratik Pandey
Merkle Trees in Practice: A Deep Dive into Implementation and Optimisation
 • Pratik Pandey
Quad Tree: The Secret Behind Sub-Millisecond Location Searches
 • Pratik Pandey
Build Distributed Systems: Cache to Distributed Cache
 • Pratik Pandey
SwissTables: High Performance HashMaps
 • Pratik Pandey
© 2026 Pratik Pandey · Privacy ∙ Terms ∙ Collection notice
Codestin Search App Start your SubstackGet the app
Substack is the home for great culture