Mar 12 · 8 min read · Before I started building auth into my own projects, I didn't think too deeply about what was happening to passwords behind the scenes. Like most developers, I installed a library, called a hash funct
Join discussion
Mar 9 · 12 min read · TLDR: A hash table gives you near-O(1) lookups, inserts, and deletes by using a hash function to map keys to array indices. The tradeoff: collisions (when two keys hash to the same slot) must be handled, and a full hash table must be resized. 📖 Th...
Join discussionMar 9 · 21 min read · TLDR TLDR: A URL Shortener maps long URLs to short IDs. The core challenge is generating a globally unique, short, collision-free ID at scale. We use Base62 encoding on auto-incrementing database IDs for deterministic, collision-free short codes. ...
Join discussionMar 9 · 14 min read · TLDR: Standard hashing (key % N) breaks when $N$ changes — adding or removing a server reshuffles almost all keys. Consistent Hashing maps both servers and keys onto a ring (0–360°). When a server is added, only its immediate neighbors' keys move, mi...
Join discussionFeb 19 · 2 min read · Welcome to Day 3! If you’ve been following along, we’ve covered the Why (Day 1) and the Structure (Day 2). But today, we answer the question that skeptics always ask: "If it's just digital data, why can't someone just edit the numbers and give themse...
Join discussion
Feb 18 · 3 min read · Welcome back, blockchain enthusiasts! In Day 1 of our "Mastering Blockchain" series, we peeled back the layers of hype to uncover why this technology truly matters – as the new internet of trust. Today, we're diving deeper into the engine room: The S...
Join discussion
