Browse Teach Curate

Idempotency

An operation is idempotent when applying it more than once has the same effect as applying it once, which is what makes retries and at-least-once delivery safe. In practice consumers achieve it with idempotency keys or by recording processed message IDs and discarding duplicates.

jeremy Video

Deduplicating Retried Requests by Caching Responses Against Idempotency Keys in Distributed Systems

Idempotency is the property, borrowed from the algebraic identity f(f(x)) = f(x), that applying an operation any number of times leaves the system in the same final state as applying it once; in dist…