<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>krsh.blog</title><description>Intuitive explanations of systems-level engineering, architecture, and low-level mechanics.</description><link>https://blog.krsh.io/</link><item><title>How a hash table finds a key</title><link>https://blog.krsh.io/posts/example/</link><guid isPermaLink="true">https://blog.krsh.io/posts/example/</guid><description>A hash table is a bookshelf with a rule for which shelf to check first—so most lookups never walk the whole room.</description><pubDate>Sat, 31 Oct 2026 00:00:00 GMT</pubDate></item><item><title>A write-ahead log is a recovery diary</title><link>https://blog.krsh.io/posts/write-ahead-log/</link><guid isPermaLink="true">https://blog.krsh.io/posts/write-ahead-log/</guid><description>Before you trust memory, append what you meant to do to a durable log—so a crash can replay the story.</description><pubDate>Tue, 20 Oct 2026 00:00:00 GMT</pubDate></item></channel></rss>