Original, source-backed articles about running small systems, static sites, HTTP, DNS, TLS, and operations.
Posts are original articles written for this site. Each one is script-free, source-backed, and tied to the same operational reality the rest of the site records: how a small, static, publicly served system is built, secured, and kept honest.
Query timeouts bound a bad query's cost
A query timeout limits one part of database work. It does not automatically bound connection-pool waiting, cancel remote execution, or finish transaction cleanup. Protecting shared capacity requires knowing which component owns the timer, what that component actually interrupts, and what state remains after the error.
...
Servers need observable time discipline
A time daemon is useful only when its operating state supports the application’s time requirements. A running process can have no usable source, and a selected source can still be wrong or insufficiently measured. Treat time service health as an observable chain: source configuration, successful observations, selection, uncertainty, and permitted clock control. A green process indicator covers only the beginning.
...
Backups follow the 3-2-1 rule
The classic 3-2-1 backup rule calls for three copies of data, on two storage media, with one copy off site. The working data counts as one copy, leaving two backup copies. The rule is a starting point for separating failure exposure. It does not promise that every set of three filenames survives hardware failure, accidental deletion, credential compromise, or a mistake propagated to all copies.
...
HTTP idempotency makes retries safe
HTTP idempotency concerns the intended effect of repeating an identical request, not whether every response looks the same. This distinction matters when a connection closes after the server applies a change but before the client receives the answer. Repetition can be appropriate, but only within the operation’s actual semantics and the client’s retry policy.
...
Choose transaction isolation to preserve the invariant
Choose an isolation level from the invariant an operation must preserve. A stable snapshot is useful, but two transactions can each make a locally reasonable decision that becomes invalid when both commit. PostgreSQL Repeatable Read prevents changes to a transaction’s reading snapshot, yet permits some serialization anomalies. Serializable adds detection that rejects combinations of concurrent work inconsistent with any serial execution, requiring the application to handle retries.
...
Rate limiting is a shared budget
A rate limit is a budget for admitted work, defined by its unit, identity, scope, and time rule. “Five requests” is incomplete without saying whose requests, across which endpoints and workers, during which interval, and what happens after exhaustion. A shared counter helps only when every relevant admission uses the same authoritative decision.
...
Cursor pagination continues from a specific boundary
Keyset pagination continues after the last ordering key returned to a client. Instead of skipping a number of rows from the current beginning, it compares each candidate with a concrete boundary. This prevents a new item at the top of a feed from shifting every later page by one position. It does not freeze the dataset or promise that every future request sees the same records.
...
Health endpoints answer a question
A health endpoint is an input to an operational decision, not a universal certificate that a service works. A small endpoint returning 200 can be useful when its consumer needs exactly that limited evidence. Problems begin when operators interpret “this handler answered” as “every customer request will succeed.”
...
