Browser & Frontend Runtime
Priority lanes, time-slicing, and useTransition
You wrap a slow list filter in startTransition. Typing stays instant, the list catches up when React has spare time, and a spinner signals the wait. Without it, every keystroke triggers a 50 ms blocking render. The mechanism that makes this work is React’s priority lane system.
Priority lanes. React 18 assigns every update a lane — a priority bucket. The lane model (a bitmask of 31 lanes) lets React work on high-priority updates first and defer low-priority ones. The important tiers:
- Sync / discrete: A click, a keypress. React renders it immediately and blocking, because the user is waiting on that exact interaction.
- Default: Ordinary state updates with no transition wrapper.
- Transition: Set via
useTransitionoruseDeferredValue. Used for updates the user is not directly waiting on — filtering a big list, navigating to a new view. These can be interrupted by anything more urgent. - Idle: The lowest. Background work the app can do whenever the main thread is free.
When a keypress arrives mid-transition-render, React abandons the in-progress transition render, processes the keypress at high priority, and restarts the transition afterward.
Time-slicing: how the render phase yields. A long synchronous render blocks input — the exact failure mode the event-loop piece described. React’s scheduler breaks the render phase into slices. After about 5 ms of reconciliation work, the scheduler checks shouldYield(); if true, it stops, posts a continuation task via MessageChannel (the cross-browser way to schedule a task with no clamping), and lets the browser run input handlers and rendering. The continuation task resumes the render from the stored fiber pointer.
A 50 ms render becomes ten 5 ms slices interleaved with the browser’s own work, and input stays responsive throughout. This only applies to concurrent renders — transitions and other non-urgent updates. A synchronous-priority update (discrete input) still renders in one blocking pass, because making the user wait for a yield would defeat the purpose.
The lane bitmask. A lane is one bit in a 31-bit integer. Representing priority as a bitmask lets React do set operations in single CPU instructions: “are there any high-priority lanes pending?” is a mask-and-test; “render all lanes at or above this priority” is a bitmask comparison. Updates in compatible lanes are batched — multiple setState calls in one event handler (or, since React 18, across promises and timeouts via automatic batching) collapse into a single render. This is why you cannot read the new state synchronously right after setState: the render that applies it has not happened yet.
useTransition and useDeferredValue. These are the two hooks that put work into the transition lane. useTransition gives you a startTransition function — state updates inside it are marked low-priority and interruptible, plus an isPending flag for showing a spinner. The canonical use: a search input where the input value itself updates synchronously (so typing feels instant) but the expensive filtered-list update is wrapped in startTransition (so it yields to further keystrokes).
useDeferredValue is the same idea from the consuming side: it gives you a copy of a value that “lags behind” — React updates it at transition priority, so a component reading the deferred value re-renders only when React has spare time. Use useTransition when you own the state update; useDeferredValue when the value comes from props or context you do not control.
Keep an expensive filtered list from blocking the input
1/3React 18 assigns every update a priority bucket so it can render urgent work first and defer the rest. A keypress goes in the synchronous bucket; a big list filter wrapped in startTransition goes in a low, interruptible bucket. What does React call these priority buckets?
You wrap an expensive list update in `startTransition`. A keystroke arrives while that render is in progress. What does React do?
Which kind of update does React render in one blocking pass, with no time-slicing?
React's scheduler does about 5 ms of render work per slice. The frame budget at 60 fps is 16.67 ms. Roughly how many React render slices can fit in one frame alongside ~6 ms of browser overhead?
- 01Why does a click event render synchronously and blocking, while a startTransition update does not?
- 02How does React yield to the browser between render slices?
- 03What is the difference between useTransition and useDeferredValue?
React 18’s lane system assigns each update a priority bucket. Discrete input (clicks, keystrokes) renders in the sync lane — one blocking pass, no yield. Ordinary state updates use the default lane. Work wrapped in startTransition or read via useDeferredValue runs in the transition lane — interruptible and time-sliced. The scheduler breaks transition renders into ~5 ms slices, posts a continuation via MessageChannel between slices, and resumes from the stored fiber pointer. This is why a 50 ms list render does not drop frames: it becomes ten 5 ms slices interleaved with browser repaints and input handling. When a keystroke arrives mid-transition, React abandons the in-progress render, handles the keystroke at sync priority, and restarts the transition from scratch.
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