@ttsc/unplugin 0.26.2 → 0.28.0

package/lib/core/transform.js

@@ -1,5 +1,6 @@
 'use strict';
 
+var node_child_process = require('node:child_process');
 var crypto = require('node:crypto');
 var fs = require('node:fs');
 var os = require('node:os');
@@ -8,19 +9,59 @@ var ttsc = require('ttsc');
 var pathIdentity = require('ttsc/path-identity');
 var tsconfigPaths = require('./tsconfigPaths.js');
 
+const DEFAULT_FILESYSTEM_OPERATIONS = Object.freeze({
+    exists: fs.existsSync,
+    lstat: (location) => fs.lstatSync(location, { bigint: true }),
+    readFile: (location) => fs.readFileSync(location),
+    readdir: (location) => fs.readdirSync(location, { withFileTypes: true }),
+    realpath: fs.realpathSync.native,
+    stat: fs.statSync,
+    statBigInt: (location) => fs.statSync(location, { bigint: true }),
+});
+const TRANSFORM_CACHE_FILESYSTEM = new WeakMap();
+const TRANSFORM_RESULT_FILESYSTEM = new WeakMap();
 /**
  * Caches whose owner has declared a real per-build lifecycle by calling
  * {@link beginTtscTransformBuild} before transforms begin.
  */
 const BUILD_SCOPED_TRANSFORM_CACHES = new WeakSet();
-function createHostPathIdentityContext() {
+function createHostPathIdentityContext(filesystem = DEFAULT_FILESYSTEM_OPERATIONS) {
     return pathIdentity.createFilesystemPathIdentityContext({
+        caseSensitive: filesystem.caseSensitive,
+        lstat: filesystem.lstat,
+        platform: filesystem.platform,
+        readdir: (directory) => filesystem.readdir(directory).map((entry) => entry.name),
+        realpath: filesystem.realpath,
         throwOnRealpathError: false,
     });
 }
-/** Create an empty persistent transform cache. */
-function createTtscTransformCache() {
-    return new Map();
+/** Normalize one directory entry under the owning filesystem's case policy. */
+function normalizeHostInputName(name, caseSensitive) {
+    return caseSensitive ? name : name.toLowerCase();
+}
+/** Create an empty persistent transform cache with isolated filesystem reads. */
+function createTtscTransformCache(operations = {}) {
+    const cache = new Map();
+    TRANSFORM_CACHE_FILESYSTEM.set(cache, {
+        caseSensitive: operations.caseSensitive,
+        exists: operations.exists ?? DEFAULT_FILESYSTEM_OPERATIONS.exists,
+        lstat: operations.lstat ?? DEFAULT_FILESYSTEM_OPERATIONS.lstat,
+        readFile: operations.readFile ?? DEFAULT_FILESYSTEM_OPERATIONS.readFile,
+        readdir: operations.readdir ?? DEFAULT_FILESYSTEM_OPERATIONS.readdir,
+        realpath: operations.realpath ?? DEFAULT_FILESYSTEM_OPERATIONS.realpath,
+        stat: operations.stat ?? DEFAULT_FILESYSTEM_OPERATIONS.stat,
+        statBigInt: operations.statBigInt ?? DEFAULT_FILESYSTEM_OPERATIONS.statBigInt,
+        platform: operations.platform,
+        watch: operations.watch,
+    });
+    return cache;
+}
+function transformFilesystem(cache) {
+    return ((cache === undefined ? undefined : TRANSFORM_CACHE_FILESYSTEM.get(cache)) ??
+        DEFAULT_FILESYSTEM_OPERATIONS);
+}
+function resultFilesystem(result) {
+    return (TRANSFORM_RESULT_FILESYSTEM.get(result) ?? DEFAULT_FILESYSTEM_OPERATIONS);
 }
 /**
  * Start a host build, clearing its prior generation and enabling constant-time
@@ -31,7 +72,7 @@ function createTtscTransformCache() {
  * defines one process-scoped module-loading session.
  */
 function beginTtscTransformBuild(cache) {
-    cache.clear();
+    clearTtscTransformCache(cache);
     BUILD_SCOPED_TRANSFORM_CACHES.add(cache);
 }
 /**
@@ -42,9 +83,17 @@ function beginTtscTransformBuild(cache) {
  * many edits, so that callback cannot authorize build-scoped shortcuts.
  */
 function resetTtscTransformCache(cache) {
-    cache.clear();
+    clearTtscTransformCache(cache);
     BUILD_SCOPED_TRANSFORM_CACHES.delete(cache);
 }
+/** Dispose generation-owned filesystem resources before clearing a cache. */
+function clearTtscTransformCache(cache) {
+    const generations = [...cache.values()];
+    cache.clear();
+    for (const generation of generations) {
+        void generation.then(disposeCachedTransform, () => undefined);
+    }
+}
 /**
  * Apply the ttsc plugin transform to a single source file.
  *
@@ -70,6 +119,7 @@ function resetTtscTransformCache(cache) {
  *   per build, not per compilation.
  */
 async function transformTtsc(id, source, options, aliases, cache, hooks) {
+    const filesystem = transformFilesystem(cache);
     const clean = stripQuery(id);
     if (clean.includes("\0")) {
         return undefined;
@@ -81,7 +131,7 @@ async function transformTtsc(id, source, options, aliases, cache, hooks) {
     if (pluginsAreDisabled(options.plugins)) {
         return undefined;
     }
-    const tsconfig = resolveTsconfig(file, options.project);
+    const tsconfig = resolveTsconfig(file, options.project, filesystem);
     const aliasPaths = createAliasPaths(aliases);
     const key = createTransformCacheKey({
         aliasPaths,
@@ -95,11 +145,19 @@ async function transformTtsc(id, source, options, aliases, cache, hooks) {
             // A rejected in-flight generation must not stay cached: evict it (only if
             // it is still the current entry) so a later call re-runs the transform.
             const cached = await awaitOrEvict(cache, key, transformed);
+            TRANSFORM_RESULT_FILESYSTEM.set(cached.result, filesystem);
             // While this caller awaited the old Promise, another caller may have
             // invalidated it and installed a newer authoritative generation.
             if (cache?.get(key) !== transformed) {
                 continue;
             }
+            const buildScoped = cache !== undefined && BUILD_SCOPED_TRANSFORM_CACHES.has(cache);
+            if (!buildScoped) {
+                await settleProjectMutationEvents(cached);
+                if (cache?.get(key) !== transformed) {
+                    continue;
+                }
+            }
             if (
             // A file the plugin declared volatile must never be served from the
             // cache: its output depends on non-file inputs, so the input-hash
@@ -109,7 +167,7 @@ async function transformTtsc(id, source, options, aliases, cache, hooks) {
                 projectRoot: cached.projectRoot,
                 result: cached.result,
             }) &&
-                matchesCachedSource(cached, file, source, cache !== undefined && BUILD_SCOPED_TRANSFORM_CACHES.has(cache))) {
+                matchesCachedSource(cached, file, source, buildScoped)) {
                 reportSuccessDiagnostics(cached.result);
                 // A resolved `"exception"` / `"failure"` envelope makes this throw;
                 // that is a failed generation too, so evict before surfacing it.
@@ -118,12 +176,7 @@ async function transformTtsc(id, source, options, aliases, cache, hooks) {
                     projectRoot: cached.projectRoot,
                     result: cached.result,
                 });
-                notifyWatchInputs(hooks, {
-                    file,
-                    projectRoot: cached.projectRoot,
-                    result: cached.result,
-                    temporaryTsconfig: cached.temporaryTsconfig,
-                });
+                notifyWatchInputs(hooks, cached, file);
                 markCachedSourceServed(cached, file);
                 return createTransformResult(source, code);
             }
@@ -142,7 +195,9 @@ async function transformTtsc(id, source, options, aliases, cache, hooks) {
                 compilerOptions: options.compilerOptions,
                 currentFile: file,
                 currentSource: source,
+                filesystem,
                 plugins: options.plugins,
+                trackProjectMembership: cache !== undefined,
                 tsconfig,
             });
             cache?.set(key, transformed);
@@ -152,14 +207,14 @@ async function transformTtsc(id, source, options, aliases, cache, hooks) {
         if (cache !== undefined && cache.get(key) !== generation) {
             continue;
         }
-        const { projectRoot, result, temporaryTsconfig } = cached;
+        const { projectRoot, result } = cached;
         reportSuccessDiagnostics(result);
         const code = selectOrEvict(cache, key, generation, {
             file,
             projectRoot,
             result,
         });
-        notifyWatchInputs(hooks, { file, projectRoot, result, temporaryTsconfig });
+        notifyWatchInputs(hooks, cached, file);
         markCachedSourceServed(cached, file);
         if (isVolatileFile(envelopeDerivation(cached), { file, projectRoot, result })) {
             hooks?.markVolatile?.();
@@ -209,8 +264,22 @@ function selectOrEvict(cache, key, generation, props) {
 function evictGeneration(cache, key, generation) {
     if (cache?.get(key) === generation) {
         cache.delete(key);
+        void generation.then(disposeCachedTransform, () => undefined);
     }
 }
+/** Close one generation's directory watchers exactly once. */
+function disposeCachedTransform(cached) {
+    const trackers = [
+        cached.projectMutationTracker,
+        cached.hostInputMutationTracker,
+        cached.candidateMutationTracker,
+    ];
+    cached.projectMutationTracker = undefined;
+    cached.hostInputMutationTracker = undefined;
+    cached.candidateMutationTracker = undefined;
+    for (const tracker of trackers)
+        tracker?.close();
+}
 /**
  * Derivation states keyed by the compiler result object. One result object is
  * produced by one compile against one project root, so the root captured at
@@ -224,7 +293,7 @@ function envelopeDerivation(props) {
         return existing;
     }
     const created = {
-        identityContext: createHostPathIdentityContext(),
+        identityContext: createHostPathIdentityContext(resultFilesystem(props.result)),
         identities: new Map(),
         watchInputs: new Map(),
     };
@@ -246,6 +315,10 @@ function envelopeGraphIndexes(state, props) {
         candidates: [],
         globals: [],
         configs: [],
+        members: new Set(),
+        speculative: new Set(),
+        inputProofs: new Map(),
+        inputProofConflicts: new Set(),
     };
     const graph = props.result.type === "exception" ? undefined : props.result.graph;
     if (graph !== undefined) {
@@ -255,23 +328,83 @@ function envelopeGraphIndexes(state, props) {
             }
             const absolute = path.resolve(props.projectRoot, source);
             const identity = derivationIdentity(state, absolute);
+            built.members.add(identity);
             built.spellings.set(identity, absolute);
             const entries = built.edges.get(identity) ?? [];
             entries.push(...targets
                 .filter((target) => typeof target === "string" && target.length !== 0)
-                .map((target) => path.resolve(props.projectRoot, target)));
+                .map((target) => {
+                const absoluteTarget = path.resolve(props.projectRoot, target);
+                built.members.add(derivationIdentity(state, absoluteTarget));
+                return absoluteTarget;
+            }));
             built.edges.set(identity, entries);
         }
         built.globals.push(...selectListedFiles(props.projectRoot, graph.globals));
         built.configs.push(...selectListedFiles(props.projectRoot, graph.configs));
-        for (const [source, candidates] of Object.entries(graph.candidates ?? {})) {
-            if (!Array.isArray(candidates)) {
-                continue;
-            }
+        for (const input of [...built.globals, ...built.configs]) {
+            built.members.add(derivationIdentity(state, input));
+        }
+        const candidateEntries = Object.entries(graph.candidates ?? {}).filter((entry) => Array.isArray(entry[1]));
+        // Every candidate source is an importing file the compiler read, so fold
+        // the sources in before classifying any candidate. Otherwise one entry's
+        // candidate could be classified speculative before a later entry proves
+        // the same path is a realized source.
+        for (const [source] of candidateEntries) {
+            built.members.add(derivationIdentity(state, path.resolve(props.projectRoot, source)));
+        }
+        const realized = new Set(built.members);
+        for (const [source, candidates] of candidateEntries) {
             built.candidates.push({
                 source: derivationIdentity(state, path.resolve(props.projectRoot, source)),
                 files: selectListedFiles(props.projectRoot, candidates),
             });
+            for (const candidate of candidates) {
+                if (typeof candidate !== "string" || candidate.length === 0)
+                    continue;
+                const identity = derivationIdentity(state, path.resolve(props.projectRoot, candidate));
+                // Edges, globals, configs, and every candidate source are folded in
+                // above, so a path absent from that set is one the envelope reported
+                // only as a candidate.
+                if (!realized.has(identity))
+                    built.speculative.add(identity);
+                built.members.add(identity);
+            }
+        }
+        for (const [input, hash] of Object.entries(graph.inputHashes ?? {})) {
+            if (hash !== null &&
+                (typeof hash !== "string" || !/^[0-9a-f]{64}$/.test(hash))) {
+                continue;
+            }
+            if (graph.inputRealpaths === undefined ||
+                !Object.prototype.hasOwnProperty.call(graph.inputRealpaths, input)) {
+                continue;
+            }
+            const reportedRealpath = graph.inputRealpaths[input];
+            if (reportedRealpath !== null &&
+                (typeof reportedRealpath !== "string" ||
+                    !path.isAbsolute(reportedRealpath))) {
+                continue;
+            }
+            const absolute = path.resolve(props.projectRoot, input);
+            const identity = derivationIdentity(state, absolute);
+            if (!built.members.has(identity))
+                continue;
+            const proof = {
+                hash,
+                path: absolute,
+                realpath: reportedRealpath === null ? null : path.resolve(reportedRealpath),
+            };
+            const previous = built.inputProofs.get(identity);
+            if (previous !== undefined &&
+                (previous.hash !== proof.hash ||
+                    !sameHostInputRealpath(previous.realpath, proof.realpath, state.identityContext))) {
+                built.inputProofs.delete(identity);
+                built.inputProofConflicts.add(identity);
+            }
+            else if (!built.inputProofConflicts.has(identity)) {
+                built.inputProofs.set(identity, proof);
+            }
         }
     }
     state.graph = built;
@@ -322,13 +455,29 @@ function collectDeclaredIdentities(state, projectRoot, listed) {
  * watches the module it transforms), and so is the disposed temp-dir tsconfig
  * (see {@link TtscCachedProjectTransform.temporaryTsconfig}).
  */
-function notifyWatchInputs(hooks, props) {
+function notifyWatchInputs(hooks, cached, file) {
     const addWatchFile = hooks?.addWatchFile;
     if (addWatchFile === undefined) {
         return;
     }
-    for (const input of selectWatchInputs(props)) {
-        addWatchFile(input);
+    const state = envelopeDerivation(cached);
+    const external = cached.externalInputHashes ?? {};
+    for (const input of selectWatchInputs({
+        file,
+        projectRoot: cached.projectRoot,
+        result: cached.result,
+        temporaryTsconfig: cached.temporaryTsconfig,
+    })) {
+        // Hand the adapter the identity this generation already resolved and the
+        // existence state it already recorded. Both are memoized per generation,
+        // while an adapter deriving them itself pays a `realpath`, a directory
+        // listing, and an `existsSync` per input on every delivery of every module
+        // (samchon/ttsc#1246).
+        const identity = derivationIdentity(state, input);
+        addWatchFile(input, {
+            identity,
+            missing: external[identity] === MISSING_INPUT_STATE,
+        });
     }
 }
 /**
@@ -372,29 +521,59 @@ function selectWatchInputs(props) {
 function deriveWatchInputs(state, props, fileIdentity) {
     const graph = envelopeGraphIndexes(state, props);
     const output = [];
-    const seen = new Set();
+    const physicalSeen = new Set();
+    const lexicalSeen = new Set();
     const excluded = new Set([fileIdentity]);
     if (props.temporaryTsconfig !== undefined) {
         excluded.add(derivationIdentity(state, props.temporaryTsconfig));
     }
-    for (const absolute of [
-        ...selectFileDependencies(props),
-        ...selectGraphInputs(graph, state, {
-            ...props,
-            complete: declaresCompleteDependencies(state, props) &&
-                !isVolatileFile(state, props),
-        }),
-        ...selectResolutionCandidateInputs(graph, state, props),
-    ]) {
-        const identity = derivationIdentity(state, absolute);
-        if (excluded.has(identity) || seen.has(identity)) {
-            continue;
+    const currentSpelling = path.resolve(props.file);
+    const temporarySpelling = props.temporaryTsconfig === undefined
+        ? undefined
+        : path.resolve(props.temporaryTsconfig);
+    const appendLexical = (input) => {
+        const spelling = path.resolve(input);
+        if (spelling === currentSpelling ||
+            spelling === temporarySpelling ||
+            lexicalSeen.has(spelling)) {
+            return;
         }
-        seen.add(identity);
-        output.push(absolute);
-    }
+        lexicalSeen.add(spelling);
+        physicalSeen.add(derivationIdentity(state, input));
+        output.push(input);
+    };
+    const appendPhysical = (input) => {
+        const identity = derivationIdentity(state, input);
+        if (excluded.has(identity) || physicalSeen.has(identity))
+            return;
+        physicalSeen.add(identity);
+        lexicalSeen.add(path.resolve(input));
+        output.push(input);
+    };
+    for (const input of selectFileDependencies(props))
+        appendLexical(input);
+    for (const input of selectGraphInputs(graph, state, {
+        ...props,
+        complete: declaresCompleteDependencies(state, props) &&
+            !isVolatileFile(state, props),
+    }))
+        appendPhysical(input);
+    // Resolution candidates, plugin dependencies, and universal host inputs
+    // preserve lexical aliases. Physical deduplication would collapse
+    // `alias/selection.cjs` into the selected target path, so a bundler would
+    // watch only the target and miss a symlink/junction retarget.
+    for (const input of selectResolutionCandidateInputs(graph, state, props))
+        appendLexical(input);
+    for (const input of selectHostInputs(props))
+        appendLexical(input);
     return output;
 }
+/** Return exact host-wide descriptor/config inputs for every output file. */
+function selectHostInputs(props) {
+    return props.result.type === "exception"
+        ? []
+        : selectListedFiles(props.projectRoot, props.result.hostInputs);
+}
 /**
  * Return the module-resolution paths that can supersede a currently resolved
  * module reachable from `file`. They remain host-owned even when a plugin
@@ -640,14 +819,13 @@ function createTransformResult(source, code) {
  *
  * Always compares the current module's in-memory source with the generation
  * snapshot. A cache whose owner called {@link beginTtscTransformBuild} can use
- * that comparison alone for the module's first delivery in the current build;
- * repeated requests re-hash every project and out-of-walk input. Persistent
- * caches with no guaranteed build boundary perform complete validation on every
- * hit. Any mismatch forces a complete re-transform.
- *
- * The complete validation snapshot and {@link collectInputHashes} draw their
- * keys from the exact same {@link collectProjectInputHashes} walk, so the two
- * agree on the key universe.
+ * that comparison alone for a stable generation's first module delivery in the
+ * current build. An incomplete generation may not take this shortcut: otherwise
+ * a sibling output captured during a filesystem race could still be served
+ * once. Later graph-bearing requests validate the file's derived input set and
+ * project membership; graph-free envelopes conservatively re-hash the complete
+ * project and out-of-walk snapshots. Any mismatch forces a complete
+ * re-transform.
  */
 function matchesCachedSource(cached, file, source, buildScoped) {
     const identities = envelopeDerivation(cached).identityContext;
@@ -656,201 +834,1611 @@ function matchesCachedSource(cached, file, source, buildScoped) {
         return false;
     }
     if (buildScoped &&
+        cached.projectSnapshotComplete === true &&
         !cached.servedFiles?.has(pathIdentityKey(file, identities))) {
         return true;
     }
-    const currentHashes = collectProjectInputHashes(cached.projectRoot, identities);
-    currentHashes[currentKey] = hashText(source);
-    if (!sameHashes(cached.inputHashes, currentHashes)) {
-        return false;
+    if (cached.result.type !== "exception" &&
+        cached.result.graph !== undefined &&
+        cached.projectSnapshotComplete === true &&
+        cached.projectDirectories !== undefined &&
+        cached.projectMutationTracker !== undefined &&
+        cached.hostInputMutationTracker !== undefined) {
+        const narrow = matchesNarrowPersistentInputs(cached, file);
+        if (narrow !== undefined) {
+            return narrow;
+        }
+        // Notifications stopped proving membership after this generation was
+        // produced. Losing the proof is not evidence of a change, so fall through
+        // to the snapshot the entry still carries.
     }
-    // Re-hash the out-of-walk inputs the compiler reported for this generation
-    // over exactly the recorded key universe, so an edit to a `node_modules`
-    // declaration or a monorepo sibling source invalidates the entry even in a
-    // host that never clears the cache between builds. A new out-of-walk input
-    // cannot appear without some recorded input changing first: a new reference
-    // edge requires editing an in-walk source, and a new global or config file
-    // requires a tsconfig or package manifest change, both of which the project
-    // walk above already detects.
-    const externalHashes = cached.externalInputHashes ?? {};
-    return sameHashes(externalHashes, collectExternalInputHashes(cached.externalInputPaths ?? Object.keys(externalHashes)));
+    return matchesCompleteInputSnapshot(cached, currentKey, source);
 }
-/** Record a successfully selected module as delivered by this generation. */
-function markCachedSourceServed(cached, file) {
-    (cached.servedFiles ??= new Set()).add(pathIdentityKey(file, envelopeDerivation(cached).identityContext));
+/**
+ * Validate one graph-bearing cached output against only the inputs that can
+ * affect that file. Project membership is validated once per event-loop turn,
+ * so sibling module deliveries share one directory-metadata pass instead of
+ * multiplying it by module count.
+ *
+ * Returns `undefined` when this narrow proof is unavailable — live
+ * notifications can no longer prove membership, or the generation carries no
+ * universal-input manifest. That is the absence of a proof, not evidence of a
+ * change, so the caller falls back to complete-snapshot validation instead of
+ * discarding the generation. A reported membership event, a changed universal
+ * input, or a changed derived input is evidence, and returns `false`.
+ */
+function matchesNarrowPersistentInputs(cached, file) {
+    if (reportsMembershipChange(cached)) {
+        return false;
+    }
+    if (!notificationsProveMembership(cached)) {
+        return undefined;
+    }
+    const state = envelopeDerivation(cached);
+    const hostValidation = cached.hostInputValidation;
+    if (hostValidation === undefined) {
+        return undefined;
+    }
+    if (!matchesUniversalHostInputs(cached, hostValidation)) {
+        return false;
+    }
+    const inputs = selectWatchInputs({
+        file,
+        projectRoot: cached.projectRoot,
+        result: cached.result,
+        temporaryTsconfig: cached.temporaryTsconfig,
+    });
+    for (const input of inputs) {
+        // Skip by spelling, not identity: the manifest proved this exact path, and
+        // an alias of the same physical file is a different input whose own
+        // retarget nothing else would see.
+        if (hostValidation.covered.has(path.resolve(input))) {
+            continue;
+        }
+        if (!matchesProvenInput(cached, state, input)) {
+            return false;
+        }
+    }
+    return true;
 }
 /**
- * Build the input-hash snapshot stored alongside a fresh compiler result.
+ * Validate one derived input against the generation, skipping the content read
+ * while the recorded metadata signature still holds.
  *
- * Hashes every file under the project directory (the exact universe
- * {@link matchesCachedSource} re-hashes to validate), then overlays the
- * in-memory source for the module that triggered the compile so unsaved editor
- * content is captured correctly.
+ * Sibling deliveries of one generation share most of their derived inputs, and
+ * `graph.globals` is shared by every one of them, so re-reading and re-hashing
+ * the whole derived set per delivery multiplies one generation's proven bytes
+ * by the module count. The derived set is proven the same way the universal
+ * descriptor inputs are ({@link matchesUniversalHostInputs}), under the same
+ * rules: an unchanged signature stands in for the content comparison, and any
+ * signature change falls back to the full comparison. A signature is recorded
+ * only around a read nothing raced, only for a recorded state that came from
+ * reading the input rather than from failing to, and only while the observed
+ * filesystem's own clock has provably left the stamp's tick
+ * ({@link stampSeparable}), so a same-length rewrite inside that tick cannot
+ * hide behind an unchanged signature.
  *
- * Only the project's own files are hashed. Out-of-walk program inputs the
- * compiler also read (`node_modules` declarations, sibling-package sources) are
- * deliberately excluded: the validator never reproduces those keys, so keying
- * them here would make every snapshot comparison fail and the cache never hit.
- */
-function collectInputHashes(props) {
-    const identities = createHostPathIdentityContext();
-    const hashes = collectProjectInputHashes(props.projectRoot, identities);
-    // Overlay the in-memory source so unsaved edits invalidate the cache.
-    hashes[toProjectKey(props.projectRoot, props.currentFile, identities)] =
-        hashText(props.currentSource);
-    return hashes;
+ * The signature carries the physical identity of both the lexical path and its
+ * link target ({@link inputMetadataSignature}), so retargeting a symlink or
+ * junction moves it and the skipped realpath comparison cannot be evaded.
+ */
+function matchesProvenInput(cached, state, input) {
+    const slot = inputSignatureSlot(cached, state, input);
+    if (slot === undefined) {
+        return matchesRecordedInput(cached, input);
+    }
+    if (slot.recorded === MISSING_INPUT_STATE && notifiesAbsence(cached, input)) {
+        // The generation's watcher holds this exact name, and the caller already
+        // established that neither tracker failed and neither reported a change.
+        // The path is therefore still absent, proven by the same channel that
+        // proves project membership, and probing it again would only repeat what
+        // the notification already answered.
+        return true;
+    }
+    const filesystem = resultFilesystem(cached.result);
+    const before = inputMetadataEvidence(input, filesystem);
+    if (before !== undefined && slot.signatures[slot.key] === before.signature) {
+        return true;
+    }
+    if (!matchesRecordedInput(cached, input)) {
+        return false;
+    }
+    // A recorded `missing` state is the one comparison that succeeds without
+    // reading anything: an unreadable path still reports `missing`, so its
+    // metadata can hold still while the bytes behind it appear. Only content a
+    // read produced may be stood for.
+    const after = slot.recorded === MISSING_INPUT_STATE
+        ? undefined
+        : inputMetadataSignature(input, filesystem);
+    if (after !== undefined && before?.signature === after && before.separable) {
+        slot.signatures[slot.key] = after;
+    }
+    else {
+        delete slot.signatures[slot.key];
+    }
+    return true;
 }
 /**
- * Hash every input file under `projectRoot` (the same walk universe
- * {@link matchesCachedSource} validates against), keyed by project-relative
- * slash path. Exported so hosts without a per-build boundary (`@ttsc/metro`)
- * can fold the identical input universe into their own cache fingerprints.
+ * Report whether the generation's live watcher would announce a creation at
+ * this absent input's exact spelling.
+ *
+ * Losing the watcher is not evidence of anything, so a failed tracker sends the
+ * input back to being probed by hand, exactly as a failed tracker already sends
+ * the whole generation back to complete-snapshot validation.
  */
-function collectProjectInputHashes(projectRoot, identities = createHostPathIdentityContext()) {
-    const hashes = {};
-    for (const file of listProjectInputFiles(projectRoot)) {
-        try {
-            hashes[toProjectKey(projectRoot, file, identities)] = hashText(fs.readFileSync(file));
+function notifiesAbsence(cached, input) {
+    const tracker = cached.candidateMutationTracker;
+    return (tracker !== undefined &&
+        !tracker.failed &&
+        tracker.covered?.has(path.resolve(input)) === true);
+}
+/**
+ * Locate the signature manifest that owns one recorded input, mirroring
+ * {@link matchesRecordedInput}'s own preference for the out-of-walk spelling's
+ * snapshot over the walked project's.
+ *
+ * The manifest is returned whether or not it currently holds a signature for
+ * the input, so a content comparison that succeeds can record one. Without
+ * that, an input whose capture-time metadata was too recent to prove anything
+ * would keep its content read for the whole life of the generation, since
+ * nothing else ever revisits it. Returns `undefined` only for an input the
+ * generation recorded no hash for, which no signature could stand for.
+ */
+function inputSignatureSlot(cached, state, input) {
+    const identity = derivationIdentity(state, input);
+    const external = cached.externalInputHashes ?? {};
+    if (Object.prototype.hasOwnProperty.call(external, identity)) {
+        // The recorded hash is identity-keyed because aliases of one physical file
+        // share its content; the signature is spelling-keyed because they do not
+        // share its metadata.
+        return {
+            key: path.resolve(input),
+            recorded: external[identity],
+            signatures: (cached.externalInputSignatures ??= {}),
+        };
+    }
+    const projectKey = toProjectKey(cached.projectRoot, input, state.identityContext);
+    return Object.prototype.hasOwnProperty.call(cached.inputHashes, projectKey)
+        ? {
+            key: projectKey,
+            recorded: cached.inputHashes[projectKey],
+            signatures: (cached.inputSignatures ??= {}),
         }
-        catch {
-            // File watchers may observe a transform while another process is moving
-            // or deleting files. The missing key invalidates older cache entries.
+        : undefined;
+}
+/**
+ * Validate universal descriptor/config inputs without re-reading them for every
+ * module. Existing paths use the same nanosecond metadata manifest that guards
+ * GOROOT identity memoization; missing probes are grouped by the nearest
+ * existing directory and checked through one exact membership listing.
+ */
+function matchesUniversalHostInputs(cached, validation) {
+    return (matchesUniversalHostInputEntries(cached, validation) &&
+        matchesUniversalHostInputProbes(cached, validation));
+}
+/**
+ * Validate the universal inputs that exist, by metadata first and content only
+ * when that moved.
+ *
+ * Every rejection here is evidence of a change — a vanished path, a moved
+ * physical target, a strict blocker's metadata, differing content — so this
+ * half is safe for a validation path that must never discard a generation for
+ * want of a proof.
+ */
+function matchesUniversalHostInputEntries(cached, validation) {
+    const filesystem = resultFilesystem(cached.result);
+    for (const entry of validation.entries.values()) {
+        const evidence = inputMetadataEvidence(entry.path, filesystem);
+        if (entry.signature !== undefined &&
+            evidence?.signature === entry.signature)
+            continue;
+        if (entry.strict === true)
+            return false;
+        if (hostInputRealpath(entry.path, filesystem) !== entry.realpath)
+            return false;
+        if (!matchesRecordedInput(cached, entry.path)) {
+            return false;
         }
+        if (evidence === undefined)
+            return false;
+        // Re-earn the proof under the rules the capture applies: an entry whose
+        // recorded state came from reading nothing keeps its content comparison, a
+        // write racing the read that just proved it records nothing, and a stamp
+        // the filesystem's clock has not provably left records nothing either.
+        const after = inputMetadataSignature(entry.path, filesystem);
+        entry.signature =
+            entry.readable && evidence.separable && after === evidence.signature
+                ? evidence.signature
+                : undefined;
     }
-    return hashes;
+    return true;
 }
 /**
- * Enumerate every regular file under `root`, skipping well-known output and
- * tooling directories (see {@link isIgnoredProjectDirectory}).
+ * Prove the universal inputs that were absent are still absent, through one
+ * exact listing of the nearest directory that can settle it.
  *
- * Uses an iterative DFS instead of `fs.readdirSync` recursion to avoid
- * unbounded call-stack depth on deep project trees. The result is sorted so
- * that hash comparisons are deterministic across OS-level directory orderings.
+ * Unlike the entries half, this one rejects on an inability to prove: a
+ * directory that exists but cannot be listed certifies nothing about the
+ * candidates inside it. That is the right answer for the narrow path, which has
+ * no stronger proof to fall back to, but not for the whole-snapshot path, where
+ * the recorded `missing` markers are re-compared directly and losing a proof
+ * must not cost the cache.
  */
-function listProjectInputFiles(root) {
-    const out = [];
-    const stack = [root];
-    while (stack.length !== 0) {
-        const current = stack.pop();
+function matchesUniversalHostInputProbes(cached, validation) {
+    const filesystem = resultFilesystem(cached.result);
+    for (const [directory, names] of validation.missing) {
         let entries;
         try {
-            entries = fs.readdirSync(current, { withFileTypes: true });
-        }
-        catch {
-            continue;
+            entries = filesystem.readdir(directory);
         }
-        for (const entry of entries) {
-            if (isIgnoredProjectDirectory(entry.name)) {
+        catch (error) {
+            // Only a provably absent/non-directory ancestor keeps every descendant
+            // unreachable. Permission and transient I/O failures cannot prove that
+            // a candidate is still missing, while replacing the proving directory
+            // with an exact file can itself redirect module resolution.
+            try {
+                if (!filesystem.stat(directory).isDirectory())
+                    return false;
+            }
+            catch (statError) {
+                if (!isMissingPathError(statError))
+                    return false;
                 continue;
             }
-            const file = path.join(current, entry.name);
-            if (entry.isDirectory()) {
-                stack.push(file);
+            return false;
+        }
+        const identities = envelopeDerivation(cached).identityContext;
+        const caseSensitive = identities.caseSensitive(directory);
+        if (entries.some((entry) => names.has(normalizeHostInputName(entry.name, caseSensitive)))) {
+            return false;
+        }
+    }
+    return true;
+}
+/** True only for errors that prove a path cannot currently be traversed. */
+function isMissingPathError(error) {
+    const code = error?.code;
+    return code === "ENOENT" || code === "ENOTDIR";
+}
+/** Capture the universal-input manifest while the generation is still fresh. */
+function captureUniversalHostInputValidation(cached, currentFile) {
+    const filesystem = resultFilesystem(cached.result);
+    const state = envelopeDerivation(cached);
+    const validation = {
+        entries: new Map(),
+        covered: new Set(),
+        missing: new Map(),
+    };
+    for (const input of selectPersistentHostInputs({
+        filesystem,
+        projectRoot: cached.projectRoot,
+        result: cached.result,
+        temporaryTsconfig: cached.temporaryTsconfig,
+    })) {
+        const generationHashes = cached.result.type === "exception"
+            ? undefined
+            : cached.result.hostInputHashes;
+        const generationRealpaths = cached.result.type === "exception"
+            ? undefined
+            : cached.result.hostInputRealpaths;
+        const expected = generationHashes?.[path.resolve(input)];
+        // Every persistent universal input must carry an evaluation-time
+        // fingerprint. If a plugin/native host cannot provide one, keep the fresh
+        // result but decline narrow long-lived reuse.
+        let readable = false;
+        if (expected === undefined) {
+            const current = path.resolve(currentFile);
+            if (path.resolve(input) !== current)
+                return undefined;
+            // The current module may be supplied from an unsaved editor buffer. Its
+            // generation snapshot is overlaid below from `currentSource`, so a disk
+            // fingerprint would be both unavailable and the wrong authority. The
+            // recorded state is the bundler's, so a signature of the disk cannot
+            // stand for it however readable that disk is.
+        }
+        else {
+            const current = hostInputStateHash(input, filesystem);
+            if (expected !== current) {
+                return undefined;
             }
-            else if (entry.isFile()) {
-                out.push(file);
+            // A path both sides agree they could not read carries no bytes for a
+            // signature to stand for. It still belongs in the manifest, so the
+            // content comparison keeps running for it on every delivery.
+            readable = current !== null;
+        }
+        const absoluteInput = path.resolve(input);
+        if (generationRealpaths !== undefined) {
+            if (!Object.prototype.hasOwnProperty.call(generationRealpaths, absoluteInput) ||
+                !sameHostInputRealpath(generationRealpaths[absoluteInput], hostInputRealpath(input, filesystem), state.identityContext)) {
+                return undefined;
             }
         }
+        validation.covered.add(path.resolve(input));
+        const before = inputMetadataEvidence(input, filesystem);
+        if (!matchesRecordedInput(cached, input))
+            return undefined;
+        const after = inputMetadataSignature(input, filesystem);
+        if (before?.signature !== after)
+            return undefined;
+        if (before !== undefined) {
+            // Do not key this manifest by physical identity. A symlink/junction
+            // spelling and its selected target deliberately share that identity,
+            // but both lexical paths must survive so retargeting the alias is visible.
+            validation.entries.set(path.resolve(input), {
+                path: input,
+                readable,
+                realpath: hostInputRealpath(input, filesystem),
+                // The signature stands in for content only when the read produced the
+                // recorded bytes and the filesystem's clock has provably left the
+                // stamp's tick; otherwise the content comparison keeps running until
+                // the re-earn path can prove both.
+                signature: readable && before.separable ? before.signature : undefined,
+            });
+            continue;
+        }
+        const probe = missingPathProbe(input, filesystem);
+        if (probe.blocker !== undefined) {
+            const signature = inputMetadataSignature(probe.blocker, filesystem);
+            if (signature === undefined)
+                return undefined;
+            // A blocker proves a kind and an identity, not content: it is the
+            // non-directory ancestor that makes everything below it unreachable, and
+            // it cannot stop being that without its metadata moving. So it keeps a
+            // usable signature whether or not anything read it, and exempt from the
+            // clock-separability rule content signatures need — a same-tick rewrite
+            // of its bytes leaves it exactly as blocking as before.
+            validation.covered.add(path.resolve(probe.blocker));
+            validation.entries.set(path.resolve(probe.blocker), {
+                path: probe.blocker,
+                readable: true,
+                realpath: hostInputRealpath(probe.blocker, filesystem),
+                signature,
+                strict: true,
+            });
+            continue;
+        }
+        // The probe below proves this exact spelling absent, so the per-module loop
+        // need not re-derive it either.
+        let names = validation.missing.get(probe.directory);
+        if (names === undefined) {
+            names = new Set();
+            validation.missing.set(probe.directory, names);
+        }
+        names.add(normalizeHostInputName(probe.name, state.identityContext.caseSensitive(probe.directory)));
     }
-    out.sort();
-    return out;
+    cached.hostInputValidation = validation;
+    return validation;
 }
 /**
- * Report whether an absolute `file` belongs to the project walk universe of
- * `root`: it lies under `root`, every component exists without traversing a
- * symbolic link, the leaf is a regular file, and no segment of the relative
- * path is ignored. The predicate mirrors {@link listProjectInputFiles} exactly,
- * so "walk-visible" here means "hashed by {@link collectProjectInputHashes}".
- * Missing paths and files reached through symlinks or Windows junctions are
- * out-of-walk inputs that only the reference graph can prove relevant.
+ * The recorded state of an input the generation read nothing from: absent, or
+ * present but unreadable. It is deliberately not a hash, so no signature may
+ * stand in for it: the metadata of an unreadable path holds still while the
+ * bytes behind it appear.
+ *
+ * A directory is not this state. It records the hash of a marker instead, which
+ * a signature may stand for, because the mode both halves of the signature
+ * carry cannot change without the path ceasing to be that directory.
  */
-function isProjectWalkPath(root, file, identities = createHostPathIdentityContext()) {
-    if (!identities.isWithin(root, file)) {
-        return false;
+const MISSING_INPUT_STATE = "missing";
+/**
+ * The highest stamp each observed filesystem clock has provably minted, keyed
+ * by the operations object that observes it and, inside, by reporting device.
+ *
+ * A filesystem stamps a write once per clock tick, so two same-length writes
+ * inside one tick are indistinguishable by metadata alone. A signature may
+ * therefore stand for content only while a later write is guaranteed to move
+ * it, and that guarantee needs a reference instant the observed filesystem
+ * itself produced: once some stamp on the same device is strictly newer than an
+ * input's modification stamp, that input's tick is provably over, so any later
+ * write must mint a newer stamp and move the signature. That is git's
+ * racily-clean index rule, adapted to a read-only contract: where git compares
+ * entries against the index file's own timestamp, this floor accumulates every
+ * stamp the cache-owned operations report, seeded per generation by
+ * {@link mintFilesystemClockReference}.
+ *
+ * The process clock never participates: both sides of every comparison are
+ * stamps the same filesystem clock minted, at the same granularity, so a
+ * filesystem clock running behind (or ahead of) the host process changes
+ * nothing.
+ *
+ * Accumulating observed stamps is deliberately weaker than git's own reference,
+ * which is a single stamp git minted itself. A stamp this floor accepts may
+ * instead have been _set_ rather than minted, and a set stamp is dangerous only
+ * when it lands in the future: the floor is a maximum, so a restored past stamp
+ * never raises it. One future-dated file — a stamp-preserving extraction or
+ * copy from a machine whose clock ran ahead — pushes its device's floor past
+ * the present and reopens the same-tick window for every other input on that
+ * device until the clock catches up. A clock that jumps backwards strands the
+ * floor above the present the same way, a different hazard from the constant
+ * offset the paragraph above is about: an offset moves both operands together
+ * and changes nothing, a jump moves only the present.
+ *
+ * The minted probe is not enough on its own to replace observed stamps: it
+ * lands on the scratch volume, which is frequently not the inputs' volume (a
+ * project on `D:` with `TEMP` on `C:`), and a probe-only floor would then
+ * decline every _content_ signature, so every input carrying bytes would be
+ * re-read on every delivery. A strict blocker keeps its signature either way,
+ * because it proves a kind rather than content. Observed stamps keep the common
+ * case working; the probe covers the case they cannot, a tree whose files were
+ * all written inside one tick.
+ */
+const FILESYSTEM_CLOCK_FLOORS = new WeakMap();
+/** Return one observed filesystem's per-device clock floor, creating it. */
+function filesystemClockFloors(filesystem) {
+    let floors = FILESYSTEM_CLOCK_FLOORS.get(filesystem);
+    if (floors === undefined) {
+        floors = new Map();
+        FILESYSTEM_CLOCK_FLOORS.set(filesystem, floors);
+    }
+    return floors;
+}
+/** Raise a device's clock floor with the stamps one observation reported. */
+function observeFilesystemClock(filesystem, stats) {
+    const floors = filesystemClockFloors(filesystem);
+    const stamp = stats.mtimeNs > stats.ctimeNs ? stats.mtimeNs : stats.ctimeNs;
+    const current = floors.get(stats.dev);
+    if (current === undefined || stamp > current) {
+        floors.set(stats.dev, stamp);
     }
-    const rootKey = pathIdentityKey(root, identities);
-    const fileKey = pathIdentityKey(file, identities);
-    const relative = fileKey.slice(rootKey.length).replace(/^[/\\]+/, "");
-    if (relative.length === 0 ||
-        relative === ".." ||
-        relative.startsWith(`..${path.sep}`) ||
-        path.isAbsolute(relative)) {
-        return false;
+}
+/**
+ * Report whether a later write to the observed path is guaranteed to move its
+ * modification stamp: the device's clock floor holds a stamp strictly newer, so
+ * the tick that minted the stamp is provably over. The floor was observed
+ * before the caller's content read began, which is the ordering the guarantee
+ * needs — a stamp minted before the read proves every post-read write lands in
+ * a newer tick.
+ */
+function stampSeparable(filesystem, stats) {
+    const floor = filesystemClockFloors(filesystem).get(stats.dev);
+    return floor !== undefined && stats.mtimeNs < floor;
+}
+/**
+ * Mint a reference instant for this generation and feed it into the observed
+ * filesystem's clock floor.
+ *
+ * The scratch directory is a write the adapter already owns, deliberately
+ * outside the project root, so stamping a probe file there produces a
+ * freshly-minted "now" without touching the user's project — the analogue of
+ * git writing its index. The probe is observed through the cache-owned
+ * operations and keyed by the device those operations report, so it only ever
+ * separates stamps on the filesystem that actually minted it; when the scratch
+ * volume differs from the inputs' volume, or the observed filesystem cannot see
+ * the probe at all, nothing is proven and signature recording simply stays
+ * declined until passively observed stamps separate an input on their own.
+ *
+ * Relocating the scratch directory onto the inputs' volume would make the probe
+ * universal, but it would also move every compiler and plugin temporary write
+ * into the project's parent (frequently a monorepo root or a home directory)
+ * for those layouts. That is a product decision about where ttsc writes, not a
+ * property of this rule, so the cross-volume case degrades to more reads here
+ * rather than being bought with it.
+ */
+function mintFilesystemClockReference(scratchDirectory, filesystem) {
+    try {
+        const probe = path.join(scratchDirectory, "clock-reference");
+        fs.writeFileSync(probe, "");
+        observeFilesystemClock(filesystem, filesystem.lstat(probe));
     }
-    const segments = relative.split(path.sep);
-    if (segments.some(isIgnoredProjectDirectory)) {
-        return false;
+    catch {
+        // The absence of a reference declines signature recording; it never
+        // invalidates a generation.
     }
-    let current = path.resolve(root);
-    for (let index = 0; index < segments.length; ++index) {
-        current = path.join(current, segments[index]);
-        let stats;
+}
+/** Metadata identity whose stability lets a generation reuse a content hash. */
+function inputMetadataSignature(file, filesystem = DEFAULT_FILESYSTEM_OPERATIONS) {
+    return inputMetadataEvidence(file, filesystem)?.signature;
+}
+/** Observe one input's metadata signature and its clock separability. */
+function inputMetadataEvidence(file, filesystem = DEFAULT_FILESYSTEM_OPERATIONS) {
+    try {
+        const link = filesystem.lstat(file);
+        observeFilesystemClock(filesystem, link);
+        let target = link;
+        if (link.isSymbolicLink()) {
+            try {
+                target = filesystem.statBigInt(file);
+                observeFilesystemClock(filesystem, target);
+            }
+            catch {
+                // Keep a broken link in the existing-input manifest. Its own metadata
+                // stays stable while the target is missing, and the first successful
+                // stat after the target appears changes this signature. Treating it as
+                // a plain missing path would watch/list only the link's parent, which
+                // cannot observe a target created in another directory. It carries no
+                // readable bytes, so it never needs to be separable.
+                return {
+                    signature: [
+                        link.dev,
+                        link.ino,
+                        link.mode,
+                        link.size,
+                        link.mtimeNs,
+                        link.ctimeNs,
+                        "missing-target",
+                    ].join(":"),
+                    separable: false,
+                };
+            }
+        }
+        return {
+            signature: [
+                link.dev,
+                link.ino,
+                link.mode,
+                link.size,
+                link.mtimeNs,
+                link.ctimeNs,
+                target.dev,
+                target.ino,
+                target.mode,
+                target.size,
+                target.mtimeNs,
+                target.ctimeNs,
+            ].join(":"),
+            // Both halves must be separable: a write remints the target's stamp, a
+            // link retarget the link's own, and either one hiding inside its recorded
+            // tick would evade the skipped content and realpath comparisons.
+            separable: stampSeparable(filesystem, link) && stampSeparable(filesystem, target),
+        };
+    }
+    catch {
+        return undefined;
+    }
+}
+/** Content/kind fingerprint matching the compiler host-input contract. */
+function hostInputStateHash(file, filesystem = DEFAULT_FILESYSTEM_OPERATIONS) {
+    try {
+        return hashText(filesystem.readFile(file));
+    }
+    catch {
         try {
-            stats = fs.lstatSync(current);
+            return filesystem.stat(file).isDirectory()
+                ? hashText("ttsc:host-input:directory\0")
+                : null;
         }
         catch {
-            return false;
-        }
-        if (stats.isSymbolicLink()) {
-            return false;
-        }
-        const leaf = index === segments.length - 1;
-        if ((leaf && !stats.isFile()) || (!leaf && !stats.isDirectory())) {
-            return false;
+            return null;
         }
     }
-    return true;
 }
-/**
- * Hash a list of absolute out-of-walk input paths: content SHA-256 for a
- * readable file, a stable `missing` marker otherwise. Keys use filesystem
- * identity so case-only spellings share one snapshot entry, while reads retain
- * the original path supplied by the compiler. The marker is state, not an error
- * — a recorded input disappearing (or reappearing) must change the comparison
- * exactly like a content edit. Exported so `@ttsc/metro` can re-hash its
- * recorded snapshot with identical semantics at cache-key time.
- */
-function collectExternalInputHashes(paths) {
-    const hashes = {};
-    const identities = createHostPathIdentityContext();
-    for (const file of paths) {
-        const identity = pathIdentityKey(file, identities);
-        if (identity in hashes) {
-            continue;
+/** Fingerprint the text/kind state returned by TypeScript-Go's filesystem. */
+function graphInputStateHash(file, filesystem = DEFAULT_FILESYSTEM_OPERATIONS) {
+    try {
+        const bytes = filesystem.readFile(file);
+        if (bytes.length >= 2 && bytes[0] === 0xff && bytes[1] === 0xfe) {
+            const even = bytes.subarray(2, 2 + Math.floor((bytes.length - 2) / 2) * 2);
+            return hashText(Buffer.from(even.toString("utf16le"), "utf8"));
+        }
+        if (bytes.length >= 2 && bytes[0] === 0xfe && bytes[1] === 0xff) {
+            const even = Buffer.from(bytes.subarray(2, 2 + Math.floor((bytes.length - 2) / 2) * 2));
+            even.swap16();
+            return hashText(Buffer.from(even.toString("utf16le"), "utf8"));
         }
+        const content = bytes.length >= 3 &&
+            bytes[0] === 0xef &&
+            bytes[1] === 0xbb &&
+            bytes[2] === 0xbf
+            ? bytes.subarray(3)
+            : bytes;
+        return hashText(content);
+    }
+    catch {
         try {
-            hashes[identity] = hashText(fs.readFileSync(file));
+            return filesystem.stat(file).isDirectory()
+                ? hashText("ttsc:host-input:directory\0")
+                : null;
         }
         catch {
-            hashes[identity] = "missing";
+            return null;
         }
     }
-    return hashes;
+}
+/** Physical target selected by a lexical host-input path. */
+function hostInputRealpath(file, filesystem = DEFAULT_FILESYSTEM_OPERATIONS) {
+    try {
+        return filesystem.realpath(file);
+    }
+    catch {
+        return null;
+    }
+}
+/** Compare two reported realpaths by filesystem identity, not Windows spelling. */
+function sameHostInputRealpath(left, right, identities) {
+    if (left === undefined || (left === null) !== (right === null))
+        return false;
+    if (left === null || right === null)
+        return true;
+    return (pathIdentityKey(left, identities) === pathIdentityKey(right, identities));
+}
+/** Find one directory listing that proves an absent path is still absent. */
+function missingPathProbe(file, filesystem = DEFAULT_FILESYSTEM_OPERATIONS) {
+    let child = path.resolve(file);
+    for (;;) {
+        const directory = path.dirname(child);
+        try {
+            const stats = filesystem.stat(directory);
+            if (stats.isDirectory()) {
+                return { directory, name: path.basename(child) };
+            }
+            return {
+                blocker: directory,
+                directory: path.dirname(directory),
+                name: path.basename(directory),
+            };
+        }
+        catch { }
+        if (directory === child) {
+            return { directory, name: path.basename(child) };
+        }
+        child = directory;
+    }
 }
 /**
- * Derive the absolute out-of-walk input set of a whole project transform: the
- * union of every reference-graph member (edge keys and targets, globals, the
- * config chain) and every plugin-reported dependency, minus everything the
- * project walk already hashes and the disposed temp-dir tsconfig. These are the
- * inputs {@link matchesCachedSource}'s walk cannot see. Resolution candidates
- * that are still missing remain in this set even under the project root: the
- * first walk cannot hash a file that has not been created yet.
+ * Prove one generation from its own recorded snapshot, with no help from live
+ * notifications.
  *
- * A `dependenciesComplete` declaration deliberately does not narrow this set,
- * unlike the per-file watch derivation. This cache replays one whole envelope,
- * so its validity condition is the union over every file the envelope carries
- * rather than one file's inputs; a miss here costs a re-transform, never a
- * stale output; and it is the layer that re-runs the plugin's analysis, which
- * is how a widened declaration is ever learned. The narrowing that matters
- * lands at the bundler boundary through {@link selectWatchInputs}, which is what
- * feeds persistent caches and watch graphs.
+ * This is the fallback for a graph-free envelope and for a generation whose
+ * watchers could not be opened or have since failed: losing the notification
+ * proof must cost the narrow path, not the cache. The walk re-proves membership
+ * directly — the recorded directory signatures plus the recorded file-key
+ * universe — so a created, deleted, or renamed input still invalidates without
+ * any watcher.
  */
-function selectExternalInputPaths(props) {
-    if (props.result.type === "exception") {
-        return [];
+function matchesCompleteInputSnapshot(cached, currentKey, source) {
+    if (cached.projectSnapshotComplete !== true ||
+        cached.projectDirectories === undefined) {
+        return false;
+    }
+    // Universal descriptor/config inputs carry a physical-identity proof that no
+    // content comparison can replace: retargeting a symlinked input to a
+    // byte-identical file selects a different file, and its own transitive
+    // requires with it. Only the graph half of the out-of-walk snapshot records
+    // realpaths, so without this the fallback would quietly hold a lower standard
+    // than the narrow path it stands in for.
+    const state = envelopeDerivation(cached);
+    const hostValidation = cached.hostInputValidation;
+    if (hostValidation === undefined ||
+        !matchesUniversalHostInputEntries(cached, hostValidation)) {
+        return false;
+    }
+    const declaredInputs = declaredProjectInputKeys(state, cached);
+    const current = collectProjectInputSnapshot(cached.projectRoot, state.identityContext, resultFilesystem(cached.result), cached.inputSignatures === undefined
+        ? undefined
+        : { hashes: cached.inputHashes, signatures: cached.inputSignatures });
+    if (!walkSnapshotComplete(current, declaredInputs)) {
+        return false;
+    }
+    if (!sameProjectDirectories(cached.projectDirectories, current.projectDirectories)) {
+        return false;
+    }
+    current.hashes[currentKey] = hashText(source);
+    if (!sameHashes(cached.inputHashes, current.hashes, declaredInputs)) {
+        return false;
+    }
+    // Re-hash the out-of-walk inputs the compiler reported for this generation
+    // over exactly the recorded key universe, so an edit to a `node_modules`
+    // declaration or a monorepo sibling source invalidates the entry even in a
+    // host that never clears the cache between builds. A new out-of-walk input
+    // cannot appear without some recorded input changing first: a new reference
+    // edge requires editing an in-walk source, and a new global or config file
+    // requires a tsconfig or package manifest change, both of which the project
+    // walk above already detects.
+    const externalCurrent = matchesCachedExternalInputs(cached);
+    if (!externalCurrent.matches || !matchesExternalInputRealpaths(cached)) {
+        return false;
+    }
+    adoptProvenSignatures(cached, {
+        currentKey,
+        external: externalCurrent.signatures,
+        project: current.provenSignatures,
+    });
+    return true;
+}
+/**
+ * Adopt the signatures captured while this walk proved every recorded input
+ * still carries its recorded content.
+ *
+ * Without this, a metadata-only change — a touch, or a rewrite of identical
+ * bytes — costs a re-read on every later delivery for the rest of the
+ * generation's life, because the recorded signature can never match again. The
+ * narrow path self-heals through {@link matchesProvenInput}; this is the same
+ * refresh for the path that proves the whole snapshot at once.
+ *
+ * The delivered file is the single exclusion: its recorded hash is the source
+ * the bundler supplied, so the disk bytes this walk read for it were compared
+ * against nothing.
+ */
+function adoptProvenSignatures(cached, proven) {
+    const projectSignatures = (cached.inputSignatures ??= {});
+    for (const [key, signature] of Object.entries(proven.project)) {
+        if (key === proven.currentKey)
+            continue;
+        projectSignatures[key] = signature;
+    }
+    const externalSignatures = (cached.externalInputSignatures ??= {});
+    for (const [spelling, signature] of Object.entries(proven.external)) {
+        externalSignatures[spelling] = signature;
+    }
+}
+/** Re-check graph-owned physical identities in complete-snapshot fallback. */
+function matchesExternalInputRealpaths(cached) {
+    const expected = cached.externalInputRealpaths;
+    if (expected === undefined || Object.keys(expected).length === 0)
+        return true;
+    const state = envelopeDerivation(cached);
+    const filesystem = resultFilesystem(cached.result);
+    for (const input of cached.externalInputPaths ?? []) {
+        const identity = derivationIdentity(state, input);
+        if (!Object.prototype.hasOwnProperty.call(expected, identity))
+            continue;
+        if (!sameHostInputRealpath(expected[identity], hostInputRealpath(input, filesystem), state.identityContext)) {
+            return false;
+        }
+    }
+    return true;
+}
+/**
+ * Capture external-input hashes without attaching post-compile state to an
+ * earlier graph. Graph members must carry compiler-time proof and still match
+ * it now; plugin-declared dependency-only paths retain the historical
+ * post-compile snapshot because their own protocol does not claim generation
+ * fingerprints.
+ */
+function captureExternalInputSnapshot(cached, paths) {
+    const state = envelopeDerivation(cached);
+    const filesystem = resultFilesystem(cached.result);
+    const graph = envelopeGraphIndexes(state, cached);
+    const hashes = {};
+    const realpaths = {};
+    const signatures = {};
+    let complete = true;
+    // Sandwich every read between two metadata signatures. Only a signature that
+    // survived its own read, and whose stamp's tick the filesystem's clock has
+    // provably left ({@link stampSeparable}), may stand in for the content
+    // comparison; a write racing the capture, or a stamp a same-tick rewrite
+    // could still reproduce, leaves the input without one, so revalidation keeps
+    // re-reading it.
+    const record = (input, before, after) => {
+        if (after !== undefined && before?.signature === after && before.separable)
+            signatures[path.resolve(input)] = after;
+    };
+    for (const input of paths) {
+        const identity = derivationIdentity(state, input);
+        // A member the envelope reported only as a resolution candidate falls
+        // through to the recorded-state branch below, the same evidence a
+        // plugin-declared dependency path carries. Its absence still invalidates
+        // the generation when it appears, because `missing` is recorded state.
+        const speculativeOnly = graph.speculative.has(identity) &&
+            !graph.inputProofs.has(identity) &&
+            !graph.inputProofConflicts.has(identity);
+        if (graph.members.has(identity) && !speculativeOnly) {
+            const proof = graph.inputProofs.get(identity);
+            if (proof === undefined || graph.inputProofConflicts.has(identity)) {
+                complete = false;
+                continue;
+            }
+            const before = inputMetadataEvidence(input, filesystem);
+            const currentHash = graphInputStateHash(input, filesystem);
+            const after = inputMetadataSignature(input, filesystem);
+            if (currentHash !== proof.hash ||
+                !sameHostInputRealpath(proof.realpath, hostInputRealpath(input, filesystem), state.identityContext)) {
+                complete = false;
+            }
+            else if (currentHash !== null) {
+                // The recorded hash is the compiler's own proof, so a signature may
+                // only stand for it once the current bytes were shown to match it.
+                // A path with no readable content has no bytes to stand for: it can
+                // hold stable metadata while becoming readable, so it keeps the read.
+                record(input, before, after);
+            }
+            hashes[identity] = proof.hash ?? MISSING_INPUT_STATE;
+            realpaths[identity] = proof.realpath;
+            continue;
+        }
+        const before = inputMetadataEvidence(input, filesystem);
+        const hash = hostInputStateHash(input, filesystem);
+        const after = inputMetadataSignature(input, filesystem);
+        hashes[identity] = hash ?? MISSING_INPUT_STATE;
+        if (hash !== null)
+            record(input, before, after);
+    }
+    return { complete, hashes, realpaths, signatures };
+}
+/** Verify every graph member still has the state read by the compiler. */
+function matchesCompilerGraphInputProofs(cached) {
+    if (cached.result.type === "exception" ||
+        cached.result.graph === undefined ||
+        (cached.result.graph.inputHashes === undefined &&
+            cached.result.graph.inputRealpaths === undefined)) {
+        // Legacy sidecars remain compatible for ordinary in-project graphs. Their
+        // out-of-walk members are still rejected by captureExternalInputSnapshot,
+        // where a post-compile snapshot cannot prove the compiler's generation.
+        return true;
+    }
+    const state = envelopeDerivation(cached);
+    const filesystem = resultFilesystem(cached.result);
+    const graph = envelopeGraphIndexes(state, cached);
+    if (graph.inputProofConflicts.size !== 0) {
+        return false;
+    }
+    for (const identity of graph.members) {
+        const proof = graph.inputProofs.get(identity);
+        // A speculative candidate has no compile-time read to prove. Requiring one
+        // would void every generation of every project whose resolution passes over
+        // a higher-priority spelling, which is every project with a dependency
+        // typed by a declaration file (samchon/ttsc#1245). It is validated instead
+        // against the state {@link captureExternalInputSnapshot} recorded for it.
+        if (proof === undefined && graph.speculative.has(identity)) {
+            continue;
+        }
+        if (proof === undefined ||
+            graphInputStateHash(proof.path, filesystem) !== proof.hash ||
+            !sameHostInputRealpath(proof.realpath, hostInputRealpath(proof.path, filesystem), state.identityContext)) {
+            return false;
+        }
+    }
+    return true;
+}
+/** Compare one derived input with the snapshot that owned it at generation. */
+function matchesRecordedInput(cached, input) {
+    const state = envelopeDerivation(cached);
+    const filesystem = resultFilesystem(cached.result);
+    const projectKey = toProjectKey(cached.projectRoot, input, state.identityContext);
+    const projectHash = Object.prototype.hasOwnProperty.call(cached.inputHashes, projectKey)
+        ? cached.inputHashes[projectKey]
+        : undefined;
+    const identity = derivationIdentity(state, input);
+    const externalHash = (cached.externalInputHashes ?? {})[identity];
+    const externalRealpaths = cached.externalInputRealpaths;
+    const graphInput = externalRealpaths !== undefined &&
+        Object.prototype.hasOwnProperty.call(externalRealpaths, identity);
+    if (externalRealpaths !== undefined &&
+        Object.prototype.hasOwnProperty.call(externalRealpaths, identity) &&
+        !sameHostInputRealpath(externalRealpaths[identity], hostInputRealpath(input, filesystem), state.identityContext)) {
+        return false;
+    }
+    // Prefer the out-of-walk spelling's own snapshot when it exists. A lexical
+    // alias can point back into the walked project, where the physical target's
+    // project hash is a different authority (and graph text uses BOM decoding).
+    const recorded = externalHash ?? projectHash;
+    if (recorded === undefined) {
+        return false;
+    }
+    try {
+        const current = graphInput
+            ? graphInputStateHash(input, filesystem)
+            : hostInputStateHash(input, filesystem);
+        return recorded === (current ?? MISSING_INPUT_STATE);
+    }
+    catch {
+        return recorded === MISSING_INPUT_STATE;
+    }
+}
+/** Record a successfully selected module as delivered by this generation. */
+function markCachedSourceServed(cached, file) {
+    (cached.servedFiles ??= new Set()).add(pathIdentityKey(file, envelopeDerivation(cached).identityContext));
+}
+/**
+ * Hash every input file under `projectRoot` (the same walk universe
+ * {@link matchesCachedSource} validates against), keyed by project-relative
+ * slash path. Exported so hosts without a per-build boundary (`@ttsc/metro`)
+ * can fold the identical input universe into their own cache fingerprints.
+ */
+function collectProjectInputHashes(projectRoot, identities = createHostPathIdentityContext(), filesystem = DEFAULT_FILESYSTEM_OPERATIONS) {
+    return collectProjectInputSnapshot(projectRoot, identities, filesystem)
+        .hashes;
+}
+/** Hash project files and snapshot the directory topology in one walk. */
+function collectProjectInputSnapshot(projectRoot, identities, filesystem = DEFAULT_FILESYSTEM_OPERATIONS, proven) {
+    const hashes = {};
+    const fileSignatures = {};
+    const provenSignatures = {};
+    const unstableFiles = new Set();
+    let attributed = true;
+    const walked = walkProjectInputs(projectRoot, filesystem);
+    let complete = walked.complete;
+    for (const file of walked.files) {
+        try {
+            const before = inputMetadataEvidence(file, filesystem);
+            const key = toProjectKey(projectRoot, file, identities);
+            // A file whose signature still equals the one captured around the read
+            // that produced the recorded hash carries that content, so the whole
+            // project does not have to be re-read to prove one delivery. A signature
+            // that was already proven stays proven: its stamp has not moved since the
+            // clock provably left its tick.
+            if (before !== undefined &&
+                proven !== undefined &&
+                proven.signatures[key] === before.signature &&
+                Object.prototype.hasOwnProperty.call(proven.hashes, key)) {
+                hashes[key] = proven.hashes[key];
+                fileSignatures[key] = before.signature;
+                provenSignatures[key] = before.signature;
+                continue;
+            }
+            const contents = filesystem.readFile(file);
+            const after = inputMetadataSignature(file, filesystem);
+            hashes[key] = hashText(contents);
+            if (before === undefined ||
+                after === undefined ||
+                before.signature !== after) {
+                complete = false;
+                unstableFiles.add(key);
+            }
+            else {
+                fileSignatures[key] = after;
+                // Only a signature whose stamp's tick the filesystem's clock provably
+                // left before this read may later stand in for the content comparison
+                // ({@link stampSeparable}); the raw signature above still participates
+                // in the generation-time stability comparison.
+                if (before.separable) {
+                    provenSignatures[key] = after;
+                }
+            }
+        }
+        catch {
+            // File watchers may observe a transform while another process is moving
+            // or deleting files. The missing key invalidates older cache entries.
+            complete = false;
+            try {
+                unstableFiles.add(toProjectKey(projectRoot, file, identities));
+            }
+            catch {
+                // Without a key the failure cannot be attributed, so it keeps the
+                // whole snapshot incomplete rather than being scoped away.
+                attributed = false;
+            }
+        }
+    }
+    return {
+        complete,
+        directoryComplete: walked.complete && attributed,
+        fileSignatures,
+        hashes,
+        projectDirectories: walked.directories,
+        provenSignatures,
+        unstableFiles,
+    };
+}
+/**
+ * Enumerate every regular file under `root`, skipping well-known output and
+ * tooling directories (see {@link isIgnoredProjectDirectory}).
+ *
+ * Uses an iterative DFS instead of `fs.readdirSync` recursion to avoid
+ * unbounded call-stack depth on deep project trees. The result is sorted so
+ * that hash comparisons are deterministic across OS-level directory orderings.
+ */
+function walkProjectInputs(root, filesystem = DEFAULT_FILESYSTEM_OPERATIONS) {
+    let complete = true;
+    const directories = [];
+    const files = [];
+    const stack = [root];
+    while (stack.length !== 0) {
+        const current = stack.pop();
+        const before = projectDirectorySignature(current, filesystem);
+        if (before === undefined) {
+            complete = false;
+            continue;
+        }
+        let entries;
+        try {
+            entries = filesystem.readdir(current);
+        }
+        catch {
+            complete = false;
+            continue;
+        }
+        const after = projectDirectorySignature(current, filesystem);
+        if (after === undefined || before !== after) {
+            complete = false;
+        }
+        directories.push({
+            path: current,
+            // If membership moved during enumeration, force the next delivery to
+            // replace this generation instead of blessing a torn directory/file
+            // snapshot as stable.
+            signature: after !== undefined && before === after
+                ? after
+                : `unstable:${before}:${after ?? "missing"}`,
+        });
+        for (const entry of entries) {
+            if (isIgnoredProjectDirectory(entry.name)) {
+                continue;
+            }
+            const file = path.join(current, entry.name);
+            if (entry.isDirectory()) {
+                stack.push(file);
+            }
+            else if (entry.isFile()) {
+                files.push(file);
+            }
+        }
+    }
+    directories.sort((left, right) => left.path.localeCompare(right.path));
+    files.sort();
+    return { complete, directories, files };
+}
+/** Return a cheap identity for one directory's immediate membership. */
+function projectDirectorySignature(directory, filesystem = DEFAULT_FILESYSTEM_OPERATIONS) {
+    try {
+        const stats = filesystem.statBigInt(directory);
+        // Directory stamps are minted by the same clock as file stamps, so every
+        // walk observation also raises the clock floor that separates them.
+        observeFilesystemClock(filesystem, stats);
+        if (!stats.isDirectory()) {
+            return undefined;
+        }
+        return [
+            stats.dev,
+            stats.ino,
+            stats.mode,
+            stats.size,
+            stats.mtimeNs,
+            stats.ctimeNs,
+        ].join(":");
+    }
+    catch {
+        return undefined;
+    }
+}
+/** Compare two deterministic project-directory membership snapshots. */
+function sameProjectDirectories(left, right) {
+    return (left.length === right.length &&
+        left.every((directory, index) => directory.path === right[index]?.path &&
+            directory.signature === right[index]?.signature));
+}
+/**
+ * Open one directory's change notification through the cache-owned watch seam,
+ * falling back to the host's own `fs.watch`. Throws exactly where the
+ * underlying watch does, so callers classify a registration failure
+ * themselves.
+ */
+function openDirectoryWatch(filesystem, directory, listener, onError) {
+    if (filesystem.watch !== undefined) {
+        return filesystem.watch(directory, listener, onError);
+    }
+    const watcher = fs.watch(directory, { persistent: false }, (eventType, filename) => listener(eventType, filename === null ? null : String(filename)));
+    watcher.on("error", onError);
+    return { close: () => watcher.close() };
+}
+/** Watch every walked directory for membership changes after generation. */
+async function createProjectMutationTracker(directories, filesystem = DEFAULT_FILESYSTEM_OPERATIONS) {
+    const tracker = {
+        close: () => undefined,
+        failed: false,
+        membershipChanged: false,
+    };
+    if (process.platform === "win32" && filesystem.watch === undefined) {
+        await registerWindowsProjectMutationTracker(tracker, directories.map((directory) => ({ directory: directory.path })), false, filesystem);
+        return tracker;
+    }
+    const watchers = [];
+    tracker.close = () => {
+        for (const watcher of watchers)
+            watcher.close();
+        watchers.length = 0;
+    };
+    for (const directory of directories) {
+        try {
+            watchers.push(openDirectoryWatch(filesystem, directory.path, (eventType) => {
+                if (eventType === "rename")
+                    tracker.membershipChanged = true;
+            }, () => {
+                tracker.failed = true;
+            }));
+        }
+        catch {
+            tracker.failed = true;
+        }
+    }
+    return tracker;
+}
+/** Watch exact universal inputs, or their nearest existing parent if missing. */
+async function createHostInputMutationTracker(inputs, filesystem, covered, events = "all") {
+    const identities = createHostPathIdentityContext(filesystem);
+    const namesByDirectory = new Map();
+    for (const input of inputs) {
+        const absolute = path.resolve(input);
+        const probe = filesystem.exists(absolute)
+            ? { directory: path.dirname(absolute), name: path.basename(absolute) }
+            : missingPathProbe(absolute, filesystem);
+        const directoryIdentity = identities.resolve(probe.directory);
+        let location = namesByDirectory.get(directoryIdentity.key);
+        if (location === undefined) {
+            location = {
+                directory: directoryIdentity.path,
+                names: new Set(),
+            };
+            namesByDirectory.set(directoryIdentity.key, location);
+        }
+        location.names.add(normalizeHostInputName(probe.name, identities.caseSensitive(directoryIdentity.path)));
+    }
+    const locations = [...namesByDirectory.values()].map((location) => ({
+        directory: location.directory,
+        names: [...location.names],
+    }));
+    const tracker = {
+        close: () => undefined,
+        // Coverage is the caller's claim, and it is required rather than derived
+        // from the input list: an input is watched by its exact name here, but only
+        // the caller knows whether the path leading to it is watched as well, which
+        // is what a later validation needs before it trusts the watcher instead of
+        // probing the path again. Deriving it here would hand that claim to every
+        // future caller by default (samchon/ttsc#1261).
+        covered,
+        failed: false,
+        membershipChanged: false,
+    };
+    if (process.platform === "win32" && filesystem.watch === undefined) {
+        await registerWindowsProjectMutationTracker(tracker, locations, events === "all", filesystem);
+        return tracker;
+    }
+    const watchers = [];
+    tracker.close = () => {
+        for (const watcher of watchers)
+            watcher.close();
+        watchers.length = 0;
+    };
+    for (const location of locations) {
+        try {
+            const names = new Set(location.names);
+            const caseSensitive = identities.caseSensitive(location.directory);
+            watchers.push(openDirectoryWatch(filesystem, location.directory, (eventType, filename) => {
+                if (events === "rename" && eventType !== "rename") {
+                    return;
+                }
+                const reported = filename === null
+                    ? null
+                    : normalizeHostInputName(filename, caseSensitive);
+                if (reported === null || names.has(reported)) {
+                    tracker.membershipChanged = true;
+                }
+            }, () => {
+                tracker.failed = true;
+            }));
+        }
+        catch {
+            tracker.failed = true;
+        }
+    }
+    return tracker;
+}
+let windowsProjectMutationBroker;
+/**
+ * Register directory watches in an isolated Windows process.
+ *
+ * Node's Windows fs-event backend can assert in native code when a watched
+ * temporary tree is deleted. Isolation turns that unrecoverable process abort
+ * into an ordinary broker exit and a conservative cache miss in the host.
+ */
+async function registerWindowsProjectMutationTracker(tracker, locations, allEvents, filesystem) {
+    const broker = getWindowsProjectMutationBroker();
+    const normalized = locations.map((location) => {
+        let directory;
+        try {
+            directory = filesystem.realpath(location.directory);
+        }
+        catch {
+            directory = path.resolve(location.directory);
+        }
+        return {
+            directory,
+            ...(location.names === undefined ? {} : { names: location.names }),
+        };
+    });
+    broker.pendingRegistrations += 1;
+    broker.child.ref();
+    broker.child.channel?.ref();
+    const id = broker.nextId++;
+    let resolveReady;
+    const ready = new Promise((resolve) => {
+        resolveReady = resolve;
+    });
+    broker.trackers.set(id, { ready: resolveReady, tracker });
+    tracker.drain = () => drainWindowsProjectMutationBroker(broker);
+    tracker.close = () => {
+        const active = broker.trackers.get(id);
+        if (active === undefined)
+            return;
+        broker.trackers.delete(id);
+        active.ready();
+        broker.child.send?.({ id, op: "remove" });
+        if (broker.trackers.size === 0) {
+            broker.child.disconnect?.();
+            broker.child.kill();
+            if (windowsProjectMutationBroker === broker) {
+                windowsProjectMutationBroker = undefined;
+            }
+        }
+    };
+    broker.child.send?.({
+        allEvents,
+        locations: normalized,
+        id,
+        op: "add",
+    });
+    try {
+        await ready;
+    }
+    finally {
+        broker.pendingRegistrations -= 1;
+        // `ref`/`unref` is a flag rather than a counter, so this must not clear a
+        // reference an in-flight acknowledgement is holding: a delivery waiting on
+        // a reply over an unreferenced channel lets the loop empty and the process
+        // exit mid-build.
+        if (broker.pendingRegistrations === 0 && broker.pendingDrains === 0) {
+            broker.child.unref();
+            broker.child.channel?.unref();
+        }
+    }
+}
+function getWindowsProjectMutationBroker() {
+    if (windowsProjectMutationBroker !== undefined) {
+        return windowsProjectMutationBroker;
+    }
+    const child = node_child_process.spawn(process.execPath, ["-e", WINDOWS_WATCH_BROKER_SOURCE], {
+        stdio: ["ignore", "ignore", "ignore", "ipc"],
+        windowsHide: true,
+    });
+    const broker = {
+        child,
+        drains: new Map(),
+        nextId: 1,
+        pendingDrains: 0,
+        pendingRegistrations: 0,
+        trackers: new Map(),
+    };
+    const fail = () => {
+        for (const registration of broker.trackers.values()) {
+            registration.tracker.failed = true;
+            registration.ready();
+        }
+        broker.trackers.clear();
+        // A broker that died answers no round-trip. Release every waiter instead of
+        // stalling the deliveries behind them; their trackers are failed now, so
+        // validation falls back to proving the generation from its own state.
+        for (const release of broker.drains.values())
+            release();
+        broker.drains.clear();
+        if (windowsProjectMutationBroker === broker) {
+            windowsProjectMutationBroker = undefined;
+        }
+    };
+    child.on("error", fail);
+    child.on("exit", fail);
+    child.on("message", (message) => {
+        if (message === null || typeof message !== "object")
+            return;
+        const record = message;
+        if (typeof record.id !== "number")
+            return;
+        if (record.drained === true) {
+            // Every event the child had already sent arrived before this reply, since
+            // one IPC channel delivers in order.
+            const release = broker.drains.get(record.id);
+            broker.drains.delete(record.id);
+            release?.();
+            return;
+        }
+        const registration = broker.trackers.get(record.id);
+        if (registration === undefined)
+            return;
+        if (record.failed === true)
+            registration.tracker.failed = true;
+        if (record.ready === true)
+            registration.ready();
+        if (record.ready !== true && record.failed !== true) {
+            registration.tracker.membershipChanged = true;
+        }
+    });
+    windowsProjectMutationBroker = broker;
+    return broker;
+}
+/**
+ * Ask the Windows broker to acknowledge, and resolve when it does.
+ *
+ * The child answers after a turn of its own loop, so a watch callback it had
+ * already queued has run, and the ordered IPC channel puts every message it
+ * sent before the reply ahead of the reply. That is the same proof an
+ * in-process watcher gets from a macrotask turn, rather than the fixed wait
+ * this replaces, which guessed at the crossing (samchon/ttsc#1272).
+ *
+ * A broker that never answers must not hold a delivery: the wait falls back to
+ * the previous fixed grace, after which validation proceeds against whatever
+ * the tracker knows, exactly as it did before.
+ */
+function drainWindowsProjectMutationBroker(broker) {
+    // Every tracker of a generation lives in one broker, so one acknowledgement
+    // answers for all of them. Sharing the in-flight round-trip keeps a settle to
+    // a single crossing.
+    broker.draining ??= startWindowsProjectMutationDrain(broker).finally(() => {
+        broker.draining = undefined;
+    });
+    return broker.draining;
+}
+function startWindowsProjectMutationDrain(broker) {
+    return new Promise((resolve) => {
+        const id = broker.nextId++;
+        let settled = false;
+        const release = () => {
+            if (settled)
+                return;
+            settled = true;
+            clearTimeout(timer);
+            broker.drains.delete(id);
+            broker.pendingDrains -= 1;
+            if (broker.pendingDrains === 0 && broker.pendingRegistrations === 0) {
+                broker.child.unref();
+                broker.child.channel?.unref();
+            }
+            resolve();
+        };
+        // Hold the channel open while the acknowledgement is outstanding. The
+        // broker is unreferenced between requests so it never keeps a host alive,
+        // and a reply is the only thing this promise can be resolved by: without
+        // the reference the loop can empty while a delivery waits here, and the
+        // process exits mid-build with nothing to report.
+        broker.pendingDrains += 1;
+        broker.child.ref();
+        broker.child.channel?.ref();
+        const timer = setTimeout(release, WINDOWS_MUTATION_DRAIN_FALLBACK_MS);
+        broker.drains.set(id, release);
+        if (broker.child.send?.({ id, op: "drain" }) !== true) {
+            release();
+        }
+    });
+}
+/** The wait a broker that stopped answering degrades to. */
+const WINDOWS_MUTATION_DRAIN_FALLBACK_MS = 10;
+const WINDOWS_WATCH_BROKER_SOURCE = [
+    'const fs = require("node:fs");',
+    "const groups = new Map();",
+    'process.on("message", (message) => {',
+    '  if (message.op === "drain") {',
+    // Two turns, not one: the first lets the loop poll for watch completions the
+    // kernel had already queued, the second answers after their callbacks ran.
+    "    setImmediate(() => setImmediate(() => process.send?.({ drained: true, id: message.id })));",
+    "    return;",
+    "  }",
+    '  if (message.op === "remove") {',
+    "    close(message.id);",
+    "    return;",
+    "  }",
+    '  if (message.op !== "add") return;',
+    "  const watchers = [];",
+    "  let failed = false;",
+    "  for (const location of message.locations) {",
+    "    try {",
+    "      const names = location.names === undefined ? undefined : new Set(location.names.map((name) => name.toLowerCase()));",
+    "      const watcher = fs.watch(location.directory, { persistent: false }, (event, filename) => {",
+    "        const matches = names === undefined || filename === null || names.has(String(filename).toLowerCase());",
+    '        if (matches && (message.allEvents || event === "rename")) process.send?.({ id: message.id });',
+    "      });",
+    '      watcher.on("error", () => process.send?.({ failed: true, id: message.id }));',
+    "      watchers.push(watcher);",
+    "    } catch {",
+    "      failed = true;",
+    "    }",
+    "  }",
+    "  groups.set(message.id, watchers);",
+    "  process.send?.({ failed, id: message.id, ready: true });",
+    "});",
+    'process.on("disconnect", () => {',
+    "  for (const id of groups.keys()) close(id);",
+    "  process.exit(0);",
+    "});",
+    "function close(id) {",
+    "  for (const watcher of groups.get(id) ?? []) watcher.close();",
+    "  groups.delete(id);",
+    "}",
+].join("\n");
+/**
+ * Report whether either live notification observed a membership event. This is
+ * positive evidence that the generation is stale, so it outranks the question
+ * of whether the notifications still work.
+ */
+function reportsMembershipChange(cached) {
+    return (cached.projectMutationTracker?.membershipChanged === true ||
+        cached.hostInputMutationTracker?.membershipChanged === true ||
+        cached.candidateMutationTracker?.membershipChanged === true);
+}
+/**
+ * Report whether the live notifications can still prove membership. A watcher
+ * that failed to register, or that errored after the generation was produced,
+ * proves nothing either way — it never proves the generation stale.
+ */
+function notificationsProveMembership(cached) {
+    for (const tracker of [
+        cached.projectMutationTracker,
+        cached.hostInputMutationTracker,
+    ]) {
+        if (tracker === undefined || tracker.failed) {
+            return false;
+        }
+    }
+    // The candidate tracker is optional: a generation with no absent candidate
+    // opens none, and one that declined to watch them left the per-delivery probe
+    // in place. Only a tracker that exists and has failed withdraws the proof.
+    return cached.candidateMutationTracker?.failed !== true;
+}
+/**
+ * Yield to the loop the tracker's own watcher callbacks are queued on.
+ *
+ * Two turns for the same reason the broker takes two: the first gives the loop
+ * a poll phase for completions the kernel had already queued, the second runs
+ * after the callbacks they produced.
+ */
+function drainOnNextTurn() {
+    return new Promise((resolve) => setImmediate(() => setImmediate(resolve)));
+}
+/**
+ * Settle every notification the trackers' watchers have already dispatched,
+ * before persistent validation reads their verdict.
+ *
+ * A synchronous edit returns before its watch event is applied, so without this
+ * a delivery could validate against a tracker that has not been told yet. Each
+ * tracker drains through its own channel, which is a macrotask turn for a
+ * watcher on this loop and an ordered round-trip for one inside the Windows
+ * broker. Concurrent sibling deliveries share the barrier one of them started.
+ */
+async function settleProjectMutationEvents(cached) {
+    const trackers = [
+        cached.projectMutationTracker,
+        cached.hostInputMutationTracker,
+        cached.candidateMutationTracker,
+    ].filter((tracker) => tracker !== undefined);
+    await Promise.all(trackers.map(async (tracker) => {
+        tracker.settle ??= (tracker.drain ?? drainOnNextTurn)().finally(() => {
+            tracker.settle = undefined;
+        });
+        await tracker.settle;
+    }));
+}
+/**
+ * Report whether an absolute `file` belongs to the project walk universe of
+ * `root`: it lies under `root`, every component exists without traversing a
+ * symbolic link, the leaf is a regular file, and no segment of the relative
+ * path is ignored. The predicate mirrors {@link walkProjectInputs} exactly, so
+ * "walk-visible" here means "hashed by {@link collectProjectInputHashes}".
+ * Missing paths and files reached through symlinks or Windows junctions are
+ * out-of-walk inputs that only the reference graph can prove relevant.
+ */
+function isProjectWalkPath(root, file, _identities = createHostPathIdentityContext(), filesystem = DEFAULT_FILESYSTEM_OPERATIONS) {
+    // Walk membership is lexical. Resolving `file` to physical identity first
+    // would turn `root/alias/value.ts` into `root/target/value.ts`, hide the
+    // symlink segment from the lstat loop below, and falsely claim the project
+    // walk hashed a path it deliberately never followed.
+    const resolvedRoot = path.resolve(root);
+    const relative = path.relative(resolvedRoot, path.resolve(file));
+    if (relative.length === 0 ||
+        relative === ".." ||
+        relative.startsWith(`..${path.sep}`) ||
+        path.isAbsolute(relative)) {
+        return false;
+    }
+    const segments = relative.split(path.sep);
+    if (segments.some(isIgnoredProjectDirectory)) {
+        return false;
+    }
+    let current = resolvedRoot;
+    for (let index = 0; index < segments.length; ++index) {
+        current = path.join(current, segments[index]);
+        let stats;
+        try {
+            stats = filesystem.lstat(current);
+        }
+        catch {
+            return false;
+        }
+        if (stats.isSymbolicLink()) {
+            return false;
+        }
+        const leaf = index === segments.length - 1;
+        if ((leaf && !stats.isFile()) || (!leaf && !stats.isDirectory())) {
+            return false;
+        }
+    }
+    return true;
+}
+/**
+ * Hash a list of absolute out-of-walk input paths: content SHA-256 for a
+ * readable file, a stable directory-kind digest for a directory candidate, and
+ * a stable `missing` marker otherwise. Keys use filesystem identity so
+ * case-only spellings share one snapshot entry, while reads retain the original
+ * path supplied by the compiler. The marker is state, not an error — a recorded
+ * input disappearing (or reappearing) must change the comparison exactly like a
+ * content edit. Exported so `@ttsc/metro` can re-hash its recorded snapshot
+ * with identical semantics at cache-key time.
+ */
+function collectExternalInputHashes(paths, filesystem = DEFAULT_FILESYSTEM_OPERATIONS) {
+    const hashes = {};
+    const identities = createHostPathIdentityContext(filesystem);
+    for (const file of paths) {
+        const identity = pathIdentityKey(file, identities);
+        if (identity in hashes) {
+            continue;
+        }
+        hashes[identity] =
+            hostInputStateHash(file, filesystem) ?? MISSING_INPUT_STATE;
+    }
+    return hashes;
+}
+/**
+ * Re-check a cached mixed graph/dependency input set with its owning codec,
+ * reusing the recorded hash of any input whose metadata signature still holds
+ * and reporting the signatures this pass captured.
+ *
+ * The caller adopts those signatures only once every input is proven unchanged,
+ * so a signature never outlives the content comparison that justified it.
+ */
+function matchesCachedExternalInputs(cached) {
+    const signatures = {};
+    let matches = true;
+    const state = envelopeDerivation(cached);
+    const graphRealpaths = cached.externalInputRealpaths ?? {};
+    const filesystem = resultFilesystem(cached.result);
+    const recordedHashes = cached.externalInputHashes ?? {};
+    const recordedSignatures = cached.externalInputSignatures ?? {};
+    // Compare each spelling against the recorded state under its own name. Two
+    // spellings share one identity exactly when they selected one physical file
+    // at generation time, which is the state a retarget ends, so neither may
+    // answer for the other: skipping the second would leave a retargeted alias
+    // unvalidated, and comparing them only through a shared key would let
+    // whichever came first decide.
+    for (const file of cached.externalInputPaths ??
+        Object.keys(cached.externalInputHashes ?? {})) {
+        const identity = derivationIdentity(state, file);
+        const spelling = path.resolve(file);
+        // Reuse the recorded hash of an out-of-walk input whose signature still
+        // equals the one captured around the read that proved it. The signature is
+        // keyed by this exact spelling, so an alias of the same physical file
+        // cannot answer for it.
+        const before = inputMetadataEvidence(file, filesystem);
+        if (before !== undefined &&
+            Object.prototype.hasOwnProperty.call(recordedSignatures, spelling) &&
+            Object.prototype.hasOwnProperty.call(recordedHashes, identity) &&
+            before.signature === recordedSignatures[spelling]) {
+            continue;
+        }
+        const hash = Object.prototype.hasOwnProperty.call(graphRealpaths, identity)
+            ? graphInputStateHash(file, filesystem)
+            : hostInputStateHash(file, filesystem);
+        const after = inputMetadataSignature(file, filesystem);
+        if (!Object.prototype.hasOwnProperty.call(recordedHashes, identity) ||
+            recordedHashes[identity] !== (hash ?? MISSING_INPUT_STATE)) {
+            matches = false;
+        }
+        if (hash !== null &&
+            after !== undefined &&
+            before?.signature === after &&
+            before.separable) {
+            signatures[spelling] = after;
+        }
+    }
+    return { matches, signatures };
+}
+/**
+ * Derive the absolute out-of-walk input set of a whole project transform: the
+ * union of every reference-graph member (edge keys and targets, globals, the
+ * config chain) and every plugin-reported dependency, minus everything the
+ * project walk already hashes and the disposed temp-dir tsconfig. These are the
+ * inputs {@link matchesCachedSource}'s walk cannot see. Resolution candidates
+ * that are still missing remain in this set even under the project root: the
+ * first walk cannot hash a file that has not been created yet.
+ *
+ * A `dependenciesComplete` declaration deliberately does not narrow the stored
+ * set: other files in the same whole-project result can still own the omitted
+ * members. Persistent validation selects the requested file's subset through
+ * {@link selectWatchInputs}, while graph-free envelopes use this union as their
+ * conservative fallback.
+ */
+function selectExternalInputPaths(props) {
+    if (props.result.type === "exception") {
+        return [];
     }
     const members = [];
-    const identities = createHostPathIdentityContext();
+    const filesystem = props.filesystem ?? DEFAULT_FILESYSTEM_OPERATIONS;
+    const identities = createHostPathIdentityContext(filesystem);
     const resolutionCandidates = new Set();
     const graph = props.result.graph;
     if (graph !== undefined) {
@@ -884,6 +2472,17 @@ function selectExternalInputPaths(props) {
             members.push(...entries);
         }
     }
+    if (Array.isArray(props.result.hostInputs)) {
+        for (const input of props.result.hostInputs) {
+            members.push(input);
+            if (typeof input === "string" && input.length !== 0) {
+                // Plugin discovery inputs deliberately include absent config and
+                // resolution probes. A project walk cannot snapshot a path that does
+                // not exist yet, even when its spelling lies below projectRoot.
+                resolutionCandidates.add(pathIdentityKey(path.resolve(props.projectRoot, input), identities));
+            }
+        }
+    }
     const excluded = props.temporaryTsconfig === undefined
         ? undefined
         : pathIdentityKey(props.temporaryTsconfig, identities);
@@ -894,20 +2493,173 @@ function selectExternalInputPaths(props) {
             continue;
         }
         const absolute = path.resolve(props.projectRoot, member);
+        const spelling = path.resolve(absolute);
         const identity = pathIdentityKey(absolute, identities);
-        const missingCandidate = resolutionCandidates.has(identity) && !fs.existsSync(absolute);
+        const missingCandidate = resolutionCandidates.has(identity) && !filesystem.exists(absolute);
         if (identity === excluded ||
-            seen.has(identity) ||
+            seen.has(spelling) ||
             (!missingCandidate &&
-                isProjectWalkPath(props.projectRoot, absolute, identities))) {
+                isProjectWalkPath(props.projectRoot, absolute, identities, filesystem))) {
             continue;
         }
-        seen.add(identity);
+        // Preserve distinct lexical aliases even when they currently select the
+        // same physical file. A later retarget must validate the alias itself.
+        seen.add(spelling);
         output.push(absolute);
     }
     output.sort();
     return output;
 }
+/**
+ * The generation's resolution candidates that do not exist, so its host-input
+ * watcher can be told to announce their creation.
+ *
+ * A missing candidate is the one input class no proof can be memoized for: its
+ * metadata cannot be read, so the signature shortcut that stands in for every
+ * other input's comparison never applies, and every delivery that reaches it
+ * probes the filesystem again. Watching the name instead turns that repeated
+ * probe into one notification for the whole generation, using the same channel
+ * and the same failure rules the universal inputs already run under
+ * (samchon/ttsc#1261).
+ *
+ * Only absent candidates qualify. One that exists is validated by content and
+ * physical identity like any other input, and adding it here would replace the
+ * generation for a change that cannot affect a resolution the compiler already
+ * declined to take.
+ */
+function selectNotifiableAbsentInputs(props) {
+    const empty = { candidates: [], watched: [] };
+    if (props.result.type === "exception") {
+        return empty;
+    }
+    const graph = props.result.graph;
+    if (graph === undefined) {
+        return empty;
+    }
+    const identities = createHostPathIdentityContext(props.filesystem);
+    const excluded = props.temporaryTsconfig === undefined
+        ? undefined
+        : pathIdentityKey(props.temporaryTsconfig, identities);
+    const resolvedProjectRoot = path.resolve(props.projectRoot);
+    const output = [];
+    const watched = [];
+    const directories = new Set();
+    // Two namespaces, deliberately not one set: candidates are the paths a
+    // delivery may stop probing, while the chain holds the directories that carry
+    // them. Sharing a set would let one silently answer for the other.
+    const seen = new Set();
+    const chain = new Set();
+    for (const candidates of Object.values(graph.candidates ?? {})) {
+        if (!Array.isArray(candidates)) {
+            continue;
+        }
+        for (const candidate of candidates) {
+            if (typeof candidate !== "string" || candidate.length === 0) {
+                continue;
+            }
+            const absolute = path.resolve(props.projectRoot, candidate);
+            const spelling = path.resolve(absolute);
+            if (seen.has(spelling) ||
+                (excluded !== undefined &&
+                    pathIdentityKey(absolute, identities) === excluded) ||
+                props.filesystem.exists(absolute)) {
+                continue;
+            }
+            seen.add(spelling);
+            // Collect the components of the lexical path, by the name each carries in
+            // its own parent. The watcher a missing path opens follows the spelling
+            // to a physical directory, so retargeting a link along the way moves the
+            // answer without touching what is watched: in a pnpm layout
+            // `node_modules/<pkg>` is exactly such a link, and reinstalling it makes
+            // a candidate appear behind a watch still looking at the old store
+            // directory. Watching `<pkg>` inside `node_modules` is what reports that.
+            //
+            // The collection stops at the project root, and a spelling that leaves
+            // the project subtree before reaching it is not claimed at all. Above
+            // that line the components are the machine's own layout rather than the
+            // project's, and watching those entries costs a generation whenever an
+            // unrelated process touches anything inside them; a candidate whose path
+            // runs outside the subtree therefore keeps the probe it always had rather
+            // than a proof this cannot complete.
+            const components = [];
+            let reachedProject = false;
+            for (let child = path.dirname(spelling), parent = path.dirname(child); parent !== child; child = parent, parent = path.dirname(child)) {
+                if (insideProject(child, resolvedProjectRoot)) {
+                    components.push(child);
+                    continue;
+                }
+                // Compared through `path.relative` rather than by string, so a
+                // spelling that differs from the root only in case still counts as
+                // having arrived where the platform says it has.
+                reachedProject = path.relative(child, resolvedProjectRoot).length === 0;
+                break;
+            }
+            if (!reachedProject) {
+                continue;
+            }
+            output.push(absolute);
+            watched.push(absolute);
+            for (const component of components) {
+                if (chain.has(component))
+                    break;
+                chain.add(component);
+                watched.push(component);
+                directories.add(path.dirname(component));
+            }
+            directories.add(path.dirname(spelling));
+        }
+    }
+    if (directories.size > NOTIFIABLE_ABSENCE_DIRECTORY_LIMIT) {
+        // Past this many distinct directories the watch registration is the more
+        // expensive half: a host that runs out of watch descriptors fails the
+        // tracker, and a failed tracker sends every delivery to complete-snapshot
+        // validation, which re-hashes the whole project. Declining to watch leaves
+        // the per-delivery probe in place, which is what this replaces and is far
+        // cheaper than that.
+        return empty;
+    }
+    output.sort();
+    watched.sort();
+    return { candidates: output, watched };
+}
+/**
+ * Report whether a directory lies strictly below the project root.
+ *
+ * The boundary of what a generation may watch on a candidate's behalf: what the
+ * project contains is its own layout, while the project root and everything
+ * above it belongs to the machine, which nobody retargets and which changes for
+ * reasons no generation should hear about.
+ */
+function insideProject(directory, projectRoot) {
+    const relative = path.relative(path.resolve(projectRoot), path.resolve(directory));
+    // An empty result is the platform saying the two name the same directory,
+    // which it answers for spellings that differ only in case where the path
+    // module folds case. The root itself is not below itself, so the walk stops
+    // there rather than one level past it.
+    if (relative.length === 0) {
+        return false;
+    }
+    // `..` alone and `../` climb out, and an absolute answer means another drive
+    // or share entirely; a directory literally named `..x` does neither, which a
+    // plain prefix test would misread. The project walk's own containment check
+    // spells it the same way.
+    return (relative !== ".." &&
+        !relative.startsWith(`..${path.sep}`) &&
+        !path.isAbsolute(relative));
+}
+/**
+ * Distinct directories the absent-candidate watch may open before it declines.
+ *
+ * Sized well below the inotify per-user default so a project's own walk keeps
+ * its share, and far above the distinct `node_modules` package directories a
+ * real dependency graph produces.
+ *
+ * Counted lexically, over the parents of every watched name. A missing subtree
+ * collapses onto the one watch its nearest existing ancestor carries, so the
+ * count is an upper bound on the watches actually opened rather than their
+ * number; the bound stays sound and is merely not tight.
+ */
+const NOTIFIABLE_ABSENCE_DIRECTORY_LIMIT = 512;
 function isIgnoredProjectDirectory(name) {
     return (name === ".git" ||
         name === ".ttsc" ||
@@ -925,7 +2677,29 @@ function isIgnoredProjectDirectory(name) {
         name === "temp" ||
         name === "tmp");
 }
-function sameHashes(left, right) {
+/**
+ * Compare two project-walk snapshots.
+ *
+ * `keys` narrows the comparison to the generation's declared inputs. The walk
+ * hashes every file under the project root, but only a file the compile
+ * actually consumed can change an output, and a project root is a working
+ * directory: a framework's generated types, a log, a coverage report, or a test
+ * artifact appears and changes there while a compile runs. Comparing those
+ * would declare the generation incoherent and cost a whole-project recompile
+ * for every remaining module (samchon/ttsc#1246). Files entering or leaving the
+ * project remain covered by the directory-membership snapshot, which is the one
+ * thing a content comparison cannot see. An envelope that declares no input set
+ * (a graph-free legacy host) passes `undefined` and keeps the whole-walk
+ * comparison.
+ */
+function sameHashes(left, right, keys) {
+    if (keys !== undefined) {
+        for (const key of keys) {
+            if (left[key] !== right[key])
+                return false;
+        }
+        return true;
+    }
     const leftKeys = Object.keys(left);
     const rightKeys = Object.keys(right);
     if (leftKeys.length !== rightKeys.length) {
@@ -933,16 +2707,149 @@ function sameHashes(left, right) {
     }
     return leftKeys.every((key) => right[key] === left[key]);
 }
+/**
+ * Whether a project-walk snapshot is coherent for the inputs that matter.
+ *
+ * The walk reads every file under the project root, so a file nothing compiled
+ * (a log being appended, a coverage report being written, a generated artifact
+ * being replaced) can fail its own read sandwich while every input holds still.
+ * That is not evidence about the generation, and treating it as such costs a
+ * whole-project recompile per delivered module. A walk that could not enumerate
+ * a directory, or a file-level failure this snapshot could not attribute to a
+ * key, still taints everything: neither can be shown to leave the inputs
+ * alone.
+ */
+function walkSnapshotComplete(snapshot, declared) {
+    if (declared === undefined) {
+        return snapshot.complete;
+    }
+    if (!snapshot.directoryComplete) {
+        return false;
+    }
+    for (const key of snapshot.unstableFiles) {
+        if (declared.has(key))
+            return false;
+    }
+    return true;
+}
+/** {@link selectDeclaredProjectInputKeys} memoized per envelope generation. */
+function declaredProjectInputKeys(state, cached) {
+    if (state.declaredInputKeysBuilt !== true) {
+        state.declaredInputKeys = selectDeclaredProjectInputKeys({
+            identities: state.identityContext,
+            projectRoot: cached.projectRoot,
+            result: cached.result,
+        });
+        state.declaredInputKeysBuilt = true;
+    }
+    return state.declaredInputKeys;
+}
+/**
+ * Project-walk keys of every input the envelope declares: the reference graph's
+ * edge endpoints, globals, config chain, and resolution candidates, plus the
+ * universal host inputs. Returns `undefined` for an envelope with no graph,
+ * which declares no input set and therefore keeps whole-walk comparison.
+ */
+function selectDeclaredProjectInputKeys(props) {
+    if (props.result.type === "exception" || props.result.graph === undefined) {
+        return undefined;
+    }
+    const graph = props.result.graph;
+    const keys = new Set();
+    const add = (entry) => {
+        if (typeof entry !== "string" || entry.length === 0)
+            return;
+        keys.add(toProjectKey(props.projectRoot, path.resolve(props.projectRoot, entry), props.identities));
+    };
+    for (const [source, targets] of Object.entries(graph.edges ?? {})) {
+        add(source);
+        if (Array.isArray(targets))
+            for (const target of targets)
+                add(target);
+    }
+    if (Array.isArray(graph.globals))
+        for (const input of graph.globals)
+            add(input);
+    if (Array.isArray(graph.configs))
+        for (const input of graph.configs)
+            add(input);
+    for (const [source, candidates] of Object.entries(graph.candidates ?? {})) {
+        add(source);
+        if (Array.isArray(candidates))
+            for (const entry of candidates)
+                add(entry);
+    }
+    if (Array.isArray(props.result.hostInputs))
+        for (const input of props.result.hostInputs)
+            add(input);
+    // Plugin-reported dependencies are inputs the graph never sees: a utility
+    // plugin's own config file is consulted by the plugin, not by the compiler.
+    for (const reported of Object.values(props.result.dependencies ?? {})) {
+        if (Array.isArray(reported))
+            for (const input of reported)
+                add(input);
+    }
+    return keys;
+}
+/**
+ * Project roots already told they cannot reuse a compile, so a build reports
+ * the condition once instead of once per module.
+ */
+const REPORTED_UNREUSABLE_GENERATIONS = new Set();
+/**
+ * Report, once per project root, that a generation cannot be reused.
+ *
+ * Every module of the build then recompiles the whole project, so the condition
+ * is the difference between one compile and one compile per module. It stayed
+ * invisible for the whole life of samchon/ttsc#970: consumers saw only a build
+ * that never finished, and each investigation had to rediscover the cause from
+ * outside. A named reason turns the next occurrence into a bug report instead
+ * of an archaeology session.
+ */
+function reportUnreusableGeneration(cached, evidence) {
+    const missing = [
+        ...(evidence.walkStable ? [] : ["a stable project snapshot"]),
+        ...(evidence.graphProofs ? [] : ["compiler proofs for its graph inputs"]),
+        ...(evidence.externalInputs
+            ? []
+            : ["a complete out-of-walk input snapshot"]),
+        ...(evidence.universalInputs ? [] : ["a universal host-input manifest"]),
+    ];
+    const key = `${cached.projectRoot}\0${missing.join(",")}`;
+    if (REPORTED_UNREUSABLE_GENERATIONS.has(key)) {
+        return;
+    }
+    REPORTED_UNREUSABLE_GENERATIONS.add(key);
+    process.stderr.write(`ttsc: the transform cache cannot reuse this project's compile, so every ` +
+        `module recompiles the whole project.\n` +
+        `  project: ${cached.projectRoot}\n` +
+        `  missing: ${missing.join("; ")}\n` +
+        `  Please report this at https://github.com/samchon/ttsc/issues with ` +
+        `this message.\n`);
+}
 function hashText(input) {
     return crypto.createHash("sha256").update(input).digest("hex");
 }
 async function transformProject(props) {
-    const configured = createTransformTsconfig(props);
     const projectRoot = path.dirname(props.tsconfig);
+    const scratchDirectory = createTransformScratchDirectory(projectRoot, props.filesystem);
+    let tracker;
+    let retainTracker = false;
+    let hostInputTracker;
+    let candidateTracker;
+    let retainHostInputTracker = false;
+    let retainCandidateTracker = false;
     try {
-        const result = new ttsc.TtscCompiler({
+        const configured = createTransformTsconfig(props, scratchDirectory);
+        const temporaryTsconfig = configured.path === props.tsconfig ? undefined : configured.path;
+        const identities = createHostPathIdentityContext(props.filesystem);
+        const before = collectProjectInputSnapshot(projectRoot, identities, props.filesystem);
+        tracker = props.trackProjectMembership
+            ? await createProjectMutationTracker(before.projectDirectories, props.filesystem)
+            : undefined;
+        const result = withTransformScratchEnvironment(scratchDirectory, () => new ttsc.TtscCompiler({
             cwd: projectRoot,
-            // The generated tsconfig (if any) lives in the system temp directory,
+            // The generated tsconfig (if any) lives outside the project directory,
             // so declare the real project as the plugin config anchor: utility
             // plugin config discovery (banner.config.*, strip.config.*,
             // lint.config.*) and relative configFile resolution walk the project,
@@ -952,24 +2859,99 @@ async function transformProject(props) {
             plugins: props.plugins,
             projectRoot,
             tsconfig: configured.path,
-        }).transform();
-        const temporaryTsconfig = configured.path === props.tsconfig ? undefined : configured.path;
+            env: transformScratchEnvironment(scratchDirectory),
+        }).transform());
+        TRANSFORM_RESULT_FILESYSTEM.set(result, props.filesystem);
+        // Mint the generation's clock reference after the compile and before any
+        // signature-recording read below, so every input written before the
+        // compile sits in a provably finished tick when its signature is captured.
+        mintFilesystemClockReference(scratchDirectory, props.filesystem);
+        const persistentHostInputs = selectPersistentHostInputs({
+            filesystem: props.filesystem,
+            projectRoot,
+            result,
+            temporaryTsconfig,
+        });
+        // The generation's absent resolution candidates, which get a watcher of
+        // their own below; watching one is what lets a delivery stop probing it
+        // (samchon/ttsc#1261). The validation manifest stays built from the
+        // universal inputs alone, so nothing else about a candidate changes.
+        //
+        // Derived only where a tracker could carry it: a build-scoped adapter opens
+        // no watcher, so probing every candidate's existence here would be work
+        // whose answer nothing can read.
+        const notifiableAbsence = props.trackProjectMembership
+            ? selectNotifiableAbsentInputs({
+                filesystem: props.filesystem,
+                projectRoot,
+                result,
+                temporaryTsconfig,
+            })
+            : { candidates: [], watched: [] };
+        hostInputTracker = props.trackProjectMembership
+            ? await createHostInputMutationTracker(persistentHostInputs, props.filesystem, 
+            // A universal input never reaches the per-input loop that consults a
+            // coverage claim: an absent one is proven by its directory listing
+            // instead, which re-resolves the spelling every delivery.
+            new Set())
+            : undefined;
+        // The candidates and the directories carrying them get their own tracker,
+        // listening for renames alone. Every event that can make one of these
+        // paths appear is a rename — the file itself, or a component of the path
+        // being created, replaced, or retargeted — so nothing is given up, while a
+        // backend that reports a write below a directory as a change to that
+        // directory's entry (Windows does) would otherwise replace the generation
+        // every time a bundler wrote inside `node_modules`.
+        candidateTracker =
+            notifiableAbsence.watched.length !== 0
+                ? await createHostInputMutationTracker(notifiableAbsence.watched, props.filesystem, new Set(notifiableAbsence.candidates), "rename")
+                : undefined;
         const externalInputPaths = selectExternalInputPaths({
+            filesystem: props.filesystem,
             projectRoot,
             result,
             temporaryTsconfig,
         });
-        return {
+        const inputSnapshot = collectProjectInputSnapshot(projectRoot, identities, props.filesystem);
+        // Whether the recorded snapshot describes one coherent state of the
+        // project. A membership event during the compile taints it exactly like an
+        // unstable walk pair; whether notifications can be *opened* is a separate
+        // fact, tracked below, because a generation with no watcher is still
+        // provable from its own recorded state.
+        const declaredInputs = selectDeclaredProjectInputKeys({
+            identities,
+            projectRoot,
+            result,
+        });
+        const walkStable = walkSnapshotComplete(before, declaredInputs) &&
+            walkSnapshotComplete(inputSnapshot, declaredInputs) &&
+            sameHashes(before.hashes, inputSnapshot.hashes, declaredInputs) &&
+            sameHashes(before.fileSignatures, inputSnapshot.fileSignatures, declaredInputs) &&
+            sameProjectDirectories(before.projectDirectories, inputSnapshot.projectDirectories) &&
+            tracker?.membershipChanged !== true &&
+            hostInputTracker?.membershipChanged !== true &&
+            candidateTracker?.membershipChanged !== true;
+        const notificationsAvailable = tracker?.failed !== true &&
+            hostInputTracker?.failed !== true &&
+            candidateTracker?.failed !== true;
+        // Overlay the in-memory source only after proving the two on-disk snapshots
+        // stable; an unsaved editor buffer must not look like a compile-time race.
+        const currentFileKey = toProjectKey(projectRoot, props.currentFile, identities);
+        inputSnapshot.hashes[currentFileKey] = hashText(props.currentSource);
+        // That overlay makes this one key the only recorded hash a disk signature
+        // cannot stand for: the bytes it names came from the bundler, not the file.
+        delete inputSnapshot.provenSignatures[currentFileKey];
+        const cached = {
             // Capture the out-of-walk input hashes while the generation is fresh so
             // cache validation can re-check them; computed before dispose so the
             // exclusion of the temp-dir tsconfig is the only reason it never keys.
-            externalInputHashes: collectExternalInputHashes(externalInputPaths),
+            externalInputHashes: {},
+            externalInputRealpaths: {},
             externalInputPaths,
-            inputHashes: collectInputHashes({
-                currentFile: props.currentFile,
-                currentSource: props.currentSource,
-                projectRoot,
-            }),
+            inputHashes: inputSnapshot.hashes,
+            inputSignatures: inputSnapshot.provenSignatures,
+            projectDirectories: inputSnapshot.projectDirectories,
+            projectSnapshotComplete: false,
             projectRoot,
             result,
             servedFiles: new Set(),
@@ -978,40 +2960,219 @@ async function transformProject(props) {
             // but deleted file would invalidate every persistent-cache snapshot.
             ...(temporaryTsconfig === undefined ? {} : { temporaryTsconfig }),
         };
+        const externalInputSnapshot = captureExternalInputSnapshot(cached, externalInputPaths);
+        cached.externalInputHashes = externalInputSnapshot.hashes;
+        cached.externalInputRealpaths = externalInputSnapshot.realpaths;
+        cached.externalInputSignatures = externalInputSnapshot.signatures;
+        // Evaluate every half, rather than short-circuiting, so a generation that
+        // cannot be reused can say which evidence it lacked. The extra work runs
+        // only on the failing path, where the alternative is recompiling the whole
+        // project for every remaining module.
+        const graphProofs = matchesCompilerGraphInputProofs(cached);
+        const universalInputs = captureUniversalHostInputValidation(cached, props.currentFile) !==
+            undefined;
+        const stableProjectSnapshot = walkStable &&
+            graphProofs &&
+            externalInputSnapshot.complete &&
+            universalInputs;
+        // Only a caching host loses anything here: without a cache every delivery
+        // compiles by design, so an unprovable generation costs it nothing.
+        if (!stableProjectSnapshot && props.trackProjectMembership) {
+            reportUnreusableGeneration(cached, {
+                externalInputs: externalInputSnapshot.complete,
+                graphProofs,
+                universalInputs,
+                walkStable,
+            });
+        }
+        cached.projectSnapshotComplete = stableProjectSnapshot;
+        // Attach notifications only while they can actually prove membership. A
+        // generation that could not open its watchers keeps its recorded snapshot
+        // and validates through it, rather than losing the cache entirely.
+        const notifying = stableProjectSnapshot && notificationsAvailable;
+        if (notifying && tracker !== undefined) {
+            cached.projectMutationTracker = tracker;
+        }
+        if (notifying && hostInputTracker !== undefined) {
+            cached.hostInputMutationTracker = hostInputTracker;
+        }
+        if (notifying && candidateTracker !== undefined) {
+            cached.candidateMutationTracker = candidateTracker;
+        }
+        // Every tracker the generation published is retained, and every tracker it
+        // did not is closed below. Naming only two of the three would close a
+        // published candidate tracker the moment either of the others was absent,
+        // and that is the one tracker whose silence is read as evidence.
+        retainTracker = notifying && tracker !== undefined;
+        retainHostInputTracker = notifying && hostInputTracker !== undefined;
+        retainCandidateTracker = notifying && candidateTracker !== undefined;
+        return cached;
     }
     finally {
-        configured.dispose();
+        try {
+            if (!retainTracker && tracker !== undefined) {
+                tracker.close();
+            }
+        }
+        finally {
+            try {
+                if (!retainHostInputTracker && hostInputTracker !== undefined) {
+                    hostInputTracker.close();
+                }
+            }
+            finally {
+                try {
+                    if (!retainCandidateTracker && candidateTracker !== undefined) {
+                        candidateTracker.close();
+                    }
+                }
+                finally {
+                    fs.rmSync(scratchDirectory, { force: true, recursive: true });
+                }
+            }
+        }
     }
 }
-function createTransformTsconfig(props) {
+/** Exclude the disposed overlay tsconfig from live host-input tracking. */
+function selectPersistentHostInputs(props) {
+    if (props.result.type === "exception")
+        return [];
+    const inputs = selectListedFiles(props.projectRoot, props.result.hostInputs);
+    if (props.temporaryTsconfig === undefined)
+        return inputs;
+    const identities = createHostPathIdentityContext(props.filesystem);
+    const temporary = pathIdentityKey(props.temporaryTsconfig, identities);
+    return inputs.filter((input) => pathIdentityKey(input, identities) !== temporary);
+}
+function createTransformTsconfig(props, scratchDirectory) {
     const compilerOptions = normalizeCompilerOptionsForGeneratedTsconfig({
         ...props.compilerOptions,
         ...createAliasCompilerOptions(props),
     }, path.dirname(props.tsconfig));
     if (Object.keys(compilerOptions).length === 0) {
-        return {
-            path: props.tsconfig,
-            dispose: () => undefined,
-        };
+        return { path: props.tsconfig };
     }
-    const directory = fs.mkdtempSync(path.join(os.tmpdir(), "ttsc-unplugin-"));
-    const file = path.join(directory, "tsconfig.json");
+    const file = path.join(scratchDirectory, "tsconfig.json");
     fs.writeFileSync(file, JSON.stringify({
         extends: normalizePath(props.tsconfig),
         compilerOptions,
     }, null, 2), "utf8");
+    return { path: file };
+}
+/** Create compiler scratch storage outside the project snapshot and watchers. */
+function createTransformScratchDirectory(projectRoot, filesystem = DEFAULT_FILESYSTEM_OPERATIONS) {
+    const root = path.resolve(projectRoot);
+    const canonicalRoot = filesystem.realpath(root);
+    const platformTemp = process.platform === "win32" && process.env.LOCALAPPDATA
+        ? path.join(process.env.LOCALAPPDATA, "Temp")
+        : "/tmp";
+    const candidates = [
+        os.tmpdir(),
+        platformTemp,
+        path.dirname(root),
+        os.homedir(),
+    ];
+    const canonicalCandidates = new Set();
+    let failure;
+    for (const candidate of new Set(candidates.map((dir) => path.resolve(dir)))) {
+        if (pathIsWithin(candidate, root))
+            continue;
+        let canonicalCandidate;
+        try {
+            canonicalCandidate = filesystem.realpath(candidate);
+        }
+        catch (error) {
+            failure = error;
+            continue;
+        }
+        if (pathIsWithin(canonicalCandidate, canonicalRoot) ||
+            canonicalCandidates.has(canonicalCandidate)) {
+            continue;
+        }
+        canonicalCandidates.add(canonicalCandidate);
+        let directory;
+        try {
+            directory = fs.mkdtempSync(path.join(canonicalCandidate, "ttsc-unplugin-"));
+        }
+        catch (error) {
+            failure = error;
+            continue;
+        }
+        let canonicalDirectory;
+        try {
+            canonicalDirectory = filesystem.realpath(directory);
+        }
+        catch (error) {
+            try {
+                fs.rmdirSync(directory);
+            }
+            catch (cleanupError) {
+                throw cleanupError;
+            }
+            failure = error;
+            continue;
+        }
+        // Use the postflight canonical spelling from this point onward. Returning
+        // the candidate-relative spelling would let another process retarget its
+        // parent symlink/junction after validation, redirecting compiler writes or
+        // the final recursive removal into the project.
+        if (!pathIsWithin(canonicalDirectory, canonicalRoot)) {
+            return canonicalDirectory;
+        }
+        // Refuse the result and synchronously remove only our empty random child
+        // through the identity that the postflight check just classified.
+        fs.rmdirSync(canonicalDirectory);
+    }
+    throw (failure ??
+        new Error("ttsc: no temporary directory exists outside the project"));
+}
+function pathIsWithin(child, parent) {
+    const relative = path.relative(parent, child);
+    return (relative === "" ||
+        (relative !== ".." &&
+            !relative.startsWith(`..${path.sep}`) &&
+            !path.isAbsolute(relative)));
+}
+/** Route all compiler/plugin scratch to one owned directory outside project. */
+function transformScratchEnvironment(directory) {
     return {
-        path: file,
-        dispose: () => fs.rmSync(directory, { force: true, recursive: true }),
+        ...process.env,
+        TEMP: directory,
+        TMP: directory,
+        TMPDIR: directory,
     };
 }
+/** Scope parent-process temp consumers to the same owned scratch directory. */
+function withTransformScratchEnvironment(scratchDirectory, callback) {
+    const environment = transformScratchEnvironment(scratchDirectory);
+    const previous = {
+        TEMP: process.env.TEMP,
+        TMP: process.env.TMP,
+        TMPDIR: process.env.TMPDIR,
+    };
+    process.env.TEMP = environment.TEMP;
+    process.env.TMP = environment.TMP;
+    process.env.TMPDIR = environment.TMPDIR;
+    try {
+        return callback();
+    }
+    finally {
+        for (const [name, value] of Object.entries(previous)) {
+            if (value === undefined)
+                delete process.env[name];
+            else
+                process.env[name] = value;
+        }
+    }
+}
 /**
  * Resolve all relative paths inside `compilerOptions` against `tsconfigDir`.
  *
- * The generated tsconfig lives in a system temp directory, so any relative path
- * (e.g. `"outDir": "../dist"`) that was meaningful relative to the original
- * tsconfig must be converted to an absolute path before writing the generated
- * file. Otherwise TypeScript-Go resolves it against the temp dir.
+ * The generated tsconfig lives in a temporary directory outside the project, so
+ * any relative path (e.g. `"outDir": "../dist"`) that was meaningful relative
+ * to the original tsconfig must be converted to an absolute path before writing
+ * the generated file. Otherwise TypeScript-Go resolves it against the temp
+ * dir.
  *
  * `paths` targets are absolutized for the same reason, with the extra twist
  * that TypeScript-Go rejects bare non-relative targets outright (TS5090) and
@@ -1284,7 +3445,7 @@ function formatUnknownError(error) {
  * compiler will error if that file does not exist, which is the correct
  * behavior for a mis-configured project.
  */
-function resolveTsconfig(file, tsconfig) {
+function resolveTsconfig(file, tsconfig, filesystem = DEFAULT_FILESYSTEM_OPERATIONS) {
     if (tsconfig !== undefined) {
         return path.isAbsolute(tsconfig)
             ? tsconfig
@@ -1293,7 +3454,7 @@ function resolveTsconfig(file, tsconfig) {
     let current = path.dirname(file);
     while (true) {
         const candidate = path.join(current, "tsconfig.json");
-        if (fs.existsSync(candidate)) {
+        if (filesystem.exists(candidate)) {
             return candidate;
         }
         const parent = path.dirname(current);
@@ -1332,6 +3493,7 @@ exports.createTransformResult = createTransformResult;
 exports.createTtscTransformCache = createTtscTransformCache;
 exports.isDeclarationFile = isDeclarationFile;
 exports.isProjectWalkPath = isProjectWalkPath;
+exports.normalizeHostInputName = normalizeHostInputName;
 exports.pathIdentityKey = pathIdentityKey;
 exports.resetTtscTransformCache = resetTtscTransformCache;
 exports.stripQuery = stripQuery;