@codacy/verity-cli 0.34.3 → 0.34.4

package/bin/verity.js

@@ -2928,7 +2928,7 @@ Expecting one of '${allowedValues.join("', '")}'`);
        * @param {(string | Function)} text - string to add, or a function returning a string
        * @return {Command} `this` command for chaining
        */
-      addHelpText(position, text) {
+      addHelpText(position, text2) {
         const allowedValues = ["beforeAll", "before", "after", "afterAll"];
         if (!allowedValues.includes(position)) {
           throw new Error(`Unexpected value for position to addHelpText.
@@ -2937,10 +2937,10 @@ Expecting one of '${allowedValues.join("', '")}'`);
         const helpEvent = `${position}Help`;
         this.on(helpEvent, (context) => {
           let helpStr;
-          if (typeof text === "function") {
-            helpStr = text({ error: context.error, command: context.command });
+          if (typeof text2 === "function") {
+            helpStr = text2({ error: context.error, command: context.command });
           } else {
-            helpStr = text;
+            helpStr = text2;
           }
           if (helpStr) {
             context.write(`${helpStr}
@@ -3982,14 +3982,14 @@ var require_foldFlowLines = __commonJS2({
     var FOLD_FLOW = "flow";
     var FOLD_BLOCK = "block";
     var FOLD_QUOTED = "quoted";
-    function foldFlowLines(text, indent, mode2 = "flow", { indentAtStart, lineWidth = 80, minContentWidth = 20, onFold, onOverflow } = {}) {
+    function foldFlowLines(text2, indent, mode2 = "flow", { indentAtStart, lineWidth = 80, minContentWidth = 20, onFold, onOverflow } = {}) {
       if (!lineWidth || lineWidth < 0)
-        return text;
+        return text2;
       if (lineWidth < minContentWidth)
         minContentWidth = 0;
       const endStep = Math.max(1 + minContentWidth, 1 + lineWidth - indent.length);
-      if (text.length <= endStep)
-        return text;
+      if (text2.length <= endStep)
+        return text2;
       const folds = [];
       const escapedFolds = {};
       let end = lineWidth - indent.length;
@@ -4006,14 +4006,14 @@ var require_foldFlowLines = __commonJS2({
       let escStart = -1;
       let escEnd = -1;
       if (mode2 === FOLD_BLOCK) {
-        i2 = consumeMoreIndentedLines(text, i2, indent.length);
+        i2 = consumeMoreIndentedLines(text2, i2, indent.length);
         if (i2 !== -1)
           end = i2 + endStep;
       }
-      for (let ch; ch = text[i2 += 1]; ) {
+      for (let ch; ch = text2[i2 += 1]; ) {
         if (mode2 === FOLD_QUOTED && ch === "\\") {
           escStart = i2;
-          switch (text[i2 + 1]) {
+          switch (text2[i2 + 1]) {
             case "x":
               i2 += 3;
               break;
@@ -4030,12 +4030,12 @@ var require_foldFlowLines = __commonJS2({
         }
         if (ch === "\n") {
           if (mode2 === FOLD_BLOCK)
-            i2 = consumeMoreIndentedLines(text, i2, indent.length);
+            i2 = consumeMoreIndentedLines(text2, i2, indent.length);
           end = i2 + indent.length + endStep;
           split = void 0;
         } else {
           if (ch === " " && prev && prev !== " " && prev !== "\n" && prev !== "	") {
-            const next = text[i2 + 1];
+            const next = text2[i2 + 1];
             if (next && next !== " " && next !== "\n" && next !== "	")
               split = i2;
           }
@@ -4047,12 +4047,12 @@ var require_foldFlowLines = __commonJS2({
             } else if (mode2 === FOLD_QUOTED) {
               while (prev === " " || prev === "	") {
                 prev = ch;
-                ch = text[i2 += 1];
+                ch = text2[i2 += 1];
                 overflow = true;
               }
               const j = i2 > escEnd + 1 ? i2 - 2 : escStart - 1;
               if (escapedFolds[j])
-                return text;
+                return text2;
               folds.push(j);
               escapedFolds[j] = true;
               end = j + endStep;
@@ -4067,39 +4067,39 @@ var require_foldFlowLines = __commonJS2({
       if (overflow && onOverflow)
         onOverflow();
       if (folds.length === 0)
-        return text;
+        return text2;
       if (onFold)
         onFold();
-      let res = text.slice(0, folds[0]);
+      let res = text2.slice(0, folds[0]);
       for (let i3 = 0; i3 < folds.length; ++i3) {
         const fold2 = folds[i3];
-        const end2 = folds[i3 + 1] || text.length;
+        const end2 = folds[i3 + 1] || text2.length;
         if (fold2 === 0)
           res = `
-${indent}${text.slice(0, end2)}`;
+${indent}${text2.slice(0, end2)}`;
         else {
           if (mode2 === FOLD_QUOTED && escapedFolds[fold2])
-            res += `${text[fold2]}\\`;
+            res += `${text2[fold2]}\\`;
           res += `
-${indent}${text.slice(fold2 + 1, end2)}`;
+${indent}${text2.slice(fold2 + 1, end2)}`;
         }
       }
       return res;
     }
-    function consumeMoreIndentedLines(text, i2, indent) {
+    function consumeMoreIndentedLines(text2, i2, indent) {
       let end = i2;
       let start2 = i2 + 1;
-      let ch = text[start2];
+      let ch = text2[start2];
       while (ch === " " || ch === "	") {
         if (i2 < start2 + indent) {
-          ch = text[++i2];
+          ch = text2[++i2];
         } else {
           do {
-            ch = text[++i2];
+            ch = text2[++i2];
           } while (ch && ch !== "\n");
           end = i2;
           start2 = i2 + 1;
-          ch = text[start2];
+          ch = text2[start2];
         }
       }
       return end;
@@ -13882,11 +13882,11 @@ ${JSON.stringify(symbolNames, null, 2)}`);
         for (const c of captures) {
           if (c.name === captureName) nodes.push(c.node.text);
         }
-        const test = /* @__PURE__ */ __name((text, positive) => {
-          return positive ? regex.test(text) : !regex.test(text);
+        const test = /* @__PURE__ */ __name((text2, positive) => {
+          return positive ? regex.test(text2) : !regex.test(text2);
         }, "test");
         if (nodes.length === 0) return !isPositive;
-        return matchAll2 ? nodes.every((text) => test(text, isPositive)) : nodes.some((text) => test(text, isPositive));
+        return matchAll2 ? nodes.every((text2) => test(text2, isPositive)) : nodes.some((text2) => test(text2, isPositive));
       });
     }
     __name(parseMatchPredicate, "parseMatchPredicate");
@@ -13916,7 +13916,7 @@ ${JSON.stringify(symbolNames, null, 2)}`);
           if (c.name === captureName) nodes.push(c.node.text);
         }
         if (nodes.length === 0) return !isPositive;
-        return nodes.every((text) => values.includes(text)) === isPositive;
+        return nodes.every((text2) => values.includes(text2)) === isPositive;
       });
     }
     __name(parseAnyOfPredicate, "parseAnyOfPredicate");
@@ -15712,11 +15712,11 @@ function startSpinner(label2, opts = {}) {
     },
     succeed(message) {
       finish(() => {
-        const text = message ?? current;
+        const text2 = message ?? current;
         const clock = showElapsed ? ` (${secondsSince(start2)})` : "";
         stream.write(
-          color ? `  ${GREEN2}\u2713${RESET} ${text}${DIM2}${clock}${RESET}
-` : `  \u2713 ${text}${clock}
+          color ? `  ${GREEN2}\u2713${RESET} ${text2}${DIM2}${clock}${RESET}
+` : `  \u2713 ${text2}${clock}
 `
         );
       });
@@ -17444,13 +17444,13 @@ function scrub(s) {
 var installed = false;
 var wroteBanner = false;
 var banner = "";
-function append(text) {
+function append(text2) {
   try {
     const dir = projectPath(DEBUG_LOG_DIR);
     const file = projectPath(STDERR_LOG_FILE);
     (0, import_node_fs9.mkdirSync)(dir, { recursive: true });
     rotateIfNeeded(file);
-    (0, import_node_fs9.appendFileSync)(file, text);
+    (0, import_node_fs9.appendFileSync)(file, text2);
   } catch {
   }
 }
@@ -17472,19 +17472,19 @@ function installStderrLog(cmd, argv, version) {
     const result = original(...args2);
     try {
       const chunk = args2[0];
-      const text = typeof chunk === "string" ? chunk : Buffer.isBuffer(chunk) ? chunk.toString("utf-8") : String(chunk);
+      const text2 = typeof chunk === "string" ? chunk : Buffer.isBuffer(chunk) ? chunk.toString("utf-8") : String(chunk);
       ensureBanner();
-      append(scrub(text));
+      append(scrub(text2));
     } catch {
     }
     return result;
   };
   process.stderr.write = tee;
 }
-function logToFileOnly(text) {
+function logToFileOnly(text2) {
   if (!installed) return;
   ensureBanner();
-  append(text.endsWith("\n") ? text : `${text}
+  append(text2.endsWith("\n") ? text2 : `${text2}
 `);
 }
 
@@ -18055,8 +18055,8 @@ var import_promises5 = require("node:fs/promises");
 var import_node_fs12 = require("node:fs");
 var import_node_child_process6 = require("node:child_process");
 var import_node_crypto2 = require("node:crypto");
-function stripImageReferences(text) {
-  return text.replace(/\[Image #\d+\]/g, "[screenshot \u2014 not available for review]");
+function stripImageReferences(text2) {
+  return text2.replace(/\[Image #\d+\]/g, "[screenshot \u2014 not available for review]");
 }
 function bufferTmpPath() {
   return `${CONVERSATION_BUFFER_FILE}.${process.pid}.${(0, import_node_crypto2.randomBytes)(4).toString("hex")}.tmp`;
@@ -18922,9 +18922,9 @@ var STOPWORDS = /* @__PURE__ */ new Set([
   "within",
   "without"
 ]);
-function tokenize(text) {
+function tokenize(text2) {
   return new Set(
-    text.toLowerCase().replace(/[^a-z0-9\s]/g, " ").split(/\s+/).filter((w) => w.length > 2 && !STOPWORDS.has(w))
+    text2.toLowerCase().replace(/[^a-z0-9\s]/g, " ").split(/\s+/).filter((w) => w.length > 2 && !STOPWORDS.has(w))
   );
 }
 function jaccardKeywords(a, b) {
@@ -19001,9 +19001,9 @@ var MAX_BUDGET_TOKENS = 4e3;
 var MAX_NODE_FILE_BYTES = 64 * 1024;
 var MIN_SCORE = RELEVANCE_FLOOR * 0.5;
 var ORG_MIN_SHARED_TERMS = 2;
-function orgTerms(text) {
+function orgTerms(text2) {
   return new Set(
-    text.toLowerCase().replace(/[^a-z0-9\s]/g, " ").split(/\s+/).filter((w) => w.length > 2)
+    text2.toLowerCase().replace(/[^a-z0-9\s]/g, " ").split(/\s+/).filter((w) => w.length > 2)
   );
 }
 function sharedTerms(a, b) {
@@ -19286,15 +19286,15 @@ function runHook(hooks) {
     return false;
   }
 }
-function appendInRoot(root, name2, text, hooks = {}) {
+function appendInRoot(root, name2, text2, hooks = {}) {
   return writeVerified(root, name2, hooks, true, (fd) => {
-    (0, import_node_fs17.writeSync)(fd, text);
+    (0, import_node_fs17.writeSync)(fd, text2);
   });
 }
-function replaceInRoot(root, name2, text, hooks = {}) {
+function replaceInRoot(root, name2, text2, hooks = {}) {
   return writeVerified(root, name2, hooks, false, (fd) => {
     (0, import_node_fs17.ftruncateSync)(fd, 0);
-    (0, import_node_fs17.writeSync)(fd, text, 0);
+    (0, import_node_fs17.writeSync)(fd, text2, 0);
   });
 }
 
@@ -19484,12 +19484,12 @@ function ensureVerityGitignore() {
     if (hasSupersededMemory && !memoryIsCommitted) {
       next = fenceMemoryLines(next);
     }
-    let text = next.join("\n");
+    let text2 = next.join("\n");
     if (!hasMarker) {
-      const sep7 = text === "" ? "" : text.endsWith("\n") ? "\n" : "\n\n";
-      text = text + sep7 + VERITY_GITIGNORE_BLOCK;
+      const sep7 = text2 === "" ? "" : text2.endsWith("\n") ? "\n" : "\n\n";
+      text2 = text2 + sep7 + VERITY_GITIGNORE_BLOCK;
     }
-    if (text !== content) (0, import_node_fs19.writeFileSync)(".gitignore", text);
+    if (text2 !== content) (0, import_node_fs19.writeFileSync)(".gitignore", text2);
     return verified(
       memoryIsCommitted ? "memory-tracked" : hasSupersededMemory ? "memory-fenced" : needsRepair ? "repaired" : "added"
     );
@@ -19515,13 +19515,13 @@ function writeFencedBlock() {
   const hasMarker = content.includes(VERITY_GITIGNORE_MARKER);
   let lines = content.split("\n").map((l) => BREAKING_ENTRIES.has(l.trim()) ? ".verity/*" : l);
   lines = fenceMemoryLines(lines);
-  let text = lines.join("\n");
+  let text2 = lines.join("\n");
   if (!hasMarker) {
-    const sep7 = text === "" ? "" : text.endsWith("\n") ? "\n" : "\n\n";
-    text = text + sep7 + VERITY_GITIGNORE_BLOCK;
+    const sep7 = text2 === "" ? "" : text2.endsWith("\n") ? "\n" : "\n\n";
+    text2 = text2 + sep7 + VERITY_GITIGNORE_BLOCK;
   }
   try {
-    (0, import_node_fs19.writeFileSync)(".gitignore", text);
+    (0, import_node_fs19.writeFileSync)(".gitignore", text2);
     return true;
   } catch {
     return false;
@@ -20500,26 +20500,26 @@ var CLAUDE_MD_PROSE_LEGACY = [
   "superseded \u2014 ignore them unless investigating history."
 ].join("\n");
 var PRESERVE_PLACEHOLDER = "<!-- Add binding, hand-curated guidance here; it survives Verity regeneration. -->";
-function* scanLines(text) {
+function* scanLines(text2) {
   let offset = 0;
   let inFence = false;
-  for (const line2 of text.split("\n")) {
+  for (const line2 of text2.split("\n")) {
     const isFence = /^(`{3,}|~{3,})/.test(line2.trim());
     if (isFence) inFence = !inFence;
     yield { line: line2, start: offset, inFence: inFence || isFence };
     offset += line2.length + 1;
   }
 }
-function findMarker(text, marker, from = 0) {
-  for (const { line: line2, start: start2, inFence } of scanLines(text)) {
+function findMarker(text2, marker, from = 0) {
+  for (const { line: line2, start: start2, inFence } of scanLines(text2)) {
     if (!inFence && start2 >= from && line2.startsWith(marker)) {
       return start2;
     }
   }
   return -1;
 }
-function hasLegacyMemoryBlock(text) {
-  return findMarker(text, LEGACY_MD_START) !== -1;
+function hasLegacyMemoryBlock(text2) {
+  return findMarker(text2, LEGACY_MD_START) !== -1;
 }
 async function ensureClaudeMdPointer(cwd = repoRoot()) {
   const claudeMdPath = (0, import_node_path19.join)(cwd, "CLAUDE.md");
@@ -20719,10 +20719,10 @@ var STOP = /* @__PURE__ */ new Set([
   "verify",
   "check"
 ]);
-function pendingTokens(text) {
-  if (!text || typeof text !== "string") return [];
+function pendingTokens(text2) {
+  if (!text2 || typeof text2 !== "string") return [];
   const out2 = /* @__PURE__ */ new Set();
-  for (const raw of text.toLowerCase().split(/[^a-z0-9]+/)) {
+  for (const raw of text2.toLowerCase().split(/[^a-z0-9]+/)) {
     if (raw.length <= 3) continue;
     if (STOP.has(raw)) continue;
     out2.add(raw);
@@ -20737,8 +20737,8 @@ function overlapCoefficient(a, b) {
   for (const t of a) if (setB.has(t)) shared++;
   return shared / Math.min(a.length, b.length);
 }
-function isRepeatOfAny(text, priorFingerprints, threshold = REPEAT_THRESHOLD) {
-  const tokens = pendingTokens(text);
+function isRepeatOfAny(text2, priorFingerprints, threshold = REPEAT_THRESHOLD) {
+  const tokens = pendingTokens(text2);
   if (tokens.length === 0) return false;
   return priorFingerprints.some((prior) => overlapCoefficient(tokens, prior) >= threshold);
 }
@@ -21428,8 +21428,8 @@ function assessContinuity(i2) {
 // src/lib/dossier/reanchor.ts
 var import_node_crypto8 = require("node:crypto");
 var import_node_fs25 = require("node:fs");
-function lineSha(text) {
-  return (0, import_node_crypto8.createHash)("sha256").update(text.trim()).digest("hex").slice(0, HASH_WIDTH);
+function lineSha(text2) {
+  return (0, import_node_crypto8.createHash)("sha256").update(text2.trim()).digest("hex").slice(0, HASH_WIDTH);
 }
 function fileHash(path) {
   try {
@@ -21902,10 +21902,10 @@ function recordGoal(d, prompt, source2 = "prompt") {
     appendEvent(d, { k: "goal_continue", text: prompt.slice(0, 64) });
     return;
   }
-  const text = prompt.slice(0, MAX_GOAL_CHARS);
+  const text2 = prompt.slice(0, MAX_GOAL_CHARS);
   appendEvent(d, {
     k: "goal",
-    text,
+    text: text2,
     text_len: prompt.length,
     source: source2,
     ...prompt.length > MAX_GOAL_CHARS && { truncated: true }
@@ -23005,8 +23005,8 @@ function buildCompactionContext(session) {
       `${r.projection.fold.refused} earlier finding(s) were dropped because the code they pointed at no longer matches. They are resolved; do not revisit them.`
     );
   }
-  const text = lines.join("\n");
-  if (text.length <= MAX_CHARS) return text;
+  const text2 = lines.join("\n");
+  if (text2.length <= MAX_CHARS) return text2;
   const trimmed = [...lines.slice(0, 5), ...lines.slice(5, 5 + 2)].join("\n");
   return trimmed.length <= MAX_CHARS ? trimmed : null;
 }
@@ -23324,9 +23324,9 @@ function declaredDependencies(root, files) {
   for (const path of pythonManifests) {
     if (!(0, import_node_fs31.existsSync)(path)) continue;
     try {
-      const text = (0, import_node_fs31.readFileSync)(path, "utf-8");
-      for (const m of text.matchAll(/^\s*["']?([A-Za-z][A-Za-z0-9._-]+)/gm)) names2.push(m[1]);
-      for (const line2 of text.split("\n")) {
+      const text2 = (0, import_node_fs31.readFileSync)(path, "utf-8");
+      for (const m of text2.matchAll(/^\s*["']?([A-Za-z][A-Za-z0-9._-]+)/gm)) names2.push(m[1]);
+      for (const line2 of text2.split("\n")) {
         if (!/dependencies\s*=/.test(line2)) continue;
         for (const m of line2.matchAll(/["']([A-Za-z][A-Za-z0-9._-]+)/g)) names2.push(m[1]);
       }
@@ -23340,8 +23340,8 @@ function declaredDependencies(root, files) {
   for (const path of goMods) {
     if (!(0, import_node_fs31.existsSync)(path)) continue;
     try {
-      const text = (0, import_node_fs31.readFileSync)(path, "utf-8");
-      for (const m of text.matchAll(/^\s+([\w.-]+\/[\w./-]+)\s+v/gm)) {
+      const text2 = (0, import_node_fs31.readFileSync)(path, "utf-8");
+      for (const m of text2.matchAll(/^\s+([\w.-]+\/[\w./-]+)\s+v/gm)) {
         names2.push(m[1].replace(/^github\.com\//, ""));
       }
     } catch {
@@ -23351,8 +23351,8 @@ function declaredDependencies(root, files) {
     const path = (0, import_node_path28.join)(root, file);
     if (!(0, import_node_fs31.existsSync)(path)) continue;
     try {
-      const text = (0, import_node_fs31.readFileSync)(path, "utf-8");
-      for (const m of text.matchAll(/["'<]([A-Za-z][A-Za-z0-9._-]{2,})["'>]/g)) names2.push(m[1]);
+      const text2 = (0, import_node_fs31.readFileSync)(path, "utf-8");
+      for (const m of text2.matchAll(/["'<]([A-Za-z][A-Za-z0-9._-]{2,})["'>]/g)) names2.push(m[1]);
     } catch {
     }
   }
@@ -25060,9 +25060,9 @@ function readTextInput(value, flag, readStdin2 = () => (0, import_node_fs39.read
   if (raw.length > MAX_STDIN_BYTES) {
     return { ok: false, error: `${flag} from stdin is ${raw.length} bytes; the limit is ${MAX_STDIN_BYTES}.` };
   }
-  const text = raw.toString("utf8").replace(/\r?\n$/, "");
-  if (!text.trim()) return { ok: false, error: `${flag} from stdin is empty.` };
-  return { ok: true, text };
+  const text2 = raw.toString("utf8").replace(/\r?\n$/, "");
+  if (!text2.trim()) return { ok: false, error: `${flag} from stdin is empty.` };
+  return { ok: true, text: text2 };
 }
 
 // src/lib/terminal-text.ts
@@ -25080,8 +25080,8 @@ function terminalUrl(value) {
 // src/commands/feedback.ts
 function registerFeedbackCommand(program2) {
   const feedbackCmd = program2.command("feedback").description("Send feedback to the Verity team");
-  feedbackCmd.command("message <text>").description("Send general feedback (- reads the message from stdin, so the words never pass through shell quoting)").option("--session-id <id>", "Session identifier").option("--model <name>", "Agent model name").action(async (text, opts) => {
-    await sendMessageArg(text, opts, program2.opts());
+  feedbackCmd.command("message <text>").description("Send general feedback (- reads the message from stdin, so the words never pass through shell quoting)").option("--session-id <id>", "Session identifier").option("--model <name>", "Agent model name").action(async (text2, opts) => {
+    await sendMessageArg(text2, opts, program2.opts());
   });
   feedbackCmd.command("finding <run-id> <pattern-id> <action> [note]").description("Submit per-finding feedback (false_positive, acknowledged, useful, etc.); a note of - is read from stdin").option("--file <path>", "File path the finding applies to").option("--line <n>", "Line number", parseInt).action(async (runId, patternId, action, inlineNote, opts) => {
     const globals = program2.opts();
@@ -25686,28 +25686,28 @@ function parseRgLine(line2) {
   return { file: line2.slice(0, first), line: n2, text: line2.slice(second + 1) };
 }
 var isWordChar = (c) => c !== void 0 && /[A-Za-z0-9_]/.test(c);
-function wordHit(text, symbol) {
+function wordHit(text2, symbol) {
   let from = 0;
   for (; ; ) {
-    const at = text.indexOf(symbol, from);
+    const at = text2.indexOf(symbol, from);
     if (at < 0) return false;
-    const before = at === 0 ? void 0 : text[at - 1];
-    const after = text[at + symbol.length];
+    const before = at === 0 ? void 0 : text2[at - 1];
+    const after = text2[at + symbol.length];
     if (!isWordChar(before) && !isWordChar(after)) return true;
     from = at + 1;
   }
 }
-function isContractLine(text, symbol) {
+function isContractLine(text2, symbol) {
   for (const kw of ["implements", "extends"]) {
     let from = 0;
     for (; ; ) {
-      const at = text.indexOf(kw, from);
+      const at = text2.indexOf(kw, from);
       if (at < 0) break;
       from = at + 1;
-      const before = at === 0 ? void 0 : text[at - 1];
-      const after = text[at + kw.length];
+      const before = at === 0 ? void 0 : text2[at - 1];
+      const after = text2[at + kw.length];
       if (isWordChar(before) || isWordChar(after)) continue;
-      let clause = text.slice(at + kw.length);
+      let clause = text2.slice(at + kw.length);
       const stop2 = Math.min(
         ...[clause.indexOf(";"), clause.indexOf("{")].filter((i2) => i2 >= 0)
       );
@@ -25739,20 +25739,20 @@ function partitionSites(rgLines, symbols, opts) {
     if (opts.sentPaths.has(h.file)) continue;
     if (opts.isExcluded(h.file)) continue;
     if (!isCodeSiteFile(h.file)) continue;
-    const text = h.text.trim();
-    if (text.length === 0 || IMPORT_LINE.test(h.text)) continue;
-    if (COMMENT_LINE.test(text)) continue;
-    if (BARE_MEMBER_LINE.test(text) || GO_IMPORT_PATH_LINE.test(text)) continue;
+    const text2 = h.text.trim();
+    if (text2.length === 0 || IMPORT_LINE.test(h.text)) continue;
+    if (COMMENT_LINE.test(text2)) continue;
+    if (BARE_MEMBER_LINE.test(text2) || GO_IMPORT_PATH_LINE.test(text2)) continue;
     const n2 = perFile.get(h.file) ?? 0;
     if (n2 >= MAX_SITES_PER_FILE) continue;
     const site = {
       file: h.file,
       line: h.line,
-      text: text.slice(0, SITE_TEXT_MAX),
+      text: text2.slice(0, SITE_TEXT_MAX),
       symbol: h.symbol,
       // R2 falls out of R1 for free: a word search for `Sym` already matches
       // `implements Sym` / `extends Sym` lines — classification is all R2 is.
-      ...isContractLine(text, h.symbol) ? { kind: "contract" } : {}
+      ...isContractLine(text2, h.symbol) ? { kind: "contract" } : {}
     };
     if (isTestPath(h.file)) {
       if (tests.length < MAX_TEST_SLOTS) {
@@ -25772,8 +25772,8 @@ var MAX_IMPORTERS_PER_FILE = 2;
 function moduleKey(path) {
   return path.replace(/\.(ts|tsx|js|jsx|mjs|cjs|mts|cts)$/i, "").replace(/\/index$/, "");
 }
-function importSpecifier(text) {
-  const m = /(?:\bfrom|\brequire\s*\(|\bimport\s*\(|^\s*import)\s*['"]([^'"\n]+)['"]/.exec(text);
+function importSpecifier(text2) {
+  const m = /(?:\bfrom|\brequire\s*\(|\bimport\s*\(|^\s*import)\s*['"]([^'"\n]+)['"]/.exec(text2);
   return m?.[1] ?? null;
 }
 function resolveSpecifier(fromFile, spec) {
@@ -26043,8 +26043,8 @@ function extractEnclosingExcerpt(content, siteLine, path) {
     start2 = Math.max(1, siteLine - (EXCERPT_MAX_LINES - 6));
   }
   const end = Math.min(lines.length, start2 + EXCERPT_MAX_LINES - 1);
-  const text = lines.slice(start2 - 1, end).join("\n").slice(0, EXCERPT_MAX_CHARS);
-  return { start_line: start2, text };
+  const text2 = lines.slice(start2 - 1, end).join("\n").slice(0, EXCERPT_MAX_CHARS);
+  return { start_line: start2, text: text2 };
 }
 function upgradeToExcerpts(rc, opts) {
   if (rc.state !== "ok") return;
@@ -27141,12 +27141,12 @@ function parseKnowledgeNote(raw) {
   if (!raw || typeof raw !== "object") return null;
   const o = raw;
   const node_id = typeof o.node_id === "string" ? o.node_id.trim() : "";
-  const text = typeof o.text === "string" ? o.text.trim() : "";
-  if (!node_id || !text) return null;
-  if (text.length > 1e3) return null;
+  const text2 = typeof o.text === "string" ? o.text.trim() : "";
+  if (!node_id || !text2) return null;
+  if (text2.length > 1e3) return null;
   return {
     node_id,
-    text,
+    text: text2,
     file: typeof o.file === "string" && o.file ? o.file : null,
     line: typeof o.line === "number" && Number.isFinite(o.line) && o.line > 0 ? Math.floor(o.line) : null
   };
@@ -27184,10 +27184,10 @@ function episodeForWire(e, humanSpoke) {
 var MAX_AGENT_CONTEXT_CHARS = 1500;
 var MAX_AGENT_ITEMS = 5;
 var REPORT_PREFIX = "Verity review (a report on the code just written \u2014 relay what matters to the user; it is not an instruction to you):";
-function renderItem(label2, text, patternId, file, line2) {
+function renderItem(label2, text2, patternId, file, line2) {
   const where2 = file ? ` (${file}${line2 !== void 0 && line2 !== "" ? `:${line2}` : ""})` : "";
   const id = patternId ? ` [${patternId}]` : "";
-  return `- ${label2}${text}${where2}${id}`;
+  return `- ${label2}${text2}${where2}${id}`;
 }
 function channelInputFrom(response, intentRepeat = 0, priorPendingFingerprints = []) {
   const metadata2 = response.metadata ?? {};
@@ -27269,11 +27269,11 @@ function buildAgentContext(input) {
   for (const p of input.pendingItems ?? []) {
     if (lines.length >= MAX_AGENT_ITEMS) break;
     if (p.pattern_id === "intent-misalignment") continue;
-    const text = p.description ?? p.title ?? p.reason;
-    if (!text) continue;
-    const seenBefore = isRepeatOfAny(text, input.priorPendingFingerprints ?? []);
+    const text2 = p.description ?? p.title ?? p.reason;
+    if (!text2) continue;
+    const seenBefore = isRepeatOfAny(text2, input.priorPendingFingerprints ?? []);
     lines.push(
-      renderItem("", text, p.pattern_id, p.file, p.line) + (seenBefore ? "\n    (raised earlier this session and still open \u2014 do not re-explain it; act on it or carry on)" : "")
+      renderItem("", text2, p.pattern_id, p.file, p.line) + (seenBefore ? "\n    (raised earlier this session and still open \u2014 do not re-explain it; act on it or carry on)" : "")
     );
   }
   if (lines.length === 0) return null;
@@ -27281,11 +27281,11 @@ function buildAgentContext(input) {
 ${lines.slice(0, MAX_AGENT_ITEMS).join("\n")}`;
   return truncateToCap(body2);
 }
-function truncateToCap(text) {
-  if (text.length <= MAX_AGENT_CONTEXT_CHARS) return text;
+function truncateToCap(text2) {
+  if (text2.length <= MAX_AGENT_CONTEXT_CHARS) return text2;
   const marker = "\n- (truncated)";
   const budget = MAX_AGENT_CONTEXT_CHARS - marker.length;
-  const lines = text.slice(0, budget).split("\n");
+  const lines = text2.slice(0, budget).split("\n");
   lines.pop();
   return `${lines.join("\n")}${marker}`;
 }
@@ -27313,7 +27313,7 @@ function channelSilence(input) {
 // src/lib/cli-version.ts
 function cliVersion() {
   try {
-    return true ? "0.34.3" : "dev";
+    return true ? "0.34.4" : "dev";
   } catch {
     return "dev";
   }
@@ -29489,8 +29489,8 @@ function argResource(kind2, arg) {
   const keyed = keyedCall(arg.text);
   return keyed ? { kind: kind2, name: keyed, confidence: "expression" } : { kind: kind2, name: null, confidence: "unknown" };
 }
-function keyedCall(text) {
-  const t = text.trim();
+function keyedCall(text2) {
+  const t = text2.trim();
   const open = t.indexOf("(");
   if (open <= 0 || !t.endsWith(")")) return null;
   const callee = t.slice(0, open);
@@ -29524,16 +29524,16 @@ var SQL_TABLE = [
   [/\bfrom\s+[`"[]?([\w.]+)/i, "read"]
 ];
 function sqlLiteral(c) {
-  const text = c.args.find((a) => a.literal !== null && SQL.test(a.literal))?.literal;
-  if (!text) return null;
+  const text2 = c.args.find((a) => a.literal !== null && SQL.test(a.literal))?.literal;
+  if (!text2) return null;
   for (const [re, op] of SQL_TABLE) {
-    const m = re.exec(text);
+    const m = re.exec(text2);
     if (m) {
       const name2 = m[1].split(".").pop();
-      return { op, resource: table(name2), rule: "sql.literal", lock: op === "read" && /\bfor\s+(?:no\s+key\s+)?update\b/i.test(text) };
+      return { op, resource: table(name2), rule: "sql.literal", lock: op === "read" && /\bfor\s+(?:no\s+key\s+)?update\b/i.test(text2) };
     }
   }
-  return { op: /^\s*select\b/i.test(text) ? "read" : "write", resource: { kind: "table", name: null, confidence: "unknown" }, rule: "sql.literal" };
+  return { op: /^\s*select\b/i.test(text2) ? "read" : "write", resource: { kind: "table", name: null, confidence: "unknown" }, rule: "sql.literal" };
 }
 var SB_WRITE = /* @__PURE__ */ new Set(["insert", "update", "upsert", "delete"]);
 var SB_FROM = /\bfrom\(\s*(['"`])([\w.-]+)\1\s*\)\s*$/;
@@ -29929,28 +29929,28 @@ var ALIAS_OF = "alias-of:";
 var FIELD_OF = "field-of:";
 var IDENT_CHAR = /[\w$]/;
 var isIdent = (s) => /^[A-Za-z_$][\w$]*$/.test(s);
-function wordAt(text, word) {
+function wordAt(text2, word) {
   const out2 = [];
-  for (let i2 = text.indexOf(word); i2 >= 0; i2 = text.indexOf(word, i2 + 1)) {
-    if (IDENT_CHAR.test(text[i2 - 1] ?? "") || IDENT_CHAR.test(text[i2 + word.length] ?? "")) continue;
+  for (let i2 = text2.indexOf(word); i2 >= 0; i2 = text2.indexOf(word, i2 + 1)) {
+    if (IDENT_CHAR.test(text2[i2 - 1] ?? "") || IDENT_CHAR.test(text2[i2 + word.length] ?? "")) continue;
     out2.push(i2);
   }
   return out2;
 }
 var GO_NOT_TYPES = /* @__PURE__ */ new Set(["int", "int8", "int16", "int32", "int64", "uint", "uint8", "uint16", "uint32", "uint64", "uintptr", "float32", "float64", "complex64", "complex128", "string", "bool", "byte", "rune", "error", "any", "func", "chan", "map", "struct", "interface", "range", "make", "new", "nil", "true", "false"]);
-function typeAt(text, i2, lang) {
+function typeAt(text2, i2, lang) {
   let j = i2;
   const skip = () => {
-    while (j < text.length && /[\s?*&]/.test(text[j])) j++;
+    while (j < text2.length && /[\s?*&]/.test(text2[j])) j++;
   };
   skip();
-  for (const kw of ["new ", "readonly ", "await "]) if (text.startsWith(kw, j)) {
+  for (const kw of ["new ", "readonly ", "await "]) if (text2.startsWith(kw, j)) {
     j += kw.length;
     skip();
   }
   let k = j;
-  while (k < text.length && /[\w$.]/.test(text[k])) k++;
-  const name2 = text.slice(j, k).split(".").pop() ?? "";
+  while (k < text2.length && /[\w$.]/.test(text2[k])) k++;
+  const name2 = text2.slice(j, k).split(".").pop() ?? "";
   if (lang === "go") return /^[A-Za-z_]\w*$/.test(name2) && !GO_NOT_TYPES.has(name2) ? name2 : null;
   return /^[A-Z][\w$]*$/.test(name2) ? name2 : null;
 }
@@ -30100,10 +30100,10 @@ function boundInGo(fnText, name2) {
   const brace = fnText.indexOf("{");
   return wordAt(brace < 0 ? fnText : fnText.slice(0, brace), name2).length > 0;
 }
-function rebindsInGo(text, name2) {
-  for (const i2 of wordAt(text, name2)) {
-    const lineEnd = text.indexOf("\n", i2);
-    const rest = text.slice(i2 + name2.length, lineEnd < 0 ? void 0 : lineEnd);
+function rebindsInGo(text2, name2) {
+  for (const i2 of wordAt(text2, name2)) {
+    const lineEnd = text2.indexOf("\n", i2);
+    const rest = text2.slice(i2 + name2.length, lineEnd < 0 ? void 0 : lineEnd);
     const decl = rest.indexOf(":=");
     if (decl >= 0 && /^[\s\w,]*$/.test(rest.slice(0, decl))) return true;
   }
@@ -30329,15 +30329,15 @@ function importOf(content, lang, name2, receiver) {
   return null;
 }
 var TS_EXTS = [".ts", ".tsx", ".mts", ".cts", ".js", ".jsx", ".mjs", ".cjs"];
-function parseJsonc(text) {
+function parseJsonc(text2) {
   let out2 = "";
   let inString = false;
-  for (let i2 = 0; i2 < text.length; i2++) {
-    const c = text[i2];
+  for (let i2 = 0; i2 < text2.length; i2++) {
+    const c = text2[i2];
     if (inString) {
       out2 += c;
       if (c === "\\") {
-        out2 += text[++i2] ?? "";
+        out2 += text2[++i2] ?? "";
         continue;
       }
       if (c === '"') inString = false;
@@ -30348,14 +30348,14 @@ function parseJsonc(text) {
       out2 += c;
       continue;
     }
-    if (c === "/" && text[i2 + 1] === "/") {
-      while (i2 < text.length && text[i2] !== "\n") i2++;
+    if (c === "/" && text2[i2 + 1] === "/") {
+      while (i2 < text2.length && text2[i2] !== "\n") i2++;
       out2 += "\n";
       continue;
     }
-    if (c === "/" && text[i2 + 1] === "*") {
+    if (c === "/" && text2[i2 + 1] === "*") {
       i2 += 2;
-      while (i2 < text.length && !(text[i2] === "*" && text[i2 + 1] === "/")) i2++;
+      while (i2 < text2.length && !(text2[i2] === "*" && text2[i2 + 1] === "/")) i2++;
       i2++;
       continue;
     }
@@ -30564,36 +30564,36 @@ function definitionOf(input) {
 }
 var MAX_CALLER_SCAN_FILES = 60;
 var isWordChar2 = (c) => c !== void 0 && /[\w$]/.test(c);
-function callStarts(text, name2) {
+function callStarts(text2, name2) {
   const out2 = [];
-  for (let i2 = text.indexOf(name2); i2 >= 0; i2 = text.indexOf(name2, i2 + 1)) {
+  for (let i2 = text2.indexOf(name2); i2 >= 0; i2 = text2.indexOf(name2, i2 + 1)) {
     let j = i2 + name2.length;
-    if (text[j] === "<") {
+    if (text2[j] === "<") {
       let depth = 0;
-      for (; j < text.length; j++) {
-        if (text[j] === "<") depth++;
-        else if (text[j] === ">" && --depth === 0) break;
+      for (; j < text2.length; j++) {
+        if (text2[j] === "<") depth++;
+        else if (text2[j] === ">" && --depth === 0) break;
       }
       j++;
     }
-    if (text[j] === "(") out2.push({ index: i2, open: j });
+    if (text2[j] === "(") out2.push({ index: i2, open: j });
   }
   return out2;
 }
-function callsName(text, name2) {
-  const t = text.trim();
+function callsName(text2, name2) {
+  const t = text2.trim();
   if (t.startsWith("//") || t.startsWith("*") || t.startsWith("/*") || t.startsWith("#")) return false;
-  for (const at of callStarts(text, name2)) {
+  for (const at of callStarts(text2, name2)) {
     const i2 = at.index;
-    const spread = text.slice(Math.max(0, i2 - 3), i2) === "...";
-    if (isWordChar2(text[i2 - 1]) || text[i2 - 1] === "." && !spread) continue;
+    const spread = text2.slice(Math.max(0, i2 - 3), i2) === "...";
+    if (isWordChar2(text2[i2 - 1]) || text2[i2 - 1] === "." && !spread) continue;
     let depth = 0;
     let j = at.open;
-    for (; j < text.length; j++) {
-      if (text[j] === "(") depth++;
-      else if (text[j] === ")" && --depth === 0) break;
+    for (; j < text2.length; j++) {
+      if (text2[j] === "(") depth++;
+      else if (text2[j] === ")" && --depth === 0) break;
     }
-    const after = text.slice(j + 1).trimStart();
+    const after = text2.slice(j + 1).trimStart();
     if (after.startsWith(":") || after.startsWith("{")) continue;
     return true;
   }
@@ -30683,11 +30683,11 @@ function callersOf(input) {
         if (seen.has(line2) || declared.has(line2)) continue;
         const inside2 = r.value.some((f) => f.start.line <= line2 && line2 <= f.end.line && f.calls.some((c) => c.line === line2 && c.name === name2));
         if (inside2) continue;
-        const text = lines[line2 - 1] ?? "";
-        if (!callsName(text, name2) || /^\s*(?:export\s+)?(?:async\s+)?(?:function|def|func)\b/.test(text)) continue;
+        const text2 = lines[line2 - 1] ?? "";
+        if (!callsName(text2, name2) || /^\s*(?:export\s+)?(?:async\s+)?(?:function|def|func)\b/.test(text2)) continue;
         const enclosing = r.value.filter((f) => f.start.line <= line2 && line2 <= f.end.line).sort((a, b) => a.end.line - a.start.line - (b.end.line - b.start.line))[0];
         seen.add(line2);
-        callers.push({ path: p, caller: enclosing ? enclosing.qualified : null, line: line2, text: text.trim().slice(0, 200), provenance: fileTie });
+        callers.push({ path: p, caller: enclosing ? enclosing.qualified : null, line: line2, text: text2.trim().slice(0, 200), provenance: fileTie });
       }
     }
   }
@@ -30994,16 +30994,16 @@ ${m.accessors.map((x) => `  ${x.fn.path}:${x.fn.start.line} ${x.fn.qualified} \u
   return { ok: true, value: lines.join("\n") };
 };
 var KINDS = ["table", "cache", "file", "http", "queue", "service", "memory"];
-function parseResource(text) {
-  const colon = text.indexOf(":");
-  const kind2 = colon > 0 ? text.slice(0, colon) : "";
-  if (KINDS.includes(kind2)) return { kinds: [kind2], name: text.slice(colon + 1) };
-  return { kinds: KINDS, name: text };
+function parseResource(text2) {
+  const colon = text2.indexOf(":");
+  const kind2 = colon > 0 ? text2.slice(0, colon) : "";
+  if (KINDS.includes(kind2)) return { kinds: [kind2], name: text2.slice(colon + 1) };
+  return { kinds: KINDS, name: text2 };
 }
 var writersOfTool = async (ctx, args2) => {
-  const text = str(args2.resource, 300, "resource");
-  if (!text.ok) return text;
-  const { kinds, name: name2 } = parseResource(text.value);
+  const text2 = str(args2.resource, 300, "resource");
+  if (!text2.ok) return text2;
+  const { kinds, name: name2 } = parseResource(text2.value);
   if (name2.length < 2) return { ok: false, error: "resource name too short to search for" };
   const deadline = Date.now() + TOOL_MS;
   const src = source(ctx);
@@ -31042,7 +31042,7 @@ var writersOfTool = async (ctx, args2) => {
   if (files.size > 25) truncated = true;
   const list2 = (xs) => xs.length ? xs.slice(0, MAX_LIST).map((x) => `  ${x}`).join("\n") + (xs.length > MAX_LIST ? `
   \u2026 ${xs.length - MAX_LIST} more` : "") : "  none found";
-  return { ok: true, value: `${text.value} (${where(ctx)}), heuristic${truncated ? ", search cut short" : ""}
+  return { ok: true, value: `${text2.value} (${where(ctx)}), heuristic${truncated ? ", search cut short" : ""}
 writers:
 ${list2(writers)}
 readers:
@@ -31100,9 +31100,9 @@ function validateRepoPath(value, { allowRoot = false } = {}) {
 function lineNumber(value, fallback) {
   return typeof value === "number" && Number.isInteger(value) && value >= 1 ? value : fallback;
 }
-function capOutput(text) {
-  return text.length > TOOL_LIMITS.outputChars ? `${text.slice(0, TOOL_LIMITS.outputChars)}
-[truncated at ${TOOL_LIMITS.outputChars} characters]` : text;
+function capOutput(text2) {
+  return text2.length > TOOL_LIMITS.outputChars ? `${text2.slice(0, TOOL_LIMITS.outputChars)}
+[truncated at ${TOOL_LIMITS.outputChars} characters]` : text2;
 }
 function git(ctx, args2, opts = {}) {
   return runGit(ctx.root, args2, { timeoutMs: opts.timeoutMs ?? TOOL_LIMITS.gitTimeoutMs, maxBuffer: opts.maxBuffer ?? TOOL_LIMITS.fileBytes });
@@ -31236,8 +31236,8 @@ var listFilesTool = async (ctx, args2) => {
 \u2026 ${more} more` : ""}` : "no matching files" };
 };
 var searchTool = async (ctx, args2) => {
-  const text = args2.text;
-  if (typeof text !== "string" || text.length === 0 || text.length > TOOL_LIMITS.textChars || /[\n\r]/.test(text)) {
+  const text2 = args2.text;
+  if (typeof text2 !== "string" || text2.length === 0 || text2.length > TOOL_LIMITS.textChars || /[\n\r]/.test(text2)) {
     return { ok: false, error: `text must be 1-${TOOL_LIMITS.textChars} characters on one line` };
   }
   const glob = typeof args2.path_glob === "string" && args2.path_glob.length > 0 ? args2.path_glob : null;
@@ -31246,7 +31246,7 @@ var searchTool = async (ctx, args2) => {
   }
   const pathspec = glob ? [`:(glob)${glob}`] : [];
   const revision = ctx.range.kind === "push" ? [ctx.range.head] : ["--cached"];
-  const res = await git(ctx, ["grep", "-n", "-I", "-F", "--no-color", ...revision.filter((r) => r === "--cached"), "-e", text, ...revision.filter((r) => r !== "--cached"), "--", ...pathspec]);
+  const res = await git(ctx, ["grep", "-n", "-I", "-F", "--no-color", ...revision.filter((r) => r === "--cached"), "-e", text2, ...revision.filter((r) => r !== "--cached"), "--", ...pathspec]);
   if (!res.ok) {
     if (res.error === "failed" && res.stderr.trim() === "") return { ok: true, value: "no matches" };
     return { ok: false, error: gitFailure(res, "search") };
@@ -31284,7 +31284,7 @@ function makeToolExecutor(ctx) {
         const index = next++;
         const call = calls[index];
         const codeTool = ctx.codeMap && CODE_TOOL_NAMES.includes(call.name) ? CODE_TOOLS[call.name] : null;
-        const tool = codeTool ? (c, args2) => codeTool({ root: c.root, revision: c.range.kind === "push" ? c.range.head : null, codeMap: c.codeMap, validatePath: (v) => validateRepoPath(v), denied: isDeniedPath }, args2) : TOOLS[call.name] ?? null;
+        const tool = codeTool ? (c, args2) => codeTool({ root: c.root, revision: c.range.kind === "push" ? c.range.head : null, codeMap: c.codeMap, validatePath: (v) => validateRepoPath(v), denied: isDeniedPath }, args2) : Object.hasOwn(TOOLS, call.name) ? TOOLS[call.name] : null;
         if (!tool) {
           results[index] = { call_id: call.call_id, ok: false, error: `unknown tool ${call.name}` };
           continue;
@@ -31380,10 +31380,10 @@ function writerExcerpts(codeMap, writers, read2, maxLines, maxChars, budget) {
     if (content === null) continue;
     const win = functionWindow(codeMap, w.file, content, w.line, maxLines);
     if (!win) continue;
-    const text = content.split("\n").slice(win.start_line - 1, win.end_line).join("\n").slice(0, maxChars);
-    if (used2 + text.length > budget) break;
-    used2 += text.length;
-    out2.push({ file: w.file, start_line: win.start_line, symbol: `${w.symbol} (writes ${w.resource}, like ${w.changed})`, kind: "writer", text });
+    const text2 = content.split("\n").slice(win.start_line - 1, win.end_line).join("\n").slice(0, maxChars);
+    if (used2 + text2.length > budget) break;
+    used2 += text2.length;
+    out2.push({ file: w.file, start_line: win.start_line, symbol: `${w.symbol} (writes ${w.resource}, like ${w.changed})`, kind: "writer", text: text2 });
   }
   return out2;
 }
@@ -34056,14 +34056,14 @@ function trackedSourceFiles(root, opts = {}) {
   return files.slice(0, opts.maxFiles ?? 5e3);
 }
 var EFFECT_LINE = /\bawait\b|\basync\s+with\b|\.then\(|\bsetTimeout\(|\bsetInterval\(|\bwith\s+\w[\w.]*\.(?:lock|acquire)\b|\bLock\(\)/;
-function countEffects(text) {
+function countEffects(text2) {
   let n2 = 0;
-  for (const line2 of text.split("\n")) if (EFFECT_LINE.test(line2)) n2++;
+  for (const line2 of text2.split("\n")) if (EFFECT_LINE.test(line2)) n2++;
   return n2;
 }
-function scanRisk(text) {
+function scanRisk(text2) {
   const counts = Object.fromEntries(RISK_PATTERNS.map(([c]) => [c, 0]));
-  for (const line2 of text.split("\n")) {
+  for (const line2 of text2.split("\n")) {
     for (const [category, re] of RISK_PATTERNS) {
       if (re.test(line2)) counts[category]++;
     }
@@ -34141,7 +34141,7 @@ function collectRiskSignals(root, opts = {}) {
 }
 
 // src/lib/prove/grounding.ts
-var BASIS_RULES = ["conservation", "once", "no-lost-update", "fail-closed", "progress"];
+var BASIS_RULES = ["conservation", "once", "no-lost-update", "fail-closed", "progress", "isolation", "revocation", "flow-binding", "event-order", "check-use"];
 var RULE = /^rule:([a-z-]+)$/;
 var LINE = /^(?:([^\s:]+):)?L?(\d{1,6})(?::\s*|\s+)(?:comment\s+)?([\s\S]+)$/;
 var norm = (s) => s.replace(/\s+/g, " ").trim().toLowerCase();
@@ -34192,6 +34192,19 @@ var STRUCTURAL_CATALOGUE = [
   "check_then_act_is_atomic",
   "no_double_effect"
 ];
+var SECURITY_CATALOGUE = [
+  "limit_holds_under_concurrency",
+  "single_use",
+  "no_cross_subject_leak",
+  "revocation_holds",
+  "flow_binding",
+  "event_order_holds",
+  "fails_closed",
+  "checked_value_is_used",
+  "idempotency_scoped"
+];
+var MAX_HYPOTHESES = 3;
+var CATALOGUE = [...STRUCTURAL_CATALOGUE, ...SECURITY_CATALOGUE];
 function combineScore(c) {
   const f = (x) => Math.max(0.01, Math.min(1, x));
   return Math.round(Math.pow(f(c.hazard), 0.45) * Math.pow(f(c.critical), 0.35) * Math.pow(f(c.error_prone), 0.2) * 1e3) / 1e3;
@@ -34294,9 +34307,11 @@ var LUNA_SCHEMA = {
           error_prone: { type: "number" },
           reasons: { type: "array", items: { type: "string" } },
           symbol: { type: "string" },
-          properties: { type: "array", items: { type: "string", enum: [...STRUCTURAL_CATALOGUE] } }
+          properties: { type: "array", items: { type: "string", enum: [...STRUCTURAL_CATALOGUE, ...SECURITY_CATALOGUE] } },
+          lens: { type: "string", enum: ["security", "reliability"] },
+          hypotheses: { type: "array", items: { type: "string" } }
         },
-        required: ["file", "critical", "hazard", "error_prone", "reasons", "symbol", "properties"]
+        required: ["file", "critical", "hazard", "error_prone", "reasons", "symbol", "properties", "lens", "hypotheses"]
       }
     }
   },
@@ -34309,7 +34324,9 @@ For each file you get its git-history signals (commits, fix commits), risk keywo
   - error_prone: fix commits in its history (the strongest evidence: this code has already been wrong), high churn, several branches or error paths, a concurrency primitive \u2014 a hazard nobody sees by reading the function once.
 Rate a criterion LOW (below 0.5) when it is missing: rendering, formatting, configuration, command registration, wiring, types, a single read, a single write with nothing before it, logging, or a function whose correctness is plain from reading it. A crash window alone (an external call, then a local write, where a re-run repairs the state and nothing is lost for good) is not enough for a high score. A model of a function longer than about 150 lines abstracts too much to find anything: name the smaller function inside it that holds the hazard, or score lower.
 Name the single symbol (function) most worth modelling, and the applicable properties from the catalogue only. Reasons: at most 3, each a short concrete sentence about THIS code \u2014 its hazard, what a mistake costs, its history \u2014 never about the change. Return every file you were given, exactly once.
-When a file lists \`changed\` lines, this is a review of a push: the excerpt is numbered around the changes (changed lines starred). Name the function that CONTAINS a changed line, and score THAT FUNCTION'S CURRENT CODE as a whole, never the edit itself. A one-line change (a log line, a rename) to a function that meets all three still scores high: a latent bug in it is exactly what this is for. A large change to a function that misses one still scores low. An excerpt may open with "Functions this push changed:", from a parser: when it says a changed function "shares state with" another, judge the PAIR \u2014 a function that alone is a single write or an invalidation is error-prone when the other reads and repopulates, or also writes, the same state (a cache invalidated here and refilled there, two writers of one ledger or file); score it as that pair would be scored, but name ONE symbol \u2014 the changed function, never both ("a/b", "a and b" name nothing). "reads then writes" names a check-then-act the parser saw with no transaction or lock around it. "effects" lists the state the function reads and writes (a table, a file, a cache key, a queue, an outside service). "Fix commits that changed these lines" quotes the history of THIS code: each one is evidence it has been wrong before (error_prone), and its subject often says what a mistake cost (critical) \u2014 a subject about duplicates, lost writes, double charges or stuck jobs is a costly mistake that already happened.`;
+When a file lists \`changed\` lines, this is a review of a push: the excerpt is numbered around the changes (changed lines starred). Name the function that CONTAINS a changed line, and score THAT FUNCTION'S CURRENT CODE as a whole, never the edit itself. A one-line change (a log line, a rename) to a function that meets all three still scores high: a latent bug in it is exactly what this is for. A large change to a function that misses one still scores low. An excerpt may open with "Functions this push changed:", from a parser: when it says a changed function "shares state with" another, judge the PAIR \u2014 a function that alone is a single write or an invalidation is error-prone when the other reads and repopulates, or also writes, the same state (a cache invalidated here and refilled there, two writers of one ledger or file); score it as that pair would be scored, but name ONE symbol \u2014 the changed function, never both ("a/b", "a and b" name nothing). "reads then writes" names a check-then-act the parser saw with no transaction or lock around it. "effects" lists the state the function reads and writes (a table, a file, a cache key, a queue, an outside service). "Fix commits that changed these lines" quotes the history of THIS code: each one is evidence it has been wrong before (error_prone), and its subject often says what a mistake cost (critical) \u2014 a subject about duplicates, lost writes, double charges or stuck jobs is a costly mistake that already happened.
+SECURITY LENS. Also decide who can drive the hazard. Set lens to "security" when an attacker outside the trust boundary can drive it: another user, an anonymous caller, another tenant, a holder of a stolen or revoked credential, the sender of a replayed or delayed event, or the owner of a domain or URL the code fetches. Otherwise set lens to "reliability". For the security lens, critical includes what the attacker gains (money, data, rights, another user's or tenant's data, free service), and hazard includes the moves an attacker controls: many copies of one request at once; the steps of a multi-step flow skipped, repeated or reordered; a right revoked between two steps; an event duplicated, delayed or reordered; a dependency that fails, times out or is circuit-broken; state shared across requests, users or tenants (module variables, caches, fallback answers, idempotency keys); a value that changes between its check and its use (a DNS answer, a redirect, a path).
+HYPOTHESES. For the symbol you name, give up to 3 concrete hypotheses for the model to try to break. Each is one sentence about THIS code that says who acts, the two or more steps, and the harm (for example "two concurrent redeem requests by one user both pass the count check, so the credit is added twice"). When a file lists \`changed\` lines, at least one hypothesis is about what the change made possible. A hypothesis is a question for the model, not a verdict. Give none when you see no concrete one.`;
 var lunaRanker = {
   name: "luna",
   async rank(candidates2, ctx) {
@@ -34340,7 +34357,7 @@ var lunaRanker = {
       store: false,
       instructions: LUNA_INSTRUCTIONS,
       input: JSON.stringify({
-        catalogue: STRUCTURAL_CATALOGUE,
+        catalogue: [...STRUCTURAL_CATALOGUE, ...SECURITY_CATALOGUE],
         ...ctx.hint ? { user_hint: `The user said what they want checked: "${ctx.hint.slice(0, 500)}". Score files and name symbols relevant to it higher; do not invent relevance.` } : {},
         files: payload
       }),
@@ -34357,13 +34374,13 @@ var lunaRanker = {
         signal: controller.signal
       });
       if (!res.ok) {
-        const text2 = await res.text().catch(() => "");
-        return { ok: false, ranker: "luna", error: `OpenAI ${res.status}: ${text2.slice(0, 200)}`, ranked: fallback };
+        const text3 = await res.text().catch(() => "");
+        return { ok: false, ranker: "luna", error: `OpenAI ${res.status}: ${text3.slice(0, 200)}`, ranked: fallback };
       }
       const data = await res.json();
-      const text = (data.output ?? []).flatMap((o) => o.content ?? []).find((c) => c.type === "output_text")?.text;
-      if (!text) return { ok: false, ranker: "luna", error: "no output_text in response", ranked: fallback };
-      const parsed = JSON.parse(text);
+      const text2 = (data.output ?? []).flatMap((o) => o.content ?? []).find((c) => c.type === "output_text")?.text;
+      if (!text2) return { ok: false, ranker: "luna", error: "no output_text in response", ranked: fallback };
+      const parsed = JSON.parse(text2);
       const items = parsed.items.map((i2) => {
         const legacy = i2.critical === void 0 && i2.hazard === void 0 && i2.error_prone === void 0;
         const criteria = legacy ? { critical: Number(i2.score) || 0, hazard: Number(i2.score) || 0, error_prone: Number(i2.score) || 0 } : { critical: Number(i2.critical) || 0, hazard: Number(i2.hazard) || 0, error_prone: Number(i2.error_prone) || 0 };
@@ -34415,7 +34432,7 @@ function applyAnnotations(candidates2, items) {
   const annotated = candidates2.map((c) => {
     const a = byFile.get(c.file);
     if (!a) return { ...c, rank: 0 };
-    const properties = (a.properties ?? []).filter((p) => STRUCTURAL_CATALOGUE.includes(p));
+    const properties = (a.properties ?? []).filter((p) => CATALOGUE.includes(p));
     const score = Math.max(0, Math.min(1, Number(a.score) || 0));
     const ai = { score, reasons: (a.reasons ?? []).slice(0, 3), properties };
     if (a.criteria && typeof a.criteria === "object") {
@@ -34424,6 +34441,9 @@ function applyAnnotations(candidates2, items) {
     }
     if (a.reasked) ai.reasked = true;
     if (a.symbol && a.symbol.trim()) ai.symbol = a.symbol.trim();
+    if (a.lens === "security") ai.lens = "security";
+    const hypotheses = (Array.isArray(a.hypotheses) ? a.hypotheses : []).filter((h) => typeof h === "string" && h.trim().length > 0).slice(0, MAX_HYPOTHESES).map((h) => h.trim().slice(0, 300));
+    if (hypotheses.length) ai.hypotheses = hypotheses;
     return { ...c, rank: 0, ai };
   });
   annotated.sort((x, y) => {
@@ -34753,6 +34773,8 @@ var MAX_CO_ACCESSORS = 2;
 var MAX_HELPERS2 = 3;
 var MAX_CONTEXT_LINES = 120;
 var MAX_CALLERS2 = 3;
+var MAX_CHANGED_RANGES = 50;
+var MAX_HYPOTHESES2 = 3;
 var MAX_CALLER_LINES = 9;
 var MAX_HELPER_LINES = 80;
 var MAX_CONTEXT_BYTES = 48 * 1024;
@@ -34905,6 +34927,10 @@ def P1 : Property := { id := "parts_sum_to_total", kind := .structural, desc :=
 end Models.Split`;
 var RULES2 = `Write ONE Lean 4 model of the code below that could expose a real bug in it. Work in three steps.
 
+A PUSH. When the code below marks lines \`*|\`, this is the review of a push and those are the lines it changed. Look first for a bug the CHANGE introduced: what the changed lines made possible, removed or reordered \u2014 a check dropped, or moved after the write it guarded; a write moved before another; a new path that skips a dedup, a lock or a transaction; a new early return or exception that leaves state half-written; a new caller of shared state. Model the changed lines as actions (STEP 1). Among the properties (STEP 3), list FIRST those a trace through a changed line can break; a property that holds or fails the same without the change comes after them.
+
+AN ATTACKER. When the input says SECURITY, model the environment as an ATTACKER, not as nature. The attacker controls: how many requests they send, when, and in which interleaving (many copies of the same request at once included); the order of their own steps in a multi-step flow (they may skip, repeat or reorder steps); which of their own accounts they use (they may hold several); the inputs they type, and the DNS of domains they own; and when they act relative to other users, to outages and to slow dependencies. The attacker does not control secrets, other users' credentials or the server code. A property counts only when the attacker can cause its violation and gains data, rights, money or service they must not get. The promises to check: limits, balances, counters, single-use tokens and "already done" checks hold for EVERY interleaving (\`rule:once\`, \`rule:no-lost-update\`); state shared across requests never lets one user or tenant read or act with another's data or rights (\`rule:isolation\`); a removed right is never kept or regained through a refresh, a cache or a copied claim (\`rule:revocation\`); every step of a multi-step flow is bound to the same subject and value an earlier step proved (\`rule:flow-binding\`); duplicated, late or reordered events end in the state of the order they were produced in (\`rule:event-order\`); a failing dependency yields deny, never another subject's answer (\`rule:fail-closed\`); the value checked is the value used (\`rule:check-use\`).
+
 STEP 1 \u2014 Effects. The input lists the target's EFFECT SITES: awaits, calls on its dependencies, loops, try/catch, locks. Those are the only points where the real world can interleave, fail or crash. Each one that reads or writes shared state becomes an action, named after the real call and its line \u2014 "db.setBalance (L14)" \u2014 so a trace reads as a scenario someone can replay.
 
 STEP 2 \u2014 The environment's moves that exist in reality for THIS code, and only those:
@@ -34928,7 +34954,7 @@ STEP 3 \u2014 Properties: 2 to 4, in this order of priority:
   A counterexample must run the real function: a trace made only of environment moves (another writer, a clock) says nothing about this code. A promise about the END result (nothing lost, nothing charged twice, totals add up) is checked on states where every invocation has finished or crashed \u2014 guard the \`inv\` with the program counters, as exemplar 2's second property does; a violation that exists only while work is still pending is not a bug.
   A property is about an OUTCOME someone would call a bug \u2014 money, stock or records wrong, access granted, work lost or done twice, a job stuck forever \u2014 never about the mechanism's internals (a key's format, two timestamps being distinct, a lease's exact boundary tick). A comment that says HOW the code works ("make each attempt's key unique") is not the promise; the promise is what that mechanism is for.
   A comment that states a SAFE design choice ("a spent token presented again ends every session", "consumers dedupe, so publishing twice is harmless") is the design: never claim the opposite. A comment never makes an UNSAFE outcome safe: granting access on an error, losing or double-counting money, stock or records is a bug whatever the comment says ("don't block people when the permission service is flaky" describes a fail-open bug). Fail-open means an ACCESS decision: running WITHOUT an optional check when the check itself is unavailable, and saying so (a warning, a log line), is a stated degradation, not a fail-open \u2014 never claim it must fail closed.
-  Every property says what it rests on, in \`source\`: either \`L<n>: <words copied from that line>\` \u2014 a line of the numbered source above (a comment, docstring, check, error message or name) that states the promise \u2014 or one rule: \`rule:conservation\` (money, stock or counts add up), \`rule:once\` (no double effect: where the code dedups, or where the SAME input can arrive twice \u2014 an input that carries its own identity, such as an event, message, delivery or request id, redelivered or retried \u2014 even when the code has no dedup at all; a missing dedup is the bug, not a reason to drop the property. Two calls whose input carries no such identity are two operations: reserving a seat twice or creating a record twice from two requests is what the caller asked for, not a double effect), \`rule:no-lost-update\`, \`rule:fail-closed\` (an error in an access decision never grants access; an operation that failed is never reported as done), \`rule:progress\` (nothing stuck forever). A property that neither a line nor one of these rules supports is not a promise: do not state it. A property whose \`source\` is empty, or cites words its line does not contain, sends the model back.
+  Every property says what it rests on, in \`source\`: either \`L<n>: <words copied from that line>\` \u2014 a line of the numbered source above (a comment, docstring, check, error message or name) that states the promise \u2014 or one rule: \`rule:conservation\` (money, stock or counts add up), \`rule:once\` (no double effect: where the code dedups, or where the SAME input can arrive twice \u2014 an input that carries its own identity, such as an event, message, delivery or request id, redelivered or retried \u2014 even when the code has no dedup at all; a missing dedup is the bug, not a reason to drop the property. Two calls whose input carries no such identity are two operations: reserving a seat twice or creating a record twice from two requests is what the caller asked for, not a double effect), \`rule:no-lost-update\`, \`rule:fail-closed\` (an error in an access decision never grants access; an operation that failed is never reported as done), \`rule:progress\` (nothing stuck forever); and for an attacker (SECURITY) \`rule:isolation\`, \`rule:revocation\`, \`rule:flow-binding\`, \`rule:event-order\`, \`rule:check-use\` (AN ATTACKER says what each means). A property that neither a line nor one of these rules supports is not a promise: do not state it. A property whose \`source\` is empty, or cites words its line does not contain, sends the model back.
   When the input lists where the function is called, a caller's guard bounds its inputs: never build a counterexample from an input no caller can pass (an empty list a caller refuses).
   Property ids name the promise in snake_case (refund_total_within_capture) \u2014 never P1. \`desc\` states the promise in the code's own terms and names the move the trace needs ("two concurrent calls \u2026", "after the charge succeeded and the call timed out \u2026").
   A PURE computation (no effect sites) is checked with \`Verity.checkData\` on small concrete inputs, including the edge cases (exemplar 3).
@@ -34998,19 +35024,19 @@ var PURE_METHODS2 = /* @__PURE__ */ new Set([
   "test",
   "match"
 ]);
-function callsOn(text, name2) {
+function callsOn(text2, name2) {
   const needle = `${name2}.`;
-  for (let i2 = text.indexOf(needle); i2 >= 0; i2 = text.indexOf(needle, i2 + 1)) {
-    if (i2 > 0 && IDENT_CHAR2.test(text[i2 - 1])) continue;
-    const call = CALL_AFTER_DOT.exec(text.slice(i2 + needle.length));
+  for (let i2 = text2.indexOf(needle); i2 >= 0; i2 = text2.indexOf(needle, i2 + 1)) {
+    if (i2 > 0 && IDENT_CHAR2.test(text2[i2 - 1])) continue;
+    const call = CALL_AFTER_DOT.exec(text2.slice(i2 + needle.length));
     if (call && !PURE_METHODS2.has(call[1])) return true;
   }
   return false;
 }
-function callsDirect(text, name2) {
+function callsDirect(text2, name2) {
   const needle = `${name2}(`;
-  for (let i2 = text.indexOf(needle); i2 >= 0; i2 = text.indexOf(needle, i2 + 1)) {
-    if (i2 > 0 && IDENT_CHAR2.test(text[i2 - 1])) continue;
+  for (let i2 = text2.indexOf(needle); i2 >= 0; i2 = text2.indexOf(needle, i2 + 1)) {
+    if (i2 > 0 && IDENT_CHAR2.test(text2[i2 - 1])) continue;
     return true;
   }
   return false;
@@ -35042,17 +35068,44 @@ function effectSites(numbered2) {
   }
   return out2;
 }
+function starChanged(numbered2, changed) {
+  const isChanged = (n2) => !!changed?.some((r) => n2 >= r.from && n2 <= r.to);
+  const starred = [];
+  let total = 0;
+  const text2 = numbered2.split("\n").map((raw) => {
+    const m = NUMBERED_LINE.exec(raw);
+    if (!m) return raw;
+    total++;
+    const n2 = Number(m[1]);
+    if (!isChanged(n2)) return raw;
+    starred.push(n2);
+    return raw.replace("|", "*|");
+  }).join("\n");
+  const runs = [];
+  for (let i2 = 0; i2 < starred.length; i2++) {
+    let j = i2;
+    while (j + 1 < starred.length && starred[j + 1] === starred[j] + 1) j++;
+    runs.push(i2 === j ? `${starred[i2]}` : `${starred[i2]}\u2013${starred[j]}`);
+    i2 = j;
+  }
+  return { text: text2, ranges: runs.join(", "), count: starred.length, total };
+}
 function renderGenerateInput(t, previous) {
   const parts2 = [];
   parts2.push(`# Target: ${t.file} \u2014 \`${t.symbol}\`${t.lines ? ` (lines ${t.lines.from}\u2013${t.lines.to})` : ""}`);
   parts2.push(`Header values: file := "${t.file}", symbol := "${t.symbol}", sha256 := "${t.sha256}", lines := "${t.lines ? `${t.lines.from}-${t.lines.to}` : ""}"`);
   if (t.reasons.length) parts2.push(`Why it was selected: ${t.reasons.join(" \xB7 ")}`);
   if (t.properties.length) parts2.push(`Suggested properties: ${t.properties.join(", ")}`);
+  if (t.lens === "security") parts2.push("SECURITY: an attacker outside the trust boundary can drive this code. Follow AN ATTACKER.");
+  if (t.hypotheses?.length) parts2.push(`Hypotheses from the selector (questions to try, not verdicts):
+${t.hypotheses.slice(0, MAX_HYPOTHESES2).map((h) => `  - ${h}`).join("\n")}`);
   const numbered2 = t.numbered.slice(0, MAX_NUMBERED_BYTES);
   const sites = effectSites(numbered2);
+  const push = starChanged(numbered2, t.changed);
+  if (push.count > 0) parts2.push(`A push: it changed ${push.count} of these ${push.total} lines (${push.ranges}), marked \`*|\` below. Look first for a bug the change introduced.`);
   parts2.push("", sites.length ? `Effect sites (STEP 1 \u2014 where the real world can interleave, fail or crash):
 ${sites.map((s) => `  ${s}`).join("\n")}` : "Effect sites: none \u2014 a pure computation (STEP 3: Verity.checkData on concrete inputs).");
-  parts2.push("", "```", numbered2, "```");
+  parts2.push("", "```", push.count > 0 ? push.text : numbered2, "```");
   if (t.effects?.length) {
     parts2.push("", `State this function touches (from the parser; "via" names the helper that does it):
 ${t.effects.slice(0, MAX_CONTEXT_EFFECTS).map((e) => `  ${e}`).join("\n")}`);
@@ -35166,11 +35219,11 @@ async function generateModel(target, opts) {
     return { ok: false, error: name2 === "TimeoutError" || name2 === "AbortError" ? "timed out" : err2.message };
   }
   const usage = data.usage ? { inputTokens: Number(data.usage.input_tokens ?? 0), outputTokens: Number(data.usage.output_tokens ?? 0) } : null;
-  const text = (data.output ?? []).flatMap((o) => o.content ?? []).find((c) => c.type === "output_text")?.text;
-  if (!text) return { ok: false, error: "no output_text in response", usage };
+  const text2 = (data.output ?? []).flatMap((o) => o.content ?? []).find((c) => c.type === "output_text")?.text;
+  if (!text2) return { ok: false, error: "no output_text in response", usage };
   let parsed;
   try {
-    parsed = JSON.parse(text);
+    parsed = JSON.parse(text2);
   } catch {
     return { ok: false, error: "answer was not JSON", usage };
   }
@@ -35180,8 +35233,8 @@ async function generateModel(target, opts) {
 // src/lib/prove/replay.ts
 var MAX_SOURCE_BYTES = 96 * 1024;
 var MAX_MODEL_BYTES = 32 * 1024;
-function numberLines(text, from = 1) {
-  return text.split("\n").map((l, i2) => `${String(i2 + from).padStart(5)}| ${l}`).join("\n");
+function numberLines(text2, from = 1) {
+  return text2.split("\n").map((l, i2) => `${String(i2 + from).padStart(5)}| ${l}`).join("\n");
 }
 var PY_DECL = /^\s*(?:async\s+)?def\s+([A-Za-z_]\w*)\s*\(/;
 var TS_DECLS = [
@@ -35255,9 +35308,9 @@ function extractSymbolBody(source2, symbol, file, range) {
   }
   return null;
 }
-function significantLines(text) {
+function significantLines(text2) {
   const out2 = [];
-  for (const raw of text.split("\n")) {
+  for (const raw of text2.split("\n")) {
     const l = raw.trim();
     if (l.length < 12) continue;
     if (/^(\/\/|\/\*|\*|#)/.test(l)) continue;
@@ -35282,14 +35335,14 @@ function isTrackedInRoot(root, file) {
 function buildReplayBrief(root, report, property, modelSource, readSource) {
   const sources = (report.header?.abstracts ?? []).map((a) => {
     const read2 = readSource ? readSource(a.file, MAX_SOURCE_BYTES) : isTrackedInRoot(root, a.file) ? readRegularFileInRoot(root, a.file, MAX_SOURCE_BYTES) : { ok: false, reason: "not tracked by git \u2014 models may only abstract tracked source" };
-    const text = read2.ok ? read2.content : "";
+    const text2 = read2.ok ? read2.content : "";
     return {
       file: a.file,
       symbol: a.symbol,
-      numbered: text ? numberLines(text) : `(could not read ${a.file}: ${read2.ok ? "" : read2.reason})`,
-      symbolBody: text ? extractSymbolBody(text, a.symbol, a.file, a.lines) : null,
+      numbered: text2 ? numberLines(text2) : `(could not read ${a.file}: ${read2.ok ? "" : read2.reason})`,
+      symbolBody: text2 ? extractSymbolBody(text2, a.symbol, a.file, a.lines) : null,
       lines: a.lines,
-      content: text
+      content: text2
     };
   });
   return { model: report.model, property, modelSource: modelSource.slice(0, MAX_MODEL_BYTES), sources };
@@ -35371,7 +35424,7 @@ function parseReplayOutput(output) {
   let executedCalls = 0;
   const shellTexts = [];
   const outputTexts = [];
-  let text = null;
+  let text2 = null;
   for (const item of output) {
     if (item.type === "shell_call") {
       shellCalls++;
@@ -35387,13 +35440,13 @@ function parseReplayOutput(output) {
       }
     } else if (item.type === "message" && Array.isArray(item.content)) {
       const t = item.content.find((c) => c.type === "output_text")?.text;
-      if (typeof t === "string") text = t;
+      if (typeof t === "string") text2 = t;
     }
   }
   let claim = null;
-  if (text) {
+  if (text2) {
     try {
-      const o = JSON.parse(text);
+      const o = JSON.parse(text2);
       const verdict = o.verdict;
       if (verdict === "reproduced" || verdict === "diverged" || verdict === "unreplayable") {
         claim = {
@@ -36577,8 +36630,8 @@ function listModelFiles(root) {
   if (!(0, import_node_fs61.existsSync)(modelsAbs)) return [];
   return (0, import_node_fs61.readdirSync)(modelsAbs).filter((f) => isModelInRoot(modelsAbs, f)).sort().map((f) => (0, import_node_path48.join)(modelsAbs, f));
 }
-function trimDiagnostics(text) {
-  return text.split("\n").filter((l) => !l.startsWith("trace:")).join("\n").trim().slice(0, 4e3);
+function trimDiagnostics(text2) {
+  return text2.split("\n").filter((l) => !l.startsWith("trace:")).join("\n").trim().slice(0, 4e3);
 }
 function checkModel(tc, root, modelFile, opts = {}) {
   const proofsAbs = (0, import_node_path48.join)(root, PROOFS_DIR);
@@ -36646,33 +36699,70 @@ function writeResult(root, report) {
 function isCrashTrace(trace) {
   return trace.some((s) => /\b(crash\w*|kill\w*|restart\w*|interrupt\w*|power|abort\w*|process (dies|exit\w*)|lost (reply|response))\b/i.test(s));
 }
+function formalDisposition(f) {
+  if (f.verdict !== "reproduced" || f.waived) return "none";
+  const c = f.check;
+  if (!c || c.outcome !== "answered") return "block";
+  switch (c.verdict) {
+    case "REAL":
+      return c.introduced === "no" ? "report" : "block";
+    case "REAL-LOW":
+      return "report";
+    case "PREVENTED":
+    case "ARTIFACT":
+      return "checked";
+    default:
+      return "block";
+  }
+}
+var CAUTION = { block: 3, report: 2, checked: 1, none: 0 };
+function cautiousCheck(f, checks) {
+  if (checks.length === 0) return void 0;
+  let chosen = checks[0];
+  for (const c of checks.slice(1)) if (CAUTION[formalDisposition({ ...f, check: c })] > CAUTION[formalDisposition({ ...f, check: chosen })]) chosen = c;
+  return { ...chosen, votes: checks.map((c) => c.outcome === "answered" && c.verdict ? c.verdict : c.outcome), costUsd: checks.reduce((n2, c) => n2 + c.costUsd, 0), unpriced: checks.reduce((n2, c) => n2 + c.unpriced, 0) };
+}
+function checkLine(f) {
+  const c = f.check;
+  if (!c || c.outcome !== "answered" || !c.verdict) return "";
+  const why = c.verdict === "PREVENTED" ? c.preventedBy || c.reason : c.reason;
+  const from = c.trigger ? ` Reached from: ${c.trigger}.` : "";
+  const pre = c.introduced === "no" ? " Already possible before this change." : "";
+  const votes = c.votes && c.votes.length > 1 ? ` (${c.votes.length} checks: ${c.votes.join(", ")})` : "";
+  return `Checked: ${c.verdict}${votes}.${from}${pre} ${why ?? ""}`.trim();
+}
 function mergeFormalFindings(response, outcome, pushedFiles) {
-  if (!outcome) return { blocking: 0 };
+  if (!outcome) return { blocking: 0, reported: 0 };
   const norm3 = (p) => p.replace(/\\/g, "/");
   const pushed = new Set(pushedFiles.map(norm3));
-  const blocking = outcome.findings.filter((f) => f.verdict === "reproduced" && !f.waived && pushed.has(norm3(f.file)));
-  if (blocking.length === 0) return { blocking: 0 };
+  const onPush = outcome.findings.filter((f) => pushed.has(norm3(f.file)));
+  const blocking = onPush.filter((f) => formalDisposition(f) === "block");
+  const reported = onPush.filter((f) => formalDisposition(f) === "report");
+  if (blocking.length === 0 && reported.length === 0) return { blocking: 0, reported: 0 };
   const existing = Array.isArray(response.findings) ? response.findings : [];
-  response.findings = [
-    ...existing,
-    ...blocking.map((f) => ({
+  const asFinding = (f, blocks) => {
+    const checked = checkLine(f);
+    return {
       pattern_id: "formal-counterexample",
-      severity: "high",
-      scope: "change",
+      severity: blocks ? "high" : "medium",
+      // A bug this change did not introduce is filed the way the gate files everything it will not block on.
+      scope: f.check?.introduced === "no" && !blocks ? "pre-existing" : "change",
       file: f.file,
       line: outcome.target?.lines?.from ?? null,
       // Worded as the VIOLATION: the property text is what should hold, and
       // as a title it read backwards (e2e, 2026-09-26). A trace that needs a
       // crash between two writes is labelled: reproducing it means injecting
       // the crash, so it is a crash-consistency finding, not a race.
-      title: `Formal: ${terminalText(f.symbol, 128)} breaks "${terminalText(f.desc, 280)}"${isCrashTrace(f.trace) ? " after a crash (crash consistency)" : ""} \u2014 reproduced on the real code`,
-      description: terminalText(f.reason ?? "", 2e3),
+      title: `Formal: ${terminalText(f.symbol, 128)} breaks "${terminalText(f.desc, 280)}"${isCrashTrace(f.trace) ? " after a crash (crash consistency)" : ""} \u2014 reproduced on the real code${f.check?.outcome === "answered" ? `, checked ${f.check.verdict}` : ""}`,
+      description: terminalText([f.reason ?? "", checked].filter(Boolean).join(" "), 2e3),
       fix: { description: `Trace: ${terminalText(f.trace.join(" \u2192 ") || "(initial state)", 2e3)}. Replay: ${terminalText(f.reason ?? "reproduced in the container", 2e3)}` },
       source: "formal"
-    }))
-  ];
-  if (response.gate_decision !== "FAIL") response.gate_decision = "FAIL";
-  return { blocking: blocking.length };
+    };
+  };
+  response.findings = [...existing, ...blocking.map((f) => asFinding(f, true)), ...reported.map((f) => asFinding(f, false))];
+  if (blocking.length > 0) response.gate_decision = "FAIL";
+  else if (response.gate_decision === "PASS") response.gate_decision = "WARN";
+  return { blocking: blocking.length, reported: reported.length };
 }
 
 // src/lib/prove/scalpel.ts
@@ -36836,6 +36926,11 @@ function isEligible(s, largePush) {
   if (critical) return { ok: true, why: "domain-critical" };
   return { ok: false, why: "no effects, no risky shape, not domain-critical" };
 }
+function changedWithin(changed, lines) {
+  if (!changed?.length) return [];
+  const inside2 = lines ? changed.filter((r) => r.from <= lines.to && lines.from <= r.to).map((r) => ({ from: Math.max(r.from, lines.from), to: Math.min(r.to, lines.to) })) : changed;
+  return inside2.slice(0, MAX_CHANGED_RANGES);
+}
 function intersects(a, ranges) {
   return ranges.some((b) => a.from <= b.to && b.from <= a.to);
 }
@@ -36909,6 +37004,8 @@ function bumpLedger(root) {
 }
 var REPLAY_RESERVE_MS = 45e3;
 var MAX_REPLAYS = 3;
+var MAX_CHECKS = 2;
+var CHECK_VOTES = 2;
 function isNetworkError(message) {
   return /Network error|fetch failed|ETIMEDOUT|ECONNRESET|ECONNREFUSED|EAI_AGAIN|socket hang up/i.test(message);
 }
@@ -36991,7 +37088,9 @@ async function runFormalPhase(input) {
         symbol: f.symbol,
         verdict: "reproduced",
         reason: f.waived ? `waived ${f.waived.at.slice(0, 10)}: ${f.waived.reason} (standing since ${f.at.slice(0, 10)}; the file has not changed)` : `${f.reason ?? "reproduced on the real code"} (standing since ${f.at.slice(0, 10)}; the file has not changed)`,
-        ...f.waived ? { waived: true } : {}
+        ...f.waived ? { waived: true } : {},
+        // Same bytes, same answer: the check is not paid for twice.
+        ...f.check ? { check: { outcome: "answered", rounds: 0, costUsd: 0, unpriced: 0, durationMs: 0, ...f.check } } : {}
       });
     }
   }
@@ -37013,13 +37112,13 @@ async function runFormalPhase(input) {
   if (signals.length === 0) return done({ status: "skipped", skip: "no-source-files" });
   const largePush = signals.length >= LARGE_PUSH_FILES || files.length >= LARGE_PUSH_FILES * 2;
   const mapEligible = (file) => {
-    const changed = input.changedLines?.get(file);
-    if (!deps.codeMap || largePush || !changed?.length) return false;
+    const changed2 = input.changedLines?.get(file);
+    if (!deps.codeMap || largePush || !changed2?.length) return false;
     const read2 = readSrc(file, 96 * 1024);
     if (!read2.ok) return false;
     const outline = deps.codeMap.outline(file, read2.content);
     if (outline.source !== "tree-sitter") return false;
-    return outline.value.some((f) => changed.some((r) => f.start.line <= r.to && r.from <= f.end.line) && (() => {
+    return outline.value.some((f) => changed2.some((r) => f.start.line <= r.to && r.from <= f.end.line) && (() => {
       const a = deps.codeMap.access(file, read2.content, f);
       return a.source === "tree-sitter" && a.value.effects.length >= 2;
     })());
@@ -37079,8 +37178,8 @@ async function runFormalPhase(input) {
     }
     if (d.resolved && d.resolved !== c.ai.symbol) c.ai.symbol = d.resolved;
     if (input.changedLines) {
-      const changed = input.changedLines.get(c.file) ?? [];
-      if (changed.length === 0) {
+      const changed2 = input.changedLines.get(c.file) ?? [];
+      if (changed2.length === 0) {
         note("symbol-not-in-push", `${c.file}: no changed lines in this push`);
         continue;
       }
@@ -37088,7 +37187,7 @@ async function runFormalPhase(input) {
         note("symbol-not-in-push", `${c.ai.symbol}: body not found, cannot tell whether the push touched it`);
         continue;
       }
-      if (!intersects(d.lines, changed)) {
+      if (!intersects(d.lines, changed2)) {
         note("symbol-not-in-push", `${c.ai.symbol} (lines ${d.lines.from}\u2013${d.lines.to}) unchanged by this push`);
         continue;
       }
@@ -37146,7 +37245,8 @@ async function runFormalPhase(input) {
   if (!REPLAYABLE.test(top.file)) return done({ status: "skipped", skip: "replay-unsupported", detail: `${top.file}: replay supports TS/JS and Python`, target });
   if (timeLeft() < GENERATE_RESERVE_MS) return done({ status: "skipped", skip: "not-enough-time", detail: `${Math.round(timeLeft() / 1e3)} s left before generation`, target });
   bumpLedger(root);
-  const genTarget = { file: top.file, symbol: top.ai.symbol, lines, sha256: sha2562, numbered: numbered2, reasons: target.reasons, properties: top.ai.properties, ...chosen.context?.fields ?? {}, extentSource: chosen.extent };
+  const changed = changedWithin(input.changedLines?.get(top.file), lines);
+  const genTarget = { file: top.file, symbol: top.ai.symbol, lines, sha256: sha2562, numbered: numbered2, reasons: target.reasons, properties: top.ai.properties, ...chosen.context?.fields ?? {}, extentSource: chosen.extent, ...changed.length ? { changed } : {}, ...top.ai.lens === "security" ? { lens: "security" } : {}, ...top.ai.hypotheses?.length ? { hypotheses: top.ai.hypotheses } : {} };
   const headerFiles = /* @__PURE__ */ new Set([top.file, ...chosen.context?.files ?? []]);
   let previous;
   let report = null;
@@ -37267,13 +37367,40 @@ async function runFormalPhase(input) {
     const verdict = r.verdict === "reproduced" ? "reproduced" : r.verdict === "diverged" ? "diverged" : r.verdict === "unreplayable" ? "model-only" : "unverified";
     findings.push({ ...baseOf(p), verdict, reason: r.reason || r.downgrade || void 0 });
   }
+  const toCheck = deps.verify && !cancelled() ? findings.filter((f) => f.verdict === "reproduced").slice(0, MAX_CHECKS) : [];
+  if (toCheck.length > 0) {
+    progress.step = "verify";
+    const share = Math.max(0, costCap - usage.costUsd) / (toCheck.length * CHECK_VOTES);
+    const failed = (error) => ({ outcome: "failed", verdict: null, introduced: "unknown", rounds: 0, costUsd: 0, unpriced: 0, durationMs: 0, error });
+    await Promise.all(toCheck.map(async (f) => {
+      const checks = await Promise.all(Array.from({ length: CHECK_VOTES }, () => deps.verify(f, { ...lines ? { lines } : {}, changedLines: input.changedLines?.get(f.file) ?? [], deadlineAt: input.deadlineAt, costLeftUsd: share }).catch((err2) => failed(String(err2?.message ?? err2).slice(0, 120)))));
+      for (const c of checks) {
+        if (c.costUsd > 0) spend({ costUsd: c.costUsd });
+        for (let i2 = 0; i2 < c.unpriced; i2++) usage.unpriced++;
+      }
+      if (!cancelled()) f.check = cautiousCheck(f, checks);
+    }));
+  }
   const reproduced = findings.filter((f) => f.verdict === "reproduced");
   if (reproduced.length > 0 && !cancelled()) {
     const now = (/* @__PURE__ */ new Date()).toISOString();
     const others = readPersistedFindings(root).filter((f) => f.file !== top.file);
     writePersistedFindings(root, [
       ...others,
-      ...reproduced.map((f) => ({ file: f.file, symbol: f.symbol, sha256: sha2562, property: f.property, desc: f.desc, kind: f.kind, trace: f.trace, model: modelName, reason: f.reason, ...lines ? { lines } : {}, at: now }))
+      ...reproduced.map((f) => ({
+        file: f.file,
+        symbol: f.symbol,
+        sha256: sha2562,
+        property: f.property,
+        desc: f.desc,
+        kind: f.kind,
+        trace: f.trace,
+        model: modelName,
+        reason: f.reason,
+        ...lines ? { lines } : {},
+        at: now,
+        ...f.check?.outcome === "answered" ? { check: { verdict: f.check.verdict, introduced: f.check.introduced, trigger: f.check.trigger, preventedBy: f.check.preventedBy, effect: f.check.effect, reason: f.check.reason, ...f.check.votes ? { votes: f.check.votes } : {} } } : {}
+      }))
     ]);
   }
   const clean2 = findings.every((f) => f.verdict === "diverged");
@@ -37493,7 +37620,9 @@ function describeFormalOutcome(o) {
   if (o.status === "skipped") return `formal: skipped (${o.skip}${o.detail ? `: ${o.detail}` : ""})`;
   const parts2 = o.properties?.map((p) => {
     const f = o.findings.find((x) => x.property === p.id);
-    const tag = p.result === "counterexample" ? f ? f.verdict.toUpperCase() + (f.waived ? " (waived)" : "") : "counterexample" : p.result;
+    const votes = f?.check?.votes && f.check.votes.length > 1 ? ` [${f.check.votes.join(", ")}]` : "";
+    const checked = f?.check ? f.check.outcome === "answered" ? ` \u2192 checked ${f.check.verdict}${f.check.introduced === "no" ? " (pre-existing)" : ""}${votes}` : ` \u2192 not checked (${f.check.outcome})${votes}` : "";
+    const tag = p.result === "counterexample" ? f ? f.verdict.toUpperCase() + (f.waived ? " (waived)" : "") + checked : "counterexample" : p.result;
     return `${p.id} ${tag}`;
   }) ?? [];
   const cost = o.usage.costUsd > 0 ? ` \xB7 $${o.usage.costUsd.toFixed(2)}` : "";
@@ -37501,6 +37630,105 @@ function describeFormalOutcome(o) {
   return `formal: ${o.model?.name ?? "?"} on ${o.target?.file ?? "?"}#${o.target?.symbol ?? "?"} (${o.model?.rounds ?? 1} round${o.model?.rounds === 1 ? "" : "s"}) \xB7 ${parts2.join(" \xB7 ")} \xB7 ${Math.round(o.durationMs / 1e3)} s${cost}${cut}`;
 }
 
+// src/lib/prove/verify.ts
+var MIN_VERIFY_TURN_MS = 15e3;
+var MIN_VERIFY_START_MS = 45e3;
+var VERIFY_TURN_HOLD_USD = 0.1;
+var MAX_TURNS2 = 14;
+var VERDICTS = ["REAL", "REAL-LOW", "PREVENTED", "ARTIFACT", "UNSURE"];
+var verdictOf = (v) => typeof v === "string" && VERDICTS.includes(v) ? v : null;
+var introducedOf = (v) => v === "yes" || v === "no" ? v : "unknown";
+var text = (v, n2) => typeof v === "string" ? v.slice(0, n2) : "";
+function verifyPost(auth3) {
+  return async (body2, timeoutMs) => {
+    const res = await apiRequest({
+      method: "POST",
+      path: "/prove/verify",
+      serviceUrl: auth3.serviceUrl,
+      token: auth3.token,
+      // Streamed with a heartbeat, like generate and replay (decision 53).
+      extraHeaders: { "X-Verity-Keepalive": "1" },
+      body: body2,
+      timeout: timeoutMs,
+      cmd: "prove-verify"
+    });
+    return res.ok ? { ok: true, data: res.data ?? {} } : { ok: false, error: res.error };
+  };
+}
+function wellFormedCalls(raw, offered) {
+  const calls = [];
+  for (const c of raw) {
+    if (!c || typeof c !== "object" || Array.isArray(c)) return null;
+    const o = c;
+    if (typeof o.call_id !== "string" || o.call_id.length === 0 || o.call_id.length > 200) return null;
+    if (typeof o.name !== "string" || !offered.includes(o.name)) return null;
+    const args2 = o.arguments ?? {};
+    if (!args2 || typeof args2 !== "object" || Array.isArray(args2)) return null;
+    calls.push({ call_id: o.call_id, name: o.name, arguments: args2 });
+  }
+  return calls;
+}
+async function verifyFinding(input, opts) {
+  const now = opts.now ?? Date.now;
+  const startedAt = now();
+  const remaining = () => opts.deadlineAt - now();
+  let rounds = 0;
+  let costUsd = 0;
+  let unpriced = 0;
+  const end = (outcome, extra = {}) => ({ outcome, verdict: null, introduced: "unknown", rounds, costUsd, unpriced, durationMs: now() - startedAt, ...extra });
+  if (remaining() < MIN_VERIFY_START_MS) return end("deadline", { error: "not enough time left" });
+  let body2 = {
+    target: {
+      file: input.file,
+      symbol: input.symbol,
+      ...input.lines ? { lines: input.lines } : {},
+      property: input.property,
+      replay_reason: input.replayReason,
+      changed_lines: input.changedLines.slice(0, 200)
+    },
+    local_tools: opts.localTools
+  };
+  for (let turn = 0; turn < MAX_TURNS2; turn++) {
+    if (remaining() < MIN_VERIFY_TURN_MS) return end("deadline");
+    if (costUsd + VERIFY_TURN_HOLD_USD > opts.costLeftUsd) return end("cost-cap");
+    const res = await opts.post({ ...body2, remaining_ms: remaining() }, Math.max(1, remaining()));
+    if (!res.ok) return end("failed", { error: res.error.slice(0, 200) });
+    const d = res.data;
+    if (d.enabled === false) return end("disabled", { error: text(d.reason, 60) });
+    if (d.error && typeof d.error === "object") return end("failed", { error: text(d.error.code, 60) || "SERVICE_ERROR" });
+    rounds = typeof d.round === "number" && Number.isInteger(d.round) && d.round >= 0 ? d.round : rounds + 1;
+    if (typeof d.cost_usd === "number") {
+      if (!Number.isFinite(d.cost_usd) || d.cost_usd < 0) return end("failed", { error: "invalid cost" });
+      costUsd += d.cost_usd;
+    } else unpriced++;
+    if (d.done) {
+      const a = d.answer;
+      if (!a) return end("failed", { error: text(d.error, 60) || "no verdict" });
+      const verdict = verdictOf(a.verdict);
+      if (!verdict) return end("failed", { error: "unknown verdict" });
+      return end("answered", {
+        verdict,
+        claimed: verdictOf(a.claimed),
+        introduced: introducedOf(a.introduced),
+        trigger: text(a.trigger, 400),
+        preventedBy: typeof a.prevented_by === "string" ? a.prevented_by.slice(0, 600) : null,
+        effect: text(a.effect, 600),
+        reason: text(a.reason, 2e3),
+        quotes: (Array.isArray(a.quotes) ? a.quotes : []).slice(0, 12).flatMap((q) => {
+          const o = q ?? {};
+          return typeof o.path === "string" && typeof o.text === "string" ? [{ path: o.path.slice(0, 400), text: o.text.slice(0, 600), witnessed: o.witnessed === true }] : [];
+        })
+      });
+    }
+    if (typeof d.state !== "string" || !Array.isArray(d.calls)) return end("failed", { error: "malformed turn" });
+    const calls = wellFormedCalls(d.calls, opts.localTools);
+    if (!calls) return end("failed", { error: "malformed tool calls" });
+    const results = await opts.executeTools(calls);
+    body2 = { state: d.state, results };
+  }
+  return end("failed", { error: "too many turns" });
+}
+
 // src/lib/prove/record.ts
 var RECORD_TIMEOUT_MS = 8e3;
 var HOOK_EXIT_MARGIN_MS = 5e3;
@@ -37541,7 +37769,7 @@ var kind = (k) => k === "intent" ? "intent" : "structural";
 var signalsOf = (c) => c && typeof c.commits === "number" && typeof c.fixCommits === "number" ? { commits: c.commits, fix_commits: c.fixCommits, risk: Object.fromEntries(Object.entries(c.risk ?? {}).filter(([, n2]) => typeof n2 === "number" && n2 > 0).slice(0, 16)) } : null;
 function buildPhaseRecord(outcome, ctx) {
   const pushed = new Set(ctx.pushedFiles.map(norm2));
-  const blocks = (f) => ctx.moment === "push" && f.verdict === "reproduced" && !f.waived && pushed.has(norm2(f.file));
+  const blocks = (f) => ctx.moment === "push" && formalDisposition(f) === "block" && pushed.has(norm2(f.file));
   const symbol = (s) => ident2(s, SYMBOL, 200);
   return {
     moment: ctx.moment,
@@ -37581,7 +37809,9 @@ function buildPhaseRecord(outcome, ctx) {
       symbol: f.symbol,
       verdict: f.verdict,
       waived: f.waived === true,
-      blocked: blocks(f)
+      blocked: blocks(f),
+      // The check's closed codes only (decision 91): never its reason, trigger or quotes.
+      check: f.check ? { outcome: f.check.outcome, verdict: f.check.verdict, introduced: f.check.introduced, rounds: f.check.rounds } : null
     })),
     grounding: outcome.grounding ? {
       sent_back: outcome.grounding.sentBack,
@@ -37763,17 +37993,17 @@ function parsePrIntent(command) {
 }
 var TRIVIAL_INTENT = /^(wip|tmp|temp|test|fix|chore|amend|\.+|fixup!.*|squash!.*|merge\b.*)$/i;
 var SHELL_PLUMBING = /\$\(|`|<<-?\s*['"]?[A-Za-z_]/;
-function isSubstantiveIntent(text) {
-  if (!text) return false;
-  const t = text.trim();
+function isSubstantiveIntent(text2) {
+  if (!text2) return false;
+  const t = text2.trim();
   if (t.length < 12) return false;
   if (TRIVIAL_INTENT.test(t)) return false;
   if (SHELL_PLUMBING.test(t)) return false;
   return true;
 }
 function extractStatedIntent(moment, command, pushedMessages = null) {
-  const text = moment === "pre-commit" ? parseCommitMessage(command) : parsePrIntent(command) ?? pushedMessages;
-  return isSubstantiveIntent(text) ? text : null;
+  const text2 = moment === "pre-commit" ? parseCommitMessage(command) : parsePrIntent(command) ?? pushedMessages;
+  return isSubstantiveIntent(text2) ? text2 : null;
 }
 function hasBlockingFinding(response, sentFiles) {
   const findings = response.findings ?? [];
@@ -37976,6 +38206,14 @@ function startFormalPhase(input) {
   const run4 = async () => {
     const prep = await prepareFormalPhase(input.root, process.env, input.auth, readSource, withoutPaths(tip ? revisionSource(input.root, tip) : worktreeSource(input.root), isDeniedPath));
     if (!prep.ok) return skippedOutcome(prep.skip, prep.detail);
+    if (process.env.VERITY_FORMAL_VERIFY !== "off") {
+      const ctx = { root: input.root, range: input.range, codeMap: prep.deps.codeMap ?? null };
+      const post = verifyPost(input.auth);
+      prep.deps.verify = (f, v) => verifyFinding(
+        { file: f.file, symbol: f.symbol, ...v.lines ? { lines: v.lines } : {}, property: { desc: f.desc, kind: f.kind, trace: f.trace }, replayReason: f.reason ?? "", changedLines: v.changedLines },
+        { executeTools: makeToolExecutor(ctx), localTools: offeredLocalTools(ctx), deadlineAt: v.deadlineAt, costLeftUsd: v.costLeftUsd, post }
+      );
+    }
     return runFormalPhaseWithin({ root: input.root, files, changedLines, deadlineAt, deps: prep.deps });
   };
   return run4().catch((err2) => skippedOutcome("error", String(err2?.message ?? err2).slice(0, 200)));
@@ -38508,12 +38746,12 @@ function printBanner(opts) {
   const color = colorEnabled();
   const version = `v${cliVersion()}`;
   const art = [WORDMARK, WORDMARK_NARROW].find((a) => artWidth(a) <= columns) ?? null;
-  const dim = (text) => color ? `${DIM3}${text}${RESET2}` : text;
+  const dim = (text2) => color ? `${DIM3}${text2}${RESET2}` : text2;
   process.stderr.write("\n");
   if (!art) {
     const candidates2 = [`Verity ${version}`, "Verity"];
-    const text = candidates2.find((c) => c.length + INDENT.length <= columns);
-    if (text) process.stderr.write(`${INDENT}${dim(text)}
+    const text2 = candidates2.find((c) => c.length + INDENT.length <= columns);
+    if (text2) process.stderr.write(`${INDENT}${dim(text2)}
 `);
     process.stderr.write("\n");
     return;
@@ -39297,7 +39535,7 @@ var DIM4 = "\x1B[2m";
 var BOLD2 = "\x1B[1m";
 var RESET3 = "\x1B[0m";
 function renderSelect(question, choices, state, mode2, color = colorEnabled()) {
-  const paint = (text, code) => color ? `${code}${text}${RESET3}` : text;
+  const paint = (text2, code) => color ? `${code}${text2}${RESET3}` : text2;
   const lines = ["", `  ${question}`];
   const labelOf = (c) => `${c.label}${c.recommended ? " (recommended)" : ""}`;
   const gutter = Math.max(...choices.map((c) => labelOf(c).length));
@@ -40636,7 +40874,7 @@ function registerInitCommand(program2) {
         ...telemetryChoice ? { telemetry: telemetryChoice } : {},
         init: {
           completed_at: (/* @__PURE__ */ new Date()).toISOString(),
-          cli_version: true ? "0.34.3" : "dev"
+          cli_version: true ? "0.34.4" : "dev"
         }
       });
     } catch (err2) {
@@ -41077,11 +41315,11 @@ function resolve7(token, treePaths) {
   const matches = treePaths.filter((p) => p.endsWith(suffix));
   return matches.length === 1 ? matches[0] : null;
 }
-function deriveFileGlobs(text, treePaths) {
-  if (!text || treePaths.length === 0) return [];
+function deriveFileGlobs(text2, treePaths) {
+  if (!text2 || treePaths.length === 0) return [];
   const out2 = [];
   const seen = /* @__PURE__ */ new Set();
-  for (const raw of text.match(PATH_TOKEN) ?? []) {
+  for (const raw of text2.match(PATH_TOKEN) ?? []) {
     const token = clean(raw);
     if (!token) continue;
     const path = resolve7(token, treePaths);
@@ -42319,8 +42557,8 @@ function registerLeanCommand(program2) {
 }
 
 // src/cli.ts
-program.name("verity").description("CLI for Verity quality gate service").version("0.34.3").option("--token <token>", "Override authentication token").option("--service-url <url>", "Override service URL").option("--verbose", "Log HTTP requests/responses to stderr").hook("preAction", async (_thisCommand, actionCommand) => {
-  installStderrLog(actionCommand.name(), process.argv.slice(2), "0.34.3");
+program.name("verity").description("CLI for Verity quality gate service").version("0.34.4").option("--token <token>", "Override authentication token").option("--service-url <url>", "Override service URL").option("--verbose", "Log HTTP requests/responses to stderr").hook("preAction", async (_thisCommand, actionCommand) => {
+  installStderrLog(actionCommand.name(), process.argv.slice(2), "0.34.4");
   setUserNamedServiceUrl(program.opts().serviceUrl);
   try {
     await foldLegacyLocalCredential();