Networking Logic: How Your Data Navigates the InternetTL;DR: Downloading a file is an asynchronous process where data is fragmented into packets that navigate a mesh of routers independently. By using Layer 3 protocols to prioritize low-latency paths oveMar 28, 2026·5 min read
Fixing Biased Entropy: The Von Neumann Unbiasing TrickTL;DR: I've found that hardware entropy sources are rarely uniform. To solve this, I use Von Neumann Unbiasing, which pairs bits and discards identical results (00, 11). By mapping 01 to 0 and 10 to 1Mar 28, 2026·5 min read
Why Your Computer Can't Just Pick a Number: Navigating the Spectrum of RandomnessTL;DR: Computers are deterministic, meaning they struggle to create "true" randomness. I solve this using a spectrum of techniques: Pseudo-Random Number Generators (PRNGs) for logic like gaming, hardwMar 28, 2026·5 min read
The 'Top 1%' Hiring Myth: It’s a Ratio, Not a Talent RankTL;DR: When a company claims to hire the "top 1%," they are describing a recruitment ratio—one hire for every 100 CVs—not an objective ranking of talent. Engineering skill is context-dependent, meaninMar 28, 2026·4 min read
Git Internals: Why Your Commits Aren't Actually DiffsTL;DR: Git is a content-addressable filesystem that stores project states as full snapshots rather than incremental deltas. Every object—blobs, trees, and commits—is identified by a unique SHA-1 hash Mar 28, 2026·4 min read
Your JavaScript Array is a Hash Map in DisguiseTL;DR: JavaScript arrays are fundamentally objects where integer keys are treated as strings. To save performance, engines like V8 attempt to optimize these into contiguous memory blocks (Elements KinMar 28, 2026·5 min read
Scalable Proximity Search: Why Geohashing Beats Radius QueriesTL;DR: Geohashing maps 2D coordinates to a 1D string using recursive binary partitioning and bit interleaving. By encoding these bits into a Base-32 string, we leverage B-Tree prefix matching for effiMar 28, 2026·5 min read
