Networking & Protocols
Resilience: cascading retries, circuit breakers, and error budgets
A third-party payment API slows to 5 seconds per response. Your server times out waiting, returns a 503. The client library retries after 100 ms, 200 ms, 400 ms. So do 1,000 other users. Your origin server, which normally handles 500 req/s, is now receiving 3,000 req/s — and still waiting on the slow payment API. Within 30 seconds, the entire site is down. The payment API was slow, not broken. But you turned “slow” into “catastrophic” by retrying without coordination.
The cascade anatomy
A retry storm is a positive feedback loop: one timeout → many retries → more load → more timeouts → more retries.
The amplification math. A 99.9% origin server (1 error per 1,000 requests) normally passes traffic fine. During a slowdown, requests queue. 1,000 clients each retry 3 times with a naive backoff. Origin traffic: 3× normal. Origin slows more. More retries. In 30 seconds, origin receives 10× normal traffic. A 99.9% server is now the bottleneck for 100% of traffic. A single degraded dependency turns a 0.1% error rate into a 100% outage.
The twelve-layer problem. Each layer in the request chain has its own retry logic:
- DNS client retries on SERVFAIL (3 attempts, 2 s apart).
- TCP SYN retries on timeout (exponential backoff, up to 3 attempts).
- TLS handshake retries on timeout (1–2 attempts).
- HTTP client library retries on 5xx (3 attempts, default exponential).
- Application-layer retry (business logic retries failed service calls).
All twelve layers retry independently. A single failure at layer 6 (origin processing) causes retries at layers 3 through 12 simultaneously. In aggregate, what was one failed request becomes 30+ network operations — all compounding the load on the already-struggling origin.
| Defense | What it prevents | Cost |
|---|---|---|
| Exponential backoff + jitter | Synchronized retry thundering herd | Slower recovery for individual clients |
| Circuit breaker | Retries to a failing dependency | Fast failures during open circuit; tuning required |
| Bulkhead | One slow dependency starving all threads | Thread pool per dependency; complexity |
| Load shedding | Queue depth causing timeouts | Fast 503 errors for excess traffic |
| Graceful degradation | Complete outage when origin is down | Stale data served; complex cache design |
Defense 1: Exponential backoff with jitter
Naive retry. Client sees 503, retries immediately. Server still broken. Client sees 503, retries again. Server never recovers.
Exponential backoff. First retry after 100 ms, second after 200 ms, third after 400 ms, fourth after 800 ms (doubling each time, capped at some max). The origin has time to recover between retries.
Why jitter is required. If 1,000 clients all hit a limit and all use the same backoff parameters, they all retry at t=100 ms, t=200 ms, etc. simultaneously. The origin gets a burst every 100 ms — a thundering herd. Jitter: add ±25% random variation to each retry delay. The 1,000 clients spread their retries across a 200 ms window. Origin load is constant instead of pulsed.
Full jitter formula (Jeff Atwood / Amazon): sleep = random_between(0, min(cap, base * 2^attempt)). This gives up to cap ms sleep on the final attempt, fully randomised — the most effective at preventing thundering herd.
Defense 2: Circuit breaker
Pattern from electrical engineering: a switch that opens when current exceeds a threshold, preventing damage from cascading.
Three states:
- Closed (normal). Requests pass through. Error rate and latency are monitored.
- Open (tripped). Error rate or latency exceeded threshold for the last N requests. New requests fail immediately (fast error, no network call). Server is not contacted.
- Half-open (probe). After a cool-down window (e.g., 30 s), a single request is allowed through. If it succeeds, circuit closes (normal). If it fails, circuit reopens.
Why fast failure helps. If the circuit is open and returns 503 in <1 ms, the client fails fast. With exponential backoff + jitter, the client waits and retries. The origin gets relief. When the origin recovers, the half-open probe succeeds, and traffic resumes. Without a circuit breaker, the client keeps retrying for seconds — adding load to an already-struggling origin.
Implementation. Libraries: Netflix Hystrix (Java, deprecated), Resilience4j (Java), Polly (.NET), opossum (Node.js). Configuration: failure threshold (e.g., 50% error rate over last 10 requests), half-open cooldown (30 s), sliding window size.
Defense 3: Bulkhead
Named after ship compartments that isolate flooding to one section. In software: give each dependency a separate thread pool (or async semaphore). If the payment API is slow, it fills the payment thread pool. The user API, product API, and CDN-fetch thread pools remain available. Slow dependency does not starve all threads.
Without bulkheads. Shared thread pool of 100 threads. Payment API slows → 100 requests queue → all 100 threads occupied → every API endpoint (user, product, search) is blocked. Site is down for all features, not just payment.
With bulkheads. Payment: 20 threads. User: 30 threads. Product: 30 threads. Misc: 20 threads. Payment API slows → 20 payment threads occupied → payment endpoint slow → all other endpoints unaffected. Graceful partial degradation.
Defense 4: Load shedding
When the request queue exceeds the server’s capacity to process, shed the excess with fast 503 instead of letting requests timeout.
Why fast 503 is better than timeout. A request that eventually times out after 30 s holds a thread, a DB connection, and memory for 30 s. A request that gets 503 in <1 ms releases all resources immediately. The client can retry with backoff. The server stays stable.
Implementation. Nginx: limit_req_zone + limit_req (rate-based, returns 503 when queue is full). In application: check request queue depth; if > threshold, return 503 immediately. Combine with stale-while-revalidate at the CDN so cached content is still served from edge during origin overload.
Error budgets and SLO-driven release cadence
SLO (Service Level Objective). A 99.9% availability SLO over a 30-day window means the service is allowed 0.1% errors — about 43.2 minutes of downtime. A 99.95% SLO allows ~21.6 minutes.
Error budget. The allowed failure time. When the budget is burned:
- At 50% consumed: slow down risky changes (feature releases, config changes).
- At 100% consumed: freeze all non-essential releases until reliability improves.
This formalises the latency/feature-velocity trade-off without politics. Engineers can ship fast while they have budget; operations can enforce a release freeze when the budget is gone.
Performance budgets. Extend the same idea to page load: set explicit targets (LCP < 2.5 s, JS bundle < 200 KB). Enforce in CI with tools like bundlewatch, size-limit, Lighthouse CI. A build that exceeds budget fails the pipeline. Forces conscious trade-offs at PR time instead of discovering bloat in production.
Why this works
Error budgets resolve the classic reliability-vs-velocity tension. Instead of engineering and product arguing about “can we ship this risky change,” the error budget answers it mathematically: if you have 30 minutes of budget left this month, a change with a 20% chance of a 5-minute incident is worth the risk (expected cost: 1 minute); a change with 20% chance of a 45-minute incident is not (expected cost: 9 minutes > 30-minute budget). Quantified risk replaces opinion.
Cascading retry storm from a DDoS amplification attack: how a single failure at layer 11 cascades across all twelve layers.
A real-time collaboration product needs p95 sub-100 ms latency globally for document edits.
Design the request-path architecture for a global SaaS that must meet: p95 page load 1 s, p95 API call 200 ms, 99.99% availability.
- Global user base, mostly North America + Europe + Asia.
- Mostly read traffic; some write traffic to user accounts and document edits.
- Compliance requires EU users' data to remain in EU.
- Cache static at edge; route dynamic via edge gateway to regional clusters.
- Regional data residency via row-level policy + per-region replicas.
- OpenTelemetry distributed tracing end-to-end with tail-based error sampling.
- Circuit breakers on every third-party dependency.
- CI-enforced performance budgets keep regressions visible at PR time.
- Error budget (99.99% = 4.38 min/month) drives release cadence — freeze on budget exhaust.
What is the error budget for an SLO of 99.95% availability over a 30-day window?
A circuit breaker is in the OPEN state. A new request arrives. What should happen?
- 01Explain the amplification math: how does a 99.9% server fail 100% under a retry storm?
- 02Why does adding jitter to exponential backoff prevent thundering herd, and what is the full-jitter formula?
- 03A senior architect argues edge compute always beats regional origins. Where is the bug in that argument?
Cascading retry storms arise because every layer in the twelve-phase request chain has independent retry logic — when a dependency slows, all layers retry simultaneously, amplifying traffic from 1× to 10× in under a minute. The defense stack: exponential backoff with full jitter (staggers retries), circuit breakers (fast error during outage, half-open probe for recovery), bulkheads (thread pool per dependency to contain blast radius), and load shedding (fast 503 when queue depth exceeds capacity). Error budgets formalise the velocity/reliability trade-off: a 99.95% SLO allows 21.6 minutes of downtime per 30-day window; burning the budget triggers a release freeze rather than an argument. The complete architecture for a global SaaS combines CDN edge for static assets, regional Kubernetes clusters with per-region data residency, OpenTelemetry with tail-based error sampling, and CI-enforced performance budgets — treating every layer as a potential failure domain with explicit runbooks.
appears again in269
- Why GraphQL gets N+1junior
- DataLoader mechanics: tick-boundary batchingmiddle
- Batch function contracts: ordering, shapes, errorsmiddle
- Federation and lookahead: batching beyond DataLoadermiddle
- Query complexity defences: depth, cost, persisted queriesmiddle
- Senior GraphQL API: scheduling contract, tenant isolation, observabilitysenior
- The journey of a request: seven stops from socket to responsejunior
- Accept and parse: from kernel queue to a typed requestmiddle
- Routing and middleware: choosing what runs, and in what ordermiddle
- Handler and response: from business logic to bytes on the wiremiddle
- Streaming and backpressure: when the client reads slower than you writesenior
- Timeouts and tail latency: budgets, deadlines, and the fan-out trapsenior
- Middleware and DI: the two patterns that shape every backendjunior
- Writing middleware: signatures, next(), and the three framework modelsmiddle
- Inversion of control: how dependencies reach a classmiddle
- DI scopes and lifecycles: singleton, request, transientmiddle
- DI as a testing seam: fakes, mocks, and the boundary that matterssenior
- DI containers in production: resolution graphs, circular deps, and when not tosenior
- Blocking vs non-blocking I/O: two ways to waitjunior
- The event loop: one thread, ordered phasesmiddle
- What blocks the loop: CPU work and sync callsmiddle
- Offloading CPU work: worker threads and the libuv poolmiddle
- Backpressure and bounded concurrencysenior
- Throughput under load: tail latency and saturationsenior
- Why pool: the cost of creating a connectionjunior
- Pool sizing: why bigger is not fastermiddle
- Acquisition and timeouts: the wait queue is the real latency dialmiddle
- Why idempotency: making retries safejunior
- Server-side state machine: four states of an idempotency keymiddle
- Retry strategies: backoff, jitter, and thundering herdmiddle
- Outbox and inbox: effectively-once across the dual-write boundarymiddle
- Concurrency and cache architecture for idempotency at scalesenior
- Observability, production failures, and global-scale designsenior
- The event loop: one thread, three queuesjunior
- Tasks, microtasks, and scheduler.yield()middle
- Timer accuracy, throttling, and idle workmiddle
- Microtask starvation, Long Tasks, and LoAFsenior
- Node.js event loop: phases, nextTick, and loop lagsenior
- React, Vue, and INP observability in productionsenior
- The render pipeline: six stages from bytes to pixelsjunior
- Stage costs and the renderer process modelmiddle
- Invalidation, dirty bits, and containmiddle
- Compositor layers: promotion, overlap, and GPU memorymiddle
- DevTools flame strip and the frame lifecyclemiddle
- Layout thrash: forced synchronous layoutsenior
- BeginMainFrame, compositor-driven animations, and GPU memorysenior
- Production observability: LoAF, INP, and the full attack surfacesenior
- What V8 is and why performance varies 100×junior
- V8''''s four-tier JIT pipeline and profile-guided tieringmiddle
- Hidden classes, transition trees, and memory layoutmiddle
- Inline caches, IC states, and deoptimizationmiddle
- Orinoco GC: parallel scavenger, concurrent marking, and write barriersmiddle
- TurboFan''''s speculative engine and the deopt-loop trapsenior
- V8 in production: isolates, pointer compression, and real failuressenior
- What workers are and why they existjunior
- Web worker mechanics: dedicated, shared, and OffscreenCanvasmiddle
- Structured clone and transferablesmiddle
- Service worker lifecycle and cache strategiesmiddle
- SharedArrayBuffer, Atomics, and cross-origin isolationsenior
- Service worker edge cases: version skew, durability, and navigation trapssenior
- Worker pools, Comlink, and production observabilitysenior
- What the reconciler does: render vs commitjunior
- The fiber object and the double-buffer treemiddle
- Render phase purity and commit phase sub-stepsmiddle
- Reconciliation: diffing heuristics and the key trapmiddle
- Priority lanes, time-slicing, and useTransitionmiddle
- Bailout, memoisation, and tearingsenior
- React Profiler, the Compiler, and production observabilitysenior
- Rendering strategies: SSG, SSR, ISR, streaming, and hydrationjunior
- SSG, SSR, ISR, streaming, and RSC — how each worksmiddle
- Hydration cost: selective, progressive, islands, resumabilitymiddle
- Hydration mismatch: causes, detection, and the determinism rulesenior
- RSC, per-route strategy, and production observabilitysenior
- Core Web Vitals: what LCP, INP, and CLS measurejunior
- LCP: four phases, one dominant costmiddle
- INP: input delay, processing, presentationmiddle
- CLS: why layout shifts happen and how to stop themmiddle
- Lab vs field: why the two disagree and how to use eachmiddle
- Metric tradeoffs, RUM attribution, and the CI+field loopsenior
- The full picture: URL to LCP to INP as a relay racejunior
- Eight layers traced: from the service worker to the second navigationmiddle
- Five canonical breaks: where production reliably diessenior
- The three-track method: reading traces and building a monitored systemsenior
- What is a cache stampede and why it makes things worsejunior
- Lock and single-flight: bounding concurrent rebuildsmiddle
- XFetch: coordination-free probabilistic early expirationmiddle
- Stale-while-revalidate and CDN request coalescingmiddle
- Detecting stampedes and designing TTL for productionmiddle
- Metastable failure, fencing tokens, and production postmortemssenior
- What a relation is: tables, rows, keys, and constraintsjunior
- Constraints, keys, and Postgres data typesmiddle
- Normal forms, denormalization, and why schemas stickmiddle
- JSONB, arrays, and when a side table winsmiddle
- Heap storage, TOAST, and column alignmentsenior
- Schema integrity: deferral, versioning, and production failure modessenior
- Relational vs document, wide-column, graph, and key-valuesenior
- What an index is and how it speeds up queriesjunior
- The leading-column rule and composite index designmiddle
- Partial, expression, and covering indexesmiddle
- Index types: GIN, GiST, BRIN, Hash, Bloom, and HOT updatesmiddle
- Index-only scans, the Visibility Map, and INCLUDEsenior
- Production failure modes and the index audit playbooksenior
- Index design exercise: full-text search strategysenior
- EXPLAIN and execution plans: what the planner decides and whyjunior
- Scan types: Seq, Index, Bitmap, Index-Onlymiddle
- Join algorithms and the row-estimate cascademiddle
- pg_statistic, ANALYZE, and production observabilitymiddle
- Extended statistics: fixing correlated-column estimate failuressenior
- Plan cache, cost-constant tuning, and planner internalssenior
- Production failure modes and plan stabilitysenior
- MVCC: why readers and writers never wait for each otherjunior
- Row versions and snapshots: the on-disk mechanicsmiddle
- HOT updates and isolation levels: what you gain and what you paymiddle
- Vacuum and bloat: keeping the storage tax boundedmiddle
- CLOG, XID wraparound, and MultiXact: deep visibility internalssenior
- SSI internals and production autovacuum tuningsenior
- Real-world MVCC failures, deployment patterns, and distributed snapshotssenior
- Connection pools: amortising the cost of a Postgres backendjunior
- PgBouncer session, transaction, and statement modesmiddle
- Pool sizing: the (cores × 2) + spindles formula and the two-layer stackmiddle
- Pool exhaustion and idle-in-transaction: the 3 AM failure modemiddle
- Migrating to transaction mode: rollout playbook and PgBouncer 1.21 prepared statementsmiddle
- The Postgres process model and why raising max_connections degrades throughputsenior
- Pooler landscape 2026, serverless connection storms, and the full failure-mode taxonomysenior
- What a schema migration is and why it replaces ad-hoc DDLjunior
- ADD COLUMN: instant in PG 11+ vs rewrite in older Postgresjunior
- The lock-queue failure mode: why instant DDL can freeze the databasemiddle
- Safe DDL patterns: NOT VALID, CONCURRENTLY, and unsafe-op fixesmiddle
- Expand-contract: zero-downtime for breaking schema changesmiddle
- Advisory locks, migration tools, and deploy coordinationsenior
- Migration failure taxonomy and production disciplinesenior
- Why sharding exists: the single-Postgres ceilingjunior
- Shard-key selection: hash, range, list, and directory strategiesmiddle
- Partitioning vs sharding: same word, two different thingsmiddle
- Co-location and Citus: the invariant that makes sharding usablemiddle
- The hot-shard failure mode: detection, isolation, and durable policymiddle
- Schema-based sharding and multi-tenancy alternativessenior
- Online resharding, 2PC, and the operational cost of shardingsenior
- The seven acts: from CREATE TABLE to Citusjunior
- Acts 1–3 in depth: schema, indexes, and planner statisticsmiddle
- Acts 4–6 in depth: MVCC bloat, connection pooling, and safe migrationsmiddle
- Act 7 in depth: sharding, co-location, and the seven-tier tradeoff cascademiddle
- Observability, anti-patterns, and production triagesenior
- Raft roles, terms, and why majority quorums prevent split brainjunior
- How Raft replicates a log entry and decides it is safe to commitmiddle
- Raft leader election: timeouts, voting rules, and the four safety propertiesmiddle
- Raft in the real world: partitions, slow disks, and client routingmiddle
- Raft extensions: pre-vote, learners, snapshots, and linearizable readssenior
- Raft in production: membership changes, Multi-Raft, and observabilitysenior
- Where data fetching happens — and why it decides LCPjunior
- Fetch waterfalls — diagnosis and the Promise.all curemiddle
- React Server Components and Suspense streamingmiddle
- Client-side cache: TanStack Query, SWR, and stale-while-revalidatemiddle
- LCP, prefetch, and race conditions in interactive fetchingmiddle
- Senior internals: RSC payload, caching layers, and production failure modessenior
- What the three signals are: logs, metrics, and tracesjunior
- Metrics and cardinality: the cost model of a time-series databasemiddle
- Logs and volume: the cost model of structured loggingmiddle
- Traces and sampling: the cost model of distributed tracingmiddle
- Join keys and exemplars: making the three signals composemiddle
- Observability 2.0: wide events and the cost shiftsenior
- Failure modes and engineering practice: cardinality budgets, PII, and samplingsenior
- Why structured logs exist: the diary vs the spreadsheetjunior
- The production log schema: fields every line must carrymiddle
- Log levels and alert routingmiddle
- Sampling strategies and log costmiddle
- PII redaction and log injectionsenior
- Trace context propagation in logssenior
- OTel Logs Data Model and audit logs as a subsystemsenior
- What is OpenTelemetry: API, SDK, Collector, OTLPjunior
- OTel signals, Semantic Conventions, and the OTLP wire formatmiddle
- Auto-instrumentation and manual spans: the 80/20 of OTelmiddle
- The OTel Collector: receivers, processors, exporters, and deployment patternsmiddle
- Sampling strategies: head, tail, and parent-basedmiddle
- Vendor neutrality, eBPF instrumentation, the Operator, and browser/serverless OTelsenior
- Operating the OTel Collector: reliability, version skew, failure modes, and governancesenior
- RED and USE: two checklists, one triage disciplinejunior
- Instrumenting RED in Prometheus: counters, histograms, and cardinality disciplinemiddle
- USE on Linux: CPU, memory, disk, network, and PSImiddle
- Golden signals, dashboard layout, and service mesh auto-REDmiddle
- Cardinality as a cost driver: labels, PII, exemplars, and samplingmiddle
- Native histograms, SLO tie-in, and production failure patternsmiddle
- SLI, SLO, and the error budget: reliability by the numbersjunior
- Choosing SLIs and SLO targets: ratios, not feelingsmiddle
- Multi-window multi-burn-rate alerting: why AND beats ORmiddle
- Error budget policy, latency SLOs, and composite journeysmiddle
- Iceberg SLIs, composite SLO math, and SLA vs SLOsenior
- Production SLO failures, self-observability, security, and the big picturesenior
- What is trace propagation and why broken propagation is worse than nonejunior
- traceparent and tracestate: the W3C header format in fullmiddle
- Baggage and async boundaries: carrying context across queues and callbacksmiddle
- Async context per language, service mesh, B3 migration, and securitysenior
- Production propagation failures, span links, and platform designsenior
- Flame graphs: reading the picture that shows where time goesjunior
- Sampling vs instrumentation profiling: why 99 Hz wins in productionmiddle
- Profile types: CPU, memory, off-CPU, mutex — which one to reach formiddle
- Continuous profiling: always-on flame graphs with eBPF and trace-id correlationmiddle
- How flame graphs are built from samples, and the production workflows that use themmiddle
- Linux perf, eBPF internals, PGO, and the limits of samplingsenior
- Profiling in production: security, war stories, OTel profiles, and the infrastructure designsenior
- The debugging funnel: SLO → RED → trace → profilejunior
- OTel architecture: one SDK, four signals, one wire formatmiddle
- Cost discipline: keeping observability under 5% of infra spendmiddle
- The incident loop: from pager to postmortem to preventionmiddle
- Scale, security, and the ROI of observable systemssenior
- Why profile first: measure where time actually goesjunior
- Amdahl''''s law and self-time: the ceiling on every speedup you can shipmiddle
- The measurement loop: microbench, macrobench, prod profile, observer effectmiddle
- Reading flame graphs: shapes, per-language profilers, and the 60-second scanmiddle
- Statistical baselines: why one run is not a measurementmiddle
- Profiler history and microbenchmark pitfalls: Knuth to GWPsenior
- Hardware counters, cold-start profiles, and profile securitysenior
- Continuous profiling at scale: costs, CI gates, trace correlation, and anti-patternssenior
- What makes a hot path: symptom vs causejunior
- Five shapes of hotspot: CPU, alloc, cache, lock, syscallmiddle
- Reading parent and child chains: where to apply the fixmiddle
- JIT deopt, the fix-and-verify loop, and PR-time profilingmiddle
- Hardware counters and Intel TMA: sub-category diagnosissenior
- False sharing and native-bridge hot pathssenior
- Hot paths in production: security, tail latency, and tooling lineagesenior
- Memory hierarchy: why the same O(N) loop can be 17x slowerjunior
- Row-major vs column-major: access order and the 9x gapjunior
- Cache lines, struct layout, and false sharingmiddle
- Branch prediction and branchless codemiddle
- SIMD, SoA vs AoS, and memory bandwidthmiddle
- Hardware prefetcher, TLB, and memory-level parallelismsenior
- Cache-oblivious algorithms, PGO, and production failuressenior
- GC basics: what the runtime taxes you forjunior
- GC algorithms: generational, concurrent, and per-runtimemiddle
- GC tradeoffs: pause, throughput, heap — and object poolingmiddle
- GC tuning: pacing, heap shape, and allocation observabilitymiddle
- GC internals: tri-color invariant, write barriers, and per-runtime deep-divessenior
- GC in production: observability, security, edge cases, and fleet governancesenior
- N+1: one logical operation, many round-tripsjunior
- Fix families: JOIN, IN, preload, and DataLoadermiddle
- Detecting N+1: query logs, APM traces, and CI gatesmiddle
- DataLoader: batching across resolver treesmiddle
- Cross-protocol N+1: HTTP fan-out and Redis MGETmiddle
- N+1 at scale: pool exhaustion, plan changes, and denormalisationsenior
- Batching: amortize fixed cost per operationjunior
- The batching window: size and wait timemiddle
- Batching in Kafka and Postgresmiddle
- io_uring and observability of batchingmiddle
- From Nagle to io_uring: evolution of batchingmiddle
- Backpressure, failure isolation, and batch security in productionsenior
- What a bundle actually costs: download, parse, compile, executejunior
- Core Web Vitals: LCP, INP, and CLSmiddle
- Code splitting: route-level, component-level, vendor splittingmiddle
- Tree shaking and compression: removing what you don''''t usemiddle
- Third-party scripts: the silent budget killermiddle
- CI enforcement and RUM: making budgets stickmiddle
- V8 JIT pipeline, HTTP priorities, and bundle securitysenior
- The performance loop: discipline, not a projectjunior
- Classify and fix: matching bottleneck families to remediesmiddle
- Observability stack and CI gates: catching regressions before they shipmiddle
- Incident to enforcement: SLO burn to verified fix in 35 minutesmiddle
- Culture, economics, and org-scale performancesenior
- At-most-once, at-least-once, exactly-once: the three delivery contractsjunior
- The three failure legs — where duplicates and losses actually happenmiddle
- Consumer-side dedup: the cheapest path to exactly-once processingmiddle
- Kafka exactly-once semantics: idempotent producer and transactionsmiddle
- SQS visibility timeout, DLQ, and the outbox patternmiddle
- Exactly-once in production: impossibility proof, hybrid patterns, and real incidentssenior
- What OAuth is and why passwords are not the answerjunior
- Authorization code flow with PKCEmiddle
- ID token validation and JWKS cache managementmiddle
- Refresh token rotation and scope-based least privilegemiddle
- Sender-constrained tokens: DPoP and mTLSsenior
- OAuth in production: audience attacks, observability, and real failuressenior