How V8 represents a value
Every JS value is one 64-bit machine word that is either a tagged small integer (Smi) or a pointer to a heap object. This tagged-union word is the foundation: a HeapObject's first word points to its Map, and one low tag bit decides which path the engine takes.
You write let x = 42, then x = { id: 42 }, then x = null. To you these are three different “kinds” of thing. To the slot holding x, they are all the same thing: a single 64-bit machine word. The engine has to fit a number, an object, and “nothing” into one fixed-width box — and tell them apart on every single read. The whole memory model of V8 falls out of how it does that.
One word to hold every value
A variable, an array element, an object property slot, a register inside the interpreter — all of these are exactly one machine word wide, 64 bits on a modern CPU. That uniformity is not an accident; it is what makes the engine simple and fast. A load from an array element is the same instruction whether the element is a number or an object, because the thing being loaded is always one word. The engine never has to ask “how big is this value” before moving it around.
But JavaScript values are not all the same size in principle. A small integer fits in a word trivially. An object, a string, a closure — those are arbitrarily large. So V8 plays the classic systems trick: the word is a tagged union. It holds either a value inline or a pointer to where the real value lives, and a tag tells you which interpretation applies.
There are exactly two cases:
- Smi (“Small Integer”) — a small signed integer stored directly in the word. No heap object exists; the bits of the word are the number. Reading it is free.
- HeapObject pointer — the word is the address of an object on the heap. The real value (the object’s fields, the string’s characters, the double’s 64 bits) lives at that address. Reading it costs a dereference.
The tag bit: how the engine tells them apart
The trick is alignment. Every HeapObject is allocated on an even address (aligned to at least 2 bytes, in practice 4 or 8), so a genuine pointer always has its lowest bit equal to 0. V8 exploits this: it sets the low bit of a pointer to 1 to mark “this word is a pointer”, and leaves the low bit 0 to mark “this word is a Smi”. (We will see the exact bit layout in the next two lessons — the point here is that one bit is enough to discriminate.)
So every time the engine looks at a value word, the very first thing it does is a single bit test on the low bit:
// Conceptually, every value access starts with this branch:
if ((word & 1) === 0) {
// Smi: the integer is encoded in the upper bits — use it directly
} else {
// HeapObject: mask off the tag and dereference to reach the object
}That branch is one CPU instruction. It is the price of admission for dynamic typing, and V8 has spent two decades making it cheap and predictable.
HeapObjects all start with a Map pointer
When the word is a pointer, what does it point at? Every HeapObject — an object, an array, a string, a function, a boxed number — begins its memory layout with a single word: a pointer to its Map. The Map is V8’s term for the hidden class: it describes what kind of HeapObject this is and, for plain objects, the layout of its properties (which names live at which offsets).
This is why the engine can dereference any HeapObject pointer and immediately learn its type and shape: the answer is always at offset 0.
HeapObject memory layout:
[ Map pointer ] <- offset 0: "what am I, and what's my layout"
[ field / data ] <- next word: depends on the kind
[ field / data ]
...The Map is the linchpin of the whole performance story — hidden classes, inline caches, and deopt all hang off it. We cover Maps in depth in the hidden-classes unit; here, just fix the structural fact: a value is a word; if its tag says pointer, it points at a HeapObject; and a HeapObject’s first word is its Map.
Oddballs: true, false, null, undefined, and the hole
So where do true, false, null, and undefined live? They are not Smis (they are not integers) and they are not “objects” in the JS sense. V8 represents them as Oddballs — special singleton HeapObjects. There is exactly one undefined Oddball in the whole isolate, one null, one true, one false. A variable holding undefined holds a pointer to that one shared Oddball.
There is also a hidden Oddball you never see directly: the hole (TheHole). V8 uses it as a sentinel to mark an empty array slot or an uninitialised let binding (the temporal dead zone is literally “this slot still contains the hole”). Reading the hole is what triggers a ReferenceError for a TDZ access, or a sparse-array hole check.
- Width of every value slot (64-bit)
- 1 word = 8 bytes
- Smi tag check
- 1 bit test, 0 loads
- HeapObject access
- +1 dereference
- Offset of the Map pointer
- 0 (first word)
- undefined / null / true / false
- singleton Oddballs
- Distinct undefined values per isolate
- 1 (shared)
A variable is reassigned from a number to an object. Why doesn't the slot holding it need to change size?
The engine dereferences a HeapObject pointer. What is guaranteed to be at offset 0?
Order the steps the engine takes when it reads a value word that turns out to be an object and needs to know its type.
- 1 Test the low tag bit of the value word
- 2 Tag is 1 — treat the word as a HeapObject pointer
- 3 Mask off the tag bit to get the real address
- 4 Dereference offset 0 to load the Map pointer
- 5 Read the Map to learn the object's kind and layout
▸Why this works
Why bias the pointer with the set bit instead of the Smi? Because Smi arithmetic is the hot case the engine most wants to keep cheap. Leaving the Smi tag as 0 means the integer lives in the upper bits and the engine can do integer math with minimal masking — no extra “untag” step on the common path. The pointer carries the cost of the tag instead, since it has to be masked before a dereference anyway.
- 01What are the two possible interpretations of a V8 value word, and how does the engine choose between them?
- 02What is guaranteed at offset 0 of every HeapObject, and why does it matter?
- 03How does V8 represent true, false, null, undefined, and the hole?
V8 represents every JavaScript value as a single 64-bit machine word, so that variables, array elements, property slots, and interpreter registers are all uniformly one word wide and can be moved with one instruction regardless of type. That word is a tagged union with two cases: a Smi, where the integer lives directly in the bits with the low tag bit 0, and a HeapObject pointer, where the word is an aligned heap address with the low tag bit 1. The engine begins every value access with a single bit test on the low bit; only the pointer case pays a dereference. When the word is a pointer, it reaches a HeapObject whose first word, at offset 0, is always a pointer to its Map (hidden class) — the universal header that tells the engine the object’s kind and layout. The special values true, false, null, undefined, and the internal hole are singleton Oddball HeapObjects shared across the isolate. This uniform tagged word is the foundation the next lessons build on: how Smis and doubles are encoded, how the tag bits actually lay out and compress, how the heap is organised, and how strings exploit the same scheme. Now when you see a mysterious deopt, a layout diagram in V8 internals, or a “pointer to HeapObject” in a bug report — you know exactly which one-bit decision is at the root.
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.