The engine vs the loop
The engine has no event loop — the host (browser, Node via libuv) owns it. What the engine provides is the microtask queue and one operation: PerformMicrotaskCheckpoint. The host runs a task; on return the engine drains microtasks.
You have read a dozen times that “JavaScript has an event loop.” Then you open the V8 source and grep for it — and there is no event loop in there. There is a parser, an interpreter, optimising compilers, a garbage collector, and a queue of pending jobs. The loop that famously schedules your callbacks lives somewhere else entirely: in Chromium’s message loop, in Node’s libuv. The engine and the loop are two different programs.
The engine does not have an event loop
The browser overview lessons treat the event loop as one machine — browser/01-event-loop/01-loop-model is the runtime view. This unit is the engine view, and the first correction is structural: the engine has no event loop. ECMAScript, the language V8 implements, never mentions one. The spec defines jobs and a job queue, and it says hosts must eventually run queued jobs — but the algorithm that decides when and which task to run next is explicitly left to the host (via the HOST hooks HostEnqueuePromiseJob, HostCallJobCallback).
So the division of labour is:
- The host (Chromium’s message loop, Node plus libuv, Deno, Bun) owns the loop. It holds the macrotask queues (timers, I/O completions, message events), it decides which task runs next, and it drives rendering. It is the
while (true)at the top. - The engine (V8) owns one queue — the microtask queue (the ECMAScript “jobs queue”) — and exposes one operation to drain it:
PerformMicrotaskCheckpoint. It runs the JavaScript the host hands it, to completion, and on the way out it drains its own microtasks.
Together, host and engine interlock so precisely that async ordering stops feeling like folklore and starts feeling inevitable — get this split clear once and every subsequent async surprise has a mechanical explanation.
When people say “the event loop,” they mean the host loop. When they say “microtasks run after the current task,” they mean the engine’s checkpoint. Conflating the two is why async ordering feels like folklore instead of mechanism.
The shape of one turn: host calls in, engine returns, microtasks drain
A single turn of the host loop is a call into the engine and a return out of it. The host picks one macrotask (say, a fired click event or an expired timer), and calls into the engine on the associated JavaScript callback. The engine pushes a stack frame, runs your code to completion — JavaScript is run-to-completion, there is no pre-emption mid-function — and when the call stack empties, the engine performs a microtask checkpoint: it drains every queued microtask (Promise reactions, queueMicrotask jobs) until the queue is empty, including microtasks that other microtasks enqueued. Only then does control return to the host, which renders (in the browser) and picks the next macrotask.
The crucial detail: the microtask drain happens inside the single host-to-engine call, before the engine returns. From the host’s point of view, running the click handler and running every promise reaction it scheduled is one indivisible task. That is why microtasks always run before the next timer, before the next render, before the next anything: they are not a separate task the host schedules — they are the tail of the task that is already running.
Who provides the checkpoint, and who calls it
PerformMicrotaskCheckpoint is V8’s; the decision to call it is partly shared. V8 will auto-run microtasks when the JS call stack empties (the default “auto” microtask policy used by the browser). Node uses an explicit policy: libuv runs a phase, and Node calls runMicrotasks() itself at well-defined points (after each macrotask callback, and between phases) — which is why Node’s ordering has its own rules we cover next lesson. Either way, the queue and the drain are the engine’s; the cadence is the host’s.
- The while-loop / task selection
- host
- Macrotask queues (timers, I/O)
- host
- Rendering steps
- host (browser)
- Microtask queue (jobs queue)
- engine
- PerformMicrotaskCheckpoint
- engine
- When the checkpoint fires
- host policy
Run-to-completion is the load-bearing rule
Everything above rests on one engine guarantee: run-to-completion. Once the host hands the engine a callback, that callback runs start-to-finish with no other JavaScript interleaving. No second task, no microtask, nothing pre-empts it. This is what makes a for loop atomic from the program’s view and what makes await (next lessons) need an explicit suspension mechanism — the engine cannot just “pause” a function the way an OS pauses a thread, because run-to-completion forbids it. The function must return to the host, and a microtask must resume it later.
You grep the V8 source and find no event loop. Where does the loop that schedules your `setTimeout` callbacks actually live?
From the host's perspective, running a click handler plus every promise reaction it schedules counts as how many tasks?
Order what happens in one turn of the browser's host loop, starting from an expired timer, ending just before the next task is picked.
- 1 Host picks the timer macrotask and calls into the engine
- 2 Engine runs the timer callback to completion (run-to-completion)
- 3 Engine performs the microtask checkpoint, draining all queued microtasks
- 4 Engine returns control to the host with the stack empty
- 5 Host runs the rendering steps, then loops back to pick the next task
▸Why this works
Why split it this way at all? Because one engine (V8) must serve hosts with wildly different loops — a browser that must render at 60 fps, a server that must not render at all and instead juggles thousands of sockets through libuv. Putting the loop in the host lets each host schedule for its own world while reusing one language core. The engine’s contract is narrow on purpose: “give me a callback, I run it to completion and drain my jobs, then I hand you back the thread.”
- 01Precisely divide responsibilities between the engine and the host for 'the event loop'.
- 02Why do microtasks always run before the next macrotask and before rendering, with no exceptions in the browser?
- 03Run-to-completion forbids the engine from pausing a function mid-execution. What consequence does that have for async/await?
“JavaScript has an event loop” is a useful lie that hides the real architecture. The engine — V8 — has no loop; it implements the ECMAScript language, owns the microtask (jobs) queue, and exposes one operation, PerformMicrotaskCheckpoint, to drain it. The loop lives in the host: Chromium’s message loop in the browser, libuv in Node. One turn of that loop is a call into the engine and a return out of it — the host picks a macrotask, the engine runs it to completion (run-to-completion, no pre-emption), the engine drains its microtask queue including any microtasks scheduled during the drain, and only then returns, after which the browser host renders and picks the next task. The microtask drain happens inside that single call, which is why microtasks are the tail of the current task rather than a new one. The browser uses V8’s automatic microtask policy; Node uses an explicit policy where libuv and Node decide the cadence — the queue is still the engine’s, the timing is the host’s. Now when you see a microtask run “too early” or a render that never fires, you know exactly which layer to look at — the engine’s checkpoint, or the host’s loop.
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.