<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet href="/rss-styles.xsl" type="text/xsl"?><rss version="2.0"><channel><title>Cannon Kalra — Writing</title><description>Engineering essays on data platforms, distributed systems, and the craft of building reliable software at scale.</description><link>https://cannonkalra.github.io/</link><language>en</language><item><title>Point Lookups: Hash Maps and the Hardware Beneath Them</title><link>https://cannonkalra.github.io/blog/part-1-point-lookups-and-the-hardware-beneath-them/</link><guid isPermaLink="true">https://cannonkalra.github.io/blog/part-1-point-lookups-and-the-hardware-beneath-them/</guid><description>What a key-value lookup is, why hash maps answer it in O(1), and why the same operation behaves completely differently in memory and on disk.</description><pubDate>Fri, 03 Jul 2026 00:00:00 GMT</pubDate><category>data-structures</category><category>hash-maps</category><category>associative-arrays</category><category>memory</category><category>storage</category><category>hardware</category><author>Cannon Kalra</author></item></channel></rss>