Nitpick: you definitely can do loops as long as the verifier can prove they're bounded. At my previous job, I've written production eBPF exclusively in Rust us

Nitpick: you definitely can do loops as long as the verifier can prove they're bounded. At my previous job, I've written production eBPF exclusively in Rust using Aya (mentioned by a sibling comment), and it's been a blast. Being able to share the type definitions between the kernel-space and the user-space code is a blessing to avoid subtle issues when going through the maps. And, at least in Rust, you can re-use crates and types that make you gain time. As a (simple) example, being able to use the standard library's IpAddr types or the ipnet crate to not have to roll your own IP and network manipulation libraries is a (small) timesave. It's main value is not needing to onboard new developers. The Rust type system is a good helper in keeping the verifier happy. Slices, iterators, match statements, etc are very good in my experience (e.g. Option is a godsend to ensure you stay withing the bounds of the input packet, esp. slice::split_at when parsing headers). But you're right that reading C is non-negotiatable, especially since pretty much all example code on the internet is in C.