The Runtime Theory

// screen

Videos

The same editorial standard as the articles, on screen: trace the system, show the tradeoff, keep it deep. Episodes marked in production are in the studio.

08:56
networking

HTTP/3 and QUIC Explained

The transport protocol that replaces TCP — multiplexing without head-of-line blocking, connection migration, and 0-RTT.

Watch
07:41
algorithms

Hash Tables Under the Hood

Load factors, collision strategies, and cache behavior — why O(1) has a constant that can be 1ns or 200ns.

Watch
19:20
operating systems

Virtual Memory in One Diagram

Page tables, TLB, demand paging, and copy-on-write — how your 16GB laptop 'has' 128GB of addressable memory.

Watch
08:50
distributed systems

Raft Consensus Explained

Leader election, log replication, and safety — the consensus algorithm that powers etcd, CockroachDB, and TiKV, explained from first principles.

Watch
05:09
runtime

How Garbage Collection Actually Works

A visual walkthrough of mark-sweep, generational collection, and concurrent GC — the algorithms that keep your memory clean.

Watch
09:03
system design

Load Balancers, Explained

Layer 4 vs layer 7, health checks, stickiness, and the failure modes behind the most trusted box in your architecture diagram.

Watch
63:33
runtime

What Your Code Does Before main()

The loader, the linker, the dynamic linker, and the runtime — everything that happens between pressing run and your first line of code.

Watch
12:39
databases

B-Trees: The Shape of Databases

Why every major database is a tree shaped like a disk page — and how to read your index's health from its shape.

Watch
16:06
runtime

How Threads Actually Work

The kernel scheduler, context switches, goroutines versus threads — a visual walkthrough of what 'running on a core' really means.

Watch
05:20
networking

The Full Lifecycle of an HTTP Request

Watch a single request travel from a browser through DNS, TCP, TLS, HTTP, a load balancer, a server, and a database — with live packet-level tracing.

Watch