Browser & Frontend Runtime
Bailout, memoisation, and tearing
A component wrapped in React.memo still re-renders on every parent render. Nothing changed. The memo is there. Open the DevTools Profiler and the reason says “props changed” — but the prop is an object whose contents are identical. The problem is not the memo. The problem is an inline object literal passed as a prop: a fresh reference every render, and Object.is always reports a change.
Bailout: how React skips work. Not every component in a re-rendering subtree actually re-runs. When React reaches a fiber during render, it checks: did props change (by Object.is on each prop)? did state change? is there a pending context update this fiber consumes? If none of these is true, React bails out — it clones the fiber from the alternate, reuses the entire existing child subtree by reference, and does not call the component function at all.
This is why referential stability matters so much: a child wrapped in React.memo bails out only if its props are referentially equal. Pass it an inline {} or an arrow function as a prop and the bailout fails every render, because a fresh literal is never Object.is-equal to the last one. useMemo and useCallback exist to preserve those references so the bailout can fire.
The mental model: re-rendering a parent does not automatically re-render children — it offers them the chance to bail out, and stable references are what let them take it.
{} or () => {} as prop → new reference every render → bailout never fires even with React.memoState is stored on the fiber, not the component. A function component has no instance — it is just a function React calls. So where does useState keep its value across renders? On the fiber. Each fiber holds a linked list of hook records, one per useState/useReducer/useEffect call, in call order. React advances a cursor through that list as your component calls hooks.
This is the deep reason for the Rules of Hooks: hooks must be called unconditionally and in the same order every render, because React identifies each hook purely by its position in the call sequence, not by any name. Put a useState behind an if and on the render where the condition flips, every subsequent hook reads the wrong record. It also explains state preservation: state survives a re-render because the fiber survives; state is destroyed when the fiber is destroyed — which happens on unmount, on a type change, or on a key change.
Why this works
Why not name hooks? Hook records could be stored by name instead of position, eliminating the ordering requirement. But names would need to be unique per component, turning every hook call into a string-keyed lookup instead of a cursor advance. Position-based lookup is O(1) per hook and requires no extra runtime. The tradeoff: mandatory call order in exchange for minimal overhead per render.
Tearing and useSyncExternalStore. Interruptible rendering introduces a hazard called tearing: if an external store changes between two time-slices, the first slice’s components saw the old value and the later slice’s components see the new one, so the committed UI is internally inconsistent — “torn”. React’s own state cannot tear because React controls when it changes; external stores can, because React does not.
useSyncExternalStore fixes this: it gives React a subscribe function and a getSnapshot function. React reads the snapshot, and if it detects the snapshot changed during the concurrent render, it restarts the render, guaranteeing every component in one commit observed the same store value. Any state library integrating with React 18 (Redux, Zustand, Jotai) routes through useSyncExternalStore for this reason.
A dashboard re-renders slowly on every keystroke in an unrelated search box. The React Profiler shows almost every component on the page re-rendering, even ones whose props did not change. Where is the problem?
A component wrapped in `React.memo` still re-renders every time its parent does. Its props look unchanged. What is the most likely cause?
Why can you not read the updated state value synchronously on the line right after calling `setState`?
Which React API exists specifically to prevent 'tearing' — components in one commit observing different values of an external store during a concurrent render?
- 01A component is wrapped in React.memo but re-renders on every parent render. Walk through diagnosing and fixing it.
- 02Why must hooks be called in the same order every render?
- 03What is tearing, and how does useSyncExternalStore prevent it?
React bails out of re-running a component when Object.is finds all its props and state unchanged — it clones the fiber and skips the function call entirely. React.memo makes the bailout conditional on props; useMemo and useCallback preserve the stable references that let the bailout fire. Hooks are stored as a positional linked list on the fiber, which is why call order must be unconditional — skipping a hook misaligns the cursor for every subsequent one. State lives on the fiber, not the component function, which is why state persists across re-renders and disappears on unmount, type change, or key change. In concurrent mode, external stores can cause tearing — components in one commit seeing different values — because a store can mutate between render slices. useSyncExternalStore detects this and restarts the render, which is why every serious React state library routes through it.
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