🚦 Rate Limiting

Feed one request stream into four rate-limiting algorithms at once and watch which lets what through, with each one internal state drawn underneath. Two models cover the fixed window, sliding window, token bucket and leaky bucket side by side including the boundary burst that reading about never quite makes real, and what happens the moment there is more than one application server: the limiter installed to protect the system turns out to race against itself. Each step lights up the matching line of Go and TypeScript.