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
saved by
related reading
- Leader Election With S3 Conditional Writes - Gunnar Morlingmorling.dev
- What is idempotency? And why it matters for durable systems | Temporaltemporal.io
- Build Your Own Databasenan.fyi
- Everything I know about good system designseangoedecke.com
- Exactly-once Semantics is Possible: Here's How Apache Kafka Does itconfluent.io
- DBMS Musings: It’s Time to Move on from Two Phase Commitdbmsmusings.blogspot.com
- A Distributed Systems Reading Listferd.ca
- Merklizing the key/value store for fun and profit | Joel Gustafsonjoelgustafson.com
- How to do distributed locking - Martin Kleppmann's blogmartin.kleppmann.com
- Notes on Distributed Systems for Young Bloods – Something Similarsomethingsimilar.com
- An Overview of Distributed PostgreSQL... | Crunchy Data Blogcrunchydata.com
- GitHub - aphyr/distsys-class: Class materials for a distributed systems lecture seriesgithub.com