@verax-ai/proxy 0.1.1 → 0.1.3

package/dist/approvals.d.ts

@@ -6,7 +6,7 @@ export declare const approvalFs: {
 export declare const drainMetrics: {
     renameBusy: number;
 };
-import type { ApprovalChannel, InputsLog, Ledger, RecordSigner } from "./types.ts";
+import type { ApprovalChannel, InputsLog, Ledger, Policy, RecordSigner } from "./types.ts";
 export type ApprovalRow = {
     ref: string;
     requestHash: string;
@@ -68,7 +68,25 @@ export type ApproveResult = {
 } | {
     ok: false;
     reason: string;
+    allowRef?: string;
 };
+export declare function spentTodayMinorOf(rows: Array<{
+    subject: string;
+    status: string;
+    createdAtMs?: number;
+    expiresAtMs: number;
+    args: Record<string, unknown>;
+}>, nowMs: number, currency: string, approvalTtlMs: number): number;
+export declare function createApprovalBudgetGuard(opts: {
+    policy: Policy;
+    approvals: ApprovalsLog;
+    now: () => number;
+}): (snap: ApprovalRow) => Promise<{
+    ok: true;
+} | {
+    ok: false;
+    reason: "budget-exceeded";
+}>;
 export declare function approvePending(opts: {
     ledger: Ledger;
     recordSigner: RecordSigner;
@@ -81,6 +99,17 @@ export declare function approvePending(opts: {
     policyHash: string;
     approvals: ApprovalsLog;
     inputsLog?: InputsLog;
+    budgetGuard?: (snap: ApprovalRow) => {
+        ok: true;
+    } | {
+        ok: false;
+        reason: "budget-exceeded";
+    } | Promise<{
+        ok: true;
+    } | {
+        ok: false;
+        reason: "budget-exceeded";
+    }>;
 }): Promise<ApproveResult>;
 export type ApprovalCommand = {
     ref: string;

package/dist/approvals.js

@@ -9,6 +9,7 @@ import { signDecisionRecord } from "@cedulon/core";
 import { appendDurable, lookupDecisionByRef, lookupResolvedBy, noteResolution } from "./ledger.js";
 import { effectDescriptor, sha256Canonical } from "./hash.js";
 import { inputsLogFor } from "./inputs.js";
+import { SerialQueue } from "./serial-queue.js";
 function lastByRef(rows) {
     const map = new Map();
     for (const row of rows)
@@ -105,6 +106,56 @@ export function loadApprovalsFromDir(dir) {
         throw err;
     }
 }
+const APPROVAL_LOCK = Symbol.for("verax.approvalLock");
+function approvalLockFor(ledger) {
+    const bag = ledger;
+    if (!bag[APPROVAL_LOCK])
+        bag[APPROVAL_LOCK] = new SerialQueue();
+    return bag[APPROVAL_LOCK];
+}
+export function spentTodayMinorOf(rows, nowMs, currency, approvalTtlMs) {
+    const d = new Date(nowMs);
+    const start = Date.UTC(d.getUTCFullYear(), d.getUTCMonth(), d.getUTCDate());
+    const end = start + 86_400_000;
+    let sum = 0;
+    for (const row of rows) {
+        if (row.subject !== "spend")
+            continue;
+        if (row.status !== "pending" && row.status !== "approved")
+            continue;
+        const created = row.createdAtMs ?? row.expiresAtMs - approvalTtlMs;
+        if (created < start || created >= end)
+            continue;
+        if (row.args.currency !== currency)
+            continue;
+        const amt = row.args.amountMinor;
+        if (typeof amt === "number")
+            sum += amt;
+    }
+    return sum;
+}
+export function createApprovalBudgetGuard(opts) {
+    return async (snap) => {
+        if (snap.subject !== "spend")
+            return { ok: true };
+        const dailyMax = opts.policy.rule(snap.ruleId)?.spend?.dailyMaxMinor;
+        if (dailyMax === undefined)
+            return { ok: true };
+        const currency = typeof snap.args.currency === "string" ? snap.args.currency : "";
+        const amount = typeof snap.args.amountMinor === "number" ? snap.args.amountMinor : 0;
+        // Sibling pending rows are not authorized yet. Counting them here would
+        // deadlock two 100-unit pendings against a later 150 cap; approved spend
+        // plus this amount is what the operator is about to commit.
+        const others = (await opts.approvals.listAll()).filter((row) => row.ref !== snap.ref && row.status === "approved");
+        const spent = spentTodayMinorOf(others, opts.now(), currency, opts.policy.approvalTtlMs);
+        if (spent + amount > dailyMax)
+            return { ok: false, reason: "budget-exceeded" };
+        return { ok: true };
+    };
+}
+function alreadyResolved(allowRef) {
+    return { ok: false, reason: "already-resolved", ...(allowRef ? { allowRef } : {}) };
+}
 async function hasResolves(inputsLog, ledger, deferRef) {
     const indexed = ledger;
     if (typeof indexed.lookupResolvedBy === "function") {
@@ -120,20 +171,25 @@ async function hasResolves(inputsLog, ledger, deferRef) {
     return false;
 }
 export async function approvePending(opts) {
+    return approvalLockFor(opts.ledger).enqueue(() => approvePendingUnlocked(opts));
+}
+async function approvePendingUnlocked(opts) {
     const inputsLog = opts.inputsLog ?? inputsLogFor(opts.ledger);
     const defer = await lookupDecisionByRef(opts.ledger, opts.ref);
     if (!defer || defer.decision !== "defer")
         return { ok: false, reason: "unknown-ref" };
     const snap = await opts.approvals.get(opts.ref);
-    if (snap && snap.status !== "pending")
-        return { ok: false, reason: "already-resolved" };
+    if (snap && snap.status !== "pending") {
+        const hit = lookupResolvedBy(opts.ledger, opts.ref);
+        return alreadyResolved(snap.allowRef ?? (hit?.kind === "allow" ? hit.ref : undefined));
+    }
     const resolved = lookupResolvedBy(opts.ledger, opts.ref);
     if (resolved || (await hasResolves(inputsLog, opts.ledger, opts.ref))) {
         const hit = resolved ?? lookupResolvedBy(opts.ledger, opts.ref);
         if (snap?.status === "pending" && hit) {
             await opts.approvals.updateStatus(opts.ref, hit.kind === "allow" ? "approved" : "expired", hit.kind === "allow" ? { allowRef: hit.ref } : undefined);
         }
-        return { ok: false, reason: "already-resolved" };
+        return alreadyResolved(hit?.kind === "allow" ? hit.ref : snap?.allowRef);
     }
     if (!snap)
         return { ok: false, reason: "snapshot-missing" };
@@ -172,6 +228,11 @@ export async function approvePending(opts) {
         await opts.approvals.updateStatus(opts.ref, "expired");
         return { ok: false, reason: "expired" };
     }
+    if (opts.budgetGuard) {
+        const guarded = await opts.budgetGuard(snap);
+        if (!guarded.ok)
+            return guarded;
+    }
     const allowRef = opts.nonce();
     const prior = await inputsLog.get(opts.ref);
     const inputs = {

package/dist/atomic-write.d.ts

@@ -0,0 +1 @@
+export declare function writeFileAtomic(path: string, text: string): void;

package/dist/atomic-write.js

@@ -0,0 +1,65 @@
+import { randomBytes } from "node:crypto";
+import { chmodSync, mkdirSync, renameSync, unlinkSync, writeFileSync } from "node:fs";
+import { dirname } from "node:path";
+/**
+ * Replace a file's contents in one step, so a reader sees the old bytes or the
+ * new ones and never a half-written file.
+ *
+ * Writing in place is not that: measured on 11 Sep 2026, a reader polling this
+ * path every 20 ms while the file was rewritten 60 times got 12 unparseable
+ * reads. The listen file is read by another process — that is its whole job —
+ * and a torn read becomes `null`, which the caller cannot tell from "nothing
+ * is running".
+ *
+ * The rename needs the retry. On Windows it fails with EPERM while a reader
+ * holds the destination open, and in the same measurement 26 of 60 plain
+ * renames failed that way. Retrying briefly lost none of them and still let no
+ * torn read through.
+ *
+ * The temporary name carries this process and a random suffix. A fixed `.tmp`
+ * next to the destination is what two writers, or a crashed writer, collide
+ * on.
+ */
+const napper = new Int32Array(new SharedArrayBuffer(4));
+/**
+ * Sleep without spinning. An earlier retry burned the processor between
+ * attempts, which is the worst thing to do while waiting for another process
+ * to let go of a file: under the unit suite's own load the spin starved the
+ * reader it was waiting on, the retries ran out in 200 ms, and the write
+ * threw EPERM. Atomics.wait yields the core instead.
+ */
+function napSync(ms) {
+    Atomics.wait(napper, 0, 0, ms);
+}
+export function writeFileAtomic(path, text) {
+    mkdirSync(dirname(path), { recursive: true, mode: 0o700 });
+    const tmp = `${path}.${process.pid}.${randomBytes(8).toString("hex")}.tmp`;
+    writeFileSync(tmp, text, { encoding: "utf8", mode: 0o600 });
+    try {
+        for (let attempt = 0;; attempt += 1) {
+            try {
+                renameSync(tmp, path);
+                chmodSync(path, 0o600);
+                return;
+            }
+            catch (err) {
+                const code = err.code;
+                // Two seconds of patience. A reader holds this file for microseconds
+                // when the machine is idle; the budget is for the machine that is not.
+                if (attempt >= 100 || (code !== "EPERM" && code !== "EACCES" && code !== "EBUSY")) {
+                    throw err;
+                }
+                napSync(20);
+            }
+        }
+    }
+    catch (err) {
+        try {
+            unlinkSync(tmp);
+        }
+        catch {
+            // rename may already have moved it
+        }
+        throw err;
+    }
+}

package/dist/in-flight-log.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Called before `inner` runs. A failure here must not block the call.
+ *
+ * The stamp is wall-clock time and not the proxy's injected `now`: a mark is
+ * not a ledger row, and taking a tick from a deterministic clock would shift
+ * every timestamp recorded after it — the golden ledger caught exactly that.
+ */
+export declare function markStarted(stateDir: string, ref: string, subject: string): void;
+/** Called once the effect row is written, on success and on failure alike. */
+export declare function markEnded(stateDir: string, ref: string): void;
+/** True when a run started and no end was recorded: the outcome is unknown. */
+export declare function startedWithoutEnd(stateDir: string, ref: string): boolean;

package/dist/in-flight-log.js

@@ -0,0 +1,65 @@
+/**
+ * Durable in-flight marks: "this ref started running".
+ *
+ * The in-memory registry that stops a second run dies with the process. On the
+ * approved path an `allow` does not mean the tool ran — it means the operator
+ * said yes — so a restarted body cannot tell "approved, never started" from
+ * "approved, started, crashed before the effect". Without that distinction it
+ * has to either run everything twice or run nothing at all.
+ *
+ * A mark is one empty file per ref, created before `inner` and removed after
+ * the effect is written. One file per ref rather than a shared log because two
+ * refs may start and finish at the same moment: file create and unlink need no
+ * lock, a shared append-only log would need a compaction pass and would race.
+ *
+ * A mark left behind by a crash is exactly the signal wanted: it outlives the
+ * process, and the retry that finds it answers `outcome-unknown` instead of
+ * running the tool a second time.
+ */
+import { createHash } from "node:crypto";
+import { existsSync, mkdirSync, rmSync, writeFileSync } from "node:fs";
+import { join } from "node:path";
+const KLASOR = "in-flight";
+/** Ref may carry a tenant prefix and any path character; the name never does. */
+function markPath(stateDir, ref) {
+    const ad = createHash("sha256").update(ref, "utf8").digest("hex").slice(0, 32);
+    return join(stateDir, KLASOR, `${ad}.start`);
+}
+/**
+ * Called before `inner` runs. A failure here must not block the call.
+ *
+ * The stamp is wall-clock time and not the proxy's injected `now`: a mark is
+ * not a ledger row, and taking a tick from a deterministic clock would shift
+ * every timestamp recorded after it — the golden ledger caught exactly that.
+ */
+export function markStarted(stateDir, ref, subject) {
+    try {
+        mkdirSync(join(stateDir, KLASOR), { recursive: true, mode: 0o700 });
+        // The body is for a human reading the directory after a crash; nothing parses it.
+        writeFileSync(markPath(stateDir, ref), `${JSON.stringify({ ref, subject, atMs: Date.now() })}\n`, {
+            encoding: "utf8",
+            mode: 0o600,
+        });
+    }
+    catch {
+        // A missing mark degrades to today's behaviour, it does not deny the call.
+    }
+}
+/** Called once the effect row is written, on success and on failure alike. */
+export function markEnded(stateDir, ref) {
+    try {
+        rmSync(markPath(stateDir, ref), { force: true });
+    }
+    catch {
+        // Leaving a stale mark makes the next retry cautious, never wrong.
+    }
+}
+/** True when a run started and no end was recorded: the outcome is unknown. */
+export function startedWithoutEnd(stateDir, ref) {
+    try {
+        return existsSync(markPath(stateDir, ref));
+    }
+    catch {
+        return false;
+    }
+}

package/dist/index.d.ts

@@ -1,8 +1,9 @@
 export { createProxy, LedgerDenyUnrecorded } from "./proxy.ts";
 export { loadPolicy } from "./policy.ts";
-export { FileLedger, MemoryLedger } from "./ledger.ts";
+export { FileLedger, MemoryLedger, readLedgerTail } from "./ledger.ts";
+export { indexCoverage, listPieceFiles } from "./ledger-manifest.ts";
 export { explain } from "./explain.ts";
-export { approvePending, approvalsLogFor, enqueueApprovalCommand, loadApprovalsFromDir } from "./approvals.ts";
+export { approvePending, approvalsLogFor, createApprovalBudgetGuard, enqueueApprovalCommand, loadApprovalsFromDir, } from "./approvals.ts";
 export { loadEffectsFromDir, parseCardCsv, parseChannelJsonl, reconcile } from "./reconcile.ts";
 export { tenantKey } from "./tenant.ts";
 export { diskProbe } from "./disk.ts";
@@ -11,4 +12,5 @@ export { signEffectAttestation } from "./ledger.ts";
 export { spokenReason } from "./spoken-reason.ts";
 export type { ApprovalRow, ApproveResult } from "./approvals.ts";
 export type { CardCsvOpts, ChannelRow, ReconcileReport } from "./reconcile.ts";
+export type { FileLedgerOpts, LedgerCounts } from "./ledger.ts";
 export type { EffectSigner, ExplainChain, ExplainPair, ExplainFinding, ExplainOpts, ExplainResult, ExplainTrustRoot, ExplainWarning, ExtractWindow, Ledger, LedgerEffect, Policy, PolicyDecision, Principal, ProxyDeps, RecordSigner, ToolCall, ToolResult, WitnessClass, } from "./types.ts";

package/dist/index.js

@@ -1,8 +1,9 @@
 export { createProxy, LedgerDenyUnrecorded } from "./proxy.js";
 export { loadPolicy } from "./policy.js";
-export { FileLedger, MemoryLedger } from "./ledger.js";
+export { FileLedger, MemoryLedger, readLedgerTail } from "./ledger.js";
+export { indexCoverage, listPieceFiles } from "./ledger-manifest.js";
 export { explain } from "./explain.js";
-export { approvePending, approvalsLogFor, enqueueApprovalCommand, loadApprovalsFromDir } from "./approvals.js";
+export { approvePending, approvalsLogFor, createApprovalBudgetGuard, enqueueApprovalCommand, loadApprovalsFromDir, } from "./approvals.js";
 export { loadEffectsFromDir, parseCardCsv, parseChannelJsonl, reconcile } from "./reconcile.js";
 export { tenantKey } from "./tenant.js";
 // The body writes checkpoints and signs its own effect attestations. Both were

package/dist/inputs.d.ts

@@ -6,7 +6,13 @@ export declare class MemoryInputsLog implements InputsLog {
 }
 export declare class FileInputsLog implements InputsLog {
     private readonly dir;
-    constructor(dir: string);
+    private readonly resolve;
+    private readonly note;
+    constructor(dir: string, resolve?: () => {
+        active: string;
+        all: string[];
+    }, note?: (ref: string, inputs: DecisionInputs) => void);
+    private paths;
     append(ref: string, inputs: DecisionInputs): Promise<void>;
     get(ref: string): Promise<DecisionInputs | null>;
 }

package/dist/inputs.js

@@ -11,29 +11,44 @@ export class MemoryInputsLog {
 }
 export class FileInputsLog {
     dir;
-    constructor(dir) {
+    resolve;
+    note;
+    constructor(dir, resolve, note) {
         this.dir = dir;
+        this.resolve = resolve;
+        this.note = note;
+    }
+    paths() {
+        if (this.resolve)
+            return this.resolve();
+        const root = join(this.dir, "inputs.jsonl");
+        return { active: root, all: [root] };
     }
     async append(ref, inputs) {
-        await appendDurable(join(this.dir, "inputs.jsonl"), `${JSON.stringify({ ref, inputs })}\n`);
+        await appendDurable(this.paths().active, `${JSON.stringify({ ref, inputs })}\n`);
+        // Handed to the ledger in memory: the decision that follows needs the
+        // principal for its index line and must not read this file back.
+        this.note?.(ref, inputs);
     }
     async get(ref) {
-        let text;
-        try {
-            text = await ledgerFs.readFile(join(this.dir, "inputs.jsonl"), "utf8");
-        }
-        catch (err) {
-            if (err.code === "ENOENT")
-                return null;
-            throw err;
-        }
         let found = null;
-        for (const line of text.split("\n")) {
-            if (line === "")
-                continue;
-            const row = JSON.parse(line);
-            if (row.ref === ref)
-                found = row.inputs;
+        for (const path of this.paths().all) {
+            let text;
+            try {
+                text = await ledgerFs.readFile(path, "utf8");
+            }
+            catch (err) {
+                if (err.code === "ENOENT")
+                    continue;
+                throw err;
+            }
+            for (const line of text.split("\n")) {
+                if (line === "")
+                    continue;
+                const row = JSON.parse(line);
+                if (row.ref === ref)
+                    found = row.inputs;
+            }
         }
         return found;
     }
@@ -43,7 +58,9 @@ export function inputsLogFor(ledger) {
     const bag = ledger;
     if (bag[STASH])
         return bag[STASH];
-    const log = typeof bag.dir === "string" ? new FileInputsLog(bag.dir) : new MemoryInputsLog();
+    const resolve = typeof bag.inputsPaths === "function" ? () => bag.inputsPaths() : undefined;
+    const note = typeof bag.noteInputs === "function" ? (ref, inputs) => bag.noteInputs(ref, inputs) : undefined;
+    const log = typeof bag.dir === "string" ? new FileInputsLog(bag.dir, resolve, note) : new MemoryInputsLog();
     bag[STASH] = log;
     return log;
 }

package/dist/jsonl-tail.d.ts

@@ -0,0 +1,26 @@
+import { open as fsOpen } from "node:fs/promises";
+export type TailVisit = "take" | "skip" | "stop";
+export type TailOpts = {
+    /**
+     * Bytes read per step from the end. Default 64 KiB: measured on a 194 MB
+     * file, 64 KiB, 256 KiB and 1 MiB read the whole of it in the same time,
+     * and the small step keeps a small window's cost small.
+     */
+    chunkBytes?: number;
+    /** The file opener, so a seam or a test can count what was read. */
+    open?: typeof fsOpen;
+    /**
+     * Walk backwards from this byte instead of the file's end. A window that
+     * starts inside a piece uses this after a timestamp seek so the walk does
+     * not cross every later row.
+     */
+    endOffset?: number;
+};
+export declare function readJsonlTail<T>(path: string, visit: (row: T) => TailVisit, opts?: TailOpts): Promise<T[]>;
+/**
+ * The start of the first row whose stamp is at or after `targetMs`, or the
+ * file size when none is. Rows are treated as time-ordered (one writer, the
+ * clock's `now()`); a 60 s slack on the caller covers a clock set back.
+ * Each probe reads from the mid offset until the first complete line.
+ */
+export declare function seekOffsetByTimestamp<T>(path: string, targetMs: number, tsOf: (row: T) => number, opts?: TailOpts): Promise<number>;

package/dist/jsonl-tail.js

@@ -0,0 +1,218 @@
+// A JSON-lines file read from its end. The ledger files are append-only and
+// in time order, so what a reader usually wants (the last day, the last N
+// rows) sits at the end, and reading the whole file to get there costs the
+// whole file: measured on 17 Sep 2026, a 100k-decision ledger answered a
+// 24-hour window in 1.5 s, 40% of the time it took to answer everything.
+//
+// The file is walked backwards in chunks. Each row goes to a visitor, newest
+// first, which says take, skip or stop. What was taken comes back in file
+// order. A chunk is cut at its first newline: what lies before it is the tail
+// of a row that continues further up and is carried to the next chunk; what
+// lies after it is whole rows, decoded together and split. Newlines are
+// single bytes that never occur inside a multibyte character, so a chunk
+// boundary inside one changes nothing.
+import { open as fsOpen } from "node:fs/promises";
+const NEWLINE = 0x0a;
+export async function readJsonlTail(path, visit, opts = {}) {
+    const chunkBytes = Math.max(1, Math.floor(opts.chunkBytes ?? 64 * 1024));
+    const openFile = opts.open ?? fsOpen;
+    let fh;
+    try {
+        fh = await openFile(path, "r");
+    }
+    catch (err) {
+        if (err.code === "ENOENT")
+            return [];
+        throw err;
+    }
+    // Newest first while reading; reversed once at the end.
+    const taken = [];
+    let stopped = false;
+    const emitLines = (text) => {
+        const lines = text.split("\n");
+        for (let i = lines.length - 1; i >= 0 && !stopped; i -= 1) {
+            const line = lines[i];
+            if (line.trim() === "")
+                continue;
+            const row = JSON.parse(line);
+            const verdict = visit(row);
+            if (verdict === "take")
+                taken.push(row);
+            if (verdict === "stop")
+                stopped = true;
+        }
+    };
+    try {
+        const { size } = await fh.stat();
+        const end = opts.endOffset === undefined ? size : Math.min(size, Math.max(0, Math.floor(opts.endOffset)));
+        let pos = end;
+        // The bytes before the first newline of the chunk just read: the tail of
+        // a row whose head is still further up the file.
+        let carry = Buffer.alloc(0);
+        while (pos > 0 && !stopped) {
+            const len = Math.min(chunkBytes, pos);
+            pos -= len;
+            const buf = Buffer.allocUnsafe(len);
+            let got = 0;
+            while (got < len) {
+                const r = await fh.read(buf, got, len - got, pos + got);
+                if (r.bytesRead === 0)
+                    break;
+                got += r.bytesRead;
+            }
+            const data = carry.length > 0 ? Buffer.concat([buf.subarray(0, got), carry]) : buf.subarray(0, got);
+            const first = data.indexOf(NEWLINE);
+            if (first === -1) {
+                // No row ends in this chunk: all of it belongs to a row further up,
+                // unless this is the top of the file, where it is the first row.
+                if (pos === 0)
+                    emitLines(data.toString("utf8"));
+                else
+                    carry = Buffer.from(data);
+                continue;
+            }
+            emitLines(data.toString("utf8", first + 1));
+            if (stopped)
+                break;
+            if (pos === 0) {
+                if (first > 0)
+                    emitLines(data.toString("utf8", 0, first));
+                carry = Buffer.alloc(0);
+            }
+            else {
+                carry = Buffer.from(data.subarray(0, first));
+            }
+        }
+    }
+    finally {
+        await fh.close();
+    }
+    return taken.reverse();
+}
+/**
+ * The start of the first row whose stamp is at or after `targetMs`, or the
+ * file size when none is. Rows are treated as time-ordered (one writer, the
+ * clock's `now()`); a 60 s slack on the caller covers a clock set back.
+ * Each probe reads from the mid offset until the first complete line.
+ */
+export async function seekOffsetByTimestamp(path, targetMs, tsOf, opts = {}) {
+    const chunkBytes = Math.max(1, Math.floor(opts.chunkBytes ?? 64 * 1024));
+    const openFile = opts.open ?? fsOpen;
+    let fh;
+    try {
+        fh = await openFile(path, "r");
+    }
+    catch (err) {
+        if (err.code === "ENOENT")
+            return 0;
+        throw err;
+    }
+    try {
+        const { size } = await fh.stat();
+        if (size === 0)
+            return 0;
+        const readRange = async (from, len) => {
+            if (len <= 0)
+                return Buffer.alloc(0);
+            const buf = Buffer.allocUnsafe(len);
+            let got = 0;
+            while (got < len) {
+                const r = await fh.read(buf, got, len - got, from + got);
+                if (r.bytesRead === 0)
+                    break;
+                got += r.bytesRead;
+            }
+            return buf.subarray(0, got);
+        };
+        const probe = Math.min(4096, chunkBytes);
+        const parseLine = (start, text, end) => {
+            if (text.trim() === "")
+                return null;
+            return { start, end, row: JSON.parse(text) };
+        };
+        const firstCompleteLine = async (mid) => {
+            const from = mid > 0 ? mid - 1 : 0;
+            let collected = await readRange(from, Math.min(probe, size - from));
+            if (collected.length === 0)
+                return null;
+            let start;
+            let rel = 0;
+            if (mid <= 0) {
+                start = 0;
+                rel = 0;
+            }
+            else if (collected[0] === NEWLINE) {
+                start = mid;
+                rel = 1;
+            }
+            else {
+                let pos = from;
+                let buf = collected;
+                let found = false;
+                for (;;) {
+                    const nl = buf.indexOf(NEWLINE, pos === from ? 1 : 0);
+                    if (nl !== -1) {
+                        start = pos + nl + 1;
+                        collected = buf;
+                        rel = nl + 1;
+                        found = true;
+                        break;
+                    }
+                    pos += buf.length;
+                    if (pos >= size)
+                        return null;
+                    buf = await readRange(pos, Math.min(probe, size - pos));
+                    if (buf.length === 0)
+                        return null;
+                }
+                if (!found)
+                    return null;
+            }
+            if (start >= size)
+                return null;
+            const after = collected.subarray(rel);
+            const nl = after.indexOf(NEWLINE);
+            if (nl !== -1) {
+                const parsed = parseLine(start, after.subarray(0, nl).toString("utf8"), start + nl + 1);
+                return parsed ?? firstCompleteLine(start + nl + 1);
+            }
+            let acc = Buffer.from(after);
+            let pos = start + after.length;
+            while (pos < size) {
+                const chunk = await readRange(pos, Math.min(probe, size - pos));
+                if (chunk.length === 0)
+                    break;
+                const n2 = chunk.indexOf(NEWLINE);
+                if (n2 !== -1) {
+                    const parsed = parseLine(start, Buffer.concat([acc, chunk.subarray(0, n2)]).toString("utf8"), start + acc.length + n2 + 1);
+                    return parsed ?? firstCompleteLine(start + acc.length + n2 + 1);
+                }
+                acc = Buffer.concat([acc, chunk]);
+                pos += chunk.length;
+            }
+            return parseLine(start, acc.toString("utf8"), size);
+        };
+        let lo = 0;
+        let hi = size;
+        let found = size;
+        while (lo < hi) {
+            const mid = lo + Math.floor((hi - lo) / 2);
+            const line = await firstCompleteLine(mid);
+            if (line === null || line.start >= hi) {
+                hi = mid;
+                continue;
+            }
+            if (tsOf(line.row) >= targetMs) {
+                found = line.start;
+                hi = mid;
+            }
+            else {
+                lo = line.end > lo ? line.end : lo + 1;
+            }
+        }
+        return found;
+    }
+    finally {
+        await fh.close();
+    }
+}