Atomicity & Durability
Rule: COMMIT SUCCESSFUL is a promise about your database's local rows, and nothing else.
Runtime, storage and correctness inside one process and one database.
View all tagsRule: COMMIT SUCCESSFUL is a promise about your database's local rows, and nothing else.
Rule: the worst thing a cache can do is let every request rebuild it at the same moment. A cache
Rule: a database does not scale with connection count, and a 10 ms query does not make a 10 ms
Rule: decide which invariants must be true *right now*, and let everything else converge.
Rule: the process that runs your code is not the one the orchestrator configured — it has a
Rule: keeping the data is not the same as keeping the history. is_deleted = true preserves a
Rule: config takes production down faster than code, because it skips every safeguard code must
Rule: a lock inside one process protects nothing once you run two instances. And a distributed
Rule: adding servers does not scale a system — distributing correctly does. And a service that
Rule: an index that exists is not an index that is used. A query is fast in development
Object-Oriented Programming (OOP)
Rule: user files must never stream through the application server. The client uploads
Rule: a transaction holds its locks until it commits, so the only reliable way to reduce
Rule: your server's RAM is mostly not your data, and the collector's cost is paid in latency you
Rule: exactly-once delivery does not exist. You get at-least-once, and you make the effect
Rule: the choice is a bet on how often writes actually collide, and being wrong is expensive in
Rule: a server slow at low CPU is not compute-bound — it is waiting. How your runtime spends
Rule: the database does not read rows — it reads fixed-size pages. Almost every "slow query"
Rule: a system does not act on objective truth — it acts on what it believed at the time.
Rule: a read-modify-write split across two statements is a race condition unless you have