Frontend Architecture
LCP, prefetch, and race conditions in interactive fetching
Your user types “react” into a search box. Two fetches fire — for “reac” then “react”. The “reac” response arrives 200ms after “react” because the server happened to be slower. The UI shows “reac” results while the input shows “react”. Classic race condition.
LCP and the critical fetch
Largest Contentful Paint measures when the page’s main content element becomes visible. For a product page, the LCP element is typically the hero image or the product title. Web Vitals thresholds:
- Good: LCP under 2.5s
- Excellent: LCP under 1.5s
The single biggest LCP improvement most apps can make: move the LCP element’s data fetching from client to server. A client-fetched title adds JS-download + mount + fetch to the LCP critical path — easily 2–3x the latency of an equivalent SSR page.
Supporting signals:
fetchpriority="high"on the LCP image tells the browser to prioritise its discovery early in parsing<link rel="preload">for LCP images whose URL is known at build time push them to the browser earlier
Diagnosing a waterfall from DevTools
A real regression pattern seen in production: four sequential API calls, each starting only after the previous response:
GET /products/42 50ms → 250ms
GET /app-bundle.js 260ms → 850ms
GET /api/product/42 860ms → 1300ms (useEffect, starts after bundle)
GET /api/reviews 1310ms → 1700ms (after product)
GET /api/user 1710ms → 2000ms (after reviews)
LCP at 2050msThree antipatterns in one waterfall:
- Requests 3–5 are sequential when independent — no reason reviews and user need to wait for product response
- All three are useEffect-triggered — they wait for JS bundle download, parse, mount
- bundle.js is too large at ~590ms — code-split the LCP-critical path to under 50KB
After fix — RSC with server fetches in parallel, small interactive bundle:
GET /index.html (streaming) 50ms → 80ms TTFB
streaming chunks 80ms → 300ms LCP at ~320msRace conditions in interactive fetching
The search-as-you-type race: user types “rea” → fetch A fires. User types “react” → fetch B fires. Server is slower for fetch A. Fetch B resolves first (results for “react”), UI updates. Then fetch A resolves (results for “rea”), UI overwrites with wrong results.
Fix 1: AbortController — cancel the in-flight request when a new one starts:
let controller = new AbortController();
function search(query: string) {
controller.abort();
controller = new AbortController();
return fetch(`/api/search?q=${query}`, { signal: controller.signal });
}TanStack Query automatically passes an AbortSignal through the queryFn’s meta — queries for an old key are cancelled when the key changes.
Fix 2: Debounce — wait until the user stops typing before firing:
const debouncedQuery = useDebounce(inputValue, 300);
const { data } = useQuery({
queryKey: ['search', debouncedQuery],
queryFn: () => searchProducts(debouncedQuery),
enabled: debouncedQuery.length > 1,
});300ms delay means only one fetch fires per pause in typing.
Fix 3: queryKey versioning (TanStack Query built-in) — each response is tagged with the queryKey that produced it. The cache stores only the latest key’s data. Stale responses for old keys are discarded automatically.
Prefetch strategies
Smart fetching can start work before the user clicks:
Hover prefetch: when the cursor enters a link, start fetching the target. User typically clicks 100–300ms after hover begins — data is often done before they click.
<Link
href={`/product/${id}`}
onMouseEnter={() => queryClient.prefetchQuery({
queryKey: ['product', id],
queryFn: () => fetchProduct(id),
})}
>
View product
</Link>Viewport prefetch: as a link scrolls into view, start prefetching. Useful for the next page in an infinite scroll list.
Next.js Link default: <Link href="..."> prefetches automatically in production when in viewport. Disable with prefetch={false} if bandwidth matters.
Tradeoff: prefetching uses bandwidth speculatively. On mobile with limited data plans, over-eager prefetching is expensive. Limit to next-likely targets; avoid prefetching large media.
Pagination: cursor vs offset
Offset pagination: ?page=2&limit=20. Simple but breaks under concurrent inserts: if a new item is inserted between page 1 and page 2 fetches, items shift and the user sees a duplicate or skipped item.
Cursor pagination: ?cursor=abc123. Stable across inserts because the cursor marks a position in the dataset, not a count. TanStack Query’s useInfiniteQuery handles cursor-based natively, with getNextPageParam extracting the next cursor from each response.
Use cursor pagination for any list under churn. Offset is acceptable only for rarely-mutated, static datasets.
- LCP 'good' threshold
- under 2.5 s
- LCP 'excellent' threshold
- under 1.5 s
- Hover-to-click delay (typical)
- 100–300 ms
- Debounce for search inputs
- 200–400 ms
- Promise.all speedup at N=5
- ~5x vs sequential
A page has LCP of 4.2s. DevTools shows a staircase of 3 sequential /api fetches taking 1500ms total. What is the best first fix?
A search input fires a fetch on every keystroke. The user types 'react' and gets 'reac' results displayed. What is the best fix?
- 01What are the LCP 'good' and 'excellent' thresholds?
- 02What is a search-box race condition and how does AbortController fix it?
- 03Why is cursor pagination preferable to offset for mutable data?
LCP measures when the page’s main content element becomes visible; Web Vitals targets under 2.5s (good) and 1.5s (excellent). The largest LCP win is moving the LCP element’s data fetch from client to server, cutting 2–3 sequential trips from the critical path. Diagnosing LCP regressions: look for a staircase in the Network panel — sequential requests with the start of each matching the end of the previous. Fix: Promise.all or RSC for independent server-side fetches; AbortController or debounce for client-side interactive flows. Prefetch on hover for near-instant navigations, but limit speculative prefetching on mobile to avoid wasting data plan bandwidth.
appears again in178
- 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
- The event loop: one thread, three queuesjunior
- Tasks, microtasks, and scheduler.yield()middle
- Microtask starvation, Long Tasks, and LoAFsenior
- Node.js event loop: phases, nextTick, and loop lagsenior
- React, Vue, and INP observability in productionsenior
- The render pipeline: six stages from bytes to pixelsjunior
- Stage costs and the renderer process modelmiddle
- Invalidation, dirty bits, and containmiddle
- Compositor layers: promotion, overlap, and GPU memorymiddle
- DevTools flame strip and the frame lifecyclemiddle
- Layout thrash: forced synchronous layoutsenior
- BeginMainFrame, compositor-driven animations, and GPU memorysenior
- Production observability: LoAF, INP, and the full attack surfacesenior
- What V8 is and why performance varies 100×junior
- V8''''s four-tier JIT pipeline and profile-guided tieringmiddle
- Hidden classes, transition trees, and memory layoutmiddle
- Inline caches, IC states, and deoptimizationmiddle
- Orinoco GC: parallel scavenger, concurrent marking, and write barriersmiddle
- TurboFan''''s speculative engine and the deopt-loop trapsenior
- V8 in production: isolates, pointer compression, and real failuressenior
- Service worker lifecycle and cache strategiesmiddle
- Service worker edge cases: version skew, durability, and navigation trapssenior
- What the reconciler does: render vs commitjunior
- The fiber object and the double-buffer treemiddle
- Render phase purity and commit phase sub-stepsmiddle
- Reconciliation: diffing heuristics and the key trapmiddle
- Priority lanes, time-slicing, and useTransitionmiddle
- Bailout, memoisation, and tearingsenior
- React Profiler, the Compiler, and production observabilitysenior
- Rendering strategies: SSG, SSR, ISR, streaming, and hydrationjunior
- SSG, SSR, ISR, streaming, and RSC — how each worksmiddle
- Hydration cost: selective, progressive, islands, resumabilitymiddle
- Hydration mismatch: causes, detection, and the determinism rulesenior
- RSC, per-route strategy, and production observabilitysenior
- Core Web Vitals: what LCP, INP, and CLS measurejunior
- CLS: why layout shifts happen and how to stop themmiddle
- Metric tradeoffs, RUM attribution, and the CI+field loopsenior
- The full picture: URL to LCP to INP as a relay racejunior
- Eight layers traced: from the service worker to the second navigationmiddle
- Five canonical breaks: where production reliably diessenior
- The three-track method: reading traces and building a monitored systemsenior
- 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
- 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