@chopin-ai/core 0.2.0 → 0.3.0

package/dist/evidence/sanitize.js

@@ -0,0 +1,70 @@
+/** Common secret formats: provider keys, access tokens, cloud keys, JWTs and private key blocks. */
+const SECRET_FORMATS = [
+    /-----BEGIN [A-Z ]*PRIVATE KEY-----[\s\S]*?-----END [A-Z ]*PRIVATE KEY-----/g,
+    /\bsk-[A-Za-z0-9_-]{20,}/g,
+    /\bgh[pousr]_[A-Za-z0-9]{30,}/g,
+    /\bgithub_pat_[A-Za-z0-9_]{30,}/g,
+    /\bxox[abprs]-[A-Za-z0-9-]{10,}/g,
+    /\bAKIA[0-9A-Z]{16}\b/g,
+    /\bAIza[0-9A-Za-z_-]{35}/g,
+    /\beyJ[A-Za-z0-9_-]{10,}\.[A-Za-z0-9_-]{10,}\.[A-Za-z0-9_-]{10,}/g,
+    /(?<=\b(?:password|passwd|secret|token|api[_-]?key)\s*[=:]\s*["']?)[^\s"']{8,}/gi,
+];
+/** Files whose whole content is withheld once a tool has read them. */
+const SECRET_FILE = /(^|[\s/"'=])(\.env(\.[\w-]+)?|\.npmrc|\.netrc|id_(rsa|ed25519|ecdsa)|[\w-]+\.pem|credentials(\.json)?)(?=$|[\s"'])/;
+const MASK = "[redacted]";
+/** Names under which a value is a secret, as an environment variable or a request header. */
+const SECRET_NAME = /KEY|TOKEN|SECRET|PASSWORD|CREDENTIAL|AUTHORIZATION|COOKIE/i;
+/** The values of environment variables named like secrets. */
+export function secretValues(env) {
+    return Object.entries(env).flatMap(([name, value]) => value !== undefined && value.length >= 8 && SECRET_NAME.test(name) ? [value] : []);
+}
+/**
+ * The secrets MCP servers are configured with, from headers and environment named like secrets: each whole value and
+ * each long word of it, so a token is masked with or without the scheme before it.
+ */
+export function mcpSecrets(servers) {
+    return Object.values(servers)
+        .flatMap((server) => secretValues("command" in server ? server.env ?? {} : server.headers ?? {}))
+        .flatMap((value) => [value, ...value.split(/\s+/).filter((word) => word.length >= 8 && word !== value)]);
+}
+/** `text` with every known secret value and every common secret format masked. */
+export function redactText(text, values) {
+    let redacted = text;
+    for (const value of [...values].sort((a, b) => b.length - a.length))
+        redacted = redacted.split(value).join(MASK);
+    for (const format of SECRET_FORMATS)
+        redacted = redacted.replace(format, MASK);
+    return redacted;
+}
+/**
+ * A transcript fit to leave the session: secrets masked in every string, and the output of any tool call that touched
+ * a secret file replaced by the fact that it did.
+ */
+export function redactTranscript(entries, values) {
+    const withheld = new Set();
+    return entries.map((entry) => {
+        if (!("notification" in entry))
+            return redact(entry, values);
+        const update = entry.notification.update;
+        if (update.sessionUpdate === "tool_call" && SECRET_FILE.test(JSON.stringify(update.rawInput ?? ""))) {
+            withheld.add(update.toolCallId);
+        }
+        if (update.sessionUpdate === "tool_call_update" && withheld.has(update.toolCallId)) {
+            const content = [{ type: "content", content: { type: "text", text: "[output of a secret file withheld]" } }];
+            return redact({ ...entry, notification: { ...entry.notification, update: { ...update, content, rawOutput: undefined } } }, values);
+        }
+        return redact(entry, values);
+    });
+}
+function redact(value, values) {
+    if (typeof value === "string")
+        return redactText(value, values);
+    if (Array.isArray(value))
+        return value.map((item) => redact(item, values));
+    if (value !== null && typeof value === "object") {
+        return Object.fromEntries(Object.entries(value).map(([key, item]) => [key, redact(item, values)]));
+    }
+    return value;
+}
+//# sourceMappingURL=sanitize.js.map

package/dist/evidence/sanitize.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sanitize.js","sourceRoot":"","sources":["../../src/evidence/sanitize.ts"],"names":[],"mappings":"AAGA,oGAAoG;AACpG,MAAM,cAAc,GAAsB;IACxC,6EAA6E;IAC7E,0BAA0B;IAC1B,+BAA+B;IAC/B,iCAAiC;IACjC,iCAAiC;IACjC,uBAAuB;IACvB,0BAA0B;IAC1B,kEAAkE;IAClE,iFAAiF;CAClF,CAAC;AAEF,uEAAuE;AACvE,MAAM,WAAW,GAAG,oHAAoH,CAAC;AAEzI,MAAM,IAAI,GAAG,YAAY,CAAC;AAE1B,6FAA6F;AAC7F,MAAM,WAAW,GAAG,4DAA4D,CAAC;AAEjF,8DAA8D;AAC9D,MAAM,UAAU,YAAY,CAAC,GAAiD;IAC5E,OAAO,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AAC3I,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,OAA4C;IACrE,OAAO,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC;SAC1B,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,YAAY,CAAC,SAAS,IAAI,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;SAChG,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC;AAC7G,CAAC;AAED,kFAAkF;AAClF,MAAM,UAAU,UAAU,CAAC,IAAY,EAAE,MAAyB;IAChE,IAAI,QAAQ,GAAG,IAAI,CAAC;IACpB,KAAK,MAAM,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;QAAE,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjH,KAAK,MAAM,MAAM,IAAI,cAAc;QAAE,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC/E,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAAmC,EAAE,MAAyB;IAC7F,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QAC3B,IAAI,CAAC,CAAC,cAAc,IAAI,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC7D,MAAM,MAAM,GAAG,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC;QACzC,IAAI,MAAM,CAAC,aAAa,KAAK,WAAW,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;YACpG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAClC,CAAC;QACD,IAAI,MAAM,CAAC,aAAa,KAAK,kBAAkB,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC;YACnF,MAAM,OAAO,GAAG,CAAC,EAAE,IAAI,EAAE,SAAkB,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,MAAe,EAAE,IAAI,EAAE,oCAAoC,EAAE,EAAE,CAAC,CAAC;YAC/H,OAAO,MAAM,CAAC,EAAE,GAAG,KAAK,EAAE,YAAY,EAAE,EAAE,GAAG,KAAK,CAAC,YAAY,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;QACrI,CAAC;QACD,OAAO,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,MAAM,CAAI,KAAQ,EAAE,MAAyB;IACpD,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,UAAU,CAAC,KAAK,EAAE,MAAM,CAAM,CAAC;IACrE,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAa,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAM,CAAC;IACzF,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAChD,OAAO,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,CAAM,CAAC;IAC1G,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/evidence/signals.d.ts

@@ -0,0 +1,25 @@
+import type { TranscriptEntry } from "../transcript.js";
+/** A failure at the line where it happened: one the transcript records, or a correction the user confirmed. */
+export type Signal = {
+    kind: "tool_failed";
+    line: number;
+    tool: string;
+    toolCallId: string;
+    blocked: boolean;
+} | {
+    kind: "interrupted";
+    line: number;
+} | {
+    kind: "turn_failed";
+    line: number;
+    error: string;
+} | {
+    kind: "corrected";
+    line: number;
+    summary: string;
+};
+/**
+ * Failed tool calls, turns the user cut off, and turns that ended without an answer. A call the user declined is no
+ * failure of the agent's; what the user says next is a correction to confirm.
+ */
+export declare function signals(entries: readonly TranscriptEntry[]): Signal[];

package/dist/evidence/signals.js

@@ -0,0 +1,28 @@
+import { chopinMeta } from "../meta.js";
+/**
+ * Failed tool calls, turns the user cut off, and turns that ended without an answer. A call the user declined is no
+ * failure of the agent's; what the user says next is a correction to confirm.
+ */
+export function signals(entries) {
+    const tools = new Map();
+    return entries.flatMap((entry, line) => {
+        if ("turnEnd" in entry) {
+            if (entry.turnEnd.stopReason === "cancelled")
+                return [{ kind: "interrupted", line }];
+            const error = chopinMeta(entry.turnEnd)?.error;
+            return error === undefined ? [] : [{ kind: "turn_failed", line, error }];
+        }
+        const update = entry.notification.update;
+        if (update.sessionUpdate === "tool_call")
+            tools.set(update.toolCallId, update.title);
+        if (update.sessionUpdate !== "tool_call_update" || update.status !== "failed")
+            return [];
+        const diagnostics = chopinMeta(update)?.diagnostics ?? [];
+        if (diagnostics.includes("rejected"))
+            return [];
+        const tool = tools.get(update.toolCallId) ?? update.title ?? "";
+        const blocked = diagnostics.includes("blocked");
+        return [{ kind: "tool_failed", line, tool, toolCallId: update.toolCallId, blocked }];
+    });
+}
+//# sourceMappingURL=signals.js.map

package/dist/evidence/signals.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"signals.js","sourceRoot":"","sources":["../../src/evidence/signals.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAUxC;;;GAGG;AACH,MAAM,UAAU,OAAO,CAAC,OAAmC;IACzD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,OAAO,OAAO,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,IAAI,EAAY,EAAE;QAC/C,IAAI,SAAS,IAAI,KAAK,EAAE,CAAC;YACvB,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,KAAK,WAAW;gBAAE,OAAO,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;YACrF,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC;YAC/C,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;QAC3E,CAAC;QACD,MAAM,MAAM,GAAG,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC;QACzC,IAAI,MAAM,CAAC,aAAa,KAAK,WAAW;YAAE,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;QACrF,IAAI,MAAM,CAAC,aAAa,KAAK,kBAAkB,IAAI,MAAM,CAAC,MAAM,KAAK,QAAQ;YAAE,OAAO,EAAE,CAAC;QACzF,MAAM,WAAW,GAAG,UAAU,CAAC,MAAM,CAAC,EAAE,WAAW,IAAI,EAAE,CAAC;QAC1D,IAAI,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC;YAAE,OAAO,EAAE,CAAC;QAChD,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC;QAChE,MAAM,OAAO,GAAG,WAAW,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAChD,OAAO,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;IACvF,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/evidence/usage.d.ts

@@ -0,0 +1,12 @@
+import type { TranscriptEntry } from "../transcript.js";
+/** How often a transcript used each part of the layer. */
+export interface LayerUsage {
+    /** Skill reads, by skill name. */
+    skills: Map<string, number>;
+    /** Tool calls, by MCP server. */
+    mcpServers: Map<string, number>;
+    /** Tool calls a hook refused, such as a gate. */
+    blocked: number;
+}
+/** What `entries` used of a layer whose MCP servers are `servers`. */
+export declare function layerUsage(entries: readonly TranscriptEntry[], servers: readonly string[]): LayerUsage;

package/dist/evidence/usage.js

@@ -0,0 +1,24 @@
+import { isMcpToolOf } from "../layer/mcp.js";
+import { chopinMeta } from "../meta.js";
+/** What `entries` used of a layer whose MCP servers are `servers`. */
+export function layerUsage(entries, servers) {
+    const used = { skills: new Map(), mcpServers: new Map(), blocked: 0 };
+    const bump = (counts, key) => counts.set(key, (counts.get(key) ?? 0) + 1);
+    for (const entry of entries) {
+        if (!("notification" in entry))
+            continue;
+        const update = entry.notification.update;
+        if (update.sessionUpdate === "tool_call") {
+            const name = update.rawInput?.name;
+            if (update.title === "skill" && typeof name === "string")
+                bump(used.skills, name);
+            const server = servers.find((candidate) => isMcpToolOf(candidate, update.title));
+            if (server !== undefined)
+                bump(used.mcpServers, server);
+        }
+        if (update.sessionUpdate === "tool_call_update" && chopinMeta(update)?.diagnostics?.includes("blocked"))
+            used.blocked += 1;
+    }
+    return used;
+}
+//# sourceMappingURL=usage.js.map

package/dist/evidence/usage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"usage.js","sourceRoot":"","sources":["../../src/evidence/usage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAaxC,sEAAsE;AACtE,MAAM,UAAU,UAAU,CAAC,OAAmC,EAAE,OAA0B;IACxF,MAAM,IAAI,GAAe,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,UAAU,EAAE,IAAI,GAAG,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;IAClF,MAAM,IAAI,GAAG,CAAC,MAA2B,EAAE,GAAW,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACvG,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,CAAC,CAAC,cAAc,IAAI,KAAK,CAAC;YAAE,SAAS;QACzC,MAAM,MAAM,GAAG,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC;QACzC,IAAI,MAAM,CAAC,aAAa,KAAK,WAAW,EAAE,CAAC;YACzC,MAAM,IAAI,GAAI,MAAM,CAAC,QAA2C,EAAE,IAAI,CAAC;YACvE,IAAI,MAAM,CAAC,KAAK,KAAK,OAAO,IAAI,OAAO,IAAI,KAAK,QAAQ;gBAAE,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAClF,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,WAAW,CAAC,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YACjF,IAAI,MAAM,KAAK,SAAS;gBAAE,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;QAC1D,CAAC;QACD,IAAI,MAAM,CAAC,aAAa,KAAK,kBAAkB,IAAI,UAAU,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,QAAQ,CAAC,SAAS,CAAC;YAAE,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC;IAC7H,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/fault.d.ts

@@ -0,0 +1,3 @@
+/** A fault of the loop's own making, such as a malformed request: it stops a run rather than passing for something the data did. */
+export declare class LoopFault extends Error {
+}

package/dist/fault.js

@@ -0,0 +1,4 @@
+/** A fault of the loop's own making, such as a malformed request: it stops a run rather than passing for something the data did. */
+export class LoopFault extends Error {
+}
+//# sourceMappingURL=fault.js.map

package/dist/fault.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fault.js","sourceRoot":"","sources":["../src/fault.ts"],"names":[],"mappings":"AAAA,oIAAoI;AACpI,MAAM,OAAO,SAAU,SAAQ,KAAK;CAAG"}

package/dist/gate/admission.d.ts

@@ -0,0 +1,34 @@
+/** What an admission leaves behind for the user: what was compared, how much, and how strong the evidence was. */
+export interface Certificate {
+    candidate: string;
+    kind: "instruction" | "skill";
+    scope: {
+        kind: "global";
+    } | {
+        kind: "project";
+        project: string;
+    };
+    /** The version it was compared against. */
+    incumbent: number;
+    pairs: number;
+    evidence: number;
+    level: number;
+    kept: boolean;
+    /** Decision points where, over all their pairs, it did better than the incumbent, and the reverse. */
+    fixed: string[];
+    broken: string[];
+    /** In how many of its continuations the change was used, as a skill read. */
+    used: number;
+    /** Refused for mending none of the failures it was first tried on, before the test proper. */
+    screenedOut: boolean;
+    /** The pairs at failures, and in how many of them each version made the failure again. */
+    atFailures: {
+        pairs: number;
+        incumbentRepeated: number;
+        candidateRepeated: number;
+    };
+    prediction: string;
+    model: string;
+    harness: string;
+    at: string;
+}

package/dist/gate/admission.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=admission.js.map

package/dist/gate/admission.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"admission.js","sourceRoot":"","sources":["../../src/gate/admission.ts"],"names":[],"mappings":""}

package/dist/gate/daily.d.ts

@@ -0,0 +1,92 @@
+import type { FailureSignature } from "../evidence/classify.js";
+import type { EquivalenceVerdict, RepeatVerdict } from "../judge/continuation.js";
+import type { Certificate } from "./admission.js";
+import type { AdmissionLedger } from "./ledger.js";
+/**
+ * How many pairs at failures a candidate is first tried on alone. One that mends none of them is refused there: it
+ * claims to mend that failure, and stopping a test early only ever keeps less.
+ */
+export declare const SCREEN_PAIRS = 6;
+/** How many continuations a kind's failures are tried with for whether they recur, and how many repeats are enough. */
+export declare const RECURRENCE: {
+    readonly tries: 8;
+    readonly enough: 3;
+};
+/**
+ * How many distinct decision points where the agent failed a change must mend to be kept. More draws at one point
+ * show only that the agent follows the change there, not that it carries over to another time the failure happened.
+ */
+export declare const MENDED_POINTS = 2;
+/**
+ * The smallest mean gain per pair worth testing on for: a change shown to fall short of it is refused there. Set
+ * higher, it would stop sooner but begin to refuse changes that mend about four failures in ten.
+ */
+export declare const SMALLEST_GAIN = 0.2;
+/** A decision point where the agent once failed. */
+export interface FixPoint {
+    id: string;
+    context: string;
+    failure: FailureSignature;
+    /** What the user said to correct the step taken there, when the failure is known from that. */
+    correction?: string;
+}
+/** A decision point where the agent went right, and the step it took there. */
+export interface ProtectPoint {
+    id: string;
+    context: string;
+    original: string;
+}
+/** Which version continues: the candidate or the incumbent. */
+export type Arm = "candidate" | "incumbent";
+/** One continued step, and whether it used the change under test. */
+export interface Continued {
+    step: string;
+    used: boolean;
+}
+export interface DailyAdmission {
+    candidate: string;
+    kind: Certificate["kind"];
+    scope: Certificate["scope"];
+    incumbent: number;
+    fixPoints: readonly FixPoint[];
+    protectPoints: readonly ProtectPoint[];
+    /** `undefined` when the point could not be continued, which leaves it out of the test. */
+    continueAt: (arm: Arm, point: FixPoint | ProtectPoint) => Promise<Continued | undefined>;
+    judgeRepeat: (point: FixPoint, step: string) => Promise<RepeatVerdict | undefined>;
+    judgeEquivalent: (point: ProtectPoint, step: string) => Promise<EquivalenceVerdict | undefined>;
+    ledger: AdmissionLedger;
+    /** The most pairs the comparison may take. */
+    limit: number;
+    /** Whether the change must be seen in use before it is kept, as a skill must be read. */
+    mustBeUsed: boolean;
+    prediction: string;
+    model: string;
+    random?: () => number;
+}
+/**
+ * Whether the failures recur at least at the rate of `enough` in `tries`, at which a screen of `SCREEN_PAIRS` pairs
+ * almost always sees the incumbent make the failure; below it a screen mostly sees nothing a change could mend.
+ */
+export declare function recursOften(found: {
+    repeats: number;
+    tried: number;
+}): boolean;
+/**
+ * The failures that recur when the incumbent continues their sessions: each point is continued in turn, and again
+ * once all have been, until `tries` continuations are told or `enough` repeat, so a kind with few failures is
+ * measured as fully as one with many. `recurs` gives `undefined` for a continuation it could not tell, which is not
+ * counted. A change can be shown to mend a failure only where it still happens; the continuations that found it
+ * serve no other purpose, so the test's own stay unbiased.
+ */
+export declare function recurringPoints(points: readonly FixPoint[], recurs: (point: FixPoint, draw: number) => Promise<boolean | undefined>): Promise<{
+    recurring: FixPoint[];
+    repeats: number;
+    tried: number;
+}>;
+/**
+ * Decides on a candidate from continued decision points: one paired, one-sided test of its net effect. After the
+ * first pairs, all at failures, pairs come in turn from where the agent once failed (scored on not repeating the
+ * failure) and from where it went right (scored on doing as well), so a fix that breaks other things does not pass.
+ * The outcome goes in the ledger at the level it set, and the certificate says what was compared and how it came out.
+ */
+export declare function admitDaily(input: DailyAdmission): Promise<Certificate>;

package/dist/gate/daily.js

@@ -0,0 +1,136 @@
+import { PairedComparison } from "./sequential.js";
+/**
+ * How many pairs at failures a candidate is first tried on alone. One that mends none of them is refused there: it
+ * claims to mend that failure, and stopping a test early only ever keeps less.
+ */
+export const SCREEN_PAIRS = 6;
+/** How many continuations a kind's failures are tried with for whether they recur, and how many repeats are enough. */
+export const RECURRENCE = { tries: 8, enough: 3 };
+/**
+ * How many distinct decision points where the agent failed a change must mend to be kept. More draws at one point
+ * show only that the agent follows the change there, not that it carries over to another time the failure happened.
+ */
+export const MENDED_POINTS = 2;
+/**
+ * The smallest mean gain per pair worth testing on for: a change shown to fall short of it is refused there. Set
+ * higher, it would stop sooner but begin to refuse changes that mend about four failures in ten.
+ */
+export const SMALLEST_GAIN = 0.2;
+/**
+ * Whether the failures recur at least at the rate of `enough` in `tries`, at which a screen of `SCREEN_PAIRS` pairs
+ * almost always sees the incumbent make the failure; below it a screen mostly sees nothing a change could mend.
+ */
+export function recursOften(found) {
+    return found.tried > 0 && found.repeats * RECURRENCE.tries >= RECURRENCE.enough * found.tried;
+}
+/**
+ * The failures that recur when the incumbent continues their sessions: each point is continued in turn, and again
+ * once all have been, until `tries` continuations are told or `enough` repeat, so a kind with few failures is
+ * measured as fully as one with many. `recurs` gives `undefined` for a continuation it could not tell, which is not
+ * counted. A change can be shown to mend a failure only where it still happens; the continuations that found it
+ * serve no other purpose, so the test's own stay unbiased.
+ */
+export async function recurringPoints(points, recurs) {
+    const recurring = new Set();
+    let repeats = 0;
+    let tried = 0;
+    const done = () => tried === RECURRENCE.tries || repeats === RECURRENCE.enough;
+    for (let draw = 0; points.length > 0 && !done(); draw += 1) {
+        const before = tried;
+        for (const point of points) {
+            if (done())
+                break;
+            const recurred = await recurs(point, draw);
+            if (recurred === undefined)
+                continue;
+            tried += 1;
+            if (recurred) {
+                repeats += 1;
+                recurring.add(point);
+            }
+        }
+        if (tried === before)
+            break;
+    }
+    return { recurring: [...recurring], repeats, tried };
+}
+/**
+ * Decides on a candidate from continued decision points: one paired, one-sided test of its net effect. After the
+ * first pairs, all at failures, pairs come in turn from where the agent once failed (scored on not repeating the
+ * failure) and from where it went right (scored on doing as well), so a fix that breaks other things does not pass.
+ * The outcome goes in the ledger at the level it set, and the certificate says what was compared and how it came out.
+ */
+export async function admitDaily(input) {
+    const random = input.random ?? Math.random;
+    const level = await input.ledger.nextLevel();
+    const test = new PairedComparison({ margin: 0, futilityMargin: SMALLEST_GAIN, alpha: level, limit: input.limit });
+    // A point is mended, or broken, by its net effect over all its pairs, not by one draw that went either way.
+    const net = new Map();
+    const mended = () => [...net].filter(([, sum]) => sum > 0).map(([id]) => id);
+    let used = 0;
+    const pick = (points) => points[Math.floor(random() * points.length)];
+    const fixPool = [...input.fixPoints];
+    const pools = [fixPool, [...input.protectPoints]];
+    let screened = 0;
+    let screenedOut = false;
+    const atFailures = { pairs: 0, incumbentRepeated: 0, candidateRepeated: 0 };
+    for (let round = 0; test.standing === "continue" && round < input.limit * 2; round += 1) {
+        const live = pools.filter((pool) => pool.length > 0);
+        const screening = screened < SCREEN_PAIRS && input.fixPoints.length > 0;
+        // A screen needs failures to continue; with none left, nothing can be shown mended.
+        if (live.length === 0 || (screening && fixPool.length === 0))
+            break;
+        const point = screening ? pick(fixPool) : pick(live[round % live.length]);
+        const [mine, theirs] = await Promise.all([input.continueAt("candidate", point), input.continueAt("incumbent", point)]);
+        if (mine === undefined || theirs === undefined) {
+            const pool = pools.find((candidates) => candidates.includes(point));
+            pool.splice(pool.indexOf(point), 1);
+            continue;
+        }
+        if (mine.used)
+            used += 1;
+        let difference;
+        if ("failure" in point) {
+            const verdicts = await Promise.all([
+                input.judgeRepeat(point, theirs.step),
+                input.judgeRepeat(point, mine.step),
+            ]);
+            difference = scored(verdicts, "repeats");
+            if (difference !== undefined) {
+                atFailures.pairs += 1;
+                atFailures.incumbentRepeated += Number(verdicts[0] === "repeats");
+                atFailures.candidateRepeated += Number(verdicts[1] === "repeats");
+            }
+        }
+        else {
+            difference = scored(await Promise.all([
+                input.judgeEquivalent(point, mine.step),
+                input.judgeEquivalent(point, theirs.step),
+            ]), "as_good");
+        }
+        if (difference === undefined)
+            continue;
+        test.add(difference);
+        net.set(point.id, (net.get(point.id) ?? 0) + difference);
+        if (screening && (screened += 1) === SCREEN_PAIRS && mended().length === 0) {
+            screenedOut = true;
+            break;
+        }
+    }
+    const failures = new Set(input.fixPoints.map((point) => point.id));
+    const fixed = mended();
+    const broken = [...net].filter(([, sum]) => sum < 0).map(([id]) => id);
+    const passed = test.standing === "accept" && fixed.filter((id) => failures.has(id)).length >= MENDED_POINTS && !(input.mustBeUsed && used === 0);
+    // Every test is recorded, kept or not, so the levels of later ones stay valid.
+    const { kept } = await input.ledger.record(input.candidate, passed ? test.evidence : Math.min(test.evidence, 1));
+    return {
+        candidate: input.candidate, kind: input.kind, scope: input.scope, incumbent: input.incumbent, pairs: test.for.count,
+        evidence: test.evidence, level, kept, fixed, broken, used, screenedOut, atFailures, prediction: input.prediction,
+        model: input.model, harness: "pi", at: new Date().toISOString(),
+    };
+}
+/** The pair as a difference in [-1, 1]: 1 when only the first verdict is `hit`, -1 when only the second is. */
+function scored([first, second], hit) {
+    return first === undefined || second === undefined ? undefined : Number(first === hit) - Number(second === hit);
+}
+//# sourceMappingURL=daily.js.map

package/dist/gate/daily.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"daily.js","sourceRoot":"","sources":["../../src/gate/daily.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AAEnD;;;GAGG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,CAAC;AAE9B,uHAAuH;AACvH,MAAM,CAAC,MAAM,UAAU,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAW,CAAC;AAE3D;;;GAGG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,CAAC;AAE/B;;;GAGG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,GAAG,CAAC;AAgDjC;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,KAAyC;IACnE,OAAO,KAAK,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,CAAC,OAAO,GAAG,UAAU,CAAC,KAAK,IAAI,UAAU,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;AAChG,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,MAA2B,EAC3B,MAAuE;IAEvE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAY,CAAC;IACtC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,IAAI,GAAG,GAAG,EAAE,CAAC,KAAK,KAAK,UAAU,CAAC,KAAK,IAAI,OAAO,KAAK,UAAU,CAAC,MAAM,CAAC;IAC/E,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QAC3D,MAAM,MAAM,GAAG,KAAK,CAAC;QACrB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,IAAI,EAAE;gBAAE,MAAM;YAClB,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YAC3C,IAAI,QAAQ,KAAK,SAAS;gBAAE,SAAS;YACrC,KAAK,IAAI,CAAC,CAAC;YACX,IAAI,QAAQ,EAAE,CAAC;gBACb,OAAO,IAAI,CAAC,CAAC;gBACb,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QACD,IAAI,KAAK,KAAK,MAAM;YAAE,MAAM;IAC9B,CAAC;IACD,OAAO,EAAE,SAAS,EAAE,CAAC,GAAG,SAAS,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;AACvD,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,KAAqB;IACpD,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC;IAC3C,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;IAC7C,MAAM,IAAI,GAAG,IAAI,gBAAgB,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,cAAc,EAAE,aAAa,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;IAClH,4GAA4G;IAC5G,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,MAAM,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IAC7E,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,MAAM,IAAI,GAAG,CAAI,MAAoB,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,CAAE,CAAC;IACxF,MAAM,OAAO,GAAe,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC;IACjD,MAAM,KAAK,GAAkC,CAAC,OAAO,EAAE,CAAC,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;IAEjF,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,WAAW,GAAG,KAAK,CAAC;IACxB,MAAM,UAAU,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,iBAAiB,EAAE,CAAC,EAAE,iBAAiB,EAAE,CAAC,EAAE,CAAC;IAC5E,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,QAAQ,KAAK,UAAU,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QACxF,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACrD,MAAM,SAAS,GAAG,QAAQ,GAAG,YAAY,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QACxE,oFAAoF;QACpF,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,SAAS,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC;YAAE,MAAM;QACpE,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAE,CAAC,CAAC;QAC3E,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,UAAU,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QACvH,IAAI,IAAI,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAE,CAAC;YACrE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;YACpC,SAAS;QACX,CAAC;QACD,IAAI,IAAI,CAAC,IAAI;YAAE,IAAI,IAAI,CAAC,CAAC;QACzB,IAAI,UAA8B,CAAC;QACnC,IAAI,SAAS,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;gBACjC,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC;gBACrC,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC;aACpC,CAAC,CAAC;YACH,UAAU,GAAG,MAAM,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;YACzC,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;gBAC7B,UAAU,CAAC,KAAK,IAAI,CAAC,CAAC;gBACtB,UAAU,CAAC,iBAAiB,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;gBAClE,UAAU,CAAC,iBAAiB,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;YACpE,CAAC;QACH,CAAC;aAAM,CAAC;YACN,UAAU,GAAG,MAAM,CAAC,MAAM,OAAO,CAAC,GAAG,CAAC;gBACpC,KAAK,CAAC,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC;gBACvC,KAAK,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC;aAC1C,CAAC,EAAE,SAAS,CAAC,CAAC;QACjB,CAAC;QACD,IAAI,UAAU,KAAK,SAAS;YAAE,SAAS;QACvC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACrB,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;QACzD,IAAI,SAAS,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC,KAAK,YAAY,IAAI,MAAM,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3E,WAAW,GAAG,IAAI,CAAC;YACnB,MAAM;QACR,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IACnE,MAAM,KAAK,GAAG,MAAM,EAAE,CAAC;IACvB,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IACvE,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,KAAK,QAAQ,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,aAAa,IAAI,CAAC,CAAC,KAAK,CAAC,UAAU,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC;IACjJ,+EAA+E;IAC/E,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC;IACjH,OAAO;QACL,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK;QACnH,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU;QAChH,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;KAChE,CAAC;AACJ,CAAC;AAED,+GAA+G;AAC/G,SAAS,MAAM,CAAI,CAAC,KAAK,EAAE,MAAM,CAA0C,EAAE,GAAM;IACjF,OAAO,KAAK,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,KAAK,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,CAAC;AAClH,CAAC"}

package/dist/gate/ledger.d.ts

@@ -0,0 +1,29 @@
+/** The share of kept changes that may be false, over the loop's whole life. */
+export declare const FALSE_DISCOVERY_RATE = 0.1;
+/**
+ * The discount sequence of the test levels; it sums to about one over all tests, so the level of later tests shrinks
+ * only as fast as it must.
+ */
+export declare function discount(test: number): number;
+/**
+ * Every admission test the loop has run, in order, as JSON Lines chained by hash so an edit shows. Levels follow
+ * e-LOND: the t-th test keeps its candidate when the evidence reaches 1 / (rate · discount(t) · (kept so far + 1)),
+ * which bounds the share of false changes kept under any dependence between the tests.
+ */
+export declare class AdmissionLedger {
+    #private;
+    readonly path: string;
+    readonly rate: number;
+    constructor(path: string, rate?: number);
+    /** The level the next test must meet: its evidence has to reach the inverse. */
+    nextLevel(): Promise<number>;
+    /** Records a finished test; it keeps its candidate when its evidence met the level it was given. */
+    record(candidate: string, evidence: number): Promise<{
+        kept: boolean;
+        level: number;
+    }>;
+    /** How many leading entries are as they were written; the rest were edited or appended out of turn. */
+    intactCount(): Promise<number>;
+    /** Cuts the ledger back to its intact entries, saying how many it dropped. */
+    recover(): Promise<number>;
+}

package/dist/gate/ledger.js

@@ -0,0 +1,88 @@
+import { createHash } from "node:crypto";
+import { appendFile, mkdir, readFile, rename, writeFile } from "node:fs/promises";
+import { dirname } from "node:path";
+/** The share of kept changes that may be false, over the loop's whole life. */
+export const FALSE_DISCOVERY_RATE = 0.1;
+/**
+ * The discount sequence of the test levels; it sums to about one over all tests, so the level of later tests shrinks
+ * only as fast as it must.
+ */
+export function discount(test) {
+    return (0.07720838 * Math.log(Math.max(test, 2))) / (test * Math.exp(Math.sqrt(Math.log(test))));
+}
+/**
+ * Every admission test the loop has run, in order, as JSON Lines chained by hash so an edit shows. Levels follow
+ * e-LOND: the t-th test keeps its candidate when the evidence reaches 1 / (rate · discount(t) · (kept so far + 1)),
+ * which bounds the share of false changes kept under any dependence between the tests.
+ */
+export class AdmissionLedger {
+    path;
+    rate;
+    constructor(path, rate = FALSE_DISCOVERY_RATE) {
+        this.path = path;
+        this.rate = rate;
+    }
+    /** The level the next test must meet: its evidence has to reach the inverse. */
+    async nextLevel() {
+        const entries = await this.#entries();
+        const kept = entries.filter((entry) => entry.kept).length;
+        return this.rate * discount(entries.length + 1) * (kept + 1);
+    }
+    /** Records a finished test; it keeps its candidate when its evidence met the level it was given. */
+    async record(candidate, evidence) {
+        const entries = await this.#entries();
+        const level = await this.nextLevel();
+        const kept = evidence >= 1 / level;
+        const previous = entries.at(-1)?.hash ?? "";
+        const body = { test: entries.length + 1, candidate, level, evidence, kept, previous };
+        const entry = { ...body, hash: digest(body) };
+        await mkdir(dirname(this.path), { recursive: true });
+        await appendFile(this.path, `${JSON.stringify(entry)}\n`);
+        return { kept, level };
+    }
+    /** How many leading entries are as they were written; the rest were edited or appended out of turn. */
+    async intactCount() {
+        const lines = await this.#lines();
+        let previous = "";
+        for (const [index, line] of lines.entries()) {
+            let entry;
+            try {
+                entry = JSON.parse(line);
+            }
+            catch {
+                return index;
+            }
+            const { hash, ...body } = entry;
+            if (entry.previous !== previous || entry.test !== index + 1 || digest(body) !== hash)
+                return index;
+            previous = hash;
+        }
+        return lines.length;
+    }
+    /** Cuts the ledger back to its intact entries, saying how many it dropped. */
+    async recover() {
+        const lines = await this.#lines();
+        const intact = await this.intactCount();
+        if (intact === lines.length)
+            return 0;
+        const temporary = `${this.path}.${process.pid}`;
+        await writeFile(temporary, lines.slice(0, intact).map((line) => `${line}\n`).join(""));
+        await rename(temporary, this.path);
+        return lines.length - intact;
+    }
+    async #entries() {
+        return (await this.#lines()).map((line) => JSON.parse(line));
+    }
+    async #lines() {
+        const text = await readFile(this.path, "utf8").catch((error) => {
+            if (error.code === "ENOENT")
+                return "";
+            throw error;
+        });
+        return text.split("\n").filter((line) => line !== "");
+    }
+}
+function digest(body) {
+    return createHash("sha256").update(JSON.stringify(body)).digest("hex");
+}
+//# sourceMappingURL=ledger.js.map

package/dist/gate/ledger.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ledger.js","sourceRoot":"","sources":["../../src/gate/ledger.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAClF,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEpC,+EAA+E;AAC/E,MAAM,CAAC,MAAM,oBAAoB,GAAG,GAAG,CAAC;AAExC;;;GAGG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AACnG,CAAC;AAYD;;;;GAIG;AACH,MAAM,OAAO,eAAe;IACjB,IAAI,CAAS;IACb,IAAI,CAAS;IAEtB,YAAY,IAAY,EAAE,IAAI,GAAG,oBAAoB;QACnD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAED,gFAAgF;IAChF,KAAK,CAAC,SAAS;QACb,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;QAC1D,OAAO,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IAC/D,CAAC;IAED,oGAAoG;IACpG,KAAK,CAAC,MAAM,CAAC,SAAiB,EAAE,QAAgB;QAC9C,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;QACtC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;QACrC,MAAM,IAAI,GAAG,QAAQ,IAAI,CAAC,GAAG,KAAK,CAAC;QACnC,MAAM,QAAQ,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,EAAE,CAAC;QAC5C,MAAM,IAAI,GAAG,EAAE,IAAI,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;QACtF,MAAM,KAAK,GAAU,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QACrD,MAAM,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QACrD,MAAM,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC1D,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IACzB,CAAC;IAED,uGAAuG;IACvG,KAAK,CAAC,WAAW;QACf,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC;QAClC,IAAI,QAAQ,GAAG,EAAE,CAAC;QAClB,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YAC5C,IAAI,KAAY,CAAC;YACjB,IAAI,CAAC;gBACH,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAU,CAAC;YACpC,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,KAAK,CAAC;YACf,CAAC;YACD,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,GAAG,KAAK,CAAC;YAChC,IAAI,KAAK,CAAC,QAAQ,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,GAAG,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI;gBAAE,OAAO,KAAK,CAAC;YACnG,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC;QACD,OAAO,KAAK,CAAC,MAAM,CAAC;IACtB,CAAC;IAED,8EAA8E;IAC9E,KAAK,CAAC,OAAO;QACX,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC;QAClC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,WAAW,EAAE,CAAC;QACxC,IAAI,MAAM,KAAK,KAAK,CAAC,MAAM;YAAE,OAAO,CAAC,CAAC;QACtC,MAAM,SAAS,GAAG,GAAG,IAAI,CAAC,IAAI,IAAI,OAAO,CAAC,GAAG,EAAE,CAAC;QAChD,MAAM,SAAS,CAAC,SAAS,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QACvF,MAAM,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,OAAO,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;IAC/B,CAAC;IAED,KAAK,CAAC,QAAQ;QACZ,OAAO,CAAC,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAU,CAAC,CAAC;IACxE,CAAC;IAED,KAAK,CAAC,MAAM;QACV,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,KAA4B,EAAE,EAAE;YACpF,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ;gBAAE,OAAO,EAAE,CAAC;YACvC,MAAM,KAAK,CAAC;QACd,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC;IACxD,CAAC;CACF;AAED,SAAS,MAAM,CAAC,IAAyB;IACvC,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AACzE,CAAC"}