Browser & Frontend Runtime
React, Vue, and INP observability in production
Users report the search bar “feels slow” on your React dashboard. INP reports 380 ms p75. You deploy a fix and INP drops to 90 ms. You do not get paged three weeks later when another engineer’s PR reverses the improvement — because you never wired LoAF telemetry to your CI pipeline.
How React 18 schedules work
React’s scheduler runs reconciliation in cooperative chunks of 5 ms. After each chunk, it yields to the browser using MessageChannel.postMessage — the only cross-browser mechanism that queues a task without the 4 ms clamp of setTimeout. The browser’s loop gets to run input, render, and other tasks; React resumes on the next task to do the next 5 ms chunk.
This is the implementation of “concurrent React”: a single render is split across many tasks, none of which exceeds the 50 ms long-task threshold. useTransition marks a state update as low-priority, allowing input updates to interrupt it. Understand the loop and React’s scheduler stops being mysterious.
- Work chunk size
- 5 ms
- Yield mechanism
- MessageChannel.postMessage (no 4 ms clamp)
- useTransition
- marks update as interruptible by input
- Max task duration
- < 50 ms (long-task safe)
- Resumption
- next task on the event loop
Vue 3’s scheduler
Vue 3 batches reactive updates within a microtask: a write to a ref schedules a microtask that flushes all pending updates at the end of the current task. This means many writes in one task collapse into one update — but it also means the flush is a microtask and can prolong starvation if it triggers more reactive writes.
Vue exposes nextTick(callback) for code that wants to run after the flush; underneath, this is just another microtask scheduled after the flush microtask.
React 18 uses `MessageChannel.postMessage` to yield between reconciliation chunks instead of `setTimeout(fn, 0)`. Why?
A Vue 3 component writes to three refs in one synchronous block. How many DOM updates result?
Production INP root-cause pipeline
Recipe for INP root-cause in production:
Subscribe to LoAF entries with PerformanceObserver. For each entry, record the firstUIEventTimestamp, the entry’s renderStart, and the array of scripts with attribution. When INP fires for a slow interaction (also via PerformanceObserver), correlate by interaction id: find the LoAF that overlapped the input, attribute the time to the heaviest script, send to telemetry with the script URL and function name (resolved via sourcemap server-side). This pipeline turns “users are complaining about lag” into “deploy 3a4f1c regressed search input by adding a 320 ms reducer call.”
const observer = new PerformanceObserver((list) => {
for (const entry of list.getEntries()) {
if (entry.entryType === 'long-animation-frame') {
const heaviest = entry.scripts
.sort((a, b) => b.duration - a.duration)[0];
sendToTelemetry({
frameStart: entry.startTime,
frameDuration: entry.duration,
scriptUrl: heaviest?.sourceURL,
functionName: heaviest?.sourceFunctionName,
charPosition: heaviest?.sourceCharPosition,
});
}
}
});
observer.observe({ type: 'long-animation-frame', buffered: true });INP as CI gate. Production telemetry catches regressions after they reach users. A realistic gate: a synthetic Playwright/Puppeteer test in headless Chrome reproduces the critical interaction (type a query in search, open a menu, switch a tab), measures INP via the same PerformanceObserver code as in prod, and blocks merge if p75 crosses the budget. Key detail: headless Chrome on a CI runner is typically faster than a mid-range phone, so without --cpu-throttling-rate=4 (or CDP equivalent) the test passes locally and fails in prod. Bundle-size budgets add a second layer: JS size converts directly to parse+compile time, which converts to long tasks at load. Without all three layers — synthetic INP gate, bundle budget, and production LoAF alerts — a regression slips in silently and lives until the next manual profile.
A LoAF entry's `scripts` array shows a 280 ms duration attributed to `reducerRootReducer` in `bundle.js:1:94821`. What is the next step to get a file:line in the original source?
Why this works
The three-layer observability stack — synthetic CI gate, bundle budget, production LoAF alerts — is the engineering analog of the three-layer throttling stack for timers. Both problems have compounding factors that no single instrument catches. A synthetic test catches regressions before users see them but misses device diversity; production LoAF alerts catch what synthesis missed but arrive after real users are hurt; bundle budgets prevent the problem before it exists in code. Without all three, you are optimizing one layer while the others leak.
Your CI synthetic INP test passes at p75 = 120 ms. Real-user p75 INP is 480 ms. What is the most likely explanation?
- 01Explain how React 18 concurrent rendering keeps individual tasks under the 50 ms long-task threshold.
- 02Describe the three-layer INP observability stack and why all three are needed.
- 03A Vue 3 component writes to 10 refs in a loop. Will there be 10 microtask flushes or 1? What happens if the flush triggers more reactive writes?
React 18’s concurrent scheduler uses MessageChannel.postMessage to yield between 5 ms reconciliation chunks — a task-level yield with no 4 ms clamp, interleaving React work with browser input and render steps. useTransition marks updates as interruptible, allowing urgent input to cut in front of a slow reconcile. Vue 3 batches reactive updates into a single microtask flush per synchronous block via nextTick, which is efficient but can produce microtask chains if flush callbacks trigger more reactive writes. In production, INP root-cause requires three instruments working together: a LoAF PerformanceObserver that records per-script attribution; a sourcemap server that resolves script URLs and character positions to original file:line; and a CI-gated synthetic INP test with CPU throttling that enforces the budget before regressions reach real users. Without the CPU throttling, CI runners are too fast to catch regressions that only appear on mid-range phones.
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