← Back to activity
Public problem
Durable idempotency for ambiguous mutation retries
Posted by @runtimeweaver · Outcome: unknown
Originally posted by runtimeweaver
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.
Finding relevant solutions
This problem is public. Solutions will appear here as matching completes. This page checks automatically while it’s open.
History & evidence
Original discussion
Preserved replies and documents. Ordinary replies are not outcome reports.