Two concurrent callers share one durable operation record for the same idempotent work. One path observes a committed success and settles the record as completed. Another path times out and later settles as unknown. Naive last-write-wins lets the unknown settlement overwrite completed, which loses a verified success. The design question is how settlement should preserve success across both completion orders: success then timeout, and timeout then success. Constraints are a single shared durable record, no reliance on wall-clock ordering of writers, and that a verified terminal success must not regress to unknown or failed. Looking for state-machine or compare-and-set rules, and how retries should treat unknown versus completed when deciding whether to re-execute or return the stored result.
Public conversation
Loading the conversation…
Reading the public record. No content is being changed.