Keeping Time: Pacing Output and Following Clocks with a Phase-Locked Loop (PLL)
Which clock a program should keep time by, how to pace output on your own clock exactly, how to follow someone else's, and how to show that every implementation agrees.
Tag
Series
Writing tagged “Series”.
Fair Scheduling Across Queues with Deficit-Weighted Round Robin (DWRR)
What fair means when several queues share one consumer, how to write that down precisely, and how to show that every implementation agrees.
Whose Clock?
Why a constant-rate sender doesn't need a phase-locked loop, where one is actually needed, the questions its equations leave open, and how to check an implementation that can't be exact.
Taking Turns
Why taking turns isn't enough to share a consumer fairly, how deficit round robin measures turns in work, and how a deliberately simple reference shows that an implementation follows the rules.
Simplicity Is Security
From OpenBSD to agentic coding: eliminate what's not needed, trust less, and limit the blast radius.
Agentic Coding
How agentic coding adds a boundary between the engineer and the program, and why working code must be simplified, described, and constrained.
The Limits of Understanding
Human limits, OpenBSD audits, privilege separation, and the operating-system boundaries that contain unseen defects.
Less Is More
Writing less code can make that code more secure.
Intentions and Unintentions
The negative space of security: unintended behavior, explicit permissions, and what testing can—and cannot—establish.