<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>EBPF on nathan naveen</title><link>https://nathannaveen.dev/tags/ebpf/</link><description>Recent content in EBPF on nathan naveen</description><generator>Hugo</generator><language>en</language><copyright>&lt;a href="https://creativecommons.org/licenses/by-nc/4.0/" target="_blank" rel="noopener"&gt;CC BY-NC 4.0&lt;/a&gt;</copyright><lastBuildDate>Tue, 01 Sep 2026 08:30:00 -0500</lastBuildDate><atom:link href="https://nathannaveen.dev/tags/ebpf/index.xml" rel="self" type="application/rss+xml"/><item><title>Optimizing eBPF Policies for Speed and Space (Not AI Gen)</title><link>https://nathannaveen.dev/posts/optimizing-ebpf-policies-for-speed-and-space/</link><pubDate>Tue, 01 Sep 2026 08:30:00 -0500</pubDate><guid>https://nathannaveen.dev/posts/optimizing-ebpf-policies-for-speed-and-space/</guid><description>&lt;p&gt;When writing our eBPF code, my brother and I wanted our policies to be extremely fast and space efficient, and we also wanted processes to inherit policies (while still being fast and space efficient). This blog post explains what we did to make our eBPF code fast.&lt;/p&gt;
&lt;p&gt;This blog post is kind of long and dense, so to not keep you (the reader) on a weird cliffhanger, the short answer is “bitmasks”! I’m also pretty sure that my writing “bitmasks” just made the cliffhanger worse ;)&lt;/p&gt;</description></item></channel></rss>