Inside a Promise
A Promise is a settle-once state machine holding a state, a value, and a list of PromiseReaction records. .then registers reactions and returns a new promise; settling enqueues a PromiseReactionJob per reaction. Resolving with a thenable costs an extra tick.
You write await fetchUser() and await fetchPosts() and someone asks: how many microtask ticks did that cost? Most engineers shrug. But the answer decides whether a hot async path adds one tick or four to every iteration — and at 10,000 iterations per render, that gap is the difference between a smooth list and a janky one. To count ticks, you have to know what a Promise actually is on the inside.
A Promise is three fields and a list
Strip away the API and a Promise object in V8 is small. Its essential internal slots are:
[[PromiseState]]— one ofpending,fulfilled,rejected. It startspendingand transitions exactly once. This settle-once invariant is the heart of the machine: after it leavespending, no laterresolve/rejectcan change it.[[PromiseResult]]— the value it fulfilled with or the reason it rejected with. Meaningless whilepending.[[PromiseFulfillReactions]]/[[PromiseRejectReactions]]— two lists of PromiseReaction records, the handlers registered by.then/.catchwhile the promise was still pending. Once settled, these lists are cleared and replaced by the result.
A PromiseReaction record bundles three things: the type (fulfill or reject), the handler (your onFulfilled / onRejected callback, or undefined), and the capability of the new promise that .then returned (the resolve/reject functions that will settle that downstream promise). That last part is why chaining works at all.
What .then actually does
promise.then(onF, onR) does three concrete things, in order:
- Creates a new promise (the “result capability”) and remembers its resolve/reject functions.
- Builds two PromiseReaction records — one fulfill, one reject — each wrapping the matching handler and that new capability.
- Either registers or schedules them. If the original promise is still
pending, the reactions are appended to its reaction lists and nothing runs yet. If the promise is already settled,.thendoes not run the handler synchronously — it immediately enqueues aPromiseReactionJobas a microtask for the matching reaction.
const p = Promise.resolve(42); // already fulfilled with 42
const q = p.then(v => v + 1); // q is a NEW promise; one PromiseReactionJob queued now
// q settles with 43 after that job runs (one microtask later)So .then never runs your handler “right now,” even on an already-settled promise. It always defers to a microtask. That single guarantee is what makes Promise ordering predictable: a .then callback is always one microtask removed from the settling, never synchronous.
Settling enqueues one job per reaction
When the producer calls the resolve function (settling the promise to fulfilled), the engine runs FulfillPromise: it sets [[PromiseState]] to fulfilled, stores the value, and then walks [[PromiseFulfillReactions]], enqueuing a PromiseReactionJob microtask for each registered reaction. Each job, when the microtask checkpoint runs it, calls the reaction’s handler with the result, and uses the return value to settle that reaction’s downstream promise (which may itself have reactions, cascading more jobs). Rejection is symmetric via RejectPromise and [[PromiseRejectReactions]].
This is why fan-out costs N microtasks: p.then(a); p.then(b); p.then(c) on a settled p registers three reactions and enqueues three PromiseReactionJobs — a, b, c run as three separate microtasks in registration order.
- Promise.resolve().then(fn) → fn runs
- 1 tick
- N .then on one settled promise
- N ticks
- Chain .then().then().then()
- 1 tick per link
- resolve(promise) — adopt a thenable
- +1 tick (resolve job)
- resolve(non-native thenable)
- +1 tick (thenable job)
- await nativePromise (V8 7.2+)
- 1 tick (was 3)
The extra tick: resolving with a thenable
Here is the subtlety that trips up tick-counting. If you resolve a promise with another promise (or any thenable), the engine cannot adopt its value synchronously — a thenable might settle later. So ResolvePromise schedules a PromiseResolveThenableJob: a microtask whose only purpose is to call the inner thenable’s .then to subscribe to it. That subscription is itself another deferral. The consequence: resolving promise A with promise B adds an extra microtask tick compared to resolving A with a plain value, because the engine must bounce through PromiseResolveThenableJob before A can even start adopting B’s eventual state.
// Plain value: q settles one tick after p's reaction runs.
Promise.resolve(1).then(v => v);
// Thenable: returning a promise from a handler costs an extra tick,
// because the outer promise must adopt the inner one via a resolve job.
Promise.resolve(1).then(v => Promise.resolve(v)); // extra PromiseResolveThenableJobThis is the mechanical reason the original await cost three ticks (covered next lesson): the spec wrapped the awaited value in a throwaway promise and adopted it through a thenable job. V8 7.2 (2018) special-cased native promises to skip those extra jobs.
Unhandled-rejection tracking
The engine also watches for rejections with no reject handler. When RejectPromise runs and the reject reaction list is empty (no .catch/.then(_, onR) attached), the promise is flagged as having a potentially unhandled rejection. The host is notified via HostPromiseRejectionTracker, which is what fires the browser’s unhandledrejection event and Node’s process.on('unhandledRejection'). Crucially this is deferred: a handler attached later in the same turn clears the flag (fires rejectionhandled), because attaching .catch registers a reject reaction that consumes the stored rejection. This deferral is why “add a .catch on the next line” still suppresses the warning — but a .catch attached a macrotask later does not.
What does `const q = p.then(fn)` create, and when does `fn` run if `p` is already fulfilled?
Why does resolving promise `A` with another promise `B` cost an extra microtask tick versus resolving `A` with the number 5?
Order what the engine does from calling `.then` on a still-pending promise through running the handler after the promise settles.
- 1 .then creates a new downstream promise and remembers its resolve/reject
- 2 .then builds PromiseReaction records and appends them to the pending promise's lists
- 3 The producer calls resolve(); FulfillPromise stores the value and sets state to fulfilled
- 4 FulfillPromise enqueues a PromiseReactionJob microtask for each registered reaction
- 5 The microtask checkpoint runs each job: the handler runs and settles the downstream promise
▸Why this works
Why force .then to always defer to a microtask, even when the promise is already settled? Because a function that sometimes calls its callback synchronously and sometimes asynchronously is impossible to reason about — the infamous “releasing Zalgo.” By guaranteeing the handler always runs in a later microtask, Promises give you one invariant you can build on: the code after .then(...) on the current line always runs before the handler.
- 01Describe the internal structure of a Promise and the settle-once invariant.
- 02Walk through everything .then does and explain why the handler is never synchronous.
- 03Explain the extra tick from resolving a promise with another promise, and connect it to await.
A Promise is a compact settle-once state machine. Internally it is a state slot ([[PromiseState]]: pending → fulfilled | rejected, one-way), a result slot ([[PromiseResult]]), and two lists of PromiseReaction records ([[PromiseFulfillReactions]] / [[PromiseRejectReactions]]). Each reaction bundles a type, your handler, and the resolve/reject capability of the new promise .then returned — which is why chaining composes. .then always returns a new promise and never runs your handler synchronously: on a pending promise it appends reactions; on a settled one it immediately enqueues a PromiseReactionJob microtask. Settling (FulfillPromise/RejectPromise) walks the matching list and enqueues one job per reaction, so fan-out costs N microtasks and a chain costs one tick per link. The notorious extra tick comes from resolving a promise with a thenable: the engine schedules a PromiseResolveThenableJob to subscribe to the inner promise before it can adopt its state. Unhandled-rejection tracking fires when a rejected promise has no reject reaction, but a .catch added later in the same turn clears the flag. Knowing this machinery lets you count ticks exactly. Now when you see an async path that feels slower than it should, you can count: how many .then links, how many theable adoptions, how many fan-out reactions — and know exactly where the microtask budget is going before you profile.
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.