All Articles

A deep dive into how event loops, task scheduling, and I/O polling combine to power modern async runtimes.

Exploring patterns for encapsulating unsafe code while maintaining safety guarantees at the API boundary.

How to avoid unnecessary data copies when writing high-throughput network applications.

A practical mental model for reasoning about lifetimes and the borrow checker from first principles.

Using the actor model to write concurrent code that is easy to reason about and test.

When to use lock-free algorithms, how they work, and the pitfalls to watch out for.

A guide to hand-rolling recursive-descent parsers that are fast, maintainable, and easy to extend.

From bump allocators to jemalloc – how allocators work and how they affect performance.

CAP theorem, consensus algorithms, and the building blocks of distributed databases and queues.