On Idempotency Keys - Gunnar Morling
In distributed systems, there’s a common understanding that it is not possible to guarantee exactly-once delivery of messages. What is possible though is exactly-once processing. By adding a unique …
On Idempotency Keys - Gunnar Morling Gunnar Morling Random Musings on All Things Software Engineering On Idempotency Keys Posted at Nov 25, 2025 distributed-systems reliability patterns Table of Contents UUIDs Monotonically Increasing Sequences Deriving Idempotency Keys From the Transaction Log Discussion In distributed systems, there’s a common understanding that it is not possible to guarantee exactly-once delivery of messages. What is possible though is exactly-once processing . By adding a unique idempotency key to each message, you can enable consumers to recognize and ignore duplicate me
Explore this link on the map →saved by
related reading
- What is idempotency? And why it matters for durable systems | Temporaltemporal.io
- Exactly-once Semantics is Possible: Here's How Apache Kafka Does itconfluent.io
- A Distributed Systems Reading Listferd.ca
- Building Systems Using Transactions in Apache Kafka®developer.confluent.io
- Everything I know about good system designseangoedecke.com
- Kafka Producer transactions incrementing offsets twice for a messagegroups.google.com
- Distributed architecture concepts I learned while building a large payments system - The Pragmatic Engineerblog.pragmaticengineer.com
- Reliable Microservices Data Exchange With the Outbox Patterndebezium.io
- Notes on Distributed Systems for Young Bloods – Something Similarsomethingsimilar.com
- Mediumlevelup.gitconnected.com
- Using Snowflakes for database IDs | Matteo Contrinimatteosonoio.it
- Every System is a Log: Avoiding coordination in distributed applications | Restaterestate.dev