@utilix-tech/mcp 0.25.0 → 0.27.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.27.0
+- Add `compute_jwk_thumbprint` tool: RFC 7638 canonical thumbprint of a single JWK, hashed with SHA-256/384/512.
+- Add `calculate_video_bitrate` tool: resulting file size from a video/audio bitrate and duration, or the required bitrate to hit a target file size.
+
+## 0.26.0
+- Add `calculate_break_even` tool: break-even unit count and revenue from fixed costs, variable cost per unit, and price per unit, plus profit and margin of safety at an optional sales volume.
+- Add `calculate_string_distance` tool: Levenshtein edit distance and normalized similarity between two strings, with an optional Damerau (transposition) mode.
+
 ## 0.25.0
 - Add `calculate_discount` tool: solve a sale price, amount saved, or discount percent from any one of them, or stack successive discounts where 20% then 10% is an effective 28% off.
 - Add `convert_subtitles` tool: convert between SubRip (.srt) and WebVTT (.vtt) with an optional time shift to resync every cue.

package/README.md

@@ -1,6 +1,6 @@
 # @utilix-tech/mcp
 
-MCP server exposing 137 developer utility tools to Claude, Cursor, VS Code Copilot, and any [Model Context Protocol](https://modelcontextprotocol.io) compatible AI assistant.
+MCP server exposing 141 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.
 
@@ -126,7 +126,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `generate_qr` | Generate a QR code as an SVG string |
 | `generate_random_data` | Generate random mock data: names, emails, UUIDs, IPs, etc. |
 
-### Text (12 tools)
+### Text (13 tools)
 | Tool | Description |
 |------|-------------|
 | `convert_case` | Convert text case: camelCase, snake_case, PascalCase, etc. |
@@ -141,6 +141,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `detect_passive_voice` | Flag sentences written in passive voice, e.g. "was written", "were approved by the team" |
 | `score_readability` | Score text with Flesch Reading Ease, Flesch-Kincaid Grade Level, and Gunning Fog Index |
 | `detect_filler_words` | Scan text for filler words, hedge phrases, and clichés with per-phrase counts and a density score |
+| `calculate_string_distance` | Compute the Levenshtein (or Damerau) edit distance and normalized similarity between two strings |
 
 ### Time (6 tools)
 | Tool | Description |
@@ -152,7 +153,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `convert_timezone` | Convert a date/time between timezones |
 | `convert_iso8601_duration` | Parse an ISO 8601 duration into components and total seconds, or format seconds into a duration string |
 
-### Units (15 tools)
+### Units (19 tools)
 | Tool | Description |
 |------|-------------|
 | `convert_bytes` | Convert between B, KB, MB, GB, TB, KiB, MiB, GiB, TiB |
@@ -172,12 +173,15 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `calculate_margin_markup` | Given any two of cost, price, margin percent, and markup percent, solve for the other two plus gross profit |
 | `calculate_discount` | Solve a sale price, amount saved, or discount percent from any one of them, or stack successive discounts in order |
 | `convert_subtitles` | Convert subtitles between SubRip (.srt) and WebVTT (.vtt), with an optional time shift to resync every cue |
+| `calculate_break_even` | Compute the break-even unit count and revenue from fixed costs, variable cost per unit, and price per unit |
+| `calculate_video_bitrate` | Calculate a video's file size from a bitrate and duration, or the bitrate needed to hit a target file size |
 
-### API / Network (10 tools)
+### API / Network (11 tools)
 | Tool | Description |
 |------|-------------|
 | `decode_jwt` | Decode a JWT: header, payload, and expiry |
 | `parse_jwks` | Parse a JWKS (or a single bare JWK): type, use, algorithm, key ID, and size per key |
+| `compute_jwk_thumbprint` | Compute the RFC 7638 canonical thumbprint of a single JWK (SHA-256/384/512) |
 | `build_curl` | Build a cURL command from method, URL, headers, and body |
 | `curl_to_code` | Convert a cURL command to fetch, axios, Python, Go, PHP, or Ruby |
 | `cors_headers` | Generate CORS response headers for a configuration |

package/dist/index.js

@@ -4,6 +4,7 @@
 import { McpServer } from "@modelcontextprotocol/sdk/server/mcp.js";
 import { StdioServerTransport } from "@modelcontextprotocol/sdk/server/stdio.js";
 import { z } from "zod";
+import { createHash } from "crypto";
 import {
   parseJson,
   minifyJson,
@@ -2826,6 +2827,61 @@ server.tool("parse_jwks", "Parse a JSON Web Key Set (or a single bare JWK) and s
   if ("error" in result) return errText(result);
   return text(JSON.stringify(result, null, 2));
 });
+var _JWK_THUMBPRINT_MEMBERS = {
+  oct: ["k", "kty"],
+  RSA: ["e", "kty", "n"],
+  EC: ["crv", "kty", "x", "y"],
+  OKP: ["crv", "kty", "x"]
+};
+var _JWK_THUMBPRINT_NODE_HASH = {
+  "SHA-256": "sha256",
+  "SHA-384": "sha384",
+  "SHA-512": "sha512"
+};
+function _computeJwkThumbprint(input, hashAlg) {
+  const trimmed = input.trim();
+  if (!trimmed) return { error: "No input provided" };
+  const nodeHash = _JWK_THUMBPRINT_NODE_HASH[hashAlg];
+  if (!nodeHash) return { error: 'hashAlg must be one of "SHA-256", "SHA-384", "SHA-512"' };
+  let jwk;
+  try {
+    jwk = JSON.parse(trimmed);
+  } catch (e) {
+    return { error: `Invalid JSON: ${e instanceof Error ? e.message : String(e)}` };
+  }
+  if (jwk === null || typeof jwk !== "object" || Array.isArray(jwk)) {
+    return { error: "Input must be a single JWK object, not a JWKS set or array" };
+  }
+  const obj = jwk;
+  const kty = obj.kty;
+  if (typeof kty !== "string") return { error: 'JWK must have a "kty" (key type) member' };
+  const members = _JWK_THUMBPRINT_MEMBERS[kty];
+  if (!members) return { error: `Unsupported key type "${kty}": supported types are RSA, EC, oct, OKP` };
+  const canonical = {};
+  for (const m of members) {
+    const v = obj[m];
+    if (typeof v !== "string" || v.length === 0) {
+      return { error: `JWK is missing required member "${m}" for key type "${kty}"` };
+    }
+    canonical[m] = v;
+  }
+  const canonicalJson = "{" + members.map((m) => `${JSON.stringify(m)}:${JSON.stringify(canonical[m])}`).join(",") + "}";
+  const thumbprint = createHash(nodeHash).update(canonicalJson, "utf8").digest("base64url");
+  return { kty, hashAlg, members, canonicalJson, thumbprint };
+}
+server.tool(
+  "compute_jwk_thumbprint",
+  "Compute the RFC 7638 thumbprint of a single JWK: canonicalize its required members into lexicographically-ordered, whitespace-free JSON and hash it. A fingerprint for identifying/matching a key, not a signature or verification. Accepts a bare JWK only, not a JWKS set.",
+  {
+    input: z.string().describe("A single JWK object (not a JWKS set)"),
+    hashAlg: z.enum(["SHA-256", "SHA-384", "SHA-512"]).default("SHA-256")
+  },
+  async ({ input, hashAlg }) => {
+    const result = _computeJwkThumbprint(input, hashAlg);
+    if ("error" in result) return errText(result);
+    return text(JSON.stringify(result, null, 2));
+  }
+);
 var _WAV_AUDIO_FORMAT_LABELS = { 1: "PCM", 3: "IEEE float", 6: "A-law", 7: "mu-law", 65534: "Extensible" };
 function _readWavAscii4(bytes, offset) {
   return String.fromCharCode(bytes[offset], bytes[offset + 1], bytes[offset + 2], bytes[offset + 3]);
@@ -4342,5 +4398,163 @@ server.tool(
     return text(JSON.stringify(result, null, 2));
   }
 );
+function _calculateBreakEvenMcp(fixedCosts, variableCostPerUnit, pricePerUnit, salesVolume) {
+  if (!Number.isFinite(fixedCosts)) return { error: "fixedCosts must be a finite number" };
+  if (!Number.isFinite(variableCostPerUnit)) return { error: "variableCostPerUnit must be a finite number" };
+  if (!Number.isFinite(pricePerUnit)) return { error: "pricePerUnit must be a finite number" };
+  if (fixedCosts < 0) return { error: "fixedCosts cannot be negative" };
+  if (variableCostPerUnit < 0) return { error: "variableCostPerUnit cannot be negative" };
+  if (pricePerUnit <= 0) return { error: "pricePerUnit must be greater than zero" };
+  if (pricePerUnit <= variableCostPerUnit) {
+    return { error: "pricePerUnit must be greater than variableCostPerUnit, otherwise every unit sold loses money and break-even is never reached" };
+  }
+  const round4 = (n) => Math.round(n * 1e4) / 1e4;
+  const contributionMarginPerUnit = pricePerUnit - variableCostPerUnit;
+  const contributionMarginRatio = contributionMarginPerUnit / pricePerUnit * 100;
+  const breakEvenUnits = fixedCosts / contributionMarginPerUnit;
+  const breakEvenUnitsRounded = Math.ceil(breakEvenUnits);
+  const breakEvenRevenue = breakEvenUnits * pricePerUnit;
+  const result = {
+    fixedCosts: round4(fixedCosts),
+    variableCostPerUnit: round4(variableCostPerUnit),
+    pricePerUnit: round4(pricePerUnit),
+    contributionMarginPerUnit: round4(contributionMarginPerUnit),
+    contributionMarginRatio: round4(contributionMarginRatio),
+    breakEvenUnits: round4(breakEvenUnits),
+    breakEvenUnitsRounded,
+    breakEvenRevenue: round4(breakEvenRevenue)
+  };
+  if (typeof salesVolume === "number" && Number.isFinite(salesVolume)) {
+    if (salesVolume < 0) return { error: "salesVolume cannot be negative" };
+    const marginOfSafetyUnits = salesVolume - breakEvenUnits;
+    result.salesVolume = round4(salesVolume);
+    result.revenueAtSalesVolume = round4(salesVolume * pricePerUnit);
+    result.profitAtSalesVolume = round4(salesVolume * contributionMarginPerUnit - fixedCosts);
+    result.marginOfSafetyUnits = round4(marginOfSafetyUnits);
+    result.marginOfSafetyPercent = salesVolume > 0 ? round4(marginOfSafetyUnits / salesVolume * 100) : 0;
+  }
+  return result;
+}
+server.tool(
+  "calculate_break_even",
+  "From fixed costs, the variable cost per unit, and the selling price per unit, compute the break-even point: the unit count and revenue at which profit is exactly zero. The price must exceed the variable cost, since otherwise every unit sold loses money and break-even is never reached no matter the volume. Optionally pass a sales volume to also get the profit (or loss) at that volume and the margin of safety above break-even. Pure arithmetic, no live cost/pricing feed.",
+  {
+    fixedCosts: z.number().describe("Total fixed costs for the period (cannot be negative)"),
+    variableCostPerUnit: z.number().describe("Variable cost to produce one unit (cannot be negative)"),
+    pricePerUnit: z.number().describe("Selling price per unit (must be greater than variableCostPerUnit)"),
+    salesVolume: z.number().optional().describe("Optional actual/planned unit sales, to compute profit and margin of safety at that volume")
+  },
+  async ({ fixedCosts, variableCostPerUnit, pricePerUnit, salesVolume }) => {
+    const result = _calculateBreakEvenMcp(fixedCosts, variableCostPerUnit, pricePerUnit, salesVolume);
+    if ("error" in result) return errText(result);
+    return text(JSON.stringify(result, null, 2));
+  }
+);
+function _calculateStringDistanceMcp(a, b, mode, caseSensitive) {
+  const MAX_LEN = 5e3;
+  if (a.length > MAX_LEN || b.length > MAX_LEN) return { error: `Strings must be at most ${MAX_LEN} characters` };
+  const s1 = caseSensitive ? a : a.toLowerCase();
+  const s2 = caseSensitive ? b : b.toLowerCase();
+  const m = s1.length;
+  const n = s2.length;
+  const maxLength = Math.max(m, n);
+  if (m === 0 || n === 0) {
+    return { a, b, distance: maxLength, similarity: maxLength === 0 ? 1 : 0, maxLength, mode };
+  }
+  const dp = Array.from({ length: m + 1 }, () => new Array(n + 1).fill(0));
+  for (let i = 0; i <= m; i++) dp[i][0] = i;
+  for (let j = 0; j <= n; j++) dp[0][j] = j;
+  for (let i = 1; i <= m; i++) {
+    for (let j = 1; j <= n; j++) {
+      const cost = s1[i - 1] === s2[j - 1] ? 0 : 1;
+      dp[i][j] = Math.min(dp[i - 1][j] + 1, dp[i][j - 1] + 1, dp[i - 1][j - 1] + cost);
+      if (mode === "damerau" && i > 1 && j > 1 && s1[i - 1] === s2[j - 2] && s1[i - 2] === s2[j - 1]) {
+        dp[i][j] = Math.min(dp[i][j], dp[i - 2][j - 2] + 1);
+      }
+    }
+  }
+  const distance = dp[m][n];
+  const similarity = maxLength === 0 ? 1 : Math.round((1 - distance / maxLength) * 1e4) / 1e4;
+  return { a, b, distance, similarity, maxLength, mode };
+}
+server.tool(
+  "calculate_string_distance",
+  'Compute the Levenshtein edit distance between two strings: the minimum number of single-character insertions, deletions, and substitutions needed to turn a into b, plus a normalized 0-1 similarity ratio. Pass mode "damerau" to also count an adjacent-character transposition as a single edit (optimal-string-alignment variant, not unrestricted Damerau-Levenshtein).',
+  {
+    a: z.string().describe("The first string (max 5000 characters)"),
+    b: z.string().describe("The second string (max 5000 characters)"),
+    mode: z.enum(["levenshtein", "damerau"]).default("levenshtein").describe("levenshtein counts a transposition as 2 edits; damerau counts it as 1"),
+    caseSensitive: z.boolean().default(true)
+  },
+  async ({ a, b, mode, caseSensitive }) => {
+    const result = _calculateStringDistanceMcp(a, b, mode, caseSensitive);
+    if ("error" in result) return errText(result);
+    return text(JSON.stringify(result, null, 2));
+  }
+);
+function _calculateVideoBitrateMcp(mode, durationSeconds, videoBitrateKbps, audioBitrateKbps, targetSizeMB) {
+  if (!Number.isFinite(durationSeconds) || durationSeconds <= 0) {
+    return { error: "durationSeconds must be a positive number" };
+  }
+  if (!Number.isFinite(audioBitrateKbps) || audioBitrateKbps < 0) {
+    return { error: "audioBitrateKbps must be zero or a positive number" };
+  }
+  const round2 = (n) => Math.round(n * 100) / 100;
+  if (mode === "size-from-bitrate") {
+    if (typeof videoBitrateKbps !== "number" || !Number.isFinite(videoBitrateKbps) || videoBitrateKbps <= 0) {
+      return { error: 'videoBitrateKbps must be a positive number for mode "size-from-bitrate"' };
+    }
+    const totalBitrateKbps = videoBitrateKbps + audioBitrateKbps;
+    const fileSizeBytes = totalBitrateKbps * 1e3 * durationSeconds / 8;
+    return {
+      mode,
+      durationSeconds,
+      videoBitrateKbps: round2(videoBitrateKbps),
+      audioBitrateKbps: round2(audioBitrateKbps),
+      totalBitrateKbps: round2(totalBitrateKbps),
+      fileSizeBytes: Math.round(fileSizeBytes),
+      fileSizeMB: round2(fileSizeBytes / 1e6),
+      fileSizeMiB: round2(fileSizeBytes / 1048576)
+    };
+  }
+  if (mode === "bitrate-from-size") {
+    if (typeof targetSizeMB !== "number" || !Number.isFinite(targetSizeMB) || targetSizeMB <= 0) {
+      return { error: 'targetSizeMB must be a positive number for mode "bitrate-from-size"' };
+    }
+    const fileSizeBytes = targetSizeMB * 1e6;
+    const totalBitrateKbps = fileSizeBytes * 8 / (1e3 * durationSeconds);
+    const videoKbps = totalBitrateKbps - audioBitrateKbps;
+    if (videoKbps <= 0) {
+      return { error: "audioBitrateKbps exceeds the total bitrate available at this target size and duration; lower the audio bitrate or raise the target size" };
+    }
+    return {
+      mode,
+      durationSeconds,
+      videoBitrateKbps: round2(videoKbps),
+      audioBitrateKbps: round2(audioBitrateKbps),
+      totalBitrateKbps: round2(totalBitrateKbps),
+      fileSizeBytes: Math.round(fileSizeBytes),
+      fileSizeMB: round2(targetSizeMB),
+      fileSizeMiB: round2(fileSizeBytes / 1048576)
+    };
+  }
+  return { error: 'mode must be "size-from-bitrate" or "bitrate-from-size"' };
+}
+server.tool(
+  "calculate_video_bitrate",
+  "Calculate the video file size from a target bitrate and duration, or the required bitrate to hit a target file size, with an optional separate audio bitrate. Pure arithmetic (file size bytes = total bitrate bits/sec * duration seconds / 8); no container parsing or encoding is performed.",
+  {
+    mode: z.enum(["size-from-bitrate", "bitrate-from-size"]).describe("size-from-bitrate requires videoBitrateKbps; bitrate-from-size requires targetSizeMB"),
+    durationSeconds: z.number().describe("Video duration in seconds (must be positive)"),
+    videoBitrateKbps: z.number().optional().describe('Required for mode "size-from-bitrate"'),
+    audioBitrateKbps: z.number().default(0).describe("Optional for either mode"),
+    targetSizeMB: z.number().optional().describe('Required for mode "bitrate-from-size"; decimal MB (1 MB = 1,000,000 bytes)')
+  },
+  async ({ mode, durationSeconds, videoBitrateKbps, audioBitrateKbps, targetSizeMB }) => {
+    const result = _calculateVideoBitrateMcp(mode, durationSeconds, videoBitrateKbps, audioBitrateKbps, targetSizeMB);
+    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.25.0",
-  "description": "MCP server exposing 125 Utilix developer tools to Claude, Cursor, VS Code Copilot, and any MCP-compatible AI assistant.",
+  "version": "0.27.0",
+  "description": "MCP server exposing 139 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",