<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>TIL on FlakM blog</title><link>https://flakm.com/series/til/</link><description>Recent content in TIL on FlakM blog</description><generator>Hugo</generator><language>en</language><copyright>Copyright © 2023, Maciej Flak; all rights reserved.</copyright><lastBuildDate>Mon, 24 Aug 2026 11:39:24 +0200</lastBuildDate><atom:link href="https://flakm.com/series/til/index.xml" rel="self" type="application/rss+xml"/><item><title>Proving SQLx’s Statement Cache with bpftrace</title><link>https://flakm.com/posts/sqlx_caches_til/</link><pubDate>Mon, 24 Aug 2026 11:39:24 +0200</pubDate><guid>https://flakm.com/posts/sqlx_caches_til/</guid><description>&lt;p&gt;During the blissful one week off I spent without touching any AI assistants, I realized I&amp;rsquo;d stopped learning new things during regular paid work.&lt;/p&gt;
&lt;p&gt;Now my job requires me to work with the clankers, so I don&amp;rsquo;t get to observe the APIs or hit my head against the invalid imagination of some gnarly problem.&lt;/p&gt;
&lt;p&gt;I decided to spend some time restarting the habit of writing down what I discover and, more importantly, how I prove it to myself. Let&amp;rsquo;s start with some surprising optimization in sqlx&lt;/p&gt;</description></item></channel></rss>