@deepthonk/core 0.1.0

package/dist/lifecycle.d.ts

@@ -0,0 +1,63 @@
+export type RunLifecycleState = "pending" | "running" | "completed" | "failed" | "cancelled" | "budget_exceeded";
+export interface BudgetUsage {
+    calls: number;
+    inputTokens: number;
+    inputCacheHitTokens?: number;
+    inputCacheMissTokens?: number;
+    outputTokens: number;
+    totalTokens: number;
+    usd?: number;
+}
+export interface RunStatus {
+    job_id?: string;
+    run_id?: string;
+    run_dir: string;
+    state: RunLifecycleState;
+    phase: string;
+    generation?: number | "final";
+    usage: BudgetUsage;
+    started_at?: string;
+    updated_at: string;
+    completed_at?: string;
+    worker_pid?: number;
+    error?: {
+        code: string;
+        message: string;
+        retryable: boolean;
+        fix?: string;
+    };
+}
+export declare function claimRunLock(runDir: string, jobId?: string): Promise<boolean>;
+export declare function readRunStatus(runDir: string): Promise<RunStatus | undefined>;
+export declare function requestRunCancel(runDir: string): Promise<void>;
+export declare function isRunCancelRequested(runDir: string): Promise<boolean>;
+export declare function emptyUsage(): BudgetUsage;
+export interface UsageDelta {
+    calls: number;
+    inputTokens: number;
+    inputCacheHitTokens?: number;
+    inputCacheMissTokens?: number;
+    outputTokens: number;
+    totalTokens: number;
+    inputUsd?: number;
+    outputUsd?: number;
+    usd?: number;
+}
+export type CallRole = "generator" | "judge" | "mutator" | "finalizer";
+export interface UsageRecord {
+    ts: string;
+    phase: string;
+    role: CallRole;
+    provider?: string;
+    model?: string;
+    input_tokens: number;
+    input_cache_hit_tokens?: number;
+    input_cache_miss_tokens?: number;
+    output_tokens: number;
+    total_tokens: number;
+    input_usd?: number;
+    output_usd?: number;
+    total_usd?: number;
+    latency_ms?: number;
+    retry_count?: number;
+}

package/dist/lifecycle.js

@@ -0,0 +1,45 @@
+import { mkdir, readFile, writeFile } from "node:fs/promises";
+import { join } from "node:path";
+import { runArtifactFiles } from "./artifacts.js";
+import { ConfigError } from "./errors.js";
+export async function claimRunLock(runDir, jobId) {
+    await mkdir(runDir, { recursive: true });
+    try {
+        await writeFile(join(runDir, runArtifactFiles.lock), `${JSON.stringify({ job_id: jobId, worker_pid: process.pid, claimed_at: new Date().toISOString() }, null, 2)}\n`, { encoding: "utf8", flag: "wx" });
+        return true;
+    }
+    catch (error) {
+        if (error.code === "EEXIST")
+            return false;
+        throw new ConfigError(`Could not claim run directory lock: ${error.message}`, {
+            code: "run.lock_failed",
+            retryable: false,
+            fix: "Choose a writable run directory."
+        });
+    }
+}
+export async function readRunStatus(runDir) {
+    try {
+        return JSON.parse(await readFile(join(runDir, runArtifactFiles.status), "utf8"));
+    }
+    catch {
+        return undefined;
+    }
+}
+export async function requestRunCancel(runDir) {
+    await mkdir(runDir, { recursive: true });
+    await writeFile(join(runDir, runArtifactFiles.cancel), `${JSON.stringify({ requested_at: new Date().toISOString() }, null, 2)}\n`, "utf8");
+}
+export async function isRunCancelRequested(runDir) {
+    try {
+        await readFile(join(runDir, runArtifactFiles.cancel), "utf8");
+        return true;
+    }
+    catch {
+        return false;
+    }
+}
+export function emptyUsage() {
+    return { calls: 0, inputTokens: 0, outputTokens: 0, totalTokens: 0 };
+}
+//# sourceMappingURL=lifecycle.js.map

package/dist/lifecycle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lifecycle.js","sourceRoot":"","sources":["../src/lifecycle.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAC9D,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAClD,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAkC1C,MAAM,CAAC,KAAK,UAAU,YAAY,CAAC,MAAc,EAAE,KAAc;IAC/D,MAAM,KAAK,CAAC,MAAM,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACzC,IAAI,CAAC;QACH,MAAM,SAAS,CACb,IAAI,CAAC,MAAM,EAAE,gBAAgB,CAAC,IAAI,CAAC,EACnC,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,OAAO,CAAC,GAAG,EAAE,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAChH,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,CACjC,CAAC;QACF,OAAO,IAAI,CAAC;IACd,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAK,KAA+B,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,KAAK,CAAC;QACrE,MAAM,IAAI,WAAW,CAAC,uCAAwC,KAAe,CAAC,OAAO,EAAE,EAAE;YACvF,IAAI,EAAE,iBAAiB;YACvB,SAAS,EAAE,KAAK;YAChB,GAAG,EAAE,kCAAkC;SACxC,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,aAAa,CAAC,MAAc;IAChD,IAAI,CAAC;QACH,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,gBAAgB,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAc,CAAC;IAChG,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,SAAS,CAAC;IACnB,CAAC;AACH,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,gBAAgB,CAAC,MAAc;IACnD,MAAM,KAAK,CAAC,MAAM,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACzC,MAAM,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,gBAAgB,CAAC,MAAM,CAAC,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,YAAY,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;AAC7I,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,oBAAoB,CAAC,MAAc;IACvD,IAAI,CAAC;QACH,MAAM,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,gBAAgB,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC;QAC9D,OAAO,IAAI,CAAC;IACd,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED,MAAM,UAAU,UAAU;IACxB,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC;AACvE,CAAC"}

package/dist/pairScheduler.d.ts

@@ -0,0 +1,6 @@
+import type { Rng } from "./rng.js";
+export interface Pair {
+    a: string;
+    b: string;
+}
+export declare function makeKRegularPairs(candidateIds: string[], k: number, rng: Rng): Pair[];

package/dist/pairScheduler.js

@@ -0,0 +1,79 @@
+import { ConfigError } from "./errors.js";
+export function makeKRegularPairs(candidateIds, k, rng) {
+    const ids = [...candidateIds];
+    const n = ids.length;
+    if (n < 2)
+        throw new ConfigError("Pair scheduling requires at least two candidates.");
+    if (k >= n)
+        throw new ConfigError(`Invalid pair schedule: k (${k}) must be less than n (${n}).`);
+    if ((n * k) % 2 !== 0) {
+        throw new ConfigError(`Invalid pair schedule: n * k must be even, got ${n} * ${k}.`);
+    }
+    for (let attempt = 0; attempt < 300; attempt += 1) {
+        const stubs = rng.shuffle(ids.flatMap((id) => Array.from({ length: k }, () => id)));
+        const pairs = [];
+        const seen = new Set();
+        let ok = true;
+        for (let i = 0; i < stubs.length; i += 2) {
+            const a = stubs[i];
+            const b = stubs[i + 1];
+            const key = unorderedKey(a, b);
+            if (a === b || seen.has(key)) {
+                ok = false;
+                break;
+            }
+            seen.add(key);
+            pairs.push({ a, b });
+        }
+        if (ok && hasDegree(ids, pairs, k))
+            return pairs;
+    }
+    return greedyKRegular(ids, k, rng);
+}
+function greedyKRegular(ids, k, rng) {
+    const remaining = new Map(ids.map((id) => [id, k]));
+    const pairs = [];
+    const seen = new Set();
+    while ([...remaining.values()].some((degree) => degree > 0)) {
+        const available = [...remaining.entries()]
+            .filter(([, degree]) => degree > 0)
+            .sort((left, right) => right[1] - left[1] || left[0].localeCompare(right[0]));
+        const a = available[0]?.[0];
+        if (!a)
+            break;
+        const candidates = rng.shuffle(available.slice(1).map(([id]) => id)).sort((left, right) => {
+            return (remaining.get(right) ?? 0) - (remaining.get(left) ?? 0) || left.localeCompare(right);
+        });
+        const b = candidates.find((id) => id !== a && !seen.has(unorderedKey(a, id)));
+        if (!b) {
+            throw new ConfigError(`Could not construct ${k}-regular pair schedule for ${ids.length} candidates.`);
+        }
+        seen.add(unorderedKey(a, b));
+        remaining.set(a, (remaining.get(a) ?? 0) - 1);
+        remaining.set(b, (remaining.get(b) ?? 0) - 1);
+        pairs.push({ a, b });
+    }
+    if (!hasDegree(ids, pairs, k)) {
+        throw new ConfigError(`Could not construct ${k}-regular pair schedule for ${ids.length} candidates.`);
+    }
+    return pairs;
+}
+function unorderedKey(a, b) {
+    return a < b ? `${a}::${b}` : `${b}::${a}`;
+}
+function hasDegree(ids, pairs, k) {
+    const degrees = new Map(ids.map((id) => [id, 0]));
+    const seen = new Set();
+    for (const pair of pairs) {
+        if (pair.a === pair.b)
+            return false;
+        const key = unorderedKey(pair.a, pair.b);
+        if (seen.has(key))
+            return false;
+        seen.add(key);
+        degrees.set(pair.a, (degrees.get(pair.a) ?? 0) + 1);
+        degrees.set(pair.b, (degrees.get(pair.b) ?? 0) + 1);
+    }
+    return [...degrees.values()].every((degree) => degree === k);
+}
+//# sourceMappingURL=pairScheduler.js.map

package/dist/pairScheduler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pairScheduler.js","sourceRoot":"","sources":["../src/pairScheduler.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAQ1C,MAAM,UAAU,iBAAiB,CAAC,YAAsB,EAAE,CAAS,EAAE,GAAQ;IAC3E,MAAM,GAAG,GAAG,CAAC,GAAG,YAAY,CAAC,CAAC;IAC9B,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;IACrB,IAAI,CAAC,GAAG,CAAC;QAAE,MAAM,IAAI,WAAW,CAAC,mDAAmD,CAAC,CAAC;IACtF,IAAI,CAAC,IAAI,CAAC;QAAE,MAAM,IAAI,WAAW,CAAC,6BAA6B,CAAC,0BAA0B,CAAC,IAAI,CAAC,CAAC;IACjG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,WAAW,CAAC,kDAAkD,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACvF,CAAC;IAED,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,GAAG,EAAE,OAAO,IAAI,CAAC,EAAE,CAAC;QAClD,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACpF,MAAM,KAAK,GAAW,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACzC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACvB,MAAM,GAAG,GAAG,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC7B,EAAE,GAAG,KAAK,CAAC;gBACX,MAAM;YACR,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QACvB,CAAC;QACD,IAAI,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IACnD,CAAC;IAED,OAAO,cAAc,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;AACrC,CAAC;AAED,SAAS,cAAc,CAAC,GAAa,EAAE,CAAS,EAAE,GAAQ;IACxD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,OAAO,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;QAC5D,MAAM,SAAS,GAAG,CAAC,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC;aACvC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;aAClC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChF,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,CAAC;YAAE,MAAM;QACd,MAAM,UAAU,GAAG,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;YACxF,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QAC/F,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9E,IAAI,CAAC,CAAC,EAAE,CAAC;YACP,MAAM,IAAI,WAAW,CAAC,uBAAuB,CAAC,8BAA8B,GAAG,CAAC,MAAM,cAAc,CAAC,CAAC;QACxG,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC7B,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9C,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9C,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACvB,CAAC;IAED,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC;QAC9B,MAAM,IAAI,WAAW,CAAC,uBAAuB,CAAC,8BAA8B,GAAG,CAAC,MAAM,cAAc,CAAC,CAAC;IACxG,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,YAAY,CAAC,CAAS,EAAE,CAAS;IACxC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;AAC7C,CAAC;AAED,SAAS,SAAS,CAAC,GAAa,EAAE,KAAa,EAAE,CAAS;IACxD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QACpC,MAAM,GAAG,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QACzC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QAChC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACpD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtD,CAAC;IACD,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;AAC/D,CAAC"}

package/dist/prompts.d.ts

@@ -0,0 +1,15 @@
+import type { Candidate, PromptMessages, PromptOverride } from "./schemas.js";
+export type PromptStyle = "general" | "paper-programming";
+export type PromptPhase = "generate" | "compare" | "mutate" | "finalize";
+export declare const PHASE_VARIABLES: Record<PromptPhase, readonly string[]>;
+interface PhaseTemplate {
+    system: string;
+    user: string;
+}
+export declare function builtInPrompt(phase: PromptPhase, style: PromptStyle): PhaseTemplate;
+export declare function validatePromptTemplate(template: string, phase: PromptPhase): void;
+export declare function generatePrompt(task: string, rubric?: string, style?: PromptStyle, override?: PromptOverride): PromptMessages;
+export declare function comparePrompt(task: string, candidateA: Candidate, candidateB: Candidate, rubric?: string, style?: PromptStyle, override?: PromptOverride): PromptMessages;
+export declare function mutatePrompt(task: string, candidate: Candidate, critique: string, rubric?: string, style?: PromptStyle, override?: PromptOverride): PromptMessages;
+export declare function finalizePrompt(task: string, candidate: Candidate, rubric?: string, style?: PromptStyle, override?: PromptOverride): PromptMessages;
+export {};

package/dist/prompts.js

@@ -0,0 +1,200 @@
+import { ConfigError } from "./errors.js";
+const defaultRubric = "Prefer answers that are correct, complete, robust, verifiable, and directly aligned with the task.";
+const codeRubric = "The solution should be correct, efficient, and accepted under standard competitive-programming constraints.";
+const codeJudgeRubric = "Judge correctness, edge cases, algorithmic complexity, and implementation robustness.";
+export const PHASE_VARIABLES = {
+    generate: ["task", "rubric"],
+    compare: ["task", "rubric", "candidateA", "candidateB"],
+    mutate: ["task", "rubric", "candidate", "critique"],
+    finalize: ["task", "rubric", "candidate"]
+};
+const TEMPLATES = {
+    general: {
+        generate: {
+            system: "You are an expert solver. Produce the best answer you can.\nDo not include hidden chain-of-thought. You may include concise justification only when useful.\nReturn the final answer/artifact directly.",
+            user: "TASK:\n{task}\n\nRUBRIC:\n{rubric}\n\nProduce one complete candidate answer."
+        },
+        compare: {
+            system: "",
+            user: `You are a strict pairwise judge. Compare two candidate answers for the given task.
+Select the candidate more likely to be correct, complete, robust, and aligned with the rubric.
+Declare a tie only when neither candidate is clearly better. Do not rely on position.
+Do not give hidden chain-of-thought. Return strict JSON only.
+
+TASK:
+{task}
+
+RUBRIC:
+{rubric}
+
+SOLUTION A:
+{candidateA}
+
+SOLUTION B:
+{candidateB}
+
+Return JSON with exactly this shape:
+{{
+  "feedback_a": "specific feedback for Solution A",
+  "feedback_b": "specific feedback for Solution B",
+  "winner": "A" | "B" | "tie"
+}}`
+        },
+        mutate: {
+            system: "You are an expert solver improving a candidate answer using critique from pairwise comparisons.\nYou may either refine the current approach or abandon it and produce a fundamentally different solution.\nDo not include hidden chain-of-thought. Return the complete improved candidate answer.",
+            user: "TASK:\n{task}\n\nRUBRIC:\n{rubric}\n\nCURRENT CANDIDATE:\n{candidate}\n\nAGGREGATED CRITIQUE:\n{critique}\n\nProduce one complete improved candidate answer."
+        },
+        finalize: {
+            system: "You are preparing the winning candidate for final delivery.\nPreserve correctness. Remove obvious duplication. Do not add unsupported claims.\nReturn the final answer only.",
+            user: "TASK:\n{task}\n\nRUBRIC:\n{rubric}\n\nWINNING CANDIDATE:\n{candidate}"
+        }
+    },
+    "paper-programming": {
+        generate: {
+            system: "",
+            user: `You are an expert competitive programmer. Solve the programming problem below.
+Provide a brief explanation, then provide a complete accepted C++17 solution in one code block.
+Do not include hidden chain-of-thought.
+
+PROBLEM:
+{task}
+
+RUBRIC:
+{rubric}`
+        },
+        compare: {
+            system: "",
+            user: `You are judging two proposed competitive-programming solutions.
+Prefer the solution more likely to receive an Accepted verdict. If both are wrong, choose the one requiring fewer modifications to become accepted. Declare a tie only when neither is clearly better.
+Do not give hidden chain-of-thought. Return strict JSON only.
+
+PROBLEM:
+{task}
+
+RUBRIC:
+{rubric}
+
+SOLUTION A:
+{candidateA}
+
+SOLUTION B:
+{candidateB}
+
+Return JSON with exactly this shape:
+{{
+  "feedback_a": "specific feedback for Solution A",
+  "feedback_b": "specific feedback for Solution B",
+  "winner": "A" | "B" | "tie"
+}}`
+        },
+        mutate: {
+            system: "",
+            user: `You are an expert competitive programmer improving a proposed solution using feedback from pairwise judging.
+You may refine the current approach or abandon it and use a fundamentally different approach.
+Provide a brief explanation, then provide a complete accepted C++17 solution in one code block.
+Do not include hidden chain-of-thought.
+
+PROBLEM:
+{task}
+
+RUBRIC:
+{rubric}
+
+CURRENT SOLUTION:
+{candidate}
+
+AGGREGATED FEEDBACK:
+{critique}`
+        },
+        finalize: {
+            system: "You are preparing the winning candidate for final delivery.\nPreserve correctness. Remove obvious duplication. Do not add unsupported claims.\nReturn the final answer only.",
+            user: "TASK:\n{task}\n\nRUBRIC:\n{rubric}\n\nWINNING CANDIDATE:\n{candidate}"
+        }
+    }
+};
+function defaultRubricFor(phase, style) {
+    if (style === "paper-programming") {
+        if (phase === "compare")
+            return codeJudgeRubric;
+        if (phase === "generate" || phase === "mutate")
+            return codeRubric;
+    }
+    return defaultRubric;
+}
+export function builtInPrompt(phase, style) {
+    const phaseStyle = TEMPLATES[style] ?? TEMPLATES.general;
+    return phaseStyle[phase];
+}
+export function validatePromptTemplate(template, phase) {
+    const allowed = new Set(PHASE_VARIABLES[phase]);
+    for (const variable of extractVariables(template)) {
+        if (!allowed.has(variable)) {
+            throw new ConfigError(`Unknown template variable "{${variable}}" in ${phase} prompt. Available: ${PHASE_VARIABLES[phase]
+                .map((value) => `{${value}}`)
+                .join(", ")}. Use {{ and }} to escape literal braces.`, { code: "prompts.unknown_variable", retryable: false, fix: "Remove the variable or use a supported one." });
+        }
+    }
+}
+function extractVariables(template) {
+    const names = [];
+    template.replace(/\{\{|\}\}|\{([a-zA-Z][a-zA-Z0-9_]*)\}/g, (_match, name) => {
+        if (name)
+            names.push(name);
+        return "";
+    });
+    return names;
+}
+function substituteVariables(template, variables) {
+    return template.replace(/\{\{|\}\}|\{([a-zA-Z][a-zA-Z0-9_]*)\}/g, (match, name) => {
+        if (match === "{{")
+            return "{";
+        if (match === "}}")
+            return "}";
+        if (name && Object.prototype.hasOwnProperty.call(variables, name))
+            return variables[name];
+        return match;
+    });
+}
+function renderPhase(phase, style, override, variables) {
+    const builtIn = builtInPrompt(phase, style);
+    const systemTemplate = override?.system ?? builtIn.system;
+    const userTemplate = override?.user ?? builtIn.user;
+    if (override?.system !== undefined)
+        validatePromptTemplate(systemTemplate, phase);
+    if (override?.user !== undefined)
+        validatePromptTemplate(userTemplate, phase);
+    return {
+        system: substituteVariables(systemTemplate, variables),
+        user: substituteVariables(userTemplate, variables)
+    };
+}
+export function generatePrompt(task, rubric, style = "general", override) {
+    return renderPhase("generate", style, override, {
+        task,
+        rubric: rubric ?? defaultRubricFor("generate", style)
+    });
+}
+export function comparePrompt(task, candidateA, candidateB, rubric, style = "general", override) {
+    return renderPhase("compare", style, override, {
+        task,
+        rubric: rubric ?? defaultRubricFor("compare", style),
+        candidateA: candidateA.content,
+        candidateB: candidateB.content
+    });
+}
+export function mutatePrompt(task, candidate, critique, rubric, style = "general", override) {
+    return renderPhase("mutate", style, override, {
+        task,
+        rubric: rubric ?? defaultRubricFor("mutate", style),
+        candidate: candidate.content,
+        critique
+    });
+}
+export function finalizePrompt(task, candidate, rubric, style = "general", override) {
+    return renderPhase("finalize", style, override, {
+        task,
+        rubric: rubric ?? defaultRubricFor("finalize", style),
+        candidate: candidate.content
+    });
+}
+//# sourceMappingURL=prompts.js.map

package/dist/prompts.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"prompts.js","sourceRoot":"","sources":["../src/prompts.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAG1C,MAAM,aAAa,GAAG,oGAAoG,CAAC;AAC3H,MAAM,UAAU,GAAG,6GAA6G,CAAC;AACjI,MAAM,eAAe,GAAG,uFAAuF,CAAC;AAKhH,MAAM,CAAC,MAAM,eAAe,GAA2C;IACrE,QAAQ,EAAE,CAAC,MAAM,EAAE,QAAQ,CAAC;IAC5B,OAAO,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,YAAY,EAAE,YAAY,CAAC;IACvD,MAAM,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,UAAU,CAAC;IACnD,QAAQ,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,WAAW,CAAC;CACjC,CAAC;AAOX,MAAM,SAAS,GAA4D;IACzE,OAAO,EAAE;QACP,QAAQ,EAAE;YACR,MAAM,EACJ,yMAAyM;YAC3M,IAAI,EAAE,8EAA8E;SACrF;QACD,OAAO,EAAE;YACP,MAAM,EAAE,EAAE;YACV,IAAI,EAAE;;;;;;;;;;;;;;;;;;;;;;GAsBT;SACE;QACD,MAAM,EAAE;YACN,MAAM,EACJ,mSAAmS;YACrS,IAAI,EAAE,8JAA8J;SACrK;QACD,QAAQ,EAAE;YACR,MAAM,EACJ,8KAA8K;YAChL,IAAI,EAAE,uEAAuE;SAC9E;KACF;IACD,mBAAmB,EAAE;QACnB,QAAQ,EAAE;YACR,MAAM,EAAE,EAAE;YACV,IAAI,EAAE;;;;;;;;SAQH;SACJ;QACD,OAAO,EAAE;YACP,MAAM,EAAE,EAAE;YACV,IAAI,EAAE;;;;;;;;;;;;;;;;;;;;;GAqBT;SACE;QACD,MAAM,EAAE;YACN,MAAM,EAAE,EAAE;YACV,IAAI,EAAE;;;;;;;;;;;;;;;WAeD;SACN;QACD,QAAQ,EAAE;YACR,MAAM,EACJ,8KAA8K;YAChL,IAAI,EAAE,uEAAuE;SAC9E;KACF;CACF,CAAC;AAEF,SAAS,gBAAgB,CAAC,KAAkB,EAAE,KAAkB;IAC9D,IAAI,KAAK,KAAK,mBAAmB,EAAE,CAAC;QAClC,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,eAAe,CAAC;QAChD,IAAI,KAAK,KAAK,UAAU,IAAI,KAAK,KAAK,QAAQ;YAAE,OAAO,UAAU,CAAC;IACpE,CAAC;IACD,OAAO,aAAa,CAAC;AACvB,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,KAAkB,EAAE,KAAkB;IAClE,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,CAAC,IAAI,SAAS,CAAC,OAAO,CAAC;IACzD,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC;AAC3B,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,QAAgB,EAAE,KAAkB;IACzE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC;IAChD,KAAK,MAAM,QAAQ,IAAI,gBAAgB,CAAC,QAAQ,CAAC,EAAE,CAAC;QAClD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,WAAW,CACnB,+BAA+B,QAAQ,SAAS,KAAK,uBAAuB,eAAe,CAAC,KAAK,CAAC;iBAC/F,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,KAAK,GAAG,CAAC;iBAC5B,IAAI,CAAC,IAAI,CAAC,2CAA2C,EACxD,EAAE,IAAI,EAAE,0BAA0B,EAAE,SAAS,EAAE,KAAK,EAAE,GAAG,EAAE,6CAA6C,EAAE,CAC3G,CAAC;QACJ,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,gBAAgB,CAAC,QAAgB;IACxC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,QAAQ,CAAC,OAAO,CAAC,wCAAwC,EAAE,CAAC,MAAM,EAAE,IAAa,EAAE,EAAE;QACnF,IAAI,IAAI;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3B,OAAO,EAAE,CAAC;IACZ,CAAC,CAAC,CAAC;IACH,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,mBAAmB,CAAC,QAAgB,EAAE,SAAiC;IAC9E,OAAO,QAAQ,CAAC,OAAO,CAAC,wCAAwC,EAAE,CAAC,KAAK,EAAE,IAAa,EAAE,EAAE;QACzF,IAAI,KAAK,KAAK,IAAI;YAAE,OAAO,GAAG,CAAC;QAC/B,IAAI,KAAK,KAAK,IAAI;YAAE,OAAO,GAAG,CAAC;QAC/B,IAAI,IAAI,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC;YAAE,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC;QAC1F,OAAO,KAAK,CAAC;IACf,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,WAAW,CAClB,KAAkB,EAClB,KAAkB,EAClB,QAAoC,EACpC,SAAiC;IAEjC,MAAM,OAAO,GAAG,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC5C,MAAM,cAAc,GAAG,QAAQ,EAAE,MAAM,IAAI,OAAO,CAAC,MAAM,CAAC;IAC1D,MAAM,YAAY,GAAG,QAAQ,EAAE,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IACpD,IAAI,QAAQ,EAAE,MAAM,KAAK,SAAS;QAAE,sBAAsB,CAAC,cAAc,EAAE,KAAK,CAAC,CAAC;IAClF,IAAI,QAAQ,EAAE,IAAI,KAAK,SAAS;QAAE,sBAAsB,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;IAC9E,OAAO;QACL,MAAM,EAAE,mBAAmB,CAAC,cAAc,EAAE,SAAS,CAAC;QACtD,IAAI,EAAE,mBAAmB,CAAC,YAAY,EAAE,SAAS,CAAC;KACnD,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,cAAc,CAC5B,IAAY,EACZ,MAAe,EACf,QAAqB,SAAS,EAC9B,QAAyB;IAEzB,OAAO,WAAW,CAAC,UAAU,EAAE,KAAK,EAAE,QAAQ,EAAE;QAC9C,IAAI;QACJ,MAAM,EAAE,MAAM,IAAI,gBAAgB,CAAC,UAAU,EAAE,KAAK,CAAC;KACtD,CAAC,CAAC;AACL,CAAC;AAED,MAAM,UAAU,aAAa,CAC3B,IAAY,EACZ,UAAqB,EACrB,UAAqB,EACrB,MAAe,EACf,QAAqB,SAAS,EAC9B,QAAyB;IAEzB,OAAO,WAAW,CAAC,SAAS,EAAE,KAAK,EAAE,QAAQ,EAAE;QAC7C,IAAI;QACJ,MAAM,EAAE,MAAM,IAAI,gBAAgB,CAAC,SAAS,EAAE,KAAK,CAAC;QACpD,UAAU,EAAE,UAAU,CAAC,OAAO;QAC9B,UAAU,EAAE,UAAU,CAAC,OAAO;KAC/B,CAAC,CAAC;AACL,CAAC;AAED,MAAM,UAAU,YAAY,CAC1B,IAAY,EACZ,SAAoB,EACpB,QAAgB,EAChB,MAAe,EACf,QAAqB,SAAS,EAC9B,QAAyB;IAEzB,OAAO,WAAW,CAAC,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE;QAC5C,IAAI;QACJ,MAAM,EAAE,MAAM,IAAI,gBAAgB,CAAC,QAAQ,EAAE,KAAK,CAAC;QACnD,SAAS,EAAE,SAAS,CAAC,OAAO;QAC5B,QAAQ;KACT,CAAC,CAAC;AACL,CAAC;AAED,MAAM,UAAU,cAAc,CAC5B,IAAY,EACZ,SAAoB,EACpB,MAAe,EACf,QAAqB,SAAS,EAC9B,QAAyB;IAEzB,OAAO,WAAW,CAAC,UAAU,EAAE,KAAK,EAAE,QAAQ,EAAE;QAC9C,IAAI;QACJ,MAAM,EAAE,MAAM,IAAI,gBAAgB,CAAC,UAAU,EAAE,KAAK,CAAC;QACrD,SAAS,EAAE,SAAS,CAAC,OAAO;KAC7B,CAAC,CAAC;AACL,CAAC"}

package/dist/rng.d.ts

@@ -0,0 +1,8 @@
+export interface Rng {
+    next(): number;
+    int(maxExclusive: number): number;
+    bool(): boolean;
+    id(prefix: string): string;
+    shuffle<T>(items: readonly T[]): T[];
+}
+export declare function createRng(seed: number): Rng;

package/dist/rng.js

@@ -0,0 +1,31 @@
+export function createRng(seed) {
+    let state = seed >>> 0;
+    const next = () => {
+        state += 0x6d2b79f5;
+        let t = state;
+        t = Math.imul(t ^ (t >>> 15), t | 1);
+        t ^= t + Math.imul(t ^ (t >>> 7), t | 61);
+        return ((t ^ (t >>> 14)) >>> 0) / 4294967296;
+    };
+    return {
+        next,
+        int(maxExclusive) {
+            return Math.floor(next() * maxExclusive);
+        },
+        bool() {
+            return next() >= 0.5;
+        },
+        id(prefix) {
+            return `${prefix}_${Math.floor(next() * 0xffffffff).toString(36).padStart(7, "0")}`;
+        },
+        shuffle(items) {
+            const copy = [...items];
+            for (let i = copy.length - 1; i > 0; i -= 1) {
+                const j = Math.floor(next() * (i + 1));
+                [copy[i], copy[j]] = [copy[j], copy[i]];
+            }
+            return copy;
+        }
+    };
+}
+//# sourceMappingURL=rng.js.map

package/dist/rng.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rng.js","sourceRoot":"","sources":["../src/rng.ts"],"names":[],"mappings":"AAQA,MAAM,UAAU,SAAS,CAAC,IAAY;IACpC,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC;IACvB,MAAM,IAAI,GAAG,GAAG,EAAE;QAChB,KAAK,IAAI,UAAU,CAAC;QACpB,IAAI,CAAC,GAAG,KAAK,CAAC;QACd,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;QAC1C,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC;IAC/C,CAAC,CAAC;IAEF,OAAO;QACL,IAAI;QACJ,GAAG,CAAC,YAAoB;YACtB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,YAAY,CAAC,CAAC;QAC3C,CAAC;QACD,IAAI;YACF,OAAO,IAAI,EAAE,IAAI,GAAG,CAAC;QACvB,CAAC;QACD,EAAE,CAAC,MAAc;YACf,OAAO,GAAG,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,UAAU,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;QACtF,CAAC;QACD,OAAO,CAAI,KAAmB;YAC5B,MAAM,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;YACxB,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC5C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACvC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1C,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/runner.d.ts

@@ -0,0 +1,11 @@
+import { type BtScore, type Candidate, type ModelDriver, type RunConfig, type RunResult } from "./schemas.js";
+export interface RunControl {
+    jobId?: string;
+    shouldCancel?: () => boolean | Promise<boolean>;
+}
+export declare function runDeepThonk(configInput: RunConfig, driver: ModelDriver, control?: RunControl): Promise<RunResult>;
+export declare function rankPopulation(population: Candidate[], scores: BtScore[]): Candidate[];
+export declare function topQuartile(ranked: Candidate[]): Candidate[];
+export declare function bottomQuartile(ranked: Candidate[]): Set<string>;
+export declare function copyElites(elites: Candidate[], generation: number): Candidate[];
+export declare function keepPopulationSize(population: Candidate[], n: number): Candidate[];