@utilix-tech/mcp 0.91.0 → 0.93.0

package/CHANGELOG.md

@@ -2,6 +2,14 @@
 
 Full release notes for all Utilix surfaces (browser tools, REST API, SDKs, MCP server) live at [utilix.tech/changelog](https://utilix.tech/changelog). This file tracks just this package.
 
+## 0.93.0
+- Add `find_duplicate_lockfile_versions` tool: parse an npm, yarn, or pnpm lockfile and report every package installed at more than one resolved version, with a count of install locations per version.
+- Add `summarize_git_diff_stat` tool: parse `git diff --stat` / `git log --stat` output into structured per-file insertion/deletion counts plus overall totals, flagging a scaled-down bar's split as approximate.
+
+## 0.92.0
+- Add `build_clear_site_data_header`/`parse_clear_site_data_header` tools: build a `Clear-Site-Data` response header from directives (cache, cookies, storage, executionContexts, or `*` for all of them), flagging redundant directives alongside the wildcard, or parse an existing header back into its directives.
+- Add `summarize_csv_column_stats` tool: parse CSV/TSV data and compute per-column null/unique counts plus min/max/mean/median/standard deviation for numeric columns, or the most common value for categorical ones.
+
 ## 0.91.0
 - Add `find_yaml_duplicate_keys` tool: report every mapping key that collides with an earlier key in the same YAML mapping scope, with the line and column of each repeated occurrence.
 - Add `detect_negative_amortization` tool: check whether a proposed loan payment covers the interest accruing each period and, if not, project the shortfall and the resulting balance growth, optionally flagging the month a balance cap is crossed.

package/README.md

@@ -1,6 +1,6 @@
 # @utilix-tech/mcp
 
-MCP server exposing 274 developer utility tools to Claude, Cursor, VS Code Copilot, and any [Model Context Protocol](https://modelcontextprotocol.io) compatible AI assistant.
+MCP server exposing 279 developer utility tools to Claude, Cursor, VS Code Copilot, and any [Model Context Protocol](https://modelcontextprotocol.io) compatible AI assistant.
 
 No API key required. All tools run locally. Requires Node.js 18 or later.
 
@@ -224,7 +224,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `calculate_sales_commission` | Compute a sales commission from either a flat percent rate applied to the whole sale amount, or a tiered (marginal) rate structure where each tier applies only to the slice of sales within it, plus an optional base salary added to the total payout |
 | `intersect_semver_ranges` | Determine whether two semver ranges overlap and, if so, the intersecting range, supporting the same caret/tilde/comparison-operator/exact-version syntax as the semver tool |
 
-### API / Network (51 tools)
+### API / Network (53 tools)
 | Tool | Description |
 |------|-------------|
 | `decode_jwt` | Decode a JWT: header, payload, and expiry |
@@ -281,6 +281,8 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `calculate_cookie_size_budget` | Parse a Cookie header's name=value pairs and compute each cookie's and the total header's byte size against RFC 6265's 4096-byte per-cookie guarantee and a configurable budget |
 | `verify_webhook_signature` | Recompute an HMAC over a raw webhook payload and compare it to a provided signature, accepting a `sha256=` prefix style and matching against hex or base64 encoding |
 | `score_security_headers` | Score a pasted block of raw HTTP response headers against commonly recommended security headers (CSP, HSTS, X-Content-Type-Options, X-Frame-Options, Referrer-Policy, Permissions-Policy, Cross-Origin-*), with an overall 0-100 score and A-F letter grade |
+| `build_clear_site_data_header` | Build a Clear-Site-Data response header from directives (cache, cookies, storage, executionContexts, or * for all of them), flagging redundant directives alongside the wildcard |
+| `parse_clear_site_data_header` | Parse an existing Clear-Site-Data header value into its individual directives |
 
 ### Color (4 tools)
 | Tool | Description |
@@ -290,7 +292,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `color_palette` | Generate a color palette from a base color |
 | `color_shades` | Generate shades or tints from a base color |
 
-### Code (27 tools)
+### Code (29 tools)
 | Tool | Description |
 |------|-------------|
 | `format_sql` | Format a SQL query with proper indentation |
@@ -321,8 +323,10 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `count_sql_placeholders` | Count positional (`?`, `$1`) and named (`:name`, `@name`) parameter placeholders in a SQL query, flagging mixed styles and numbered-sequence gaps or duplicates |
 | `extract_markdown_link_references` | Extract every reference-style Markdown link ([text][ref], [text][], ![alt][ref]) and match it against its [ref]: url definition, flagging unresolved references and unused definitions |
 | `build_character_class` | Assemble a [...] regex character class from named building blocks (lowercase, uppercase, digits, whitespace), custom ranges, and literal custom characters, with optional negation |
+| `find_duplicate_lockfile_versions` | Parse an npm, yarn, or pnpm lockfile and report every package installed at more than one resolved version, with a count of install locations per version |
+| `summarize_git_diff_stat` | Parse `git diff --stat` / `git log --stat` output into structured per-file insertion/deletion counts plus overall totals |
 
-### Data (20 tools)
+### Data (21 tools)
 | Tool | Description |
 |------|-------------|
 | `validate_yaml` | Validate YAML syntax |
@@ -345,6 +349,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `align_markdown_tables` | Reformat every GitHub-Flavored-Markdown pipe table in a document so each column's pipes line up visually, preserving left/center/right alignment markers |
 | `validate_markdown_heading_hierarchy` | Scan a Markdown document's ATX headings and flag heading-structure issues: skipped levels, multiple H1s, empty headings, duplicate headings, and a document that doesn't start at H1 |
 | `check_markdown_internal_links` | Scan a Markdown document's ATX headings, compute the GitHub-style anchor slug for each, and check every [text](#slug) internal link against them, flagging links that point at a heading that doesn't exist |
+| `summarize_csv_column_stats` | Parse CSV/TSV data and compute per-column summary statistics: null/unique counts for every column, plus min/max/mean/median/standard deviation for numeric columns or the most common value for categorical ones |
 
 ### CSS (2 tools)
 | Tool | Description |

package/dist/index.js

@@ -14560,5 +14560,398 @@ server.tool(
     return text(JSON.stringify(result, null, 2));
   }
 );
+var _CLEAR_SITE_DATA_DIRECTIVES_MCP = /* @__PURE__ */ new Set(["cache", "cookies", "storage", "executionContexts", "*"]);
+function _buildClearSiteDataMcp(directives) {
+  if (!Array.isArray(directives) || directives.length === 0) {
+    return { error: "directives must be a non-empty array" };
+  }
+  const seen = /* @__PURE__ */ new Set();
+  const normalized = [];
+  for (const raw of directives) {
+    if (!_CLEAR_SITE_DATA_DIRECTIVES_MCP.has(raw)) {
+      return { error: `Unrecognized directive "${raw}". Valid directives: cache, cookies, storage, executionContexts, *` };
+    }
+    if (seen.has(raw)) continue;
+    seen.add(raw);
+    normalized.push(raw);
+  }
+  const warnings = [];
+  if (normalized.includes("*") && normalized.length > 1) {
+    warnings.push('"*" already clears cache, cookies, storage, and executionContexts (plus any future data types the spec adds), so listing other directives alongside it is redundant.');
+  }
+  const header = normalized.map((d) => `"${d}"`).join(", ");
+  return {
+    header,
+    headerName: "Clear-Site-Data",
+    snippet: `Clear-Site-Data: ${header}`,
+    directives: normalized,
+    warnings
+  };
+}
+function _parseClearSiteDataMcp(raw) {
+  if (!raw || raw.trim() === "") return { error: "Input is empty" };
+  const withoutLabel = raw.trim().replace(/^clear-site-data:\s*/i, "");
+  const tokens = withoutLabel.split(",").map((t) => t.trim()).filter((t) => t !== "");
+  if (tokens.length === 0) return { error: "No directives found" };
+  const directives = [];
+  for (const token of tokens) {
+    const match = token.match(/^"(.*)"$/);
+    const value = match ? match[1] : token;
+    if (!_CLEAR_SITE_DATA_DIRECTIVES_MCP.has(value)) {
+      return { error: `Unrecognized directive "${token}"; each directive should be a quoted string like "cookies"` };
+    }
+    directives.push(value);
+  }
+  return _buildClearSiteDataMcp(directives);
+}
+server.tool(
+  "build_clear_site_data_header",
+  "Build a Clear-Site-Data response-header value from a list of directives (cache, cookies, storage, executionContexts, or * for all of them), flagging redundant directives alongside the wildcard.",
+  {
+    directives: z.array(z.enum(["cache", "cookies", "storage", "executionContexts", "*"])).min(1).describe("Directives to clear")
+  },
+  async ({ directives }) => {
+    const result = _buildClearSiteDataMcp(directives);
+    if ("error" in result) return errText(result);
+    return text(JSON.stringify(result, null, 2));
+  }
+);
+server.tool(
+  "parse_clear_site_data_header",
+  'Parse an existing Clear-Site-Data header value (with or without a leading "Clear-Site-Data:" label, quoted or unquoted) into its individual directives.',
+  {
+    header: z.string().min(1).describe("The Clear-Site-Data header value to parse")
+  },
+  async ({ header }) => {
+    const result = _parseClearSiteDataMcp(header);
+    if ("error" in result) return errText(result);
+    return text(JSON.stringify(result, null, 2));
+  }
+);
+function _parseCsvForStatsMcp(input, delimiter, hasHeader) {
+  if (!input || input.trim() === "") return { error: "Input is empty" };
+  const lines = input.replace(/\r\n/g, "\n").split("\n").filter((l) => l.trim() !== "");
+  if (lines.length === 0) return { error: "No data found" };
+  function parseRow(line) {
+    const fields = [];
+    let cur = "";
+    let inQuote = false;
+    for (let i = 0; i < line.length; i++) {
+      if (line[i] === '"') {
+        if (inQuote && line[i + 1] === '"') {
+          cur += '"';
+          i++;
+        } else {
+          inQuote = !inQuote;
+        }
+      } else if (line[i] === delimiter && !inQuote) {
+        fields.push(cur);
+        cur = "";
+      } else {
+        cur += line[i];
+      }
+    }
+    fields.push(cur);
+    return fields;
+  }
+  const allRows = lines.map(parseRow);
+  const headers = hasHeader ? allRows[0] : allRows[0].map((_, idx) => `Column ${idx + 1}`);
+  const rows = hasHeader ? allRows.slice(1) : allRows;
+  if (rows.length === 0) return { error: "No data rows found" };
+  return { headers, rows };
+}
+var _CSV_STATS_NUMERIC_RE_MCP = /^-?\d+(\.\d+)?([eE][+-]?\d+)?$/;
+function _parseCsvStatsNumericMcp(raw) {
+  if (!_CSV_STATS_NUMERIC_RE_MCP.test(raw)) return null;
+  const n = Number(raw);
+  return Number.isFinite(n) ? n : null;
+}
+function _summarizeCsvColumnStatsMcp(input, delimiter, hasHeader) {
+  const parsed = _parseCsvForStatsMcp(input, delimiter, hasHeader);
+  if ("error" in parsed) return parsed;
+  const columns = parsed.headers.map((name, colIdx) => {
+    let nullCount = 0;
+    let nonNumericCount = 0;
+    const numericValues = [];
+    const freq = /* @__PURE__ */ new Map();
+    for (const row of parsed.rows) {
+      const raw = (row[colIdx] ?? "").trim();
+      if (raw === "") {
+        nullCount++;
+        continue;
+      }
+      freq.set(raw, (freq.get(raw) ?? 0) + 1);
+      const n = _parseCsvStatsNumericMcp(raw);
+      if (n !== null) numericValues.push(n);
+      else nonNumericCount++;
+    }
+    const nonEmptyCount = parsed.rows.length - nullCount;
+    const isNumeric = nonEmptyCount > 0 && nonNumericCount === 0;
+    let mostCommon;
+    for (const [value, count] of freq) {
+      if (!mostCommon || count > mostCommon.count) mostCommon = { value, count };
+    }
+    const stats = {
+      name,
+      totalCount: parsed.rows.length,
+      nullCount,
+      uniqueCount: freq.size,
+      isNumeric,
+      numericCount: numericValues.length
+    };
+    if (isNumeric && numericValues.length > 0) {
+      const sorted = [...numericValues].sort((a, b) => a - b);
+      const sum = sorted.reduce((a, b) => a + b, 0);
+      const mean = sum / sorted.length;
+      const mid = Math.floor(sorted.length / 2);
+      const median = sorted.length % 2 === 0 ? (sorted[mid - 1] + sorted[mid]) / 2 : sorted[mid];
+      const variance = sorted.reduce((acc, v) => acc + (v - mean) ** 2, 0) / sorted.length;
+      stats.min = sorted[0];
+      stats.max = sorted[sorted.length - 1];
+      stats.mean = mean;
+      stats.median = median;
+      stats.stdDev = Math.sqrt(variance);
+    } else {
+      stats.mostCommon = mostCommon;
+    }
+    return stats;
+  });
+  return { columns, rowCount: parsed.rows.length };
+}
+server.tool(
+  "summarize_csv_column_stats",
+  "Parse CSV/TSV data and compute per-column summary statistics: null and unique-value counts for every column, plus min/max/mean/median/standard deviation for any column where every non-empty value parses as a plain number. A column with any non-numeric non-empty value is treated as categorical, reporting the most frequent value and its count instead.",
+  {
+    csv: z.string().min(1).describe("The CSV/TSV data, with a header row by default"),
+    delimiter: z.string().optional().describe('Field delimiter, default ","'),
+    hasHeader: z.boolean().optional().describe("Whether the first row is a header row, default true")
+  },
+  async ({ csv, delimiter, hasHeader }) => {
+    const result = _summarizeCsvColumnStatsMcp(csv, delimiter?.trim() || ",", hasHeader !== false);
+    if ("error" in result) return errText(result);
+    return text(JSON.stringify(result, null, 2));
+  }
+);
+function _detectLockfileFormatMcp(input) {
+  const trimmed = input.trim();
+  if (trimmed.startsWith("{")) return "npm";
+  if (/^lockfileVersion:/m.test(trimmed) || /^packages:\s*$/m.test(trimmed)) return "pnpm";
+  if (/yarn lockfile v\d/i.test(trimmed)) return "yarn";
+  if (/^\s*version\s+"[^"]+"/m.test(trimmed) && /@[^\s",]+["']?\s*:?\s*$/m.test(trimmed)) return "yarn";
+  return null;
+}
+function _parseNpmLockfileMcp(input) {
+  const data = JSON.parse(input);
+  const entries = [];
+  const packages = data.packages;
+  if (packages && typeof packages === "object" && !Array.isArray(packages)) {
+    for (const [path, metaRaw] of Object.entries(packages)) {
+      if (path === "" || !metaRaw || typeof metaRaw !== "object") continue;
+      const meta = metaRaw;
+      if (typeof meta.version !== "string") continue;
+      const idx = path.lastIndexOf("node_modules/");
+      const name = idx === -1 ? path : path.slice(idx + "node_modules/".length);
+      entries.push({ name, version: meta.version });
+    }
+    return entries;
+  }
+  const dependencies = data.dependencies;
+  if (dependencies && typeof dependencies === "object" && !Array.isArray(dependencies)) {
+    const walk = (deps) => {
+      for (const [name, metaRaw] of Object.entries(deps)) {
+        if (!metaRaw || typeof metaRaw !== "object") continue;
+        const meta = metaRaw;
+        if (typeof meta.version === "string") entries.push({ name, version: meta.version });
+        if (meta.dependencies && typeof meta.dependencies === "object") walk(meta.dependencies);
+      }
+    };
+    walk(dependencies);
+  }
+  return entries;
+}
+function _splitYarnKeyMcp(key) {
+  const trimmedKey = key.trim().replace(/^"|"$/g, "");
+  const idx = trimmedKey.lastIndexOf("@");
+  if (idx <= 0) return null;
+  return { name: trimmedKey.slice(0, idx), range: trimmedKey.slice(idx + 1) };
+}
+function _parseYarnLockfileMcp(input) {
+  const entries = [];
+  const blocks = input.replace(/\r\n/g, "\n").split(/\n\n+/);
+  for (const block of blocks) {
+    const lines = block.split("\n");
+    const headerLines = [];
+    let i = 0;
+    while (i < lines.length && lines[i].trim() !== "" && !lines[i].startsWith(" ") && !lines[i].startsWith("#")) {
+      headerLines.push(lines[i]);
+      i++;
+    }
+    if (headerLines.length === 0) continue;
+    const header = headerLines.join(" ").replace(/:\s*$/, "");
+    const keys = header.split(",").map((k) => k.trim()).filter(Boolean);
+    const versionLine = lines.find((l) => /^\s+version\s+"/.test(l));
+    if (!versionLine) continue;
+    const versionMatch = versionLine.match(/version\s+"([^"]+)"/);
+    if (!versionMatch) continue;
+    const version = versionMatch[1];
+    const names = /* @__PURE__ */ new Set();
+    for (const key of keys) {
+      const split = _splitYarnKeyMcp(key);
+      if (split) names.add(split.name);
+    }
+    for (const name of names) entries.push({ name, version });
+  }
+  return entries;
+}
+function _parsePnpmPackageKeyMcp(rawKey) {
+  let key = rawKey.trim();
+  if (key.startsWith("/")) key = key.slice(1);
+  const parenIdx = key.indexOf("(");
+  if (parenIdx !== -1) key = key.slice(0, parenIdx);
+  const idx = key.lastIndexOf("@");
+  if (idx <= 0) return null;
+  const name = key.slice(0, idx);
+  const version = key.slice(idx + 1).trim();
+  if (!version) return null;
+  return { name, version };
+}
+function _parsePnpmLockfileMcp(input) {
+  const data = yaml.load(input);
+  const entries = [];
+  const packages = data?.packages;
+  if (!packages || typeof packages !== "object" || Array.isArray(packages)) return entries;
+  for (const rawKey of Object.keys(packages)) {
+    const parsed = _parsePnpmPackageKeyMcp(rawKey);
+    if (parsed) entries.push(parsed);
+  }
+  return entries;
+}
+function _findDuplicateLockfileVersionsMcp(input, format) {
+  if (!input || !input.trim()) return { error: "Input is empty" };
+  const detected = format ?? _detectLockfileFormatMcp(input);
+  if (!detected) {
+    return { error: "Could not detect lockfile format; expected an npm package-lock.json, a yarn.lock, or a pnpm-lock.yaml" };
+  }
+  let rawEntries;
+  try {
+    if (detected === "npm") rawEntries = _parseNpmLockfileMcp(input);
+    else if (detected === "yarn") rawEntries = _parseYarnLockfileMcp(input);
+    else rawEntries = _parsePnpmLockfileMcp(input);
+  } catch (e) {
+    return { error: `Failed to parse ${detected} lockfile: ${e.message}` };
+  }
+  if (rawEntries.length === 0) {
+    return { error: `No packages found in ${detected} lockfile. If this is a pnpm lockfile older than v6 (slash-separated versions instead of "name@version"), re-generate it with a current pnpm version first.` };
+  }
+  const byName = /* @__PURE__ */ new Map();
+  for (const { name, version } of rawEntries) {
+    let versions = byName.get(name);
+    if (!versions) {
+      versions = /* @__PURE__ */ new Map();
+      byName.set(name, versions);
+    }
+    versions.set(version, (versions.get(version) ?? 0) + 1);
+  }
+  const packages = [];
+  for (const [name, versions] of byName) {
+    const versionList = [...versions.entries()].map(([version, count]) => ({ version, count })).sort((a, b) => b.count - a.count || a.version.localeCompare(b.version));
+    packages.push({ name, versions: versionList, isDuplicate: versionList.length > 1 });
+  }
+  packages.sort((a, b) => a.name.localeCompare(b.name));
+  const duplicatePackages = packages.filter((p) => p.isDuplicate);
+  return { format: detected, totalPackages: packages.length, duplicatePackages, packages };
+}
+server.tool(
+  "find_duplicate_lockfile_versions",
+  "Parse an npm (package-lock.json), yarn (yarn.lock), or pnpm (pnpm-lock.yaml) lockfile and report every package installed at more than one resolved version, with a count of how many install locations resolve to each version. Format is auto-detected from content unless given explicitly.",
+  {
+    lockfile: z.string().min(1).describe("The full lockfile contents"),
+    format: z.enum(["npm", "yarn", "pnpm"]).optional().describe("Force a format instead of auto-detecting it from content")
+  },
+  async ({ lockfile, format }) => {
+    const result = _findDuplicateLockfileVersionsMcp(lockfile, format);
+    if ("error" in result) return errText(result);
+    return text(JSON.stringify(result, null, 2));
+  }
+);
+var _GIT_DIFF_STAT_FILE_RE_MCP = /^\s*(.+?)\s*\|\s*(Bin|\d+)\s*(.*)$/;
+var _GIT_DIFF_STAT_SUMMARY_RE_MCP = /^\s*(\d+)\s+files?\s+changed(?:,\s*(\d+)\s+insertions?\(\+\))?(?:,\s*(\d+)\s+deletions?\(-\))?/;
+function _summarizeGitDiffStatMcp(input) {
+  if (!input || !input.trim()) return { error: "Input is empty" };
+  const lines = input.replace(/\r\n/g, "\n").split("\n");
+  const files = [];
+  let summaryMatch = null;
+  for (const line of lines) {
+    if (!line.trim()) continue;
+    const sm = line.match(_GIT_DIFF_STAT_SUMMARY_RE_MCP);
+    if (sm) {
+      summaryMatch = sm;
+      continue;
+    }
+    const m = line.match(_GIT_DIFF_STAT_FILE_RE_MCP);
+    if (!m) continue;
+    const rawName = m[1];
+    const countRaw = m[2];
+    const bar = m[3];
+    let file = rawName;
+    let oldFile;
+    const renameMatch = rawName.match(/^(.*?)\s*=>\s*(.*)$/);
+    if (renameMatch) {
+      oldFile = renameMatch[1].trim();
+      file = renameMatch[2].trim();
+    }
+    if (countRaw === "Bin") {
+      files.push({ file, oldFile, changes: null, insertions: null, deletions: null, binary: true, approximate: false });
+      continue;
+    }
+    const changes = parseInt(countRaw, 10);
+    const plusCount = (bar.match(/\+/g) ?? []).length;
+    const minusCount = (bar.match(/-/g) ?? []).length;
+    const barTotal = plusCount + minusCount;
+    let insertions;
+    let deletions;
+    let approximate = false;
+    if (barTotal === changes) {
+      insertions = plusCount;
+      deletions = minusCount;
+    } else if (barTotal > 0) {
+      approximate = true;
+      insertions = Math.round(changes * plusCount / barTotal);
+      deletions = changes - insertions;
+    } else if (changes === 0) {
+      insertions = 0;
+      deletions = 0;
+    } else {
+      approximate = true;
+      insertions = null;
+      deletions = null;
+    }
+    files.push({ file, oldFile, changes, insertions, deletions, binary: false, approximate });
+  }
+  if (files.length === 0) {
+    return { error: "No file stat lines found; expected output from `git diff --stat` or `git log --stat`" };
+  }
+  let filesChanged = files.length;
+  let totalInsertions = files.reduce((sum, f) => sum + (f.insertions ?? 0), 0);
+  let totalDeletions = files.reduce((sum, f) => sum + (f.deletions ?? 0), 0);
+  if (summaryMatch) {
+    filesChanged = parseInt(summaryMatch[1], 10);
+    if (summaryMatch[2]) totalInsertions = parseInt(summaryMatch[2], 10);
+    if (summaryMatch[3]) totalDeletions = parseInt(summaryMatch[3], 10);
+  }
+  return { files, filesChanged, totalInsertions, totalDeletions };
+}
+server.tool(
+  "summarize_git_diff_stat",
+  "Parse the per-file lines and trailing summary line of `git diff --stat` or `git log --stat` output into structured per-file insertion/deletion counts plus overall totals. Once a diff is wide enough that git scales the bar down, the per-file split is a proportional estimate (flagged via approximate) rather than an exact count, though the overall totals stay exact.",
+  {
+    diffStat: z.string().min(1).describe("Output of `git diff --stat` or `git log --stat`")
+  },
+  async ({ diffStat }) => {
+    const result = _summarizeGitDiffStatMcp(diffStat);
+    if ("error" in result) return errText(result);
+    return text(JSON.stringify(result, null, 2));
+  }
+);
 var transport = new StdioServerTransport();
 await server.connect(transport);

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@utilix-tech/mcp",
-  "version": "0.91.0",
-  "description": "MCP server exposing 272 Utilix developer tools to Claude, Cursor, VS Code Copilot, and any MCP-compatible AI assistant.",
+  "version": "0.93.0",
+  "description": "MCP server exposing 279 Utilix developer tools to Claude, Cursor, VS Code Copilot, and any MCP-compatible AI assistant.",
   "author": "Utilix <hello@utilix.tech>",
   "license": "MIT",
   "homepage": "https://utilix.tech/mcp",