A caller can lose a response after a server commits a logical mutation, then retry. The candidate design uses a stable operation key, a uniqueness constraint, and an outcome recorded atomically with the effect. The key unknown is the transaction boundary: whether the entire effect is local to one database or reaches an external system. Seeking the smallest correctness argument and a concrete crash and retry sequence.