async/await, desugared
An async function returns a promise; await suspends it, wraps the operand via PromiseResolve, and resumes via a microtask when the operand settles — a generator plus a driver. V8 7.2 (2018) removed await's extra ticks for native promises
A teammate insists “await blocks until the data comes back — that is the whole point.” So why does the server keep handling 5,000 other requests while one of them awaits a slow database call? Because await does not block anything. It suspends one function and hands the thread back. Understanding the difference — suspend, not block — is the line between someone who uses async/await and someone who can debug it under load.
async/await is a generator plus a driver
async/await is pure syntax sugar; the engine desugars it to a coroutine. An async function is, mechanically, a generator whose yield points are the awaits, paired with an automatic driver that advances the generator each time an awaited value settles. Two facts fall out immediately:
- An
async functionalways returns a promise. Calling it runs the body synchronously up to the firstawait, then returns a pending promise representing “the eventual completion of this function.” Areturn xinside fulfils that promise withx; a thrown error rejects it. await xis a suspension point. When control hitsawait x, the engine: wrapsxviaPromiseResolve(turning any value or thenable into a promise to subscribe to), registers a continuation as a reaction on that promise, and returns from the function — yielding the thread back to the host. When the awaited promise settles, the registered reaction (a microtask) resumes the function right after theawait, with the value substituted in (or rethrowing the rejection).
Because resuming is a microtask, an async function with two awaits is not one synchronous unit — it is sliced into pieces that interleave with every other pending microtask between resumptions. This is the lens for the lesson: await is a yield to a driver, and the driver runs on the microtask queue.
The history: await used to cost three ticks
The original ES2017 spec for await was wasteful. To handle the case where you await a thenable, the spec said: take the operand, create a brand-new throwaway promise, resolve that with the operand, then .then onto it to subscribe. Even when the operand was already a native promise, you paid for the throwaway promise and its thenable-adoption job. The cost, measured in microtask ticks before the function resumed, was about three ticks for await p where p is a native promise — versus one tick for the equivalent p.then(...). In a hot loop full of awaits, this tripled the microtask traffic.
// Before V8 7.2, `await p` was roughly equivalent to:
const throwaway = new Promise(resolve => resolve(p)); // adopt p — extra ticks
throwaway.then(resume); // subscribe — another tick
// ≈ 3 microtask ticks to resume, even for a native promise pV8 7.2 (2018): await ≈ p.then
V8 7.2 shipped the await optimization. When the awaited operand is a native promise (a genuine Promise, not a foreign thenable), the engine skips the throwaway-promise dance entirely and registers the resume reaction directly on the operand — exactly as p.then(resume) would. That collapses await p from ~3 ticks to 1 tick, matching hand-written .then. TC39 then changed the spec itself to match (the --harmony-await-optimization flag gated it during rollout; it is now the default and the spec behaviour). The practical upshot for seniors: since late-2018 engines, you no longer pay a tick tax for using await over .then on native promises — write whichever reads clearer. The tax only returns if you await a non-native thenable, which still needs the adoption job.
- await nativePromise (pre-7.2)
- ~3 ticks
- await nativePromise (7.2+, today)
- 1 tick
- p.then(resume) — always
- 1 tick
- await nonNativeThenable
- +adoption tick
- V8 version with the fix
- 7.2 (Oct 2018)
- Flag during rollout
- --harmony-await-optimization
Zero-cost async stack traces
The same release era brought zero-cost async stack traces. The problem: when an error surfaces three awaits deep, the synchronous call stack is long gone — each await returned to the host, so a naive trace shows only the innermost resumption with no caller chain. The old fix (kept under a flag) recorded a stack on every promise creation, which was expensive in hot paths. The zero-cost approach instead reconstructs the async frames on demand from the promise chain: V8 walks the [[PromiseFulfillReactions]] links (from lesson 3) backwards to rebuild the logical async call stack only when DevTools actually asks for it (when you hit a breakpoint or read error.stack in a debugging context). The fast path pays nothing — no per-await allocation — yet you still get a full async trace in the debugger. “Zero-cost” means zero cost when you are not debugging.
Error propagation: a rejection becomes a throw
When you wrap an await in try/catch and it actually catches the network error, you might wonder: how does an asynchronous rejection land in a synchronous catch block? Because the resume reaction is registered for both fulfilment and rejection, await converts an asynchronous rejection back into a synchronous-looking throw inside the function. When the awaited promise rejects, the engine resumes the function by throwing the rejection reason at the await expression — so a try/catch around the await catches it exactly as if a synchronous function had thrown. This is the entire ergonomic win of async/await: linear error handling over inherently non-linear control flow. The flip side is the trap from lesson 3 — an unawaited, uncaught rejected promise triggers unhandledrejection, because no reaction was registered to convert it into a catchable throw.
A Node server awaits a slow DB query inside one request handler. What happens to the 5,000 other in-flight requests during that await?
On a modern V8 (7.2+), how does the microtask tick cost of `await nativePromise` compare to `nativePromise.then(resume)`?
Order what the engine does when an async function hits `await fetchUser()` and the fetch later fulfils.
- 1 Run the function body synchronously up to the await expression
- 2 Wrap the operand via PromiseResolve and register a resume continuation on it
- 3 Return control to the host, which is free to run other tasks
- 4 When the awaited promise settles, enqueue the continuation as a microtask
- 5 The microtask runs: resume the function after the await with the value substituted in
▸Edge cases
A subtle consequence of “await = suspend via microtask”: await Promise.resolve() is a clean, idiomatic way to defer a single tick — it yields to the microtask queue and resumes after currently-pending microtasks. But it does not yield to the host (no rendering, no macrotasks run), because the resume is a microtask, not a macrotask. To actually yield to rendering you need a macrotask boundary (setTimeout, MessageChannel, scheduler.yield()) — the distinction from lesson 2 that decides whether the page can paint.
- 01Desugar async/await: what does an async function return, and what exactly does await do?
- 02Why did await once cost ~3 ticks, and what did V8 7.2 change?
- 03How do zero-cost async stack traces work, and what does 'zero-cost' mean?
async/await is syntax sugar the engine desugars into a coroutine: an async function is a generator whose awaits are yields, advanced by an automatic driver. Calling it runs synchronously to the first await and returns a pending promise (return fulfils it, throw rejects it). await x wraps x via PromiseResolve, registers a dual fulfil/reject continuation as a reaction, and returns control to the host — suspending the function, never blocking the thread, which is why one awaiting request does not stall thousands of others. On settle, the continuation runs as a microtask, resuming after the await with the value or rethrowing the rejection (so try/catch around await works, giving linear error handling over non-linear flow). Historically await cost about three microtask ticks because the spec adopted the operand through a throwaway promise; V8 7.2 (October 2018) special-cased native promises to register the resume directly, cutting await to one tick — equal to p.then — and TC39 adopted the change. The same era brought zero-cost async stack traces, which reconstruct async frames from the promise chain on demand so the fast path pays nothing. This closes the async-deep unit: from the engine having no loop, through the two queues, into the Promise state machine, and finally into the await coroutine built on top of it. Now when you see an await in a hot path, you can reason through it: one tick to resume on a native promise, the thread free between suspension and resumption, and a try/catch that will actually catch what the rejected promise threw — not folklore, mechanism.
Practice
Start at the top. Tasks go easiest → hardest: recall a fact, apply it to a case, then a senior-level stretch. Open one, attempt it, then reveal.
appears again in184
- 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
- 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
Something unclear?
Ask a question about this lesson. Questions are anonymous and go straight to the author to make the lesson better.