@codacy/verity-cli 0.34.2 → 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}
@@ -3919,8 +3919,8 @@ var require_Collection = __commonJS2({
         return this.items.every((node) => {
           if (!identity.isPair(node))
             return false;
-          const n = node.value;
-          return n == null || allowScalar && identity.isScalar(n) && n.value == null && !n.commentBefore && !n.comment && !n.tag;
+          const n2 = node.value;
+          return n2 == null || allowScalar && identity.isScalar(n2) && n2.value == null && !n2.commentBefore && !n2.comment && !n2.tag;
         });
       }
       /**
@@ -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;
@@ -5360,18 +5360,18 @@ var require_stringifyNumber = __commonJS2({
       const num = typeof value === "number" ? value : Number(value);
       if (!isFinite(num))
         return isNaN(num) ? ".nan" : num < 0 ? "-.inf" : ".inf";
-      let n = Object.is(value, -0) ? "-0" : JSON.stringify(value);
-      if (!format && minFractionDigits && (!tag || tag === "tag:yaml.org,2002:float") && /^\d/.test(n)) {
-        let i2 = n.indexOf(".");
+      let n2 = Object.is(value, -0) ? "-0" : JSON.stringify(value);
+      if (!format && minFractionDigits && (!tag || tag === "tag:yaml.org,2002:float") && /^\d/.test(n2)) {
+        let i2 = n2.indexOf(".");
         if (i2 < 0) {
-          i2 = n.length;
-          n += ".";
+          i2 = n2.length;
+          n2 += ".";
         }
-        let d = minFractionDigits - (n.length - i2 - 1);
+        let d = minFractionDigits - (n2.length - i2 - 1);
         while (d-- > 0)
-          n += "0";
+          n2 += "0";
       }
-      return n;
+      return n2;
     }
     exports2.stringifyNumber = stringifyNumber;
   }
@@ -5615,9 +5615,9 @@ var require_binary = __commonJS2({
         type ?? (type = Scalar.Scalar.BLOCK_LITERAL);
         if (type !== Scalar.Scalar.QUOTE_DOUBLE) {
           const lineWidth = Math.max(ctx.options.lineWidth - ctx.indent.length, ctx.options.minContentWidth);
-          const n = Math.ceil(str3.length / lineWidth);
-          const lines = new Array(n);
-          for (let i2 = 0, o = 0; i2 < n; ++i2, o += lineWidth) {
+          const n2 = Math.ceil(str3.length / lineWidth);
+          const lines = new Array(n2);
+          for (let i2 = 0, o = 0; i2 < n2; ++i2, o += lineWidth) {
             lines[i2] = str3.substr(o, lineWidth);
           }
           str3 = lines.join(type === Scalar.Scalar.BLOCK_LITERAL ? "\n" : " ");
@@ -5889,11 +5889,11 @@ var require_int2 = __commonJS2({
             str3 = `0x${str3}`;
             break;
         }
-        const n2 = BigInt(str3);
-        return sign === "-" ? BigInt(-1) * n2 : n2;
+        const n3 = BigInt(str3);
+        return sign === "-" ? BigInt(-1) * n3 : n3;
       }
-      const n = parseInt(str3, radix);
-      return sign === "-" ? -1 * n : n;
+      const n2 = parseInt(str3, radix);
+      return sign === "-" ? -1 * n2 : n2;
     }
     function intStringify(node, radix, prefix) {
       const { value } = node;
@@ -6042,15 +6042,15 @@ var require_timestamp = __commonJS2({
     function parseSexagesimal(str3, asBigInt) {
       const sign = str3[0];
       const parts2 = sign === "-" || sign === "+" ? str3.substring(1) : str3;
-      const num = (n) => asBigInt ? BigInt(n) : Number(n);
+      const num = (n2) => asBigInt ? BigInt(n2) : Number(n2);
       const res = parts2.replace(/_/g, "").split(":").reduce((res2, p) => res2 * num(60) + num(p), num(0));
       return sign === "-" ? num(-1) * res : res;
     }
     function stringifySexagesimal(node) {
       let { value } = node;
-      let num = (n) => n;
+      let num = (n2) => n2;
       if (typeof value === "bigint")
-        num = (n) => BigInt(n);
+        num = (n2) => BigInt(n2);
       else if (isNaN(value) || !isFinite(value))
         return stringifyNumber.stringifyNumber(node);
       let sign = "";
@@ -6070,7 +6070,7 @@ var require_timestamp = __commonJS2({
           parts2.unshift(value);
         }
       }
-      return sign + parts2.map((n) => String(n).padStart(2, "0")).join(":").replace(/000000\d*$/, "");
+      return sign + parts2.map((n2) => String(n2).padStart(2, "0")).join(":").replace(/000000\d*$/, "");
     }
     var intTime = {
       identify: (value) => typeof value === "bigint" || Number.isInteger(value),
@@ -7541,9 +7541,9 @@ var require_resolve_block_scalar = __commonJS2({
         if (!chomp && (ch === "-" || ch === "+"))
           chomp = ch;
         else {
-          const n = Number(ch);
-          if (!indent && n)
-            indent = n;
+          const n2 = Number(ch);
+          if (!indent && n2)
+            indent = n2;
           else if (error === -1)
             error = offset + i2;
         }
@@ -8760,8 +8760,8 @@ var require_lexer = __commonJS2({
           return this.buffer[i2 + 1] === "\n";
         return false;
       }
-      charAt(n) {
-        return this.buffer[this.pos + n];
+      charAt(n2) {
+        return this.buffer[this.pos + n2];
       }
       continueScalar(offset) {
         let ch = this.buffer[offset];
@@ -8795,8 +8795,8 @@ var require_lexer = __commonJS2({
           end -= 1;
         return this.buffer.substring(this.pos, end);
       }
-      hasChars(n) {
-        return this.pos + n <= this.buffer.length;
+      hasChars(n2) {
+        return this.pos + n2 <= this.buffer.length;
       }
       setNext(state) {
         this.buffer = this.buffer.substring(this.pos);
@@ -8805,8 +8805,8 @@ var require_lexer = __commonJS2({
         this.next = state;
         return null;
       }
-      peek(n) {
-        return this.buffer.substr(this.pos, n);
+      peek(n2) {
+        return this.buffer.substr(this.pos, n2);
       }
       *parseNext(next) {
         switch (next) {
@@ -8855,8 +8855,8 @@ var require_lexer = __commonJS2({
             else
               break;
           }
-          const n = (yield* this.pushCount(dirEnd)) + (yield* this.pushSpaces(true));
-          yield* this.pushCount(line2.length - n);
+          const n2 = (yield* this.pushCount(dirEnd)) + (yield* this.pushSpaces(true));
+          yield* this.pushCount(line2.length - n2);
           this.pushNewline();
           return "stream";
         }
@@ -8894,9 +8894,9 @@ var require_lexer = __commonJS2({
         if (!ch1 && !this.atEnd)
           return this.setNext("block-start");
         if ((ch0 === "-" || ch0 === "?" || ch0 === ":") && isEmpty(ch1)) {
-          const n = (yield* this.pushCount(1)) + (yield* this.pushSpaces(true));
+          const n2 = (yield* this.pushCount(1)) + (yield* this.pushSpaces(true));
           this.indentNext = this.indentValue + 1;
-          this.indentValue += n;
+          this.indentValue += n2;
           return yield* this.parseBlockStart();
         }
         return "doc";
@@ -8906,10 +8906,10 @@ var require_lexer = __commonJS2({
         const line2 = this.getLine();
         if (line2 === null)
           return this.setNext("doc");
-        let n = yield* this.pushIndicators();
-        switch (line2[n]) {
+        let n2 = yield* this.pushIndicators();
+        switch (line2[n2]) {
           case "#":
-            yield* this.pushCount(line2.length - n);
+            yield* this.pushCount(line2.length - n2);
           // fallthrough
           case void 0:
             yield* this.pushNewline();
@@ -8932,9 +8932,9 @@ var require_lexer = __commonJS2({
             return yield* this.parseQuotedScalar();
           case "|":
           case ">":
-            n += yield* this.parseBlockScalarHeader();
-            n += yield* this.pushSpaces(true);
-            yield* this.pushCount(line2.length - n);
+            n2 += yield* this.parseBlockScalarHeader();
+            n2 += yield* this.pushSpaces(true);
+            yield* this.pushCount(line2.length - n2);
             yield* this.pushNewline();
             return yield* this.parseBlockScalar();
           default:
@@ -8965,18 +8965,18 @@ var require_lexer = __commonJS2({
             return yield* this.parseLineStart();
           }
         }
-        let n = 0;
-        while (line2[n] === ",") {
-          n += yield* this.pushCount(1);
-          n += yield* this.pushSpaces(true);
+        let n2 = 0;
+        while (line2[n2] === ",") {
+          n2 += yield* this.pushCount(1);
+          n2 += yield* this.pushSpaces(true);
           this.flowKey = false;
         }
-        n += yield* this.pushIndicators();
-        switch (line2[n]) {
+        n2 += yield* this.pushIndicators();
+        switch (line2[n2]) {
           case void 0:
             return "flow";
           case "#":
-            yield* this.pushCount(line2.length - n);
+            yield* this.pushCount(line2.length - n2);
             return "flow";
           case "{":
           case "[":
@@ -9020,10 +9020,10 @@ var require_lexer = __commonJS2({
             end = this.buffer.indexOf("'", end + 2);
         } else {
           while (end !== -1) {
-            let n = 0;
-            while (this.buffer[end - 1 - n] === "\\")
-              n += 1;
-            if (n % 2 === 0)
+            let n2 = 0;
+            while (this.buffer[end - 1 - n2] === "\\")
+              n2 += 1;
+            if (n2 % 2 === 0)
               break;
             end = this.buffer.indexOf('"', end + 1);
           }
@@ -9177,11 +9177,11 @@ var require_lexer = __commonJS2({
         yield* this.pushToIndex(end + 1, true);
         return inFlow ? "flow" : "doc";
       }
-      *pushCount(n) {
-        if (n > 0) {
-          yield this.buffer.substr(this.pos, n);
-          this.pos += n;
-          return n;
+      *pushCount(n2) {
+        if (n2 > 0) {
+          yield this.buffer.substr(this.pos, n2);
+          this.pos += n2;
+          return n2;
         }
         return 0;
       }
@@ -9255,12 +9255,12 @@ var require_lexer = __commonJS2({
         do {
           ch = this.buffer[++i2];
         } while (ch === " " || allowTabs && ch === "	");
-        const n = i2 - this.pos;
-        if (n > 0) {
-          yield this.buffer.substr(this.pos, n);
+        const n2 = i2 - this.pos;
+        if (n2 > 0) {
+          yield this.buffer.substr(this.pos, n2);
           this.pos = i2;
         }
-        return n;
+        return n2;
       }
       *pushUntil(test) {
         let i2 = this.pos;
@@ -9528,8 +9528,8 @@ var require_parser = __commonJS2({
         }
         yield* this.pop();
       }
-      peek(n) {
-        return this.stack[this.stack.length - n];
+      peek(n2) {
+        return this.stack[this.stack.length - n2];
       }
       *pop(error) {
         const token = error ?? this.stack.pop();
@@ -10895,8 +10895,8 @@ var require_web_tree_sitter2 = __commonJS2({
             }, "getMemory");
             var isInternalSym = /* @__PURE__ */ __name((symName) => ["__cpp_exception", "__c_longjmp", "__wasm_apply_data_relocs", "__dso_handle", "__tls_size", "__tls_align", "__set_stack_limits", "_emscripten_tls_init", "__wasm_init_tls", "__wasm_call_ctors", "__start_em_asm", "__stop_em_asm", "__start_em_js", "__stop_em_js"].includes(symName) || symName.startsWith("__em_js__"), "isInternalSym");
             var uleb128EncodeWithLen = /* @__PURE__ */ __name((arr) => {
-              const n = arr.length;
-              return [n % 128 | 128, n >> 7, ...arr];
+              const n2 = arr.length;
+              return [n2 % 128 | 128, n2 >> 7, ...arr];
             }, "uleb128EncodeWithLen");
             var wasmTypeCodes = {
               "i": 127,
@@ -13001,13 +13001,13 @@ var require_web_tree_sitter2 = __commonJS2({
             symbols.push(65535);
           }
         }
-        for (let i2 = 0, n = typesBySymbol.length; i2 < n; i2++) {
+        for (let i2 = 0, n2 = typesBySymbol.length; i2 < n2; i2++) {
           if (types.includes(typesBySymbol[i2])) {
             symbols.push(i2);
           }
         }
         const symbolsAddress = C._malloc(SIZE_OF_INT * symbols.length);
-        for (let i2 = 0, n = symbols.length; i2 < n; i2++) {
+        for (let i2 = 0, n2 = symbols.length; i2 < n2; i2++) {
           C.setValue(symbolsAddress + i2 * SIZE_OF_INT, symbols[i2], "i32");
         }
         marshalNode(this);
@@ -13196,7 +13196,7 @@ var require_web_tree_sitter2 = __commonJS2({
       }
     };
     function unmarshalCaptures(query, tree, address, patternIndex, result) {
-      for (let i2 = 0, n = result.length; i2 < n; i2++) {
+      for (let i2 = 0, n2 = result.length; i2 < n2; i2++) {
         const captureIndex = C.getValue(address, "i32");
         address += SIZE_OF_INT;
         const node = unmarshalNode(tree, address);
@@ -13335,13 +13335,13 @@ var require_web_tree_sitter2 = __commonJS2({
         assertInternal(internal);
         this[0] = address;
         this.types = new Array(C._ts_language_symbol_count(this[0]));
-        for (let i2 = 0, n = this.types.length; i2 < n; i2++) {
+        for (let i2 = 0, n2 = this.types.length; i2 < n2; i2++) {
           if (C._ts_language_symbol_type(this[0], i2) < 2) {
             this.types[i2] = C.UTF8ToString(C._ts_language_symbol_name(this[0], i2));
           }
         }
         this.fields = new Array(C._ts_language_field_count(this[0]) + 1);
-        for (let i2 = 0, n = this.fields.length; i2 < n; i2++) {
+        for (let i2 = 0, n2 = this.fields.length; i2 < n2; i2++) {
           const fieldName = C._ts_language_field_name_for_id(this[0], i2);
           if (fieldName !== 0) {
             this.fields[i2] = C.UTF8ToString(fieldName);
@@ -13844,8 +13844,8 @@ ${JSON.stringify(symbolNames, null, 2)}`);
       } else {
         const captureName = steps[1].name;
         const stringValue = steps[2].value;
-        const matches = /* @__PURE__ */ __name((n) => n.text === stringValue, "matches");
-        const doesNotMatch = /* @__PURE__ */ __name((n) => n.text !== stringValue, "doesNotMatch");
+        const matches = /* @__PURE__ */ __name((n2) => n2.text === stringValue, "matches");
+        const doesNotMatch = /* @__PURE__ */ __name((n2) => n2.text !== stringValue, "doesNotMatch");
         textPredicates[index].push((captures) => {
           const nodes = [];
           for (const c of captures) {
@@ -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");
@@ -15210,8 +15210,8 @@ function commitsSincePaths(sha, paths) {
       encoding: "utf-8",
       stdio: ["pipe", "pipe", "pipe"]
     }).trim();
-    const n = Number.parseInt(out2, 10);
-    return Number.isFinite(n) ? n : null;
+    const n2 = Number.parseInt(out2, 10);
+    return Number.isFinite(n2) ? n2 : null;
   } catch {
     return null;
   }
@@ -15579,15 +15579,15 @@ function reverifyNudge(who) {
   }
   return null;
 }
-function isLegacyPerRepoCredential(auth2) {
-  return auth2.source === "local" || auth2.source === "global" && auth2.keyed === true;
+function isLegacyPerRepoCredential(auth3) {
+  return auth3.source === "local" || auth3.source === "global" && auth3.keyed === true;
 }
-async function shouldUpgradeOnLogin(auth2) {
-  if (!isLegacyPerRepoCredential(auth2)) return false;
-  if (auth2.userId == null) return true;
+async function shouldUpgradeOnLogin(auth3) {
+  if (!isLegacyPerRepoCredential(auth3)) return false;
+  if (auth3.userId == null) return true;
   const bare = await readGlobalCredential("");
   if (bare?.userId == null) return true;
-  return bare.userId === auth2.userId;
+  return bare.userId === auth3.userId;
 }
 function authDenialRemedy(error) {
   if (error.startsWith("STALE_VERIFICATION")) {
@@ -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}
 `
         );
       });
@@ -16073,8 +16073,8 @@ async function loginOnce(opts) {
 
 // src/commands/auth.ts
 function registerAuthCommands(program2) {
-  const auth2 = program2.command("auth").description("Manage project authentication");
-  auth2.command("register").description("Register a project with Verity").requiredOption("--project <name>", "Project name").option("--remote <url>", "Git remote URL (auto-detected if omitted)").action(async (opts) => {
+  const auth3 = program2.command("auth").description("Manage project authentication");
+  auth3.command("register").description("Register a project with Verity").requiredOption("--project <name>", "Project name").option("--remote <url>", "Git remote URL (auto-detected if omitted)").action(async (opts) => {
     const globals = program2.opts();
     const serviceUrl = globals.serviceUrl ?? DEFAULT_SERVICE_URL;
     let remote = opts.remote;
@@ -16101,7 +16101,7 @@ function registerAuthCommands(program2) {
     if (email) printInfo(`Authenticated as: ${email}`);
     printJson({ project_id: projectId, service_url: resolvedUrl });
   });
-  auth2.command("verify").description("Verify the current token is valid").action(async () => {
+  auth3.command("verify").description("Verify the current token is valid").action(async () => {
     const globals = program2.opts();
     const tokenResult = await resolveToken(globals.token);
     if (!tokenResult.ok) {
@@ -16127,7 +16127,7 @@ function registerAuthCommands(program2) {
     printInfo(`Token valid. Project: ${result.data.project_name}`);
     printJson(result.data);
   });
-  auth2.command("discover").description("Check if a project is registered").option("--remote <url>", "Git remote URL (auto-detected if omitted)").action(async (opts) => {
+  auth3.command("discover").description("Check if a project is registered").option("--remote <url>", "Git remote URL (auto-detected if omitted)").action(async (opts) => {
     const globals = program2.opts();
     let remote = opts.remote;
     if (!remote) {
@@ -16718,8 +16718,8 @@ function registerLogoutCommand(program2) {
         explain(result.error);
         process.exit(1);
       }
-      const n = result.data.revoked;
-      printInfo(`Revoked ${n} login${n === 1 ? "" : "s"}. \u2713`);
+      const n2 = result.data.revoked;
+      printInfo(`Revoked ${n2} login${n2 === 1 ? "" : "s"}. \u2713`);
       if (opts.others) {
         printInfo("  This machine is still signed in.");
         return;
@@ -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`;
@@ -18631,12 +18631,12 @@ function renderIndex(orgName, nodes) {
     ""
   ];
   const byKind = /* @__PURE__ */ new Map();
-  for (const n of nodes) byKind.set(n.kind, [...byKind.get(n.kind) ?? [], n]);
+  for (const n2 of nodes) byKind.set(n2.kind, [...byKind.get(n2.kind) ?? [], n2]);
   for (const kind2 of ORG_KINDS) {
     const list2 = byKind.get(kind2);
     if (!list2?.length) continue;
     lines.push(`## ${kind2}/ (${list2.length})`);
-    for (const n of list2) lines.push(`- [[${orgNodePath(n).split("/")[1].replace(/\.md$/, "")}]] \u2014 ${n.title} \xB7 ${n.origin}`);
+    for (const n2 of list2) lines.push(`- [[${orgNodePath(n2).split("/")[1].replace(/\.md$/, "")}]] \u2014 ${n2.title} \xB7 ${n2.origin}`);
     lines.push("");
   }
   if (nodes.length === 0) lines.push("No org knowledge yet.", "");
@@ -18661,26 +18661,26 @@ async function pullOrgKnowledge(opts) {
   const page = res.data;
   if (page.unchanged) return { ok: true, status: "unchanged", received: 0, dir };
   const org = page.organization;
-  const nodes = org ? (page.nodes ?? []).flatMap((n) => typeof n.tag_id === "string" && typeof n.title === "string" && typeof n.body === "string" ? [{
-    tag_id: n.tag_id,
-    node_id: typeof n.node_id === "string" ? n.node_id : "",
-    kind: typeof n.kind === "string" ? n.kind : "domain",
-    title: n.title,
-    body: n.body.slice(0, BODY_MAX),
-    origin: typeof n.origin === "string" ? n.origin : "",
-    signal: typeof n.signal === "string" ? n.signal : "",
-    tier: typeof n.tier === "number" ? n.tier : null,
-    applies_to: Array.isArray(n.applies_to) ? n.applies_to.filter((v) => typeof v === "string") : [],
-    source_repo_count: typeof n.source_repo_count === "number" ? n.source_repo_count : 1,
-    promoted_at: typeof n.promoted_at === "string" ? n.promoted_at : ""
+  const nodes = org ? (page.nodes ?? []).flatMap((n2) => typeof n2.tag_id === "string" && typeof n2.title === "string" && typeof n2.body === "string" ? [{
+    tag_id: n2.tag_id,
+    node_id: typeof n2.node_id === "string" ? n2.node_id : "",
+    kind: typeof n2.kind === "string" ? n2.kind : "domain",
+    title: n2.title,
+    body: n2.body.slice(0, BODY_MAX),
+    origin: typeof n2.origin === "string" ? n2.origin : "",
+    signal: typeof n2.signal === "string" ? n2.signal : "",
+    tier: typeof n2.tier === "number" ? n2.tier : null,
+    applies_to: Array.isArray(n2.applies_to) ? n2.applies_to.filter((v) => typeof v === "string") : [],
+    source_repo_count: typeof n2.source_repo_count === "number" ? n2.source_repo_count : 1,
+    promoted_at: typeof n2.promoted_at === "string" ? n2.promoted_at : ""
   }] : []) : [];
   const written = /* @__PURE__ */ new Set();
   await (0, import_promises7.mkdir)(dir, { recursive: true });
-  for (const n of nodes) {
-    const rel = orgNodePath(n);
+  for (const n2 of nodes) {
+    const rel = orgNodePath(n2);
     if (written.has(rel)) continue;
     await (0, import_promises7.mkdir)((0, import_node_path14.join)(dir, rel.split("/")[0]), { recursive: true });
-    await (0, import_promises7.writeFile)((0, import_node_path14.join)(dir, rel), renderOrgNode(n, org?.name ?? ""));
+    await (0, import_promises7.writeFile)((0, import_node_path14.join)(dir, rel), renderOrgNode(n2, org?.name ?? ""));
     written.add(rel);
   }
   for (const rel of state.files) {
@@ -18779,9 +18779,9 @@ function readOpened(fd, size) {
     const buffer = Buffer.alloc(size);
     let offset = 0;
     while (offset < size) {
-      const n = (0, import_node_fs15.readSync)(fd, buffer, offset, size - offset, offset);
-      if (n === 0) break;
-      offset += n;
+      const n2 = (0, import_node_fs15.readSync)(fd, buffer, offset, size - offset, offset);
+      if (n2 === 0) break;
+      offset += n2;
     }
     return buffer.subarray(0, offset);
   } finally {
@@ -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) {
@@ -18976,18 +18976,18 @@ function posteriorFor(kind2, own, pooled) {
   return { alpha: p.alpha + Math.max(0, own.alpha), beta: p.beta + Math.max(0, own.beta) };
 }
 function posteriorMean(p) {
-  const n = p.alpha + p.beta;
-  return n <= 0 ? DEFAULT_PRIOR_MEAN : p.alpha / n;
+  const n2 = p.alpha + p.beta;
+  return n2 <= 0 ? DEFAULT_PRIOR_MEAN : p.alpha / n2;
 }
 function scoreCandidates(nodes, ctx, opts = {}) {
   const floor = opts.relevanceFloor ?? RELEVANCE_FLOOR;
   const out2 = [];
-  for (const n of nodes) {
-    const rel = relevance(n, ctx);
+  for (const n2 of nodes) {
+    const rel = relevance(n2, ctx);
     if (rel.score < floor) continue;
-    const post = posteriorFor(n.kind, opts.posteriors?.get(n.id), opts.kindPosteriors?.get(n.kind));
+    const post = posteriorFor(n2.kind, opts.posteriors?.get(n2.id), opts.kindPosteriors?.get(n2.kind));
     const usefulness = posteriorMean(post);
-    out2.push({ id: n.id, score: rel.score * usefulness, relevance: rel.score, usefulness, via: rel.via });
+    out2.push({ id: n2.id, score: rel.score * usefulness, relevance: rel.score, usefulness, via: rel.via });
   }
   out2.sort((a, b) => b.score - a.score || (a.id < b.id ? -1 : a.id > b.id ? 1 : 0));
   return out2;
@@ -19001,29 +19001,29 @@ 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) {
-  let n = 0;
-  for (const w of a) if (b.has(w)) n++;
-  return n;
+  let n2 = 0;
+  for (const w of a) if (b.has(w)) n2++;
+  return n2;
 }
-function orgNodeToLocal(n) {
+function orgNodeToLocal(n2) {
   return {
-    path: `org:${n.tag_id}`,
-    nodeId: n.tag_id,
-    kind: n.kind,
-    title: n.title,
-    body: n.body.slice(0, 2e3),
+    path: `org:${n2.tag_id}`,
+    nodeId: n2.tag_id,
+    kind: n2.kind,
+    title: n2.title,
+    body: n2.body.slice(0, 2e3),
     fileGlobs: [],
     confidence: 0.5,
     citedCount: 0,
-    tokenEstimate: Math.ceil((n.title.length + n.body.length) / 4) + 20,
+    tokenEstimate: Math.ceil((n2.title.length + n2.body.length) / 4) + 20,
     scope: "org",
-    origin: n.origin
+    origin: n2.origin
   };
 }
 function globMatch(glob, filePath) {
@@ -19136,11 +19136,11 @@ async function retrieveForInjection(promptText, taskFiles = [], budgetTokens = D
   } catch {
   }
   if (nodes.length === 0) return null;
-  const scored = nodes.map((n) => ({
-    ...n,
-    score: scoreNode(n, promptTokens, taskFiles)
+  const scored = nodes.map((n2) => ({
+    ...n2,
+    score: scoreNode(n2, promptTokens, taskFiles)
   }));
-  const filtered = scored.filter((n) => n.score >= MIN_SCORE);
+  const filtered = scored.filter((n2) => n2.score >= MIN_SCORE);
   filtered.sort((a, b) => b.score - a.score);
   const selected = [];
   let tokensUsed = 0;
@@ -19153,7 +19153,7 @@ async function retrieveForInjection(promptText, taskFiles = [], budgetTokens = D
   const lines = [
     "## Project Knowledge (auto-injected)",
     "",
-    `*${selected.length} node(s) relevant to your current task. See \`.verity/memory/index.md\` for the full knowledge base${selected.some((n) => n.scope === "org") ? ", and `~/.verity/orgs/` for what the organization's other repositories learned" : ""}.*`,
+    `*${selected.length} node(s) relevant to your current task. See \`.verity/memory/index.md\` for the full knowledge base${selected.some((n2) => n2.scope === "org") ? ", and `~/.verity/orgs/` for what the organization's other repositories learned" : ""}.*`,
     ""
   ];
   for (const node of selected) {
@@ -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);
   });
 }
 
@@ -19317,9 +19317,9 @@ function parseInjectionEvent(raw) {
   if (!nonNegInt(o.eligible, 1e5) || !nonNegInt(o.tokens, 1e6)) return null;
   if (!Array.isArray(o.nodes) || o.nodes.length > MAX_NODES) return null;
   const nodes = [];
-  for (const n of o.nodes) {
-    if (!n || typeof n !== "object") return null;
-    const r = n;
+  for (const n2 of o.nodes) {
+    if (!n2 || typeof n2 !== "object") return null;
+    const r = n2;
     if (typeof r.id !== "string" || !SAFE_ID.test(r.id)) return null;
     if (typeof r.score !== "number" || !Number.isFinite(r.score) || r.score < 0 || r.score > 10) return null;
     if (typeof r.via !== "string" || !VIA.test(r.via)) return null;
@@ -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;
@@ -19671,9 +19671,9 @@ function readFileInside(baseDir, candidate, maxBytes) {
 // src/lib/glob-match.ts
 function globToRegex(glob) {
   let out2 = "";
-  const n = glob.length;
+  const n2 = glob.length;
   let i2 = 0;
-  while (i2 < n) {
+  while (i2 < n2) {
     const c = glob[i2];
     if (c === "*" && glob[i2 + 1] === "*") {
       if (i2 > 0 && glob[i2 - 1] === "/" && glob[i2 + 2] === "/") {
@@ -19681,7 +19681,7 @@ function globToRegex(glob) {
         i2 += 3;
         continue;
       }
-      if (i2 > 0 && glob[i2 - 1] === "/" && i2 + 2 === n) {
+      if (i2 > 0 && glob[i2 - 1] === "/" && i2 + 2 === n2) {
         out2 = out2.slice(0, -1) + "(?:/.*)?";
         i2 += 2;
         continue;
@@ -19821,7 +19821,7 @@ async function readSyncBaseline() {
   try {
     const parsed = JSON.parse(await (0, import_promises9.readFile)(syncStateFile(), "utf-8"));
     if (Array.isArray(parsed?.nodes)) {
-      for (const n of parsed.nodes) if (n?.path) out2.set(n.path, n.hash ?? null);
+      for (const n2 of parsed.nodes) if (n2?.path) out2.set(n2.path, n2.hash ?? null);
     } else if (Array.isArray(parsed?.paths)) {
       for (const p of parsed.paths) out2.set(p, null);
     }
@@ -19901,7 +19901,7 @@ async function applyMemoryWrites(writes, opts = {}) {
     }
   }
   const logLines = [`- ${(/* @__PURE__ */ new Date()).toISOString().slice(0, 16)} \u2014 Applied ${count} write(s) from server`];
-  for (const n of notes) logLines.push(`  - ${n}`);
+  for (const n2 of notes) logLines.push(`  - ${n2}`);
   try {
     const existing = (0, import_node_fs21.existsSync)((0, import_node_path19.join)(memoryDir2(), "log.md")) ? await (0, import_promises9.readFile)((0, import_node_path19.join)(memoryDir2(), "log.md"), "utf-8") : "# Memory Log\n\n";
     await (0, import_promises9.writeFile)((0, import_node_path19.join)(memoryDir2(), "log.md"), existing + logLines.join("\n") + "\n");
@@ -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);
 }
@@ -21246,7 +21246,7 @@ function compactState(s) {
     // cached row.
     g: s.goal.map((g) => [g.seq, ms(g.at), g.hash, g.superseded_by, g.text ?? 0, g.text_len ?? 0, g.source ?? 0, g.status ?? 0, g.repeats ?? 0, g.truncated ? 1 : 0, g.collapsed ? 1 : 0, g.delivered ? ms(g.delivered.at) : 0, g.delivered?.seq ?? 0, g.delivered?.summary ?? 0]),
     a: s.authored?.map((a) => [a.path, a.origin, a.edits, a.hunks, a.adds, a.dels, a.hash_now, a.hash_at_last_verdict, a.first_seq, a.last_seq]) ?? null,
-    n: s.not_mine?.map((n) => [n.path, n.reason, ms(n.at), n.head_sha]) ?? null,
+    n: s.not_mine?.map((n2) => [n2.path, n2.reason, ms(n2.at), n2.head_sha]) ?? null,
     t: s.statements.map((x) => [x.anchor_key, x.file, x.line, x.pattern_id, x.title_hash, x.register, x.line_sha, x.said_at_seq, ms(x.said_at), x.outcome, x.outcome_at ? ms(x.outcome_at) : 0, x.repeats, x.carried ? 1 : 0]),
     c: s.commands.map((c) => [c.cls, c.cmd_hash, c.head, c.last_status, ms(c.last_at), c.last_seq, c.streak, c.edits_since, c.runs]),
     d: [s.divergence.events.map((e) => [e.kind, e.path, ms(e.at)]), s.divergence.counts, s.divergence.seen],
@@ -21257,10 +21257,10 @@ function compactState(s) {
 }
 function expandState(raw) {
   try {
-    const iso = (n2) => new Date(n2).toISOString();
+    const iso = (n3) => new Date(n3).toISOString();
     const g = raw.g;
     const a = raw.a;
-    const n = raw.n;
+    const n2 = raw.n;
     const t = raw.t;
     const c = raw.c;
     const dv = raw.d;
@@ -21306,7 +21306,7 @@ function expandState(raw) {
       // which always folds the live log. If the cache is ever put on that path,
       // the full list has to be encoded — see the note on `authored_all`.
       authored_all: decodedAuthored ?? [],
-      not_mine: n?.map((x) => ({
+      not_mine: n2?.map((x) => ({
         path: x[0],
         reason: x[1],
         at: iso(x[2]),
@@ -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 {
@@ -21553,7 +21553,7 @@ function projectMemory(state, opts) {
     }));
   }
   if (state.not_mine && state.not_mine.length > 0) {
-    p.not_mine = { n: state.not_mine.length, paths: state.not_mine.map((n) => n.path) };
+    p.not_mine = { n: state.not_mine.length, paths: state.not_mine.map((n2) => n2.path) };
   } else if (state.not_mine === null) {
     p.not_mine = { n: -1, paths: [] };
   }
@@ -21647,8 +21647,8 @@ function stateProvenance(state, opts = {}) {
   for (const c of state.commands) {
     items.push({ key: `command:${c.cls}:${c.cmd_hash}`, kind: "command", owner: "agent", age: age(c.last_seq, false) });
   }
-  for (const n of state.not_mine ?? []) {
-    items.push({ key: `not_mine:${n.path}`, kind: "not_mine", owner: "git", age: "this_session" });
+  for (const n2 of state.not_mine ?? []) {
+    items.push({ key: `not_mine:${n2.path}`, kind: "not_mine", owner: "git", age: "this_session" });
   }
   for (const m of state.marks) {
     items.push({ key: `mark:${m.kind}:${m.seq}`, kind: "mark", owner: "agent", age: age(m.seq, false) });
@@ -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 }
@@ -21979,9 +21979,9 @@ function normaliseClass(cls) {
   const known = ["test", "build", "lint", "typecheck", "git", "other"];
   return known.includes(cls) ? cls : "other";
 }
-function toStatus(n) {
-  if (n === 0) return "pass";
-  if (n === 1) return "fail";
+function toStatus(n2) {
+  if (n2 === 0) return "pass";
+  if (n2 === 1) return "fail";
   return "unknown";
 }
 function recordVerdict(d, v) {
@@ -22187,10 +22187,10 @@ function registerIntentCommands(program2) {
             arm: "injected",
             eligible: injection.eligible,
             tokens: injection.tokensUsed,
-            nodes: injection.nodes.map((n) => ({
-              id: n.nodeId,
-              score: Math.round(n.score * 1e3) / 1e3,
-              via: `${n.fileGlobs.length ? "g" : ""}${n.scope === "org" ? "o" : ""}x`
+            nodes: injection.nodes.map((n2) => ({
+              id: n2.nodeId,
+              score: Math.round(n2.score * 1e3) / 1e3,
+              via: `${n2.fileGlobs.length ? "g" : ""}${n2.scope === "org" ? "o" : ""}x`
             }))
           });
         }
@@ -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 {
     }
   }
@@ -24483,8 +24483,8 @@ function formatFindingsSummary(fc) {
   if (!fc) return "-";
   const parts2 = [];
   for (const [key, abbrev] of SEV_ABBREV) {
-    const n = fc[key] ?? 0;
-    if (n > 0) parts2.push(`${n} ${abbrev}`);
+    const n2 = fc[key] ?? 0;
+    if (n2 > 0) parts2.push(`${n2} ${abbrev}`);
   }
   return parts2.length > 0 ? parts2.join(", ") : "clean";
 }
@@ -24674,13 +24674,13 @@ function parseJsonState(raw) {
 }
 function parseLegacyState(raw) {
   const parts2 = raw.split(":");
-  const n = parseInt(parts2[0], 10);
-  if (isNaN(n)) return null;
+  const n2 = parseInt(parts2[0], 10);
+  if (isNaN(n2)) return null;
   return {
-    attempts: n,
+    attempts: n2,
     // The old file has no separate block count; the old counter is the closest
     // honest answer, and it errs toward releasing sooner rather than later.
-    blocks: n,
+    blocks: n2,
     fingerprint: parts2.slice(3).join(":") || null,
     commit: parts2[1] ?? "",
     ts: parseInt(parts2[2] ?? "0", 10)
@@ -24723,12 +24723,12 @@ function parseDuration(input) {
   if (!m) {
     return { ok: false, error: `Could not read "${input}" as a duration. Use 30m, 45s, or 1h.` };
   }
-  const n = parseInt(m[1], 10);
-  if (!Number.isFinite(n) || n <= 0) {
+  const n2 = parseInt(m[1], 10);
+  if (!Number.isFinite(n2) || n2 <= 0) {
     return { ok: false, error: `A duration must be a positive number of seconds, minutes or hours \u2014 got "${input}".` };
   }
   const unit = m[2] ?? "m";
-  const seconds = unit === "s" ? n : unit === "h" ? n * 3600 : n * 60;
+  const seconds = unit === "s" ? n2 : unit === "h" ? n2 * 3600 : n2 * 60;
   if (seconds > MAX_WINDOW_SECONDS) {
     return {
       ok: false,
@@ -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();
@@ -25596,8 +25596,8 @@ function extractFileSymbols(path, content, signals) {
     add(declNameOn(deleted, rules));
   }
   for (const [start2, end] of signals.addedRanges) {
-    for (let n = start2; n <= Math.min(end, lines.length); n++) {
-      add(declNameOn(lines[n - 1] ?? "", rules));
+    for (let n2 = start2; n2 <= Math.min(end, lines.length); n2++) {
+      add(declNameOn(lines[n2 - 1] ?? "", rules));
     }
   }
   const scanStarts = [
@@ -25606,8 +25606,8 @@ function extractFileSymbols(path, content, signals) {
   ];
   for (const start2 of scanStarts) {
     const floor = Math.max(1, start2 - ENCLOSING_SCAN_LINES);
-    for (let n = Math.min(start2, lines.length); n >= floor; n--) {
-      const name2 = declNameOn(lines[n - 1] ?? "", rules);
+    for (let n2 = Math.min(start2, lines.length); n2 >= floor; n2--) {
+      const name2 = declNameOn(lines[n2 - 1] ?? "", rules);
       if (acceptable(name2)) {
         add(name2);
         break;
@@ -25681,33 +25681,33 @@ function parseRgLine(line2) {
   if (first <= 0) return null;
   const second = line2.indexOf(":", first + 1);
   if (second < 0) return null;
-  const n = parseInt(line2.slice(first + 1, second), 10);
-  if (!Number.isFinite(n) || n < 1) return null;
-  return { file: line2.slice(0, first), line: n, text: line2.slice(second + 1) };
+  const n2 = parseInt(line2.slice(first + 1, second), 10);
+  if (!Number.isFinite(n2) || n2 < 1) return null;
+  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,29 +25739,29 @@ 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 n = perFile.get(h.file) ?? 0;
-    if (n >= MAX_SITES_PER_FILE) 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) {
         tests.push(site);
-        perFile.set(h.file, n + 1);
+        perFile.set(h.file, n2 + 1);
       }
     } else if (callers.length + tests.length < MAX_SITES) {
       callers.push(site);
-      perFile.set(h.file, n + 1);
+      perFile.set(h.file, n2 + 1);
     }
   }
   while (callers.length + tests.length > MAX_SITES) callers.pop();
@@ -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) {
@@ -25809,9 +25809,9 @@ function partitionImporters(rgLines, changedPaths, opts) {
     if (!resolved) continue;
     const changed = changedByKey.get(resolved);
     if (!changed) continue;
-    const used = perFile.get(h.file) ?? 0;
-    if (used >= MAX_IMPORTERS_PER_FILE) continue;
-    perFile.set(h.file, used + 1);
+    const used2 = perFile.get(h.file) ?? 0;
+    if (used2 >= MAX_IMPORTERS_PER_FILE) continue;
+    perFile.set(h.file, used2 + 1);
     out2.push({ file: h.file, line: h.line, text: h.text.trim().slice(0, SITE_TEXT_MAX), symbol: changed });
   }
   return out2;
@@ -25909,9 +25909,9 @@ function revisionSearch(root, rev) {
       const line2 = prefix && raw.startsWith(prefix) ? raw.slice(prefix.length) : raw;
       const hit = parseRgLine(line2);
       if (!hit) continue;
-      const n = perFile.get(hit.file) ?? 0;
-      if (n >= HITS_PER_FILE) continue;
-      perFile.set(hit.file, n + 1);
+      const n2 = perFile.get(hit.file) ?? 0;
+      if (n2 >= HITS_PER_FILE) continue;
+      perFile.set(hit.file, n2 + 1);
       lines.push(`${hit.file}:${hit.line}:${hit.text.slice(0, HIT_TEXT_COLUMNS)}`);
     }
     return { ok: true, lines };
@@ -26030,9 +26030,9 @@ function extractEnclosingExcerpt(content, siteLine, path) {
   if (siteLine < 1 || siteLine > lines.length) return null;
   let declStart = null;
   const floor = Math.max(1, siteLine - EXCERPT_DECL_SCAN);
-  for (let n = siteLine; n >= floor; n--) {
-    if (declNameOn(lines[n - 1] ?? "", rules) !== null) {
-      declStart = n;
+  for (let n2 = siteLine; n2 >= floor; n2--) {
+    if (declNameOn(lines[n2 - 1] ?? "", rules) !== null) {
+      declStart = n2;
       break;
     }
   }
@@ -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;
@@ -26059,8 +26059,8 @@ function upgradeToExcerpts(rc, opts) {
   let totalBytes = 0;
   for (const site of ranked) {
     if (excerpts.length >= MAX_EXCERPTS) break;
-    const used = perFile.get(site.file) ?? 0;
-    if (used >= MAX_EXCERPTS_PER_FILE) continue;
+    const used2 = perFile.get(site.file) ?? 0;
+    if (used2 >= MAX_EXCERPTS_PER_FILE) continue;
     if (!contentCache.has(site.file)) contentCache.set(site.file, opts.readFile(site.file));
     const content = contentCache.get(site.file);
     if (content === null || content === void 0) continue;
@@ -26076,7 +26076,7 @@ function upgradeToExcerpts(rc, opts) {
       text: ex.text
     });
     totalBytes += ex.text.length;
-    perFile.set(site.file, used + 1);
+    perFile.set(site.file, used2 + 1);
   }
   if (excerpts.length > 0) rc.excerpts = excerpts;
 }
@@ -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.2" : "dev";
+    return true ? "0.34.4" : "dev";
   } catch {
     return "dev";
   }
@@ -27668,10 +27668,10 @@ function interpretAnalyzerRun(run4) {
 function reconcileCoverage(changed, coverage) {
   const changedSet = new Set(changed);
   const reviewed = coverage.reviewed.filter((p) => changedSet.has(p));
-  const claimed = /* @__PURE__ */ new Set([...reviewed, ...coverage.notReviewed.map((n) => n.path)]);
+  const claimed = /* @__PURE__ */ new Set([...reviewed, ...coverage.notReviewed.map((n2) => n2.path)]);
   const unaccounted = [...changedSet].filter((p) => !claimed.has(p)).sort();
   const notReviewed = [
-    ...coverage.notReviewed.filter((n) => changedSet.has(n.path)),
+    ...coverage.notReviewed.filter((n2) => changedSet.has(n2.path)),
     ...unaccounted.map((path) => ({
       path,
       reason: "unaccounted",
@@ -27692,18 +27692,18 @@ function reconcileCoverage(changed, coverage) {
 }
 function resolveVerdict(proposed, coverage) {
   if (proposed === "FAIL") return "FAIL";
-  const blocking = coverage.notReviewed.filter((n) => (n.kind ?? "capacity") !== "policy");
+  const blocking = coverage.notReviewed.filter((n2) => (n2.kind ?? "capacity") !== "policy");
   if (blocking.length === 0) return proposed;
   return "WARN";
 }
 function describeCoverage(coverage, maxPaths = 5) {
-  const relevant = coverage.notReviewed.filter((n) => (n.kind ?? "capacity") !== "policy");
+  const relevant = coverage.notReviewed.filter((n2) => (n2.kind ?? "capacity") !== "policy");
   if (relevant.length === 0) return null;
   const byReason = /* @__PURE__ */ new Map();
-  for (const n of relevant) {
-    const key = `${n.reason}`;
+  for (const n2 of relevant) {
+    const key = `${n2.reason}`;
     const list2 = byReason.get(key) ?? [];
-    list2.push(n.path);
+    list2.push(n2.path);
     byReason.set(key, list2);
   }
   const lines = [];
@@ -29145,10 +29145,10 @@ var MAX_WITHIN = 6;
 var PLACEHOLDER = "${\u2026}";
 var MAX_PARAMS = 12;
 var PY_LOCK_ITEM = /(?:lock|Lock|mutex|Mutex|semaphore|Semaphore)\b/;
-var line = (n) => n.startPosition.row + 1;
-var cap = (s, n) => {
+var line = (n2) => n2.startPosition.row + 1;
+var cap = (s, n2) => {
   const flat = s.replace(/\s+/g, " ");
-  return flat.length > n ? `${flat.slice(0, n)}\u2026` : flat;
+  return flat.length > n2 ? `${flat.slice(0, n2)}\u2026` : flat;
 };
 function qualifierOf(node, spec) {
   if (spec.id === "go" && node.type === "method_declaration") {
@@ -29174,38 +29174,38 @@ function definitionsIn(root, spec) {
     const q = qualifierOf(owner, spec);
     out2.push({ name: name2, qualified: q ? `${q}.${name2}` : name2, kind: kind2, extent, last, fn });
   };
-  const visit = (n) => {
-    const kind2 = spec.definitions[n.type];
-    if (kind2 && n.childForFieldName("body")) {
-      const nameNode = n.childForFieldName("name");
+  const visit = (n2) => {
+    const kind2 = spec.definitions[n2.type];
+    if (kind2 && n2.childForFieldName("body")) {
+      const nameNode = n2.childForFieldName("name");
       if (nameNode && nameNode.type !== "computed_property_name") {
-        const inClass = qualifierOf(n, spec) !== null;
+        const inClass = qualifierOf(n2, spec) !== null;
         const k = spec.id === "python" ? inClass ? "method" : "function" : kind2;
-        add(nameNode.text, k, extentOf(n), n, n, n.parent?.type === "decorated_definition" ? n.parent : n);
+        add(nameNode.text, k, extentOf(n2), n2, n2, n2.parent?.type === "decorated_definition" ? n2.parent : n2);
       }
-    } else if (spec.functionValues.has(n.type) && n.parent) {
-      const p = n.parent;
-      const kind3 = n.type === "arrow_function" ? "arrow" : n.type === "lambda" || n.type === "lambda_expression" ? "lambda" : "function";
-      const bound = p.childForFieldName("value")?.id === n.id;
+    } else if (spec.functionValues.has(n2.type) && n2.parent) {
+      const p = n2.parent;
+      const kind3 = n2.type === "arrow_function" ? "arrow" : n2.type === "lambda" || n2.type === "lambda_expression" ? "lambda" : "function";
+      const bound = p.childForFieldName("value")?.id === n2.id;
       if (bound && p.type === "variable_declarator" && p.childForFieldName("name")?.type === "identifier") {
         const decl = p.parent && p.parent.namedChildren.filter((c) => c.type === "variable_declarator").length === 1 ? p.parent : p;
-        add(p.childForFieldName("name").text, kind3, decl, n, p);
+        add(p.childForFieldName("name").text, kind3, decl, n2, p);
       } else if (bound && (p.type === "public_field_definition" || p.type === "field_definition")) {
         const nameNode = p.childForFieldName("name") ?? p.childForFieldName("property");
-        if (nameNode && nameNode.type !== "computed_property_name") add(nameNode.text, kind3, extentOf(p), n, p, p);
+        if (nameNode && nameNode.type !== "computed_property_name") add(nameNode.text, kind3, extentOf(p), n2, p, p);
       } else if (bound && p.type === "pair") {
         const key = p.childForFieldName("key");
-        if (key && (key.type === "property_identifier" || key.type === "identifier")) add(key.text, kind3, p, n, p);
+        if (key && (key.type === "property_identifier" || key.type === "identifier")) add(key.text, kind3, p, n2, p);
       } else if (p.type === "arguments" && moduleCall(p.parent)) {
         const call = p.parent;
         const route = p.namedChildren[0];
-        const quoted = route && route.id !== n.id && route.type === "string" ? unquote2(route.text) : null;
+        const quoted = route && route.id !== n2.id && route.type === "string" ? unquote2(route.text) : null;
         const path = quoted && /^[\w/:.{}*-]{1,60}$/.test(quoted) ? quoted : null;
         const callee = call.childForFieldName("function").text;
-        add(path ? `${callee} ${path}` : callee, kind3, call.parent, n, call);
+        add(path ? `${callee} ${path}` : callee, kind3, call.parent, n2, call);
       }
     }
-    for (const c of n.namedChildren) visit(c);
+    for (const c of n2.namedChildren) visit(c);
   };
   visit(root);
   return out2;
@@ -29219,10 +29219,10 @@ function unquote2(s) {
   const q3 = body2.startsWith('"""') || body2.startsWith("'''");
   return q3 ? body2.slice(3, -3) : body2.slice(1, -1);
 }
-function callParts(n, spec) {
-  const args2 = n.childForFieldName("arguments");
-  if (spec.id === "java") return { receiver: n.childForFieldName("object"), name: n.childForFieldName("name")?.text ?? null, args: args2 };
-  let f = n.childForFieldName("function");
+function callParts(n2, spec) {
+  const args2 = n2.childForFieldName("arguments");
+  if (spec.id === "java") return { receiver: n2.childForFieldName("object"), name: n2.childForFieldName("name")?.text ?? null, args: args2 };
+  let f = n2.childForFieldName("function");
   if (f?.type === "await_expression") f = f.namedChildren[0] ?? null;
   if (!f) return { receiver: null, name: null, args: args2 };
   if (f.type === "identifier") return { receiver: null, name: f.text, args: args2 };
@@ -29252,14 +29252,14 @@ function withLabel(item) {
   if (value.type === "attribute") return value.childForFieldName("attribute")?.text ?? null;
   return value.text;
 }
-function isChained(n) {
-  const p = n.parent;
+function isChained(n2) {
+  const p = n2.parent;
   if (!p) return false;
   const object = p.childForFieldName("object") ?? p.childForFieldName("operand");
-  return object?.id === n.id && (p.type === "member_expression" || p.type === "attribute" || p.type === "selector_expression" || p.type === "method_invocation");
+  return object?.id === n2.id && (p.type === "member_expression" || p.type === "attribute" || p.type === "selector_expression" || p.type === "method_invocation");
 }
-function isAwaited(n) {
-  let p = n.parent;
+function isAwaited(n2) {
+  let p = n2.parent;
   while (p && p.type === "parenthesized_expression") p = p.parent;
   return !!p && (p.type === "await_expression" || p.type === "await");
 }
@@ -29283,17 +29283,17 @@ function factsOf(def, spec, defs, path) {
   const tries = [];
   const locks = [];
   const bindings = {};
-  const bind = (n) => {
+  const bind = (n2) => {
     let name2 = null;
     let value = null;
-    if (n.type === "variable_declarator") {
-      name2 = n.childForFieldName("name");
-      value = n.childForFieldName("value");
-    } else if (n.type === "assignment" && spec.id === "python") {
-      name2 = n.childForFieldName("left");
-      value = n.childForFieldName("right");
-    } else if (n.type === "short_var_declaration") {
-      const l = n.childForFieldName("left"), r = n.childForFieldName("right");
+    if (n2.type === "variable_declarator") {
+      name2 = n2.childForFieldName("name");
+      value = n2.childForFieldName("value");
+    } else if (n2.type === "assignment" && spec.id === "python") {
+      name2 = n2.childForFieldName("left");
+      value = n2.childForFieldName("right");
+    } else if (n2.type === "short_var_declaration") {
+      const l = n2.childForFieldName("left"), r = n2.childForFieldName("right");
       if (l?.namedChildren.length === 1 && r?.namedChildren.length === 1) {
         name2 = l.namedChildren[0];
         value = r.namedChildren[0];
@@ -29301,68 +29301,68 @@ function factsOf(def, spec, defs, path) {
     }
     if (name2?.type === "identifier" && value && Object.keys(bindings).length < 40 && !(name2.text in bindings)) bindings[name2.text] = cap(value.text, TEXT_CAP);
   };
-  const throwsIn = (n) => {
-    if (spec.throws.has(n.type)) return true;
-    if (defs.has(n.id) || spec.functionValues.has(n.type)) return false;
-    return n.namedChildren.some(throwsIn);
+  const throwsIn = (n2) => {
+    if (spec.throws.has(n2.type)) return true;
+    if (defs.has(n2.id) || spec.functionValues.has(n2.type)) return false;
+    return n2.namedChildren.some(throwsIn);
   };
-  const walk2 = (n, ctx) => {
-    const anonymousMember = n.parent?.type === "class_body" && n.parent.parent?.type === "object_creation_expression";
-    if (n.id !== def.fn.id && !anonymousMember && (defs.has(n.id) || spec.classes.has(n.type) || spec.definitions[n.type])) return;
-    const t = n.type;
-    bind(n);
+  const walk2 = (n2, ctx) => {
+    const anonymousMember = n2.parent?.type === "class_body" && n2.parent.parent?.type === "object_creation_expression";
+    if (n2.id !== def.fn.id && !anonymousMember && (defs.has(n2.id) || spec.classes.has(n2.type) || spec.definitions[n2.type])) return;
+    const t = n2.type;
+    bind(n2);
     const down = (c, next = ctx) => walk2(c, next);
     if (spec.calls.has(t)) {
-      const { receiver, name: name2, args: args2 } = callParts(n, spec);
+      const { receiver, name: name2, args: args2 } = callParts(n2, spec);
       if (name2) {
         calls.push({
-          line: line(n),
-          col: n.startPosition.column,
+          line: line(n2),
+          col: n2.startPosition.column,
           receiver: receiver ? cap(receiver.text, TEXT_CAP) : null,
           name: name2,
           args: argsOf(args2, spec),
-          awaited: isAwaited(n) || n.childForFieldName("function")?.type === "await_expression",
-          chained: isChained(n),
+          awaited: isAwaited(n2) || n2.childForFieldName("function")?.type === "await_expression",
+          chained: isChained(n2),
           inLoop: ctx.inLoop,
           inTry: ctx.tryAt !== null,
           tryAt: ctx.tryAt,
           within: ctx.within.slice(-MAX_WITHIN)
         });
-        if (spec.lockCalls.has(name2)) locks.push(line(n));
-        for (const c of n.namedChildren) down(c, c.id === args2?.id ? { ...ctx, within: [...ctx.within, name2] } : ctx);
+        if (spec.lockCalls.has(name2)) locks.push(line(n2));
+        for (const c of n2.namedChildren) down(c, c.id === args2?.id ? { ...ctx, within: [...ctx.within, name2] } : ctx);
         return;
       }
     }
-    if (spec.awaits.has(t)) awaits.push(line(n));
+    if (spec.awaits.has(t)) awaits.push(line(n2));
     if (t === "defer_statement") {
-      for (const c of n.namedChildren) down(c, { ...ctx, within: [...ctx.within, "defer"] });
+      for (const c of n2.namedChildren) down(c, { ...ctx, within: [...ctx.within, "defer"] });
       return;
     }
     if (spec.lockNodes.has(t)) {
-      locks.push(line(n));
-      for (const c of n.namedChildren) down(c, { ...ctx, within: [...ctx.within, "synchronized"] });
+      locks.push(line(n2));
+      for (const c of n2.namedChildren) down(c, { ...ctx, within: [...ctx.within, "synchronized"] });
       return;
     }
     if (t === "with_statement") {
-      const item = n.namedChildren[0];
-      if (PY_LOCK_ITEM.test(item?.text ?? "")) locks.push(line(n));
+      const item = n2.namedChildren[0];
+      if (PY_LOCK_ITEM.test(item?.text ?? "")) locks.push(line(n2));
       const label2 = withLabel(item);
-      for (const c of n.namedChildren) down(c, c.type === "block" && label2 ? { ...ctx, within: [...ctx.within, label2] } : ctx);
+      for (const c of n2.namedChildren) down(c, c.type === "block" && label2 ? { ...ctx, within: [...ctx.within, label2] } : ctx);
       return;
     }
     if (spec.loops.has(t)) {
-      loops.push(line(n));
-      for (const c of n.namedChildren) down(c, { ...ctx, inLoop: true });
+      loops.push(line(n2));
+      for (const c of n2.namedChildren) down(c, { ...ctx, inLoop: true });
       return;
     }
     if (spec.tries.has(t)) {
-      const handlers = n.namedChildren.filter((c) => spec.handlers.has(c.type));
-      tries.push({ line: line(n), end: n.endPosition.row + 1, catches: handlers.length > 0, rethrows: handlers.some(throwsIn) });
-      const body2 = n.childForFieldName("body");
-      for (const c of n.namedChildren) down(c, c.id === body2?.id ? { ...ctx, tryAt: line(n) } : ctx);
+      const handlers = n2.namedChildren.filter((c) => spec.handlers.has(c.type));
+      tries.push({ line: line(n2), end: n2.endPosition.row + 1, catches: handlers.length > 0, rethrows: handlers.some(throwsIn) });
+      const body2 = n2.childForFieldName("body");
+      for (const c of n2.namedChildren) down(c, c.id === body2?.id ? { ...ctx, tryAt: line(n2) } : ctx);
       return;
     }
-    for (const c of n.namedChildren) down(c);
+    for (const c of n2.namedChildren) down(c);
   };
   const synchronizedMethod = spec.id === "java" && /\bsynchronized\b/.test(def.fn.namedChildren.find((c) => c.type === "modifiers")?.text ?? "");
   walk2(def.fn, { inLoop: false, tryAt: null, within: synchronizedMethod ? ["synchronized"] : [] });
@@ -29432,11 +29432,11 @@ function regionOf(rt, path, content, fn, changed, maxLines, deadlineAt) {
   if (!tree) return { source: "fallback", reason: "deadline", elapsedMs: Date.now() - started };
   try {
     const lines = content.split("\n");
-    let n = tree.rootNode.descendantForPosition({ row: from - 1, column: 0 }, { row: to - 1, column: (lines[to - 1] ?? "").length });
+    let n2 = tree.rootNode.descendantForPosition({ row: from - 1, column: 0 }, { row: to - 1, column: (lines[to - 1] ?? "").length });
     let block = null;
-    for (; n && line(n) >= fn.start.line; n = n.parent) {
-      if (BLOCKS.has(n.type) && n.endPosition.row + 1 - line(n) + 1 > maxLines) {
-        block = n;
+    for (; n2 && line(n2) >= fn.start.line; n2 = n2.parent) {
+      if (BLOCKS.has(n2.type) && n2.endPosition.row + 1 - line(n2) + 1 > maxLines) {
+        block = n2;
         break;
       }
     }
@@ -29482,15 +29482,15 @@ var STABLE_EXPRESSION = (t) => {
 function argResource(kind2, arg) {
   if (!arg) return { kind: kind2, name: null, confidence: "unknown" };
   if (arg.literal !== null) {
-    const n = literalName(arg.literal);
-    return n ? { kind: kind2, name: n.name, confidence: n.confidence } : { kind: kind2, name: null, confidence: "unknown" };
+    const n2 = literalName(arg.literal);
+    return n2 ? { kind: kind2, name: n2.name, confidence: n2.confidence } : { kind: kind2, name: null, confidence: "unknown" };
   }
   if (SIMPLE_EXPRESSION.test(arg.text) && STABLE_EXPRESSION(arg.text)) return { kind: kind2, name: arg.text, confidence: "expression" };
   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*$/;
@@ -29832,7 +29832,7 @@ function accessMap(input) {
   const effects = effectsWithHelpers(target, fileFns, lang, 2, state);
   const byName = new Map(fileFns.map((f) => [f.name, f]));
   const helperNames = new Set(effects.flatMap((e) => e.via));
-  const helpers = [...helperNames].map((n) => byName.get(n)).filter((f) => !!f && f !== target && !inside(f, target)).slice(0, MAX_HELPERS);
+  const helpers = [...helperNames].map((n2) => byName.get(n2)).filter((f) => !!f && f !== target && !inside(f, target)).slice(0, MAX_HELPERS);
   const named = effects.filter((e) => e.resource.name !== null && e.resource.confidence !== "unknown");
   const resources = [];
   for (const e of [...named.filter((x) => x.op === "write"), ...named.filter((x) => x.op === "read")]) {
@@ -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;
 }
@@ -29995,8 +29995,8 @@ function declaredType(scope2, v, lang) {
 function classesIn(content, lang) {
   const lines = content.split("\n");
   const out2 = [];
-  for (let n = 0; n < lines.length; n++) {
-    const l = lines[n];
+  for (let n2 = 0; n2 < lines.length; n2++) {
+    const l = lines[n2];
     let name2 = null, base = null, impl = [];
     if (lang === "python") {
       const m2 = /^(\s*)class\s+([A-Za-z_]\w*)\s*(?:\(([^)]*)\))?\s*:/.exec(l);
@@ -30004,17 +30004,17 @@ function classesIn(content, lang) {
       name2 = m2[2];
       base = (m2[3] ?? "").split(",").map((x) => x.trim().split(".").pop() ?? "").find((x) => /^[A-Z]/.test(x) && x !== "object") ?? null;
       const indent = m2[1].length;
-      let end2 = n + 1;
+      let end2 = n2 + 1;
       while (end2 < lines.length && (lines[end2].trim() === "" || lines[end2].search(/\S/) > indent)) end2++;
-      out2.push({ name: name2, base, implementsList: [], start: n + 1, end: end2 });
+      out2.push({ name: name2, base, implementsList: [], start: n2 + 1, end: end2 });
       continue;
     }
     if (lang === "go") {
       const m2 = /^\s*type\s+([A-Z_a-z]\w*)\s+(struct|interface)\s*\{/.exec(l);
       if (!m2) continue;
-      let end2 = n;
+      let end2 = n2;
       while (end2 < lines.length && !/^\s*\}/.test(lines[end2])) end2++;
-      out2.push({ name: m2[1], base: null, implementsList: [], start: n + 1, end: end2 + 1 });
+      out2.push({ name: m2[1], base: null, implementsList: [], start: n2 + 1, end: end2 + 1 });
       continue;
     }
     const m = /\b(?:class|interface)\s+([A-Za-z_$][\w$]*)(?:<[^{]*?>)?\s*(?:extends\s+([\w$.]+)(?:<[^{]*?>)?)?\s*(?:implements\s+([^{]+))?\{?/.exec(l);
@@ -30022,8 +30022,8 @@ function classesIn(content, lang) {
     name2 = m[1];
     base = m[2] ? m[2].split(".").pop() ?? null : null;
     impl = (m[3] ?? "").split(",").map((x) => x.trim().replace(/<.*$/, "").split(".").pop() ?? "").filter(isIdent);
-    let depth = 0, seen = false, end = n;
-    for (let k = n; k < lines.length; k++) {
+    let depth = 0, seen = false, end = n2;
+    for (let k = n2; k < lines.length; k++) {
       for (const ch of lines[k]) {
         if (ch === "{") {
           depth++;
@@ -30036,7 +30036,7 @@ function classesIn(content, lang) {
       }
       end = k;
     }
-    out2.push({ name: name2, base, implementsList: impl, start: n + 1, end: end + 1 });
+    out2.push({ name: name2, base, implementsList: impl, start: n2 + 1, end: end + 1 });
   }
   return out2;
 }
@@ -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;
     }
@@ -30494,7 +30494,7 @@ function definitionOf(input) {
     const caller = at ? fns.filter((f) => f.start.line <= at && at <= f.end.line).sort((a, b) => a.end.line - a.start.line - (b.end.line - b.start.line))[0] ?? null : null;
     const tsCache = /* @__PURE__ */ new Map();
     const resolveImport = (spec, from) => moduleFiles(source2, spec, from, lang, tsCache);
-    const imports = (c, n) => importOf(c, lang, n, null);
+    const imports = (c, n2) => importOf(c, lang, n2, null);
     let type = receiverType(content, lang, caller, receiver, at) ?? fieldChainType({ content, lang, caller, receiver, line: at, fromPath: path, source: source2, resolveImport, importOf: imports });
     if (type?.startsWith(RESULT_OF)) {
       const [fnName, idx] = type.slice(RESULT_OF.length).split("#");
@@ -30519,7 +30519,7 @@ function definitionOf(input) {
         source: source2,
         outline,
         resolveImport: (spec, from) => moduleFiles(source2, spec, from, lang, tsCache),
-        importOf: (c, n) => importOf(c, lang, n, null)
+        importOf: (c, n2) => importOf(c, lang, n2, null)
       });
       for (const h of hits) add([h.fn], h.how === "class" ? "type" : h.how);
     }
@@ -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;
   }
@@ -30663,7 +30663,7 @@ function callersOf(input) {
         let tie = fileTie;
         if (owner) {
           if (!c.receiver) continue;
-          const imports = (cc, n) => importOf(cc, lang, n, null);
+          const imports = (cc, n2) => importOf(cc, lang, n2, null);
           const resolveImport = (spec, from) => moduleFiles(source2, spec, from, lang, cache);
           const type = receiverType(read2.content, lang, fn, c.receiver, c.line) ?? fieldChainType({ content: read2.content, lang, caller: fn, receiver: c.receiver, line: c.line, fromPath: p, source: source2, resolveImport, importOf: imports });
           if (type !== owner) continue;
@@ -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 });
       }
     }
   }
@@ -30809,8 +30809,8 @@ var SOURCE_EXTS = ["ts", "tsx", "mts", "cts", "js", "jsx", "mjs", "cjs", "py", "
 function parseHit(line2) {
   const m = /^(.+?):(\d+):(.*)$/.exec(line2);
   if (!m) return null;
-  const n = Number(m[2]);
-  return n >= 1 ? { path: m[1], line: n, text: m[3] } : null;
+  const n2 = Number(m[2]);
+  return n2 >= 1 ? { path: m[1], line: n2, text: m[3] } : null;
 }
 function capHits(lines, maxHits) {
   const hits = [];
@@ -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;
@@ -31374,16 +31374,16 @@ function functionWindow(codeMap, path, content, line2, maxLines) {
 }
 function writerExcerpts(codeMap, writers, read2, maxLines, maxChars, budget) {
   const out2 = [];
-  let used = 0;
+  let used2 = 0;
   for (const w of writers) {
     const content = read2(w.file);
     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 (used + text.length > budget) break;
-    used += 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;
 }
@@ -31509,7 +31509,7 @@ function splitClaudeMdSections(content) {
 }
 function classifyClaudeSection(heading) {
   const h = heading.toLowerCase();
-  const hasAny = (needles) => needles.some((n) => h.includes(n));
+  const hasAny = (needles) => needles.some((n2) => h.includes(n2));
   if (hasAny(["security", "auth", "secret", "credential", "cwe", "vulnerabilit", "sanitiz"])) return "security";
   if (hasAny(["gotcha", "caveat", "pitfall", "footgun", "beware", "watch out", "known issue", "warning"])) return "gotcha";
   if (hasAny(["decision", "adr", "rationale", "why we", "chose", "trade-off", "tradeoff"])) return "decision";
@@ -31722,7 +31722,7 @@ async function serverSeedTitles(opts) {
   });
   if (!res.ok || !Array.isArray(res.data.nodes)) return null;
   const titles = /* @__PURE__ */ new Set();
-  for (const n of res.data.nodes) if (typeof n?.title === "string") titles.add(normalizeTitle(n.title));
+  for (const n2 of res.data.nodes) if (typeof n2?.title === "string") titles.add(normalizeTitle(n2.title));
   return titles;
 }
 function renderNodeMarkdown(candidate, nodeId, createdAt) {
@@ -32508,7 +32508,7 @@ function redactRequest(body2) {
     undelivered: true,
     total_files: files.length,
     total_bytes: files.reduce(
-      (n, f) => n + (typeof f.content === "string" ? f.content.length : 0),
+      (n2, f) => n2 + (typeof f.content === "string" ? f.content.length : 0),
       0
     ),
     // Paths only. A path is already visible in the repository; the content is not.
@@ -33027,10 +33027,10 @@ async function writePullState(state) {
   } catch {
   }
 }
-function pullsAtSessionStart(auth2, source2) {
+function pullsAtSessionStart(auth3, source2) {
   if (source2 === "compact") return false;
-  if (auth2.source === "env" || auth2.source === "flag") return true;
-  return auth2.userId != null;
+  if (auth3.source === "env" || auth3.source === "flag") return true;
+  return auth3.userId != null;
 }
 function spawnBackgroundPull(deps = {}) {
   const d = {
@@ -33151,7 +33151,7 @@ async function render(run4) {
   const memoryNodesUsed = response.memory_nodes_used;
   const lessonsUsed = response.lessons_used;
   if (memoryNodesUsed && memoryNodesUsed.length > 0) {
-    const nodeRefs = memoryNodesUsed.slice(0, 5).map((n) => n.node_id).join(", ");
+    const nodeRefs = memoryNodesUsed.slice(0, 5).map((n2) => n2.node_id).join(", ");
     process.stderr.write(`${DIM}Memory: ${memoryNodesUsed.length} nodes \u2014 ${nodeRefs}${NC}
 `);
   } else if (lessonsUsed && lessonsUsed.length > 0) {
@@ -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) {
-  let n = 0;
-  for (const line2 of text.split("\n")) if (EFFECT_LINE.test(line2)) n++;
-  return n;
+function countEffects(text2) {
+  let n2 = 0;
+  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();
@@ -34152,17 +34152,17 @@ function basisOf(source2, files) {
   const m = LINE.exec(s);
   if (!m) return { ok: false, why: s ? `"${s.slice(0, 60)}" is neither L<n>: <words> nor a rule` : "no source" };
   const path = m[1];
-  const n = Number(m[2]);
+  const n2 = Number(m[2]);
   const quoted = m[3].trim().replace(/^["'`“”]+|["'`“”]+$/g, "");
   const fragments = quoted.split(/…|\.\.\./).map(norm).filter((f) => f.length >= 4);
-  if (fragments.length === 0) return { ok: false, why: `L${n}: too few words to find on the line` };
+  if (fragments.length === 0) return { ok: false, why: `L${n2}: too few words to find on the line` };
   const pool = path ? [...files].filter(([f]) => f === path || f.endsWith(`/${path}`)).map(([, c]) => c) : [...files.values()];
   if (path && pool.length === 0) return { ok: false, why: `${path} is not one of the given files` };
   for (const content of pool) {
-    const line2 = content.split("\n")[n - 1];
-    if (line2 !== void 0 && fragments.every((f) => norm(line2).includes(f))) return { ok: true, basis: `L${n}: ${quoted.slice(0, 120)}` };
+    const line2 = content.split("\n")[n2 - 1];
+    if (line2 !== void 0 && fragments.every((f) => norm(line2).includes(f))) return { ok: true, basis: `L${n2}: ${quoted.slice(0, 120)}` };
   }
-  return { ok: false, why: `line ${n} does not contain "${quoted.slice(0, 60)}"` };
+  return { ok: false, why: `line ${n2} does not contain "${quoted.slice(0, 60)}"` };
 }
 var NOT_A_MENTION = "(?<!\\b(?:even|including|also|or) )";
 var UNTIL_FIRST = "(?:(?!\\bor\\b)[^,.;:]){0,60}?";
@@ -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;
@@ -34260,13 +34273,13 @@ function changedExcerpt(content, changed, bytes, context = 30) {
     else acc.push({ ...w });
     return acc;
   }, []);
-  const isChanged = (n) => changed.some((r) => n >= r.from && n <= r.to);
+  const isChanged = (n2) => changed.some((r) => n2 >= r.from && n2 <= r.to);
   const out2 = [];
   let size = 0;
   for (const w of windows) {
     if (out2.length) out2.push("     \u2026");
-    for (let n = w.from; n <= w.to; n++) {
-      const line2 = `${String(n).padStart(5)}${isChanged(n) ? "*" : " "}| ${lines[n - 1] ?? ""}`;
+    for (let n2 = w.from; n2 <= w.to; n2++) {
+      const line2 = `${String(n2).padStart(5)}${isChanged(n2) ? "*" : " "}| ${lines[n2 - 1] ?? ""}`;
       size += line2.length + 1;
       if (size > bytes) {
         out2.push("     \u2026 (truncated)");
@@ -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 };
@@ -34378,14 +34395,14 @@ var lunaRanker = {
     }
   }
 };
-async function rankViaServer(candidates2, ctx, auth2) {
+async function rankViaServer(candidates2, ctx, auth3) {
   const fallback = deterministicOrder(candidates2);
   const excerptBytes = ctx.excerptBytes ?? 6 * 1024;
   const res = await apiRequest({
     method: "POST",
     path: "/prove/rank",
-    serviceUrl: auth2.serviceUrl,
-    token: auth2.token,
+    serviceUrl: auth3.serviceUrl,
+    token: auth3.token,
     body: {
       candidates: candidates2.map((c) => ({
         file: c.file,
@@ -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) => {
@@ -34545,16 +34565,16 @@ function tokenizeLean(source2) {
   const out2 = [];
   const reasons = [];
   let i2 = 0;
-  const n = source2.length;
+  const n2 = source2.length;
   const blank = (ch) => ch === "\n" ? "\n" : " ";
-  while (i2 < n) {
+  while (i2 < n2) {
     const c = source2[i2];
     const next = source2[i2 + 1];
     if (c === "/" && next === "-") {
       let depth = 1;
       out2.push("  ");
       i2 += 2;
-      while (i2 < n && depth > 0) {
+      while (i2 < n2 && depth > 0) {
         if (source2[i2] === "/" && source2[i2 + 1] === "-") {
           depth++;
           out2.push("  ");
@@ -34573,7 +34593,7 @@ function tokenizeLean(source2) {
       continue;
     }
     if (c === "-" && next === "-") {
-      while (i2 < n && source2[i2] !== "\n") {
+      while (i2 < n2 && source2[i2] !== "\n") {
         out2.push(" ");
         i2++;
       }
@@ -34590,11 +34610,11 @@ function tokenizeLean(source2) {
         out2.push(" ".repeat(j + 1 - i2));
         i2 = j + 1;
         const close = '"' + "#".repeat(hashes);
-        while (i2 < n && source2.slice(i2, i2 + close.length) !== close) {
+        while (i2 < n2 && source2.slice(i2, i2 + close.length) !== close) {
           out2.push(blank(source2[i2]));
           i2++;
         }
-        out2.push(" ".repeat(Math.min(close.length, n - i2)));
+        out2.push(" ".repeat(Math.min(close.length, n2 - i2)));
         i2 += close.length;
         continue;
       }
@@ -34603,7 +34623,7 @@ function tokenizeLean(source2) {
       const interpolated = source2[i2 - 1] === "!" && source2[i2 - 2] === "s";
       out2.push(" ");
       i2++;
-      while (i2 < n && source2[i2] !== '"') {
+      while (i2 < n2 && source2[i2] !== '"') {
         if (source2[i2] === "\\") {
           out2.push("  ");
           i2 += 2;
@@ -34612,7 +34632,7 @@ function tokenizeLean(source2) {
         if (interpolated && source2[i2] === "{") {
           let j = i2 + 1;
           let expr = "";
-          while (j < n && source2[j] !== "}" && source2[j] !== '"' && source2[j] !== "\n") expr += source2[j++];
+          while (j < n2 && source2[j] !== "}" && source2[j] !== '"' && source2[j] !== "\n") expr += source2[j++];
           if (source2[j] !== "}") reasons.push(`string interpolation must close before a quote or line end: \`{${expr.trim().slice(0, 40)}\``);
           const words = expr.trim().split(/\s+/);
           if (words.length === 0 || words.some((w) => !/^[A-Za-z_][A-Za-z0-9_.']*$/.test(w))) {
@@ -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 = {
@@ -35614,14 +35667,14 @@ async function runReplayInContainer(brief, opts) {
     }
   }
 }
-async function runReplayViaServer(brief, auth2, budgetMs = 24e4) {
+async function runReplayViaServer(brief, auth3, budgetMs = 24e4) {
   const started = Date.now();
   const budget = Math.max(2e4, Math.round(budgetMs));
   const res = await apiRequest({
     method: "POST",
     path: "/prove/replay",
-    serviceUrl: auth2.serviceUrl,
-    token: auth2.token,
+    serviceUrl: auth3.serviceUrl,
+    token: auth3.token,
     body: {
       model: brief.model,
       model_source: brief.modelSource,
@@ -36271,14 +36324,14 @@ function parseProperty(obj) {
   if (!model || !id || !kind2 || !result || source2 === null || desc === null) return null;
   const p = { model, id, kind: kind2, source: source2, desc, result };
   if (obj.bound !== void 0) {
-    const n = nat(obj.bound);
-    if (n === null) return null;
-    p.bound = n;
+    const n2 = nat(obj.bound);
+    if (n2 === null) return null;
+    p.bound = n2;
   }
   if (obj.states !== void 0) {
-    const n = nat(obj.states);
-    if (n === null) return null;
-    p.states = n;
+    const n2 = nat(obj.states);
+    if (n2 === null) return null;
+    p.states = n2;
   }
   if (obj.trace !== void 0) {
     const t = strArr(obj.trace, LIMITS.traceItems, LIMITS.traceItem);
@@ -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);
 }
@@ -36887,14 +36982,14 @@ function readPersistedFindings(root) {
 function waiveFormalFindings(root, file, reason) {
   const all = readPersistedFindings(root);
   const at = (/* @__PURE__ */ new Date()).toISOString();
-  let n = 0;
+  let n2 = 0;
   const next = all.map((f) => {
     if (f.file !== file || f.waived) return f;
-    n++;
+    n2++;
     return { ...f, waived: { reason: reason.slice(0, 500), at } };
   });
-  if (n > 0) writePersistedFindings(root, next);
-  return n;
+  if (n2 > 0) writePersistedFindings(root, next);
+  return n2;
 }
 function writePersistedFindings(root, findings) {
   if (!isLocalState(root, FINDINGS_FILE)) return;
@@ -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");
@@ -37317,9 +37444,9 @@ function describeTarget(content, symbol, file, range, opts = {}) {
   }
   const body2 = extractSymbolBody(content, symbol, file);
   if (!body2) return { numbered: numberLines(content.slice(0, 24 * 1024)), extent };
-  const n = body2.split("\n").length;
-  const from = all.findIndex((_, i2) => all.slice(i2, i2 + n).join("\n") === body2) + 1;
-  return { lines: from > 0 ? { from, to: from + n - 1 } : void 0, numbered: numberLines(body2, from > 0 ? from : 1), extent };
+  const n2 = body2.split("\n").length;
+  const from = all.findIndex((_, i2) => all.slice(i2, i2 + n2).join("\n") === body2) + 1;
+  return { lines: from > 0 ? { from, to: from + n2 - 1 } : void 0, numbered: numberLines(body2, from > 0 ? from : 1), extent };
 }
 async function generateAndCheck(root, req, opts) {
   const readSrc = opts.deps.readSource ?? workingTreeReader(root);
@@ -37333,7 +37460,7 @@ async function generateAndCheck(root, req, opts) {
     if (outline?.source === "tree-sitter") {
       const names2 = [...new Set(outline.value.filter((f) => f.name && f.kind !== "lambda").map((f) => f.qualified))];
       const last = (req.symbol.split(/[.#:]/).pop() ?? req.symbol).toLowerCase();
-      const close = names2.filter((n) => n.toLowerCase().includes(last));
+      const close = names2.filter((n2) => n2.toLowerCase().includes(last));
       const shown = (close.length > 0 ? close : names2).slice(0, 12);
       return { ok: false, error: `no function \`${req.symbol}\` in ${req.file}${shown.length ? ` (it has: ${shown.join(", ")})` : ""}. Name one as ${req.file}#<name>, or pass --lines a-b`, rounds: 0, costUsd: 0 };
     }
@@ -37402,9 +37529,9 @@ async function generateAndCheck(root, req, opts) {
 function skippedOutcome(skip, detail) {
   return { status: "skipped", skip, ...detail ? { detail } : {}, findings: [], usage: { inputTokens: 0, outputTokens: 0, costUsd: 0, unpriced: 0 }, durationMs: 0 };
 }
-async function prepareFormalPhase(root, env = process.env, auth2, readSource, codeSource) {
+async function prepareFormalPhase(root, env = process.env, auth3, readSource, codeSource) {
   const direct = env.VERITY_PROVE_DIRECT === "1" && !!env.OPENAI_API_KEY;
-  if (!auth2 && !direct) return { ok: false, skip: "not-logged-in" };
+  if (!auth3 && !direct) return { ok: false, skip: "not-logged-in" };
   const apiKey = direct ? env.OPENAI_API_KEY : void 0;
   const toolchain = findToolchain(env);
   if (!toolchain) return { ok: false, skip: "no-toolchain" };
@@ -37418,7 +37545,7 @@ async function prepareFormalPhase(root, env = process.env, auth2, readSource, co
   const build = await buildLibraryAsync(toolchain, root, 9e4);
   if (!build.ok) return { ok: false, skip: "library-build-failed", detail: build.stderr.split("\n").filter((l) => !l.startsWith("trace:")).join(" ").slice(0, 200) };
   const code = await loadCodeContext(root, env, codeSource);
-  return { ok: true, deps: { ...defaultDeps({ auth: auth2, apiKey, env, toolchain, readSource, ...code }), codeSource: code.codeSource } };
+  return { ok: true, deps: { ...defaultDeps({ auth: auth3, apiKey, env, toolchain, readSource, ...code }), codeSource: code.codeSource } };
 }
 async function loadCodeContext(root, env = process.env, codeSource) {
   const loaded = await loadCodeMap(env);
@@ -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;
@@ -37516,9 +37744,9 @@ function recordPostTimeout(now, deadlineAt, timeoutMs = RECORD_TIMEOUT_MS) {
 var norm2 = (p) => p.replace(/\\/g, "/");
 var SAFE_SEGMENT = /^[A-Za-z0-9._@+~$()[\]-]{1,255}$/;
 function safeRepoPath(p) {
-  const n = norm2(p);
-  if (!n || n.length > 512 || n.startsWith("/") || /^[A-Za-z]:\//.test(n)) return null;
-  return n.split("/").every((s) => s !== "." && s !== ".." && SAFE_SEGMENT.test(s)) ? n : null;
+  const n2 = norm2(p);
+  if (!n2 || n2.length > 512 || n2.startsWith("/") || /^[A-Za-z]:\//.test(n2)) return null;
+  return n2.split("/").every((s) => s !== "." && s !== ".." && SAFE_SEGMENT.test(s)) ? n2 : null;
 }
 var SYMBOL = /^[A-Za-z_$][\w$]*(?:[.#:][A-Za-z_$][\w$]*)*$/;
 var IDENT3 = /^[A-Za-z][\w]*$/;
@@ -37538,10 +37766,10 @@ function recordTrace(trace) {
 }
 var ident2 = (s, re, max) => typeof s === "string" && s.length <= max && re.test(s) ? s : null;
 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(([, n]) => typeof n === "number" && n > 0).slice(0, 16)) } : null;
+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 ?? [];
@@ -37938,7 +38168,7 @@ function startAgentReview(input) {
         diffs: await buildAgentDiffs(ctx, sentPaths),
         repo_context: input.requestBody.repo_context,
         static_results: input.requestBody.static_results,
-        one_shot_chars: input.codeDelta.files.reduce((n, f) => n + f.content.length, 0),
+        one_shot_chars: input.codeDelta.files.reduce((n2, f) => n2 + f.content.length, 0),
         local_tools: offeredLocalTools(ctx)
       },
       oneShot: input.oneShot.then((r) => r.ok ? { ok: true, response: r.data } : { ok: false }),
@@ -37960,7 +38190,7 @@ function startFormalPhase(input) {
     for (const [path, sig] of rangeChangeSignals(input.frame, input.range, files)) {
       changedLines.set(path, [
         ...sig.addedRanges.map(([from, to]) => ({ from, to })),
-        ...sig.touchPoints.map((n) => ({ from: n, to: n }))
+        ...sig.touchPoints.map((n2) => ({ from: n2, to: n2 }))
       ]);
     }
   } catch {
@@ -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;
@@ -38534,11 +38772,11 @@ function printBanner(opts) {
   }
   process.stderr.write("\n");
 }
-function printPhase(n, of, title, subtitle) {
+function printPhase(n2, of, title, subtitle) {
   const color = colorEnabled();
   const columns = process.stderr.columns ?? 72;
   const width = Math.min(columns, 72);
-  const label2 = `\u2500\u2500 Phase ${n} of ${of} \xB7 ${title} `;
+  const label2 = `\u2500\u2500 Phase ${n2} of ${of} \xB7 ${title} `;
   const rule = label2 + "\u2500".repeat(Math.max(0, width - label2.length - 2));
   process.stderr.write("\n");
   process.stderr.write(color ? `  ${DIM3}${rule}${RESET2}
@@ -38915,7 +39153,7 @@ function registerDoctorCommand(program2) {
     if (report.next.length > 0) {
       console.log("");
       printWarn("Next:");
-      for (const n of report.next) printWarn(`  - ${n}`);
+      for (const n2 of report.next) printWarn(`  - ${n2}`);
     } else {
       printInfo("Setup is complete.");
     }
@@ -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));
@@ -39306,8 +39544,8 @@ function renderSelect(question, choices, state, mode2, color = colorEnabled()) {
     const marker = state.chosen.has(i2) ? "\u25C9" : "\u25CB";
     const cursor = here ? "\u276F" : " ";
     const label2 = labelOf(choice);
-    const pad = choice.hint ? " ".repeat(gutter - label2.length) : "";
-    const hint = choice.hint ? `${pad}   ${paint(choice.hint, DIM4)}` : "";
+    const pad2 = choice.hint ? " ".repeat(gutter - label2.length) : "";
+    const hint = choice.hint ? `${pad2}   ${paint(choice.hint, DIM4)}` : "";
     lines.push(`  ${cursor} ${marker} ${here ? paint(label2, BOLD2) : label2}${hint}`);
   });
   const keys = mode2 === "multi" ? "\u2191\u2193 move \xB7 space or number toggle \xB7 enter confirm" : "\u2191\u2193 move \xB7 number jumps \xB7 enter confirm";
@@ -39418,9 +39656,9 @@ function parseMultiSelect(answer, choices, fallback) {
   if (a === "") return { ids: [...fallback], recognized: true };
   const picked = /* @__PURE__ */ new Set();
   for (const part of a.split(",").map((s) => s.trim()).filter(Boolean)) {
-    const n = Number.parseInt(part, 10);
-    if (Number.isInteger(n) && n >= 1 && n <= choices.length) {
-      picked.add(choices[n - 1].id);
+    const n2 = Number.parseInt(part, 10);
+    if (Number.isInteger(n2) && n2 >= 1 && n2 <= choices.length) {
+      picked.add(choices[n2 - 1].id);
       continue;
     }
     const byId = choices.find((c) => c.id.toLowerCase() === part || c.label.toLowerCase() === part);
@@ -39590,7 +39828,7 @@ function inPlaceProgress(label2, write = (s) => process.stderr.write(s)) {
   let active = false;
   let lastAt = 0;
   let lastPct = -1;
-  const mb = (n) => (n / 1048576).toFixed(0);
+  const mb = (n2) => (n2 / 1048576).toFixed(0);
   return {
     update(seen, total) {
       const now = Date.now();
@@ -39625,7 +39863,7 @@ async function installLean(opts = {}) {
   const free = freeBytes(home);
   const needed = opts.minFreeBytes ?? LEAN_DISK_NEEDED_BYTES;
   if (free !== null && free < needed) {
-    const gb = (n) => (n / 1024 ** 3).toFixed(1);
+    const gb = (n2) => (n2 / 1024 ** 3).toFixed(1);
     return { ok: false, error: `not enough disk space for Lean: ${gb(free)} GB free where ${home} lives, needs about ${gb(needed)} GB` };
   }
   const tmp = (0, import_node_path52.join)(home, ".tmp");
@@ -40636,7 +40874,7 @@ function registerInitCommand(program2) {
         ...telemetryChoice ? { telemetry: telemetryChoice } : {},
         init: {
           completed_at: (/* @__PURE__ */ new Date()).toISOString(),
-          cli_version: true ? "0.34.2" : "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);
@@ -41616,6 +41854,148 @@ function registerTelemetryCommands(program2) {
   });
 }
 
+// src/commands/usage.ts
+var PLAN = { free: "Free", pro: "Pro", fleet: "Fleet" };
+var MONTHS = ["Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"];
+function n(v) {
+  return v.toLocaleString("en-US");
+}
+function used(v, limit) {
+  return limit === void 0 ? n(v) : `${n(v)} / ${n(limit)}`;
+}
+function secs(ms) {
+  return ms === null ? "\u2014" : `${(ms / 1e3).toFixed(1)} s`;
+}
+function utcHm(iso) {
+  const d = new Date(iso);
+  return `${String(d.getUTCHours()).padStart(2, "0")}:${String(d.getUTCMinutes()).padStart(2, "0")} UTC`;
+}
+function utcDay(iso) {
+  const d = new Date(iso);
+  return `${d.getUTCDate()} ${MONTHS[d.getUTCMonth()]}`;
+}
+function inText(now, at) {
+  const min = Math.max(0, Math.round((at.getTime() - now.getTime()) / 6e4));
+  if (min < 60) return `${min} min`;
+  const h = Math.floor(min / 60);
+  return h < 48 ? `${h} h ${min % 60} min` : `${Math.floor(h / 24)} d ${h % 24} h`;
+}
+function pad(s, w) {
+  return s.length >= w ? s : s + " ".repeat(w - s.length);
+}
+function renderSeatUsage(d, now = /* @__PURE__ */ new Date()) {
+  const lim = d.plan?.limits;
+  const pool = d.plan?.week_pool ?? null;
+  const memberWeek = (m) => pool ? void 0 : lim?.[m].week;
+  const lines = [];
+  lines.push(`=== Verity usage \xB7 ${d.organization.name}${d.plan ? ` (${PLAN[d.plan.id] ?? d.plan.id})` : ""} ===`);
+  lines.push(
+    `Session ${utcHm(d.session.start)}\u2013${utcHm(d.session.resets_at)} (resets in ${inText(now, new Date(d.session.resets_at))}) \xB7 week from Mon ${utcDay(d.week.start)} (resets Mon ${utcDay(d.week.resets_at)}, 00:00 UTC)`
+  );
+  if (!d.plan) lines.push("No plan is set for this org: counts only. Plan limits apply from Nov 2.");
+  else if (!d.enforced) lines.push("Limits are shown for information. They are not enforced before Nov 2.");
+  const me = d.members.find((m) => m.me);
+  if (me) {
+    const w = me.weeks[0];
+    lines.push("");
+    lines.push(`You (${me.email ?? `user #${me.user_id}`})`);
+    lines.push(`  ${pad("Commit & push reviews", 24)}session ${pad(used(me.session.commit, lim?.commit.session), 12)}week ${pad(used(w.commit, memberWeek("commit")), 14)}busiest session ${n(w.peak_session.commit)}`);
+    lines.push(`  ${pad("Turn reviews", 24)}session ${pad(used(me.session.turn, lim?.turn.session), 12)}week ${pad(used(w.turn, memberWeek("turn")), 14)}busiest session ${n(w.peak_session.turn)}`);
+    lines.push(`  This week: ${n(w.blocked)} blocked, ${n(w.warned)} warned \xB7 review time p50 ${secs(w.latency_ms.p50)}, p90 ${secs(w.latency_ms.p90)}`);
+  }
+  const t = d.totals.weeks[0];
+  lines.push("");
+  lines.push(`Team \xB7 ${n(d.totals.active_members)} active this week`);
+  if (pool && lim) {
+    lines.push(
+      `  Week pool: ${n(t.commit)} / ${n(pool.commit)} commit & push, ${n(t.turn)} / ${n(pool.turn)} turn (${n(pool.members)} members \xD7 ${n(lim.commit.week)} and ${n(lim.turn.week)}; the session limit is each member's)`
+    );
+  }
+  if (d.viewer !== "member" && d.members.length > 0) {
+    const rows = d.members.map((m) => [
+      `${m.email ?? `user #${m.user_id}`}${m.me ? " (you)" : ""}`,
+      used(m.session.commit, lim?.commit.session),
+      used(m.weeks[0].commit, memberWeek("commit")),
+      n(m.weeks[0].peak_session.commit),
+      used(m.session.turn, lim?.turn.session),
+      used(m.weeks[0].turn, memberWeek("turn")),
+      n(m.weeks[0].blocked),
+      `${secs(m.weeks[0].latency_ms.p50)} / ${secs(m.weeks[0].latency_ms.p90)}`
+    ]);
+    const head = ["Member", "C&P session", "C&P week", "C&P peak", "Turn session", "Turn week", "Blocked", "p50 / p90"];
+    const total = [
+      "Team total",
+      n(d.totals.session.commit),
+      used(t.commit, pool?.commit),
+      n(t.peak_session.commit),
+      n(d.totals.session.turn),
+      used(t.turn, pool?.turn),
+      n(t.blocked),
+      `${secs(t.latency_ms.p50)} / ${secs(t.latency_ms.p90)}`
+    ];
+    const widths = head.map((h, i2) => Math.max(h.length, ...rows.map((r) => r[i2].length), total[i2].length) + 2);
+    lines.push("  " + head.map((h, i2) => pad(h, widths[i2])).join("").trimEnd());
+    for (const r of rows) lines.push("  " + r.map((c, i2) => pad(c, widths[i2])).join("").trimEnd());
+    lines.push("  " + total.map((c, i2) => pad(c, widths[i2])).join("").trimEnd());
+  } else {
+    lines.push(`  This week: ${n(t.commit)} commit & push reviews, ${n(t.turn)} turn reviews, ${n(t.blocked)} blocked.`);
+    if (d.viewer === "member") lines.push(`  Only the admins of ${d.organization.name} see every member.`);
+  }
+  if (d.truncated) lines.push("  (Partial: the org has more reviews than one report reads.)");
+  lines.push("");
+  lines.push(`Counted: ${d.counting}`);
+  return lines;
+}
+async function auth2(globals) {
+  const tokenResult = await resolveToken(globals.token);
+  if (!tokenResult.ok) {
+    printError(tokenResult.error);
+    process.exit(1);
+  }
+  const urlResult = await resolveServiceUrl(globals.serviceUrl);
+  if (!urlResult.ok) {
+    printError(urlResult.error);
+    process.exit(1);
+  }
+  return { token: tokenResult.data.token, serviceUrl: urlResult.data };
+}
+function registerUsageCommand(program2) {
+  program2.command("usage").description("Show reviews per member of this org, this session and this week, against the plan limits").option("--org <name>", "The org to show (default: the org of this repository)").option("--weeks <n>", "Weeks of history in --json (1-12)", "4").option("--json", "Machine-readable output").action(async (opts) => {
+    const globals = program2.opts();
+    const { token, serviceUrl } = await auth2(globals);
+    const weeks = Math.min(12, Math.max(1, Number.parseInt(opts.weeks ?? "4", 10) || 4));
+    const query = `weeks=${weeks}${opts.org ? `&org=${encodeURIComponent(opts.org)}` : ""}`;
+    const res = await apiRequest({
+      method: "GET",
+      path: `/usage/seats?${query}`,
+      serviceUrl,
+      token,
+      verbose: globals.verbose,
+      cmd: "usage"
+    });
+    if (!res.ok) {
+      const denial = authDenialRemedy(res.error);
+      printError(denial && denial.code !== "FORBIDDEN" ? denial.remedy : res.error);
+      process.exit(1);
+    }
+    if (opts.json) {
+      printJson(res.data);
+      return;
+    }
+    if ("orgs" in res.data) {
+      const orgs = res.data.orgs;
+      if (orgs.length === 0) {
+        printInfo("You have no repository in an org that Verity knows yet. Run a review in one first.");
+        return;
+      }
+      printInfo("Choose an org: verity usage --org <name>");
+      for (const o of orgs) printInfo(`  ${o.name}${o.viewer === "admin" ? " (admin)" : ""}`);
+      return;
+    }
+    for (const line2 of renderSeatUsage(res.data)) printInfo(line2);
+  });
+}
+
 // src/commands/prove.ts
 var import_node_fs73 = require("node:fs");
 var import_node_path57 = require("node:path");
@@ -41871,8 +42251,8 @@ ${build.stderr.split("\n").filter((l) => !l.startsWith("trace:")).slice(0, 20).j
   });
   prove.command("replay <model>").description("Replay a model's counterexample on the real code in an OpenAI container (network off) \u2014 reproduced / diverged").option("--property <id>", "Only this property (default: every counterexample)").option("--model-name <name>", "OpenAI model for the replay", "gpt-5.6-terra").option("--timeout <ms>", "Per-property timeout in ms", "240000").option("--json", "Machine-readable output").action(async (model, opts) => {
     const root = repoRoot();
-    const auth2 = await proveAuth(program2);
-    if (!auth2 && !(process.env.VERITY_PROVE_DIRECT === "1" && process.env.OPENAI_API_KEY)) {
+    const auth3 = await proveAuth(program2);
+    if (!auth3 && !(process.env.VERITY_PROVE_DIRECT === "1" && process.env.OPENAI_API_KEY)) {
       printError("Not logged in \u2014 replays run on the Verity service. Run `verity login` first.");
       process.exit(2);
     }
@@ -41911,7 +42291,7 @@ ${report.error ?? ""}`);
     if (!opts.json) printInfo(`replaying ${targets.length} counterexample(s) of ${model} in network-less containers (${Math.min(targets.length, REPLAY_CONCURRENCY)} at a time)\u2026`);
     const outcomes = await mapPool(targets, REPLAY_CONCURRENCY, async (p) => {
       const brief = buildReplayBrief(root, report, p, modelSource.ok ? modelSource.content : "");
-      const outcome = await runReplay(brief, { auth: auth2 ?? void 0, apiKey: process.env.OPENAI_API_KEY, model: opts.modelName, timeoutMs: Math.max(1e4, Number(opts.timeout) || 24e4) });
+      const outcome = await runReplay(brief, { auth: auth3 ?? void 0, apiKey: process.env.OPENAI_API_KEY, model: opts.modelName, timeoutMs: Math.max(1e4, Number(opts.timeout) || 24e4) });
       if (!opts.json) process.stdout.write(renderReplay(model, p, outcome) + "\n");
       try {
         writeReplayResult(root, report.model, p.id, outcome);
@@ -41937,10 +42317,10 @@ ${report.error ?? ""}`);
       printInfo("No changed files to consider (nothing ahead of upstream). Pass paths explicitly.");
       return;
     }
-    const auth2 = await proveAuth(program2);
-    const prep = await prepareFormalPhase(root, process.env, auth2 ?? void 0);
+    const auth3 = await proveAuth(program2);
+    const prep = await prepareFormalPhase(root, process.env, auth3 ?? void 0);
     const outcome = prep.ok ? await runFormalPhaseWithin({ root, files, deadlineAt: Date.now() + Math.max(3e4, Number(opts.deadline) || 17e4), deps: prep.deps }).catch((err2) => skippedOutcome("error", String(err2?.message ?? err2).slice(0, 200))) : skippedOutcome(prep.skip, prep.detail);
-    if (auth2) await postPhaseRecord(outcome, { moment: "on-demand", parentRunId: null, pushedFiles: [] }, auth2);
+    if (auth3) await postPhaseRecord(outcome, { moment: "on-demand", parentRunId: null, pushedFiles: [] }, auth3);
     if (opts.json) {
       printJson(outcome);
     } else {
@@ -41972,8 +42352,8 @@ ${f.reason ? `      ${terminalText(f.reason, 2e3)}
       opts[flag] = input.text;
     }
     const root = repoRoot();
-    const auth2 = await proveAuth(program2);
-    if (!auth2 && !(process.env.VERITY_PROVE_DIRECT === "1" && process.env.OPENAI_API_KEY)) {
+    const auth3 = await proveAuth(program2);
+    if (!auth3 && !(process.env.VERITY_PROVE_DIRECT === "1" && process.env.OPENAI_API_KEY)) {
       printError("Not logged in \u2014 models are written by the Verity service. Run `verity login` first.");
       process.exit(2);
     }
@@ -42014,7 +42394,7 @@ ${f.reason ? `      ${terminalText(f.reason, 2e3)}
       printError("Verity library did not build");
       process.exit(2);
     }
-    const deps = await onDemandDeps(root, { auth: auth2 ?? void 0, apiKey: process.env.VERITY_PROVE_DIRECT === "1" ? process.env.OPENAI_API_KEY : void 0, toolchain: tc });
+    const deps = await onDemandDeps(root, { auth: auth3 ?? void 0, apiKey: process.env.VERITY_PROVE_DIRECT === "1" ? process.env.OPENAI_API_KEY : void 0, toolchain: tc });
     if (!opts.json) printInfo(`asking the Verity service for a model of ${symbol || `${file}:${opts.lines}`} \u2026`);
     const out2 = await generateAndCheck(root, { file, symbol: symbol || `${file}:${opts.lines}`, lines, hint: opts.hint, revise }, { deps, maxRounds: 3 });
     if (!out2.ok) {
@@ -42052,9 +42432,9 @@ ${f.reason ? `      ${terminalText(f.reason, 2e3)}
       printWarn(`No remembered formal finding on ${rel}. A finding is remembered only after a REPRODUCED replay at push.`);
       process.exit(1);
     }
-    const n = waiveFormalFindings(root, rel, opts.reason);
-    logEvent("formal_waive", { file: rel, waived: n });
-    printInfo(`Waived ${n} formal finding(s) on ${rel} for its current bytes; the waive voids when the file changes. Reason recorded: ${terminalText(opts.reason, 200)}`);
+    const n2 = waiveFormalFindings(root, rel, opts.reason);
+    logEvent("formal_waive", { file: rel, waived: n2 });
+    printInfo(`Waived ${n2} formal finding(s) on ${rel} for its current bytes; the waive voids when the file changes. Reason recorded: ${terminalText(opts.reason, 200)}`);
   });
   prove.command("hash <file>").description("Print the sha256 of a file, for a model header (Verity.model \u2026 sha256). Path is REPO-relative, as in the header").action((file) => {
     const root = repoRoot();
@@ -42177,8 +42557,8 @@ function registerLeanCommand(program2) {
 }
 
 // src/cli.ts
-program.name("verity").description("CLI for Verity quality gate service").version("0.34.2").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.2");
+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();
@@ -42213,6 +42593,7 @@ registerMemoryCommand(program);
 registerRunCommand(program);
 registerMigrateCommand(program);
 registerTelemetryCommands(program);
+registerUsageCommand(program);
 registerProveCommand(program);
 registerLeanCommand(program);
 program.parseAsync().catch((err2) => {