@utilix-tech/mcp 0.74.0 → 0.76.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.76.0
+- Add `detect_wordy_phrases` tool: scan text against a curated table of wordy/redundant phrases ("due to the fact that", "in order to") and flag each occurrence with a suggested concise replacement, an occurrence count, and character offsets.
+- Add `check_oxford_comma_consistency` tool: scan a document for comma-before-and/or usage in three-or-more-item lists and flag documents that mix Oxford comma styles.
+
+## 0.75.0
+- Add `verify_webhook_signature` tool: recompute an HMAC over a raw webhook payload and compare it to a provided signature, supporting the `sha256=` prefix style (Stripe/GitHub-style webhooks) plus raw hex or base64 encoding.
+- Add `estimate_data_transfer_time` tool: estimate the theoretical time to transfer a file over a connection of a given speed, or the reverse: the bandwidth required to hit a target time.
+
 ## 0.74.0
 - Add `calculate_loan_prepayment_penalty` tool: compute the dollar penalty cost of paying a loan off early, given its payoff balance and a prepayment penalty structure (a flat percent of balance, or a fixed number of months of interest).
 - Add `validate_aria` tool: check every role and aria-* attribute in an HTML snippet against a curated WAI-ARIA 1.2 role table, flagging unknown roles, disallowed attributes, and missing required states.

package/README.md

@@ -1,6 +1,6 @@
 # @utilix-tech/mcp
 
-MCP server exposing 243 developer utility tools to Claude, Cursor, VS Code Copilot, and any [Model Context Protocol](https://modelcontextprotocol.io) compatible AI assistant.
+MCP server exposing 247 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.
 
@@ -147,6 +147,8 @@ 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 |
+| `detect_wordy_phrases` | Scan text against a curated table of wordy/redundant phrases and suggest a concise replacement for each occurrence |
+| `check_oxford_comma_consistency` | Scan a document for comma-before-and/or usage in three-or-more-item lists and flag documents that mix Oxford comma styles |
 | `calculate_string_distance` | Compute the Levenshtein (or Damerau) edit distance and normalized similarity between two strings |
 | `analyze_sentence_lengths` | Split text into sentences and report a histogram of sentence lengths, plus mean, median, standard deviation, and a consistency label |
 | `lookup_emoji` | Search a curated table of ~280 common emoji by name, keyword, or GitHub-style shortcode, or look one up exactly by shortcode, character, or category |
@@ -162,7 +164,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 (44 tools)
+### Units (45 tools)
 | Tool | Description |
 |------|-------------|
 | `convert_bytes` | Convert between B, KB, MB, GB, TB, KiB, MiB, GiB, TiB |
@@ -209,8 +211,9 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `validate_isin` | Validate a 12-character ISIN via its Luhn-style mod-10 check digit and break it into its country code and security identifier |
 | `calculate_mortgage_points` | Compare a loan with no discount points against the same loan at a reduced rate bought with points, and compute the monthly savings and the break-even month where cumulative savings recoup the points cost |
 | `calculate_loan_prepayment_penalty` | Compute the dollar penalty cost of paying a loan off early, given its remaining payoff balance and a prepayment penalty structure: either a flat percent of the payoff balance, or a fixed number of months of interest at the loan's annual rate |
+| `estimate_data_transfer_time` | Estimate the theoretical time to transfer a file of a given size over a connection of a given speed, or (given a target time instead) the bandwidth required to hit it |
 
-### API / Network (49 tools)
+### API / Network (50 tools)
 | Tool | Description |
 |------|-------------|
 | `decode_jwt` | Decode a JWT: header, payload, and expiry |
@@ -264,6 +267,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `build_robots_meta_tag` | Build a `<meta name="robots" content="...">` tag from directives (noindex, nofollow, max-snippet, etc.), the same vocabulary as X-Robots-Tag, optionally scoped to a crawler via the name attribute |
 | `parse_robots_meta_tag` | Parse an existing robots meta tag (or bare content value) into the same shape |
 | `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 |
 
 ### Color (4 tools)
 | Tool | Description |

package/dist/index.js

@@ -4781,6 +4781,114 @@ server.tool(
     return text(JSON.stringify(_detectFillerWordsMcp(input), null, 2));
   }
 );
+var _WORDY_PHRASES_MCP = [
+  ["due to the fact that", "because"],
+  ["in spite of the fact that", "although"],
+  ["despite the fact that", "although"],
+  ["in order to", "to"],
+  ["for the purpose of", "for"],
+  ["in the event that", "if"],
+  ["in the near future", "soon"],
+  ["at this point in time", "now"],
+  ["at the present time", "now"],
+  ["on a daily basis", "daily"],
+  ["on a regular basis", "regularly"],
+  ["in a timely manner", "promptly"],
+  ["with regard to", "regarding"],
+  ["with respect to", "regarding"],
+  ["in regards to", "regarding"],
+  ["with the exception of", "except"],
+  ["in close proximity to", "near"],
+  ["take into consideration", "consider"],
+  ["give consideration to", "consider"],
+  ["make a decision", "decide"],
+  ["is able to", "can"],
+  ["are able to", "can"],
+  ["a large number of", "many"],
+  ["a majority of", "most"],
+  ["each and every", "each"],
+  ["first and foremost", "first"],
+  ["last but not least", "finally"],
+  ["null and void", "void"],
+  ["whether or not", "whether"],
+  ["the reason why", "the reason"],
+  ["end result", "result"],
+  ["future plans", "plans"],
+  ["past history", "history"],
+  ["basic fundamentals", "fundamentals"],
+  ["absolutely essential", "essential"],
+  ["it is important to note that", "(often removable)"],
+  ["as a matter of fact", "in fact"],
+  ["in the process of", "(often removable)"]
+];
+function _wordyRegexMcp(phrase) {
+  const tokens = phrase.split(/\s+/).map((t) => t.replace(/[.*+?^${}()|[\]\\]/g, "\\$&"));
+  return new RegExp("\\b" + tokens.join("\\s+") + "\\b", "gi");
+}
+function _detectWordyPhrasesMcp(input) {
+  const totalWords = (input.match(/[A-Za-z0-9']+/g) ?? []).length;
+  const matches = [];
+  for (const [phrase, suggestion] of _WORDY_PHRASES_MCP) {
+    const re = _wordyRegexMcp(phrase);
+    const indices = [];
+    let m;
+    while ((m = re.exec(input)) !== null) {
+      indices.push(m.index);
+      if (m.index === re.lastIndex) re.lastIndex++;
+    }
+    if (indices.length > 0) matches.push({ phrase, suggestion, count: indices.length, indices });
+  }
+  matches.sort((a, b) => b.count - a.count || a.phrase.localeCompare(b.phrase));
+  const totalMatches = matches.reduce((s, m) => s + m.count, 0);
+  const density = totalWords > 0 ? Math.round(totalMatches / totalWords * 1e3) / 10 : 0;
+  return { totalWords, totalMatches, density, matches };
+}
+server.tool(
+  "detect_wordy_phrases",
+  'Scan text against a curated table of wordy/redundant phrases ("due to the fact that", "in order to", "at this point in time") and flag each occurrence with a suggested concise replacement, an occurrence count, and character offsets. Dictionary-based heuristic: a flagged phrase is a candidate to tighten, not always wrong in context.',
+  { text: z.string().describe("The text to scan for wordy/redundant phrases") },
+  async ({ text: input }) => {
+    return text(JSON.stringify(_detectWordyPhrasesMcp(input), null, 2));
+  }
+);
+var _OXFORD_CONJ_RE_MCP = /(,)?\s+\b(?:and|or)\b\s+/gi;
+function _checkOxfordCommaConsistencyMcp(input) {
+  const instances = [];
+  _OXFORD_CONJ_RE_MCP.lastIndex = 0;
+  let m;
+  while ((m = _OXFORD_CONJ_RE_MCP.exec(input)) !== null) {
+    const matchStart = m.index;
+    const hasCommaBefore = !!m[1];
+    let clauseStart = -1;
+    for (const ch of [".", "!", "?", "\n"]) {
+      const idx = input.lastIndexOf(ch, matchStart - 1);
+      if (idx > clauseStart) clauseStart = idx;
+    }
+    clauseStart += 1;
+    const clause = input.slice(clauseStart, matchStart);
+    const commaCount = (clause.match(/,/g) ?? []).length;
+    if (commaCount < 1) continue;
+    const snippetStart = Math.max(clauseStart, matchStart - 60);
+    const afterConjEnd = _OXFORD_CONJ_RE_MCP.lastIndex;
+    const tail = input.slice(afterConjEnd);
+    const boundaryOffset = tail.search(/[.!?\n,]/);
+    const snippetEnd = boundaryOffset === -1 ? Math.min(input.length, afterConjEnd + 40) : afterConjEnd + boundaryOffset;
+    const snippet = input.slice(snippetStart, snippetEnd).trim();
+    instances.push({ snippet, hasOxfordComma: hasCommaBefore, index: matchStart });
+  }
+  const withOxfordComma = instances.filter((i) => i.hasOxfordComma).length;
+  const withoutOxfordComma = instances.length - withOxfordComma;
+  const consistent = withOxfordComma === 0 || withoutOxfordComma === 0;
+  return { totalLists: instances.length, withOxfordComma, withoutOxfordComma, consistent, instances };
+}
+server.tool(
+  "check_oxford_comma_consistency",
+  "Scan a document for comma-before-and/or usage in three-or-more-item lists and flag inconsistency: some lists using the Oxford (serial) comma while others in the same document don't. A heuristic over punctuation and sentence boundaries, not a full grammar parser.",
+  { text: z.string().describe("The document to scan for Oxford comma consistency") },
+  async ({ text: input }) => {
+    return text(JSON.stringify(_checkOxfordCommaConsistencyMcp(input), null, 2));
+  }
+);
 function _calculatePercentageChangeMcp(oldValue, newValue) {
   if (!Number.isFinite(oldValue)) return { error: "Original value must be a finite number" };
   if (!Number.isFinite(newValue)) return { error: "New value must be a finite number" };
@@ -11845,5 +11953,120 @@ server.tool(
     return text(JSON.stringify(result, null, 2));
   }
 );
+var _WEBHOOK_HASH_ALGORITHMS_MCP = ["sha1", "sha256", "sha512"];
+function _webhookConstantTimeEqualMcp(a, b) {
+  if (a.length !== b.length) return false;
+  let diff = 0;
+  for (let i = 0; i < a.length; i++) diff |= a.charCodeAt(i) ^ b.charCodeAt(i);
+  return diff === 0;
+}
+function _verifyWebhookSignatureMcp(payload, secret, signature, algorithm) {
+  if (!payload) return { error: "Payload is required" };
+  if (!secret) return { error: "Secret is required" };
+  if (!signature || !signature.trim()) return { error: "Signature is required" };
+  if (!_WEBHOOK_HASH_ALGORITHMS_MCP.includes(algorithm)) {
+    return { error: "Algorithm must be one of sha1, sha256, sha512" };
+  }
+  const trimmedSignature = signature.trim();
+  const prefixMatch = trimmedSignature.match(/^(sha1|sha256|sha512)=(.+)$/i);
+  const providedSignature = prefixMatch ? prefixMatch[2].trim() : trimmedSignature;
+  const expectedHex = createHmac(algorithm, secret).update(payload, "utf8").digest("hex");
+  const expectedBase64 = createHmac(algorithm, secret).update(payload, "utf8").digest("base64");
+  let matchedEncoding = null;
+  if (_webhookConstantTimeEqualMcp(providedSignature.toLowerCase(), expectedHex.toLowerCase())) {
+    matchedEncoding = "hex";
+  } else if (_webhookConstantTimeEqualMcp(providedSignature, expectedBase64)) {
+    matchedEncoding = "base64";
+  }
+  return {
+    valid: matchedEncoding !== null,
+    algorithm,
+    expectedHex,
+    expectedBase64,
+    providedSignature: trimmedSignature,
+    matchedEncoding
+  };
+}
+server.tool(
+  "verify_webhook_signature",
+  'Recompute an HMAC over a raw webhook payload and compare it to a provided signature, the check every webhook receiver (Stripe, GitHub, Shopify, etc.) has to do before trusting a request. Accepts a signature with or without the common "sha256=" prefix style, and matches against either hex or base64 encoding since providers differ on which they send.',
+  {
+    payload: z.string().describe("The raw webhook request body, exactly as received (do not re-serialize JSON)"),
+    secret: z.string().describe("The shared webhook signing secret"),
+    signature: z.string().describe('The signature to verify, with or without a "sha256=" style prefix, hex or base64 encoded'),
+    algorithm: z.enum(["sha1", "sha256", "sha512"]).optional().describe("The HMAC hash algorithm the signature was computed with (default sha256)")
+  },
+  async ({ payload, secret, signature, algorithm }) => {
+    const result = _verifyWebhookSignatureMcp(payload, secret, signature, algorithm ?? "sha256");
+    if ("error" in result) return errText(result);
+    return text(JSON.stringify(result, null, 2));
+  }
+);
+var _FILE_SIZE_UNIT_BYTES_MCP = { B: 1, KB: 1e3, MB: 1e6, GB: 1e9, TB: 1e12 };
+var _SPEED_UNIT_BITS_PER_SECOND_MCP = {
+  Kbps: 1e3,
+  Mbps: 1e6,
+  Gbps: 1e9,
+  KBps: 1e3 * 8,
+  MBps: 1e6 * 8,
+  GBps: 1e9 * 8
+};
+function _formatDurationSecondsMcp(totalSeconds) {
+  if (totalSeconds < 1) return `${(totalSeconds * 1e3).toFixed(0)}ms`;
+  if (totalSeconds < 60) {
+    const decimals = totalSeconds < 10 && totalSeconds % 1 !== 0 ? 1 : 0;
+    return `${totalSeconds.toFixed(decimals)}s`;
+  }
+  const days = Math.floor(totalSeconds / 86400);
+  const hours = Math.floor(totalSeconds % 86400 / 3600);
+  const minutes = Math.floor(totalSeconds % 3600 / 60);
+  const seconds = Math.round(totalSeconds % 60);
+  const parts = [];
+  if (days > 0) parts.push(`${days}d`);
+  if (hours > 0) parts.push(`${hours}h`);
+  if (minutes > 0) parts.push(`${minutes}m`);
+  if (seconds > 0 || parts.length === 0) parts.push(`${seconds}s`);
+  return parts.join(" ");
+}
+function _calculateTransferTimeMcp(fileSize, fileSizeUnit, speed, speedUnit) {
+  if (!Number.isFinite(fileSize) || fileSize <= 0) return { error: "File size must be a positive number" };
+  if (!Number.isFinite(speed) || speed <= 0) return { error: "Connection speed must be a positive number" };
+  if (!(fileSizeUnit in _FILE_SIZE_UNIT_BYTES_MCP)) return { error: `Unsupported file size unit: ${fileSizeUnit}` };
+  if (!(speedUnit in _SPEED_UNIT_BITS_PER_SECOND_MCP)) return { error: `Unsupported speed unit: ${speedUnit}` };
+  const fileSizeBytes = fileSize * _FILE_SIZE_UNIT_BYTES_MCP[fileSizeUnit];
+  const speedBitsPerSecond = speed * _SPEED_UNIT_BITS_PER_SECOND_MCP[speedUnit];
+  const transferTimeSeconds = fileSizeBytes * 8 / speedBitsPerSecond;
+  return { fileSizeBytes, speedBitsPerSecond, transferTimeSeconds, formattedTime: _formatDurationSecondsMcp(transferTimeSeconds) };
+}
+function _calculateRequiredBandwidthMcp(fileSize, fileSizeUnit, targetSeconds) {
+  if (!Number.isFinite(fileSize) || fileSize <= 0) return { error: "File size must be a positive number" };
+  if (!Number.isFinite(targetSeconds) || targetSeconds <= 0) return { error: "Target time must be a positive number of seconds" };
+  if (!(fileSizeUnit in _FILE_SIZE_UNIT_BYTES_MCP)) return { error: `Unsupported file size unit: ${fileSizeUnit}` };
+  const fileSizeBytes = fileSize * _FILE_SIZE_UNIT_BYTES_MCP[fileSizeUnit];
+  const requiredBitsPerSecond = fileSizeBytes * 8 / targetSeconds;
+  return {
+    fileSizeBytes,
+    targetSeconds,
+    requiredBitsPerSecond,
+    requiredMbps: requiredBitsPerSecond / 1e6,
+    requiredMBps: requiredBitsPerSecond / 8 / 1e6
+  };
+}
+server.tool(
+  "estimate_data_transfer_time",
+  "Estimate the theoretical time to transfer a file of a given size over a connection of a given speed (decimal/SI file size units, standard networking speed units where Mbps is megabits/second and MBps is megabytes/second). Pass targetSeconds instead of speed/speedUnit to run the reverse calculation: the bandwidth required to hit that target time.",
+  {
+    fileSize: z.number().positive().describe("The file size, in fileSizeUnit"),
+    fileSizeUnit: z.enum(["B", "KB", "MB", "GB", "TB"]).describe("The unit fileSize is expressed in"),
+    speed: z.number().positive().optional().describe("The connection speed, in speedUnit (omit and pass targetSeconds for the reverse calculation)"),
+    speedUnit: z.enum(["Kbps", "Mbps", "Gbps", "KBps", "MBps", "GBps"]).optional().describe("The unit speed is expressed in"),
+    targetSeconds: z.number().positive().optional().describe("Target transfer time in seconds; when set, computes the required bandwidth instead of the transfer time")
+  },
+  async ({ fileSize, fileSizeUnit, speed, speedUnit, targetSeconds }) => {
+    const result = targetSeconds !== void 0 ? _calculateRequiredBandwidthMcp(fileSize, fileSizeUnit, targetSeconds) : speed !== void 0 && speedUnit !== void 0 ? _calculateTransferTimeMcp(fileSize, fileSizeUnit, speed, speedUnit) : { error: "Provide either (speed and speedUnit) or targetSeconds" };
+    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,6 +1,6 @@
 {
   "name": "@utilix-tech/mcp",
-  "version": "0.74.0",
+  "version": "0.76.0",
   "description": "MCP server exposing 198 Utilix developer tools to Claude, Cursor, VS Code Copilot, and any MCP-compatible AI assistant.",
   "author": "Utilix <hello@utilix.tech>",
   "license": "MIT",