What a closure actually retains
A closure is a function plus a pointer to its Context. That Context keeps every context-allocated variable alive — including ones the closure never reads — because sibling closures share one Context. The canonical closure leak, and how to break it.
Your server’s heap climbs 40 MB an hour. The profiler points at a tiny event handler — three lines, no allocations, captures nothing big. You read it ten times and it looks innocent. The leak is not in that closure; it is in a sibling function created in the same scope, and a 50 MB buffer that the closure has no idea it is holding hostage. Two functions, one Context, one retained world.
A closure is a function plus a Context pointer
When you write a function that captures an outer variable, you’re not paying for anything magic — you’re just handing the function a pointer it will follow every time it needs that variable. In V8 a function object (a JSFunction) carries two things relevant here: a pointer to its SharedFunctionInfo (the code and ScopeInfo, shared by all instances of that function) and a pointer to its Context — the runtime scope object it was created in. That second pointer is the closure. “Closure” is not a special kind of object; it is the ordinary fact that the function holds a live reference to its defining Context.
Because the function holds the Context, the Context is reachable as long as the function is reachable. And the garbage collector frees only unreachable objects. So the lifetime of every variable stored in that Context is tied to the lifetime of the closure — even variables the closure’s body never mentions.
The trap: siblings share one Context
Here is the part that surprises people. The compiler does not create a separate Context per closure. All functions defined in the same scope capture the same Context object — the one for that scope. If two inner functions live in one scope and the scope has context-allocated variables a and b, then both functions point at the same Context holding both a and b. Keeping either function alive keeps a and b alive.
function makeHandlers() {
const big = new Array(5_000_000).fill(0); // ~40 MB, context-allocated
const small = () => 42; // captures the SAME Context as below
const reportSize = () => big.length; // this one actually uses 'big'
return small; // we return only 'small'...
}
const keep = makeHandlers();
// 'big' is STILL alive: 'small' shares the Context that holds 'big',
// because 'reportSize' (defined in the same scope) forced 'big' to be
// context-allocated. 'small' never reads 'big' — and pins it anyway.We returned small, a function that computes 42. Yet big cannot be collected. Why? reportSize references big, so the compiler marks big context-allocated and places it in the scope’s one Context. small captures that very Context. As long as keep (the returned small) is reachable, its Context is reachable, and big inside it is reachable. The 40 MB stays.
Reading the retainer in DevTools
This is exactly what a heap snapshot shows. Take a snapshot in Chrome DevTools (or node --inspect), find the big array, and look at its Retainers path. You will see it retained by a system / Context object, which is retained by the closure function. The Context is the smoking gun: when an object’s retainer is a Context you didn’t expect, a closure is holding the scope.
- Contexts per scope (not per closure)
- 1
- What a closure pins
- the whole Context
- Variables a closure can pin it never reads
- all captured siblings
- Retainer chain shown in DevTools
- obj → Context → fn
- JSFunction shares across instances
- SharedFunctionInfo
- Cost of one stray long-lived handler
- entire scope's heap
Three ways to break the retention
The fix is always to sever the path closure → Context → big:
- Null it out. After the last real use, assign
big = null. The Context slot now holdsnull; the 40 MB becomes unreachable and collectable, even though the Context (andsmall) live on. - Don’t context-allocate it. Move
biginto a narrower scope (e.g. an IIFE or a separate function) so it is not in the Context that the long-lived closure captures. If no surviving closure capturesbig, it dies with its frame. - Separate the scopes. Create the long-lived closure in a scope that simply does not contain the big variable. Build
smallin one function andbigin another; they then capture different Contexts.
All three cuts work on the same principle: if no live reference leads from a reachable closure’s Context to the big object, the GC is free to collect it. Without at least one of these, even big = undefined elsewhere does nothing — the Context slot is the retaining reference.
function makeHandlers() {
const small = () => 42; // its own scope, no big in sight
(function setup() {
const big = new Array(5_000_000).fill(0);
process(big); // used here, captured by nothing long-lived
})(); // 'big' dies when setup() returns
return small; // retains only its (tiny) Context
} Which change reliably lets the GC reclaim the big array while keeping the small long-lived closure?
Order the reachability path the GC walks that keeps the big array alive through a returned small closure.
- 1 A GC root references the returned closure (e.g. a module-level variable)
- 2 The closure holds a pointer to its defining Context
- 3 That shared Context holds a slot pointing at the big array
- 4 GC marks the big array reachable and does not free it
▸Common mistake
A subtle real-world version: a DOM event handler closes over a scope that also contains a reference to a large detached subtree or a previous render’s data. The handler is tiny and “obviously fine”, but it is registered on a long-lived element, so its Context — and everything context-allocated in that scope — outlives every render. The detached-DOM leak class is very often a shared-Context leak wearing a DOM costume.
- 01Precisely, what does a closure retain, and why is 'only what it uses' wrong?
- 02Walk through the canonical shared-Context leak.
- 03What are the three reliable fixes, and what does each do mechanically?
A closure in V8 is nothing exotic: it is a JSFunction holding a pointer to the Context of the scope where it was created, alongside its shared SharedFunctionInfo. Because the garbage collector keeps reachable objects, the closure keeps its Context alive, and the Context keeps every context-allocated variable in that scope alive. The decisive and surprising fact is that the compiler allocates one Context per scope, shared by all functions defined in it — so two sibling closures share a single Context, and a tiny returned closure pins every variable any sibling forced into that Context, including a multi-megabyte buffer it never reads. This is the canonical closure leak, and a heap snapshot exposes it as an object retained through a system / Context that is retained by the closure. The fixes all cut the path closure → Context → big object: null the variable after use, move it into a scope no surviving closure captures, or build the long-lived closure in a separate scope. The same pattern underlies many detached-DOM and per-request handler leaks — which is why this connects directly to the memory-leaks lesson in the garbage-collection unit. Now when you see a heap snapshot where a large buffer is retained by an unexpected system / Context, look for the sibling closures sharing that scope — one of them is keeping the door open.
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.