@jigyasudham/veto 2.9.0 → 3.1.0

package/dist/transcripts/tokenize.js

@@ -0,0 +1,70 @@
+// Shared tokenizer — the single source of truth for the portable index.
+//
+// The one correctness property the whole search layer hangs on: index-time and
+// query-time tokenization are the SAME function. The FTS5 design broke this
+// subtly (toFtsQuery kept `foo/bar.ts` whole, FTS5's unicode61 re-split it
+// inside the quotes), which is why this file exists instead of two ad-hoc
+// paths. Property-tested in tests/transcripts/tokenize.test.ts: every token
+// emitted at index time finds its document when fed back as a query.
+//
+// No stemming — this corpus is identifiers, paths, and error strings, where
+// porter folding costs more than it buys (`E404` must survive intact).
+// Sub-token expansion (step 3 below) buys the recall stemming was buying.
+// Keep letters, digits, and the identifier/path glue chars; split on the rest.
+const SPLIT = /[^\p{L}\p{N}_\-./@+]+/u;
+// Sub-token boundaries inside a kept token: the glue chars…
+const SEP = /[_\-./@+]+/;
+// …and camelCase humps, detected before lowercasing.
+const CAMEL = /(?<=[\p{Ll}\p{N}])(?=\p{Lu})|(?<=\p{Lu})(?=\p{Lu}\p{Ll})/u;
+// Masked-secret residue and inline blobs: long pure-hex, or long base64-ish
+// runs that actually look like data (digits + mixed case or padding) rather
+// than a long camelCase identifier. They bloat postings and are never searched.
+const HEXY = /^[0-9a-fA-F]{32,}$/;
+const B64_CHARS = /^[A-Za-z0-9+/=]{32,}$/;
+function isBlob(tok) {
+    if (tok.length > 64)
+        return true;
+    if (HEXY.test(tok))
+        return true;
+    return B64_CHARS.test(tok) && /\d/.test(tok) && (/[+/=]/.test(tok) || (/[a-z]/.test(tok) && /[A-Z]/.test(tok)));
+}
+/** Sub-token expansion on by default; the ingest benchmark measures both ways. */
+export const SUBTOKENS_DEFAULT = true;
+/**
+ * Tokenize text for indexing or querying — always the same function.
+ *
+ * 1. Split on anything that is not a letter, digit, or `_ - . / @ +`.
+ * 2. Emit each token lowercased.
+ * 3. When it looks compound, also emit its lowercased sub-tokens:
+ *    `normalizeProjectDir` → normalizeprojectdir, normalize, project, dir;
+ *    `src/transcripts/search.ts` → the full path, src, transcripts, search, ts.
+ * 4. Drop blobs (see isBlob) and tokens with no letter or digit at all.
+ */
+export function tokenize(text, subtokens = SUBTOKENS_DEFAULT) {
+    const out = [];
+    for (const raw of text.split(SPLIT)) {
+        if (!raw || !/[\p{L}\p{N}]/u.test(raw) || isBlob(raw))
+            continue;
+        const whole = raw.toLowerCase();
+        out.push(whole);
+        if (!subtokens)
+            continue;
+        // Two granularities, both emitted: separator segments AND their camel
+        // parts. Needed for symmetry — a lowercased emitted token re-splits by
+        // separators only (its camel humps are gone), so those segment-level
+        // tokens must exist in the index too.
+        for (const seg of raw.split(SEP)) {
+            const s = seg.toLowerCase();
+            const ok = (t) => t && /[\p{L}\p{N}]/u.test(t) && !isBlob(t);
+            if (s !== whole && ok(s))
+                out.push(s);
+            for (const part of seg.split(CAMEL)) {
+                const p = part.toLowerCase();
+                if (p !== s && p !== whole && ok(p))
+                    out.push(p);
+            }
+        }
+    }
+    return out;
+}
+//# sourceMappingURL=tokenize.js.map

package/dist/transcripts/tokenize.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tokenize.js","sourceRoot":"","sources":["../../src/transcripts/tokenize.ts"],"names":[],"mappings":"AAAA,wEAAwE;AACxE,EAAE;AACF,+EAA+E;AAC/E,4EAA4E;AAC5E,2EAA2E;AAC3E,0EAA0E;AAC1E,4EAA4E;AAC5E,qEAAqE;AACrE,EAAE;AACF,4EAA4E;AAC5E,uEAAuE;AACvE,0EAA0E;AAE1E,+EAA+E;AAC/E,MAAM,KAAK,GAAG,wBAAwB,CAAC;AACvC,4DAA4D;AAC5D,MAAM,GAAG,GAAG,YAAY,CAAC;AACzB,qDAAqD;AACrD,MAAM,KAAK,GAAG,2DAA2D,CAAC;AAE1E,4EAA4E;AAC5E,4EAA4E;AAC5E,gFAAgF;AAChF,MAAM,IAAI,GAAG,oBAAoB,CAAC;AAClC,MAAM,SAAS,GAAG,uBAAuB,CAAC;AAE1C,SAAS,MAAM,CAAC,GAAW;IACzB,IAAI,GAAG,CAAC,MAAM,GAAG,EAAE;QAAE,OAAO,IAAI,CAAC;IACjC,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAChC,OAAO,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAClH,CAAC;AAED,kFAAkF;AAClF,MAAM,CAAC,MAAM,iBAAiB,GAAG,IAAI,CAAC;AAEtC;;;;;;;;;GASG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY,EAAE,YAAqB,iBAAiB;IAC3E,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QACpC,IAAI,CAAC,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC;YAAE,SAAS;QAChE,MAAM,KAAK,GAAG,GAAG,CAAC,WAAW,EAAE,CAAC;QAChC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChB,IAAI,CAAC,SAAS;YAAE,SAAS;QACzB,sEAAsE;QACtE,uEAAuE;QACvE,qEAAqE;QACrE,sCAAsC;QACtC,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YACjC,MAAM,CAAC,GAAG,GAAG,CAAC,WAAW,EAAE,CAAC;YAC5B,MAAM,EAAE,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,IAAI,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACrE,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACtC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;gBAC7B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC;oBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/transcripts/vectors.d.ts

@@ -0,0 +1,40 @@
+export type EmbedStatus = 'embedded' | 'already_embedded' | 'unavailable' | 'not_found' | 'error';
+export type EmbedResult = {
+    status: EmbedStatus;
+    docs?: number;
+    chunks?: number;
+    reason?: string;
+};
+/** Read a stored row back into signed values for scoring. */
+export declare function dequantizeToInt8(bytes: Uint8Array): Int8Array;
+/**
+ * Build chunk vectors for one archive's indexed docs. Idempotent, and a no-op
+ * when the model is not installed — the caller degrades to BM25 rather than
+ * failing (condition A2).
+ */
+export declare function embedArchive(archiveId: string): EmbedResult;
+/** `chunkIndex` is the window that won — used only to aim a snippet at the
+ *  right part of a long event. Chunks never surface as results (C6). */
+export type VectorHit = {
+    docId: number;
+    chunkIndex: number;
+    score: number;
+};
+/**
+ * Score every stored chunk against `query` and return the best score per doc.
+ *
+ * Max-sim, not mean: an event is relevant if ANY of its windows is, which is
+ * the entire point of chunking. Dedup to docs happens here so nothing outside
+ * this module ever sees a chunk (C6).
+ */
+export declare function searchVectors(query: string, opts?: {
+    projectDir?: string;
+    sourceSessionId?: string;
+    limit?: number;
+}): VectorHit[];
+/** Rows currently stored, for budget measurement and tests. */
+export declare function vectorStats(): {
+    chunks: number;
+    bytes: number;
+};
+//# sourceMappingURL=vectors.d.ts.map

package/dist/transcripts/vectors.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"vectors.d.ts","sourceRoot":"","sources":["../../src/transcripts/vectors.ts"],"names":[],"mappings":"AAoBA,MAAM,MAAM,WAAW,GAAG,UAAU,GAAG,kBAAkB,GAAG,aAAa,GAAG,WAAW,GAAG,OAAO,CAAC;AAClG,MAAM,MAAM,WAAW,GAAG;IAAE,MAAM,EAAE,WAAW,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC;AA2BnG,6DAA6D;AAC7D,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,UAAU,GAAG,SAAS,CAE7D;AAMD;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,SAAS,EAAE,MAAM,GAAG,WAAW,CAuD3D;AAED;wEACwE;AACxE,MAAM,MAAM,SAAS,GAAG;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC;AAE7E;;;;;;GAMG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,MAAM,EACb,IAAI,GAAE;IAAE,UAAU,CAAC,EAAE,MAAM,CAAC;IAAC,eAAe,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAO,GAC3E,SAAS,EAAE,CAgFb;AAED,+DAA+D;AAC/D,wBAAgB,WAAW,IAAI;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAM/D"}

package/dist/transcripts/vectors.js

@@ -0,0 +1,203 @@
+// Chunk vectors: build, store, and query (VERSION-3 item 6, Phase B).
+//
+// Separated from embed.ts on purpose — that file is pure inference against a
+// pinned contract, this one owns storage and lifecycle. It is also separate
+// from ingest.ts: parsing must never depend on the model being installed, so
+// vectors have their own marker (`archives.chunker_version` + `embed_model`)
+// and are backfilled lazily. Installing the model later costs an embed pass,
+// not a re-parse; removing it leaves search working on BM25 alone.
+//
+// Quantization note: cosine similarity is invariant to a positive per-vector
+// scalar, so the dequantization scale cancels and is never stored. What IS
+// stored is the int8 vector's own L2 norm, so scoring is a dot product and a
+// divide.
+import { getTranscriptsDb } from './store.js';
+import { EMPTY_SCORE, getDocCache, getVectorCache, resetCaches, scopeMask, scoreScratch } from './cache.js';
+import { CHUNKER_VERSION, chunkText } from './chunk.js';
+import { embed, embeddingsAvailable, modelProvenance } from './embed.js';
+/** Identifies which model produced stored vectors; a change forces a rebuild. */
+function modelTag() {
+    const { model_id, revision } = modelProvenance();
+    return `${model_id}@${revision}`;
+}
+/** Per-vector symmetric int8. The scale is deliberately discarded (see above). */
+function quantize(vec) {
+    let max = 0;
+    for (const v of vec) {
+        const a = Math.abs(v);
+        if (a > max)
+            max = a;
+    }
+    const scale = max === 0 ? 1 : max / 127;
+    const bytes = new Uint8Array(vec.length);
+    let sumSq = 0;
+    for (let i = 0; i < vec.length; i += 1) {
+        let q = Math.round(vec[i] / scale);
+        if (q > 127)
+            q = 127;
+        if (q < -127)
+            q = -127;
+        sumSq += q * q;
+        // Int8 stored in a byte: two's complement, unpacked on read.
+        bytes[i] = q < 0 ? q + 256 : q;
+    }
+    return { bytes, norm: Math.sqrt(sumSq) };
+}
+/** Read a stored row back into signed values for scoring. */
+export function dequantizeToInt8(bytes) {
+    return new Int8Array(bytes.buffer, bytes.byteOffset, bytes.byteLength);
+}
+function needsEmbedding(row, tag) {
+    return row.chunker_version !== CHUNKER_VERSION || row.embed_model !== tag;
+}
+/**
+ * Build chunk vectors for one archive's indexed docs. Idempotent, and a no-op
+ * when the model is not installed — the caller degrades to BM25 rather than
+ * failing (condition A2).
+ */
+export function embedArchive(archiveId) {
+    try {
+        if (!embeddingsAvailable())
+            return { status: 'unavailable' };
+        const db = getTranscriptsDb();
+        const row = db.prepare(`SELECT * FROM archives WHERE id = ?`).get(archiveId);
+        if (!row)
+            return { status: 'not_found' };
+        const tag = modelTag();
+        if (!needsEmbedding(row, tag))
+            return { status: 'already_embedded' };
+        // Only indexed, searchable docs get vectors — the same set BM25 covers,
+        // read with their masked text (C3: masked text is the only text there is).
+        const docs = db.prepare(`SELECT d.id AS doc_id, e.text AS text
+         FROM search_docs d JOIN events e ON e.id = d.event_id
+        WHERE d.archive_id = ?`).all(archiveId);
+        const insVec = db.prepare(`INSERT INTO search_vectors (doc_id, chunk_index, vec, norm) VALUES (?, ?, ?, ?)`);
+        let chunks = 0;
+        db.exec('BEGIN');
+        try {
+            db.prepare(`DELETE FROM search_vectors WHERE doc_id IN (SELECT id FROM search_docs WHERE archive_id = ?)`).run(archiveId);
+            for (const d of docs) {
+                const text = d.text ?? '';
+                if (!text.trim())
+                    continue;
+                for (const c of chunkText(text)) {
+                    const { bytes, norm } = quantize(embed(c.text));
+                    // A zero-norm chunk (no in-vocabulary tokens) can never win a cosine
+                    // and would divide by zero at query time; storing it is pure cost.
+                    if (norm === 0)
+                        continue;
+                    insVec.run(d.doc_id, c.index, bytes, norm);
+                    chunks += 1;
+                }
+            }
+            db.prepare(`UPDATE archives SET chunker_version = ?, embed_model = ? WHERE id = ?`)
+                .run(CHUNKER_VERSION, tag, archiveId);
+            db.exec('COMMIT');
+            resetCaches();
+        }
+        catch (e) {
+            db.exec('ROLLBACK');
+            throw e;
+        }
+        return { status: 'embedded', docs: docs.length, chunks };
+    }
+    catch (e) {
+        return { status: 'error', reason: e instanceof Error ? e.message : String(e) };
+    }
+}
+/**
+ * Score every stored chunk against `query` and return the best score per doc.
+ *
+ * Max-sim, not mean: an event is relevant if ANY of its windows is, which is
+ * the entire point of chunking. Dedup to docs happens here so nothing outside
+ * this module ever sees a chunk (C6).
+ */
+export function searchVectors(query, opts = {}) {
+    if (!embeddingsAvailable())
+        return [];
+    const db = getTranscriptsDb();
+    const qv = embed(query);
+    let qNorm = 0;
+    for (const v of qv)
+        qNorm += v * v;
+    qNorm = Math.sqrt(qNorm);
+    if (qNorm === 0)
+        return [];
+    // Brute-force scan, but over a cached flat Int8Array rather than freshly
+    // materialized rows. Measured at 27,070 chunks: the arithmetic is ~12 ms and
+    // the SQL/Buffer marshalling it replaces was ~60 ms, every query. A full
+    // scan is still the right algorithm — it cannot lose recall the way ANN
+    // would — it just must not re-read the table each time.
+    const cache = getVectorCache();
+    if (cache.count === 0 || cache.dim !== qv.length)
+        return [];
+    const docs = getDocCache();
+    const mask = scopeMask(docs, opts);
+    const { data, norms, docIds, chunkIdx, dim } = cache;
+    // Best-per-document is accumulated in flat arrays indexed by doc id, not a
+    // Map. At 108k chunks the Map get/set pair was a six-figure allocation-heavy
+    // operation count on the hot path; this is two typed-array writes. `touched`
+    // records which ids were written so the result scan stays proportional to
+    // matches rather than to the id space.
+    const { score: bestScore, chunk: bestChunk } = scoreScratch(docs.maxId);
+    const touched = [];
+    // Single pass, full dot product per in-scope chunk.
+    //
+    // A two-pass scheme was tried and MEASURED SLOWER (170 ms vs 131 ms at 108k
+    // chunks): score a PCA prefix, bound the tail by Cauchy-Schwarz, skip chunks
+    // whose best possible score cannot reach the cutoff. It is exact, but the
+    // bound is far too loose here — the tail retains enough norm that almost
+    // nothing prunes, so it paid for the prefix and the bookkeeping and skipped
+    // little. Recorded so it is not re-attempted on intuition.
+    const limit = Math.min(Math.max(opts.limit ?? 10, 1), 50);
+    for (let c = 0; c < cache.count; c += 1) {
+        const docId = docIds[c];
+        if (mask && mask[docId] !== 1)
+            continue;
+        const norm = norms[c];
+        if (norm === 0)
+            continue;
+        const base = c * dim;
+        // Unrolled by 8. Separate accumulations, not one chained sum: `dot +=
+        // a+b+...+h` would add the eight products together first and change the
+        // summation order.
+        let dot = 0;
+        let i = 0;
+        for (; i + 8 <= dim; i += 8) {
+            const b = base + i;
+            dot += qv[i] * data[b];
+            dot += qv[i + 1] * data[b + 1];
+            dot += qv[i + 2] * data[b + 2];
+            dot += qv[i + 3] * data[b + 3];
+            dot += qv[i + 4] * data[b + 4];
+            dot += qv[i + 5] * data[b + 5];
+            dot += qv[i + 6] * data[b + 6];
+            dot += qv[i + 7] * data[b + 7];
+        }
+        for (; i < dim; i += 1)
+            dot += qv[i] * data[base + i];
+        const score = dot / (qNorm * norm);
+        if (score > bestScore[docId]) {
+            if (bestScore[docId] === EMPTY_SCORE)
+                touched.push(docId);
+            bestScore[docId] = score;
+            bestChunk[docId] = chunkIdx[c];
+        }
+    }
+    const out = touched
+        .map(docId => ({ docId, chunkIndex: bestChunk[docId], score: bestScore[docId] }))
+        .sort((a, b) => b.score - a.score)
+        .slice(0, limit);
+    // The scratch buffers are shared and handed back dirty; clear exactly what
+    // was written so the next query sees a clean slate without a full zero-fill.
+    for (const docId of touched)
+        bestScore[docId] = EMPTY_SCORE;
+    return out;
+}
+/** Rows currently stored, for budget measurement and tests. */
+export function vectorStats() {
+    const db = getTranscriptsDb();
+    const r = db.prepare(`SELECT COUNT(*) AS chunks, COALESCE(SUM(LENGTH(vec)), 0) AS bytes FROM search_vectors`).get();
+    return { chunks: Number(r.chunks), bytes: Number(r.bytes) };
+}
+//# sourceMappingURL=vectors.js.map

package/dist/transcripts/vectors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vectors.js","sourceRoot":"","sources":["../../src/transcripts/vectors.ts"],"names":[],"mappings":"AAAA,sEAAsE;AACtE,EAAE;AACF,6EAA6E;AAC7E,4EAA4E;AAC5E,6EAA6E;AAC7E,6EAA6E;AAC7E,6EAA6E;AAC7E,mEAAmE;AACnE,EAAE;AACF,6EAA6E;AAC7E,2EAA2E;AAC3E,6EAA6E;AAC7E,UAAU;AAEV,OAAO,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAC9C,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,cAAc,EAAE,WAAW,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAC5G,OAAO,EAAE,eAAe,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AACxD,OAAO,EAAE,KAAK,EAAE,mBAAmB,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAMzE,iFAAiF;AACjF,SAAS,QAAQ;IACf,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,eAAe,EAAE,CAAC;IACjD,OAAO,GAAG,QAAQ,IAAI,QAAQ,EAAE,CAAC;AACnC,CAAC;AAED,kFAAkF;AAClF,SAAS,QAAQ,CAAC,GAAiB;IACjC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QAAC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAAC,IAAI,CAAC,GAAG,GAAG;YAAE,GAAG,GAAG,CAAC,CAAC;IAAC,CAAC;IACrE,MAAM,KAAK,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC;IAExC,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACzC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACvC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC,CAAC;QACpC,IAAI,CAAC,GAAG,GAAG;YAAE,CAAC,GAAG,GAAG,CAAC;QACrB,IAAI,CAAC,GAAG,CAAC,GAAG;YAAE,CAAC,GAAG,CAAC,GAAG,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC;QACf,6DAA6D;QAC7D,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;AAC3C,CAAC;AAED,6DAA6D;AAC7D,MAAM,UAAU,gBAAgB,CAAC,KAAiB;IAChD,OAAO,IAAI,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;AACzE,CAAC;AAED,SAAS,cAAc,CAAC,GAAe,EAAE,GAAW;IAClD,OAAO,GAAG,CAAC,eAAe,KAAK,eAAe,IAAI,GAAG,CAAC,WAAW,KAAK,GAAG,CAAC;AAC5E,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,SAAiB;IAC5C,IAAI,CAAC;QACH,IAAI,CAAC,mBAAmB,EAAE;YAAE,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;QAC7D,MAAM,EAAE,GAAG,gBAAgB,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,qCAAqC,CAAC,CAAC,GAAG,CAAC,SAAS,CAA2B,CAAC;QACvG,IAAI,CAAC,GAAG;YAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;QAEzC,MAAM,GAAG,GAAG,QAAQ,EAAE,CAAC;QACvB,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC;YAAE,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAE,CAAC;QAErE,wEAAwE;QACxE,2EAA2E;QAC3E,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CACrB;;+BAEyB,CAC1B,CAAC,GAAG,CAAC,SAAS,CAA8C,CAAC;QAE9D,MAAM,MAAM,GAAG,EAAE,CAAC,OAAO,CACvB,iFAAiF,CAClF,CAAC;QAEF,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACjB,IAAI,CAAC;YACH,EAAE,CAAC,OAAO,CACR,8FAA8F,CAC/F,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAEjB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC;gBAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;oBAAE,SAAS;gBAC3B,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;oBAChC,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;oBAChD,qEAAqE;oBACrE,mEAAmE;oBACnE,IAAI,IAAI,KAAK,CAAC;wBAAE,SAAS;oBACzB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;oBAC3C,MAAM,IAAI,CAAC,CAAC;gBACd,CAAC;YACH,CAAC;YAED,EAAE,CAAC,OAAO,CAAC,uEAAuE,CAAC;iBAChF,GAAG,CAAC,eAAe,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;YACxC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAClB,WAAW,EAAE,CAAC;QAChB,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACpB,MAAM,CAAC,CAAC;QACV,CAAC;QAED,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC;IAC3D,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;IACjF,CAAC;AACH,CAAC;AAMD;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAC3B,KAAa,EACb,OAA0E,EAAE;IAE5E,IAAI,CAAC,mBAAmB,EAAE;QAAE,OAAO,EAAE,CAAC;IACtC,MAAM,EAAE,GAAG,gBAAgB,EAAE,CAAC;IAE9B,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;IACxB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,EAAE;QAAE,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC;IACnC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzB,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAE3B,yEAAyE;IACzE,6EAA6E;IAC7E,yEAAyE;IACzE,wEAAwE;IACxE,wDAAwD;IACxD,MAAM,KAAK,GAAG,cAAc,EAAE,CAAC;IAC/B,IAAI,KAAK,CAAC,KAAK,KAAK,CAAC,IAAI,KAAK,CAAC,GAAG,KAAK,EAAE,CAAC,MAAM;QAAE,OAAO,EAAE,CAAC;IAC5D,MAAM,IAAI,GAAG,WAAW,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAEnC,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,KAAK,CAAC;IAErD,2EAA2E;IAC3E,6EAA6E;IAC7E,6EAA6E;IAC7E,0EAA0E;IAC1E,uCAAuC;IACvC,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxE,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,oDAAoD;IACpD,EAAE;IACF,4EAA4E;IAC5E,6EAA6E;IAC7E,0EAA0E;IAC1E,yEAAyE;IACzE,4EAA4E;IAC5E,2DAA2D;IAC3D,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAE1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;QACzB,IAAI,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;YAAE,SAAS;QACxC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QACvB,IAAI,IAAI,KAAK,CAAC;YAAE,SAAS;QACzB,MAAM,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC;QACrB,sEAAsE;QACtE,wEAAwE;QACxE,mBAAmB;QACnB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;YACnB,GAAG,IAAI,EAAE,CAAC,CAAC,CAAE,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;YACzB,GAAG,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;YACjC,GAAG,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;YACjC,GAAG,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;YACjC,GAAG,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;YACjC,GAAG,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;YACjC,GAAG,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;YACjC,GAAG,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;QACnC,CAAC;QACD,OAAO,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC;YAAE,GAAG,IAAI,EAAE,CAAC,CAAC,CAAE,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,CAAE,CAAC;QACxD,MAAM,KAAK,GAAG,GAAG,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;QACnC,IAAI,KAAK,GAAG,SAAS,CAAC,KAAK,CAAE,EAAE,CAAC;YAC9B,IAAI,SAAS,CAAC,KAAK,CAAC,KAAK,WAAW;gBAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1D,SAAS,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;YACzB,SAAS,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAC;QAClC,CAAC;IACH,CAAC;IAED,MAAM,GAAG,GAAG,OAAO;SAChB,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,SAAS,CAAC,KAAK,CAAE,EAAE,KAAK,EAAE,SAAS,CAAC,KAAK,CAAE,EAAE,CAAC,CAAC;SAClF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;SACjC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAEnB,2EAA2E;IAC3E,6EAA6E;IAC7E,KAAK,MAAM,KAAK,IAAI,OAAO;QAAE,SAAS,CAAC,KAAK,CAAC,GAAG,WAAW,CAAC;IAC5D,OAAO,GAAG,CAAC;AACb,CAAC;AAED,+DAA+D;AAC/D,MAAM,UAAU,WAAW;IACzB,MAAM,EAAE,GAAG,gBAAgB,EAAE,CAAC;IAC9B,MAAM,CAAC,GAAG,EAAE,CAAC,OAAO,CAClB,uFAAuF,CACxF,CAAC,GAAG,EAAuC,CAAC;IAC7C,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;AAC9D,CAAC"}

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@jigyasudham/veto",
   "mcpName": "io.github.jigyasudham/veto",
-  "version": "2.9.0",
+  "version": "3.1.0",
   "description": "93 agentic tools. 49 specialists. Every major AI CLI. Self-learning. Zero extra cost on subscriptions.",
   "keywords": [
     "mcp",
@@ -26,7 +26,7 @@
   "license": "MIT",
   "type": "module",
   "engines": {
-    "node": ">=22.5.0"
+    "node": ">=22.13.0 <23.0.0 || >=23.4.0"
   },
   "bin": {
     "veto": "dist/cli.js",
@@ -48,6 +48,7 @@
     "test:coverage": "vitest run --coverage"
   },
   "dependencies": {
+    "@jigyasudham/veto-model": "1.0.0",
     "@modelcontextprotocol/sdk": "^1.0.0",
     "web-tree-sitter": "^0.26.9",
     "zod": "^4.4.3"

package/server.json

@@ -8,13 +8,13 @@
     "source": "github"
   },
   "websiteUrl": "https://github.com/jigyasudham/veto#readme",
-  "version": "2.9.0",
+  "version": "3.1.0",
   "packages": [
     {
       "registryType": "npm",
       "registryBaseUrl": "https://registry.npmjs.org",
       "identifier": "@jigyasudham/veto",
-      "version": "2.9.0",
+      "version": "3.1.0",
       "transport": {
         "type": "stdio"
       }