@nimbus-sh/fabric 0.8.0 → 0.10.0

package/dist/do-calls.js

@@ -41,6 +41,7 @@
  */
 import { classifyDoCall, isRetryableDoCall } from '@nimbus-sh/platform/oom-classify.js';
 import { disposeRpcResource } from '@nimbus-sh/platform/rpc-dispose.js';
+import { untraced } from '@nimbus-sh/platform/tracing.js';
 /** Total attempts. Two retries is what a dropped connection or a deploy
  *  bounce needs; beyond that the object is not coming back inside this
  *  request (the consumer's measured bound). */
@@ -87,7 +88,7 @@ export class DoCallError extends Error {
 export function idempotent(operation, stub, call, policy = {}) {
     const maxAttempts = policy.maxAttempts ?? MAX_ATTEMPTS;
     const baseDelayMs = policy.baseDelayMs ?? BASE_DELAY_MS;
-    const { hedgeAfterMs, retryWindowMs } = policy;
+    const { hedgeAfterMs, retryWindowMs, span = untraced } = policy;
     const startedAt = Date.now();
     // The executor form: fabric's library target predates Promise.withResolvers.
     return new Promise((resolve, reject) => {
@@ -99,7 +100,9 @@ export function idempotent(operation, stub, call, policy = {}) {
         // An attempt was shed as overloaded: nothing is repeated after it.
         let refused = false;
         let settled = false;
-        const settle = (answer) => {
+        // Attempts a hedge started rather than a retry or the first send.
+        let hedged = 0;
+        const settle = (outcome, answeredBy, answer) => {
             if (settled)
                 return;
             settled = true;
@@ -107,6 +110,12 @@ export function idempotent(operation, stub, call, policy = {}) {
                 clearTimeout(timer);
             hedges.clear();
             answer();
+            span.set({
+                'do_call.attempts': started,
+                'do_call.hedges': hedged,
+                'do_call.answered_by': answeredBy,
+                'do_call.outcome': outcome,
+            });
         };
         /** May another attempt start at `at`? */
         const canRepeat = (at) => !settled && !refused && started < maxAttempts
@@ -114,13 +123,20 @@ export function idempotent(operation, stub, call, policy = {}) {
         /** `error` ended an attempt that will not be repeated: the call's answer, once nothing else is live. */
         const exhausted = (error) => {
             if (live === 0)
-                settle(() => reject(error));
+                settle(refused ? 'overloaded' : 'exhausted', undefined, () => reject(error));
         };
         /** A failed attempt, numbered: repeat it after its backoff, or let it stand. */
         const failed = async (number, error) => {
             if (settled)
                 return;
             const classification = classifyDoCall(error);
+            if (!isRetryableDoCall(classification) && classification !== 'overloaded') {
+                // The call ran and its answer is this error — ENOENT is a read's answer as much as bytes are.
+                settle('callee_error', number, () => reject(error));
+                return;
+            }
+            // A lost attempt: the call's span says which, and why.
+            span.exception(error, classification, `attempt ${number} of ${maxAttempts}: `);
             if (classification === 'overloaded') {
                 // A shed call is no answer: nothing more is sent, and an attempt
                 // still in flight may yet answer.
@@ -128,11 +144,6 @@ export function idempotent(operation, stub, call, policy = {}) {
                 exhausted(error);
                 return;
             }
-            if (!isRetryableDoCall(classification)) {
-                // The call ran and its answer is this error — ENOENT is a read's answer as much as bytes are.
-                settle(() => reject(error));
-                return;
-            }
             const delayMs = Math.floor(Math.random() * 2 ** number * baseDelayMs);
             if (!canRepeat(Date.now() + delayMs)) {
                 exhausted(error);
@@ -163,8 +174,10 @@ export function idempotent(operation, stub, call, policy = {}) {
             const hedge = hedgeAfterMs === undefined ? undefined : setTimeout(() => {
                 if (hedge !== undefined)
                     hedges.delete(hedge);
-                if (canRepeat(Date.now()))
+                if (canRepeat(Date.now())) {
+                    hedged++;
                     attempt();
+                }
             }, hedgeAfterMs);
             if (hedge !== undefined)
                 hedges.add(hedge);
@@ -193,11 +206,11 @@ export function idempotent(operation, stub, call, policy = {}) {
                 disposeRpcResource(result);
                 return;
             }
-            settle(() => resolve(result));
+            settle('answered', number, () => resolve(result));
         };
         /** Start an attempt. Whatever it throws outside the call itself fails the call. */
         const attempt = () => {
-            run().catch((error) => settle(() => reject(error)));
+            run().catch((error) => settle('caller_error', undefined, () => reject(error)));
         };
         attempt();
     });

package/dist/fanout.d.ts

@@ -1,17 +1,21 @@
 /**
  * Two-tier fan-out primitive for work that must execute in Worker Loader
- * facets without tripping workerd's per-DO dynamic-worker ceiling.
+ * isolates within the Durable Object's Dynamic Worker budget.
  *
- * A single Durable Object method can drive at most four concurrent
- * Worker Loader fetches before extra dispatches serialize or fail. Small
- * batches therefore run in the coordinator DO through IsolatePool.
- * Wider batches are sharded across sibling NimbusSession DOs, each of
- * which owns its own four-loader budget.
+ * A Durable Object may have `DO_DYNAMIC_WORKER_LIMIT` distinct Dynamic
+ * Workers with in-flight requests, shared across every concurrent request to
+ * it (budgets.ts). A batch the coordinator's remaining headroom can hold —
+ * the limit less the workers it already has in flight (resident processes,
+ * the esbuild facet, a git network op) and other fan-outs' claims — runs in
+ * the coordinator through IsolatePool, one Dynamic Worker per task. Only a
+ * batch wider than that headroom is sharded across sibling NimbusSession
+ * DOs, each of which spends its own budget.
  *
- * Routing is deterministic: each task has a stable key, and the key maps
- * to a sibling DO shard. There is no silent fallback to width-1 execution;
- * missing LOADER or NIMBUS_SESSION bindings fail loudly so install and
- * runtime operations do not appear successful after partial dispatch.
+ * Routing is deterministic for a given headroom: each task has a stable key,
+ * and the key maps to a sibling DO shard. There is no silent fallback to
+ * width-1 execution; missing LOADER or NIMBUS_SESSION bindings fail loudly so
+ * install and runtime operations do not appear successful after partial
+ * dispatch.
  */
 import { type FacetTaskFn } from './isolate-pool.js';
 import type { WorkerLoader } from './vendor/types.js';
@@ -22,14 +26,16 @@ export interface FanoutEnv {
     LOADER?: WorkerLoader;
     NIMBUS_SESSION?: unknown;
 }
-/**
- * Threshold at which routing switches from coordinator-local loaders to
- * sibling Durable Objects.
- *
- * Set to **5** so the in-DO path stays below the V8 4-loaders-per-method
- * cap by construction. width < 5 stays local; width >= 5 uses sibling DOs.
- */
-export declare const IN_DO_THRESHOLD = 5;
+/** Where one `submitMany` ran. */
+export type FanoutTopology = 'in-do' | 'peer-do';
+/** The routing decision for one `submitMany`, as its caller may log it. */
+export interface FanoutRoute {
+    topology: FanoutTopology;
+    /** Tasks in the batch — the Dynamic Workers an in-DO run spends. */
+    tasks: number;
+    /** The coordinator's Dynamic Worker headroom when the batch was routed. */
+    headroom: number;
+}
 /**
  * Hard cap on concurrent peer DOs per single submitMany call. Throughput stays
  * flat through this width while keeping per-request scheduler pressure bounded.
@@ -134,12 +140,14 @@ export interface FanoutOptions {
      * Not called on the in-DO path, which has no phases.
      */
     onDispatchPhase?: (width: number, elapsedMs: number) => void;
+    /** Called once per non-empty submitMany with the route it took. */
+    onRoute?: (route: FanoutRoute) => void;
     /**
      * Cap on peer DOs this pool will spread one submitMany across. Defaults to
      * MAX_PEER_FANOUT. Tasks beyond the cap bucket into the peers that exist and
      * run through their in-peer pool, so lowering it trades peers for barriers
-     * without lowering total concurrency: each peer runs its bucket at
-     * concurrency 4, so N peers still resolve 4N tasks at once.
+     * without lowering total concurrency: each peer runs its bucket as wide as
+     * its own Dynamic Worker headroom allows.
      *
      * A caller sets this when its per-task work is small enough that a peer per
      * task buys nothing but round-trips — one task per peer costs ⌈tasks/
@@ -149,7 +157,7 @@ export interface FanoutOptions {
 }
 /**
  * Two-tier fan-out pool. Constructed by the supervisor DO; routes
- * each `submitMany` call automatically based on width.
+ * each `submitMany` call on the coordinator's live Dynamic Worker headroom.
  *
  * Lifetime: cheap to construct (no async init). Multiple submitMany
  * calls share NO state — each is dispatched fresh. The class
@@ -167,16 +175,16 @@ export declare class Fanout {
      * Dispatch `tasks` across the appropriate topology and return
      * results in input order.
      *
-     * Routing:
-     *   tasks.length < 5   -> coordinator-local IsolatePool
-     *   tasks.length >= 5  -> sibling NimbusSession DOs
+     * Routing, against the coordinator's Dynamic Worker headroom at call time:
+     *   tasks.length <= headroom -> coordinator-local IsolatePool, one Dynamic
+     *                               Worker per task, the width claimed on the
+     *                               ledger until the batch settles
+     *   tasks.length >  headroom -> sibling NimbusSession DOs
      *
-     * Backpressure: if `tasks.length > MAX_PEER_FANOUT (32)`, tasks
-     * are sharded modulo `MAX_PEER_FANOUT` and each shard's bucket
-     * runs serially inside its assigned peer DO via the in-peer
-     * IsolatePool's concurrency (capped at 4 there too). A
-     * single submitMany call returns when ALL tasks complete (or any
-     * throws).
+     * Peer shards: tasks hash onto min(tasks, maxPeers ?? MAX_PEER_FANOUT)
+     * peers and each peer runs its bucket through its own IsolatePool, as
+     * wide as that peer's headroom allows. A single submitMany call returns
+     * when ALL tasks complete (or any throws).
      *
      * `fn` is the user function executed per task. It runs INSIDE a
      * Worker Loader isolate (in the in-DO path) or inside a peer DO's
@@ -185,8 +193,8 @@ export declare class Fanout {
      * the vendored serializeFunction (same as IsolatePool#prepare).
      */
     submitMany<A, R>(tasks: FanoutTask<A>[], fn: FacetTaskFn<A, R>): Promise<R[]>;
-    /** Report which topology a task count uses without dispatching. */
-    topologyFor(taskCount: number): 'in-do' | 'peer-do' | 'empty';
+    /** The topology a task count would take against the headroom right now. */
+    topologyFor(taskCount: number): FanoutTopology | 'empty';
     /**
      * Compute the deterministic peer-DO id for a task key and peer count.
      *

package/dist/fanout.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"fanout.d.ts","sourceRoot":"","sources":["../src/fanout.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAIH,OAAO,EAAe,KAAK,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAIlE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAOtD;;+EAE+E;AAC/E,MAAM,WAAW,SAAS;IACxB,MAAM,CAAC,EAAE,YAAY,CAAC;IACtB,cAAc,CAAC,EAAE,OAAO,CAAC;CAC1B;AAED;;;;;;GAMG;AACH,eAAO,MAAM,eAAe,IAAI,CAAC;AAEjC;;;GAGG;AACH,eAAO,MAAM,eAAe,KAAK,CAAC;AAElC;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,4BAA4B,IAAI,CAAC;AAC9C,eAAO,MAAM,qBAAqB,UAAmB,CAAC;AAEtD;;;;;GAKG;AACH,eAAO,MAAM,wBAAwB,UAAqB,CAAC;AAE3D;;;;;;;;;;;;;;;;GAgBG;AACH,eAAO,MAAM,iBAAiB,IAAI,CAAC;AAEnC,uCAAuC;AACvC,MAAM,WAAW,UAAU,CAAC,CAAC;IAC3B;;;OAGG;IACH,GAAG,EAAE,MAAM,CAAC;IACZ,sCAAsC;IACtC,IAAI,EAAE,CAAC,CAAC;CACT;AAED,8CAA8C;AAC9C,MAAM,WAAW,aAAa;IAC5B;;;;;OAKG;IACH,GAAG,EAAE,MAAM,CAAC;IACZ;;;;OAIG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;OAGG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;OAGG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IAC1C;;;OAGG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACxC;;;OAGG;IACH,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB;;;;;;OAMG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;;;;OAKG;IACH,eAAe,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,KAAK,IAAI,CAAC;IAC7D;;;;;;;;;;OAUG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAWD;;;;;;;;GAQG;AACH,qBAAa,MAAM;IACjB,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAY;IAChC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAqB;IACzC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAgB;IACrC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;IACnC,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAS;gBAE5B,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,kBAAkB,EAAE,IAAI,EAAE,aAAa;IAoBzE;;;;;;;;;;;;;;;;;;;;OAoBG;IACG,UAAU,CAAC,CAAC,EAAE,CAAC,EACnB,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,EACtB,EAAE,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,GACpB,OAAO,CAAC,CAAC,EAAE,CAAC;IASf,mEAAmE;IACnE,WAAW,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,GAAG,SAAS,GAAG,OAAO;IAK7D;;;;;;OAMG;IACH,aAAa,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM;YAOvC,aAAa;YAoCb,eAAe;CA6J9B;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,CAUrE"}
+{"version":3,"file":"fanout.d.ts","sourceRoot":"","sources":["../src/fanout.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAIH,OAAO,EAAe,KAAK,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAKlE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAOtD;;+EAE+E;AAC/E,MAAM,WAAW,SAAS;IACxB,MAAM,CAAC,EAAE,YAAY,CAAC;IACtB,cAAc,CAAC,EAAE,OAAO,CAAC;CAC1B;AAED,kCAAkC;AAClC,MAAM,MAAM,cAAc,GAAG,OAAO,GAAG,SAAS,CAAC;AAEjD,2EAA2E;AAC3E,MAAM,WAAW,WAAW;IAC1B,QAAQ,EAAE,cAAc,CAAC;IACzB,oEAAoE;IACpE,KAAK,EAAE,MAAM,CAAC;IACd,2EAA2E;IAC3E,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED;;;GAGG;AACH,eAAO,MAAM,eAAe,KAAK,CAAC;AAElC;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,4BAA4B,IAAI,CAAC;AAC9C,eAAO,MAAM,qBAAqB,UAAmB,CAAC;AAEtD;;;;;GAKG;AACH,eAAO,MAAM,wBAAwB,UAAqB,CAAC;AAE3D;;;;;;;;;;;;;;;;GAgBG;AACH,eAAO,MAAM,iBAAiB,IAAI,CAAC;AAEnC,uCAAuC;AACvC,MAAM,WAAW,UAAU,CAAC,CAAC;IAC3B;;;OAGG;IACH,GAAG,EAAE,MAAM,CAAC;IACZ,sCAAsC;IACtC,IAAI,EAAE,CAAC,CAAC;CACT;AAED,8CAA8C;AAC9C,MAAM,WAAW,aAAa;IAC5B;;;;;OAKG;IACH,GAAG,EAAE,MAAM,CAAC;IACZ;;;;OAIG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;OAGG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;OAGG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IAC1C;;;OAGG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACxC;;;OAGG;IACH,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB;;;;;;OAMG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;;;;OAKG;IACH,eAAe,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,KAAK,IAAI,CAAC;IAC7D,mEAAmE;IACnE,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,WAAW,KAAK,IAAI,CAAC;IACvC;;;;;;;;;;OAUG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAWD;;;;;;;;GAQG;AACH,qBAAa,MAAM;IACjB,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAY;IAChC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAqB;IACzC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAgB;IACrC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;IACnC,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAS;gBAE5B,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,kBAAkB,EAAE,IAAI,EAAE,aAAa;IAoBzE;;;;;;;;;;;;;;;;;;;;OAoBG;IACG,UAAU,CAAC,CAAC,EAAE,CAAC,EACnB,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,EACtB,EAAE,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,GACpB,OAAO,CAAC,CAAC,EAAE,CAAC;IAcf,2EAA2E;IAC3E,WAAW,CAAC,SAAS,EAAE,MAAM,GAAG,cAAc,GAAG,OAAO;IAKxD;;;;;;OAMG;IACH,aAAa,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM;YAOvC,aAAa;YAgCb,eAAe;CA2J9B;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,CAUrE"}

package/dist/fanout.js

@@ -1,33 +1,30 @@
 /**
  * Two-tier fan-out primitive for work that must execute in Worker Loader
- * facets without tripping workerd's per-DO dynamic-worker ceiling.
+ * isolates within the Durable Object's Dynamic Worker budget.
  *
- * A single Durable Object method can drive at most four concurrent
- * Worker Loader fetches before extra dispatches serialize or fail. Small
- * batches therefore run in the coordinator DO through IsolatePool.
- * Wider batches are sharded across sibling NimbusSession DOs, each of
- * which owns its own four-loader budget.
+ * A Durable Object may have `DO_DYNAMIC_WORKER_LIMIT` distinct Dynamic
+ * Workers with in-flight requests, shared across every concurrent request to
+ * it (budgets.ts). A batch the coordinator's remaining headroom can hold —
+ * the limit less the workers it already has in flight (resident processes,
+ * the esbuild facet, a git network op) and other fan-outs' claims — runs in
+ * the coordinator through IsolatePool, one Dynamic Worker per task. Only a
+ * batch wider than that headroom is sharded across sibling NimbusSession
+ * DOs, each of which spends its own budget.
  *
- * Routing is deterministic: each task has a stable key, and the key maps
- * to a sibling DO shard. There is no silent fallback to width-1 execution;
- * missing LOADER or NIMBUS_SESSION bindings fail loudly so install and
- * runtime operations do not appear successful after partial dispatch.
+ * Routing is deterministic for a given headroom: each task has a stable key,
+ * and the key maps to a sibling DO shard. There is no silent fallback to
+ * width-1 execution; missing LOADER or NIMBUS_SESSION bindings fail loudly so
+ * install and runtime operations do not appear successful after partial
+ * dispatch.
  */
 import { serializeFunction } from './vendor/serialize.js';
 import { BindingError } from './vendor/errors.js';
 import { IsolatePool } from './isolate-pool.js';
+import { claimDynamicWorkers, dynamicWorkerHeadroom } from './budgets.js';
 import { hostRoute } from './composition.js';
 import { disposeRpcResource } from '@nimbus-sh/platform/rpc-dispose.js';
 import { classifyDoCall, describeError, isRetryableDoCall } from '@nimbus-sh/platform/oom-classify.js';
 import { hostNamespaceBinding, hostOpDispatch, } from './host-dispatch.js';
-/**
- * Threshold at which routing switches from coordinator-local loaders to
- * sibling Durable Objects.
- *
- * Set to **5** so the in-DO path stays below the V8 4-loaders-per-method
- * cap by construction. width < 5 stays local; width >= 5 uses sibling DOs.
- */
-export const IN_DO_THRESHOLD = 5;
 /**
  * Hard cap on concurrent peer DOs per single submitMany call. Throughput stays
  * flat through this width while keeping per-request scheduler pressure bounded.
@@ -78,7 +75,7 @@ function isPeerResult(value) {
 }
 /**
  * Two-tier fan-out pool. Constructed by the supervisor DO; routes
- * each `submitMany` call automatically based on width.
+ * each `submitMany` call on the coordinator's live Dynamic Worker headroom.
  *
  * Lifetime: cheap to construct (no async init). Multiple submitMany
  * calls share NO state — each is dispatched fresh. The class
@@ -112,16 +109,16 @@ export class Fanout {
      * Dispatch `tasks` across the appropriate topology and return
      * results in input order.
      *
-     * Routing:
-     *   tasks.length < 5   -> coordinator-local IsolatePool
-     *   tasks.length >= 5  -> sibling NimbusSession DOs
+     * Routing, against the coordinator's Dynamic Worker headroom at call time:
+     *   tasks.length <= headroom -> coordinator-local IsolatePool, one Dynamic
+     *                               Worker per task, the width claimed on the
+     *                               ledger until the batch settles
+     *   tasks.length >  headroom -> sibling NimbusSession DOs
      *
-     * Backpressure: if `tasks.length > MAX_PEER_FANOUT (32)`, tasks
-     * are sharded modulo `MAX_PEER_FANOUT` and each shard's bucket
-     * runs serially inside its assigned peer DO via the in-peer
-     * IsolatePool's concurrency (capped at 4 there too). A
-     * single submitMany call returns when ALL tasks complete (or any
-     * throws).
+     * Peer shards: tasks hash onto min(tasks, maxPeers ?? MAX_PEER_FANOUT)
+     * peers and each peer runs its bucket through its own IsolatePool, as
+     * wide as that peer's headroom allows. A single submitMany call returns
+     * when ALL tasks complete (or any throws).
      *
      * `fn` is the user function executed per task. It runs INSIDE a
      * Worker Loader isolate (in the in-DO path) or inside a peer DO's
@@ -132,16 +129,23 @@ export class Fanout {
     async submitMany(tasks, fn) {
         if (tasks.length === 0)
             return [];
-        if (tasks.length < IN_DO_THRESHOLD) {
-            return this._dispatchInDo(tasks, fn);
+        const headroom = dynamicWorkerHeadroom(this.ctx);
+        const claim = claimDynamicWorkers(this.ctx, tasks.length);
+        this.opts.onRoute?.({ topology: claim ? 'in-do' : 'peer-do', tasks: tasks.length, headroom });
+        if (!claim)
+            return this._dispatchPeerDo(tasks, fn);
+        try {
+            return await this._dispatchInDo(tasks, fn, claim);
+        }
+        finally {
+            claim.release();
         }
-        return this._dispatchPeerDo(tasks, fn);
     }
-    /** Report which topology a task count uses without dispatching. */
+    /** The topology a task count would take against the headroom right now. */
     topologyFor(taskCount) {
         if (taskCount === 0)
             return 'empty';
-        return taskCount < IN_DO_THRESHOLD ? 'in-do' : 'peer-do';
+        return taskCount <= dynamicWorkerHeadroom(this.ctx) ? 'in-do' : 'peer-do';
     }
     /**
      * Compute the deterministic peer-DO id for a task key and peer count.
@@ -155,14 +159,12 @@ export class Fanout {
         return `nbf:${this.opts.tag}:${this.coordDoIdShort}:${shard}`;
     }
     // ── Private: in-DO dispatch (in-DO fanout) ──────────────────────────────
-    async _dispatchInDo(tasks, fn) {
-        // Use the existing IsolatePool. Concurrency = task count
-        // (capped at 4 by constructor — tasks.length is already < 5
-        // here, so the cap won't bite). Each task = one pool.submit;
-        // pool.map runs them with stable-slot reuse.
-        const concurrency = Math.min(tasks.length, IN_DO_THRESHOLD - 1);
+    async _dispatchInDo(tasks, fn, claim) {
+        // One slot — one Dynamic Worker — per task; submitMany has claimed
+        // that width on the ledger, and the pool's dispatches are held inside it.
         const pool = new IsolatePool(this.env, this.ctx, {
-            concurrency,
+            concurrency: tasks.length,
+            claim,
             timeoutMs: this.opts.timeoutMs,
             tag: this.opts.tag,
             preamble: this.opts.preamble,
@@ -172,9 +174,6 @@ export class Fanout {
             supervisorPid: this.opts.supervisorPid,
         });
         try {
-            // pool.map runs the function over `items` with concurrency-bounded
-            // slot reuse. Each slot is one warm loader isolate; we get exactly
-            // `concurrency` loader isolates total — well under the 4-cap.
             const items = tasks.map((t) => t.args);
             const results = await pool.map(fn, items);
             // pool.map returns Array<R | null> (null on per-item failure with
@@ -200,10 +199,9 @@ export class Fanout {
         // loader isolates (keyed on fnHash) reuse across calls with
         // identical fns.
         const fnSource = serializeFunction(fn);
-        // Cap peer count at MAX_PEER_FANOUT. Tasks beyond N=32 are
-        // bucketed into existing shards — each shard's peer DO then
-        // runs its bucket through its in-DO IsolatePool.map
-        // (concurrency capped at 4 there).
+        // Cap peer count at maxPeers (default MAX_PEER_FANOUT). Tasks beyond
+        // it bucket into existing shards; each peer runs its bucket through
+        // its own IsolatePool, as wide as its own headroom allows.
         const peerCount = Math.min(tasks.length, this.opts.maxPeers ?? MAX_PEER_FANOUT);
         // Group tasks by deterministic shard. Same key → same shard, so
         // tests can predict which peer handles which task.
@@ -242,10 +240,9 @@ export class Fanout {
                     const peerStub = ns.get(id);
                     try {
                         const dispatch = hostOpDispatch(peerStub, `Fanout peer ${siblingName}`);
-                        // Each peer DO RPC call uses ONE LOADER worker on its side.
-                        // Supervisor → peer DO is a stub.fetch / RPC method call,
-                        // NOT an env.LOADER.get(); that's the cap-sidestep that
-                        // makes peer-DO fanout work.
+                        // A peer DO call is a Durable Object RPC, not a Dynamic Worker:
+                        // it spends none of this coordinator's budget, and the peer
+                        // spends its own.
                         const rpcResp = await dispatch({
                             op: 'fanoutExecute',
                             args: [

package/dist/fenced-work.d.ts

@@ -195,9 +195,9 @@ export declare class FencedWork<R extends FencedWorkRecord> {
      * Runs once per instance — re-calls in the same instance are no-ops — and
      * re-drives every row whose pid is `> 0` and at or below `generationBase()`
      * with `attempt < FENCED_WORK_MAX_ATTEMPT`; the rest are abandoned. What the
-     * re-drive resolver receives is the journalled recipe and nothing else:
-     * env and credentials are never written to storage, so the resolver's
-     * embedder re-resolves them rather than reading them back.
+     * re-drive resolver receives is the journalled record and nothing else: a
+     * host keeps env and secrets out of it, so the resolver's embedder
+     * re-resolves them rather than reading them back.
      */
     recoverInterrupted(): Promise<void>;
     /**

package/dist/fenced-work.js

@@ -183,9 +183,9 @@ export class FencedWork {
      * Runs once per instance — re-calls in the same instance are no-ops — and
      * re-drives every row whose pid is `> 0` and at or below `generationBase()`
      * with `attempt < FENCED_WORK_MAX_ATTEMPT`; the rest are abandoned. What the
-     * re-drive resolver receives is the journalled recipe and nothing else:
-     * env and credentials are never written to storage, so the resolver's
-     * embedder re-resolves them rather than reading them back.
+     * re-drive resolver receives is the journalled record and nothing else: a
+     * host keeps env and secrets out of it, so the resolver's embedder
+     * re-resolves them rather than reading them back.
      */
     async recoverInterrupted() {
         if (this.recovered)

package/dist/host-wasm.d.ts

@@ -0,0 +1,29 @@
+/**
+ * host-wasm.ts — what the fabric knows about a WebAssembly.Module a host
+ * hands a dynamic worker already compiled.
+ *
+ * workerd accepts a compiled module in a Worker Loader module map and lets
+ * the dynamic worker share its compiled code (src/workerd/api/
+ * worker-loader.c++, extractWasmModuleContent), so a host that bundles a
+ * fixed wasm (esbuild's, say) hands that module over instead of fetching a
+ * second copy of the bytes and having the guest compile them again. Two
+ * things the fabric needs about a member are unreadable from JS for a
+ * Module:
+ *   - its size: the module's wire bytes still count toward the 64 MiB
+ *     dynamic-worker code limit (worker-loader.c++ sums every member), and
+ *     assertModuleMapWithinCodeLimit must count them;
+ *   - its identity: a pool folds its wasm into the loader cache key, and a
+ *     Module has no bytes to fingerprint.
+ * The host that owns the module states both once, here.
+ */
+export interface HostWasmIdentity {
+    /** A stable name for the module's content, e.g. `esbuild@0.24.2`. */
+    readonly id: string;
+    /** The module's wire bytes: what it costs the dynamic-worker code budget. */
+    readonly bytes: number;
+}
+/** Record what `module` is, and return it. */
+export declare function describeHostWasm(module: WebAssembly.Module, identity: HostWasmIdentity): WebAssembly.Module;
+/** What a host said `module` is, or undefined for a module nobody described. */
+export declare function hostWasmIdentity(module: WebAssembly.Module): HostWasmIdentity | undefined;
+//# sourceMappingURL=host-wasm.d.ts.map

package/dist/host-wasm.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"host-wasm.d.ts","sourceRoot":"","sources":["../src/host-wasm.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,MAAM,WAAW,gBAAgB;IAC/B,qEAAqE;IACrE,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,6EAA6E;IAC7E,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAID,8CAA8C;AAC9C,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,EAAE,QAAQ,EAAE,gBAAgB,GAAG,WAAW,CAAC,MAAM,CAM3G;AAED,gFAAgF;AAChF,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,GAAG,gBAAgB,GAAG,SAAS,CAEzF"}

package/dist/host-wasm.js

@@ -0,0 +1,31 @@
+/**
+ * host-wasm.ts — what the fabric knows about a WebAssembly.Module a host
+ * hands a dynamic worker already compiled.
+ *
+ * workerd accepts a compiled module in a Worker Loader module map and lets
+ * the dynamic worker share its compiled code (src/workerd/api/
+ * worker-loader.c++, extractWasmModuleContent), so a host that bundles a
+ * fixed wasm (esbuild's, say) hands that module over instead of fetching a
+ * second copy of the bytes and having the guest compile them again. Two
+ * things the fabric needs about a member are unreadable from JS for a
+ * Module:
+ *   - its size: the module's wire bytes still count toward the 64 MiB
+ *     dynamic-worker code limit (worker-loader.c++ sums every member), and
+ *     assertModuleMapWithinCodeLimit must count them;
+ *   - its identity: a pool folds its wasm into the loader cache key, and a
+ *     Module has no bytes to fingerprint.
+ * The host that owns the module states both once, here.
+ */
+const described = new WeakMap();
+/** Record what `module` is, and return it. */
+export function describeHostWasm(module, identity) {
+    if (!Number.isSafeInteger(identity.bytes) || identity.bytes <= 0) {
+        throw new RangeError(`describeHostWasm: '${identity.id}' needs its wire size in bytes, got ${identity.bytes}`);
+    }
+    described.set(module, identity);
+    return module;
+}
+/** What a host said `module` is, or undefined for a module nobody described. */
+export function hostWasmIdentity(module) {
+    return described.get(module);
+}

package/dist/image-store.d.ts

@@ -105,7 +105,7 @@ export declare class ImageStore {
      * Writing the sources here, once, is what lets the session stop holding
      * them: after this returns, the only thing it keeps is a path.
      */
-    materialize(pid: number, images: AsyncIterable<readonly [string, string]> | Iterable<readonly [string, string]>, pacer: TurnBudget): Promise<Record<string, string>>;
+    materialize(pid: number, images: AsyncIterable<readonly [string, string | readonly string[]]> | Iterable<readonly [string, string | readonly string[]]>, pacer: TurnBudget): Promise<Record<string, string>>;
     /**
      * Drop every image no running process boots from.
      *

package/dist/image-store.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"image-store.d.ts","sourceRoot":"","sources":["../src/image-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAIH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAEnD;;;;;;;;;GASG;AACH,eAAO,MAAM,6BAA6B,QAA0D,CAAC;AAErG;;;;;GAKG;AACH,MAAM,WAAW,cAAc;IAC7B,iEAAiE;IACjE,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,wEAAwE;IACxE,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;IACpC,wEAAwE;IACxE,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,GAAG,IAAI,CAAC;IACjD,kDAAkD;IAClD,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,GAAG,IAAI,CAAC;IAClE,2EAA2E;IAC3E,IAAI,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;IAC5B,qDAAqD;IACrD,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;CAC5B;AAED;;;;;;;GAOG;AACH,qBAAa,UAAU;IAanB,OAAO,CAAC,QAAQ,CAAC,KAAK;IACtB,OAAO,CAAC,QAAQ,CAAC,MAAM;IAbzB,8EAA8E;IAC9E,OAAO,CAAC,cAAc,CAA+B;IACrD,OAAO,CAAC,QAAQ,CAAS;IAEzB;;;;;;OAMG;gBAEgB,KAAK,EAAE,MAAM,cAAc,EAC3B,MAAM,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,OAAO;IAGnD;;;;;;;;;;;;;;;;OAgBG;IACH,SAAS,IAAI,IAAI;IAOjB;;;;;;;;;;;;;;;;OAgBG;IACG,WAAW,CACf,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,aAAa,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EACtF,KAAK,EAAE,UAAU,GAChB,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAuDlC;;;;;;;;;;OAUG;IACH,OAAO,CAAC,KAAK;CAgBd"}
+{"version":3,"file":"image-store.d.ts","sourceRoot":"","sources":["../src/image-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAIH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAEnD;;;;;;;;;GASG;AACH,eAAO,MAAM,6BAA6B,QAA0D,CAAC;AAErG;;;;;GAKG;AACH,MAAM,WAAW,cAAc;IAC7B,iEAAiE;IACjE,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,wEAAwE;IACxE,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;IACpC,wEAAwE;IACxE,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,GAAG,IAAI,CAAC;IACjD,kDAAkD;IAClD,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,GAAG,IAAI,CAAC;IAClE,2EAA2E;IAC3E,IAAI,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;IAC5B,qDAAqD;IACrD,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;CAC5B;AAED;;;;;;;GAOG;AACH,qBAAa,UAAU;IAanB,OAAO,CAAC,QAAQ,CAAC,KAAK;IACtB,OAAO,CAAC,QAAQ,CAAC,MAAM;IAbzB,8EAA8E;IAC9E,OAAO,CAAC,cAAc,CAA+B;IACrD,OAAO,CAAC,QAAQ,CAAS;IAEzB;;;;;;OAMG;gBAEgB,KAAK,EAAE,MAAM,cAAc,EAC3B,MAAM,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,OAAO;IAGnD;;;;;;;;;;;;;;;;OAgBG;IACH,SAAS,IAAI,IAAI;IAOjB;;;;;;;;;;;;;;;;OAgBG;IACG,WAAW,CACf,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,aAAa,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CAAC,CAAC,EAC9H,KAAK,EAAE,UAAU,GAChB,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAuDlC;;;;;;;;;;OAUG;IACH,OAAO,CAAC,KAAK;CAgBd"}

package/dist/image-store.js

@@ -111,7 +111,7 @@ export class ImageStore {
         fs.mkdirp(FACET_IMAGE_DIR);
         let count = 0;
         for await (const [moduleName, source] of images) {
-            const bytes = new TextEncoder().encode(source);
+            const bytes = typeof source === 'string' ? new TextEncoder().encode(source) : encodeParts(source);
             const path = facetImagePath(await facetImageDigest(bytes));
             paths[moduleName] = path;
             rooted.push(path);
@@ -190,3 +190,35 @@ export class ImageStore {
         }
     }
 }
+/**
+ * UTF-8 bytes of an image given as ordered parts, encoded into one buffer a
+ * part at a time: joining the parts first would hold the whole image twice as
+ * text.
+ */
+function encodeParts(parts) {
+    let length = 0;
+    for (const part of parts) {
+        for (let i = 0; i < part.length; i++) {
+            const code = part.charCodeAt(i);
+            if (code < 0x80)
+                length += 1;
+            else if (code < 0x800)
+                length += 2;
+            else if (code >= 0xd800 && code <= 0xdbff && (part.charCodeAt(i + 1) & 0xfc00) === 0xdc00) {
+                length += 4;
+                i++;
+            }
+            else
+                length += 3;
+        }
+    }
+    const bytes = new Uint8Array(length);
+    const encoder = new TextEncoder();
+    let offset = 0;
+    for (const part of parts) {
+        const encoded = encoder.encode(part);
+        bytes.set(encoded, offset);
+        offset += encoded.byteLength;
+    }
+    return bytes;
+}