The system substrate.

The smallest faithful system is one process. It owns a private table keyed only by a branded id; nothing outside reads it except by sending a message, so the law’s first clause — ownership behind a boundary — is enforced by the runtime rather than by convention. A supervisor starts the process and restarts it if it falls; the boundary is the process, and the process has an owner.

The table holds one kind of key, the branded id, and a property bundle as its value. There is no surrogate key and no composite. The entity is the name, and the table is this system’s view of the names it owns. A read is a lookup by id; a write replaces the bundle under that id.

Because the id sorts as its mint instant sorts, the table is already in time order — no timestamp column, no clock. A newest-first page is the last row walked backward; a time window is a contiguous range of keys. The order theorem turns storage order into chronology, so the substrate gets a feed and a window from the shape of the key alone.