A two-second capacity dip, four retry policies and one retry budget, simulated in about a hundred lines of Go: how retries multiply load, why jitter helps, and what a budget changes.

Why a custom logits processor that runs once per request can dominate tail latency even when the GPU batches perfectly, and the batch-level rewrite that fixes it.

Open-weight models are not catching up to frontier APIs on benchmarks. They are already ahead on the number that decides most production budgets: cost per request at scale.

Saving to the database and publishing an event are two writes to two systems that fail independently. The transactional outbox pattern makes the event part of the same database transaction, so what commits is what gets published - here is a working Go and PostgreSQL implementation, including the retry, ordering, latency and cleanup details most guides skip.

A weekend bicycle ride to Vũng Tàu, the road that made it worth doing, and eight photographs of walls. Notes on riding for the pleasure of it, and on why a town you arrive in slowly gives you different pictures.

Bloom filters answer one narrow question - definitely not present, or maybe present - in a fixed amount of memory, and that narrow answer is enough to save databases from millions of disk reads for keys that were never there. Here is how they work, the math behind the false positive rate, and where RocksDB, Cassandra, and PostgreSQL actually use them.