@selvajs/server 0.2.0-beta.2 → 0.2.0-beta.3

package/dist/compute/definition-byte-cache.js

@@ -0,0 +1,110 @@
+/**
+ * In-process cache of `.gh` definition bytes, keyed by immutable **version id**.
+ *
+ * The solve path used to eagerly `storage.get(fileKey)` on every request — moving
+ * multi-MB definition bytes off disk/S3 into memory before the scheduler could
+ * decide it didn't need them (the compute server already holds the definition via
+ * the pointer/`reuseServerDefinitionCache` fast path). This cache turns that eager
+ * read into a lazy `DefinitionRef.load()`: the scheduler calls `load()` ONLY when
+ * an upload is unavoidable, and even then a warm entry serves the bytes without
+ * touching storage. A pointer-known re-solve therefore moves ZERO definition bytes.
+ *
+ * Keying discipline (the whole reason this module exists):
+ *   - The key is the **version id**, an immutable UUID — never a `fileKey`, which
+ *     a delete-latest-then-reupload can REUSE for different content (see the
+ *     monotonic-version-number fix). A reused key would serve one version's bytes
+ *     for another: silent cache poisoning with no diagnostic. Callers pass
+ *     `version.id`, and the returned `DefinitionRef.key` is that same id, so the
+ *     scheduler's own result/pointer cache keys on the same immutable identity.
+ *
+ * Eviction:
+ *   - LRU by **total byte budget**, not entry count — definitions range from tens
+ *     of KB to hundreds of MB, so an entry-count cap would either pin gigabytes or
+ *     evict uselessly. `COMPUTE_DEFINITION_BYTE_CACHE_MB` sets the budget; `0`
+ *     disables the cache (every `getOrLoad` calls `load` and caches nothing).
+ *   - No TTL: version ids are immutable, so a cached entry can never go stale.
+ *   - An entry larger than the whole budget is served but never retained (caching
+ *     it would immediately evict everything including itself).
+ */
+/**
+ * Build a definition-byte cache with a total-byte LRU budget.
+ *
+ * @param maxBytes total retained-byte budget; `0` (or negative) disables caching
+ *   entirely — every `load()` calls the loader and nothing is retained.
+ */
+export function createDefinitionByteCache(maxBytes) {
+    const budget = Math.max(0, Math.floor(maxBytes));
+    // Map preserves insertion order → iteration order IS LRU order; re-inserting
+    // on access moves an entry to the most-recently-used (last) position.
+    const cache = new Map();
+    let retainedBytes = 0;
+    const stats = { hits: 0, misses: 0, evictions: 0 };
+    function touch(key, entry) {
+        cache.delete(key);
+        cache.set(key, entry);
+    }
+    function evictToFit() {
+        // Evict least-recently-used (first in insertion order) until within budget.
+        while (retainedBytes > budget && cache.size > 0) {
+            const oldestKey = cache.keys().next().value;
+            const oldest = cache.get(oldestKey);
+            cache.delete(oldestKey);
+            retainedBytes -= oldest.bytes.byteLength;
+            stats.evictions += 1;
+        }
+    }
+    function store(key, bytes) {
+        if (budget === 0)
+            return;
+        // An entry bigger than the whole budget is never retained — caching it would
+        // evict everything (including itself) on the next `evictToFit`. Serve it
+        // through, cache nothing.
+        if (bytes.byteLength > budget)
+            return;
+        const existing = cache.get(key);
+        if (existing)
+            retainedBytes -= existing.bytes.byteLength;
+        cache.set(key, { bytes });
+        retainedBytes += bytes.byteLength;
+        evictToFit();
+    }
+    return {
+        getOrLoad(versionId, load) {
+            const outcome = { loaded: false, fromCache: false };
+            return {
+                key: versionId,
+                outcome,
+                load: async () => {
+                    const hit = cache.get(versionId);
+                    if (hit) {
+                        touch(versionId, hit);
+                        stats.hits += 1;
+                        outcome.loaded = true;
+                        outcome.fromCache = true;
+                        return hit.bytes;
+                    }
+                    stats.misses += 1;
+                    outcome.loaded = true;
+                    outcome.fromCache = false;
+                    const bytes = await load();
+                    store(versionId, bytes);
+                    return bytes;
+                }
+            };
+        },
+        stats() {
+            return {
+                hits: stats.hits,
+                misses: stats.misses,
+                evictions: stats.evictions,
+                entries: cache.size,
+                bytes: retainedBytes
+            };
+        },
+        clear() {
+            cache.clear();
+            retainedBytes = 0;
+        }
+    };
+}
+//# sourceMappingURL=definition-byte-cache.js.map

package/dist/compute/definition-byte-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"definition-byte-cache.js","sourceRoot":"","sources":["../../src/compute/definition-byte-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AA2DH;;;;;GAKG;AACH,MAAM,UAAU,yBAAyB,CAAC,QAAgB;IACzD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;IACjD,6EAA6E;IAC7E,sEAAsE;IACtE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAiB,CAAC;IACvC,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,MAAM,KAAK,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;IAEnD,SAAS,KAAK,CAAC,GAAW,EAAE,KAAY;QACvC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAClB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACvB,CAAC;IAED,SAAS,UAAU;QAClB,4EAA4E;QAC5E,OAAO,aAAa,GAAG,MAAM,IAAI,KAAK,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACjD,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAe,CAAC;YACtD,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC;YACrC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YACxB,aAAa,IAAI,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC;YACzC,KAAK,CAAC,SAAS,IAAI,CAAC,CAAC;QACtB,CAAC;IACF,CAAC;IAED,SAAS,KAAK,CAAC,GAAW,EAAE,KAAiB;QAC5C,IAAI,MAAM,KAAK,CAAC;YAAE,OAAO;QACzB,6EAA6E;QAC7E,yEAAyE;QACzE,0BAA0B;QAC1B,IAAI,KAAK,CAAC,UAAU,GAAG,MAAM;YAAE,OAAO;QACtC,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChC,IAAI,QAAQ;YAAE,aAAa,IAAI,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC;QACzD,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;QAC1B,aAAa,IAAI,KAAK,CAAC,UAAU,CAAC;QAClC,UAAU,EAAE,CAAC;IACd,CAAC;IAED,OAAO;QACN,SAAS,CAAC,SAAS,EAAE,IAAI;YACxB,MAAM,OAAO,GAAmB,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;YACpE,OAAO;gBACN,GAAG,EAAE,SAAS;gBACd,OAAO;gBACP,IAAI,EAAE,KAAK,IAAI,EAAE;oBAChB,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;oBACjC,IAAI,GAAG,EAAE,CAAC;wBACT,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;wBACtB,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC;wBAChB,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;wBACtB,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC;wBACzB,OAAO,GAAG,CAAC,KAAK,CAAC;oBAClB,CAAC;oBACD,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC;oBAClB,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;oBACtB,OAAO,CAAC,SAAS,GAAG,KAAK,CAAC;oBAC1B,MAAM,KAAK,GAAG,MAAM,IAAI,EAAE,CAAC;oBAC3B,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;oBACxB,OAAO,KAAK,CAAC;gBACd,CAAC;aACD,CAAC;QACH,CAAC;QACD,KAAK;YACJ,OAAO;gBACN,IAAI,EAAE,KAAK,CAAC,IAAI;gBAChB,MAAM,EAAE,KAAK,CAAC,MAAM;gBACpB,SAAS,EAAE,KAAK,CAAC,SAAS;gBAC1B,OAAO,EAAE,KAAK,CAAC,IAAI;gBACnB,KAAK,EAAE,aAAa;aACpB,CAAC;QACH,CAAC;QACD,KAAK;YACJ,KAAK,CAAC,KAAK,EAAE,CAAC;YACd,aAAa,GAAG,CAAC,CAAC;QACnB,CAAC;KACD,CAAC;AACH,CAAC"}

package/dist/compute/index.d.ts

@@ -1,8 +1,13 @@
-export { resolveComputeLimits, readPositiveInt, readBool, type ComputeLimits, type EnvRecord } from './limits.js';
+export { resolveComputeLimits, readPositiveInt, readNonNegativeInt, readBool, type ComputeLimits, type EnvRecord } from './limits.js';
+export { createDefinitionByteCache, type DefinitionByteCache, type ByteCacheRef, type ByteCacheStats } from './definition-byte-cache.js';
+export { createMemorySolveResultCache, type MemorySolveResultCache, type SolveCacheStats } from './memory-solve-cache.js';
+export { deriveSolveCacheInputKey, type SolveCacheConfigSubset, type SolveCacheInputKey } from './solve-cache-key.js';
+export { encodeSolveCacheEntry, decodeSolveCacheEntry, gunzipEntryBody, type EnvelopeHeader, type DecodedSolveCacheEntry } from './solve-cache-envelope.js';
+export { createSolveCacheSingleFlight, type SolveCacheSingleFlight } from './solve-cache-single-flight.js';
 export { createComputeRateLimiter, type ComputeRateLimiter, type ComputeRateLimiterConfig, type RateLimitResult } from './rate-limit.js';
 export { isSafeRemoteDefinitionUrl, assertSafeRemoteDefinitionUrl } from './safe-url.js';
 export { transformInputParameter } from './transform-input.js';
 export { createClientCache, serverIdentity, type ClientCache, type ClientCacheConfig, type CachedClient, type ResolvedServer, type ServerIdentity } from './client-cache.js';
 export { createRemoteDefinitionFetcher, readBodyWithCap, type RemoteDefinitionFetcher, type RemoteDefinitionConfig } from './remote-definition.js';
-export { runSolvePipeline, COMPUTE_CONTRACT_VERSION, COMPUTE_VERSION_HEADER, type SolvePipelineArgs, type SolveOutcome, type SolveEnvelope, type SolvePhaseMetrics, type PipelineInput } from './solve-pipeline.js';
+export { runSolvePipeline, COMPUTE_CONTRACT_VERSION, COMPUTE_VERSION_HEADER, type SolvePipelineArgs, type SolvePipelineCacheHook, type SolveOutcome, type SolveEnvelope, type SolvePhaseMetrics, type PipelineInput } from './solve-pipeline.js';
 //# sourceMappingURL=index.d.ts.map

package/dist/compute/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/compute/index.ts"],"names":[],"mappings":"AAEA,OAAO,EACN,oBAAoB,EACpB,eAAe,EACf,QAAQ,EACR,KAAK,aAAa,EAClB,KAAK,SAAS,EACd,MAAM,aAAa,CAAC;AAErB,OAAO,EACN,wBAAwB,EACxB,KAAK,kBAAkB,EACvB,KAAK,wBAAwB,EAC7B,KAAK,eAAe,EACpB,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EAAE,yBAAyB,EAAE,6BAA6B,EAAE,MAAM,eAAe,CAAC;AAEzF,OAAO,EAAE,uBAAuB,EAAE,MAAM,sBAAsB,CAAC;AAE/D,OAAO,EACN,iBAAiB,EACjB,cAAc,EACd,KAAK,WAAW,EAChB,KAAK,iBAAiB,EACtB,KAAK,YAAY,EACjB,KAAK,cAAc,EACnB,KAAK,cAAc,EACnB,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EACN,6BAA6B,EAC7B,eAAe,EACf,KAAK,uBAAuB,EAC5B,KAAK,sBAAsB,EAC3B,MAAM,wBAAwB,CAAC;AAEhC,OAAO,EACN,gBAAgB,EAChB,wBAAwB,EACxB,sBAAsB,EACtB,KAAK,iBAAiB,EACtB,KAAK,YAAY,EACjB,KAAK,aAAa,EAClB,KAAK,iBAAiB,EACtB,KAAK,aAAa,EAClB,MAAM,qBAAqB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/compute/index.ts"],"names":[],"mappings":"AAEA,OAAO,EACN,oBAAoB,EACpB,eAAe,EACf,kBAAkB,EAClB,QAAQ,EACR,KAAK,aAAa,EAClB,KAAK,SAAS,EACd,MAAM,aAAa,CAAC;AAErB,OAAO,EACN,yBAAyB,EACzB,KAAK,mBAAmB,EACxB,KAAK,YAAY,EACjB,KAAK,cAAc,EACnB,MAAM,4BAA4B,CAAC;AAEpC,OAAO,EACN,4BAA4B,EAC5B,KAAK,sBAAsB,EAC3B,KAAK,eAAe,EACpB,MAAM,yBAAyB,CAAC;AAEjC,OAAO,EACN,wBAAwB,EACxB,KAAK,sBAAsB,EAC3B,KAAK,kBAAkB,EACvB,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EACN,qBAAqB,EACrB,qBAAqB,EACrB,eAAe,EACf,KAAK,cAAc,EACnB,KAAK,sBAAsB,EAC3B,MAAM,2BAA2B,CAAC;AAEnC,OAAO,EACN,4BAA4B,EAC5B,KAAK,sBAAsB,EAC3B,MAAM,gCAAgC,CAAC;AAExC,OAAO,EACN,wBAAwB,EACxB,KAAK,kBAAkB,EACvB,KAAK,wBAAwB,EAC7B,KAAK,eAAe,EACpB,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EAAE,yBAAyB,EAAE,6BAA6B,EAAE,MAAM,eAAe,CAAC;AAEzF,OAAO,EAAE,uBAAuB,EAAE,MAAM,sBAAsB,CAAC;AAE/D,OAAO,EACN,iBAAiB,EACjB,cAAc,EACd,KAAK,WAAW,EAChB,KAAK,iBAAiB,EACtB,KAAK,YAAY,EACjB,KAAK,cAAc,EACnB,KAAK,cAAc,EACnB,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EACN,6BAA6B,EAC7B,eAAe,EACf,KAAK,uBAAuB,EAC5B,KAAK,sBAAsB,EAC3B,MAAM,wBAAwB,CAAC;AAEhC,OAAO,EACN,gBAAgB,EAChB,wBAAwB,EACxB,sBAAsB,EACtB,KAAK,iBAAiB,EACtB,KAAK,sBAAsB,EAC3B,KAAK,YAAY,EACjB,KAAK,aAAa,EAClB,KAAK,iBAAiB,EACtB,KAAK,aAAa,EAClB,MAAM,qBAAqB,CAAC"}

package/dist/compute/index.js

@@ -1,5 +1,10 @@
 // Compute/solve server building blocks — transport-agnostic, env-injected.
-export { resolveComputeLimits, readPositiveInt, readBool } from './limits.js';
+export { resolveComputeLimits, readPositiveInt, readNonNegativeInt, readBool } from './limits.js';
+export { createDefinitionByteCache } from './definition-byte-cache.js';
+export { createMemorySolveResultCache } from './memory-solve-cache.js';
+export { deriveSolveCacheInputKey } from './solve-cache-key.js';
+export { encodeSolveCacheEntry, decodeSolveCacheEntry, gunzipEntryBody } from './solve-cache-envelope.js';
+export { createSolveCacheSingleFlight } from './solve-cache-single-flight.js';
 export { createComputeRateLimiter } from './rate-limit.js';
 export { isSafeRemoteDefinitionUrl, assertSafeRemoteDefinitionUrl } from './safe-url.js';
 export { transformInputParameter } from './transform-input.js';

package/dist/compute/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/compute/index.ts"],"names":[],"mappings":"AAAA,2EAA2E;AAE3E,OAAO,EACN,oBAAoB,EACpB,eAAe,EACf,QAAQ,EAGR,MAAM,aAAa,CAAC;AAErB,OAAO,EACN,wBAAwB,EAIxB,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EAAE,yBAAyB,EAAE,6BAA6B,EAAE,MAAM,eAAe,CAAC;AAEzF,OAAO,EAAE,uBAAuB,EAAE,MAAM,sBAAsB,CAAC;AAE/D,OAAO,EACN,iBAAiB,EACjB,cAAc,EAMd,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EACN,6BAA6B,EAC7B,eAAe,EAGf,MAAM,wBAAwB,CAAC;AAEhC,OAAO,EACN,gBAAgB,EAChB,wBAAwB,EACxB,sBAAsB,EAMtB,MAAM,qBAAqB,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/compute/index.ts"],"names":[],"mappings":"AAAA,2EAA2E;AAE3E,OAAO,EACN,oBAAoB,EACpB,eAAe,EACf,kBAAkB,EAClB,QAAQ,EAGR,MAAM,aAAa,CAAC;AAErB,OAAO,EACN,yBAAyB,EAIzB,MAAM,4BAA4B,CAAC;AAEpC,OAAO,EACN,4BAA4B,EAG5B,MAAM,yBAAyB,CAAC;AAEjC,OAAO,EACN,wBAAwB,EAGxB,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EACN,qBAAqB,EACrB,qBAAqB,EACrB,eAAe,EAGf,MAAM,2BAA2B,CAAC;AAEnC,OAAO,EACN,4BAA4B,EAE5B,MAAM,gCAAgC,CAAC;AAExC,OAAO,EACN,wBAAwB,EAIxB,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EAAE,yBAAyB,EAAE,6BAA6B,EAAE,MAAM,eAAe,CAAC;AAEzF,OAAO,EAAE,uBAAuB,EAAE,MAAM,sBAAsB,CAAC;AAE/D,OAAO,EACN,iBAAiB,EACjB,cAAc,EAMd,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EACN,6BAA6B,EAC7B,eAAe,EAGf,MAAM,wBAAwB,CAAC;AAEhC,OAAO,EACN,gBAAgB,EAChB,wBAAwB,EACxB,sBAAsB,EAOtB,MAAM,qBAAqB,CAAC"}

package/dist/compute/limits.d.ts

@@ -24,6 +24,13 @@ export type EnvRecord = Record<string, string | undefined>;
  * + falls back when present but not a finite positive number.
  */
 export declare function readPositiveInt(env: EnvRecord, name: string, fallback: number): number;
+/**
+ * Parse a non-negative integer env value — like {@link readPositiveInt} but `0`
+ * is a valid value (used by knobs where `0` means "disable", e.g. a cache
+ * budget). Returns `fallback` when absent, and warns + falls back when present
+ * but not a finite non-negative number.
+ */
+export declare function readNonNegativeInt(env: EnvRecord, name: string, fallback: number): number;
 /**
  * Parse a boolean env flag. Accepts `true/1/yes/on` (case-insensitive) as true
  * and `false/0/no/off` as false; any other / absent value falls back.
@@ -102,6 +109,51 @@ export interface ComputeLimits {
      * app instances each apply their own cap.
      */
     computeMaxConcurrentSolves: number;
+    /**
+     * Backpressure — max solves allowed to WAIT in the per-server FIFO queue (i.e.
+     * excluding the `computeMaxConcurrentSolves` already in flight). A solve that
+     * arrives to a full queue is shed immediately (scheduler `QUEUE_FULL`, mapped
+     * to HTTP 503 + `Retry-After`) instead of piling up unbounded. `0` = unbounded
+     * (the pre-shedding default): the queue grows without limit, matching prior
+     * behavior. Size it to roughly 2–3× `computeMaxConcurrentSolves` once the
+     * Rhino pool's real capacity is known — shedding fast beats a hung request.
+     */
+    computeMaxQueueDepth: number;
+    /**
+     * Backpressure — longest (ms) a solve may sit QUEUED before it starts
+     * executing; still-waiting past this it's shed (scheduler `QUEUE_TIMEOUT` →
+     * HTTP 503 + `Retry-After`) rather than burning compute on a stale request.
+     * Bounds tail latency: the scheduler's `timeoutMs` clock starts at execution,
+     * so without this a solve's total wait is unbounded and invisible. `0` = no
+     * queue deadline (the default). A sensible tuned value is ≈ `maxSolveDurationMs`.
+     */
+    computeQueueWaitMs: number;
+    /**
+     * Total-byte budget (bytes) for the in-process definition-byte cache keyed on
+     * immutable version id. A warm entry lets a solve skip `storage.get` entirely,
+     * and a pointer-known solve never loads bytes at all. `0` disables the cache
+     * (every solve re-reads storage). Sized as a total-byte LRU because definitions
+     * span KB→hundreds of MB; env value is MB, converted here.
+     */
+    computeDefinitionByteCacheBytes: number;
+    /**
+     * Default per-definition entry quota for the durable L2 solve cache (H1), used
+     * when a definition's `solveCacheLimit` is absent (inherit). A definition may
+     * override this; `0` on the definition turns caching off for it. This global
+     * default `0` means the L2 is effectively off until an operator sets a quota —
+     * safe because the memory backend also ships only under
+     * `SOLVE_CACHE_PROVIDER=memory`. Counts, not bytes: authors think in "how many
+     * solves to remember"; the byte backstop below is the operator's memory guard.
+     */
+    solveCacheDefaultMaxEntries: number;
+    /**
+     * Global byte backstop (bytes) across ALL definitions' L2 entries, evicted
+     * global-LRU regardless of per-definition counts. Entries range KB→100s of MB,
+     * so a count quota alone can't bound memory. `0` disables the backstop (rely on
+     * per-definition counts only — not recommended in the memory backend). Env value
+     * is MB, converted here. On Redis this moves to `maxmemory allkeys-lru`.
+     */
+    solveCacheMaxTotalBytes: number;
 }
 /**
  * Resolve every server-side compute limit from an env map. Pure: the same env

package/dist/compute/limits.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"limits.d.ts","sourceRoot":"","sources":["../../src/compute/limits.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAIH,gFAAgF;AAChF,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC,CAAC;AAE3D;;;GAGG;AACH,wBAAgB,eAAe,CAAC,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAStF;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,GAAG,OAAO,CAQjF;AAED,iDAAiD;AACjD,MAAM,WAAW,aAAa;IAC7B;;;;;;;;;OASG;IACH,kBAAkB,EAAE,MAAM,CAAC;IAC3B,iFAAiF;IACjF,iBAAiB,EAAE,MAAM,CAAC;IAC1B,oBAAoB,EAAE,MAAM,CAAC;IAC7B;;;;OAIG;IACH,aAAa,EAAE,MAAM,CAAC;IACtB,gBAAgB,EAAE,MAAM,CAAC;IACzB;;;;OAIG;IACH,sBAAsB,EAAE,MAAM,CAAC;IAC/B;;;;;OAKG;IACH,uBAAuB,EAAE,MAAM,CAAC;IAChC,yEAAyE;IACzE,wBAAwB,EAAE,MAAM,CAAC;IACjC,wEAAwE;IACxE,8BAA8B,EAAE,MAAM,CAAC;IACvC,yDAAyD;IACzD,oBAAoB,EAAE,MAAM,CAAC;IAC7B;;;;;;OAMG;IACH,2BAA2B,EAAE,OAAO,CAAC;IACrC;;;;OAIG;IACH,uBAAuB,EAAE,OAAO,CAAC;IACjC;;;;;OAKG;IACH,yBAAyB,EAAE,OAAO,CAAC;IACnC;;;;;;;;OAQG;IACH,0BAA0B,EAAE,MAAM,CAAC;CACnC;AAED;;;;GAIG;AACH,wBAAgB,oBAAoB,CAAC,GAAG,EAAE,SAAS,GAAG,aAAa,CAwBlE"}
+{"version":3,"file":"limits.d.ts","sourceRoot":"","sources":["../../src/compute/limits.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAIH,gFAAgF;AAChF,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC,CAAC;AAE3D;;;GAGG;AACH,wBAAgB,eAAe,CAAC,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAStF;AAED;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CASzF;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,GAAG,OAAO,CAQjF;AAED,iDAAiD;AACjD,MAAM,WAAW,aAAa;IAC7B;;;;;;;;;OASG;IACH,kBAAkB,EAAE,MAAM,CAAC;IAC3B,iFAAiF;IACjF,iBAAiB,EAAE,MAAM,CAAC;IAC1B,oBAAoB,EAAE,MAAM,CAAC;IAC7B;;;;OAIG;IACH,aAAa,EAAE,MAAM,CAAC;IACtB,gBAAgB,EAAE,MAAM,CAAC;IACzB;;;;OAIG;IACH,sBAAsB,EAAE,MAAM,CAAC;IAC/B;;;;;OAKG;IACH,uBAAuB,EAAE,MAAM,CAAC;IAChC,yEAAyE;IACzE,wBAAwB,EAAE,MAAM,CAAC;IACjC,wEAAwE;IACxE,8BAA8B,EAAE,MAAM,CAAC;IACvC,yDAAyD;IACzD,oBAAoB,EAAE,MAAM,CAAC;IAC7B;;;;;;OAMG;IACH,2BAA2B,EAAE,OAAO,CAAC;IACrC;;;;OAIG;IACH,uBAAuB,EAAE,OAAO,CAAC;IACjC;;;;;OAKG;IACH,yBAAyB,EAAE,OAAO,CAAC;IACnC;;;;;;;;OAQG;IACH,0BAA0B,EAAE,MAAM,CAAC;IACnC;;;;;;;;OAQG;IACH,oBAAoB,EAAE,MAAM,CAAC;IAC7B;;;;;;;OAOG;IACH,kBAAkB,EAAE,MAAM,CAAC;IAC3B;;;;;;OAMG;IACH,+BAA+B,EAAE,MAAM,CAAC;IACxC;;;;;;;;OAQG;IACH,2BAA2B,EAAE,MAAM,CAAC;IACpC;;;;;;OAMG;IACH,uBAAuB,EAAE,MAAM,CAAC;CAChC;AAED;;;;GAIG;AACH,wBAAgB,oBAAoB,CAAC,GAAG,EAAE,SAAS,GAAG,aAAa,CAwClE"}

package/dist/compute/limits.js

@@ -33,6 +33,23 @@ export function readPositiveInt(env, name, fallback) {
     }
     return Math.floor(parsed);
 }
+/**
+ * Parse a non-negative integer env value — like {@link readPositiveInt} but `0`
+ * is a valid value (used by knobs where `0` means "disable", e.g. a cache
+ * budget). Returns `fallback` when absent, and warns + falls back when present
+ * but not a finite non-negative number.
+ */
+export function readNonNegativeInt(env, name, fallback) {
+    const raw = env[name];
+    if (!raw)
+        return fallback;
+    const parsed = Number(raw);
+    if (!Number.isFinite(parsed) || parsed < 0) {
+        console.warn(`[selva] Invalid ${name}=${raw}, falling back to ${fallback}`);
+        return fallback;
+    }
+    return Math.floor(parsed);
+}
 /**
  * Parse a boolean env flag. Accepts `true/1/yes/on` (case-insensitive) as true
  * and `false/0/no/off` as false; any other / absent value falls back.
@@ -72,7 +89,22 @@ export function resolveComputeLimits(env) {
         computeServerCachesolve: readBool(env, 'COMPUTE_SERVER_CACHESOLVE', true),
         computeCacheErroredSolves: readBool(env, 'COMPUTE_CACHE_ERRORED_SOLVES', false),
         // 4 matches rhino.compute's default --childcount; tune to the actual VM.
-        computeMaxConcurrentSolves: readPositiveInt(env, 'COMPUTE_MAX_CONCURRENT', 4)
+        computeMaxConcurrentSolves: readPositiveInt(env, 'COMPUTE_MAX_CONCURRENT', 4),
+        // Both 0 (unbounded / no deadline) by default — nothing sheds until an
+        // operator who's measured their pool opts in. readNonNegativeInt so `0` is a
+        // valid "disabled" value, not treated as invalid.
+        computeMaxQueueDepth: readNonNegativeInt(env, 'COMPUTE_MAX_QUEUE_DEPTH', 0),
+        computeQueueWaitMs: readNonNegativeInt(env, 'COMPUTE_QUEUE_WAIT_MS', 0),
+        // Env is MB; 0 disables. Default 256 MB holds a handful of typical
+        // definitions warm without pinning gigabytes. readNonNegativeInt so `0`
+        // (disable) is honored rather than treated as invalid.
+        computeDefinitionByteCacheBytes: readNonNegativeInt(env, 'COMPUTE_DEFINITION_BYTE_CACHE_MB', 256) * MB,
+        // L2 durable solve cache (H1). Default per-definition quota 0 = inherit-to-off
+        // until an operator opts in; the memory backend also only mounts under
+        // SOLVE_CACHE_PROVIDER=memory, so nothing caches by accident. Byte backstop
+        // 512 MB caps total heap use across all definitions (env is MB).
+        solveCacheDefaultMaxEntries: readNonNegativeInt(env, 'SOLVE_CACHE_DEFAULT_MAX_ENTRIES', 0),
+        solveCacheMaxTotalBytes: readNonNegativeInt(env, 'SOLVE_CACHE_MAX_TOTAL_MB', 512) * MB
     };
 }
 //# sourceMappingURL=limits.js.map

package/dist/compute/limits.js.map

@@ -1 +1 @@
-{"version":3,"file":"limits.js","sourceRoot":"","sources":["../../src/compute/limits.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,MAAM,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;AAKvB;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,GAAc,EAAE,IAAY,EAAE,QAAgB;IAC7E,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;IACtB,IAAI,CAAC,GAAG;QAAE,OAAO,QAAQ,CAAC;IAC1B,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IAC3B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC;QAC7C,OAAO,CAAC,IAAI,CAAC,mBAAmB,IAAI,IAAI,GAAG,qBAAqB,QAAQ,EAAE,CAAC,CAAC;QAC5E,OAAO,QAAQ,CAAC;IACjB,CAAC;IACD,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;AAC3B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,QAAQ,CAAC,GAAc,EAAE,IAAY,EAAE,QAAiB;IACvE,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;IACtB,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,KAAK,EAAE;QAAE,OAAO,QAAQ,CAAC;IAC/C,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACnC,IAAI,CAAC,KAAK,MAAM,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IACxE,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,KAAK;QAAE,OAAO,KAAK,CAAC;IAC1E,OAAO,CAAC,IAAI,CAAC,mBAAmB,IAAI,IAAI,GAAG,qBAAqB,QAAQ,EAAE,CAAC,CAAC;IAC5E,OAAO,QAAQ,CAAC;AACjB,CAAC;AA6ED;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAAC,GAAc;IAClD,MAAM,aAAa,GAAG,eAAe,CAAC,GAAG,EAAE,wBAAwB,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC;IAC/E,OAAO;QACN,kBAAkB,EAAE,eAAe,CAAC,GAAG,EAAE,uBAAuB,EAAE,OAAO,CAAC;QAC1E,iBAAiB,EAAE,eAAe,CAAC,GAAG,EAAE,8BAA8B,EAAE,OAAO,CAAC;QAChF,oBAAoB,EAAE,eAAe,CAAC,GAAG,EAAE,wBAAwB,EAAE,GAAG,CAAC;QACzE,aAAa;QACb,gBAAgB,EAAE,eAAe,CAAC,GAAG,EAAE,2BAA2B,EAAE,EAAE,GAAG,EAAE,CAAC;QAC5E,sBAAsB,EAAE,eAAe,CAAC,GAAG,EAAE,2BAA2B,EAAE,GAAG,GAAG,EAAE,CAAC;QACnF,uBAAuB,EAAE,eAAe,CAAC,GAAG,EAAE,4BAA4B,EAAE,GAAG,GAAG,EAAE,CAAC;QACrF,qEAAqE;QACrE,wBAAwB,EAAE,aAAa;QACvC,8BAA8B,EAAE,eAAe,CAC9C,GAAG,EACH,oCAAoC,EACpC,MAAM,CACN;QACD,oBAAoB,EAAE,eAAe,CAAC,GAAG,EAAE,yBAAyB,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;QACpF,2BAA2B,EAAE,QAAQ,CAAC,GAAG,EAAE,gCAAgC,EAAE,IAAI,CAAC;QAClF,uBAAuB,EAAE,QAAQ,CAAC,GAAG,EAAE,2BAA2B,EAAE,IAAI,CAAC;QACzE,yBAAyB,EAAE,QAAQ,CAAC,GAAG,EAAE,8BAA8B,EAAE,KAAK,CAAC;QAC/E,yEAAyE;QACzE,0BAA0B,EAAE,eAAe,CAAC,GAAG,EAAE,wBAAwB,EAAE,CAAC,CAAC;KAC7E,CAAC;AACH,CAAC"}
+{"version":3,"file":"limits.js","sourceRoot":"","sources":["../../src/compute/limits.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,MAAM,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;AAKvB;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,GAAc,EAAE,IAAY,EAAE,QAAgB;IAC7E,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;IACtB,IAAI,CAAC,GAAG;QAAE,OAAO,QAAQ,CAAC;IAC1B,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IAC3B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC;QAC7C,OAAO,CAAC,IAAI,CAAC,mBAAmB,IAAI,IAAI,GAAG,qBAAqB,QAAQ,EAAE,CAAC,CAAC;QAC5E,OAAO,QAAQ,CAAC;IACjB,CAAC;IACD,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;AAC3B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAAC,GAAc,EAAE,IAAY,EAAE,QAAgB;IAChF,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;IACtB,IAAI,CAAC,GAAG;QAAE,OAAO,QAAQ,CAAC;IAC1B,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IAC3B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5C,OAAO,CAAC,IAAI,CAAC,mBAAmB,IAAI,IAAI,GAAG,qBAAqB,QAAQ,EAAE,CAAC,CAAC;QAC5E,OAAO,QAAQ,CAAC;IACjB,CAAC;IACD,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;AAC3B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,QAAQ,CAAC,GAAc,EAAE,IAAY,EAAE,QAAiB;IACvE,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;IACtB,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,KAAK,EAAE;QAAE,OAAO,QAAQ,CAAC;IAC/C,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACnC,IAAI,CAAC,KAAK,MAAM,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IACxE,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,KAAK;QAAE,OAAO,KAAK,CAAC;IAC1E,OAAO,CAAC,IAAI,CAAC,mBAAmB,IAAI,IAAI,GAAG,qBAAqB,QAAQ,EAAE,CAAC,CAAC;IAC5E,OAAO,QAAQ,CAAC;AACjB,CAAC;AA0HD;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAAC,GAAc;IAClD,MAAM,aAAa,GAAG,eAAe,CAAC,GAAG,EAAE,wBAAwB,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC;IAC/E,OAAO;QACN,kBAAkB,EAAE,eAAe,CAAC,GAAG,EAAE,uBAAuB,EAAE,OAAO,CAAC;QAC1E,iBAAiB,EAAE,eAAe,CAAC,GAAG,EAAE,8BAA8B,EAAE,OAAO,CAAC;QAChF,oBAAoB,EAAE,eAAe,CAAC,GAAG,EAAE,wBAAwB,EAAE,GAAG,CAAC;QACzE,aAAa;QACb,gBAAgB,EAAE,eAAe,CAAC,GAAG,EAAE,2BAA2B,EAAE,EAAE,GAAG,EAAE,CAAC;QAC5E,sBAAsB,EAAE,eAAe,CAAC,GAAG,EAAE,2BAA2B,EAAE,GAAG,GAAG,EAAE,CAAC;QACnF,uBAAuB,EAAE,eAAe,CAAC,GAAG,EAAE,4BAA4B,EAAE,GAAG,GAAG,EAAE,CAAC;QACrF,qEAAqE;QACrE,wBAAwB,EAAE,aAAa;QACvC,8BAA8B,EAAE,eAAe,CAC9C,GAAG,EACH,oCAAoC,EACpC,MAAM,CACN;QACD,oBAAoB,EAAE,eAAe,CAAC,GAAG,EAAE,yBAAyB,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;QACpF,2BAA2B,EAAE,QAAQ,CAAC,GAAG,EAAE,gCAAgC,EAAE,IAAI,CAAC;QAClF,uBAAuB,EAAE,QAAQ,CAAC,GAAG,EAAE,2BAA2B,EAAE,IAAI,CAAC;QACzE,yBAAyB,EAAE,QAAQ,CAAC,GAAG,EAAE,8BAA8B,EAAE,KAAK,CAAC;QAC/E,yEAAyE;QACzE,0BAA0B,EAAE,eAAe,CAAC,GAAG,EAAE,wBAAwB,EAAE,CAAC,CAAC;QAC7E,uEAAuE;QACvE,6EAA6E;QAC7E,kDAAkD;QAClD,oBAAoB,EAAE,kBAAkB,CAAC,GAAG,EAAE,yBAAyB,EAAE,CAAC,CAAC;QAC3E,kBAAkB,EAAE,kBAAkB,CAAC,GAAG,EAAE,uBAAuB,EAAE,CAAC,CAAC;QACvE,mEAAmE;QACnE,wEAAwE;QACxE,uDAAuD;QACvD,+BAA+B,EAC9B,kBAAkB,CAAC,GAAG,EAAE,kCAAkC,EAAE,GAAG,CAAC,GAAG,EAAE;QACtE,+EAA+E;QAC/E,uEAAuE;QACvE,4EAA4E;QAC5E,iEAAiE;QACjE,2BAA2B,EAAE,kBAAkB,CAAC,GAAG,EAAE,iCAAiC,EAAE,CAAC,CAAC;QAC1F,uBAAuB,EAAE,kBAAkB,CAAC,GAAG,EAAE,0BAA0B,EAAE,GAAG,CAAC,GAAG,EAAE;KACtF,CAAC;AACH,CAAC"}

package/dist/compute/memory-solve-cache.d.ts

@@ -0,0 +1,58 @@
+/**
+ * In-memory `ISolveResultCache` — the first durable L2 backend (H1).
+ *
+ * Two eviction dimensions, both required (see CACHING.md H1):
+ *
+ *   1. **Per-definition count quota, LRU-within-definition.** Each definition
+ *      gets its own budget of remembered solves (`maxEntriesForDefinition`,
+ *      passed at write time). A slider-heavy definition churns ONLY its own
+ *      entries — it can never evict another definition's. This is what makes a
+ *      wide-input-space definition harmless structurally instead of via an
+ *      off-switch.
+ *   2. **Global byte backstop, global-LRU.** Entries range KB→100s of MB, so a
+ *      count quota can't bound heap. `maxTotalBytes` evicts the globally
+ *      least-recently-used entry across every definition until total retained
+ *      bytes fit. Authors think in counts; operators think in bytes; both hold.
+ *
+ * The key is `(orgId, definitionId, versionId, inputKey)`. `definitionId` scopes
+ * the count quota; the full tuple addresses the entry. Version keying means a
+ * publish is a fresh keyspace and there is nothing to invalidate — entries just
+ * age out under the two budgets.
+ *
+ * Best-effort contract: this never throws. A `get` miss and a `set` drop are both
+ * normal. Correctness never depends on a hit.
+ */
+import type { ISolveResultCache } from '@selvajs/platform';
+/** Observability counters for the admin/debug surface (parallels ByteCacheStats). */
+export interface SolveCacheStats {
+    /** `get` served a live entry. */
+    hits: number;
+    /** `get` found nothing. */
+    misses: number;
+    /** `set` stored a new (or replaced) entry. */
+    writes: number;
+    /** Entries dropped by the per-definition count quota. */
+    quotaEvictions: number;
+    /** Entries dropped by the global byte backstop. */
+    byteEvictions: number;
+    /** Current retained entry count across all definitions. */
+    entries: number;
+    /** Current retained bytes across all definitions. */
+    bytes: number;
+}
+/** A memory backend with its own stats, for wiring + observability. */
+export interface MemorySolveResultCache extends ISolveResultCache {
+    stats(): SolveCacheStats;
+    /** Drop everything (test seam). */
+    clear(): void;
+}
+/**
+ * Build an in-memory L2 solve cache.
+ *
+ * @param maxTotalBytes global retained-byte backstop; `0` (or negative) disables
+ *   the backstop (per-definition counts are then the only bound — not recommended
+ *   in-process). An entry larger than the whole backstop is stored-then-immediately
+ *   evicted (served through, never retained) — same rule as the byte cache.
+ */
+export declare function createMemorySolveResultCache(maxTotalBytes: number): MemorySolveResultCache;
+//# sourceMappingURL=memory-solve-cache.d.ts.map

package/dist/compute/memory-solve-cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-solve-cache.d.ts","sourceRoot":"","sources":["../../src/compute/memory-solve-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,OAAO,KAAK,EACX,iBAAiB,EAIjB,MAAM,mBAAmB,CAAC;AAE3B,qFAAqF;AACrF,MAAM,WAAW,eAAe;IAC/B,iCAAiC;IACjC,IAAI,EAAE,MAAM,CAAC;IACb,2BAA2B;IAC3B,MAAM,EAAE,MAAM,CAAC;IACf,8CAA8C;IAC9C,MAAM,EAAE,MAAM,CAAC;IACf,yDAAyD;IACzD,cAAc,EAAE,MAAM,CAAC;IACvB,mDAAmD;IACnD,aAAa,EAAE,MAAM,CAAC;IACtB,2DAA2D;IAC3D,OAAO,EAAE,MAAM,CAAC;IAChB,qDAAqD;IACrD,KAAK,EAAE,MAAM,CAAC;CACd;AAED,uEAAuE;AACvE,MAAM,WAAW,sBAAuB,SAAQ,iBAAiB;IAChE,KAAK,IAAI,eAAe,CAAC;IACzB,mCAAmC;IACnC,KAAK,IAAI,IAAI,CAAC;CACd;AAOD;;;;;;;GAOG;AACH,wBAAgB,4BAA4B,CAAC,aAAa,EAAE,MAAM,GAAG,sBAAsB,CAoI1F"}

package/dist/compute/memory-solve-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-solve-cache.js","sourceRoot":"","sources":["../../src/compute/memory-solve-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAuCH;;;;;;;GAOG;AACH,MAAM,UAAU,4BAA4B,CAAC,aAAqB;IACjE,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;IAC1D,6EAA6E;IAC7E,6EAA6E;IAC7E,kEAAkE;IAClE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAiB,CAAC;IACvC,8EAA8E;IAC9E,iFAAiF;IACjF,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;IACjD,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,MAAM,KAAK,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC;IAErF,SAAS,UAAU,CAAC,GAAkB;QACrC,4EAA4E;QAC5E,wEAAwE;QACxE,OAAO,GAAG,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,YAAY,IAAI,GAAG,CAAC,SAAS,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;IAC5E,CAAC;IAED,SAAS,OAAO,CAAC,YAAoB;QACpC,IAAI,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAC1C,IAAI,CAAC,IAAI,EAAE,CAAC;YACX,IAAI,GAAG,EAAE,CAAC;YACV,YAAY,CAAC,GAAG,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QACtC,CAAC;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAED,SAAS,iBAAiB,CAAC,YAAoB,EAAE,CAAS;QACzD,MAAM,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAC5C,IAAI,CAAC,IAAI;YAAE,OAAO;QAClB,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,CAAC,KAAK,CAAC,CAAC;YAAE,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,YAAY,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;IAC1D,CAAC;IAED,qEAAqE;IACrE,SAAS,IAAI,CAAC,CAAS;QACtB,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,CAAC,KAAK;YAAE,OAAO;QACnB,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChB,aAAa,IAAI,KAAK,CAAC,KAAK,CAAC,UAAU,CAAC;QACxC,iBAAiB,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED,wFAAwF;IACxF,SAAS,KAAK,CAAC,CAAS,EAAE,KAAY;QACrC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChB,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACpB,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QACzC,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,CAAC,KAAK,CAAC,CAAC;YAAE,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IAED,SAAS,UAAU,CAAC,YAAoB,EAAE,UAAkB;QAC3D,MAAM,IAAI,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC;QACnC,0EAA0E;QAC1E,OAAO,IAAI,CAAC,MAAM,GAAG,UAAU,EAAE,CAAC;YACjC,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,gDAAgD;YAC9D,KAAK,CAAC,cAAc,IAAI,CAAC,CAAC;QAC3B,CAAC;IACF,CAAC;IAED,SAAS,iBAAiB;QACzB,IAAI,UAAU,KAAK,CAAC;YAAE,OAAO;QAC7B,OAAO,aAAa,GAAG,UAAU,IAAI,KAAK,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACrD,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAe,CAAC;YACtD,IAAI,CAAC,SAAS,CAAC,CAAC;YAChB,KAAK,CAAC,aAAa,IAAI,CAAC,CAAC;QAC1B,CAAC;IACF,CAAC;IAED,OAAO;QACN,KAAK,CAAC,GAAG,CAAC,IAAoB,EAAE,GAAkB;YACjD,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;YAC1B,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,CAAC,KAAK,EAAE,CAAC;gBACZ,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC;gBAClB,OAAO,IAAI,CAAC;YACb,CAAC;YACD,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAChB,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC;YAChB,OAAO,KAAK,CAAC,KAAK,CAAC;QACpB,CAAC;QAED,KAAK,CAAC,GAAG,CACR,IAAoB,EACpB,GAAkB,EAClB,KAAiB,EACjB,IAA0B;YAE1B,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC,CAAC;YACzE,2EAA2E;YAC3E,wEAAwE;YACxE,IAAI,UAAU,KAAK,CAAC;gBAAE,OAAO;YAE7B,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;YAC1B,uEAAuE;YACvE,IAAI,CAAC,CAAC,CAAC,CAAC;YAER,MAAM,KAAK,GAAU,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,CAAC,YAAY,EAAE,CAAC;YAC/D,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACpB,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAClC,aAAa,IAAI,KAAK,CAAC,UAAU,CAAC;YAClC,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC;YAElB,wEAAwE;YACxE,yEAAyE;YACzE,0EAA0E;YAC1E,UAAU,CAAC,GAAG,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;YACzC,iBAAiB,EAAE,CAAC;QACrB,CAAC;QAED,KAAK;YACJ,OAAO;gBACN,IAAI,EAAE,KAAK,CAAC,IAAI;gBAChB,MAAM,EAAE,KAAK,CAAC,MAAM;gBACpB,MAAM,EAAE,KAAK,CAAC,MAAM;gBACpB,cAAc,EAAE,KAAK,CAAC,cAAc;gBACpC,aAAa,EAAE,KAAK,CAAC,aAAa;gBAClC,OAAO,EAAE,KAAK,CAAC,IAAI;gBACnB,KAAK,EAAE,aAAa;aACpB,CAAC;QACH,CAAC;QAED,KAAK;YACJ,KAAK,CAAC,KAAK,EAAE,CAAC;YACd,YAAY,CAAC,KAAK,EAAE,CAAC;YACrB,aAAa,GAAG,CAAC,CAAC;QACnB,CAAC;KACD,CAAC;AACH,CAAC"}

package/dist/compute/solve-cache-envelope.d.ts

@@ -0,0 +1,53 @@
+/**
+ * L2 cache entry format (R6). An entry is the gzipped response body plus a tiny
+ * metadata header, so a hit is near-CPU-free: no `JSON.stringify`, no re-solve —
+ * gzip clients get the stored bytes verbatim, and the header carries just enough
+ * to rebuild the `ok` outcome (error/warning counts for the metric, uncompressed
+ * length for the `Content-Length` on a gunzip fallback).
+ *
+ * Wire layout (opaque to the `ISolveResultCache` backend, which sees only bytes):
+ *
+ *   [ 4 bytes: header length N, big-endian uint32 ]
+ *   [ N bytes: UTF-8 JSON EnvelopeHeader ]
+ *   [ rest:    gzipped JSON response body ]
+ *
+ * The `algo` echo (M3) is already stripped at the source in the package's
+ * `runSolve`, so the body never carries the base64 definition — entries stay
+ * small without a strip step here.
+ */
+/** Metadata stored beside the gzipped body. Small; parsed on every hit. */
+export interface EnvelopeHeader {
+    /** Grasshopper runtime error count, for the solve metric. */
+    errorCount: number;
+    /** Grasshopper runtime warning count, for the solve metric. */
+    warningCount: number;
+    /** Uncompressed JSON body length in bytes (Content-Length for a gunzip fallback). */
+    serializedBytes: number;
+    /**
+     * SHA-256 hex of the canonical input preimage (H2 defense-in-depth). A hit
+     * verifies this equals the requesting key's hash before serving — a wide-hash
+     * collision that produced the same storage key still can't serve the wrong
+     * geometry.
+     */
+    inputHash: string;
+}
+/**
+ * Encode a cache entry from the gzipped body + header. The body MUST already be
+ * gzipped (the pipeline gzips before storing so every hit serves compressed
+ * bytes; a rare non-gzip client gunzips on read).
+ */
+export declare function encodeSolveCacheEntry(header: EnvelopeHeader, gzippedBody: Uint8Array): Uint8Array;
+/** A decoded entry: the parsed header + the still-gzipped body slice. */
+export interface DecodedSolveCacheEntry {
+    header: EnvelopeHeader;
+    gzippedBody: Uint8Array;
+}
+/**
+ * Decode a cache entry. Returns `null` on any malformed input (truncated, bad
+ * length prefix, non-JSON header) — a corrupt entry is treated as a miss, never
+ * an error, matching the best-effort cache contract.
+ */
+export declare function decodeSolveCacheEntry(bytes: Uint8Array): DecodedSolveCacheEntry | null;
+/** Gunzip a stored body back to the JSON string, for a non-gzip client (rare). */
+export declare function gunzipEntryBody(gzippedBody: Uint8Array): string;
+//# sourceMappingURL=solve-cache-envelope.d.ts.map

package/dist/compute/solve-cache-envelope.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"solve-cache-envelope.d.ts","sourceRoot":"","sources":["../../src/compute/solve-cache-envelope.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAIH,2EAA2E;AAC3E,MAAM,WAAW,cAAc;IAC9B,6DAA6D;IAC7D,UAAU,EAAE,MAAM,CAAC;IACnB,+DAA+D;IAC/D,YAAY,EAAE,MAAM,CAAC;IACrB,qFAAqF;IACrF,eAAe,EAAE,MAAM,CAAC;IACxB;;;;;OAKG;IACH,SAAS,EAAE,MAAM,CAAC;CAClB;AAED;;;;GAIG;AACH,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,cAAc,EAAE,WAAW,EAAE,UAAU,GAAG,UAAU,CAUjG;AAED,yEAAyE;AACzE,MAAM,WAAW,sBAAsB;IACtC,MAAM,EAAE,cAAc,CAAC;IACvB,WAAW,EAAE,UAAU,CAAC;CACxB;AAED;;;;GAIG;AACH,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,UAAU,GAAG,sBAAsB,GAAG,IAAI,CA2BtF;AAED,kFAAkF;AAClF,wBAAgB,eAAe,CAAC,WAAW,EAAE,UAAU,GAAG,MAAM,CAE/D"}

package/dist/compute/solve-cache-envelope.js

@@ -0,0 +1,66 @@
+/**
+ * L2 cache entry format (R6). An entry is the gzipped response body plus a tiny
+ * metadata header, so a hit is near-CPU-free: no `JSON.stringify`, no re-solve —
+ * gzip clients get the stored bytes verbatim, and the header carries just enough
+ * to rebuild the `ok` outcome (error/warning counts for the metric, uncompressed
+ * length for the `Content-Length` on a gunzip fallback).
+ *
+ * Wire layout (opaque to the `ISolveResultCache` backend, which sees only bytes):
+ *
+ *   [ 4 bytes: header length N, big-endian uint32 ]
+ *   [ N bytes: UTF-8 JSON EnvelopeHeader ]
+ *   [ rest:    gzipped JSON response body ]
+ *
+ * The `algo` echo (M3) is already stripped at the source in the package's
+ * `runSolve`, so the body never carries the base64 definition — entries stay
+ * small without a strip step here.
+ */
+import { gunzipSync } from 'node:zlib';
+/**
+ * Encode a cache entry from the gzipped body + header. The body MUST already be
+ * gzipped (the pipeline gzips before storing so every hit serves compressed
+ * bytes; a rare non-gzip client gunzips on read).
+ */
+export function encodeSolveCacheEntry(header, gzippedBody) {
+    const headerJson = Buffer.from(JSON.stringify(header), 'utf8');
+    const out = Buffer.allocUnsafe(4 + headerJson.byteLength + gzippedBody.byteLength);
+    out.writeUInt32BE(headerJson.byteLength, 0);
+    headerJson.copy(out, 4);
+    Buffer.from(gzippedBody.buffer, gzippedBody.byteOffset, gzippedBody.byteLength).copy(out, 4 + headerJson.byteLength);
+    return out;
+}
+/**
+ * Decode a cache entry. Returns `null` on any malformed input (truncated, bad
+ * length prefix, non-JSON header) — a corrupt entry is treated as a miss, never
+ * an error, matching the best-effort cache contract.
+ */
+export function decodeSolveCacheEntry(bytes) {
+    if (bytes.byteLength < 4)
+        return null;
+    const buf = Buffer.from(bytes.buffer, bytes.byteOffset, bytes.byteLength);
+    const headerLen = buf.readUInt32BE(0);
+    const headerEnd = 4 + headerLen;
+    if (headerEnd > buf.byteLength)
+        return null;
+    let header;
+    try {
+        header = JSON.parse(buf.toString('utf8', 4, headerEnd));
+    }
+    catch {
+        return null;
+    }
+    if (typeof header?.errorCount !== 'number' ||
+        typeof header?.warningCount !== 'number' ||
+        typeof header?.serializedBytes !== 'number' ||
+        typeof header?.inputHash !== 'string') {
+        return null;
+    }
+    // Slice (view, no copy) of the gzipped remainder.
+    const gzippedBody = new Uint8Array(bytes.buffer, bytes.byteOffset + headerEnd, bytes.byteLength - headerEnd);
+    return { header, gzippedBody };
+}
+/** Gunzip a stored body back to the JSON string, for a non-gzip client (rare). */
+export function gunzipEntryBody(gzippedBody) {
+    return gunzipSync(gzippedBody).toString('utf8');
+}
+//# sourceMappingURL=solve-cache-envelope.js.map

package/dist/compute/solve-cache-envelope.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"solve-cache-envelope.js","sourceRoot":"","sources":["../../src/compute/solve-cache-envelope.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAmBvC;;;;GAIG;AACH,MAAM,UAAU,qBAAqB,CAAC,MAAsB,EAAE,WAAuB;IACpF,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC;IAC/D,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,GAAG,UAAU,CAAC,UAAU,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC;IACnF,GAAG,CAAC,aAAa,CAAC,UAAU,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IAC5C,UAAU,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACxB,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,WAAW,CAAC,UAAU,EAAE,WAAW,CAAC,UAAU,CAAC,CAAC,IAAI,CACnF,GAAG,EACH,CAAC,GAAG,UAAU,CAAC,UAAU,CACzB,CAAC;IACF,OAAO,GAAG,CAAC;AACZ,CAAC;AAQD;;;;GAIG;AACH,MAAM,UAAU,qBAAqB,CAAC,KAAiB;IACtD,IAAI,KAAK,CAAC,UAAU,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACtC,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;IAC1E,MAAM,SAAS,GAAG,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACtC,MAAM,SAAS,GAAG,CAAC,GAAG,SAAS,CAAC;IAChC,IAAI,SAAS,GAAG,GAAG,CAAC,UAAU;QAAE,OAAO,IAAI,CAAC;IAC5C,IAAI,MAAsB,CAAC;IAC3B,IAAI,CAAC;QACJ,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,SAAS,CAAC,CAAmB,CAAC;IAC3E,CAAC;IAAC,MAAM,CAAC;QACR,OAAO,IAAI,CAAC;IACb,CAAC;IACD,IACC,OAAO,MAAM,EAAE,UAAU,KAAK,QAAQ;QACtC,OAAO,MAAM,EAAE,YAAY,KAAK,QAAQ;QACxC,OAAO,MAAM,EAAE,eAAe,KAAK,QAAQ;QAC3C,OAAO,MAAM,EAAE,SAAS,KAAK,QAAQ,EACpC,CAAC;QACF,OAAO,IAAI,CAAC;IACb,CAAC;IACD,kDAAkD;IAClD,MAAM,WAAW,GAAG,IAAI,UAAU,CACjC,KAAK,CAAC,MAAM,EACZ,KAAK,CAAC,UAAU,GAAG,SAAS,EAC5B,KAAK,CAAC,UAAU,GAAG,SAAS,CAC5B,CAAC;IACF,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;AAChC,CAAC;AAED,kFAAkF;AAClF,MAAM,UAAU,eAAe,CAAC,WAAuB;IACtD,OAAO,UAAU,CAAC,WAAW,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;AACjD,CAAC"}

package/dist/compute/solve-cache-key.d.ts

@@ -0,0 +1,65 @@
+/**
+ * Durable L2 cache-key derivation (H2 / R8 / R13).
+ *
+ * The in-process L1 cache keys on a 32-bit FNV hash — fine for a 20-entry Map,
+ * unsafe for a durable, cross-user cache where a collision serves user A's
+ * geometry to user B (CONTEXT.md L92–97 records exactly this bug shipping once).
+ * So the L2 key is a wide SHA-256 hash, and the entry stores the canonical
+ * preimage so a hit can compare it byte-for-byte (defense-in-depth).
+ *
+ * What goes into the key:
+ *   - The **transformed** input tree (R13) — the exact tree handed to the
+ *     scheduler, canonicalized with the package's exported `stableStringify` so
+ *     the L2 key parity-matches the L1 canonicalization path.
+ *   - A **config subset** (R8): everything OTHER than definition+inputs that
+ *     changes a solve's result — model units, tolerances, `dataversion`, the
+ *     compute contract version, and (when known) the Rhino server identity. A
+ *     durable key of `(versionId, inputHash)` alone would collide across
+ *     differing server configs or Rhino versions.
+ *
+ * `versionId`, `definitionId`, and `orgId` are NOT hashed in here — they're
+ * separate parts of the {@link SolveCacheKey} tuple so the backend can scope its
+ * keyspace (per-definition quota, per-org isolation) without unpacking the hash.
+ */
+/**
+ * Solve-affecting configuration folded into the key alongside the input tree.
+ * Every field here is something that, if it changed, would legitimately change
+ * the solve output for the SAME definition + inputs. Assemble it from the app's
+ * resolved solve config; unset fields are simply absent from the canonical form.
+ */
+export interface SolveCacheConfigSubset {
+    /** Rhino model unit system, if the app pins one (else the definition/server default). */
+    modelUnits?: string;
+    /** Absolute tolerance, if pinned. */
+    absoluteTolerance?: number;
+    /** Angle tolerance, if pinned. */
+    angleTolerance?: number;
+    /** Grasshopper `dataversion` / data-tree schema version, if pinned. */
+    dataVersion?: number | string;
+    /**
+     * Compute-server identity (id or URL). Folds in because two servers can run
+     * different Rhino/plugin versions that yield different geometry for the same
+     * inputs. Optional — omit for a single-pool deployment where it's constant.
+     */
+    computeServerId?: string;
+}
+/** The canonical preimage + its SHA-256 digest. Store both in the L2 entry header. */
+export interface SolveCacheInputKey {
+    /** The canonical string that was hashed (for hit-time byte comparison). */
+    canonical: string;
+    /** SHA-256 hex of {@link canonical} — the `inputKey` part of the storage key. */
+    hash: string;
+}
+/**
+ * Derive the durable `inputKey` from the transformed input tree and the solve
+ * config subset. Deterministic and stable across processes/instances: the same
+ * tree + config always produce the same hash, which is what lets a shared cache
+ * hit across app instances.
+ *
+ * @param transformedTree the tree AFTER `transformInputParameter`/`TreeBuilder`
+ *   (R13) — the exact object handed to `scheduler.solve`.
+ * @param config solve-affecting config (R8); `COMPUTE_CONTRACT_VERSION` is folded
+ *   in automatically so a wire-contract bump invalidates old entries for free.
+ */
+export declare function deriveSolveCacheInputKey(transformedTree: unknown, config: SolveCacheConfigSubset): SolveCacheInputKey;
+//# sourceMappingURL=solve-cache-key.d.ts.map

package/dist/compute/solve-cache-key.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"solve-cache-key.d.ts","sourceRoot":"","sources":["../../src/compute/solve-cache-key.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAMH;;;;;GAKG;AACH,MAAM,WAAW,sBAAsB;IACtC,yFAAyF;IACzF,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,qCAAqC;IACrC,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,kCAAkC;IAClC,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,uEAAuE;IACvE,WAAW,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAC9B;;;;OAIG;IACH,eAAe,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,sFAAsF;AACtF,MAAM,WAAW,kBAAkB;IAClC,2EAA2E;IAC3E,SAAS,EAAE,MAAM,CAAC;IAClB,iFAAiF;IACjF,IAAI,EAAE,MAAM,CAAC;CACb;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,wBAAwB,CACvC,eAAe,EAAE,OAAO,EACxB,MAAM,EAAE,sBAAsB,GAC5B,kBAAkB,CAWpB"}

package/dist/compute/solve-cache-key.js

@@ -0,0 +1,50 @@
+/**
+ * Durable L2 cache-key derivation (H2 / R8 / R13).
+ *
+ * The in-process L1 cache keys on a 32-bit FNV hash — fine for a 20-entry Map,
+ * unsafe for a durable, cross-user cache where a collision serves user A's
+ * geometry to user B (CONTEXT.md L92–97 records exactly this bug shipping once).
+ * So the L2 key is a wide SHA-256 hash, and the entry stores the canonical
+ * preimage so a hit can compare it byte-for-byte (defense-in-depth).
+ *
+ * What goes into the key:
+ *   - The **transformed** input tree (R13) — the exact tree handed to the
+ *     scheduler, canonicalized with the package's exported `stableStringify` so
+ *     the L2 key parity-matches the L1 canonicalization path.
+ *   - A **config subset** (R8): everything OTHER than definition+inputs that
+ *     changes a solve's result — model units, tolerances, `dataversion`, the
+ *     compute contract version, and (when known) the Rhino server identity. A
+ *     durable key of `(versionId, inputHash)` alone would collide across
+ *     differing server configs or Rhino versions.
+ *
+ * `versionId`, `definitionId`, and `orgId` are NOT hashed in here — they're
+ * separate parts of the {@link SolveCacheKey} tuple so the backend can scope its
+ * keyspace (per-definition quota, per-org isolation) without unpacking the hash.
+ */
+import { createHash } from 'node:crypto';
+import { stableStringify } from '@selvajs/compute';
+import { COMPUTE_CONTRACT_VERSION } from './solve-pipeline.js';
+/**
+ * Derive the durable `inputKey` from the transformed input tree and the solve
+ * config subset. Deterministic and stable across processes/instances: the same
+ * tree + config always produce the same hash, which is what lets a shared cache
+ * hit across app instances.
+ *
+ * @param transformedTree the tree AFTER `transformInputParameter`/`TreeBuilder`
+ *   (R13) — the exact object handed to `scheduler.solve`.
+ * @param config solve-affecting config (R8); `COMPUTE_CONTRACT_VERSION` is folded
+ *   in automatically so a wire-contract bump invalidates old entries for free.
+ */
+export function deriveSolveCacheInputKey(transformedTree, config) {
+    // stableStringify sorts keys deterministically — same content, same string,
+    // regardless of property insertion order. Tag each part so a value can't shift
+    // across the tree/config boundary and collide (e.g. tree "]" meeting config "[").
+    const canonical = stableStringify({
+        v: COMPUTE_CONTRACT_VERSION,
+        tree: transformedTree,
+        config
+    });
+    const hash = createHash('sha256').update(canonical).digest('hex');
+    return { canonical, hash };
+}
+//# sourceMappingURL=solve-cache-key.js.map

package/dist/compute/solve-cache-key.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"solve-cache-key.js","sourceRoot":"","sources":["../../src/compute/solve-cache-key.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,EAAE,wBAAwB,EAAE,MAAM,qBAAqB,CAAC;AAiC/D;;;;;;;;;;GAUG;AACH,MAAM,UAAU,wBAAwB,CACvC,eAAwB,EACxB,MAA8B;IAE9B,4EAA4E;IAC5E,+EAA+E;IAC/E,kFAAkF;IAClF,MAAM,SAAS,GAAG,eAAe,CAAC;QACjC,CAAC,EAAE,wBAAwB;QAC3B,IAAI,EAAE,eAAe;QACrB,MAAM;KACN,CAAC,CAAC;IACH,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAClE,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;AAC5B,CAAC"}