@rubric-protocol/attest-index 1.0.0

package/dist/backfill.d.ts

@@ -0,0 +1,12 @@
+export interface BackfillResult {
+    bundleFiles: number;
+    rowsWritten: number;
+    /** Bundles that parsed and validated but failed to insert (e.g. a conflicting duplicate decisionId). */
+    failed: number;
+    /** Files that were not valid bundles (parse error, wrong shape, or bad ts). */
+    skipped: number;
+    days: string[];
+}
+/** Backfill (or rebuild) the index at `indexDir` from bundles under `storeDir`. */
+export declare function backfill(storeDir: string, indexDir: string): BackfillResult;
+//# sourceMappingURL=backfill.d.ts.map

package/dist/backfill.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"backfill.d.ts","sourceRoot":"","sources":["../src/backfill.ts"],"names":[],"mappings":"AAaA,MAAM,WAAW,cAAc;IAC7B,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;IACpB,wGAAwG;IACxG,MAAM,EAAE,MAAM,CAAC;IACf,+EAA+E;IAC/E,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,EAAE,CAAC;CAChB;AAqCD,mFAAmF;AACnF,wBAAgB,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,cAAc,CAsC3E"}

package/dist/backfill.js

@@ -0,0 +1,92 @@
+/**
+ * Backfill the index from a bundle-store directory (tasks/P2.md).
+ *
+ * Walks the store for `*.json` bundles and upserts a row per bundle. Idempotent
+ * (upsert keyed on attestationId), so re-running is a no-op and the index is
+ * fully rebuildable from the bundles alone. `bundlePath` is stored relative to
+ * the store root so the index stays portable.
+ */
+import { readdirSync, readFileSync } from "node:fs";
+import { join, relative } from "node:path";
+import { Index } from "./store.js";
+import { rowFromBundle, shardKeyForTs } from "./schema.js";
+function walkJson(root) {
+    const out = [];
+    const stack = [root];
+    while (stack.length > 0) {
+        const dir = stack.pop();
+        for (const entry of readdirSync(dir, { withFileTypes: true })) {
+            const full = join(dir, entry.name);
+            if (entry.isDirectory())
+                stack.push(full);
+            else if (entry.isFile() && entry.name.endsWith(".json"))
+                out.push(full);
+        }
+    }
+    out.sort();
+    return out;
+}
+function isBundle(value) {
+    if (typeof value !== "object" || value === null)
+        return false;
+    const b = value;
+    if (typeof b.attestationId !== "string" || b.attestationId.length === 0)
+        return false;
+    const d = b.dar;
+    if (!d || typeof d !== "object")
+        return false;
+    // Validate EVERY column the index requires as NOT NULL, so a malformed bundle
+    // is skipped up front rather than throwing a NOT NULL error mid-insert.
+    const str = (x) => typeof x === "string";
+    return (str(d.decisionId) &&
+        str(d.agentId) &&
+        str(d.ts) &&
+        str(d.schemaHash) &&
+        str(d.decisionHash) &&
+        str(d.leafType) &&
+        (d.prev === null || str(d.prev)));
+}
+/** Backfill (or rebuild) the index at `indexDir` from bundles under `storeDir`. */
+export function backfill(storeDir, indexDir) {
+    const index = new Index(indexDir);
+    try {
+        const files = walkJson(storeDir);
+        const rows = [];
+        let skipped = 0;
+        for (const file of files) {
+            let parsed;
+            try {
+                parsed = JSON.parse(readFileSync(file, "utf8"));
+            }
+            catch {
+                skipped++;
+                continue;
+            }
+            if (!isBundle(parsed)) {
+                skipped++;
+                continue;
+            }
+            // Reject a ts that has no valid day key here, so grouping can't throw.
+            try {
+                shardKeyForTs(parsed.dar.ts);
+            }
+            catch {
+                skipped++;
+                continue;
+            }
+            rows.push(rowFromBundle(parsed, relative(storeDir, file)));
+        }
+        const { written, failed } = index.writeBatchResilient(rows);
+        return {
+            bundleFiles: files.length,
+            rowsWritten: written,
+            failed,
+            skipped,
+            days: index.shardDays(),
+        };
+    }
+    finally {
+        index.close();
+    }
+}
+//# sourceMappingURL=backfill.js.map

package/dist/backfill.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"backfill.js","sourceRoot":"","sources":["../src/backfill.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACpD,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAC3C,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,aAAa,EAAE,aAAa,EAAyC,MAAM,aAAa,CAAC;AAYlG,SAAS,QAAQ,CAAC,IAAY;IAC5B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;IACrB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QACzB,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,GAAG,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;YAC9D,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;YACnC,IAAI,KAAK,CAAC,WAAW,EAAE;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;iBACrC,IAAI,KAAK,CAAC,MAAM,EAAE,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1E,CAAC;IACH,CAAC;IACD,GAAG,CAAC,IAAI,EAAE,CAAC;IACX,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,QAAQ,CAAC,KAAc;IAC9B,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,KAAK,CAAC;IAC9D,MAAM,CAAC,GAAG,KAAgC,CAAC;IAC3C,IAAI,OAAO,CAAC,CAAC,aAAa,KAAK,QAAQ,IAAI,CAAC,CAAC,aAAa,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACtF,MAAM,CAAC,GAAG,CAAC,CAAC,GAA0C,CAAC;IACvD,IAAI,CAAC,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC9C,8EAA8E;IAC9E,wEAAwE;IACxE,MAAM,GAAG,GAAG,CAAC,CAAU,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC;IAClD,OAAO,CACL,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC;QACjB,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC;QACd,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QACT,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC;QACjB,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC;QACnB,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC;QACf,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CACjC,CAAC;AACJ,CAAC;AAED,mFAAmF;AACnF,MAAM,UAAU,QAAQ,CAAC,QAAgB,EAAE,QAAgB;IACzD,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC;IAClC,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACjC,MAAM,IAAI,GAAe,EAAE,CAAC;QAC5B,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,MAAe,CAAC;YACpB,IAAI,CAAC;gBACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;YAClD,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,EAAE,CAAC;gBACV,SAAS;YACX,CAAC;YACD,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;gBACtB,OAAO,EAAE,CAAC;gBACV,SAAS;YACX,CAAC;YACD,uEAAuE;YACvE,IAAI,CAAC;gBACH,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC/B,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,EAAE,CAAC;gBACV,SAAS;YACX,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7D,CAAC;QACD,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;QAC5D,OAAO;YACL,WAAW,EAAE,KAAK,CAAC,MAAM;YACzB,WAAW,EAAE,OAAO;YACpB,MAAM;YACN,OAAO;YACP,IAAI,EAAE,KAAK,CAAC,SAAS,EAAE;SACxB,CAAC;IACJ,CAAC;YAAS,CAAC;QACT,KAAK,CAAC,KAAK,EAAE,CAAC;IAChB,CAAC;AACH,CAAC"}

package/dist/cli/backfill.d.ts

@@ -0,0 +1,3 @@
+#!/usr/bin/env node
+export {};
+//# sourceMappingURL=backfill.d.ts.map

package/dist/cli/backfill.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"backfill.d.ts","sourceRoot":"","sources":["../../src/cli/backfill.ts"],"names":[],"mappings":""}

package/dist/cli/backfill.js

@@ -0,0 +1,17 @@
+#!/usr/bin/env node
+/**
+ * CLI: rebuild the attestation index from a bundle store.
+ *   rubric-index-backfill <bundle-store-dir> <index-dir>
+ */
+import { backfill } from "../backfill.js";
+function main(argv) {
+    const [storeDir, indexDir] = argv;
+    if (!storeDir || !indexDir) {
+        process.stderr.write("usage: rubric-index-backfill <bundle-store-dir> <index-dir>\n");
+        process.exit(2);
+    }
+    const result = backfill(storeDir, indexDir);
+    process.stdout.write(JSON.stringify(result, null, 2) + "\n");
+}
+main(process.argv.slice(2));
+//# sourceMappingURL=backfill.js.map

package/dist/cli/backfill.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"backfill.js","sourceRoot":"","sources":["../../src/cli/backfill.ts"],"names":[],"mappings":";AACA;;;GAGG;AACH,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAE1C,SAAS,IAAI,CAAC,IAAc;IAC1B,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,GAAG,IAAI,CAAC;IAClC,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC3B,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,+DAA+D,CAAC,CAAC;QACtF,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IACD,MAAM,MAAM,GAAG,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAC5C,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;AAC/D,CAAC;AAED,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,12 @@
+/**
+ * @rubric-protocol/attest-index — SQLite day-shard attestation index (tasks/P2.md).
+ *
+ * Writer + query lib over per-day WAL shards, plus a backfill that rebuilds the
+ * index from a bundle store. The bundle store is the source of truth; the index
+ * is a rebuildable cache.
+ */
+export { type IndexRow, type AttestationBundle, rowFromBundle, shardKeyForTs, shardFileName, dayKeyFromFileName, DDL, } from "./schema.js";
+export { Shard, type ShardOptions } from "./shard.js";
+export { Index, type IndexOptions } from "./store.js";
+export { backfill, type BackfillResult } from "./backfill.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,OAAO,EACL,KAAK,QAAQ,EACb,KAAK,iBAAiB,EACtB,aAAa,EACb,aAAa,EACb,aAAa,EACb,kBAAkB,EAClB,GAAG,GACJ,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,KAAK,EAAE,KAAK,YAAY,EAAE,MAAM,YAAY,CAAC;AACtD,OAAO,EAAE,KAAK,EAAE,KAAK,YAAY,EAAE,MAAM,YAAY,CAAC;AACtD,OAAO,EAAE,QAAQ,EAAE,KAAK,cAAc,EAAE,MAAM,eAAe,CAAC"}

package/dist/index.js

@@ -0,0 +1,12 @@
+/**
+ * @rubric-protocol/attest-index — SQLite day-shard attestation index (tasks/P2.md).
+ *
+ * Writer + query lib over per-day WAL shards, plus a backfill that rebuilds the
+ * index from a bundle store. The bundle store is the source of truth; the index
+ * is a rebuildable cache.
+ */
+export { rowFromBundle, shardKeyForTs, shardFileName, dayKeyFromFileName, DDL, } from "./schema.js";
+export { Shard } from "./shard.js";
+export { Index } from "./store.js";
+export { backfill } from "./backfill.js";
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,OAAO,EAGL,aAAa,EACb,aAAa,EACb,aAAa,EACb,kBAAkB,EAClB,GAAG,GACJ,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,KAAK,EAAqB,MAAM,YAAY,CAAC;AACtD,OAAO,EAAE,KAAK,EAAqB,MAAM,YAAY,CAAC;AACtD,OAAO,EAAE,QAAQ,EAAuB,MAAM,eAAe,CAAC"}

package/dist/schema.d.ts

@@ -0,0 +1,36 @@
+/**
+ * Attestation index schema (tasks/P2.md). One row per attested leaf; the row
+ * mirrors the DAR core identity plus the service `attestationId` and a pointer
+ * back to the bundle it was derived from (so the index is a cache, and the
+ * bundle store remains the source of truth — the index is rebuildable).
+ */
+import type { DarCore } from "@rubric-protocol/attest-decision";
+export interface IndexRow {
+    attestationId: string;
+    decisionId: string;
+    agentId: string;
+    schemaHash: string;
+    decisionHash: string;
+    prev: string | null;
+    ts: string;
+    leafType: string;
+    bundlePath: string;
+}
+/** A stored attestation bundle: the DAR core plus its service `attestationId`. */
+export interface AttestationBundle {
+    attestationId: string;
+    dar: DarCore;
+    [k: string]: unknown;
+}
+/** Derive an index row from a bundle and the path it was read from. */
+export declare function rowFromBundle(bundle: AttestationBundle, bundlePath: string): IndexRow;
+/** UTC day key (YYYY-MM-DD) that a row's `ts` shards into. */
+export declare function shardKeyForTs(ts: string): string;
+export declare const SHARD_FILE_PREFIX = "attest-";
+export declare const SHARD_FILE_SUFFIX = ".sqlite";
+export declare function shardFileName(dayKey: string): string;
+/** Extract the day key from a shard file name, or null if it is not a shard. */
+export declare function dayKeyFromFileName(name: string): string | null;
+/** DDL. Indexes back the four queries in tasks/P2.md. */
+export declare const DDL = "\nCREATE TABLE IF NOT EXISTS attestations (\n  attestationId TEXT PRIMARY KEY,\n  decisionId    TEXT NOT NULL,\n  agentId       TEXT NOT NULL,\n  schemaHash    TEXT NOT NULL,\n  decisionHash  TEXT NOT NULL,\n  prev          TEXT,\n  ts            TEXT NOT NULL,\n  leafType      TEXT NOT NULL,\n  bundlePath    TEXT NOT NULL\n);\nCREATE UNIQUE INDEX IF NOT EXISTS ux_decisionId       ON attestations(decisionId);\nCREATE INDEX        IF NOT EXISTS ix_agent_ts         ON attestations(agentId, ts, decisionId);\nCREATE INDEX        IF NOT EXISTS ix_agent_schema     ON attestations(agentId, schemaHash, ts, decisionId);\nCREATE INDEX        IF NOT EXISTS ix_agent_decisionId ON attestations(agentId, decisionId);\nCREATE INDEX        IF NOT EXISTS ix_agent_prev       ON attestations(agentId, prev);\n";
+//# sourceMappingURL=schema.d.ts.map

package/dist/schema.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"schema.d.ts","sourceRoot":"","sources":["../src/schema.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,kCAAkC,CAAC;AAEhE,MAAM,WAAW,QAAQ;IACvB,aAAa,EAAE,MAAM,CAAC;IACtB,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;IACrB,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,kFAAkF;AAClF,MAAM,WAAW,iBAAiB;IAChC,aAAa,EAAE,MAAM,CAAC;IACtB,GAAG,EAAE,OAAO,CAAC;IAGb,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;CACtB;AAED,uEAAuE;AACvE,wBAAgB,aAAa,CAAC,MAAM,EAAE,iBAAiB,EAAE,UAAU,EAAE,MAAM,GAAG,QAAQ,CAarF;AAED,8DAA8D;AAC9D,wBAAgB,aAAa,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAMhD;AAED,eAAO,MAAM,iBAAiB,YAAY,CAAC;AAC3C,eAAO,MAAM,iBAAiB,YAAY,CAAC;AAE3C,wBAAgB,aAAa,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAEpD;AAED,gFAAgF;AAChF,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAI9D;AAED,yDAAyD;AACzD,eAAO,MAAM,GAAG,qyBAiBf,CAAC"}

package/dist/schema.js

@@ -0,0 +1,55 @@
+/** Derive an index row from a bundle and the path it was read from. */
+export function rowFromBundle(bundle, bundlePath) {
+    const d = bundle.dar;
+    return {
+        attestationId: bundle.attestationId,
+        decisionId: d.decisionId,
+        agentId: d.agentId,
+        schemaHash: d.schemaHash,
+        decisionHash: d.decisionHash,
+        prev: d.prev,
+        ts: d.ts,
+        leafType: d.leafType,
+        bundlePath,
+    };
+}
+/** UTC day key (YYYY-MM-DD) that a row's `ts` shards into. */
+export function shardKeyForTs(ts) {
+    const key = ts.slice(0, 10);
+    if (!/^\d{4}-\d{2}-\d{2}$/.test(key)) {
+        throw new Error(`index: cannot derive shard day from ts '${ts}'`);
+    }
+    return key;
+}
+export const SHARD_FILE_PREFIX = "attest-";
+export const SHARD_FILE_SUFFIX = ".sqlite";
+export function shardFileName(dayKey) {
+    return `${SHARD_FILE_PREFIX}${dayKey}${SHARD_FILE_SUFFIX}`;
+}
+/** Extract the day key from a shard file name, or null if it is not a shard. */
+export function dayKeyFromFileName(name) {
+    if (!name.startsWith(SHARD_FILE_PREFIX) || !name.endsWith(SHARD_FILE_SUFFIX))
+        return null;
+    const key = name.slice(SHARD_FILE_PREFIX.length, name.length - SHARD_FILE_SUFFIX.length);
+    return /^\d{4}-\d{2}-\d{2}$/.test(key) ? key : null;
+}
+/** DDL. Indexes back the four queries in tasks/P2.md. */
+export const DDL = `
+CREATE TABLE IF NOT EXISTS attestations (
+  attestationId TEXT PRIMARY KEY,
+  decisionId    TEXT NOT NULL,
+  agentId       TEXT NOT NULL,
+  schemaHash    TEXT NOT NULL,
+  decisionHash  TEXT NOT NULL,
+  prev          TEXT,
+  ts            TEXT NOT NULL,
+  leafType      TEXT NOT NULL,
+  bundlePath    TEXT NOT NULL
+);
+CREATE UNIQUE INDEX IF NOT EXISTS ux_decisionId       ON attestations(decisionId);
+CREATE INDEX        IF NOT EXISTS ix_agent_ts         ON attestations(agentId, ts, decisionId);
+CREATE INDEX        IF NOT EXISTS ix_agent_schema     ON attestations(agentId, schemaHash, ts, decisionId);
+CREATE INDEX        IF NOT EXISTS ix_agent_decisionId ON attestations(agentId, decisionId);
+CREATE INDEX        IF NOT EXISTS ix_agent_prev       ON attestations(agentId, prev);
+`;
+//# sourceMappingURL=schema.js.map

package/dist/schema.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"schema.js","sourceRoot":"","sources":["../src/schema.ts"],"names":[],"mappings":"AA6BA,uEAAuE;AACvE,MAAM,UAAU,aAAa,CAAC,MAAyB,EAAE,UAAkB;IACzE,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC;IACrB,OAAO;QACL,aAAa,EAAE,MAAM,CAAC,aAAa;QACnC,UAAU,EAAE,CAAC,CAAC,UAAU;QACxB,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,UAAU,EAAE,CAAC,CAAC,UAAU;QACxB,YAAY,EAAE,CAAC,CAAC,YAAY;QAC5B,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,QAAQ,EAAE,CAAC,CAAC,QAAQ;QACpB,UAAU;KACX,CAAC;AACJ,CAAC;AAED,8DAA8D;AAC9D,MAAM,UAAU,aAAa,CAAC,EAAU;IACtC,MAAM,GAAG,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAC5B,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACrC,MAAM,IAAI,KAAK,CAAC,2CAA2C,EAAE,GAAG,CAAC,CAAC;IACpE,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,CAAC,MAAM,iBAAiB,GAAG,SAAS,CAAC;AAC3C,MAAM,CAAC,MAAM,iBAAiB,GAAG,SAAS,CAAC;AAE3C,MAAM,UAAU,aAAa,CAAC,MAAc;IAC1C,OAAO,GAAG,iBAAiB,GAAG,MAAM,GAAG,iBAAiB,EAAE,CAAC;AAC7D,CAAC;AAED,gFAAgF;AAChF,MAAM,UAAU,kBAAkB,CAAC,IAAY;IAC7C,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC;QAAE,OAAO,IAAI,CAAC;IAC1F,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC;IACzF,OAAO,qBAAqB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;AACtD,CAAC;AAED,yDAAyD;AACzD,MAAM,CAAC,MAAM,GAAG,GAAG;;;;;;;;;;;;;;;;;CAiBlB,CAAC"}

package/dist/shard.d.ts

@@ -0,0 +1,42 @@
+/**
+ * A single day-shard: one WAL-mode SQLite file with the four indexed queries
+ * from tasks/P2.md. `insert` is idempotent (keyed on attestationId), which is
+ * what makes backfill idempotent and the index rebuildable from bundles alone.
+ */
+import Database from "better-sqlite3";
+import { type IndexRow } from "./schema.js";
+export interface ShardOptions {
+    readonly?: boolean;
+}
+export declare class Shard {
+    readonly db: Database.Database;
+    private readonly insertStmt;
+    private readonly byDecisionStmt;
+    private readonly byAgentRangeStmt;
+    private readonly byAgentSchemaStmt;
+    private readonly chainHeadStmt;
+    private readonly insertMany;
+    constructor(path: string, options?: ShardOptions);
+    /** Idempotent single-row upsert. */
+    insert(row: IndexRow): void;
+    /** Idempotent bulk upsert in one transaction. Throws on any row error. */
+    insertBatch(rows: IndexRow[]): number;
+    /**
+     * Idempotent bulk upsert with per-row error isolation, in one transaction.
+     * A row that violates a constraint (e.g. a conflicting duplicate decisionId)
+     * is skipped and counted in `failed` — the good rows still commit. This is
+     * what keeps backfill robust: one bad bundle cannot roll back a whole shard.
+     */
+    insertResilient(rows: IndexRow[]): {
+        written: number;
+        failed: number;
+    };
+    byDecisionId(decisionId: string): IndexRow | undefined;
+    byAgentRange(agentId: string, fromTs: string, toTs: string, limit?: number): IndexRow[];
+    byAgentSchema(agentId: string, schemaHash: string, limit?: number): IndexRow[];
+    /** The chain tip for an agent: the latest decisionId (ULID is chronological). */
+    chainHead(agentId: string): IndexRow | undefined;
+    count(): number;
+    close(): void;
+}
+//# sourceMappingURL=shard.d.ts.map

package/dist/shard.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shard.d.ts","sourceRoot":"","sources":["../src/shard.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AACtC,OAAO,EAAO,KAAK,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEjD,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB;AAkBD,qBAAa,KAAK;IAChB,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,QAAQ,CAAC;IAC/B,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAiC;IAC5D,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAqB;IACpD,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAqB;IACtD,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAqB;IACvD,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAqB;IACnD,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAqD;gBAEpE,IAAI,EAAE,MAAM,EAAE,OAAO,GAAE,YAAiB;IA0BpD,oCAAoC;IACpC,MAAM,CAAC,GAAG,EAAE,QAAQ,GAAG,IAAI;IAI3B,0EAA0E;IAC1E,WAAW,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,MAAM;IAIrC;;;;;OAKG;IACH,eAAe,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE;IAiBtE,YAAY,CAAC,UAAU,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IAItD,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,SAAK,GAAG,QAAQ,EAAE;IAInF,aAAa,CAAC,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,KAAK,SAAK,GAAG,QAAQ,EAAE;IAI1E,iFAAiF;IACjF,SAAS,CAAC,OAAO,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IAIhD,KAAK,IAAI,MAAM;IAIf,KAAK,IAAI,IAAI;CAGd"}

package/dist/shard.js

@@ -0,0 +1,100 @@
+/**
+ * A single day-shard: one WAL-mode SQLite file with the four indexed queries
+ * from tasks/P2.md. `insert` is idempotent (keyed on attestationId), which is
+ * what makes backfill idempotent and the index rebuildable from bundles alone.
+ */
+import Database from "better-sqlite3";
+import { DDL } from "./schema.js";
+const INSERT_SQL = `
+INSERT INTO attestations
+  (attestationId, decisionId, agentId, schemaHash, decisionHash, prev, ts, leafType, bundlePath)
+VALUES
+  (@attestationId, @decisionId, @agentId, @schemaHash, @decisionHash, @prev, @ts, @leafType, @bundlePath)
+ON CONFLICT(attestationId) DO UPDATE SET
+  decisionId   = excluded.decisionId,
+  agentId      = excluded.agentId,
+  schemaHash   = excluded.schemaHash,
+  decisionHash = excluded.decisionHash,
+  prev         = excluded.prev,
+  ts           = excluded.ts,
+  leafType     = excluded.leafType,
+  bundlePath   = excluded.bundlePath
+`;
+export class Shard {
+    db;
+    insertStmt;
+    byDecisionStmt;
+    byAgentRangeStmt;
+    byAgentSchemaStmt;
+    chainHeadStmt;
+    insertMany;
+    constructor(path, options = {}) {
+        this.db = new Database(path, { readonly: options.readonly ?? false });
+        this.db.pragma("journal_mode = WAL");
+        this.db.pragma("synchronous = NORMAL");
+        if (!options.readonly)
+            this.db.exec(DDL);
+        this.insertStmt = this.db.prepare(INSERT_SQL);
+        // ORDER BY ts, then decisionId as a stable tiebreak within a millisecond.
+        this.byDecisionStmt = this.db.prepare("SELECT * FROM attestations WHERE decisionId = ?");
+        this.byAgentRangeStmt = this.db.prepare("SELECT * FROM attestations WHERE agentId = ? AND ts >= ? AND ts <= ? ORDER BY ts, decisionId LIMIT ?");
+        this.byAgentSchemaStmt = this.db.prepare("SELECT * FROM attestations WHERE agentId = ? AND schemaHash = ? ORDER BY ts, decisionId LIMIT ?");
+        this.chainHeadStmt = this.db.prepare("SELECT * FROM attestations WHERE agentId = ? ORDER BY decisionId DESC LIMIT 1");
+        this.insertMany = this.db.transaction((rows) => {
+            for (const r of rows)
+                this.insertStmt.run(r);
+            return rows.length;
+        });
+    }
+    /** Idempotent single-row upsert. */
+    insert(row) {
+        this.insertStmt.run(row);
+    }
+    /** Idempotent bulk upsert in one transaction. Throws on any row error. */
+    insertBatch(rows) {
+        return this.insertMany(rows);
+    }
+    /**
+     * Idempotent bulk upsert with per-row error isolation, in one transaction.
+     * A row that violates a constraint (e.g. a conflicting duplicate decisionId)
+     * is skipped and counted in `failed` — the good rows still commit. This is
+     * what keeps backfill robust: one bad bundle cannot roll back a whole shard.
+     */
+    insertResilient(rows) {
+        let written = 0;
+        let failed = 0;
+        const run = this.db.transaction((rs) => {
+            for (const r of rs) {
+                try {
+                    this.insertStmt.run(r);
+                    written++;
+                }
+                catch {
+                    failed++;
+                }
+            }
+        });
+        run(rows);
+        return { written, failed };
+    }
+    byDecisionId(decisionId) {
+        return this.byDecisionStmt.get(decisionId);
+    }
+    byAgentRange(agentId, fromTs, toTs, limit = -1) {
+        return this.byAgentRangeStmt.all(agentId, fromTs, toTs, limit);
+    }
+    byAgentSchema(agentId, schemaHash, limit = -1) {
+        return this.byAgentSchemaStmt.all(agentId, schemaHash, limit);
+    }
+    /** The chain tip for an agent: the latest decisionId (ULID is chronological). */
+    chainHead(agentId) {
+        return this.chainHeadStmt.get(agentId);
+    }
+    count() {
+        return this.db.prepare("SELECT count(*) AS c FROM attestations").get().c;
+    }
+    close() {
+        this.db.close();
+    }
+}
+//# sourceMappingURL=shard.js.map

package/dist/shard.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"shard.js","sourceRoot":"","sources":["../src/shard.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AACtC,OAAO,EAAE,GAAG,EAAiB,MAAM,aAAa,CAAC;AAMjD,MAAM,UAAU,GAAG;;;;;;;;;;;;;;CAclB,CAAC;AAEF,MAAM,OAAO,KAAK;IACP,EAAE,CAAoB;IACd,UAAU,CAAiC;IAC3C,cAAc,CAAqB;IACnC,gBAAgB,CAAqB;IACrC,iBAAiB,CAAqB;IACtC,aAAa,CAAqB;IAClC,UAAU,CAAqD;IAEhF,YAAY,IAAY,EAAE,UAAwB,EAAE;QAClD,IAAI,CAAC,EAAE,GAAG,IAAI,QAAQ,CAAC,IAAI,EAAE,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,IAAI,KAAK,EAAE,CAAC,CAAC;QACtE,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC;QACrC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,sBAAsB,CAAC,CAAC;QACvC,IAAI,CAAC,OAAO,CAAC,QAAQ;YAAE,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAEzC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QAC9C,0EAA0E;QAC1E,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CACnC,iDAAiD,CAClD,CAAC;QACF,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CACrC,sGAAsG,CACvG,CAAC;QACF,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CACtC,iGAAiG,CAClG,CAAC;QACF,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAClC,+EAA+E,CAChF,CAAC;QACF,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,IAAgB,EAAE,EAAE;YACzD,KAAK,MAAM,CAAC,IAAI,IAAI;gBAAE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC7C,OAAO,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC,CAAC,CAAC;IACL,CAAC;IAED,oCAAoC;IACpC,MAAM,CAAC,GAAa;QAClB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED,0EAA0E;IAC1E,WAAW,CAAC,IAAgB;QAC1B,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED;;;;;OAKG;IACH,eAAe,CAAC,IAAgB;QAC9B,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,EAAc,EAAE,EAAE;YACjD,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACnB,IAAI,CAAC;oBACH,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACvB,OAAO,EAAE,CAAC;gBACZ,CAAC;gBAAC,MAAM,CAAC;oBACP,MAAM,EAAE,CAAC;gBACX,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QACH,GAAG,CAAC,IAAI,CAAC,CAAC;QACV,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;IAC7B,CAAC;IAED,YAAY,CAAC,UAAkB;QAC7B,OAAO,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,UAAU,CAAyB,CAAC;IACrE,CAAC;IAED,YAAY,CAAC,OAAe,EAAE,MAAc,EAAE,IAAY,EAAE,KAAK,GAAG,CAAC,CAAC;QACpE,OAAO,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,CAAe,CAAC;IAC/E,CAAC;IAED,aAAa,CAAC,OAAe,EAAE,UAAkB,EAAE,KAAK,GAAG,CAAC,CAAC;QAC3D,OAAO,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,OAAO,EAAE,UAAU,EAAE,KAAK,CAAe,CAAC;IAC9E,CAAC;IAED,iFAAiF;IACjF,SAAS,CAAC,OAAe;QACvB,OAAO,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAyB,CAAC;IACjE,CAAC;IAED,KAAK;QACH,OAAQ,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,wCAAwC,CAAC,CAAC,GAAG,EAAoB,CAAC,CAAC,CAAC;IAC9F,CAAC;IAED,KAAK;QACH,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC;CACF"}

package/dist/store.d.ts

@@ -0,0 +1,38 @@
+import { type IndexRow } from "./schema.js";
+export interface IndexOptions {
+    readonly?: boolean;
+}
+export declare class Index {
+    private readonly dir;
+    private readonly readOnly;
+    private readonly shards;
+    private dayCache;
+    constructor(dir: string, options?: IndexOptions);
+    /** Day keys with an existing shard file, ascending. Cached per instance. */
+    shardDays(): string[];
+    private shardForDay;
+    /** Idempotent write, routed to the row's day shard. */
+    write(row: IndexRow): void;
+    /** Idempotent bulk write. Rows may span days; each is routed to its shard. */
+    writeBatch(rows: IndexRow[]): number;
+    /**
+     * Idempotent bulk write with per-row error isolation (for backfill). A row
+     * that fails to insert (e.g. a conflicting duplicate decisionId) is counted
+     * in `failed` rather than aborting its shard. Rows must already have a valid
+     * day key (callers validate `ts` up front).
+     */
+    writeBatchResilient(rows: IndexRow[]): {
+        written: number;
+        failed: number;
+    };
+    private groupByDay;
+    private openShards;
+    byDecisionId(decisionId: string): IndexRow | undefined;
+    byAgentRange(agentId: string, fromTs: string, toTs: string, limit?: number): IndexRow[];
+    byAgentSchema(agentId: string, schemaHash: string, limit?: number): IndexRow[];
+    /** Global chain tip for an agent across all shards (max decisionId). */
+    chainHead(agentId: string): IndexRow | undefined;
+    count(): number;
+    close(): void;
+}
+//# sourceMappingURL=store.d.ts.map

package/dist/store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.d.ts","sourceRoot":"","sources":["../src/store.ts"],"names":[],"mappings":"AAQA,OAAO,EAIL,KAAK,QAAQ,EACd,MAAM,aAAa,CAAC;AAErB,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB;AAED,qBAAa,KAAK;IAChB,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAS;IAC7B,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAU;IACnC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAA4B;IACnD,OAAO,CAAC,QAAQ,CAAyB;gBAE7B,GAAG,EAAE,MAAM,EAAE,OAAO,GAAE,YAAiB;IAMnD,4EAA4E;IAC5E,SAAS,IAAI,MAAM,EAAE;IAgBrB,OAAO,CAAC,WAAW;IAenB,uDAAuD;IACvD,KAAK,CAAC,GAAG,EAAE,QAAQ,GAAG,IAAI;IAM1B,8EAA8E;IAC9E,UAAU,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,MAAM;IAQpC;;;;;OAKG;IACH,mBAAmB,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE;IAW1E,OAAO,CAAC,UAAU;IASlB,OAAO,CAAC,UAAU;IAMlB,YAAY,CAAC,UAAU,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IAQtD,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,SAAK,GAAG,QAAQ,EAAE;IAanF,aAAa,CAAC,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,KAAK,SAAK,GAAG,QAAQ,EAAE;IAS1E,wEAAwE;IACxE,SAAS,CAAC,OAAO,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IAShD,KAAK,IAAI,MAAM;IAIf,KAAK,IAAI,IAAI;CAId"}

package/dist/store.js

@@ -0,0 +1,147 @@
+/**
+ * Index — a directory of day-shards (tasks/P2.md). Routes writes to the shard
+ * for a row's `ts` day, and fans the four queries out across shards, merging.
+ * Shard handles are opened lazily and cached.
+ */
+import { mkdirSync, readdirSync } from "node:fs";
+import { join } from "node:path";
+import { Shard } from "./shard.js";
+import { dayKeyFromFileName, shardFileName, shardKeyForTs, } from "./schema.js";
+export class Index {
+    dir;
+    readOnly;
+    shards = new Map();
+    dayCache = null;
+    constructor(dir, options = {}) {
+        this.dir = dir;
+        this.readOnly = options.readonly ?? false;
+        if (!this.readOnly)
+            mkdirSync(dir, { recursive: true });
+    }
+    /** Day keys with an existing shard file, ascending. Cached per instance. */
+    shardDays() {
+        if (this.dayCache)
+            return this.dayCache;
+        let names;
+        try {
+            names = readdirSync(this.dir);
+        }
+        catch {
+            this.dayCache = [];
+            return this.dayCache;
+        }
+        this.dayCache = names
+            .map(dayKeyFromFileName)
+            .filter((k) => k !== null)
+            .sort();
+        return this.dayCache;
+    }
+    shardForDay(day, createIfMissing) {
+        const cached = this.shards.get(day);
+        if (cached)
+            return cached;
+        const exists = this.shardDays().includes(day);
+        // Readonly / query paths must not create a shard file that isn't there.
+        if (!exists && (this.readOnly || !createIfMissing))
+            return undefined;
+        const shard = new Shard(join(this.dir, shardFileName(day)), { readonly: this.readOnly });
+        this.shards.set(day, shard);
+        if (!exists && this.dayCache) {
+            this.dayCache.push(day);
+            this.dayCache.sort();
+        }
+        return shard;
+    }
+    /** Idempotent write, routed to the row's day shard. */
+    write(row) {
+        const day = shardKeyForTs(row.ts);
+        const shard = this.shardForDay(day, true);
+        shard.insert(row);
+    }
+    /** Idempotent bulk write. Rows may span days; each is routed to its shard. */
+    writeBatch(rows) {
+        let n = 0;
+        for (const [day, dayRows] of this.groupByDay(rows)) {
+            n += this.shardForDay(day, true).insertBatch(dayRows);
+        }
+        return n;
+    }
+    /**
+     * Idempotent bulk write with per-row error isolation (for backfill). A row
+     * that fails to insert (e.g. a conflicting duplicate decisionId) is counted
+     * in `failed` rather than aborting its shard. Rows must already have a valid
+     * day key (callers validate `ts` up front).
+     */
+    writeBatchResilient(rows) {
+        let written = 0;
+        let failed = 0;
+        for (const [day, dayRows] of this.groupByDay(rows)) {
+            const r = this.shardForDay(day, true).insertResilient(dayRows);
+            written += r.written;
+            failed += r.failed;
+        }
+        return { written, failed };
+    }
+    groupByDay(rows) {
+        const byDay = new Map();
+        for (const r of rows) {
+            const day = shardKeyForTs(r.ts);
+            (byDay.get(day) ?? byDay.set(day, []).get(day)).push(r);
+        }
+        return byDay;
+    }
+    openShards() {
+        return this.shardDays()
+            .map((day) => this.shardForDay(day, false))
+            .filter((s) => s !== undefined);
+    }
+    byDecisionId(decisionId) {
+        for (const shard of this.openShards()) {
+            const row = shard.byDecisionId(decisionId);
+            if (row)
+                return row;
+        }
+        return undefined;
+    }
+    byAgentRange(agentId, fromTs, toTs, limit = -1) {
+        const fromDay = shardKeyForTs(fromTs);
+        const toDay = shardKeyForTs(toTs);
+        const rows = [];
+        for (const day of this.shardDays()) {
+            if (day < fromDay || day > toDay)
+                continue;
+            const shard = this.shardForDay(day, false);
+            if (shard)
+                rows.push(...shard.byAgentRange(agentId, fromTs, toTs, limit));
+        }
+        rows.sort((a, b) => (a.ts < b.ts ? -1 : a.ts > b.ts ? 1 : a.decisionId < b.decisionId ? -1 : 1));
+        return limit >= 0 ? rows.slice(0, limit) : rows;
+    }
+    byAgentSchema(agentId, schemaHash, limit = -1) {
+        const rows = [];
+        for (const shard of this.openShards()) {
+            rows.push(...shard.byAgentSchema(agentId, schemaHash, limit));
+        }
+        rows.sort((a, b) => (a.ts < b.ts ? -1 : a.ts > b.ts ? 1 : a.decisionId < b.decisionId ? -1 : 1));
+        return limit >= 0 ? rows.slice(0, limit) : rows;
+    }
+    /** Global chain tip for an agent across all shards (max decisionId). */
+    chainHead(agentId) {
+        let head;
+        for (const shard of this.openShards()) {
+            const h = shard.chainHead(agentId);
+            if (h && (!head || h.decisionId > head.decisionId))
+                head = h;
+        }
+        return head;
+    }
+    count() {
+        return this.openShards().reduce((n, s) => n + s.count(), 0);
+    }
+    close() {
+        for (const shard of this.shards.values())
+            shard.close();
+        this.shards.clear();
+    }
+}
+//# sourceMappingURL=store.js.map

package/dist/store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.js","sourceRoot":"","sources":["../src/store.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AACjD,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EACL,kBAAkB,EAClB,aAAa,EACb,aAAa,GAEd,MAAM,aAAa,CAAC;AAMrB,MAAM,OAAO,KAAK;IACC,GAAG,CAAS;IACZ,QAAQ,CAAU;IAClB,MAAM,GAAG,IAAI,GAAG,EAAiB,CAAC;IAC3C,QAAQ,GAAoB,IAAI,CAAC;IAEzC,YAAY,GAAW,EAAE,UAAwB,EAAE;QACjD,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,KAAK,CAAC;QAC1C,IAAI,CAAC,IAAI,CAAC,QAAQ;YAAE,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAC1D,CAAC;IAED,4EAA4E;IAC5E,SAAS;QACP,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAC,QAAQ,CAAC;QACxC,IAAI,KAAe,CAAC;QACpB,IAAI,CAAC;YACH,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChC,CAAC;QAAC,MAAM,CAAC;YACP,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;YACnB,OAAO,IAAI,CAAC,QAAQ,CAAC;QACvB,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,KAAK;aAClB,GAAG,CAAC,kBAAkB,CAAC;aACvB,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC;aACtC,IAAI,EAAE,CAAC;QACV,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAEO,WAAW,CAAC,GAAW,EAAE,eAAwB;QACvD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;QAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAC9C,wEAAwE;QACxE,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,eAAe,CAAC;YAAE,OAAO,SAAS,CAAC;QACrE,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,aAAa,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;QACzF,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC5B,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC7B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACxB,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QACvB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,uDAAuD;IACvD,KAAK,CAAC,GAAa;QACjB,MAAM,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAClC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAE,CAAC;QAC3C,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACpB,CAAC;IAED,8EAA8E;IAC9E,UAAU,CAAC,IAAgB;QACzB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YACnD,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAE,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QACzD,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED;;;;;OAKG;IACH,mBAAmB,CAAC,IAAgB;QAClC,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YACnD,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAE,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;YAChE,OAAO,IAAI,CAAC,CAAC,OAAO,CAAC;YACrB,MAAM,IAAI,CAAC,CAAC,MAAM,CAAC;QACrB,CAAC;QACD,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;IAC7B,CAAC;IAEO,UAAU,CAAC,IAAgB;QACjC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAsB,CAAC;QAC5C,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,MAAM,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAChC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3D,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,UAAU;QAChB,OAAO,IAAI,CAAC,SAAS,EAAE;aACpB,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;aAC1C,MAAM,CAAC,CAAC,CAAC,EAAc,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;IAChD,CAAC;IAED,YAAY,CAAC,UAAkB;QAC7B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC;YACtC,MAAM,GAAG,GAAG,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;YAC3C,IAAI,GAAG;gBAAE,OAAO,GAAG,CAAC;QACtB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,YAAY,CAAC,OAAe,EAAE,MAAc,EAAE,IAAY,EAAE,KAAK,GAAG,CAAC,CAAC;QACpE,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;QACtC,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,IAAI,GAAe,EAAE,CAAC;QAC5B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC;YACnC,IAAI,GAAG,GAAG,OAAO,IAAI,GAAG,GAAG,KAAK;gBAAE,SAAS;YAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC3C,IAAI,KAAK;gBAAE,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;QAC5E,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjG,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAClD,CAAC;IAED,aAAa,CAAC,OAAe,EAAE,UAAkB,EAAE,KAAK,GAAG,CAAC,CAAC;QAC3D,MAAM,IAAI,GAAe,EAAE,CAAC;QAC5B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,aAAa,CAAC,OAAO,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC;QAChE,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjG,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAClD,CAAC;IAED,wEAAwE;IACxE,SAAS,CAAC,OAAe;QACvB,IAAI,IAA0B,CAAC;QAC/B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC;YACtC,MAAM,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;YACnC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;gBAAE,IAAI,GAAG,CAAC,CAAC;QAC/D,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK;QACH,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC;IAC9D,CAAC;IAED,KAAK;QACH,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;YAAE,KAAK,CAAC,KAAK,EAAE,CAAC;QACxD,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;CACF"}

package/package.json

@@ -0,0 +1,35 @@
+{
+  "name": "@rubric-protocol/attest-index",
+  "version": "1.0.0",
+  "type": "module",
+  "description": "Rubric attestation index: SQLite day-shard writer, backfill, query lib",
+  "license": "Apache-2.0",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/0xsims/rubric-attest.git",
+    "directory": "packages/attest-index"
+  },
+  "main": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": {
+      "development": "./src/index.ts",
+      "types": "./dist/index.d.ts",
+      "default": "./dist/index.js"
+    }
+  },
+  "bin": {
+    "rubric-index-backfill": "./dist/cli/backfill.js"
+  },
+  "files": ["dist", "src"],
+  "publishConfig": { "access": "public" },
+  "scripts": {
+    "prepublishOnly": "npm run build",
+    "build": "tsc -p tsconfig.build.json",
+    "test": "vitest run"
+  },
+  "dependencies": {
+    "@rubric-protocol/attest-decision": "^1.0.0",
+    "better-sqlite3": "^11.3.0"
+  }
+}

package/src/backfill.ts

@@ -0,0 +1,98 @@
+/**
+ * Backfill the index from a bundle-store directory (tasks/P2.md).
+ *
+ * Walks the store for `*.json` bundles and upserts a row per bundle. Idempotent
+ * (upsert keyed on attestationId), so re-running is a no-op and the index is
+ * fully rebuildable from the bundles alone. `bundlePath` is stored relative to
+ * the store root so the index stays portable.
+ */
+import { readdirSync, readFileSync } from "node:fs";
+import { join, relative } from "node:path";
+import { Index } from "./store.js";
+import { rowFromBundle, shardKeyForTs, type AttestationBundle, type IndexRow } from "./schema.js";
+
+export interface BackfillResult {
+  bundleFiles: number;
+  rowsWritten: number;
+  /** Bundles that parsed and validated but failed to insert (e.g. a conflicting duplicate decisionId). */
+  failed: number;
+  /** Files that were not valid bundles (parse error, wrong shape, or bad ts). */
+  skipped: number;
+  days: string[];
+}
+
+function walkJson(root: string): string[] {
+  const out: string[] = [];
+  const stack = [root];
+  while (stack.length > 0) {
+    const dir = stack.pop()!;
+    for (const entry of readdirSync(dir, { withFileTypes: true })) {
+      const full = join(dir, entry.name);
+      if (entry.isDirectory()) stack.push(full);
+      else if (entry.isFile() && entry.name.endsWith(".json")) out.push(full);
+    }
+  }
+  out.sort();
+  return out;
+}
+
+function isBundle(value: unknown): value is AttestationBundle {
+  if (typeof value !== "object" || value === null) return false;
+  const b = value as Record<string, unknown>;
+  if (typeof b.attestationId !== "string" || b.attestationId.length === 0) return false;
+  const d = b.dar as Record<string, unknown> | undefined;
+  if (!d || typeof d !== "object") return false;
+  // Validate EVERY column the index requires as NOT NULL, so a malformed bundle
+  // is skipped up front rather than throwing a NOT NULL error mid-insert.
+  const str = (x: unknown) => typeof x === "string";
+  return (
+    str(d.decisionId) &&
+    str(d.agentId) &&
+    str(d.ts) &&
+    str(d.schemaHash) &&
+    str(d.decisionHash) &&
+    str(d.leafType) &&
+    (d.prev === null || str(d.prev))
+  );
+}
+
+/** Backfill (or rebuild) the index at `indexDir` from bundles under `storeDir`. */
+export function backfill(storeDir: string, indexDir: string): BackfillResult {
+  const index = new Index(indexDir);
+  try {
+    const files = walkJson(storeDir);
+    const rows: IndexRow[] = [];
+    let skipped = 0;
+    for (const file of files) {
+      let parsed: unknown;
+      try {
+        parsed = JSON.parse(readFileSync(file, "utf8"));
+      } catch {
+        skipped++;
+        continue;
+      }
+      if (!isBundle(parsed)) {
+        skipped++;
+        continue;
+      }
+      // Reject a ts that has no valid day key here, so grouping can't throw.
+      try {
+        shardKeyForTs(parsed.dar.ts);
+      } catch {
+        skipped++;
+        continue;
+      }
+      rows.push(rowFromBundle(parsed, relative(storeDir, file)));
+    }
+    const { written, failed } = index.writeBatchResilient(rows);
+    return {
+      bundleFiles: files.length,
+      rowsWritten: written,
+      failed,
+      skipped,
+      days: index.shardDays(),
+    };
+  } finally {
+    index.close();
+  }
+}

package/src/cli/backfill.ts

@@ -0,0 +1,18 @@
+#!/usr/bin/env node
+/**
+ * CLI: rebuild the attestation index from a bundle store.
+ *   rubric-index-backfill <bundle-store-dir> <index-dir>
+ */
+import { backfill } from "../backfill.js";
+
+function main(argv: string[]): void {
+  const [storeDir, indexDir] = argv;
+  if (!storeDir || !indexDir) {
+    process.stderr.write("usage: rubric-index-backfill <bundle-store-dir> <index-dir>\n");
+    process.exit(2);
+  }
+  const result = backfill(storeDir, indexDir);
+  process.stdout.write(JSON.stringify(result, null, 2) + "\n");
+}
+
+main(process.argv.slice(2));

package/src/index.ts

@@ -0,0 +1,19 @@
+/**
+ * @rubric-protocol/attest-index — SQLite day-shard attestation index (tasks/P2.md).
+ *
+ * Writer + query lib over per-day WAL shards, plus a backfill that rebuilds the
+ * index from a bundle store. The bundle store is the source of truth; the index
+ * is a rebuildable cache.
+ */
+export {
+  type IndexRow,
+  type AttestationBundle,
+  rowFromBundle,
+  shardKeyForTs,
+  shardFileName,
+  dayKeyFromFileName,
+  DDL,
+} from "./schema.js";
+export { Shard, type ShardOptions } from "./shard.js";
+export { Index, type IndexOptions } from "./store.js";
+export { backfill, type BackfillResult } from "./backfill.js";

package/src/schema.ts

@@ -0,0 +1,87 @@
+/**
+ * Attestation index schema (tasks/P2.md). One row per attested leaf; the row
+ * mirrors the DAR core identity plus the service `attestationId` and a pointer
+ * back to the bundle it was derived from (so the index is a cache, and the
+ * bundle store remains the source of truth — the index is rebuildable).
+ */
+import type { DarCore } from "@rubric-protocol/attest-decision";
+
+export interface IndexRow {
+  attestationId: string;
+  decisionId: string;
+  agentId: string;
+  schemaHash: string;
+  decisionHash: string;
+  prev: string | null;
+  ts: string;
+  leafType: string;
+  bundlePath: string;
+}
+
+/** A stored attestation bundle: the DAR core plus its service `attestationId`. */
+export interface AttestationBundle {
+  attestationId: string;
+  dar: DarCore;
+  // Envelope extras (merkleProof, anchorRef, signature, extensions) may also be
+  // present in a bundle; they are not indexed here (see spec/dar-0.1.md §6).
+  [k: string]: unknown;
+}
+
+/** Derive an index row from a bundle and the path it was read from. */
+export function rowFromBundle(bundle: AttestationBundle, bundlePath: string): IndexRow {
+  const d = bundle.dar;
+  return {
+    attestationId: bundle.attestationId,
+    decisionId: d.decisionId,
+    agentId: d.agentId,
+    schemaHash: d.schemaHash,
+    decisionHash: d.decisionHash,
+    prev: d.prev,
+    ts: d.ts,
+    leafType: d.leafType,
+    bundlePath,
+  };
+}
+
+/** UTC day key (YYYY-MM-DD) that a row's `ts` shards into. */
+export function shardKeyForTs(ts: string): string {
+  const key = ts.slice(0, 10);
+  if (!/^\d{4}-\d{2}-\d{2}$/.test(key)) {
+    throw new Error(`index: cannot derive shard day from ts '${ts}'`);
+  }
+  return key;
+}
+
+export const SHARD_FILE_PREFIX = "attest-";
+export const SHARD_FILE_SUFFIX = ".sqlite";
+
+export function shardFileName(dayKey: string): string {
+  return `${SHARD_FILE_PREFIX}${dayKey}${SHARD_FILE_SUFFIX}`;
+}
+
+/** Extract the day key from a shard file name, or null if it is not a shard. */
+export function dayKeyFromFileName(name: string): string | null {
+  if (!name.startsWith(SHARD_FILE_PREFIX) || !name.endsWith(SHARD_FILE_SUFFIX)) return null;
+  const key = name.slice(SHARD_FILE_PREFIX.length, name.length - SHARD_FILE_SUFFIX.length);
+  return /^\d{4}-\d{2}-\d{2}$/.test(key) ? key : null;
+}
+
+/** DDL. Indexes back the four queries in tasks/P2.md. */
+export const DDL = `
+CREATE TABLE IF NOT EXISTS attestations (
+  attestationId TEXT PRIMARY KEY,
+  decisionId    TEXT NOT NULL,
+  agentId       TEXT NOT NULL,
+  schemaHash    TEXT NOT NULL,
+  decisionHash  TEXT NOT NULL,
+  prev          TEXT,
+  ts            TEXT NOT NULL,
+  leafType      TEXT NOT NULL,
+  bundlePath    TEXT NOT NULL
+);
+CREATE UNIQUE INDEX IF NOT EXISTS ux_decisionId       ON attestations(decisionId);
+CREATE INDEX        IF NOT EXISTS ix_agent_ts         ON attestations(agentId, ts, decisionId);
+CREATE INDEX        IF NOT EXISTS ix_agent_schema     ON attestations(agentId, schemaHash, ts, decisionId);
+CREATE INDEX        IF NOT EXISTS ix_agent_decisionId ON attestations(agentId, decisionId);
+CREATE INDEX        IF NOT EXISTS ix_agent_prev       ON attestations(agentId, prev);
+`;

package/src/shard.ts

@@ -0,0 +1,121 @@
+/**
+ * A single day-shard: one WAL-mode SQLite file with the four indexed queries
+ * from tasks/P2.md. `insert` is idempotent (keyed on attestationId), which is
+ * what makes backfill idempotent and the index rebuildable from bundles alone.
+ */
+import Database from "better-sqlite3";
+import { DDL, type IndexRow } from "./schema.js";
+
+export interface ShardOptions {
+  readonly?: boolean;
+}
+
+const INSERT_SQL = `
+INSERT INTO attestations
+  (attestationId, decisionId, agentId, schemaHash, decisionHash, prev, ts, leafType, bundlePath)
+VALUES
+  (@attestationId, @decisionId, @agentId, @schemaHash, @decisionHash, @prev, @ts, @leafType, @bundlePath)
+ON CONFLICT(attestationId) DO UPDATE SET
+  decisionId   = excluded.decisionId,
+  agentId      = excluded.agentId,
+  schemaHash   = excluded.schemaHash,
+  decisionHash = excluded.decisionHash,
+  prev         = excluded.prev,
+  ts           = excluded.ts,
+  leafType     = excluded.leafType,
+  bundlePath   = excluded.bundlePath
+`;
+
+export class Shard {
+  readonly db: Database.Database;
+  private readonly insertStmt: Database.Statement<[IndexRow]>;
+  private readonly byDecisionStmt: Database.Statement;
+  private readonly byAgentRangeStmt: Database.Statement;
+  private readonly byAgentSchemaStmt: Database.Statement;
+  private readonly chainHeadStmt: Database.Statement;
+  private readonly insertMany: Database.Transaction<(rows: IndexRow[]) => number>;
+
+  constructor(path: string, options: ShardOptions = {}) {
+    this.db = new Database(path, { readonly: options.readonly ?? false });
+    this.db.pragma("journal_mode = WAL");
+    this.db.pragma("synchronous = NORMAL");
+    if (!options.readonly) this.db.exec(DDL);
+
+    this.insertStmt = this.db.prepare(INSERT_SQL);
+    // ORDER BY ts, then decisionId as a stable tiebreak within a millisecond.
+    this.byDecisionStmt = this.db.prepare(
+      "SELECT * FROM attestations WHERE decisionId = ?",
+    );
+    this.byAgentRangeStmt = this.db.prepare(
+      "SELECT * FROM attestations WHERE agentId = ? AND ts >= ? AND ts <= ? ORDER BY ts, decisionId LIMIT ?",
+    );
+    this.byAgentSchemaStmt = this.db.prepare(
+      "SELECT * FROM attestations WHERE agentId = ? AND schemaHash = ? ORDER BY ts, decisionId LIMIT ?",
+    );
+    this.chainHeadStmt = this.db.prepare(
+      "SELECT * FROM attestations WHERE agentId = ? ORDER BY decisionId DESC LIMIT 1",
+    );
+    this.insertMany = this.db.transaction((rows: IndexRow[]) => {
+      for (const r of rows) this.insertStmt.run(r);
+      return rows.length;
+    });
+  }
+
+  /** Idempotent single-row upsert. */
+  insert(row: IndexRow): void {
+    this.insertStmt.run(row);
+  }
+
+  /** Idempotent bulk upsert in one transaction. Throws on any row error. */
+  insertBatch(rows: IndexRow[]): number {
+    return this.insertMany(rows);
+  }
+
+  /**
+   * Idempotent bulk upsert with per-row error isolation, in one transaction.
+   * A row that violates a constraint (e.g. a conflicting duplicate decisionId)
+   * is skipped and counted in `failed` — the good rows still commit. This is
+   * what keeps backfill robust: one bad bundle cannot roll back a whole shard.
+   */
+  insertResilient(rows: IndexRow[]): { written: number; failed: number } {
+    let written = 0;
+    let failed = 0;
+    const run = this.db.transaction((rs: IndexRow[]) => {
+      for (const r of rs) {
+        try {
+          this.insertStmt.run(r);
+          written++;
+        } catch {
+          failed++;
+        }
+      }
+    });
+    run(rows);
+    return { written, failed };
+  }
+
+  byDecisionId(decisionId: string): IndexRow | undefined {
+    return this.byDecisionStmt.get(decisionId) as IndexRow | undefined;
+  }
+
+  byAgentRange(agentId: string, fromTs: string, toTs: string, limit = -1): IndexRow[] {
+    return this.byAgentRangeStmt.all(agentId, fromTs, toTs, limit) as IndexRow[];
+  }
+
+  byAgentSchema(agentId: string, schemaHash: string, limit = -1): IndexRow[] {
+    return this.byAgentSchemaStmt.all(agentId, schemaHash, limit) as IndexRow[];
+  }
+
+  /** The chain tip for an agent: the latest decisionId (ULID is chronological). */
+  chainHead(agentId: string): IndexRow | undefined {
+    return this.chainHeadStmt.get(agentId) as IndexRow | undefined;
+  }
+
+  count(): number {
+    return (this.db.prepare("SELECT count(*) AS c FROM attestations").get() as { c: number }).c;
+  }
+
+  close(): void {
+    this.db.close();
+  }
+}

package/src/store.ts

@@ -0,0 +1,160 @@
+/**
+ * Index — a directory of day-shards (tasks/P2.md). Routes writes to the shard
+ * for a row's `ts` day, and fans the four queries out across shards, merging.
+ * Shard handles are opened lazily and cached.
+ */
+import { mkdirSync, readdirSync } from "node:fs";
+import { join } from "node:path";
+import { Shard } from "./shard.js";
+import {
+  dayKeyFromFileName,
+  shardFileName,
+  shardKeyForTs,
+  type IndexRow,
+} from "./schema.js";
+
+export interface IndexOptions {
+  readonly?: boolean;
+}
+
+export class Index {
+  private readonly dir: string;
+  private readonly readOnly: boolean;
+  private readonly shards = new Map<string, Shard>();
+  private dayCache: string[] | null = null;
+
+  constructor(dir: string, options: IndexOptions = {}) {
+    this.dir = dir;
+    this.readOnly = options.readonly ?? false;
+    if (!this.readOnly) mkdirSync(dir, { recursive: true });
+  }
+
+  /** Day keys with an existing shard file, ascending. Cached per instance. */
+  shardDays(): string[] {
+    if (this.dayCache) return this.dayCache;
+    let names: string[];
+    try {
+      names = readdirSync(this.dir);
+    } catch {
+      this.dayCache = [];
+      return this.dayCache;
+    }
+    this.dayCache = names
+      .map(dayKeyFromFileName)
+      .filter((k): k is string => k !== null)
+      .sort();
+    return this.dayCache;
+  }
+
+  private shardForDay(day: string, createIfMissing: boolean): Shard | undefined {
+    const cached = this.shards.get(day);
+    if (cached) return cached;
+    const exists = this.shardDays().includes(day);
+    // Readonly / query paths must not create a shard file that isn't there.
+    if (!exists && (this.readOnly || !createIfMissing)) return undefined;
+    const shard = new Shard(join(this.dir, shardFileName(day)), { readonly: this.readOnly });
+    this.shards.set(day, shard);
+    if (!exists && this.dayCache) {
+      this.dayCache.push(day);
+      this.dayCache.sort();
+    }
+    return shard;
+  }
+
+  /** Idempotent write, routed to the row's day shard. */
+  write(row: IndexRow): void {
+    const day = shardKeyForTs(row.ts);
+    const shard = this.shardForDay(day, true)!;
+    shard.insert(row);
+  }
+
+  /** Idempotent bulk write. Rows may span days; each is routed to its shard. */
+  writeBatch(rows: IndexRow[]): number {
+    let n = 0;
+    for (const [day, dayRows] of this.groupByDay(rows)) {
+      n += this.shardForDay(day, true)!.insertBatch(dayRows);
+    }
+    return n;
+  }
+
+  /**
+   * Idempotent bulk write with per-row error isolation (for backfill). A row
+   * that fails to insert (e.g. a conflicting duplicate decisionId) is counted
+   * in `failed` rather than aborting its shard. Rows must already have a valid
+   * day key (callers validate `ts` up front).
+   */
+  writeBatchResilient(rows: IndexRow[]): { written: number; failed: number } {
+    let written = 0;
+    let failed = 0;
+    for (const [day, dayRows] of this.groupByDay(rows)) {
+      const r = this.shardForDay(day, true)!.insertResilient(dayRows);
+      written += r.written;
+      failed += r.failed;
+    }
+    return { written, failed };
+  }
+
+  private groupByDay(rows: IndexRow[]): Map<string, IndexRow[]> {
+    const byDay = new Map<string, IndexRow[]>();
+    for (const r of rows) {
+      const day = shardKeyForTs(r.ts);
+      (byDay.get(day) ?? byDay.set(day, []).get(day)!).push(r);
+    }
+    return byDay;
+  }
+
+  private openShards(): Shard[] {
+    return this.shardDays()
+      .map((day) => this.shardForDay(day, false))
+      .filter((s): s is Shard => s !== undefined);
+  }
+
+  byDecisionId(decisionId: string): IndexRow | undefined {
+    for (const shard of this.openShards()) {
+      const row = shard.byDecisionId(decisionId);
+      if (row) return row;
+    }
+    return undefined;
+  }
+
+  byAgentRange(agentId: string, fromTs: string, toTs: string, limit = -1): IndexRow[] {
+    const fromDay = shardKeyForTs(fromTs);
+    const toDay = shardKeyForTs(toTs);
+    const rows: IndexRow[] = [];
+    for (const day of this.shardDays()) {
+      if (day < fromDay || day > toDay) continue;
+      const shard = this.shardForDay(day, false);
+      if (shard) rows.push(...shard.byAgentRange(agentId, fromTs, toTs, limit));
+    }
+    rows.sort((a, b) => (a.ts < b.ts ? -1 : a.ts > b.ts ? 1 : a.decisionId < b.decisionId ? -1 : 1));
+    return limit >= 0 ? rows.slice(0, limit) : rows;
+  }
+
+  byAgentSchema(agentId: string, schemaHash: string, limit = -1): IndexRow[] {
+    const rows: IndexRow[] = [];
+    for (const shard of this.openShards()) {
+      rows.push(...shard.byAgentSchema(agentId, schemaHash, limit));
+    }
+    rows.sort((a, b) => (a.ts < b.ts ? -1 : a.ts > b.ts ? 1 : a.decisionId < b.decisionId ? -1 : 1));
+    return limit >= 0 ? rows.slice(0, limit) : rows;
+  }
+
+  /** Global chain tip for an agent across all shards (max decisionId). */
+  chainHead(agentId: string): IndexRow | undefined {
+    let head: IndexRow | undefined;
+    for (const shard of this.openShards()) {
+      const h = shard.chainHead(agentId);
+      if (h && (!head || h.decisionId > head.decisionId)) head = h;
+    }
+    return head;
+  }
+
+  count(): number {
+    return this.openShards().reduce((n, s) => n + s.count(), 0);
+  }
+
+  close(): void {
+    for (const shard of this.shards.values()) shard.close();
+    this.shards.clear();
+  }
+}