Browser & Frontend Runtime
Hydration mismatch: causes, detection, and the determinism rule
A greeting component renders “Good morning” or “Good evening” based on the hour. In development it works. In production, users see a flash: text changes the instant the page loads, and layout shifts by 0.14. The browser console says: “Text content did not match. Server: ‘Good evening’ Client: ‘Good morning’.” The cause is a broken contract called a hydration mismatch.
The mechanism, precisely. Hydration is a contract: the DOM the client produces on its first render must be structurally identical to the DOM the server serialised into the HTML. React walks the server DOM and the client’s virtual tree in lockstep, adopting each node. When a node disagrees — different text, different attributes, a different element, an extra or missing child — the contract is broken. React’s recovery: it logs a mismatch error and, for the affected subtree, throws away the server HTML and client-renders it from scratch. That recovery render is the visible symptom: a flash of changed content and a layout shift that spikes CLS.
The common causes are all forms of non-determinism between the two environments: Date.now(), Math.random(), window/document/localStorage read during render (undefined on the server), Intl formatting that depends on locale or timezone, typeof window branches, and browser extensions that mutate the DOM before React hydrates.
The determinism rule. The cure is to make the first client render a pure function of the same inputs the server had. Any value that can differ between server and client must not appear during render — it is deferred to a useEffect that runs after hydration, or gated behind a useState(false) “mounted” flag flipped in an effect, so both the server render and the first client render produce the placeholder and only a later render introduces the client-specific value.
Hydration mismatch: what breaks and how
The data mismatch trap. The same constraint applies to data. If the server renders from one snapshot of an API response and the client refetches a newer one before hydrating, the trees diverge — a hydration mismatch caused by data, not by time or locale. The fix: the server’s data must be embedded in the HTML and reused by the client for the first render. This is exactly what frameworks do with the dehydrated query cache (React Query, Apollo, SWR): serialize the server’s data into the HTML, rehydrate it on the client, render the first pass from that cache, and only then allow fresh fetches.
Edge cases
The size of the embedded dehydrated cache matters. A very large API response serialized into the HTML inflates the document and parse time — sometimes the right trade is to embed the minimum for the above-the-fold content and refetch the rest post-hydration, accepting one extra background fetch to keep the document small.
Streaming SSR internals. renderToPipeableStream renders the tree depth-first and flushes the shell — everything outside any pending Suspense boundary — as soon as it is ready. For each Suspense boundary whose data has not resolved, the server emits the fallback inline and keeps the connection open. When a boundary’s data resolves, the server renders that boundary’s real content and writes it as a chunk: a hidden <div> carrying the content plus a tiny inline <script> that relocates it into the right slot and removes the fallback. The browser, parsing HTML progressively, executes that script the moment the chunk arrives. Boundaries stream in completion order, not document order — a fast widget low on the page can arrive before a slow widget above it.
Streaming and hydration interleave. As each Suspense boundary’s HTML streams in, React on the client can hydrate that boundary independently — it does not wait for the whole document. If the user interacts with an already-streamed-but-not-yet-hydrated boundary, React records the event, prioritises hydrating that boundary first, then replays the event. The senior implication: where you place Suspense boundaries is a performance design decision, not just an error/loading-state decision. A boundary around a slow, below-the-fold widget lets the rest of the page stream and hydrate without waiting for it; no boundary and that widget blocks the whole document.
Warning: Text content did not match.
Server: "Good evening" Client: "Good morning"
at Greeting (greeting.tsx:6)
at Header
at App
Warning: An error occurred during hydration. The server HTML
was replaced with client content in <div id="greeting">.
[CLS] layout shift: 0.14 (source: #greeting subtree) The Greeting component renders 'Good morning' or 'Good evening' based on the hour. It mismatches on hydration and causes a 0.14 CLS shift. Why does it mismatch, and what is the correct fix?
Eliminate a hydration mismatch from a client-only value
1/3A server-rendered page shows a console warning 'Text content did not match. Server: 14:32 Client: 14:33' and a timestamp briefly flickers on load. What happened and how is it fixed?
Why are RSC and SSR described as orthogonal rather than competing?
- 01What is a hydration mismatch and what are the three most common causes?
- 02Why must the server's API response data be embedded in the HTML for the first client render?
- 03How does placing a Suspense boundary around a slow widget affect streaming and hydration?
Hydration is a contract: React walks the server DOM and the client’s virtual tree in lockstep, adopting each node. When any node disagrees — because the component read Date.now(), Math.random(), window, or a locale-sensitive format during render — React discards the affected subtree and re-renders it on the client. The visible symptoms are a content flash and a CLS spike. The determinism rule: the first client render must be a pure function of the same inputs the server had. Client-only values move to useEffect so both environments produce identical DOM on the first pass. The same constraint applies to data: the server’s query snapshot must be embedded in the HTML (dehydrated cache) so the client’s first pass uses the same data without refetching. Streaming SSR with renderToPipeableStream sends the shell immediately and streams Suspense boundaries as their data resolves — boundary placement decides which content pays which latency, making it a performance design choice, not just a loading-state concern.
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