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

package/dist/compute/solve-cache-single-flight.d.ts

@@ -0,0 +1,35 @@
+/**
+ * In-process single-flight (R4) — dogpile protection above the L2 cache.
+ *
+ * N identical live solves arriving while the first is still running would each
+ * enqueue and each hit Rhino (the scheduler has no in-flight coalescing, and
+ * Rhino's `cachesolve` still costs a round trip per repeat). The classic cold-key
+ * stampede: a hot public definition + a deploy = a thundering herd onto compute.
+ *
+ * This coalesces them: the first caller for a key runs the work; concurrent
+ * callers for the SAME key await the same promise and share its result. Once the
+ * work settles (resolve OR reject), the key is released so the next request runs
+ * fresh — the map never retains a settled entry, so it can't serve a stale
+ * result or leak memory.
+ *
+ * It sits ABOVE the `ISolveResultCache` interface (in-process, per app instance).
+ * A cross-instance lease (Redis `SET NX`) is a later backend capability; this is
+ * the free first slice that covers the common same-instance burst.
+ *
+ * Correctness note: the shared promise resolves to ONE value for all waiters, so
+ * the wrapped work must return an immutable / independently-serializable result
+ * (the solve pipeline returns a fresh envelope object — safe to share by
+ * reference here because the app serializes it per response).
+ */
+export interface SolveCacheSingleFlight {
+    /**
+     * Run `work` under `key`, coalescing concurrent identical calls. The first
+     * caller executes; overlapping callers for the same key await the same promise.
+     * The key is freed as soon as the promise settles (success or failure).
+     */
+    run<T>(key: string, work: () => Promise<T>): Promise<T>;
+    /** Number of keys currently in flight (observability / tests). */
+    inFlight(): number;
+}
+export declare function createSolveCacheSingleFlight(): SolveCacheSingleFlight;
+//# sourceMappingURL=solve-cache-single-flight.d.ts.map

package/dist/compute/solve-cache-single-flight.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"solve-cache-single-flight.d.ts","sourceRoot":"","sources":["../../src/compute/solve-cache-single-flight.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,MAAM,WAAW,sBAAsB;IACtC;;;;OAIG;IACH,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACxD,kEAAkE;IAClE,QAAQ,IAAI,MAAM,CAAC;CACnB;AAED,wBAAgB,4BAA4B,IAAI,sBAAsB,CAuBrE"}

package/dist/compute/solve-cache-single-flight.js

@@ -0,0 +1,48 @@
+/**
+ * In-process single-flight (R4) — dogpile protection above the L2 cache.
+ *
+ * N identical live solves arriving while the first is still running would each
+ * enqueue and each hit Rhino (the scheduler has no in-flight coalescing, and
+ * Rhino's `cachesolve` still costs a round trip per repeat). The classic cold-key
+ * stampede: a hot public definition + a deploy = a thundering herd onto compute.
+ *
+ * This coalesces them: the first caller for a key runs the work; concurrent
+ * callers for the SAME key await the same promise and share its result. Once the
+ * work settles (resolve OR reject), the key is released so the next request runs
+ * fresh — the map never retains a settled entry, so it can't serve a stale
+ * result or leak memory.
+ *
+ * It sits ABOVE the `ISolveResultCache` interface (in-process, per app instance).
+ * A cross-instance lease (Redis `SET NX`) is a later backend capability; this is
+ * the free first slice that covers the common same-instance burst.
+ *
+ * Correctness note: the shared promise resolves to ONE value for all waiters, so
+ * the wrapped work must return an immutable / independently-serializable result
+ * (the solve pipeline returns a fresh envelope object — safe to share by
+ * reference here because the app serializes it per response).
+ */
+export function createSolveCacheSingleFlight() {
+    const inflight = new Map();
+    return {
+        run(key, work) {
+            const existing = inflight.get(key);
+            if (existing)
+                return existing;
+            // `.finally` releases the key on both settle paths. Start the work inside
+            // the promise chain so a synchronous throw in `work` still rejects the
+            // shared promise (and still frees the key) rather than escaping.
+            const p = (async () => work())().finally(() => {
+                // Only delete if it's still OUR promise — a key freed and re-taken by a
+                // later caller must not be clobbered.
+                if (inflight.get(key) === p)
+                    inflight.delete(key);
+            });
+            inflight.set(key, p);
+            return p;
+        },
+        inFlight() {
+            return inflight.size;
+        }
+    };
+}
+//# sourceMappingURL=solve-cache-single-flight.js.map

package/dist/compute/solve-cache-single-flight.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"solve-cache-single-flight.js","sourceRoot":"","sources":["../../src/compute/solve-cache-single-flight.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAaH,MAAM,UAAU,4BAA4B;IAC3C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA4B,CAAC;IAErD,OAAO;QACN,GAAG,CAAI,GAAW,EAAE,IAAsB;YACzC,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACnC,IAAI,QAAQ;gBAAE,OAAO,QAAsB,CAAC;YAE5C,0EAA0E;YAC1E,uEAAuE;YACvE,iEAAiE;YACjE,MAAM,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE;gBAC7C,wEAAwE;gBACxE,sCAAsC;gBACtC,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC;oBAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACnD,CAAC,CAAC,CAAC;YACH,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACrB,OAAO,CAAC,CAAC;QACV,CAAC;QACD,QAAQ;YACP,OAAO,QAAQ,CAAC,IAAI,CAAC;QACtB,CAAC;KACD,CAAC;AACH,CAAC"}

package/dist/compute/solve-pipeline.d.ts

@@ -19,9 +19,11 @@
  * The Server-Timing string it emits IS the versioned wire contract (audit D5):
  * see {@link COMPUTE_CONTRACT_VERSION} and {@link COMPUTE_VERSION_HEADER}.
  */
-import { type GrasshopperComputeResponse } from '@selvajs/compute';
+import { type GrasshopperComputeResponse, type SolveDefinition } from '@selvajs/compute';
 import type { SchemaInput } from '@selvajs/schemas';
 import type { CachedClient } from './client-cache.js';
+import type { ByteRefOutcome } from './definition-byte-cache.js';
+import { type SolveCacheConfigSubset } from './solve-cache-key.js';
 /** Current compute-response contract version. Additive header; bump on shape change. */
 export declare const COMPUTE_CONTRACT_VERSION: 1;
 /** Response header carrying {@link COMPUTE_CONTRACT_VERSION}. */
@@ -33,8 +35,20 @@ export type PipelineInput = SchemaInput & {
     stepSize?: number;
 };
 export interface SolvePipelineArgs {
-    /** The `.gh` bytes to solve (stored blob or remote fetch — resolved by the caller). */
-    definitionSource: Uint8Array;
+    /**
+     * The definition to solve. Either raw `.gh` bytes (remote fetch, or a caller
+     * that resolved them eagerly) or a `DefinitionRef` — an identity-keyed lazy
+     * loader (from the definition-byte cache) whose bytes the scheduler
+     * materializes ONLY when an upload is unavoidable. A pointer-known solve of a
+     * `DefinitionRef` moves zero bytes.
+     */
+    definitionSource: SolveDefinition;
+    /**
+     * When `definitionSource` is a byte-cache `DefinitionRef`, its mutable outcome
+     * so the pipeline can emit the `def_bytes` Server-Timing verdict (skipped =
+     * `load` never ran, hit = warm cache, miss = loader). Omit for raw-bytes solves.
+     */
+    byteRefOutcome?: ByteRefOutcome;
     /** Persisted input params; only those with a `paramType` are sent to the solve. */
     inputs: PipelineInput[];
     /** User-chosen values keyed by input id; missing keys fall back to the schema default. */
@@ -66,6 +80,30 @@ export interface SolvePipelineArgs {
      * Server-Timing entries. The caller assembles these; the pipeline only echoes.
      */
     prepMarks?: [string, number][];
+    /**
+     * Optional durable L2 solve cache (H1). Present ONLY for live-channel solves
+     * whose definition has a caching quota > 0 — its presence IS the channel gate
+     * (zero policy conditionals in the pipeline). When set, the pipeline derives
+     * the wide input key from the transformed tree + `configSubset`, checks
+     * `lookup` before solving (a hit skips compute entirely, returning the stored
+     * gzipped envelope), and write-throughs `store` on a successful solve.
+     */
+    solveCache?: SolvePipelineCacheHook;
+}
+/**
+ * The app-supplied L2 hook. The app binds `lookup`/`store` to the org/definition/
+ * version scope and the definition's quota; the pipeline supplies the SHA-256
+ * `inputKey` (derived from the transformed tree + `configSubset`) and the opaque
+ * encoded entry bytes. Both are best-effort — `lookup` may miss/throw (treated as
+ * a miss), `store` is fire-and-forget.
+ */
+export interface SolvePipelineCacheHook {
+    /** Solve-affecting config folded into the key (R8) — model units, tolerances, server id. */
+    configSubset: SolveCacheConfigSubset;
+    /** Fetch a stored entry for `inputKey`, or `null` on miss. Must not reject fatally. */
+    lookup(inputKey: string): Promise<Uint8Array | null>;
+    /** Store the encoded entry for `inputKey`. Fire-and-forget; best-effort. */
+    store(inputKey: string, entry: Uint8Array): void;
 }
 /** Phase timings the pipeline measured; the caller uses them for debug logging. */
 export interface SolvePhaseMetrics {
@@ -78,6 +116,12 @@ export interface SolvePhaseMetrics {
     serializedBytes: number;
     /** Gzipped length in bytes, or null when compression was skipped. */
     compressedBytes: number | null;
+    /**
+     * L2 durable-cache verdict: `true` = served from L2 (no solve ran), `false` =
+     * L2 consulted and missed (solved), `null` = L2 not consulted (no hook — draft
+     * or caching off). Drives the `l2_cache` Server-Timing entry.
+     */
+    l2CacheHit: boolean | null;
 }
 /** A ready-to-send response: body + headers + the solve result + phase metrics. */
 export interface SolveEnvelope {
@@ -87,17 +131,23 @@ export interface SolveEnvelope {
     encoding?: 'gzip';
     /** Fully-assembled response headers (Content-Type/-Length/-Encoding, Vary, Server-Timing, version). */
     headers: Record<string, string>;
-    /** The solved definition — the caller reads `errors`/`warnings` for its metric record. */
-    result: GrasshopperComputeResponse;
+    /**
+     * The solved definition object, present only on a fresh (non-L2) solve. Absent
+     * on an L2 hit — the pipeline serves the stored gzipped body without ever
+     * materializing the object. The caller reads `errorCount`/`warningCount` off
+     * the `ok` outcome for its metric record, not this field.
+     */
+    result?: GrasshopperComputeResponse;
     /** Phase timings, for the caller's optional debug breakdown. */
     metrics: SolvePhaseMetrics;
 }
 /**
  * Discriminated result. `ok` carries the envelope; every other variant names an
  * expected failure the transport maps to a status code (the app route maps
- * timeout→504, client_abort→499, too_large→413; `compute_error` re-surfaces the
- * original error for the generic 500/503 path). `durationMs` on the error
- * variants is the solve wall time up to the failure, for the metric record.
+ * timeout→504, client_abort→499, too_large→413, shed→503+Retry-After;
+ * `compute_error` re-surfaces the original error for the generic 500/503 path).
+ * `durationMs` on the error variants is the solve wall time up to the failure,
+ * for the metric record.
  */
 export type SolveOutcome = {
     kind: 'ok';
@@ -114,6 +164,19 @@ export type SolveOutcome = {
     durationMs: number;
 } | {
     kind: 'too_large';
+}
+/**
+ * Scheduler backpressure shed the solve before it executed — the per-server
+ * queue was full (`QUEUE_FULL`) or it sat queued past the wait deadline
+ * (`QUEUE_TIMEOUT`). Retryable: the route maps this to 503 + `Retry-After`.
+ * `retryAfterSeconds` is a suggested backoff hint for the client.
+ */
+ | {
+    kind: 'shed';
+    durationMs: number;
+    reason: 'queue_full' | 'queue_timeout';
+    retryAfterSeconds: number;
+    message: string;
 } | {
     kind: 'compute_error';
     durationMs: number;

package/dist/compute/solve-pipeline.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"solve-pipeline.d.ts","sourceRoot":"","sources":["../../src/compute/solve-pipeline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,EAAe,KAAK,0BAA0B,EAAmB,MAAM,kBAAkB,CAAC;AACjG,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAGpD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAYtD,wFAAwF;AACxF,eAAO,MAAM,wBAAwB,EAAG,CAAU,CAAC;AACnD,iEAAiE;AACjE,eAAO,MAAM,sBAAsB,4BAA4B,CAAC;AAMhE,+EAA+E;AAC/E,MAAM,MAAM,aAAa,GAAG,WAAW,GAAG;IACzC,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAC;CAClB,CAAC;AAEF,MAAM,WAAW,iBAAiB;IACjC,uFAAuF;IACvF,gBAAgB,EAAE,UAAU,CAAC;IAC7B,mFAAmF;IACnF,MAAM,EAAE,aAAa,EAAE,CAAC;IACxB,0FAA0F;IAC1F,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAChC,oEAAoE;IACpE,MAAM,EAAE,YAAY,CAAC;IACrB,+DAA+D;IAC/D,gBAAgB,EAAE,MAAM,CAAC;IACzB,uEAAuE;IACvE,kBAAkB,EAAE,MAAM,CAAC;IAC3B,kFAAkF;IAClF,cAAc,EAAE,MAAM,CAAC;IACvB;;;;OAIG;IACH,MAAM,EAAE,WAAW,CAAC;IACpB;;;;OAIG;IACH,WAAW,EAAE,MAAM,CAAC;IACpB,uFAAuF;IACvF,SAAS,EAAE,MAAM,CAAC;IAClB;;;OAGG;IACH,SAAS,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;CAC/B;AAED,mFAAmF;AACnF,MAAM,WAAW,iBAAiB;IACjC,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,MAAM,CAAC;IACpB,MAAM,EAAE,MAAM,CAAC;IACf,aAAa,EAAE,MAAM,CAAC;IACtB,+CAA+C;IAC/C,eAAe,EAAE,MAAM,CAAC;IACxB,qEAAqE;IACrE,eAAe,EAAE,MAAM,GAAG,IAAI,CAAC;CAC/B;AAED,mFAAmF;AACnF,MAAM,WAAW,aAAa;IAC7B,gGAAgG;IAChG,IAAI,EAAE,MAAM,GAAG,UAAU,CAAC;IAC1B,8DAA8D;IAC9D,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,uGAAuG;IACvG,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAChC,0FAA0F;IAC1F,MAAM,EAAE,0BAA0B,CAAC;IACnC,gEAAgE;IAChE,OAAO,EAAE,iBAAiB,CAAC;CAC3B;AAED;;;;;;GAMG;AACH,MAAM,MAAM,YAAY,GACrB;IACA,IAAI,EAAE,IAAI,CAAC;IACX,QAAQ,EAAE,aAAa,CAAC;IACxB,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;CACpB,GACD;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACxD;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,GAC5C;IAAE,IAAI,EAAE,WAAW,CAAA;CAAE,GACrB;IAAE,IAAI,EAAE,eAAe,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,CAAC;AAMjE;;;GAGG;AACH,wBAAsB,gBAAgB,CAAC,IAAI,EAAE,iBAAiB,GAAG,OAAO,CAAC,YAAY,CAAC,CAsIrF"}
+{"version":3,"file":"solve-pipeline.d.ts","sourceRoot":"","sources":["../../src/compute/solve-pipeline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,EAIN,KAAK,0BAA0B,EAE/B,KAAK,eAAe,EACpB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAIpD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AACjE,OAAO,EAA4B,KAAK,sBAAsB,EAAE,MAAM,sBAAsB,CAAC;AAoB7F,wFAAwF;AACxF,eAAO,MAAM,wBAAwB,EAAG,CAAU,CAAC;AACnD,iEAAiE;AACjE,eAAO,MAAM,sBAAsB,4BAA4B,CAAC;AAMhE,+EAA+E;AAC/E,MAAM,MAAM,aAAa,GAAG,WAAW,GAAG;IACzC,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAC;CAClB,CAAC;AAEF,MAAM,WAAW,iBAAiB;IACjC;;;;;;OAMG;IACH,gBAAgB,EAAE,eAAe,CAAC;IAClC;;;;OAIG;IACH,cAAc,CAAC,EAAE,cAAc,CAAC;IAChC,mFAAmF;IACnF,MAAM,EAAE,aAAa,EAAE,CAAC;IACxB,0FAA0F;IAC1F,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAChC,oEAAoE;IACpE,MAAM,EAAE,YAAY,CAAC;IACrB,+DAA+D;IAC/D,gBAAgB,EAAE,MAAM,CAAC;IACzB,uEAAuE;IACvE,kBAAkB,EAAE,MAAM,CAAC;IAC3B,kFAAkF;IAClF,cAAc,EAAE,MAAM,CAAC;IACvB;;;;OAIG;IACH,MAAM,EAAE,WAAW,CAAC;IACpB;;;;OAIG;IACH,WAAW,EAAE,MAAM,CAAC;IACpB,uFAAuF;IACvF,SAAS,EAAE,MAAM,CAAC;IAClB;;;OAGG;IACH,SAAS,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;IAC/B;;;;;;;OAOG;IACH,UAAU,CAAC,EAAE,sBAAsB,CAAC;CACpC;AAED;;;;;;GAMG;AACH,MAAM,WAAW,sBAAsB;IACtC,4FAA4F;IAC5F,YAAY,EAAE,sBAAsB,CAAC;IACrC,uFAAuF;IACvF,MAAM,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;IACrD,4EAA4E;IAC5E,KAAK,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,GAAG,IAAI,CAAC;CACjD;AAED,mFAAmF;AACnF,MAAM,WAAW,iBAAiB;IACjC,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,MAAM,CAAC;IAChB,WAAW,EAAE,MAAM,CAAC;IACpB,MAAM,EAAE,MAAM,CAAC;IACf,aAAa,EAAE,MAAM,CAAC;IACtB,+CAA+C;IAC/C,eAAe,EAAE,MAAM,CAAC;IACxB,qEAAqE;IACrE,eAAe,EAAE,MAAM,GAAG,IAAI,CAAC;IAC/B;;;;OAIG;IACH,UAAU,EAAE,OAAO,GAAG,IAAI,CAAC;CAC3B;AAED,mFAAmF;AACnF,MAAM,WAAW,aAAa;IAC7B,gGAAgG;IAChG,IAAI,EAAE,MAAM,GAAG,UAAU,CAAC;IAC1B,8DAA8D;IAC9D,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,uGAAuG;IACvG,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAChC;;;;;OAKG;IACH,MAAM,CAAC,EAAE,0BAA0B,CAAC;IACpC,gEAAgE;IAChE,OAAO,EAAE,iBAAiB,CAAC;CAC3B;AAED;;;;;;;GAOG;AACH,MAAM,MAAM,YAAY,GACrB;IACA,IAAI,EAAE,IAAI,CAAC;IACX,QAAQ,EAAE,aAAa,CAAC;IACxB,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;CACpB,GACD;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GACxD;IAAE,IAAI,EAAE,cAAc,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,GAC5C;IAAE,IAAI,EAAE,WAAW,CAAA;CAAE;AACvB;;;;;GAKG;GACD;IACA,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,YAAY,GAAG,eAAe,CAAC;IACvC,iBAAiB,EAAE,MAAM,CAAC;IAC1B,OAAO,EAAE,MAAM,CAAC;CACf,GACD;IAAE,IAAI,EAAE,eAAe,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,CAAC;AAMjE;;;GAGG;AACH,wBAAsB,gBAAgB,CAAC,IAAI,EAAE,iBAAiB,GAAG,OAAO,CAAC,YAAY,CAAC,CA8NrF"}

package/dist/compute/solve-pipeline.js

@@ -19,9 +19,14 @@
  * The Server-Timing string it emits IS the versioned wire contract (audit D5):
  * see {@link COMPUTE_CONTRACT_VERSION} and {@link COMPUTE_VERSION_HEADER}.
  */
-import { TreeBuilder } from '@selvajs/compute';
-import { gzipSync } from 'node:zlib';
+import { ErrorCodes, RhinoComputeError, TreeBuilder } from '@selvajs/compute';
+import { gzip } from 'node:zlib';
+import { promisify } from 'node:util';
 import { transformInputParameter } from './transform-input.js';
+import { deriveSolveCacheInputKey } from './solve-cache-key.js';
+import { decodeSolveCacheEntry, encodeSolveCacheEntry, gunzipEntryBody } from './solve-cache-envelope.js';
+/** Async gzip (audit B8) — off the event loop, unlike the old `gzipSync`. */
+const gzipAsync = promisify(gzip);
 // ============================================================================
 // Wire contract version (audit D5)
 // ============================================================================
@@ -50,6 +55,29 @@ export async function runSolvePipeline(args) {
         .filter((input) => input.paramType)
         .map((input) => transformInputParameter(input, args.values[input.id])));
     const treeBuildMs = performance.now() - treeBuildStart;
+    // --- L2 durable cache lookup (H1) ---------------------------------------
+    // Derive the wide key from the TRANSFORMED tree (R13) + config subset (R8),
+    // then check the injected hook. Present only for cacheable live solves — its
+    // presence is the channel gate. A hit skips the solve entirely and serves the
+    // stored gzipped envelope; the derived key is reused for the write-through on
+    // a miss. Lookup is best-effort: any rejection is swallowed to a miss.
+    let inputKey = null;
+    if (args.solveCache) {
+        inputKey = deriveSolveCacheInputKey(inputTree, args.solveCache.configSubset).hash;
+        let stored = null;
+        try {
+            stored = await args.solveCache.lookup(inputKey);
+        }
+        catch {
+            stored = null;
+        }
+        if (stored) {
+            const hit = buildEnvelopeFromCacheEntry(stored, inputKey, args);
+            if (hit)
+                return hit;
+            // Corrupt/tampered entry → fall through and solve as a miss.
+        }
+    }
     // --- solve --------------------------------------------------------------
     // Snapshot the shared telemetry sequence counters. The holders live on the
     // warm client and are written by every request on this server; with
@@ -80,6 +108,30 @@ export async function runSolvePipeline(args) {
                 message: `Solve exceeded the ${Math.round(args.maxSolveDurationMs / 1000)}s deadline.`
             };
         }
+        // Scheduler backpressure (audit B7): a full queue or an over-deadline queue
+        // wait sheds the solve BEFORE compute runs. Classify these as `shed` (503 +
+        // Retry-After) rather than the generic 500 `compute_error` path — they're
+        // load signals, not failures, and the client should back off and retry.
+        if (err instanceof RhinoComputeError) {
+            if (err.code === ErrorCodes.QUEUE_FULL) {
+                return {
+                    kind: 'shed',
+                    durationMs,
+                    reason: 'queue_full',
+                    retryAfterSeconds: 1,
+                    message: 'Compute server is at capacity. Retry shortly.'
+                };
+            }
+            if (err.code === ErrorCodes.QUEUE_TIMEOUT) {
+                return {
+                    kind: 'shed',
+                    durationMs,
+                    reason: 'queue_timeout',
+                    retryAfterSeconds: 1,
+                    message: 'Compute request waited too long in the queue. Retry shortly.'
+                };
+            }
+        }
         return { kind: 'compute_error', durationMs, error: err };
     }
     const solveMs = performance.now() - solveStart;
@@ -104,13 +156,36 @@ export async function runSolvePipeline(args) {
     // in Server-Timing, included in `total`). Buffered (not streamed) so
     // Content-Length is known and a connection cut mid-transfer fails hard
     // instead of truncating the JSON.
+    // gzip is async (audit B8) — a multi-MB `gzipSync` blocked the event loop for
+    // every other request on this instance. Two independent reasons to compress:
+    //   - the client advertised gzip AND the body clears the 1 KB break-even (tiny
+    //     bodies aren't worth compressing for the wire);
+    //   - an L2 write-through is pending — the entry stores compressed bytes so
+    //     every future hit is near-CPU-free, so we compress even a small body (it
+    //     will be cached), just not for the wire below the threshold.
+    const clientWantsGzip = /\bgzip\b/i.test(args.acceptEncoding);
+    const worthSendingGzip = clientWantsGzip && serialized.length > 1024;
+    const willCache = args.solveCache != null;
     let compressed = null;
     let gzipMs = 0;
-    if (/\bgzip\b/i.test(args.acceptEncoding) && serialized.length > 1024) {
+    if (worthSendingGzip || willCache) {
         const gzipStart = performance.now();
-        compressed = gzipSync(Buffer.from(serialized));
+        compressed = await gzipAsync(Buffer.from(serialized));
         gzipMs = performance.now() - gzipStart;
     }
+    // --- L2 write-through (H1) ----------------------------------------------
+    // On a cacheable solve with a compressed body, store the gzipped envelope so
+    // future hits are near-CPU-free. Fire-and-forget through the hook; the store
+    // itself is best-effort (may silently drop under quota/byte pressure).
+    if (args.solveCache && inputKey && compressed) {
+        const entry = encodeSolveCacheEntry({
+            errorCount: result.errors?.length ?? 0,
+            warningCount: result.warnings?.length ?? 0,
+            serializedBytes: serialized.length,
+            inputHash: inputKey
+        }, new Uint8Array(compressed));
+        args.solveCache.store(inputKey, entry);
+    }
     const serverTotalMs = performance.now() - args.loadStartMs;
     // --- per-request telemetry attribution (see snapshot above) -------------
     // settle: ours iff exactly one settle happened since the snapshot. rhino:
@@ -121,6 +196,10 @@ export async function runSolvePipeline(args) {
     const rhino = settle && !settle.fromCache && client.rhinoTiming.seq === rhinoSeqBefore + 1
         ? client.rhinoTiming.last
         : null;
+    // Send gzip to the client only when it's worth it for the wire — a body
+    // compressed solely to feed the L2 write-through (or one below the 1 KB
+    // break-even) goes out uncompressed.
+    const sendCompressed = compressed && worthSendingGzip ? compressed : null;
     // --- Server-Timing envelope (the versioned wire contract) ---------------
     const serverTiming = buildServerTiming({
         defLoadMs: args.defLoadMs,
@@ -131,6 +210,9 @@ export async function runSolvePipeline(args) {
         serverTotalMs,
         rhino,
         settle,
+        byteRefOutcome: args.byteRefOutcome,
+        // L2 was consulted (hook present) and missed — otherwise not consulted.
+        l2CacheHit: args.solveCache ? false : null,
         prepMarks: args.prepMarks ?? []
     });
     const headers = {
@@ -146,15 +228,22 @@ export async function runSolvePipeline(args) {
         gzipMs,
         serverTotalMs,
         serializedBytes: serialized.length,
-        compressedBytes: compressed?.byteLength ?? null
+        compressedBytes: sendCompressed?.byteLength ?? null,
+        l2CacheHit: args.solveCache ? false : null
     };
     let envelope;
-    if (compressed) {
+    if (sendCompressed) {
         // A downstream proxy's `encode gzip` skips already-encoded responses, so
         // this never double-compresses. Vary is set on both branches.
         headers['Content-Encoding'] = 'gzip';
-        headers['Content-Length'] = String(compressed.byteLength);
-        envelope = { body: new Uint8Array(compressed), encoding: 'gzip', headers, result, metrics };
+        headers['Content-Length'] = String(sendCompressed.byteLength);
+        envelope = {
+            body: new Uint8Array(sendCompressed),
+            encoding: 'gzip',
+            headers,
+            result,
+            metrics
+        };
     }
     else {
         headers['Content-Length'] = String(Buffer.byteLength(serialized));
@@ -168,6 +257,74 @@ export async function runSolvePipeline(args) {
         warningCount: result.warnings?.length ?? 0
     };
 }
+// ============================================================================
+// L2 cache-hit envelope
+// ============================================================================
+/**
+ * Build the `ok` outcome from a stored L2 entry — the near-CPU-free hit path (no
+ * solve, no `JSON.stringify`, no gzip). Returns `null` when the entry is corrupt
+ * or its stored `inputHash` doesn't match the requesting key (defense-in-depth
+ * against a wide-hash collision), so the caller falls through and solves.
+ */
+function buildEnvelopeFromCacheEntry(entryBytes, inputKey, args) {
+    const decoded = decodeSolveCacheEntry(entryBytes);
+    // A collision that produced the same storage key still can't serve the wrong
+    // geometry: the stored hash must match the requesting key's hash.
+    if (!decoded || decoded.header.inputHash !== inputKey)
+        return null;
+    const { header, gzippedBody } = decoded;
+    const clientWantsGzip = /\bgzip\b/i.test(args.acceptEncoding);
+    const serverTotalMs = performance.now() - args.loadStartMs;
+    const serverTiming = buildServerTiming({
+        defLoadMs: args.defLoadMs,
+        treeBuildMs: 0,
+        solveMs: 0,
+        serializeMs: 0,
+        gzipMs: 0,
+        serverTotalMs,
+        rhino: null,
+        settle: null,
+        byteRefOutcome: args.byteRefOutcome,
+        l2CacheHit: true,
+        prepMarks: args.prepMarks ?? []
+    });
+    const headers = {
+        'Content-Type': 'application/json',
+        'Server-Timing': serverTiming,
+        [COMPUTE_VERSION_HEADER]: String(COMPUTE_CONTRACT_VERSION),
+        Vary: 'Accept-Encoding'
+    };
+    const metrics = {
+        treeBuildMs: 0,
+        solveMs: 0,
+        serializeMs: 0,
+        gzipMs: 0,
+        serverTotalMs,
+        serializedBytes: header.serializedBytes,
+        compressedBytes: clientWantsGzip ? gzippedBody.byteLength : null,
+        l2CacheHit: true
+    };
+    let envelope;
+    if (clientWantsGzip) {
+        // Serve the stored compressed bytes verbatim — the whole point of R6.
+        headers['Content-Encoding'] = 'gzip';
+        headers['Content-Length'] = String(gzippedBody.byteLength);
+        envelope = { body: new Uint8Array(gzippedBody), encoding: 'gzip', headers, metrics };
+    }
+    else {
+        // Rare non-gzip client: gunzip back to the JSON string for the response.
+        const json = gunzipEntryBody(gzippedBody);
+        headers['Content-Length'] = String(Buffer.byteLength(json));
+        envelope = { body: json, headers, metrics };
+    }
+    return {
+        kind: 'ok',
+        envelope,
+        solveMs: 0,
+        errorCount: header.errorCount,
+        warningCount: header.warningCount
+    };
+}
 /**
  * Assemble the `Server-Timing` header. The browser reads these to attribute its
  * round-trip: `total` here == the server's headers-to-out wall time, so browser
@@ -203,6 +360,19 @@ function buildServerTiming(parts) {
             header += `, def_reupload;dur=${settle.definitionReuploaded ? 1 : 0}`;
         }
     }
+    // Byte-cache verdict for `DefinitionRef` solves: skipped = the scheduler never
+    // materialized bytes (pointer-known solve — the whole point of this path), hit
+    // = warm byte cache, miss = fell through to storage. Absent for raw-bytes solves.
+    const byteRef = parts.byteRefOutcome;
+    if (byteRef) {
+        const verdict = !byteRef.loaded ? 'skipped' : byteRef.fromCache ? 'hit' : 'miss';
+        header += `, def_bytes;desc=${verdict}`;
+    }
+    // Durable L2 verdict (H1): 1 = hit (no solve ran), 0 = miss (consulted then
+    // solved). Absent when the L2 wasn't consulted (draft channel / caching off).
+    if (parts.l2CacheHit !== null) {
+        header += `, l2_cache;dur=${parts.l2CacheHit ? 1 : 0}`;
+    }
     return header;
 }
 //# sourceMappingURL=solve-pipeline.js.map

package/dist/compute/solve-pipeline.js.map

@@ -1 +1 @@
-{"version":3,"file":"solve-pipeline.js","sourceRoot":"","sources":["../../src/compute/solve-pipeline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,EAAE,WAAW,EAAoD,MAAM,kBAAkB,CAAC;AAEjG,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AACrC,OAAO,EAAE,uBAAuB,EAAE,MAAM,sBAAsB,CAAC;AAG/D,+EAA+E;AAC/E,mCAAmC;AACnC,+EAA+E;AAC/E,EAAE;AACF,+EAA+E;AAC/E,4EAA4E;AAC5E,6EAA6E;AAC7E,iFAAiF;AACjF,8DAA8D;AAE9D,wFAAwF;AACxF,MAAM,CAAC,MAAM,wBAAwB,GAAG,CAAU,CAAC;AACnD,iEAAiE;AACjE,MAAM,CAAC,MAAM,sBAAsB,GAAG,yBAAyB,CAAC;AAgGhE,+EAA+E;AAC/E,WAAW;AACX,+EAA+E;AAE/E;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CAAC,IAAuB;IAC7D,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;IAEhC,2EAA2E;IAC3E,MAAM,cAAc,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;IACzC,MAAM,SAAS,GAAG,WAAW,CAAC,eAAe,CAC5C,IAAI,CAAC,MAAM;SACT,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC;SAClC,GAAG,CAAC,CAAC,KAAK,EAAc,EAAE,CAAC,uBAAuB,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CACnF,CAAC;IACF,MAAM,WAAW,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,cAAc,CAAC;IAEvD,2EAA2E;IAC3E,2EAA2E;IAC3E,oEAAoE;IACpE,2EAA2E;IAC3E,wEAAwE;IACxE,2EAA2E;IAC3E,uEAAuE;IACvE,yEAAyE;IACzE,MAAM,eAAe,GAAG,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC;IAC7C,MAAM,cAAc,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC;IAE9C,IAAI,MAAkC,CAAC;IACvC,MAAM,UAAU,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;IACrC,IAAI,CAAC;QACJ,MAAM,GAAG,MAAM,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,gBAAgB,EAAE,SAAS,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;IACrF,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACd,MAAM,UAAU,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,UAAU,CAAC;QAClD,wEAAwE;QACxE,yEAAyE;QACzE,qEAAqE;QACrE,MAAM,OAAO,GAAG,GAAG,YAAY,KAAK,IAAI,GAAG,CAAC,IAAI,KAAK,YAAY,CAAC;QAClE,IAAI,OAAO,EAAE,CAAC;YACb,IAAI,MAAM,CAAC,OAAO;gBAAE,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,UAAU,EAAE,CAAC;YAChE,OAAO;gBACN,IAAI,EAAE,SAAS;gBACf,UAAU;gBACV,OAAO,EAAE,sBAAsB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,kBAAkB,GAAG,IAAI,CAAC,aAAa;aACtF,CAAC;QACH,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,eAAe,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;IAC1D,CAAC;IACD,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,UAAU,CAAC;IAE/C,0EAA0E;IAC1E,MAAM,cAAc,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;IACzC,IAAI,UAAkB,CAAC;IACvB,IAAI,CAAC;QACJ,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IACrC,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACd,yEAAyE;QACzE,6EAA6E;QAC7E,IAAI,GAAG,YAAY,UAAU;YAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;QAC5D,MAAM,GAAG,CAAC;IACX,CAAC;IACD,IAAI,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,gBAAgB;QAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;IAC5E,MAAM,WAAW,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,cAAc,CAAC;IAEvD,2EAA2E;IAC3E,8EAA8E;IAC9E,qEAAqE;IACrE,uEAAuE;IACvE,kCAAkC;IAClC,IAAI,UAAU,GAAkB,IAAI,CAAC;IACrC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,UAAU,CAAC,MAAM,GAAG,IAAI,EAAE,CAAC;QACvE,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QACpC,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QAC/C,MAAM,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;IACxC,CAAC;IAED,MAAM,aAAa,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC;IAE3D,2EAA2E;IAC3E,0EAA0E;IAC1E,yEAAyE;IACzE,0EAA0E;IAC1E,0DAA0D;IAC1D,MAAM,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,GAAG,KAAK,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IAC3F,MAAM,KAAK,GACV,MAAM,IAAI,CAAC,MAAM,CAAC,SAAS,IAAI,MAAM,CAAC,WAAW,CAAC,GAAG,KAAK,cAAc,GAAG,CAAC;QAC3E,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI;QACzB,CAAC,CAAC,IAAI,CAAC;IAET,2EAA2E;IAC3E,MAAM,YAAY,GAAG,iBAAiB,CAAC;QACtC,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,WAAW;QACX,OAAO;QACP,WAAW;QACX,MAAM;QACN,aAAa;QACb,KAAK;QACL,MAAM;QACN,SAAS,EAAE,IAAI,CAAC,SAAS,IAAI,EAAE;KAC/B,CAAC,CAAC;IAEH,MAAM,OAAO,GAA2B;QACvC,cAAc,EAAE,kBAAkB;QAClC,eAAe,EAAE,YAAY;QAC7B,CAAC,sBAAsB,CAAC,EAAE,MAAM,CAAC,wBAAwB,CAAC;QAC1D,IAAI,EAAE,iBAAiB;KACvB,CAAC;IAEF,MAAM,OAAO,GAAsB;QAClC,WAAW;QACX,OAAO;QACP,WAAW;QACX,MAAM;QACN,aAAa;QACb,eAAe,EAAE,UAAU,CAAC,MAAM;QAClC,eAAe,EAAE,UAAU,EAAE,UAAU,IAAI,IAAI;KAC/C,CAAC;IAEF,IAAI,QAAuB,CAAC;IAC5B,IAAI,UAAU,EAAE,CAAC;QAChB,yEAAyE;QACzE,8DAA8D;QAC9D,OAAO,CAAC,kBAAkB,CAAC,GAAG,MAAM,CAAC;QACrC,OAAO,CAAC,gBAAgB,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;QAC1D,QAAQ,GAAG,EAAE,IAAI,EAAE,IAAI,UAAU,CAAC,UAAU,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;IAC7F,CAAC;SAAM,CAAC;QACP,OAAO,CAAC,gBAAgB,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC;QAClE,QAAQ,GAAG,EAAE,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;IAC3D,CAAC;IAED,OAAO;QACN,IAAI,EAAE,IAAI;QACV,QAAQ;QACR,OAAO;QACP,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC;QACtC,YAAY,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,IAAI,CAAC;KAC1C,CAAC;AACH,CAAC;AAkBD;;;;;;;GAOG;AACH,SAAS,iBAAiB,CAAC,KAAwB;IAClD,IAAI,MAAM,GACT,YAAY,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;QAC1C,YAAY,KAAK,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;QAC5C,aAAa,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;QACzC,iBAAiB,KAAK,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;QACjD,YAAY,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;QACvC,aAAa,KAAK,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;IAE/C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IAC1B,IAAI,KAAK,EAAE,CAAC;QACX,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;QAC5D,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,OAAO,GAAG,SAAS,CAAC,CAAC;QAC7D,MAAM;YACL,sBAAsB,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;gBAC/C,qBAAqB,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;gBAC7C,sBAAsB,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;gBAC/C,sBAAsB,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;IACnD,CAAC;IAED,KAAK,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;QAC3C,MAAM,IAAI,OAAO,KAAK,QAAQ,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;IAC/C,CAAC;IAED,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,IAAI,MAAM,EAAE,CAAC;QACZ,MAAM,IAAI,qBAAqB,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1D,IAAI,MAAM,CAAC,oBAAoB,KAAK,SAAS,EAAE,CAAC;YAC/C,MAAM,IAAI,sBAAsB,MAAM,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACvE,CAAC;IACF,CAAC;IAED,OAAO,MAAM,CAAC;AACf,CAAC"}
+{"version":3,"file":"solve-pipeline.js","sourceRoot":"","sources":["../../src/compute/solve-pipeline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,EACN,UAAU,EACV,iBAAiB,EACjB,WAAW,EAIX,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACtC,OAAO,EAAE,uBAAuB,EAAE,MAAM,sBAAsB,CAAC;AAG/D,OAAO,EAAE,wBAAwB,EAA+B,MAAM,sBAAsB,CAAC;AAC7F,OAAO,EACN,qBAAqB,EACrB,qBAAqB,EACrB,eAAe,EACf,MAAM,2BAA2B,CAAC;AAEnC,6EAA6E;AAC7E,MAAM,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;AAElC,+EAA+E;AAC/E,mCAAmC;AACnC,+EAA+E;AAC/E,EAAE;AACF,+EAA+E;AAC/E,4EAA4E;AAC5E,6EAA6E;AAC7E,iFAAiF;AACjF,8DAA8D;AAE9D,wFAAwF;AACxF,MAAM,CAAC,MAAM,wBAAwB,GAAG,CAAU,CAAC;AACnD,iEAAiE;AACjE,MAAM,CAAC,MAAM,sBAAsB,GAAG,yBAAyB,CAAC;AA8JhE,+EAA+E;AAC/E,WAAW;AACX,+EAA+E;AAE/E;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CAAC,IAAuB;IAC7D,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;IAEhC,2EAA2E;IAC3E,MAAM,cAAc,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;IACzC,MAAM,SAAS,GAAG,WAAW,CAAC,eAAe,CAC5C,IAAI,CAAC,MAAM;SACT,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC;SAClC,GAAG,CAAC,CAAC,KAAK,EAAc,EAAE,CAAC,uBAAuB,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CACnF,CAAC;IACF,MAAM,WAAW,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,cAAc,CAAC;IAEvD,2EAA2E;IAC3E,4EAA4E;IAC5E,6EAA6E;IAC7E,8EAA8E;IAC9E,8EAA8E;IAC9E,uEAAuE;IACvE,IAAI,QAAQ,GAAkB,IAAI,CAAC;IACnC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;QACrB,QAAQ,GAAG,wBAAwB,CAAC,SAAS,EAAE,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC;QAClF,IAAI,MAAM,GAAsB,IAAI,CAAC;QACrC,IAAI,CAAC;YACJ,MAAM,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACjD,CAAC;QAAC,MAAM,CAAC;YACR,MAAM,GAAG,IAAI,CAAC;QACf,CAAC;QACD,IAAI,MAAM,EAAE,CAAC;YACZ,MAAM,GAAG,GAAG,2BAA2B,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;YAChE,IAAI,GAAG;gBAAE,OAAO,GAAG,CAAC;YACpB,6DAA6D;QAC9D,CAAC;IACF,CAAC;IAED,2EAA2E;IAC3E,2EAA2E;IAC3E,oEAAoE;IACpE,2EAA2E;IAC3E,wEAAwE;IACxE,2EAA2E;IAC3E,uEAAuE;IACvE,yEAAyE;IACzE,MAAM,eAAe,GAAG,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC;IAC7C,MAAM,cAAc,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC;IAE9C,IAAI,MAAkC,CAAC;IACvC,MAAM,UAAU,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;IACrC,IAAI,CAAC;QACJ,MAAM,GAAG,MAAM,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,gBAAgB,EAAE,SAAS,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;IACrF,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACd,MAAM,UAAU,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,UAAU,CAAC;QAClD,wEAAwE;QACxE,yEAAyE;QACzE,qEAAqE;QACrE,MAAM,OAAO,GAAG,GAAG,YAAY,KAAK,IAAI,GAAG,CAAC,IAAI,KAAK,YAAY,CAAC;QAClE,IAAI,OAAO,EAAE,CAAC;YACb,IAAI,MAAM,CAAC,OAAO;gBAAE,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,UAAU,EAAE,CAAC;YAChE,OAAO;gBACN,IAAI,EAAE,SAAS;gBACf,UAAU;gBACV,OAAO,EAAE,sBAAsB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,kBAAkB,GAAG,IAAI,CAAC,aAAa;aACtF,CAAC;QACH,CAAC;QACD,4EAA4E;QAC5E,4EAA4E;QAC5E,0EAA0E;QAC1E,wEAAwE;QACxE,IAAI,GAAG,YAAY,iBAAiB,EAAE,CAAC;YACtC,IAAI,GAAG,CAAC,IAAI,KAAK,UAAU,CAAC,UAAU,EAAE,CAAC;gBACxC,OAAO;oBACN,IAAI,EAAE,MAAM;oBACZ,UAAU;oBACV,MAAM,EAAE,YAAY;oBACpB,iBAAiB,EAAE,CAAC;oBACpB,OAAO,EAAE,+CAA+C;iBACxD,CAAC;YACH,CAAC;YACD,IAAI,GAAG,CAAC,IAAI,KAAK,UAAU,CAAC,aAAa,EAAE,CAAC;gBAC3C,OAAO;oBACN,IAAI,EAAE,MAAM;oBACZ,UAAU;oBACV,MAAM,EAAE,eAAe;oBACvB,iBAAiB,EAAE,CAAC;oBACpB,OAAO,EAAE,8DAA8D;iBACvE,CAAC;YACH,CAAC;QACF,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,eAAe,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;IAC1D,CAAC;IACD,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,UAAU,CAAC;IAE/C,0EAA0E;IAC1E,MAAM,cAAc,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;IACzC,IAAI,UAAkB,CAAC;IACvB,IAAI,CAAC;QACJ,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IACrC,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACd,yEAAyE;QACzE,6EAA6E;QAC7E,IAAI,GAAG,YAAY,UAAU;YAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;QAC5D,MAAM,GAAG,CAAC;IACX,CAAC;IACD,IAAI,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,gBAAgB;QAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC;IAC5E,MAAM,WAAW,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,cAAc,CAAC;IAEvD,2EAA2E;IAC3E,8EAA8E;IAC9E,qEAAqE;IACrE,uEAAuE;IACvE,kCAAkC;IAClC,8EAA8E;IAC9E,6EAA6E;IAC7E,+EAA+E;IAC/E,qDAAqD;IACrD,4EAA4E;IAC5E,8EAA8E;IAC9E,kEAAkE;IAClE,MAAM,eAAe,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAC9D,MAAM,gBAAgB,GAAG,eAAe,IAAI,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC;IACrE,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC;IAC1C,IAAI,UAAU,GAAkB,IAAI,CAAC;IACrC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,gBAAgB,IAAI,SAAS,EAAE,CAAC;QACnC,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QACpC,UAAU,GAAG,MAAM,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QACtD,MAAM,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;IACxC,CAAC;IAED,2EAA2E;IAC3E,6EAA6E;IAC7E,6EAA6E;IAC7E,uEAAuE;IACvE,IAAI,IAAI,CAAC,UAAU,IAAI,QAAQ,IAAI,UAAU,EAAE,CAAC;QAC/C,MAAM,KAAK,GAAG,qBAAqB,CAClC;YACC,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC;YACtC,YAAY,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,IAAI,CAAC;YAC1C,eAAe,EAAE,UAAU,CAAC,MAAM;YAClC,SAAS,EAAE,QAAQ;SACnB,EACD,IAAI,UAAU,CAAC,UAAU,CAAC,CAC1B,CAAC;QACF,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACxC,CAAC;IAED,MAAM,aAAa,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC;IAE3D,2EAA2E;IAC3E,0EAA0E;IAC1E,yEAAyE;IACzE,0EAA0E;IAC1E,0DAA0D;IAC1D,MAAM,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,GAAG,KAAK,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IAC3F,MAAM,KAAK,GACV,MAAM,IAAI,CAAC,MAAM,CAAC,SAAS,IAAI,MAAM,CAAC,WAAW,CAAC,GAAG,KAAK,cAAc,GAAG,CAAC;QAC3E,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI;QACzB,CAAC,CAAC,IAAI,CAAC;IAET,wEAAwE;IACxE,wEAAwE;IACxE,qCAAqC;IACrC,MAAM,cAAc,GAAG,UAAU,IAAI,gBAAgB,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC;IAE1E,2EAA2E;IAC3E,MAAM,YAAY,GAAG,iBAAiB,CAAC;QACtC,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,WAAW;QACX,OAAO;QACP,WAAW;QACX,MAAM;QACN,aAAa;QACb,KAAK;QACL,MAAM;QACN,cAAc,EAAE,IAAI,CAAC,cAAc;QACnC,wEAAwE;QACxE,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI;QAC1C,SAAS,EAAE,IAAI,CAAC,SAAS,IAAI,EAAE;KAC/B,CAAC,CAAC;IAEH,MAAM,OAAO,GAA2B;QACvC,cAAc,EAAE,kBAAkB;QAClC,eAAe,EAAE,YAAY;QAC7B,CAAC,sBAAsB,CAAC,EAAE,MAAM,CAAC,wBAAwB,CAAC;QAC1D,IAAI,EAAE,iBAAiB;KACvB,CAAC;IAEF,MAAM,OAAO,GAAsB;QAClC,WAAW;QACX,OAAO;QACP,WAAW;QACX,MAAM;QACN,aAAa;QACb,eAAe,EAAE,UAAU,CAAC,MAAM;QAClC,eAAe,EAAE,cAAc,EAAE,UAAU,IAAI,IAAI;QACnD,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI;KAC1C,CAAC;IAEF,IAAI,QAAuB,CAAC;IAC5B,IAAI,cAAc,EAAE,CAAC;QACpB,yEAAyE;QACzE,8DAA8D;QAC9D,OAAO,CAAC,kBAAkB,CAAC,GAAG,MAAM,CAAC;QACrC,OAAO,CAAC,gBAAgB,CAAC,GAAG,MAAM,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC;QAC9D,QAAQ,GAAG;YACV,IAAI,EAAE,IAAI,UAAU,CAAC,cAAc,CAAC;YACpC,QAAQ,EAAE,MAAM;YAChB,OAAO;YACP,MAAM;YACN,OAAO;SACP,CAAC;IACH,CAAC;SAAM,CAAC;QACP,OAAO,CAAC,gBAAgB,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC;QAClE,QAAQ,GAAG,EAAE,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;IAC3D,CAAC;IAED,OAAO;QACN,IAAI,EAAE,IAAI;QACV,QAAQ;QACR,OAAO;QACP,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC;QACtC,YAAY,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,IAAI,CAAC;KAC1C,CAAC;AACH,CAAC;AAED,+EAA+E;AAC/E,wBAAwB;AACxB,+EAA+E;AAE/E;;;;;GAKG;AACH,SAAS,2BAA2B,CACnC,UAAsB,EACtB,QAAgB,EAChB,IAAuB;IAEvB,MAAM,OAAO,GAAG,qBAAqB,CAAC,UAAU,CAAC,CAAC;IAClD,6EAA6E;IAC7E,kEAAkE;IAClE,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,MAAM,CAAC,SAAS,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IAEnE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,GAAG,OAAO,CAAC;IACxC,MAAM,eAAe,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAC9D,MAAM,aAAa,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC;IAE3D,MAAM,YAAY,GAAG,iBAAiB,CAAC;QACtC,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,WAAW,EAAE,CAAC;QACd,OAAO,EAAE,CAAC;QACV,WAAW,EAAE,CAAC;QACd,MAAM,EAAE,CAAC;QACT,aAAa;QACb,KAAK,EAAE,IAAI;QACX,MAAM,EAAE,IAAI;QACZ,cAAc,EAAE,IAAI,CAAC,cAAc;QACnC,UAAU,EAAE,IAAI;QAChB,SAAS,EAAE,IAAI,CAAC,SAAS,IAAI,EAAE;KAC/B,CAAC,CAAC;IAEH,MAAM,OAAO,GAA2B;QACvC,cAAc,EAAE,kBAAkB;QAClC,eAAe,EAAE,YAAY;QAC7B,CAAC,sBAAsB,CAAC,EAAE,MAAM,CAAC,wBAAwB,CAAC;QAC1D,IAAI,EAAE,iBAAiB;KACvB,CAAC;IAEF,MAAM,OAAO,GAAsB;QAClC,WAAW,EAAE,CAAC;QACd,OAAO,EAAE,CAAC;QACV,WAAW,EAAE,CAAC;QACd,MAAM,EAAE,CAAC;QACT,aAAa;QACb,eAAe,EAAE,MAAM,CAAC,eAAe;QACvC,eAAe,EAAE,eAAe,CAAC,CAAC,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI;QAChE,UAAU,EAAE,IAAI;KAChB,CAAC;IAEF,IAAI,QAAuB,CAAC;IAC5B,IAAI,eAAe,EAAE,CAAC;QACrB,sEAAsE;QACtE,OAAO,CAAC,kBAAkB,CAAC,GAAG,MAAM,CAAC;QACrC,OAAO,CAAC,gBAAgB,CAAC,GAAG,MAAM,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QAC3D,QAAQ,GAAG,EAAE,IAAI,EAAE,IAAI,UAAU,CAAC,WAAW,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;IACtF,CAAC;SAAM,CAAC;QACP,yEAAyE;QACzE,MAAM,IAAI,GAAG,eAAe,CAAC,WAAW,CAAC,CAAC;QAC1C,OAAO,CAAC,gBAAgB,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5D,QAAQ,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;IAC7C,CAAC;IAED,OAAO;QACN,IAAI,EAAE,IAAI;QACV,QAAQ;QACR,OAAO,EAAE,CAAC;QACV,UAAU,EAAE,MAAM,CAAC,UAAU;QAC7B,YAAY,EAAE,MAAM,CAAC,YAAY;KACjC,CAAC;AACH,CAAC;AAqBD;;;;;;;GAOG;AACH,SAAS,iBAAiB,CAAC,KAAwB;IAClD,IAAI,MAAM,GACT,YAAY,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;QAC1C,YAAY,KAAK,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;QAC5C,aAAa,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;QACzC,iBAAiB,KAAK,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;QACjD,YAAY,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI;QACvC,aAAa,KAAK,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;IAE/C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IAC1B,IAAI,KAAK,EAAE,CAAC;QACX,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;QAC5D,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,OAAO,GAAG,SAAS,CAAC,CAAC;QAC7D,MAAM;YACL,sBAAsB,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;gBAC/C,qBAAqB,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;gBAC7C,sBAAsB,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;gBAC/C,sBAAsB,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;IACnD,CAAC;IAED,KAAK,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;QAC3C,MAAM,IAAI,OAAO,KAAK,QAAQ,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;IAC/C,CAAC;IAED,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC5B,IAAI,MAAM,EAAE,CAAC;QACZ,MAAM,IAAI,qBAAqB,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1D,IAAI,MAAM,CAAC,oBAAoB,KAAK,SAAS,EAAE,CAAC;YAC/C,MAAM,IAAI,sBAAsB,MAAM,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACvE,CAAC;IACF,CAAC;IAED,+EAA+E;IAC/E,+EAA+E;IAC/E,kFAAkF;IAClF,MAAM,OAAO,GAAG,KAAK,CAAC,cAAc,CAAC;IACrC,IAAI,OAAO,EAAE,CAAC;QACb,MAAM,OAAO,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;QACjF,MAAM,IAAI,oBAAoB,OAAO,EAAE,CAAC;IACzC,CAAC;IAED,4EAA4E;IAC5E,8EAA8E;IAC9E,IAAI,KAAK,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;QAC/B,MAAM,IAAI,kBAAkB,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACxD,CAAC;IAED,OAAO,MAAM,CAAC;AACf,CAAC"}

package/dist/definitions/__tests__/definition-service.test.d.ts

@@ -0,0 +1,14 @@
+/**
+ * Tests for `DefinitionService.uploadVersion` version-number allocation (caching
+ * Phase 1.5). The root-cause fix: the next version number comes from the store's
+ * monotonic `reserveNextVersionNumber` counter — NOT max(existing)+1, which
+ * reused a number (and its `fileKey`) after delete-latest and let a stale storage
+ * blob serve the old version's bytes for new content.
+ *
+ * These run against fakes that record the store/storage calls, so they pin the
+ * SERVICE's contract (reserve → derive fileKey from the reserved number). That a
+ * real provider's counter is truly monotonic across delete-then-reupload is
+ * covered by the definition-store conformance suite (both providers).
+ */
+export {};
+//# sourceMappingURL=definition-service.test.d.ts.map

package/dist/definitions/__tests__/definition-service.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"definition-service.test.d.ts","sourceRoot":"","sources":["../../../src/definitions/__tests__/definition-service.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG"}

package/dist/definitions/__tests__/definition-service.test.js

@@ -0,0 +1,95 @@
+/**
+ * Tests for `DefinitionService.uploadVersion` version-number allocation (caching
+ * Phase 1.5). The root-cause fix: the next version number comes from the store's
+ * monotonic `reserveNextVersionNumber` counter — NOT max(existing)+1, which
+ * reused a number (and its `fileKey`) after delete-latest and let a stale storage
+ * blob serve the old version's bytes for new content.
+ *
+ * These run against fakes that record the store/storage calls, so they pin the
+ * SERVICE's contract (reserve → derive fileKey from the reserved number). That a
+ * real provider's counter is truly monotonic across delete-then-reupload is
+ * covered by the definition-store conformance suite (both providers).
+ */
+import { describe, it, expect } from 'vitest';
+import { DefinitionService } from '../definition-service.js';
+const CTX = { userId: 'u-1' };
+const SCHEMA = {};
+function fakeRecord(guid, nextVersionNumber) {
+    const now = new Date().toISOString();
+    return {
+        guid,
+        projectId: 'p-1',
+        ownerId: 'u-1',
+        createdBy: 'u-1',
+        updatedBy: 'u-1',
+        displayName: 'Def',
+        status: 'draft',
+        solveCount: 0,
+        nextVersionNumber,
+        liveVersionId: 'v-existing',
+        draftVersionId: 'v-existing',
+        createdAt: now,
+        updatedAt: now,
+        deletedAt: null
+    };
+}
+/**
+ * A minimal data provider whose `definitions` store hands out the reserved
+ * number and records the version row it was told to create. Only the methods
+ * `uploadVersion` touches are implemented.
+ */
+function fakeDeps(record) {
+    let counter = record.nextVersionNumber;
+    const created = [];
+    const puts = [];
+    const data = {
+        definitions: {
+            get: async () => record,
+            reserveNextVersionNumber: async () => counter++, // monotonic, never reused
+            createVersion: async (_ctx, v) => {
+                created.push(v);
+            },
+            setDraftVersion: async () => { }
+        }
+    };
+    const storage = {
+        put: async (key) => {
+            puts.push(key);
+        }
+    };
+    return { data, storage, created, puts };
+}
+describe('DefinitionService.uploadVersion — version-number allocation', () => {
+    it('reserves the next number from the record counter and derives the fileKey from it', async () => {
+        const record = fakeRecord('11111111-1111-1111-1111-111111111111', 3);
+        const { data, storage, created, puts } = fakeDeps(record);
+        const svc = new DefinitionService(data, storage);
+        const version = await svc.uploadVersion(CTX, record.guid, new Uint8Array([1, 2, 3]), 'gh', 'model.gh', SCHEMA);
+        expect(version.versionNumber).toBe(3);
+        // fileKey encodes the reserved number — so a fresh number ⇒ fresh key.
+        expect(version.fileKey).toContain('v3');
+        expect(puts).toEqual([version.fileKey]);
+        expect(created).toHaveLength(1);
+        expect(created[0].versionNumber).toBe(3);
+    });
+    it('two consecutive uploads mint distinct numbers and distinct fileKeys', async () => {
+        const record = fakeRecord('22222222-2222-2222-2222-222222222222', 5);
+        const { data, storage } = fakeDeps(record);
+        const svc = new DefinitionService(data, storage);
+        const a = await svc.uploadVersion(CTX, record.guid, new Uint8Array([1]), 'gh', 'a.gh', SCHEMA);
+        const b = await svc.uploadVersion(CTX, record.guid, new Uint8Array([2]), 'gh', 'b.gh', SCHEMA);
+        expect(a.versionNumber).toBe(5);
+        expect(b.versionNumber).toBe(6);
+        expect(a.fileKey).not.toBe(b.fileKey);
+    });
+    it('does NOT derive the number from the version list (no listVersions call)', async () => {
+        // The old bug read the version list; the fix must not. A deps object with no
+        // listVersions still works — reserveNextVersionNumber is the only source.
+        const record = fakeRecord('33333333-3333-3333-3333-333333333333', 9);
+        const { data, storage } = fakeDeps(record);
+        const svc = new DefinitionService(data, storage);
+        const version = await svc.uploadVersion(CTX, record.guid, new Uint8Array([1]), 'gh', 'a.gh', SCHEMA);
+        expect(version.versionNumber).toBe(9);
+    });
+});
+//# sourceMappingURL=definition-service.test.js.map