open-multi-agent-kit 0.96.1 → 0.96.2

package/dist/core/workload-shard-runner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"workload-shard-runner.js","sourceRoot":"","sources":["../../src/core/workload-shard-runner.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AAShE,MAAM,CAAC,KAAK,UAAU,WAAW,CAChC,KAAoC,EACpC,WAAiD,EACjD,OAAe,EACf,GAAe,EACC;IAChB,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IAC7C,IAAI,aAAuC,CAAC;IAC5C,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;QACtB,IAAI,CAAC;YACJ,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC;gBAC7C,SAAS,EAAE,SAAS,KAAK,CAAC,IAAI,CAAC,MAAM,IAAI,OAAO,EAAE;gBAClD,WAAW,EAAE,KAAK,CAAC,IAAI,CAAC,WAAW;gBACnC,aAAa,EAAE,OAAO;gBACtB,MAAM,EAAE,CAAC;gBACT,MAAM,EAAE,KAAK,CAAC,MAAM;gBACpB,SAAS,EAAE,KAAK,CAAC,mBAAmB,IAAI,OAAO;aAC/C,CAAC,CAAC;YACH,aAAa,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACxC,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YAChB,MAAM,OAAO,GAAG,KAAK,YAAY,mBAAmB,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC;YACjF,oEAAoE;YACpE,IAAI,CAAC,OAAO,EAAE,CAAC;gBACd,eAAe,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,SAAS,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;gBACjE,eAAe,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,UAAU,EAAE,oBAAoB,EAAE,GAAG,EAAE,CAAC,CAAC;YACnG,CAAC;YACD,OAAO;QACR,CAAC;IACF,CAAC;IACD,MAAM,SAAS,GAAG,GAAG,EAAE,CAAC,WAAW,EAAE,CAAC;IACtC,eAAe,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,SAAS,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,CAAC;IAC5E,IAAI,CAAC;QACJ,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,MAAM,CAAC;YACjC,KAAK;YACL,OAAO,EAAE,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,OAAO,IAAI,CAAC;YAC/C,MAAM,EAAE,KAAK,CAAC,MAAM;SACpB,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC9D,eAAe,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,KAAK,EAAE;YACnD,GAAG;YACH,SAAS;YACT,YAAY,EAAE,CAAC,aAAa,MAAM,CAAC,QAAQ,EAAE,EAAE,GAAG,CAAC,MAAM,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC;YAC9E,UAAU,EAAE,iBAAiB,CAAC,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC;SACrD,CAAC,CAAC;IACJ,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QAChB,MAAM,KAAK,GAAuB,KAAK,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC;QAC/E,eAAe,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,KAAK,EAAE;YACnD,GAAG;YACH,SAAS;YACT,UAAU,EAAE,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,cAAc;YAChE,YAAY,EAAE,CAAC,SAAS,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;SACtD,CAAC,CAAC;IACJ,CAAC;YAAS,CAAC;QACV,aAAa,EAAE,EAAE,CAAC;IACnB,CAAC;AAAA,CACD;AAED,MAAM,UAAU,eAAe,CAC9B,KAAoC,EACpC,WAAiD,EACjD,OAAe,EACf,KAAyB,EACzB,OAKC,EACM;IACP,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACzC,IAAI,OAAO,KAAK,SAAS;QAAE,OAAO;IAClC,MAAM,OAAO,GAAG,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC;IAC5E,MAAM,QAAQ,GAAG,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,CAAC;IAC5D,KAAK,CAAC,KAAK,CAAC,gBAAgB,CAAC;QAC5B,aAAa,EAAE,CAAC;QAChB,MAAM,EAAE,KAAK,CAAC,IAAI,CAAC,MAAM;QACzB,OAAO;QACP,OAAO;QACP,KAAK;QACL,GAAG,CAAC,OAAO,CAAC,SAAS,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACnG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,OAAO,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAChE,YAAY,EAAE,OAAO,CAAC,YAAY,IAAI,EAAE;QACxC,GAAG,CAAC,OAAO,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC/E,CAAC,CAAC;IACH,WAAW,CAAC,GAAG,CAAC,OAAO,EAAE;QACxB,OAAO;QACP,KAAK;QACL,OAAO;QACP,YAAY,EAAE,OAAO,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,YAAY;QACxF,UAAU,EAAE,OAAO,CAAC,UAAU,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC;KACxF,CAAC,CAAC;AAAA,CACH;AAED,SAAS,gBAAgB,CAAC,MAA+B,EAAE,QAAgB,EAAsB;IAChG,IAAI,MAAM,EAAE,OAAO;QAAE,OAAO,SAAS,CAAC;IACtC,OAAO,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;AAAA,CAC5C;AAED,SAAS,iBAAiB,CAAC,KAAyB,EAAE,QAAgB,EAAsB;IAC3F,IAAI,KAAK,KAAK,QAAQ;QAAE,OAAO,QAAQ,QAAQ,EAAE,CAAC;IAClD,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC;AAAA,CACvD;AAED,MAAM,UAAU,SAAS,CAAC,IAAuB,EAAE,OAAe,EAAqB;IACtF,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,OAAO,KAAK,OAAO,CAAC,CAAC;IAC7E,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,SAAS,OAAO,gBAAgB,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IAChE,CAAC;IACD,OAAO,KAAK,CAAC;AAAA,CACb","sourcesContent":["import { WorkloadPermitError } from \"./workload-permit-pool.ts\";\nimport type { ExecuteWorkloadShardPlanInput } from \"./workload-shard-executor.ts\";\nimport type {\n\tWorkloadShardPlan,\n\tWorkloadShardProjection,\n\tWorkloadShardSpec,\n\tWorkloadShardState,\n} from \"./workload-shard-plan.ts\";\n\nexport async function runOneShard(\n\tinput: ExecuteWorkloadShardPlanInput,\n\tprojections: Map<string, WorkloadShardProjection>,\n\tshardId: string,\n\tnow: () => Date,\n): Promise<void> {\n\tconst shard = shardById(input.plan, shardId);\n\tlet releasePermit: (() => void) | undefined;\n\tif (input.permitPool) {\n\t\ttry {\n\t\t\tconst permit = await input.permitPool.acquire({\n\t\t\t\trequestId: `shard-${input.plan.planId}-${shardId}`,\n\t\t\t\tpromptRunId: input.plan.promptRunId,\n\t\t\t\tworkloadClass: \"heavy\",\n\t\t\t\tweight: 1,\n\t\t\t\tsignal: input.signal,\n\t\t\t\ttimeoutMs: input.permitWaitTimeoutMs ?? 120_000,\n\t\t\t});\n\t\t\treleasePermit = () => permit.release();\n\t\t} catch (error) {\n\t\t\tconst aborted = error instanceof WorkloadPermitError && error.code === \"aborted\";\n\t\t\t// Never ran: stays pending; an aborted wait is not a shard failure.\n\t\t\tif (!aborted) {\n\t\t\t\tapplyTransition(input, projections, shardId, \"running\", { now });\n\t\t\t\tapplyTransition(input, projections, shardId, \"failed\", { reasonCode: \"permit.unavailable\", now });\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t}\n\tconst startedAt = now().toISOString();\n\tapplyTransition(input, projections, shardId, \"running\", { now, startedAt });\n\ttry {\n\t\tconst result = await input.runner({\n\t\t\tshard,\n\t\t\tattempt: projections.get(shardId)?.attempt ?? 1,\n\t\t\tsignal: input.signal,\n\t\t});\n\t\tconst state = terminalStateFor(input.signal, result.exitCode);\n\t\tapplyTransition(input, projections, shardId, state, {\n\t\t\tnow,\n\t\t\tstartedAt,\n\t\t\tevidenceRefs: [`exit-code:${result.exitCode}`, ...(result.evidenceRefs ?? [])],\n\t\t\treasonCode: terminalReasonFor(state, result.exitCode),\n\t\t});\n\t} catch (error) {\n\t\tconst state: WorkloadShardState = input.signal?.aborted ? \"aborted\" : \"failed\";\n\t\tapplyTransition(input, projections, shardId, state, {\n\t\t\tnow,\n\t\t\tstartedAt,\n\t\t\treasonCode: state === \"aborted\" ? \"run.aborted\" : \"runner.error\",\n\t\t\tevidenceRefs: [`error:${String(error).slice(0, 120)}`],\n\t\t});\n\t} finally {\n\t\treleasePermit?.();\n\t}\n}\n\nexport function applyTransition(\n\tinput: ExecuteWorkloadShardPlanInput,\n\tprojections: Map<string, WorkloadShardProjection>,\n\tshardId: string,\n\tstate: WorkloadShardState,\n\toptions: {\n\t\treadonly now: () => Date;\n\t\treadonly startedAt?: string;\n\t\treadonly evidenceRefs?: readonly string[];\n\t\treadonly reasonCode?: string;\n\t},\n): void {\n\tconst current = projections.get(shardId);\n\tif (current === undefined) return;\n\tconst attempt = state === \"running\" ? current.attempt + 1 : current.attempt;\n\tconst terminal = state !== \"pending\" && state !== \"running\";\n\tinput.store.appendTransition({\n\t\tschemaVersion: 1,\n\t\tplanId: input.plan.planId,\n\t\tshardId,\n\t\tattempt,\n\t\tstate,\n\t\t...(options.startedAt !== undefined && state === \"running\" ? { startedAt: options.startedAt } : {}),\n\t\t...(terminal ? { finishedAt: options.now().toISOString() } : {}),\n\t\tevidenceRefs: options.evidenceRefs ?? [],\n\t\t...(options.reasonCode !== undefined ? { reasonCode: options.reasonCode } : {}),\n\t});\n\tprojections.set(shardId, {\n\t\tshardId,\n\t\tstate,\n\t\tattempt,\n\t\tevidenceRefs: options.evidenceRefs?.length ? options.evidenceRefs : current.evidenceRefs,\n\t\treasonCode: options.reasonCode ?? (state === \"pending\" ? undefined : current.reasonCode),\n\t});\n}\n\nfunction terminalStateFor(signal: AbortSignal | undefined, exitCode: number): WorkloadShardState {\n\tif (signal?.aborted) return \"aborted\";\n\treturn exitCode === 0 ? \"passed\" : \"failed\";\n}\n\nfunction terminalReasonFor(state: WorkloadShardState, exitCode: number): string | undefined {\n\tif (state === \"failed\") return `exit.${exitCode}`;\n\treturn state === \"aborted\" ? \"run.aborted\" : undefined;\n}\n\nexport function shardById(plan: WorkloadShardPlan, shardId: string): WorkloadShardSpec {\n\tconst shard = plan.shards.find((candidate) => candidate.shardId === shardId);\n\tif (shard === undefined) {\n\t\tthrow new Error(`shard ${shardId} not in plan ${plan.planId}`);\n\t}\n\treturn shard;\n}\n"]}

package/dist/core/workload-shard-store.d.ts

@@ -0,0 +1,44 @@
+import { type WorkloadShardPlan, type WorkloadShardProjection, type WorkloadShardRecord } from "./workload-shard-plan.ts";
+/**
+ * Durable workload shard journal (OMK v0.97.x roadmap §13.3/§13.5, M5/PR8).
+ *
+ * Append-only JSONL at `.omk/runs/<promptRunId>/workload-shards.jsonl` with
+ * a per-line hash chain. Every append is validated against the in-memory
+ * projection BEFORE it is written, and every load re-verifies parse, chain,
+ * and §13.4 transition legality. Corruption fails closed (§21, §32 kill
+ * criteria: never resume over a corrupt journal): the caller quarantines
+ * the file and requires explicit repair; the journal itself is preserved
+ * for §30.4 rollback.
+ */
+export declare const WORKLOAD_SHARD_JOURNAL_FILE = "workload-shards.jsonl";
+export type WorkloadShardJournalErrorCode = "io" | "parse" | "chain" | "plan" | "transition";
+export declare class WorkloadShardJournalError extends Error {
+    readonly code: WorkloadShardJournalErrorCode;
+    readonly line?: number;
+    constructor(code: WorkloadShardJournalErrorCode, message: string, line?: number);
+}
+export declare function workloadShardJournalPath(cwd: string, promptRunId: string): string;
+export declare class WorkloadShardStore {
+    private readonly journalPath;
+    private state;
+    constructor(journalPath: string);
+    static open(cwd: string, promptRunId: string): WorkloadShardStore;
+    get filePath(): string;
+    /** Record the plan as the first line. Fails closed if any plan already exists. */
+    appendPlan(plan: WorkloadShardPlan): void;
+    /** Validate one §13.4 transition against the projection, then append it. */
+    appendTransition(record: WorkloadShardRecord): void;
+    /** Load and fully verify the journal. A missing file is an empty journal. */
+    load(): {
+        readonly plan: WorkloadShardPlan | null;
+        readonly records: readonly WorkloadShardRecord[];
+        readonly projections: ReadonlyMap<string, WorkloadShardProjection> | null;
+    };
+    /** §21 fail-closed path: move a corrupt journal aside; explicit repair required. */
+    quarantine(): string | null;
+    private ensureLoaded;
+    private parseLine;
+    private verifyChain;
+    private appendLine;
+}
+//# sourceMappingURL=workload-shard-store.d.ts.map

package/dist/core/workload-shard-store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"workload-shard-store.d.ts","sourceRoot":"","sources":["../../src/core/workload-shard-store.ts"],"names":[],"mappings":"AAGA,OAAO,EAGN,KAAK,iBAAiB,EACtB,KAAK,uBAAuB,EAC5B,KAAK,mBAAmB,EAExB,MAAM,0BAA0B,CAAC;AAElC;;;;;;;;;;GAUG;AAEH,eAAO,MAAM,2BAA2B,0BAA0B,CAAC;AAInE,MAAM,MAAM,6BAA6B,GAAG,IAAI,GAAG,OAAO,GAAG,OAAO,GAAG,MAAM,GAAG,YAAY,CAAC;AAE7F,qBAAa,yBAA0B,SAAQ,KAAK;IACnD,QAAQ,CAAC,IAAI,EAAE,6BAA6B,CAAC;IAC7C,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACvB,YAAY,IAAI,EAAE,6BAA6B,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,EAK9E;CACD;AAWD,wBAAgB,wBAAwB,CAAC,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM,CAKjF;AASD,qBAAa,kBAAkB;IAC9B,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;IACrC,OAAO,CAAC,KAAK,CAA6B;IAE1C,YAAY,WAAW,EAAE,MAAM,EAE9B;IAED,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,kBAAkB,CAEhE;IAED,IAAI,QAAQ,IAAI,MAAM,CAErB;IAED,kFAAkF;IAClF,UAAU,CAAC,IAAI,EAAE,iBAAiB,GAAG,IAAI,CAWxC;IAED,6EAA4E;IAC5E,gBAAgB,CAAC,MAAM,EAAE,mBAAmB,GAAG,IAAI,CAgBlD;IAED,6EAA6E;IAC7E,IAAI,IAAI;QACP,QAAQ,CAAC,IAAI,EAAE,iBAAiB,GAAG,IAAI,CAAC;QACxC,QAAQ,CAAC,OAAO,EAAE,SAAS,mBAAmB,EAAE,CAAC;QACjD,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC,MAAM,EAAE,uBAAuB,CAAC,GAAG,IAAI,CAAC;KAC1E,CAIA;IAED,qFAAoF;IACpF,UAAU,IAAI,MAAM,GAAG,IAAI,CAY1B;IAED,OAAO,CAAC,YAAY;IAqCpB,OAAO,CAAC,SAAS;IAoBjB,OAAO,CAAC,WAAW;IAUnB,OAAO,CAAC,UAAU;CAmBlB","sourcesContent":["import { createHash } from \"node:crypto\";\nimport * as fs from \"node:fs\";\nimport * as path from \"node:path\";\nimport {\n\treduceShardRecords,\n\tvalidateWorkloadShardPlan,\n\ttype WorkloadShardPlan,\n\ttype WorkloadShardProjection,\n\ttype WorkloadShardRecord,\n\tWorkloadShardTransitionError,\n} from \"./workload-shard-plan.ts\";\n\n/**\n * Durable workload shard journal (OMK v0.97.x roadmap §13.3/§13.5, M5/PR8).\n *\n * Append-only JSONL at `.omk/runs/<promptRunId>/workload-shards.jsonl` with\n * a per-line hash chain. Every append is validated against the in-memory\n * projection BEFORE it is written, and every load re-verifies parse, chain,\n * and §13.4 transition legality. Corruption fails closed (§21, §32 kill\n * criteria: never resume over a corrupt journal): the caller quarantines\n * the file and requires explicit repair; the journal itself is preserved\n * for §30.4 rollback.\n */\n\nexport const WORKLOAD_SHARD_JOURNAL_FILE = \"workload-shards.jsonl\";\nconst GENESIS_DIGEST = \"workload-shard-genesis\";\nconst RUN_ID_PATTERN = /^[A-Za-z0-9._-]+$/;\n\nexport type WorkloadShardJournalErrorCode = \"io\" | \"parse\" | \"chain\" | \"plan\" | \"transition\";\n\nexport class WorkloadShardJournalError extends Error {\n\treadonly code: WorkloadShardJournalErrorCode;\n\treadonly line?: number;\n\tconstructor(code: WorkloadShardJournalErrorCode, message: string, line?: number) {\n\t\tsuper(line === undefined ? message : `${message} (line ${line})`);\n\t\tthis.name = \"WorkloadShardJournalError\";\n\t\tthis.code = code;\n\t\tthis.line = line;\n\t}\n}\n\ntype JournalLine =\n\t| { readonly seq: number; readonly digest: string; readonly kind: \"plan\"; readonly plan: WorkloadShardPlan }\n\t| {\n\t\t\treadonly seq: number;\n\t\t\treadonly digest: string;\n\t\t\treadonly kind: \"transition\";\n\t\t\treadonly record: WorkloadShardRecord;\n\t  };\n\nexport function workloadShardJournalPath(cwd: string, promptRunId: string): string {\n\tif (!RUN_ID_PATTERN.test(promptRunId)) {\n\t\tthrow new WorkloadShardJournalError(\"io\", `invalid promptRunId for journal path: ${JSON.stringify(promptRunId)}`);\n\t}\n\treturn path.join(cwd, \".omk\", \"runs\", promptRunId, WORKLOAD_SHARD_JOURNAL_FILE);\n}\n\ninterface JournalState {\n\tplan: WorkloadShardPlan | null;\n\trecords: WorkloadShardRecord[];\n\tlastDigest: string;\n\tnextSeq: number;\n}\n\nexport class WorkloadShardStore {\n\tprivate readonly journalPath: string;\n\tprivate state: JournalState | null = null;\n\n\tconstructor(journalPath: string) {\n\t\tthis.journalPath = journalPath;\n\t}\n\n\tstatic open(cwd: string, promptRunId: string): WorkloadShardStore {\n\t\treturn new WorkloadShardStore(workloadShardJournalPath(cwd, promptRunId));\n\t}\n\n\tget filePath(): string {\n\t\treturn this.journalPath;\n\t}\n\n\t/** Record the plan as the first line. Fails closed if any plan already exists. */\n\tappendPlan(plan: WorkloadShardPlan): void {\n\t\tconst state = this.ensureLoaded();\n\t\tif (state.plan !== null) {\n\t\t\tthrow new WorkloadShardJournalError(\"plan\", \"journal already contains a plan\");\n\t\t}\n\t\tconst planErrors = validateWorkloadShardPlan(plan);\n\t\tif (planErrors.length > 0) {\n\t\t\tthrow new WorkloadShardJournalError(\"plan\", `invalid plan: ${planErrors.join(\"; \")}`);\n\t\t}\n\t\tthis.appendLine(state, { kind: \"plan\", plan });\n\t\tstate.plan = plan;\n\t}\n\n\t/** Validate one §13.4 transition against the projection, then append it. */\n\tappendTransition(record: WorkloadShardRecord): void {\n\t\tconst state = this.ensureLoaded();\n\t\tif (state.plan === null) {\n\t\t\tthrow new WorkloadShardJournalError(\"plan\", \"cannot append a transition before the plan\");\n\t\t}\n\t\ttry {\n\t\t\t// Replaying with the candidate appended proves legality before any write.\n\t\t\treduceShardRecords(state.plan, [...state.records, record]);\n\t\t} catch (error) {\n\t\t\tif (error instanceof WorkloadShardTransitionError) {\n\t\t\t\tthrow new WorkloadShardJournalError(\"transition\", error.message);\n\t\t\t}\n\t\t\tthrow error;\n\t\t}\n\t\tthis.appendLine(state, { kind: \"transition\", record });\n\t\tstate.records.push(record);\n\t}\n\n\t/** Load and fully verify the journal. A missing file is an empty journal. */\n\tload(): {\n\t\treadonly plan: WorkloadShardPlan | null;\n\t\treadonly records: readonly WorkloadShardRecord[];\n\t\treadonly projections: ReadonlyMap<string, WorkloadShardProjection> | null;\n\t} {\n\t\tconst state = this.ensureLoaded();\n\t\tconst projections = state.plan === null ? null : reduceShardRecords(state.plan, state.records);\n\t\treturn { plan: state.plan, records: [...state.records], projections };\n\t}\n\n\t/** §21 fail-closed path: move a corrupt journal aside; explicit repair required. */\n\tquarantine(): string | null {\n\t\ttry {\n\t\t\tif (!fs.existsSync(this.journalPath)) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\tconst target = `${this.journalPath}.corrupt-${Date.now()}`;\n\t\t\tfs.renameSync(this.journalPath, target);\n\t\t\tthis.state = null;\n\t\t\treturn target;\n\t\t} catch (error) {\n\t\t\tthrow new WorkloadShardJournalError(\"io\", `quarantine failed: ${String(error)}`);\n\t\t}\n\t}\n\n\tprivate ensureLoaded(): JournalState {\n\t\tif (this.state !== null) {\n\t\t\treturn this.state;\n\t\t}\n\t\tconst state: JournalState = { plan: null, records: [], lastDigest: GENESIS_DIGEST, nextSeq: 0 };\n\t\tif (fs.existsSync(this.journalPath)) {\n\t\t\tconst raw = fs.readFileSync(this.journalPath, \"utf8\");\n\t\t\tconst lines = raw.split(\"\\n\").filter((line) => line.trim() !== \"\");\n\t\t\tfor (let index = 0; index < lines.length; index++) {\n\t\t\t\tconst parsed = this.parseLine(lines[index], index + 1);\n\t\t\t\tthis.verifyChain(state, parsed, index + 1);\n\t\t\t\tif (parsed.kind === \"plan\") {\n\t\t\t\t\tif (state.plan !== null) {\n\t\t\t\t\t\tthrow new WorkloadShardJournalError(\"plan\", \"duplicate plan line\", index + 1);\n\t\t\t\t\t}\n\t\t\t\t\tstate.plan = parsed.plan;\n\t\t\t\t} else {\n\t\t\t\t\tif (state.plan === null) {\n\t\t\t\t\t\tthrow new WorkloadShardJournalError(\"plan\", \"transition before plan\", index + 1);\n\t\t\t\t\t}\n\t\t\t\t\tstate.records.push(parsed.record);\n\t\t\t\t}\n\t\t\t\tstate.lastDigest = parsed.digest;\n\t\t\t\tstate.nextSeq = parsed.seq + 1;\n\t\t\t}\n\t\t\tif (state.plan !== null) {\n\t\t\t\ttry {\n\t\t\t\t\treduceShardRecords(state.plan, state.records);\n\t\t\t\t} catch (error) {\n\t\t\t\t\tthrow new WorkloadShardJournalError(\"transition\", `replay failed: ${String(error)}`);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tthis.state = state;\n\t\treturn state;\n\t}\n\n\tprivate parseLine(line: string, lineNumber: number): JournalLine {\n\t\tlet parsed: unknown;\n\t\ttry {\n\t\t\tparsed = JSON.parse(line);\n\t\t} catch {\n\t\t\tthrow new WorkloadShardJournalError(\"parse\", \"journal line is not valid JSON\", lineNumber);\n\t\t}\n\t\tconst candidate = parsed as Partial<JournalLine>;\n\t\tif (\n\t\t\ttypeof candidate !== \"object\" ||\n\t\t\tcandidate === null ||\n\t\t\ttypeof candidate.seq !== \"number\" ||\n\t\t\ttypeof candidate.digest !== \"string\" ||\n\t\t\t(candidate.kind !== \"plan\" && candidate.kind !== \"transition\")\n\t\t) {\n\t\t\tthrow new WorkloadShardJournalError(\"parse\", \"journal line has an unknown shape\", lineNumber);\n\t\t}\n\t\treturn candidate as JournalLine;\n\t}\n\n\tprivate verifyChain(state: JournalState, line: JournalLine, lineNumber: number): void {\n\t\tif (line.seq !== state.nextSeq) {\n\t\t\tthrow new WorkloadShardJournalError(\"chain\", `sequence ${line.seq} != expected ${state.nextSeq}`, lineNumber);\n\t\t}\n\t\tconst expected = chainDigest(state.lastDigest, line);\n\t\tif (line.digest !== expected) {\n\t\t\tthrow new WorkloadShardJournalError(\"chain\", \"digest chain mismatch\", lineNumber);\n\t\t}\n\t}\n\n\tprivate appendLine(\n\t\tstate: JournalState,\n\t\tbody: { kind: \"plan\"; plan: WorkloadShardPlan } | { kind: \"transition\"; record: WorkloadShardRecord },\n\t): void {\n\t\tconst seq = state.nextSeq;\n\t\tconst digest = chainDigest(state.lastDigest, { seq, ...body });\n\t\tconst line: JournalLine =\n\t\t\tbody.kind === \"plan\"\n\t\t\t\t? { seq, digest, kind: \"plan\", plan: body.plan }\n\t\t\t\t: { seq, digest, kind: \"transition\", record: body.record };\n\t\ttry {\n\t\t\tfs.mkdirSync(path.dirname(this.journalPath), { recursive: true });\n\t\t\tfs.appendFileSync(this.journalPath, `${JSON.stringify(line)}\\n`, \"utf8\");\n\t\t} catch (error) {\n\t\t\tthrow new WorkloadShardJournalError(\"io\", `append failed: ${String(error)}`);\n\t\t}\n\t\tstate.lastDigest = digest;\n\t\tstate.nextSeq = seq + 1;\n\t}\n}\n\n/** Digest over the previous digest plus the canonical payload (digest field excluded). */\nfunction chainDigest(\n\tpreviousDigest: string,\n\tline: { readonly seq: number } & (\n\t\t| { readonly kind: \"plan\"; readonly plan: WorkloadShardPlan }\n\t\t| { readonly kind: \"transition\"; readonly record: WorkloadShardRecord }\n\t),\n): string {\n\tconst payload =\n\t\tline.kind === \"plan\"\n\t\t\t? JSON.stringify({ seq: line.seq, kind: line.kind, plan: line.plan })\n\t\t\t: JSON.stringify({ seq: line.seq, kind: line.kind, record: line.record });\n\treturn createHash(\"sha256\").update(`${previousDigest}\\n${payload}`, \"utf8\").digest(\"hex\");\n}\n"]}

package/dist/core/workload-shard-store.js

@@ -0,0 +1,189 @@
+import { createHash } from "node:crypto";
+import * as fs from "node:fs";
+import * as path from "node:path";
+import { reduceShardRecords, validateWorkloadShardPlan, WorkloadShardTransitionError, } from "./workload-shard-plan.js";
+/**
+ * Durable workload shard journal (OMK v0.97.x roadmap §13.3/§13.5, M5/PR8).
+ *
+ * Append-only JSONL at `.omk/runs/<promptRunId>/workload-shards.jsonl` with
+ * a per-line hash chain. Every append is validated against the in-memory
+ * projection BEFORE it is written, and every load re-verifies parse, chain,
+ * and §13.4 transition legality. Corruption fails closed (§21, §32 kill
+ * criteria: never resume over a corrupt journal): the caller quarantines
+ * the file and requires explicit repair; the journal itself is preserved
+ * for §30.4 rollback.
+ */
+export const WORKLOAD_SHARD_JOURNAL_FILE = "workload-shards.jsonl";
+const GENESIS_DIGEST = "workload-shard-genesis";
+const RUN_ID_PATTERN = /^[A-Za-z0-9._-]+$/;
+export class WorkloadShardJournalError extends Error {
+    code;
+    line;
+    constructor(code, message, line) {
+        super(line === undefined ? message : `${message} (line ${line})`);
+        this.name = "WorkloadShardJournalError";
+        this.code = code;
+        this.line = line;
+    }
+}
+export function workloadShardJournalPath(cwd, promptRunId) {
+    if (!RUN_ID_PATTERN.test(promptRunId)) {
+        throw new WorkloadShardJournalError("io", `invalid promptRunId for journal path: ${JSON.stringify(promptRunId)}`);
+    }
+    return path.join(cwd, ".omk", "runs", promptRunId, WORKLOAD_SHARD_JOURNAL_FILE);
+}
+export class WorkloadShardStore {
+    journalPath;
+    state = null;
+    constructor(journalPath) {
+        this.journalPath = journalPath;
+    }
+    static open(cwd, promptRunId) {
+        return new WorkloadShardStore(workloadShardJournalPath(cwd, promptRunId));
+    }
+    get filePath() {
+        return this.journalPath;
+    }
+    /** Record the plan as the first line. Fails closed if any plan already exists. */
+    appendPlan(plan) {
+        const state = this.ensureLoaded();
+        if (state.plan !== null) {
+            throw new WorkloadShardJournalError("plan", "journal already contains a plan");
+        }
+        const planErrors = validateWorkloadShardPlan(plan);
+        if (planErrors.length > 0) {
+            throw new WorkloadShardJournalError("plan", `invalid plan: ${planErrors.join("; ")}`);
+        }
+        this.appendLine(state, { kind: "plan", plan });
+        state.plan = plan;
+    }
+    /** Validate one §13.4 transition against the projection, then append it. */
+    appendTransition(record) {
+        const state = this.ensureLoaded();
+        if (state.plan === null) {
+            throw new WorkloadShardJournalError("plan", "cannot append a transition before the plan");
+        }
+        try {
+            // Replaying with the candidate appended proves legality before any write.
+            reduceShardRecords(state.plan, [...state.records, record]);
+        }
+        catch (error) {
+            if (error instanceof WorkloadShardTransitionError) {
+                throw new WorkloadShardJournalError("transition", error.message);
+            }
+            throw error;
+        }
+        this.appendLine(state, { kind: "transition", record });
+        state.records.push(record);
+    }
+    /** Load and fully verify the journal. A missing file is an empty journal. */
+    load() {
+        const state = this.ensureLoaded();
+        const projections = state.plan === null ? null : reduceShardRecords(state.plan, state.records);
+        return { plan: state.plan, records: [...state.records], projections };
+    }
+    /** §21 fail-closed path: move a corrupt journal aside; explicit repair required. */
+    quarantine() {
+        try {
+            if (!fs.existsSync(this.journalPath)) {
+                return null;
+            }
+            const target = `${this.journalPath}.corrupt-${Date.now()}`;
+            fs.renameSync(this.journalPath, target);
+            this.state = null;
+            return target;
+        }
+        catch (error) {
+            throw new WorkloadShardJournalError("io", `quarantine failed: ${String(error)}`);
+        }
+    }
+    ensureLoaded() {
+        if (this.state !== null) {
+            return this.state;
+        }
+        const state = { plan: null, records: [], lastDigest: GENESIS_DIGEST, nextSeq: 0 };
+        if (fs.existsSync(this.journalPath)) {
+            const raw = fs.readFileSync(this.journalPath, "utf8");
+            const lines = raw.split("\n").filter((line) => line.trim() !== "");
+            for (let index = 0; index < lines.length; index++) {
+                const parsed = this.parseLine(lines[index], index + 1);
+                this.verifyChain(state, parsed, index + 1);
+                if (parsed.kind === "plan") {
+                    if (state.plan !== null) {
+                        throw new WorkloadShardJournalError("plan", "duplicate plan line", index + 1);
+                    }
+                    state.plan = parsed.plan;
+                }
+                else {
+                    if (state.plan === null) {
+                        throw new WorkloadShardJournalError("plan", "transition before plan", index + 1);
+                    }
+                    state.records.push(parsed.record);
+                }
+                state.lastDigest = parsed.digest;
+                state.nextSeq = parsed.seq + 1;
+            }
+            if (state.plan !== null) {
+                try {
+                    reduceShardRecords(state.plan, state.records);
+                }
+                catch (error) {
+                    throw new WorkloadShardJournalError("transition", `replay failed: ${String(error)}`);
+                }
+            }
+        }
+        this.state = state;
+        return state;
+    }
+    parseLine(line, lineNumber) {
+        let parsed;
+        try {
+            parsed = JSON.parse(line);
+        }
+        catch {
+            throw new WorkloadShardJournalError("parse", "journal line is not valid JSON", lineNumber);
+        }
+        const candidate = parsed;
+        if (typeof candidate !== "object" ||
+            candidate === null ||
+            typeof candidate.seq !== "number" ||
+            typeof candidate.digest !== "string" ||
+            (candidate.kind !== "plan" && candidate.kind !== "transition")) {
+            throw new WorkloadShardJournalError("parse", "journal line has an unknown shape", lineNumber);
+        }
+        return candidate;
+    }
+    verifyChain(state, line, lineNumber) {
+        if (line.seq !== state.nextSeq) {
+            throw new WorkloadShardJournalError("chain", `sequence ${line.seq} != expected ${state.nextSeq}`, lineNumber);
+        }
+        const expected = chainDigest(state.lastDigest, line);
+        if (line.digest !== expected) {
+            throw new WorkloadShardJournalError("chain", "digest chain mismatch", lineNumber);
+        }
+    }
+    appendLine(state, body) {
+        const seq = state.nextSeq;
+        const digest = chainDigest(state.lastDigest, { seq, ...body });
+        const line = body.kind === "plan"
+            ? { seq, digest, kind: "plan", plan: body.plan }
+            : { seq, digest, kind: "transition", record: body.record };
+        try {
+            fs.mkdirSync(path.dirname(this.journalPath), { recursive: true });
+            fs.appendFileSync(this.journalPath, `${JSON.stringify(line)}\n`, "utf8");
+        }
+        catch (error) {
+            throw new WorkloadShardJournalError("io", `append failed: ${String(error)}`);
+        }
+        state.lastDigest = digest;
+        state.nextSeq = seq + 1;
+    }
+}
+/** Digest over the previous digest plus the canonical payload (digest field excluded). */
+function chainDigest(previousDigest, line) {
+    const payload = line.kind === "plan"
+        ? JSON.stringify({ seq: line.seq, kind: line.kind, plan: line.plan })
+        : JSON.stringify({ seq: line.seq, kind: line.kind, record: line.record });
+    return createHash("sha256").update(`${previousDigest}\n${payload}`, "utf8").digest("hex");
+}
+//# sourceMappingURL=workload-shard-store.js.map

package/dist/core/workload-shard-store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"workload-shard-store.js","sourceRoot":"","sources":["../../src/core/workload-shard-store.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,KAAK,EAAE,MAAM,SAAS,CAAC;AAC9B,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAClC,OAAO,EACN,kBAAkB,EAClB,yBAAyB,EAIzB,4BAA4B,GAC5B,MAAM,0BAA0B,CAAC;AAElC;;;;;;;;;;GAUG;AAEH,MAAM,CAAC,MAAM,2BAA2B,GAAG,uBAAuB,CAAC;AACnE,MAAM,cAAc,GAAG,wBAAwB,CAAC;AAChD,MAAM,cAAc,GAAG,mBAAmB,CAAC;AAI3C,MAAM,OAAO,yBAA0B,SAAQ,KAAK;IAC1C,IAAI,CAAgC;IACpC,IAAI,CAAU;IACvB,YAAY,IAAmC,EAAE,OAAe,EAAE,IAAa,EAAE;QAChF,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,UAAU,IAAI,GAAG,CAAC,CAAC;QAClE,IAAI,CAAC,IAAI,GAAG,2BAA2B,CAAC;QACxC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IAAA,CACjB;CACD;AAWD,MAAM,UAAU,wBAAwB,CAAC,GAAW,EAAE,WAAmB,EAAU;IAClF,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;QACvC,MAAM,IAAI,yBAAyB,CAAC,IAAI,EAAE,yCAAyC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;IACnH,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,2BAA2B,CAAC,CAAC;AAAA,CAChF;AASD,MAAM,OAAO,kBAAkB;IACb,WAAW,CAAS;IAC7B,KAAK,GAAwB,IAAI,CAAC;IAE1C,YAAY,WAAmB,EAAE;QAChC,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;IAAA,CAC/B;IAED,MAAM,CAAC,IAAI,CAAC,GAAW,EAAE,WAAmB,EAAsB;QACjE,OAAO,IAAI,kBAAkB,CAAC,wBAAwB,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC;IAAA,CAC1E;IAED,IAAI,QAAQ,GAAW;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC;IAAA,CACxB;IAED,kFAAkF;IAClF,UAAU,CAAC,IAAuB,EAAQ;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QAClC,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YACzB,MAAM,IAAI,yBAAyB,CAAC,MAAM,EAAE,iCAAiC,CAAC,CAAC;QAChF,CAAC;QACD,MAAM,UAAU,GAAG,yBAAyB,CAAC,IAAI,CAAC,CAAC;QACnD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,yBAAyB,CAAC,MAAM,EAAE,iBAAiB,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvF,CAAC;QACD,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;QAC/C,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;IAAA,CAClB;IAED,6EAA4E;IAC5E,gBAAgB,CAAC,MAA2B,EAAQ;QACnD,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QAClC,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YACzB,MAAM,IAAI,yBAAyB,CAAC,MAAM,EAAE,4CAA4C,CAAC,CAAC;QAC3F,CAAC;QACD,IAAI,CAAC;YACJ,0EAA0E;YAC1E,kBAAkB,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC;QAC5D,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YAChB,IAAI,KAAK,YAAY,4BAA4B,EAAE,CAAC;gBACnD,MAAM,IAAI,yBAAyB,CAAC,YAAY,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;YAClE,CAAC;YACD,MAAM,KAAK,CAAC;QACb,CAAC;QACD,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE,CAAC,CAAC;QACvD,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAAA,CAC3B;IAED,6EAA6E;IAC7E,IAAI,GAIF;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QAClC,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,kBAAkB,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;QAC/F,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,EAAE,WAAW,EAAE,CAAC;IAAA,CACtE;IAED,qFAAoF;IACpF,UAAU,GAAkB;QAC3B,IAAI,CAAC;YACJ,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;gBACtC,OAAO,IAAI,CAAC;YACb,CAAC;YACD,MAAM,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,YAAY,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;YAC3D,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;YACxC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YAClB,OAAO,MAAM,CAAC;QACf,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YAChB,MAAM,IAAI,yBAAyB,CAAC,IAAI,EAAE,sBAAsB,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAClF,CAAC;IAAA,CACD;IAEO,YAAY,GAAiB;QACpC,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC,KAAK,CAAC;QACnB,CAAC;QACD,MAAM,KAAK,GAAiB,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,UAAU,EAAE,cAAc,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;QAChG,IAAI,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;YACrC,MAAM,GAAG,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;YACtD,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;YACnE,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;gBACnD,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;gBACvD,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;gBAC3C,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;oBAC5B,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;wBACzB,MAAM,IAAI,yBAAyB,CAAC,MAAM,EAAE,qBAAqB,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;oBAC/E,CAAC;oBACD,KAAK,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;gBAC1B,CAAC;qBAAM,CAAC;oBACP,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;wBACzB,MAAM,IAAI,yBAAyB,CAAC,MAAM,EAAE,wBAAwB,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;oBAClF,CAAC;oBACD,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBACnC,CAAC;gBACD,KAAK,CAAC,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC;gBACjC,KAAK,CAAC,OAAO,GAAG,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC;YAChC,CAAC;YACD,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;gBACzB,IAAI,CAAC;oBACJ,kBAAkB,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;gBAC/C,CAAC;gBAAC,OAAO,KAAK,EAAE,CAAC;oBAChB,MAAM,IAAI,yBAAyB,CAAC,YAAY,EAAE,kBAAkB,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBACtF,CAAC;YACF,CAAC;QACF,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,OAAO,KAAK,CAAC;IAAA,CACb;IAEO,SAAS,CAAC,IAAY,EAAE,UAAkB,EAAe;QAChE,IAAI,MAAe,CAAC;QACpB,IAAI,CAAC;YACJ,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC3B,CAAC;QAAC,MAAM,CAAC;YACR,MAAM,IAAI,yBAAyB,CAAC,OAAO,EAAE,gCAAgC,EAAE,UAAU,CAAC,CAAC;QAC5F,CAAC;QACD,MAAM,SAAS,GAAG,MAA8B,CAAC;QACjD,IACC,OAAO,SAAS,KAAK,QAAQ;YAC7B,SAAS,KAAK,IAAI;YAClB,OAAO,SAAS,CAAC,GAAG,KAAK,QAAQ;YACjC,OAAO,SAAS,CAAC,MAAM,KAAK,QAAQ;YACpC,CAAC,SAAS,CAAC,IAAI,KAAK,MAAM,IAAI,SAAS,CAAC,IAAI,KAAK,YAAY,CAAC,EAC7D,CAAC;YACF,MAAM,IAAI,yBAAyB,CAAC,OAAO,EAAE,mCAAmC,EAAE,UAAU,CAAC,CAAC;QAC/F,CAAC;QACD,OAAO,SAAwB,CAAC;IAAA,CAChC;IAEO,WAAW,CAAC,KAAmB,EAAE,IAAiB,EAAE,UAAkB,EAAQ;QACrF,IAAI,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC,OAAO,EAAE,CAAC;YAChC,MAAM,IAAI,yBAAyB,CAAC,OAAO,EAAE,YAAY,IAAI,CAAC,GAAG,gBAAgB,KAAK,CAAC,OAAO,EAAE,EAAE,UAAU,CAAC,CAAC;QAC/G,CAAC;QACD,MAAM,QAAQ,GAAG,WAAW,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QACrD,IAAI,IAAI,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;YAC9B,MAAM,IAAI,yBAAyB,CAAC,OAAO,EAAE,uBAAuB,EAAE,UAAU,CAAC,CAAC;QACnF,CAAC;IAAA,CACD;IAEO,UAAU,CACjB,KAAmB,EACnB,IAAqG,EAC9F;QACP,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC;QAC1B,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,CAAC,UAAU,EAAE,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC;QAC/D,MAAM,IAAI,GACT,IAAI,CAAC,IAAI,KAAK,MAAM;YACnB,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE;YAChD,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC;QAC7D,IAAI,CAAC;YACJ,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YAClE,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAC1E,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YAChB,MAAM,IAAI,yBAAyB,CAAC,IAAI,EAAE,kBAAkB,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC9E,CAAC;QACD,KAAK,CAAC,UAAU,GAAG,MAAM,CAAC;QAC1B,KAAK,CAAC,OAAO,GAAG,GAAG,GAAG,CAAC,CAAC;IAAA,CACxB;CACD;AAED,0FAA0F;AAC1F,SAAS,WAAW,CACnB,cAAsB,EACtB,IAGC,EACQ;IACT,MAAM,OAAO,GACZ,IAAI,CAAC,IAAI,KAAK,MAAM;QACnB,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC;QACrE,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IAC5E,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,GAAG,cAAc,KAAK,OAAO,EAAE,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAAA,CAC1F","sourcesContent":["import { createHash } from \"node:crypto\";\nimport * as fs from \"node:fs\";\nimport * as path from \"node:path\";\nimport {\n\treduceShardRecords,\n\tvalidateWorkloadShardPlan,\n\ttype WorkloadShardPlan,\n\ttype WorkloadShardProjection,\n\ttype WorkloadShardRecord,\n\tWorkloadShardTransitionError,\n} from \"./workload-shard-plan.ts\";\n\n/**\n * Durable workload shard journal (OMK v0.97.x roadmap §13.3/§13.5, M5/PR8).\n *\n * Append-only JSONL at `.omk/runs/<promptRunId>/workload-shards.jsonl` with\n * a per-line hash chain. Every append is validated against the in-memory\n * projection BEFORE it is written, and every load re-verifies parse, chain,\n * and §13.4 transition legality. Corruption fails closed (§21, §32 kill\n * criteria: never resume over a corrupt journal): the caller quarantines\n * the file and requires explicit repair; the journal itself is preserved\n * for §30.4 rollback.\n */\n\nexport const WORKLOAD_SHARD_JOURNAL_FILE = \"workload-shards.jsonl\";\nconst GENESIS_DIGEST = \"workload-shard-genesis\";\nconst RUN_ID_PATTERN = /^[A-Za-z0-9._-]+$/;\n\nexport type WorkloadShardJournalErrorCode = \"io\" | \"parse\" | \"chain\" | \"plan\" | \"transition\";\n\nexport class WorkloadShardJournalError extends Error {\n\treadonly code: WorkloadShardJournalErrorCode;\n\treadonly line?: number;\n\tconstructor(code: WorkloadShardJournalErrorCode, message: string, line?: number) {\n\t\tsuper(line === undefined ? message : `${message} (line ${line})`);\n\t\tthis.name = \"WorkloadShardJournalError\";\n\t\tthis.code = code;\n\t\tthis.line = line;\n\t}\n}\n\ntype JournalLine =\n\t| { readonly seq: number; readonly digest: string; readonly kind: \"plan\"; readonly plan: WorkloadShardPlan }\n\t| {\n\t\t\treadonly seq: number;\n\t\t\treadonly digest: string;\n\t\t\treadonly kind: \"transition\";\n\t\t\treadonly record: WorkloadShardRecord;\n\t  };\n\nexport function workloadShardJournalPath(cwd: string, promptRunId: string): string {\n\tif (!RUN_ID_PATTERN.test(promptRunId)) {\n\t\tthrow new WorkloadShardJournalError(\"io\", `invalid promptRunId for journal path: ${JSON.stringify(promptRunId)}`);\n\t}\n\treturn path.join(cwd, \".omk\", \"runs\", promptRunId, WORKLOAD_SHARD_JOURNAL_FILE);\n}\n\ninterface JournalState {\n\tplan: WorkloadShardPlan | null;\n\trecords: WorkloadShardRecord[];\n\tlastDigest: string;\n\tnextSeq: number;\n}\n\nexport class WorkloadShardStore {\n\tprivate readonly journalPath: string;\n\tprivate state: JournalState | null = null;\n\n\tconstructor(journalPath: string) {\n\t\tthis.journalPath = journalPath;\n\t}\n\n\tstatic open(cwd: string, promptRunId: string): WorkloadShardStore {\n\t\treturn new WorkloadShardStore(workloadShardJournalPath(cwd, promptRunId));\n\t}\n\n\tget filePath(): string {\n\t\treturn this.journalPath;\n\t}\n\n\t/** Record the plan as the first line. Fails closed if any plan already exists. */\n\tappendPlan(plan: WorkloadShardPlan): void {\n\t\tconst state = this.ensureLoaded();\n\t\tif (state.plan !== null) {\n\t\t\tthrow new WorkloadShardJournalError(\"plan\", \"journal already contains a plan\");\n\t\t}\n\t\tconst planErrors = validateWorkloadShardPlan(plan);\n\t\tif (planErrors.length > 0) {\n\t\t\tthrow new WorkloadShardJournalError(\"plan\", `invalid plan: ${planErrors.join(\"; \")}`);\n\t\t}\n\t\tthis.appendLine(state, { kind: \"plan\", plan });\n\t\tstate.plan = plan;\n\t}\n\n\t/** Validate one §13.4 transition against the projection, then append it. */\n\tappendTransition(record: WorkloadShardRecord): void {\n\t\tconst state = this.ensureLoaded();\n\t\tif (state.plan === null) {\n\t\t\tthrow new WorkloadShardJournalError(\"plan\", \"cannot append a transition before the plan\");\n\t\t}\n\t\ttry {\n\t\t\t// Replaying with the candidate appended proves legality before any write.\n\t\t\treduceShardRecords(state.plan, [...state.records, record]);\n\t\t} catch (error) {\n\t\t\tif (error instanceof WorkloadShardTransitionError) {\n\t\t\t\tthrow new WorkloadShardJournalError(\"transition\", error.message);\n\t\t\t}\n\t\t\tthrow error;\n\t\t}\n\t\tthis.appendLine(state, { kind: \"transition\", record });\n\t\tstate.records.push(record);\n\t}\n\n\t/** Load and fully verify the journal. A missing file is an empty journal. */\n\tload(): {\n\t\treadonly plan: WorkloadShardPlan | null;\n\t\treadonly records: readonly WorkloadShardRecord[];\n\t\treadonly projections: ReadonlyMap<string, WorkloadShardProjection> | null;\n\t} {\n\t\tconst state = this.ensureLoaded();\n\t\tconst projections = state.plan === null ? null : reduceShardRecords(state.plan, state.records);\n\t\treturn { plan: state.plan, records: [...state.records], projections };\n\t}\n\n\t/** §21 fail-closed path: move a corrupt journal aside; explicit repair required. */\n\tquarantine(): string | null {\n\t\ttry {\n\t\t\tif (!fs.existsSync(this.journalPath)) {\n\t\t\t\treturn null;\n\t\t\t}\n\t\t\tconst target = `${this.journalPath}.corrupt-${Date.now()}`;\n\t\t\tfs.renameSync(this.journalPath, target);\n\t\t\tthis.state = null;\n\t\t\treturn target;\n\t\t} catch (error) {\n\t\t\tthrow new WorkloadShardJournalError(\"io\", `quarantine failed: ${String(error)}`);\n\t\t}\n\t}\n\n\tprivate ensureLoaded(): JournalState {\n\t\tif (this.state !== null) {\n\t\t\treturn this.state;\n\t\t}\n\t\tconst state: JournalState = { plan: null, records: [], lastDigest: GENESIS_DIGEST, nextSeq: 0 };\n\t\tif (fs.existsSync(this.journalPath)) {\n\t\t\tconst raw = fs.readFileSync(this.journalPath, \"utf8\");\n\t\t\tconst lines = raw.split(\"\\n\").filter((line) => line.trim() !== \"\");\n\t\t\tfor (let index = 0; index < lines.length; index++) {\n\t\t\t\tconst parsed = this.parseLine(lines[index], index + 1);\n\t\t\t\tthis.verifyChain(state, parsed, index + 1);\n\t\t\t\tif (parsed.kind === \"plan\") {\n\t\t\t\t\tif (state.plan !== null) {\n\t\t\t\t\t\tthrow new WorkloadShardJournalError(\"plan\", \"duplicate plan line\", index + 1);\n\t\t\t\t\t}\n\t\t\t\t\tstate.plan = parsed.plan;\n\t\t\t\t} else {\n\t\t\t\t\tif (state.plan === null) {\n\t\t\t\t\t\tthrow new WorkloadShardJournalError(\"plan\", \"transition before plan\", index + 1);\n\t\t\t\t\t}\n\t\t\t\t\tstate.records.push(parsed.record);\n\t\t\t\t}\n\t\t\t\tstate.lastDigest = parsed.digest;\n\t\t\t\tstate.nextSeq = parsed.seq + 1;\n\t\t\t}\n\t\t\tif (state.plan !== null) {\n\t\t\t\ttry {\n\t\t\t\t\treduceShardRecords(state.plan, state.records);\n\t\t\t\t} catch (error) {\n\t\t\t\t\tthrow new WorkloadShardJournalError(\"transition\", `replay failed: ${String(error)}`);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tthis.state = state;\n\t\treturn state;\n\t}\n\n\tprivate parseLine(line: string, lineNumber: number): JournalLine {\n\t\tlet parsed: unknown;\n\t\ttry {\n\t\t\tparsed = JSON.parse(line);\n\t\t} catch {\n\t\t\tthrow new WorkloadShardJournalError(\"parse\", \"journal line is not valid JSON\", lineNumber);\n\t\t}\n\t\tconst candidate = parsed as Partial<JournalLine>;\n\t\tif (\n\t\t\ttypeof candidate !== \"object\" ||\n\t\t\tcandidate === null ||\n\t\t\ttypeof candidate.seq !== \"number\" ||\n\t\t\ttypeof candidate.digest !== \"string\" ||\n\t\t\t(candidate.kind !== \"plan\" && candidate.kind !== \"transition\")\n\t\t) {\n\t\t\tthrow new WorkloadShardJournalError(\"parse\", \"journal line has an unknown shape\", lineNumber);\n\t\t}\n\t\treturn candidate as JournalLine;\n\t}\n\n\tprivate verifyChain(state: JournalState, line: JournalLine, lineNumber: number): void {\n\t\tif (line.seq !== state.nextSeq) {\n\t\t\tthrow new WorkloadShardJournalError(\"chain\", `sequence ${line.seq} != expected ${state.nextSeq}`, lineNumber);\n\t\t}\n\t\tconst expected = chainDigest(state.lastDigest, line);\n\t\tif (line.digest !== expected) {\n\t\t\tthrow new WorkloadShardJournalError(\"chain\", \"digest chain mismatch\", lineNumber);\n\t\t}\n\t}\n\n\tprivate appendLine(\n\t\tstate: JournalState,\n\t\tbody: { kind: \"plan\"; plan: WorkloadShardPlan } | { kind: \"transition\"; record: WorkloadShardRecord },\n\t): void {\n\t\tconst seq = state.nextSeq;\n\t\tconst digest = chainDigest(state.lastDigest, { seq, ...body });\n\t\tconst line: JournalLine =\n\t\t\tbody.kind === \"plan\"\n\t\t\t\t? { seq, digest, kind: \"plan\", plan: body.plan }\n\t\t\t\t: { seq, digest, kind: \"transition\", record: body.record };\n\t\ttry {\n\t\t\tfs.mkdirSync(path.dirname(this.journalPath), { recursive: true });\n\t\t\tfs.appendFileSync(this.journalPath, `${JSON.stringify(line)}\\n`, \"utf8\");\n\t\t} catch (error) {\n\t\t\tthrow new WorkloadShardJournalError(\"io\", `append failed: ${String(error)}`);\n\t\t}\n\t\tstate.lastDigest = digest;\n\t\tstate.nextSeq = seq + 1;\n\t}\n}\n\n/** Digest over the previous digest plus the canonical payload (digest field excluded). */\nfunction chainDigest(\n\tpreviousDigest: string,\n\tline: { readonly seq: number } & (\n\t\t| { readonly kind: \"plan\"; readonly plan: WorkloadShardPlan }\n\t\t| { readonly kind: \"transition\"; readonly record: WorkloadShardRecord }\n\t),\n): string {\n\tconst payload =\n\t\tline.kind === \"plan\"\n\t\t\t? JSON.stringify({ seq: line.seq, kind: line.kind, plan: line.plan })\n\t\t\t: JSON.stringify({ seq: line.seq, kind: line.kind, record: line.record });\n\treturn createHash(\"sha256\").update(`${previousDigest}\\n${payload}`, \"utf8\").digest(\"hex\");\n}\n"]}

package/dist/core/workload-sharders.d.ts

@@ -0,0 +1,47 @@
+import type { WorkloadClassification } from "./workload-classifier.ts";
+import { type WorkloadShardPlan } from "./workload-shard-plan.ts";
+/**
+ * Initial sharder adapter registry (OMK v0.97.x roadmap §12.2, M5/PR9).
+ *
+ * Automatic sharding happens only when semantic equivalence is guaranteed
+ * (§12.1): a known sharder, simple argv, shard-local side effects, an
+ * order-independent result, defined aggregation, per-shard evidence, and
+ * resume-skip support. Everything else — §12.3's forbidden list, complex
+ * shell, unknown scripts — returns `unsupported` and the command is NEVER
+ * rewritten (§32 kill criteria).
+ *
+ * Adapters are pure: runtime facts they cannot know statically (upstream
+ * `--shard` capability from package metadata, the workspace list, the
+ * `go list ./...` package list) are injected by the M5 executor. A missing
+ * fact degrades to `unsupported`, never to a guess (§4.3).
+ */
+export interface WorkloadSharderFacts {
+    /** §12.2 Vitest/Jest condition: upstream version supports `--shard` (package metadata). */
+    readonly vitestShardSupport?: boolean;
+    readonly jestShardSupport?: boolean;
+    /** Workspace names from package.json for `npm run test --workspace=<name>` fan-out. */
+    readonly workspaces?: readonly string[];
+    /** Deterministic `go list ./...` output; sorted lexically before chunking (§12.2). */
+    readonly goPackages?: readonly string[];
+}
+export interface ShardPlanRequest {
+    readonly promptRunId: string;
+    readonly command: string;
+    readonly classification: WorkloadClassification;
+    /** Desired shard fan-out (admission-derived); adapters clamp to what stays equivalent. */
+    readonly desiredShards: number;
+    readonly facts?: WorkloadSharderFacts;
+    /** Injectable identity/clock for deterministic tests. */
+    readonly planId?: string;
+    readonly createdAt?: string;
+}
+export type ShardPlanOutcome = {
+    readonly kind: "planned";
+    readonly plan: WorkloadShardPlan;
+} | {
+    readonly kind: "unsupported";
+    readonly reasonCodes: readonly string[];
+};
+/** Build a shard plan for one already-classified command, or refuse (§12.3: no rewrite). */
+export declare function planWorkloadShards(request: ShardPlanRequest): ShardPlanOutcome;
+//# sourceMappingURL=workload-sharders.d.ts.map

package/dist/core/workload-sharders.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"workload-sharders.d.ts","sourceRoot":"","sources":["../../src/core/workload-sharders.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AACvE,OAAO,EAIN,KAAK,iBAAiB,EAEtB,MAAM,0BAA0B,CAAC;AAElC;;;;;;;;;;;;;;GAcG;AAEH,MAAM,WAAW,oBAAoB;IACpC,4FAA2F;IAC3F,QAAQ,CAAC,kBAAkB,CAAC,EAAE,OAAO,CAAC;IACtC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,OAAO,CAAC;IACpC,uFAAuF;IACvF,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC,uFAAsF;IACtF,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CACxC;AAED,MAAM,WAAW,gBAAgB;IAChC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,cAAc,EAAE,sBAAsB,CAAC;IAChD,0FAA0F;IAC1F,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,KAAK,CAAC,EAAE,oBAAoB,CAAC;IACtC,yDAAyD;IACzD,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED,MAAM,MAAM,gBAAgB,GACzB;IAAE,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,iBAAiB,CAAA;CAAE,GAC9D;IAAE,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAAC,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAA;CAAE,CAAC;AAK7E,6FAA4F;AAC5F,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,gBAAgB,GAAG,gBAAgB,CAmB9E","sourcesContent":["import { createHash, randomUUID } from \"node:crypto\";\nimport { analyzeShellCommandV2 } from \"./command-safety-parser.ts\";\nimport type { WorkloadClassification } from \"./workload-classifier.ts\";\nimport {\n\tbuildShardCommandDescriptor,\n\tvalidateWorkloadShardPlan,\n\tWORKLOAD_SHARD_PLAN_VERSION,\n\ttype WorkloadShardPlan,\n\ttype WorkloadShardSpec,\n} from \"./workload-shard-plan.ts\";\n\n/**\n * Initial sharder adapter registry (OMK v0.97.x roadmap §12.2, M5/PR9).\n *\n * Automatic sharding happens only when semantic equivalence is guaranteed\n * (§12.1): a known sharder, simple argv, shard-local side effects, an\n * order-independent result, defined aggregation, per-shard evidence, and\n * resume-skip support. Everything else — §12.3's forbidden list, complex\n * shell, unknown scripts — returns `unsupported` and the command is NEVER\n * rewritten (§32 kill criteria).\n *\n * Adapters are pure: runtime facts they cannot know statically (upstream\n * `--shard` capability from package metadata, the workspace list, the\n * `go list ./...` package list) are injected by the M5 executor. A missing\n * fact degrades to `unsupported`, never to a guess (§4.3).\n */\n\nexport interface WorkloadSharderFacts {\n\t/** §12.2 Vitest/Jest condition: upstream version supports `--shard` (package metadata). */\n\treadonly vitestShardSupport?: boolean;\n\treadonly jestShardSupport?: boolean;\n\t/** Workspace names from package.json for `npm run test --workspace=<name>` fan-out. */\n\treadonly workspaces?: readonly string[];\n\t/** Deterministic `go list ./...` output; sorted lexically before chunking (§12.2). */\n\treadonly goPackages?: readonly string[];\n}\n\nexport interface ShardPlanRequest {\n\treadonly promptRunId: string;\n\treadonly command: string;\n\treadonly classification: WorkloadClassification;\n\t/** Desired shard fan-out (admission-derived); adapters clamp to what stays equivalent. */\n\treadonly desiredShards: number;\n\treadonly facts?: WorkloadSharderFacts;\n\t/** Injectable identity/clock for deterministic tests. */\n\treadonly planId?: string;\n\treadonly createdAt?: string;\n}\n\nexport type ShardPlanOutcome =\n\t| { readonly kind: \"planned\"; readonly plan: WorkloadShardPlan }\n\t| { readonly kind: \"unsupported\"; readonly reasonCodes: readonly string[] };\n\nconst MIN_SHARDS = 2;\nconst MAX_SHARDS = 16;\n\n/** Build a shard plan for one already-classified command, or refuse (§12.3: no rewrite). */\nexport function planWorkloadShards(request: ShardPlanRequest): ShardPlanOutcome {\n\tif (request.classification.complexity !== \"simple-argv\") {\n\t\treturn unsupported(\"shard.complex-shell\");\n\t}\n\tconst argv = extractArgv(request.command);\n\tif (argv.length === 0) {\n\t\treturn unsupported(\"shard.empty-command\");\n\t}\n\tconst desired = Math.floor(request.desiredShards);\n\tif (!Number.isFinite(desired) || desired < MIN_SHARDS) {\n\t\treturn unsupported(\"shard.fanout.insufficient\");\n\t}\n\tconst shardCount = Math.min(desired, MAX_SHARDS);\n\tfor (const adapter of SHARDER_ADAPTERS) {\n\t\tif (adapter.canHandle(argv, request.classification)) {\n\t\t\treturn adapter.plan({ request, argv, shardCount });\n\t\t}\n\t}\n\treturn unsupported(\"sharder.unknown\");\n}\n\ninterface AdapterInput {\n\treadonly request: ShardPlanRequest;\n\treadonly argv: readonly string[];\n\treadonly shardCount: number;\n}\n\ninterface SharderAdapter {\n\treadonly strategy: string;\n\tcanHandle(argv: readonly string[], classification: WorkloadClassification): boolean;\n\tplan(input: AdapterInput): ShardPlanOutcome;\n}\n\n/** §12.2 Vitest / Jest: append `--shard=i/n`, preserving every existing option. */\nfunction shardFlagAdapter(\n\tstrategy: \"vitest-shard\" | \"jest-shard\",\n\texecutable: \"vitest\" | \"jest\",\n\tsupportFact: (facts: WorkloadSharderFacts | undefined) => boolean | undefined,\n): SharderAdapter {\n\treturn {\n\t\tstrategy,\n\t\tcanHandle: (argv, classification) =>\n\t\t\tclassification.commandFamily === \"node-test\" && basename(argv[0] ?? \"\") === executable,\n\t\tplan: ({ request, argv, shardCount }) => {\n\t\t\t// §12.1 condition 2 + conflicting-flag guards live in the classifier.\n\t\t\tif (!request.classification.safeToAutoShard) {\n\t\t\t\treturn unsupported(\"shard.preconditions.failed\");\n\t\t\t}\n\t\t\tconst support = supportFact(request.facts);\n\t\t\tif (support === undefined) {\n\t\t\t\treturn unsupported(\"shard.capability.unverified\");\n\t\t\t}\n\t\t\tif (!support) {\n\t\t\t\treturn unsupported(\"shard.capability.unsupported\");\n\t\t\t}\n\t\t\tconst shards = Array.from({ length: shardCount }, (_, index) => {\n\t\t\t\tconst shardArgv = [...argv, `--shard=${index + 1}/${shardCount}`];\n\t\t\t\treturn shardSpec(`${executable}-${index + 1}-of-${shardCount}`, shardArgv, []);\n\t\t\t});\n\t\t\treturn planned(request, strategy, shardCount, shards);\n\t\t},\n\t};\n}\n\n/** §12.2 monorepo workspaces: only independent `test` scripts fan out; build keeps order. */\nconst workspaceAdapter: SharderAdapter = {\n\tstrategy: \"npm-workspace-test\",\n\tcanHandle: (argv, classification) =>\n\t\tclassification.commandFamily === \"node-test\" && basename(argv[0] ?? \"\") === \"npm\",\n\tplan: ({ request, argv, shardCount }) => {\n\t\tconst script = argv[1] === \"run\" ? argv[2] : argv[1];\n\t\tif (script !== \"test\" && script !== \"t\") {\n\t\t\t// §12.2: builds must preserve dependency order — never auto-fanned.\n\t\t\treturn unsupported(\"shard.workspace.non-test-script\");\n\t\t}\n\t\tif (argv.some((token) => token.startsWith(\"--workspace\"))) {\n\t\t\treturn unsupported(\"shard.workspace.already-scoped\");\n\t\t}\n\t\tconst workspaces = [...(request.facts?.workspaces ?? [])].sort(compareLexical);\n\t\tif (workspaces.length < MIN_SHARDS) {\n\t\t\treturn unsupported(\"shard.workspace.insufficient\");\n\t\t}\n\t\tconst chunkCount = Math.min(shardCount, workspaces.length);\n\t\tconst chunks: string[][] = Array.from({ length: chunkCount }, () => []);\n\t\tworkspaces.forEach((workspace, index) => {\n\t\t\tchunks[index % chunkCount].push(workspace);\n\t\t});\n\t\tconst shards = chunks.map((chunk, index) =>\n\t\t\tshardSpec(\n\t\t\t\t`workspace-chunk-${index + 1}-of-${chunkCount}`,\n\t\t\t\t[\"npm\", \"run\", \"test\", ...chunk.map((workspace) => `--workspace=${workspace}`)],\n\t\t\t\t[],\n\t\t\t),\n\t\t);\n\t\treturn planned(request, \"npm-workspace-test\", chunkCount, shards);\n\t},\n};\n\n/** §12.2 Go: chunk the deterministic package list; race/cache flags are preserved. */\nconst goTestAdapter: SharderAdapter = {\n\tstrategy: \"go-package-chunks\",\n\tcanHandle: (argv, classification) =>\n\t\tclassification.commandFamily === \"go-test\" && basename(argv[0] ?? \"\") === \"go\" && argv[1] === \"test\",\n\tplan: ({ request, argv, shardCount }) => {\n\t\tif (!request.classification.safeToAutoShard) {\n\t\t\treturn unsupported(\"shard.preconditions.failed\");\n\t\t}\n\t\tconst packages = [...(request.facts?.goPackages ?? [])].sort(compareLexical);\n\t\tif (packages.length < MIN_SHARDS) {\n\t\t\treturn unsupported(\"shard.go.package-list-unavailable\");\n\t\t}\n\t\tconst flags = argv.slice(2).filter((token) => token.startsWith(\"-\"));\n\t\tconst chunkCount = Math.min(shardCount, packages.length);\n\t\tconst chunks: string[][] = Array.from({ length: chunkCount }, () => []);\n\t\tpackages.forEach((packageName, index) => {\n\t\t\tchunks[index % chunkCount].push(packageName);\n\t\t});\n\t\tconst shards = chunks.map((chunk, index) =>\n\t\t\tshardSpec(`go-chunk-${index + 1}-of-${chunkCount}`, [\"go\", \"test\", ...flags, ...chunk], []),\n\t\t);\n\t\treturn planned(request, \"go-package-chunks\", chunkCount, shards);\n\t},\n};\n\nconst SHARDER_ADAPTERS: readonly SharderAdapter[] = [\n\tshardFlagAdapter(\"vitest-shard\", \"vitest\", (facts) => facts?.vitestShardSupport),\n\tshardFlagAdapter(\"jest-shard\", \"jest\", (facts) => facts?.jestShardSupport),\n\tworkspaceAdapter,\n\tgoTestAdapter,\n];\n\nfunction shardSpec(shardId: string, argv: readonly string[], dependencyIds: readonly string[]): WorkloadShardSpec {\n\treturn {\n\t\tshardId,\n\t\tdependencyIds,\n\t\tcommandDescriptor: buildShardCommandDescriptor(argv),\n\t\t// §12.1 condition 6: every shard yields its own exit evidence; the\n\t\t// aggregate receipt is evaluated by the M5 executor (§13.6).\n\t\texpectedEvidence: [\"exit-code\"],\n\t};\n}\n\nfunction planned(\n\trequest: ShardPlanRequest,\n\tstrategy: string,\n\tmaxConcurrency: number,\n\tshards: readonly WorkloadShardSpec[],\n): ShardPlanOutcome {\n\tconst plan: WorkloadShardPlan = {\n\t\tschemaVersion: WORKLOAD_SHARD_PLAN_VERSION,\n\t\tplanId: request.planId ?? `shard-plan-${randomUUID()}`,\n\t\tpromptRunId: request.promptRunId,\n\t\tcommandDigest: createHash(\"sha256\").update(request.command, \"utf8\").digest(\"hex\"),\n\t\tstrategy,\n\t\tcreatedAt: request.createdAt ?? new Date().toISOString(),\n\t\tmaxConcurrency,\n\t\tshards,\n\t};\n\tconst errors = validateWorkloadShardPlan(plan);\n\tif (errors.length > 0) {\n\t\t// Fail closed: a structurally invalid plan is never handed to the executor.\n\t\treturn unsupported(\"shard.plan.invalid\");\n\t}\n\treturn { kind: \"planned\", plan };\n}\n\nfunction unsupported(...reasonCodes: string[]): ShardPlanOutcome {\n\treturn { kind: \"unsupported\", reasonCodes };\n}\n\nfunction extractArgv(command: string): readonly string[] {\n\ttry {\n\t\tconst analysis = analyzeShellCommandV2(command);\n\t\tconst tokens = analysis.segments[0]?.tokens ?? [];\n\t\tlet start = 0;\n\t\twhile (start < tokens.length && /^[A-Za-z_][A-Za-z0-9_]*=/.test(tokens[start])) {\n\t\t\tstart += 1;\n\t\t}\n\t\treturn tokens.slice(start);\n\t} catch {\n\t\treturn [];\n\t}\n}\n\n/** §12.2: deterministic lexical (code-unit) order, independent of runtime locale. */\nfunction compareLexical(a: string, b: string): number {\n\tif (a < b) {\n\t\treturn -1;\n\t}\n\treturn a > b ? 1 : 0;\n}\n\nfunction basename(token: string): string {\n\tconst slash = token.lastIndexOf(\"/\");\n\treturn slash === -1 ? token : token.slice(slash + 1);\n}\n"]}

package/dist/core/workload-sharders.js

@@ -0,0 +1,162 @@
+import { createHash, randomUUID } from "node:crypto";
+import { analyzeShellCommandV2 } from "./command-safety-parser.js";
+import { buildShardCommandDescriptor, validateWorkloadShardPlan, WORKLOAD_SHARD_PLAN_VERSION, } from "./workload-shard-plan.js";
+const MIN_SHARDS = 2;
+const MAX_SHARDS = 16;
+/** Build a shard plan for one already-classified command, or refuse (§12.3: no rewrite). */
+export function planWorkloadShards(request) {
+    if (request.classification.complexity !== "simple-argv") {
+        return unsupported("shard.complex-shell");
+    }
+    const argv = extractArgv(request.command);
+    if (argv.length === 0) {
+        return unsupported("shard.empty-command");
+    }
+    const desired = Math.floor(request.desiredShards);
+    if (!Number.isFinite(desired) || desired < MIN_SHARDS) {
+        return unsupported("shard.fanout.insufficient");
+    }
+    const shardCount = Math.min(desired, MAX_SHARDS);
+    for (const adapter of SHARDER_ADAPTERS) {
+        if (adapter.canHandle(argv, request.classification)) {
+            return adapter.plan({ request, argv, shardCount });
+        }
+    }
+    return unsupported("sharder.unknown");
+}
+/** §12.2 Vitest / Jest: append `--shard=i/n`, preserving every existing option. */
+function shardFlagAdapter(strategy, executable, supportFact) {
+    return {
+        strategy,
+        canHandle: (argv, classification) => classification.commandFamily === "node-test" && basename(argv[0] ?? "") === executable,
+        plan: ({ request, argv, shardCount }) => {
+            // §12.1 condition 2 + conflicting-flag guards live in the classifier.
+            if (!request.classification.safeToAutoShard) {
+                return unsupported("shard.preconditions.failed");
+            }
+            const support = supportFact(request.facts);
+            if (support === undefined) {
+                return unsupported("shard.capability.unverified");
+            }
+            if (!support) {
+                return unsupported("shard.capability.unsupported");
+            }
+            const shards = Array.from({ length: shardCount }, (_, index) => {
+                const shardArgv = [...argv, `--shard=${index + 1}/${shardCount}`];
+                return shardSpec(`${executable}-${index + 1}-of-${shardCount}`, shardArgv, []);
+            });
+            return planned(request, strategy, shardCount, shards);
+        },
+    };
+}
+/** §12.2 monorepo workspaces: only independent `test` scripts fan out; build keeps order. */
+const workspaceAdapter = {
+    strategy: "npm-workspace-test",
+    canHandle: (argv, classification) => classification.commandFamily === "node-test" && basename(argv[0] ?? "") === "npm",
+    plan: ({ request, argv, shardCount }) => {
+        const script = argv[1] === "run" ? argv[2] : argv[1];
+        if (script !== "test" && script !== "t") {
+            // §12.2: builds must preserve dependency order — never auto-fanned.
+            return unsupported("shard.workspace.non-test-script");
+        }
+        if (argv.some((token) => token.startsWith("--workspace"))) {
+            return unsupported("shard.workspace.already-scoped");
+        }
+        const workspaces = [...(request.facts?.workspaces ?? [])].sort(compareLexical);
+        if (workspaces.length < MIN_SHARDS) {
+            return unsupported("shard.workspace.insufficient");
+        }
+        const chunkCount = Math.min(shardCount, workspaces.length);
+        const chunks = Array.from({ length: chunkCount }, () => []);
+        workspaces.forEach((workspace, index) => {
+            chunks[index % chunkCount].push(workspace);
+        });
+        const shards = chunks.map((chunk, index) => shardSpec(`workspace-chunk-${index + 1}-of-${chunkCount}`, ["npm", "run", "test", ...chunk.map((workspace) => `--workspace=${workspace}`)], []));
+        return planned(request, "npm-workspace-test", chunkCount, shards);
+    },
+};
+/** §12.2 Go: chunk the deterministic package list; race/cache flags are preserved. */
+const goTestAdapter = {
+    strategy: "go-package-chunks",
+    canHandle: (argv, classification) => classification.commandFamily === "go-test" && basename(argv[0] ?? "") === "go" && argv[1] === "test",
+    plan: ({ request, argv, shardCount }) => {
+        if (!request.classification.safeToAutoShard) {
+            return unsupported("shard.preconditions.failed");
+        }
+        const packages = [...(request.facts?.goPackages ?? [])].sort(compareLexical);
+        if (packages.length < MIN_SHARDS) {
+            return unsupported("shard.go.package-list-unavailable");
+        }
+        const flags = argv.slice(2).filter((token) => token.startsWith("-"));
+        const chunkCount = Math.min(shardCount, packages.length);
+        const chunks = Array.from({ length: chunkCount }, () => []);
+        packages.forEach((packageName, index) => {
+            chunks[index % chunkCount].push(packageName);
+        });
+        const shards = chunks.map((chunk, index) => shardSpec(`go-chunk-${index + 1}-of-${chunkCount}`, ["go", "test", ...flags, ...chunk], []));
+        return planned(request, "go-package-chunks", chunkCount, shards);
+    },
+};
+const SHARDER_ADAPTERS = [
+    shardFlagAdapter("vitest-shard", "vitest", (facts) => facts?.vitestShardSupport),
+    shardFlagAdapter("jest-shard", "jest", (facts) => facts?.jestShardSupport),
+    workspaceAdapter,
+    goTestAdapter,
+];
+function shardSpec(shardId, argv, dependencyIds) {
+    return {
+        shardId,
+        dependencyIds,
+        commandDescriptor: buildShardCommandDescriptor(argv),
+        // §12.1 condition 6: every shard yields its own exit evidence; the
+        // aggregate receipt is evaluated by the M5 executor (§13.6).
+        expectedEvidence: ["exit-code"],
+    };
+}
+function planned(request, strategy, maxConcurrency, shards) {
+    const plan = {
+        schemaVersion: WORKLOAD_SHARD_PLAN_VERSION,
+        planId: request.planId ?? `shard-plan-${randomUUID()}`,
+        promptRunId: request.promptRunId,
+        commandDigest: createHash("sha256").update(request.command, "utf8").digest("hex"),
+        strategy,
+        createdAt: request.createdAt ?? new Date().toISOString(),
+        maxConcurrency,
+        shards,
+    };
+    const errors = validateWorkloadShardPlan(plan);
+    if (errors.length > 0) {
+        // Fail closed: a structurally invalid plan is never handed to the executor.
+        return unsupported("shard.plan.invalid");
+    }
+    return { kind: "planned", plan };
+}
+function unsupported(...reasonCodes) {
+    return { kind: "unsupported", reasonCodes };
+}
+function extractArgv(command) {
+    try {
+        const analysis = analyzeShellCommandV2(command);
+        const tokens = analysis.segments[0]?.tokens ?? [];
+        let start = 0;
+        while (start < tokens.length && /^[A-Za-z_][A-Za-z0-9_]*=/.test(tokens[start])) {
+            start += 1;
+        }
+        return tokens.slice(start);
+    }
+    catch {
+        return [];
+    }
+}
+/** §12.2: deterministic lexical (code-unit) order, independent of runtime locale. */
+function compareLexical(a, b) {
+    if (a < b) {
+        return -1;
+    }
+    return a > b ? 1 : 0;
+}
+function basename(token) {
+    const slash = token.lastIndexOf("/");
+    return slash === -1 ? token : token.slice(slash + 1);
+}
+//# sourceMappingURL=workload-sharders.js.map

package/dist/core/workload-sharders.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"workload-sharders.js","sourceRoot":"","sources":["../../src/core/workload-sharders.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACrD,OAAO,EAAE,qBAAqB,EAAE,MAAM,4BAA4B,CAAC;AAEnE,OAAO,EACN,2BAA2B,EAC3B,yBAAyB,EACzB,2BAA2B,GAG3B,MAAM,0BAA0B,CAAC;AA4ClC,MAAM,UAAU,GAAG,CAAC,CAAC;AACrB,MAAM,UAAU,GAAG,EAAE,CAAC;AAEtB,6FAA4F;AAC5F,MAAM,UAAU,kBAAkB,CAAC,OAAyB,EAAoB;IAC/E,IAAI,OAAO,CAAC,cAAc,CAAC,UAAU,KAAK,aAAa,EAAE,CAAC;QACzD,OAAO,WAAW,CAAC,qBAAqB,CAAC,CAAC;IAC3C,CAAC;IACD,MAAM,IAAI,GAAG,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAC1C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,WAAW,CAAC,qBAAqB,CAAC,CAAC;IAC3C,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;IAClD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,OAAO,GAAG,UAAU,EAAE,CAAC;QACvD,OAAO,WAAW,CAAC,2BAA2B,CAAC,CAAC;IACjD,CAAC;IACD,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;IACjD,KAAK,MAAM,OAAO,IAAI,gBAAgB,EAAE,CAAC;QACxC,IAAI,OAAO,CAAC,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC,cAAc,CAAC,EAAE,CAAC;YACrD,OAAO,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;QACpD,CAAC;IACF,CAAC;IACD,OAAO,WAAW,CAAC,iBAAiB,CAAC,CAAC;AAAA,CACtC;AAcD,oFAAmF;AACnF,SAAS,gBAAgB,CACxB,QAAuC,EACvC,UAA6B,EAC7B,WAA6E,EAC5D;IACjB,OAAO;QACN,QAAQ;QACR,SAAS,EAAE,CAAC,IAAI,EAAE,cAAc,EAAE,EAAE,CACnC,cAAc,CAAC,aAAa,KAAK,WAAW,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,UAAU;QACvF,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;YACxC,uEAAsE;YACtE,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,eAAe,EAAE,CAAC;gBAC7C,OAAO,WAAW,CAAC,4BAA4B,CAAC,CAAC;YAClD,CAAC;YACD,MAAM,OAAO,GAAG,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC3C,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC3B,OAAO,WAAW,CAAC,6BAA6B,CAAC,CAAC;YACnD,CAAC;YACD,IAAI,CAAC,OAAO,EAAE,CAAC;gBACd,OAAO,WAAW,CAAC,8BAA8B,CAAC,CAAC;YACpD,CAAC;YACD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;gBAC/D,MAAM,SAAS,GAAG,CAAC,GAAG,IAAI,EAAE,WAAW,KAAK,GAAG,CAAC,IAAI,UAAU,EAAE,CAAC,CAAC;gBAClE,OAAO,SAAS,CAAC,GAAG,UAAU,IAAI,KAAK,GAAG,CAAC,OAAO,UAAU,EAAE,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC;YAAA,CAC/E,CAAC,CAAC;YACH,OAAO,OAAO,CAAC,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;QAAA,CACtD;KACD,CAAC;AAAA,CACF;AAED,8FAA6F;AAC7F,MAAM,gBAAgB,GAAmB;IACxC,QAAQ,EAAE,oBAAoB;IAC9B,SAAS,EAAE,CAAC,IAAI,EAAE,cAAc,EAAE,EAAE,CACnC,cAAc,CAAC,aAAa,KAAK,WAAW,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,KAAK;IAClF,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;QACxC,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrD,IAAI,MAAM,KAAK,MAAM,IAAI,MAAM,KAAK,GAAG,EAAE,CAAC;YACzC,uEAAoE;YACpE,OAAO,WAAW,CAAC,iCAAiC,CAAC,CAAC;QACvD,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC;YAC3D,OAAO,WAAW,CAAC,gCAAgC,CAAC,CAAC;QACtD,CAAC;QACD,MAAM,UAAU,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,UAAU,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAC/E,IAAI,UAAU,CAAC,MAAM,GAAG,UAAU,EAAE,CAAC;YACpC,OAAO,WAAW,CAAC,8BAA8B,CAAC,CAAC;QACpD,CAAC;QACD,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;QAC3D,MAAM,MAAM,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;QACxE,UAAU,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,KAAK,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAAA,CAC3C,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAC1C,SAAS,CACR,mBAAmB,KAAK,GAAG,CAAC,OAAO,UAAU,EAAE,EAC/C,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,eAAe,SAAS,EAAE,CAAC,CAAC,EAC/E,EAAE,CACF,CACD,CAAC;QACF,OAAO,OAAO,CAAC,OAAO,EAAE,oBAAoB,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;IAAA,CAClE;CACD,CAAC;AAEF,uFAAsF;AACtF,MAAM,aAAa,GAAmB;IACrC,QAAQ,EAAE,mBAAmB;IAC7B,SAAS,EAAE,CAAC,IAAI,EAAE,cAAc,EAAE,EAAE,CACnC,cAAc,CAAC,aAAa,KAAK,SAAS,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM;IACrG,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;QACxC,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,eAAe,EAAE,CAAC;YAC7C,OAAO,WAAW,CAAC,4BAA4B,CAAC,CAAC;QAClD,CAAC;QACD,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,UAAU,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAC7E,IAAI,QAAQ,CAAC,MAAM,GAAG,UAAU,EAAE,CAAC;YAClC,OAAO,WAAW,CAAC,mCAAmC,CAAC,CAAC;QACzD,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;QACrE,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;QACzD,MAAM,MAAM,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;QACxE,QAAQ,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,KAAK,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,KAAK,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAAA,CAC7C,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAC1C,SAAS,CAAC,YAAY,KAAK,GAAG,CAAC,OAAO,UAAU,EAAE,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,KAAK,EAAE,GAAG,KAAK,CAAC,EAAE,EAAE,CAAC,CAC3F,CAAC;QACF,OAAO,OAAO,CAAC,OAAO,EAAE,mBAAmB,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC;IAAA,CACjE;CACD,CAAC;AAEF,MAAM,gBAAgB,GAA8B;IACnD,gBAAgB,CAAC,cAAc,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,EAAE,kBAAkB,CAAC;IAChF,gBAAgB,CAAC,YAAY,EAAE,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,EAAE,gBAAgB,CAAC;IAC1E,gBAAgB;IAChB,aAAa;CACb,CAAC;AAEF,SAAS,SAAS,CAAC,OAAe,EAAE,IAAuB,EAAE,aAAgC,EAAqB;IACjH,OAAO;QACN,OAAO;QACP,aAAa;QACb,iBAAiB,EAAE,2BAA2B,CAAC,IAAI,CAAC;QACpD,oEAAmE;QACnE,8DAA6D;QAC7D,gBAAgB,EAAE,CAAC,WAAW,CAAC;KAC/B,CAAC;AAAA,CACF;AAED,SAAS,OAAO,CACf,OAAyB,EACzB,QAAgB,EAChB,cAAsB,EACtB,MAAoC,EACjB;IACnB,MAAM,IAAI,GAAsB;QAC/B,aAAa,EAAE,2BAA2B;QAC1C,MAAM,EAAE,OAAO,CAAC,MAAM,IAAI,cAAc,UAAU,EAAE,EAAE;QACtD,WAAW,EAAE,OAAO,CAAC,WAAW;QAChC,aAAa,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;QACjF,QAAQ;QACR,SAAS,EAAE,OAAO,CAAC,SAAS,IAAI,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACxD,cAAc;QACd,MAAM;KACN,CAAC;IACF,MAAM,MAAM,GAAG,yBAAyB,CAAC,IAAI,CAAC,CAAC;IAC/C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,4EAA4E;QAC5E,OAAO,WAAW,CAAC,oBAAoB,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;AAAA,CACjC;AAED,SAAS,WAAW,CAAC,GAAG,WAAqB,EAAoB;IAChE,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,WAAW,EAAE,CAAC;AAAA,CAC5C;AAED,SAAS,WAAW,CAAC,OAAe,EAAqB;IACxD,IAAI,CAAC;QACJ,MAAM,QAAQ,GAAG,qBAAqB,CAAC,OAAO,CAAC,CAAC;QAChD,MAAM,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,EAAE,CAAC;QAClD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OAAO,KAAK,GAAG,MAAM,CAAC,MAAM,IAAI,0BAA0B,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YAChF,KAAK,IAAI,CAAC,CAAC;QACZ,CAAC;QACD,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAAC,MAAM,CAAC;QACR,OAAO,EAAE,CAAC;IACX,CAAC;AAAA,CACD;AAED,sFAAqF;AACrF,SAAS,cAAc,CAAC,CAAS,EAAE,CAAS,EAAU;IACrD,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACX,OAAO,CAAC,CAAC,CAAC;IACX,CAAC;IACD,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAAA,CACrB;AAED,SAAS,QAAQ,CAAC,KAAa,EAAU;IACxC,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACrC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;AAAA,CACrD","sourcesContent":["import { createHash, randomUUID } from \"node:crypto\";\nimport { analyzeShellCommandV2 } from \"./command-safety-parser.ts\";\nimport type { WorkloadClassification } from \"./workload-classifier.ts\";\nimport {\n\tbuildShardCommandDescriptor,\n\tvalidateWorkloadShardPlan,\n\tWORKLOAD_SHARD_PLAN_VERSION,\n\ttype WorkloadShardPlan,\n\ttype WorkloadShardSpec,\n} from \"./workload-shard-plan.ts\";\n\n/**\n * Initial sharder adapter registry (OMK v0.97.x roadmap §12.2, M5/PR9).\n *\n * Automatic sharding happens only when semantic equivalence is guaranteed\n * (§12.1): a known sharder, simple argv, shard-local side effects, an\n * order-independent result, defined aggregation, per-shard evidence, and\n * resume-skip support. Everything else — §12.3's forbidden list, complex\n * shell, unknown scripts — returns `unsupported` and the command is NEVER\n * rewritten (§32 kill criteria).\n *\n * Adapters are pure: runtime facts they cannot know statically (upstream\n * `--shard` capability from package metadata, the workspace list, the\n * `go list ./...` package list) are injected by the M5 executor. A missing\n * fact degrades to `unsupported`, never to a guess (§4.3).\n */\n\nexport interface WorkloadSharderFacts {\n\t/** §12.2 Vitest/Jest condition: upstream version supports `--shard` (package metadata). */\n\treadonly vitestShardSupport?: boolean;\n\treadonly jestShardSupport?: boolean;\n\t/** Workspace names from package.json for `npm run test --workspace=<name>` fan-out. */\n\treadonly workspaces?: readonly string[];\n\t/** Deterministic `go list ./...` output; sorted lexically before chunking (§12.2). */\n\treadonly goPackages?: readonly string[];\n}\n\nexport interface ShardPlanRequest {\n\treadonly promptRunId: string;\n\treadonly command: string;\n\treadonly classification: WorkloadClassification;\n\t/** Desired shard fan-out (admission-derived); adapters clamp to what stays equivalent. */\n\treadonly desiredShards: number;\n\treadonly facts?: WorkloadSharderFacts;\n\t/** Injectable identity/clock for deterministic tests. */\n\treadonly planId?: string;\n\treadonly createdAt?: string;\n}\n\nexport type ShardPlanOutcome =\n\t| { readonly kind: \"planned\"; readonly plan: WorkloadShardPlan }\n\t| { readonly kind: \"unsupported\"; readonly reasonCodes: readonly string[] };\n\nconst MIN_SHARDS = 2;\nconst MAX_SHARDS = 16;\n\n/** Build a shard plan for one already-classified command, or refuse (§12.3: no rewrite). */\nexport function planWorkloadShards(request: ShardPlanRequest): ShardPlanOutcome {\n\tif (request.classification.complexity !== \"simple-argv\") {\n\t\treturn unsupported(\"shard.complex-shell\");\n\t}\n\tconst argv = extractArgv(request.command);\n\tif (argv.length === 0) {\n\t\treturn unsupported(\"shard.empty-command\");\n\t}\n\tconst desired = Math.floor(request.desiredShards);\n\tif (!Number.isFinite(desired) || desired < MIN_SHARDS) {\n\t\treturn unsupported(\"shard.fanout.insufficient\");\n\t}\n\tconst shardCount = Math.min(desired, MAX_SHARDS);\n\tfor (const adapter of SHARDER_ADAPTERS) {\n\t\tif (adapter.canHandle(argv, request.classification)) {\n\t\t\treturn adapter.plan({ request, argv, shardCount });\n\t\t}\n\t}\n\treturn unsupported(\"sharder.unknown\");\n}\n\ninterface AdapterInput {\n\treadonly request: ShardPlanRequest;\n\treadonly argv: readonly string[];\n\treadonly shardCount: number;\n}\n\ninterface SharderAdapter {\n\treadonly strategy: string;\n\tcanHandle(argv: readonly string[], classification: WorkloadClassification): boolean;\n\tplan(input: AdapterInput): ShardPlanOutcome;\n}\n\n/** §12.2 Vitest / Jest: append `--shard=i/n`, preserving every existing option. */\nfunction shardFlagAdapter(\n\tstrategy: \"vitest-shard\" | \"jest-shard\",\n\texecutable: \"vitest\" | \"jest\",\n\tsupportFact: (facts: WorkloadSharderFacts | undefined) => boolean | undefined,\n): SharderAdapter {\n\treturn {\n\t\tstrategy,\n\t\tcanHandle: (argv, classification) =>\n\t\t\tclassification.commandFamily === \"node-test\" && basename(argv[0] ?? \"\") === executable,\n\t\tplan: ({ request, argv, shardCount }) => {\n\t\t\t// §12.1 condition 2 + conflicting-flag guards live in the classifier.\n\t\t\tif (!request.classification.safeToAutoShard) {\n\t\t\t\treturn unsupported(\"shard.preconditions.failed\");\n\t\t\t}\n\t\t\tconst support = supportFact(request.facts);\n\t\t\tif (support === undefined) {\n\t\t\t\treturn unsupported(\"shard.capability.unverified\");\n\t\t\t}\n\t\t\tif (!support) {\n\t\t\t\treturn unsupported(\"shard.capability.unsupported\");\n\t\t\t}\n\t\t\tconst shards = Array.from({ length: shardCount }, (_, index) => {\n\t\t\t\tconst shardArgv = [...argv, `--shard=${index + 1}/${shardCount}`];\n\t\t\t\treturn shardSpec(`${executable}-${index + 1}-of-${shardCount}`, shardArgv, []);\n\t\t\t});\n\t\t\treturn planned(request, strategy, shardCount, shards);\n\t\t},\n\t};\n}\n\n/** §12.2 monorepo workspaces: only independent `test` scripts fan out; build keeps order. */\nconst workspaceAdapter: SharderAdapter = {\n\tstrategy: \"npm-workspace-test\",\n\tcanHandle: (argv, classification) =>\n\t\tclassification.commandFamily === \"node-test\" && basename(argv[0] ?? \"\") === \"npm\",\n\tplan: ({ request, argv, shardCount }) => {\n\t\tconst script = argv[1] === \"run\" ? argv[2] : argv[1];\n\t\tif (script !== \"test\" && script !== \"t\") {\n\t\t\t// §12.2: builds must preserve dependency order — never auto-fanned.\n\t\t\treturn unsupported(\"shard.workspace.non-test-script\");\n\t\t}\n\t\tif (argv.some((token) => token.startsWith(\"--workspace\"))) {\n\t\t\treturn unsupported(\"shard.workspace.already-scoped\");\n\t\t}\n\t\tconst workspaces = [...(request.facts?.workspaces ?? [])].sort(compareLexical);\n\t\tif (workspaces.length < MIN_SHARDS) {\n\t\t\treturn unsupported(\"shard.workspace.insufficient\");\n\t\t}\n\t\tconst chunkCount = Math.min(shardCount, workspaces.length);\n\t\tconst chunks: string[][] = Array.from({ length: chunkCount }, () => []);\n\t\tworkspaces.forEach((workspace, index) => {\n\t\t\tchunks[index % chunkCount].push(workspace);\n\t\t});\n\t\tconst shards = chunks.map((chunk, index) =>\n\t\t\tshardSpec(\n\t\t\t\t`workspace-chunk-${index + 1}-of-${chunkCount}`,\n\t\t\t\t[\"npm\", \"run\", \"test\", ...chunk.map((workspace) => `--workspace=${workspace}`)],\n\t\t\t\t[],\n\t\t\t),\n\t\t);\n\t\treturn planned(request, \"npm-workspace-test\", chunkCount, shards);\n\t},\n};\n\n/** §12.2 Go: chunk the deterministic package list; race/cache flags are preserved. */\nconst goTestAdapter: SharderAdapter = {\n\tstrategy: \"go-package-chunks\",\n\tcanHandle: (argv, classification) =>\n\t\tclassification.commandFamily === \"go-test\" && basename(argv[0] ?? \"\") === \"go\" && argv[1] === \"test\",\n\tplan: ({ request, argv, shardCount }) => {\n\t\tif (!request.classification.safeToAutoShard) {\n\t\t\treturn unsupported(\"shard.preconditions.failed\");\n\t\t}\n\t\tconst packages = [...(request.facts?.goPackages ?? [])].sort(compareLexical);\n\t\tif (packages.length < MIN_SHARDS) {\n\t\t\treturn unsupported(\"shard.go.package-list-unavailable\");\n\t\t}\n\t\tconst flags = argv.slice(2).filter((token) => token.startsWith(\"-\"));\n\t\tconst chunkCount = Math.min(shardCount, packages.length);\n\t\tconst chunks: string[][] = Array.from({ length: chunkCount }, () => []);\n\t\tpackages.forEach((packageName, index) => {\n\t\t\tchunks[index % chunkCount].push(packageName);\n\t\t});\n\t\tconst shards = chunks.map((chunk, index) =>\n\t\t\tshardSpec(`go-chunk-${index + 1}-of-${chunkCount}`, [\"go\", \"test\", ...flags, ...chunk], []),\n\t\t);\n\t\treturn planned(request, \"go-package-chunks\", chunkCount, shards);\n\t},\n};\n\nconst SHARDER_ADAPTERS: readonly SharderAdapter[] = [\n\tshardFlagAdapter(\"vitest-shard\", \"vitest\", (facts) => facts?.vitestShardSupport),\n\tshardFlagAdapter(\"jest-shard\", \"jest\", (facts) => facts?.jestShardSupport),\n\tworkspaceAdapter,\n\tgoTestAdapter,\n];\n\nfunction shardSpec(shardId: string, argv: readonly string[], dependencyIds: readonly string[]): WorkloadShardSpec {\n\treturn {\n\t\tshardId,\n\t\tdependencyIds,\n\t\tcommandDescriptor: buildShardCommandDescriptor(argv),\n\t\t// §12.1 condition 6: every shard yields its own exit evidence; the\n\t\t// aggregate receipt is evaluated by the M5 executor (§13.6).\n\t\texpectedEvidence: [\"exit-code\"],\n\t};\n}\n\nfunction planned(\n\trequest: ShardPlanRequest,\n\tstrategy: string,\n\tmaxConcurrency: number,\n\tshards: readonly WorkloadShardSpec[],\n): ShardPlanOutcome {\n\tconst plan: WorkloadShardPlan = {\n\t\tschemaVersion: WORKLOAD_SHARD_PLAN_VERSION,\n\t\tplanId: request.planId ?? `shard-plan-${randomUUID()}`,\n\t\tpromptRunId: request.promptRunId,\n\t\tcommandDigest: createHash(\"sha256\").update(request.command, \"utf8\").digest(\"hex\"),\n\t\tstrategy,\n\t\tcreatedAt: request.createdAt ?? new Date().toISOString(),\n\t\tmaxConcurrency,\n\t\tshards,\n\t};\n\tconst errors = validateWorkloadShardPlan(plan);\n\tif (errors.length > 0) {\n\t\t// Fail closed: a structurally invalid plan is never handed to the executor.\n\t\treturn unsupported(\"shard.plan.invalid\");\n\t}\n\treturn { kind: \"planned\", plan };\n}\n\nfunction unsupported(...reasonCodes: string[]): ShardPlanOutcome {\n\treturn { kind: \"unsupported\", reasonCodes };\n}\n\nfunction extractArgv(command: string): readonly string[] {\n\ttry {\n\t\tconst analysis = analyzeShellCommandV2(command);\n\t\tconst tokens = analysis.segments[0]?.tokens ?? [];\n\t\tlet start = 0;\n\t\twhile (start < tokens.length && /^[A-Za-z_][A-Za-z0-9_]*=/.test(tokens[start])) {\n\t\t\tstart += 1;\n\t\t}\n\t\treturn tokens.slice(start);\n\t} catch {\n\t\treturn [];\n\t}\n}\n\n/** §12.2: deterministic lexical (code-unit) order, independent of runtime locale. */\nfunction compareLexical(a: string, b: string): number {\n\tif (a < b) {\n\t\treturn -1;\n\t}\n\treturn a > b ? 1 : 0;\n}\n\nfunction basename(token: string): string {\n\tconst slash = token.lastIndexOf(\"/\");\n\treturn slash === -1 ? token : token.slice(slash + 1);\n}\n"]}

package/dist/core/workload-shell-scan.d.ts

@@ -0,0 +1,12 @@
+interface ComplexityScan {
+    readonly reasons: readonly string[];
+}
+/**
+ * Detect the §9.3 rewrite-forbidding tokens outside quoted literals:
+ * `| > >> < && || ; & $( \`` plus newlines. Inside single quotes everything
+ * is literal; inside double quotes command substitution (`$(`, backtick)
+ * stays active per POSIX, other operators are literal.
+ */
+export declare function scanShellComplexity(command: string): ComplexityScan;
+export {};
+//# sourceMappingURL=workload-shell-scan.d.ts.map

package/dist/core/workload-shell-scan.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"workload-shell-scan.d.ts","sourceRoot":"","sources":["../../src/core/workload-shell-scan.ts"],"names":[],"mappings":"AAAA,UAAU,cAAc;IACvB,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;CACpC;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,MAAM,GAAG,cAAc,CAsEnE","sourcesContent":["interface ComplexityScan {\n\treadonly reasons: readonly string[];\n}\n\n/**\n * Detect the §9.3 rewrite-forbidding tokens outside quoted literals:\n * `| > >> < && || ; & $( \\`` plus newlines. Inside single quotes everything\n * is literal; inside double quotes command substitution (`$(`, backtick)\n * stays active per POSIX, other operators are literal.\n */\nexport function scanShellComplexity(command: string): ComplexityScan {\n\tconst reasons = new Set<string>();\n\tlet inSingle = false;\n\tlet inDouble = false;\n\tfor (let index = 0; index < command.length; index++) {\n\t\tconst ch = command[index];\n\t\tif (inSingle) {\n\t\t\tif (ch === \"'\") {\n\t\t\t\tinSingle = false;\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\t\tif (ch === \"\\\\\") {\n\t\t\t// Escaped character is literal both bare and inside double quotes.\n\t\t\tindex += 1;\n\t\t\tcontinue;\n\t\t}\n\t\tif (inDouble) {\n\t\t\tif (ch === '\"') {\n\t\t\t\tinDouble = false;\n\t\t\t} else if (ch === \"`\" || (ch === \"$\" && command[index + 1] === \"(\")) {\n\t\t\t\treasons.add(\"shell.operator.substitution\");\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\t\tswitch (ch) {\n\t\t\tcase \"'\":\n\t\t\t\tinSingle = true;\n\t\t\t\tbreak;\n\t\t\tcase '\"':\n\t\t\t\tinDouble = true;\n\t\t\t\tbreak;\n\t\t\tcase \"`\":\n\t\t\t\treasons.add(\"shell.operator.substitution\");\n\t\t\t\tbreak;\n\t\t\tcase \"$\":\n\t\t\t\tif (command[index + 1] === \"(\") {\n\t\t\t\t\treasons.add(\"shell.operator.substitution\");\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase \"|\":\n\t\t\t\treasons.add(command[index + 1] === \"|\" ? \"shell.operator.list\" : \"shell.operator.pipe\");\n\t\t\t\tif (command[index + 1] === \"|\") {\n\t\t\t\t\tindex += 1;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase \"&\":\n\t\t\t\treasons.add(command[index + 1] === \"&\" ? \"shell.operator.list\" : \"shell.operator.background\");\n\t\t\t\tif (command[index + 1] === \"&\") {\n\t\t\t\t\tindex += 1;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase \";\":\n\t\t\t\treasons.add(\"shell.operator.list\");\n\t\t\t\tbreak;\n\t\t\tcase \">\":\n\t\t\tcase \"<\":\n\t\t\t\treasons.add(\"shell.operator.redirect\");\n\t\t\t\tbreak;\n\t\t\tcase \"\\n\":\n\t\t\t\treasons.add(\"shell.multiline\");\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t}\n\t}\n\tif (inSingle || inDouble) {\n\t\treasons.add(\"shell.unbalanced-quote\");\n\t}\n\treturn { reasons: [...reasons] };\n}\n"]}