Browser & Frontend Runtime
Service worker edge cases: version skew, durability, and navigation traps
You ship a service worker that serves the app shell cache-first. A week later you push a bug fix. Some users never get it — they keep hitting the broken cached shell on every reload, and there is no recovery button for an ordinary user.
The update-and-version-skew problem
A service worker’s asset cache is versioned to its own code. When you deploy version N+1, an open page may be running version N’s worker while N+1’s HTML has shipped — or the reverse. If the worker serves cache-first app.js from version N while the HTML expects version N+1’s app.js, you get a runtime error from mismatched modules.
The robust pattern:
- Content-hash every asset filename (
app.4f3a1c.js). Old and new assets coexist in the cache with no collision. - Version-tag cache names (
cache-v3,cache-v4). Pre-cache each deploy’s full asset set under the version tag. - In
activate, delete only stale caches — caches whose version tag is not the current one. Do it afterclients.claim()so no controlled page loses assets mid-session. - Serve navigation requests network-first (or a dedicated app-shell route), so users always land on HTML consistent with the active worker.
The same class of bug applies to sw.js itself: browsers cache the worker file for up to 24 hours by default. The modern practice is to serve sw.js with Cache-Control: no-cache so the browser always re-fetches it on navigation.
Service workers are not durable
The browser kills an idle service worker aggressively — often within seconds of finishing a fetch event — and restarts it on the next event. Any state held in a module-level variable is gone on restart. This is a frequent bug source:
- A counter tracking requests in flight.
- A cache of pending promises.
- A WebSocket connection held in a global.
All evaporate. Durable state must live in IndexedDB or the Cache API.
Long-running work inside an event handler must be wrapped in event.waitUntil(promise) — that tells the browser “do not kill me until this promise settles.” Forgetting waitUntil means the browser may terminate the worker mid-operation, and background sync, push handling, and cache population silently fail to complete.
- Idle worker kill time
- Seconds after last event
- sw.js browser cache default
- Up to 24 hours
- Recommended sw.js cache header
- Cache-Control: no-cache
- Durable state options
- Cache API or IndexedDB only
- waitUntil forgets → silent fail
- push, sync, cache population
Navigation interception and the app-shell danger
The most powerful — and most dangerous — service worker pattern is intercepting navigation requests: the fetch handler catches the request for the HTML document itself and returns a cached app shell. This gives instant loads, but creates a class of bug otherwise impossible.
The trap: If you ship a bug in the app shell and cache it cache-first, every repeat visit serves the broken shell from cache, bypassing the network where the fix lives. The user cannot escape with an ordinary reload.
The defence is layered:
- Navigation requests should be network-first with a short timeout (~3 s, fall back to cache). This ensures a fix reaches users on their first successful load.
- Keep a kill switch — a versioned endpoint the worker checks on activate or periodically. On signal, call
self.registration.unregister()and delete caches. This lets you remotely detach a broken service worker from all clients. - Never cache navigation cache-only. Always have a network path.
A broken service worker shipped widely is a stop-the-deploy incident because ordinary users have no recovery button — they cannot open DevTools, they cannot clear site data. Your only recourse is the kill switch or a fresh deploy that the old worker fetches on next activation.
A service worker holds an in-flight request map in a module-level `const cache = new Map()`. After a few seconds of inactivity, entries vanish. Why?
You deploy a service worker update and some users report a broken page: scripts fail to load with module-mismatch errors. What is the most likely cause and the robust fix?
A user is stuck on a broken cached app shell and a normal reload does not fix it. What is the recovery mechanism you should have built in advance?
Why this works
Why is a broken service worker so hard to recover from? When a service worker intercepts navigation, it sits between the browser and the server for the HTML document itself — the page cannot load without the service worker responding first. Unlike a broken CDN (where the browser falls back to origin), a broken service worker responds successfully with a broken cached response. The browser has no way to distinguish a correct cached response from a buggy one. This is why the kill switch must be proactive: a URL the worker fetches on every activate, whose response tells the worker whether to unregister itself. If you wait for users to report breakage, you have already shipped.
- 01Why does a service worker's module-level state disappear between requests?
- 02What is the version-skew failure mode in service workers and how do you prevent it?
- 03Why is a broken navigation-intercepting service worker a stop-the-deploy incident, and what is the architectural defence?
Service workers have three major edge-case failure modes. Version skew: serving cached assets from the wrong version — prevented with content-hashed filenames and version-tagged caches. Durability trap: module-level state evaporates between events because the browser kills idle workers; use event.waitUntil for long operations and IndexedDB/Cache API for state. Navigation interception: caching the HTML document itself means a broken shell traps users permanently — always use network-first for navigation and build a kill-switch endpoint. All three failures become hard-to-reverse production incidents if deployed without the safeguards.
appears again in143
- 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
- Why idempotency: making retries safejunior
- Server-side state machine: four states of an idempotency keymiddle
- 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
- 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
- Index-only scans, the Visibility Map, and INCLUDEsenior
- Production failure modes and the index audit playbooksenior
- pg_statistic, ANALYZE, and production observabilitymiddle
- 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
- The three-way handshakejunior
- Sequence numbers and connection statemiddle
- DNS: what it does and why it existsjunior
- The resolver walk: referrals, record types, and gluemiddle
- TTL, caching, and DNS propagationmiddle
- The 1-RTT handshake: key shares and ECDHEmiddle
- Session resumption and 0-RTTmiddle
- WebSocket: the HTTP upgrade handshakejunior
- WebSocket frame format: opcodes, masking, fragmentationmiddle
- WebSocket backpressure: when clients can''''t keep upmiddle
- Reconnection: jittered backoff, thundering herd, message resumptionsenior
- WebSocket at scale: HTTP/2 multiplexing, permessage-deflate, C10Msenior
- WebSocket in production: proxies, security, and distributed architecturesenior
- What reverse proxies dojunior
- Health checks, connection draining, and slow startmiddle
- Session affinity, consistent hashing, and the right fixmiddle
- Retry storms, circuit breakers, and load sheddingsenior
- Resilient LB architecture: anycast, zone-aware routing, and observabilitysenior
- Why QUIC and not TCP+TLSjunior
- Connection IDs and network migrationmiddle
- 0-RTT resumption and packet encryptionsenior
- DDoS: what it is and why it worksjunior
- Amplification attacks and state exhaustionmiddle
- Rate limiting: algorithms and architecturemiddle
- WAFs, firewalls, mTLS, and HSTSmiddle
- DNS cache poisoning and BGP hijackingsenior
- Defense-in-depth architecture and attack economicssenior
- DNS, TCP, TLS in sequence: where the milliseconds gomiddle
- Proxy intercepts and security gates: rate limiters, WAF, mTLSmiddle
- Alternate paths: QUIC 0-RTT, WebSocket upgrade, connection migrationmiddle
- Observability: distributed traces, USE/RED, and samplingsenior
- Resilience: cascading retries, circuit breakers, and error budgetssenior
- What the three signals are: logs, metrics, and tracesjunior
- Why structured logs exist: the diary vs the spreadsheetjunior
- The production log schema: fields every line must carrymiddle
- PII redaction and log injectionsenior
- OTel Logs Data Model and audit logs as a subsystemsenior
- SLI, SLO, and the error budget: reliability by the numbersjunior
- Error budget policy, latency SLOs, and composite journeysmiddle
- Production SLO failures, self-observability, security, and the big picturesenior
- The incident loop: from pager to postmortem to preventionmiddle
- Cache lines, struct layout, and false sharingmiddle
- SIMD, SoA vs AoS, and memory bandwidthmiddle
- Cache-oblivious algorithms, PGO, and production failuressenior
- GC in production: observability, security, edge cases, and fleet governancesenior
- 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
- 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