@utilix-tech/mcp 0.78.0 → 0.79.0

package/CHANGELOG.md

@@ -2,6 +2,10 @@
 
 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.79.0
+- Add `calculate_real_rate_of_return` tool: apply the Fisher equation to solve for whichever of the nominal rate, inflation rate, or inflation-adjusted real rate is missing, given exactly two of the three.
+- Add `calculate_retry_backoff_schedule` tool: compute the full sequence of delays an exponential-backoff retry policy would actually produce, optionally capped and with full/equal jitter ranges, plus the total best-case and worst-case wait across all retries.
+
 ## 0.78.0
 - Add `ndjson_to_csv` tool: convert newline-delimited JSON (one flat object per line) into CSV, inferring the header row from the union of keys across all lines.
 

package/README.md

@@ -164,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 (45 tools)
+### Units (46 tools)
 | Tool | Description |
 |------|-------------|
 | `convert_bytes` | Convert between B, KB, MB, GB, TB, KiB, MiB, GiB, TiB |
@@ -212,6 +212,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `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 |
+| `calculate_real_rate_of_return` | Apply the Fisher equation to solve for whichever of the nominal rate, inflation rate, or inflation-adjusted real rate is missing, given exactly two of the three |
 
 ### API / Network (51 tools)
 | Tool | Description |
@@ -337,7 +338,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `unicode_inspect` | Inspect Unicode code points of a string |
 | `optimize_svg` | Optimize and minify an SVG string |
 
-### AI / Agent (28 tools)
+### AI / Agent (29 tools)
 | Tool | Description |
 |------|-------------|
 | `estimate_tokens` | Estimate token count and cost for an LLM prompt |
@@ -368,6 +369,7 @@ claude mcp add utilix -- npx -y @utilix-tech/mcp
 | `vector_similarity` | Cosine similarity, dot product, and Euclidean / Manhattan distance between two numeric vectors |
 | `format_few_shot_examples` | Format input/output example pairs into a numbered, XML-tagged, or delimiter-separated few-shot prompt template |
 | `lint_tool_schema` | Lint an OpenAI, Anthropic, or MCP tool/function-calling definition for missing descriptions, invalid names, empty enums, and required/properties mismatches |
+| `calculate_retry_backoff_schedule` | Compute the full sequence of delays an exponential-backoff retry policy would actually produce, given a base delay, multiplier, and max retry count, optionally capped at a max delay and with full/equal jitter ranges |
 
 ### Image (4 tools)
 | Tool | Description |

package/dist/index.js

@@ -1243,6 +1243,64 @@ server.tool("vector_similarity", "Compute cosine similarity, dot product, Euclid
   if ("error" in result) return errText(result);
   return { content: [{ type: "text", text: JSON.stringify(result, null, 2) }] };
 });
+function _calculateRetryBackoffSchedule(input) {
+  const { baseDelayMs, multiplier, maxRetries, maxDelayMs, jitter = "none" } = input;
+  if (!Number.isFinite(baseDelayMs) || baseDelayMs <= 0) {
+    return { error: "baseDelayMs must be a finite number greater than zero" };
+  }
+  if (!Number.isFinite(multiplier) || multiplier < 1) {
+    return { error: "multiplier must be a finite number of at least 1" };
+  }
+  if (!Number.isInteger(maxRetries) || maxRetries < 1 || maxRetries > 50) {
+    return { error: "maxRetries must be a whole number between 1 and 50" };
+  }
+  if (maxDelayMs !== void 0 && (!Number.isFinite(maxDelayMs) || maxDelayMs <= 0)) {
+    return { error: "maxDelayMs must be a finite number greater than zero when provided" };
+  }
+  if (jitter !== "none" && jitter !== "full" && jitter !== "equal") {
+    return { error: "jitter must be one of 'none', 'full', or 'equal'" };
+  }
+  const round0 = (n) => Math.round(n);
+  const attempts = [];
+  let totalBestCaseMs = 0;
+  let totalWorstCaseMs = 0;
+  for (let i = 1; i <= maxRetries; i++) {
+    let nominal = baseDelayMs * Math.pow(multiplier, i - 1);
+    if (maxDelayMs !== void 0) nominal = Math.min(nominal, maxDelayMs);
+    let minDelay;
+    let maxDelay;
+    if (jitter === "full") {
+      minDelay = 0;
+      maxDelay = nominal;
+    } else if (jitter === "equal") {
+      minDelay = nominal / 2;
+      maxDelay = nominal;
+    } else {
+      minDelay = nominal;
+      maxDelay = nominal;
+    }
+    attempts.push({ attempt: i, nominalDelayMs: round0(nominal), minDelayMs: round0(minDelay), maxDelayMs: round0(maxDelay) });
+    totalBestCaseMs += minDelay;
+    totalWorstCaseMs += maxDelay;
+  }
+  return { attempts, jitter, totalBestCaseMs: round0(totalBestCaseMs), totalWorstCaseMs: round0(totalWorstCaseMs) };
+}
+server.tool(
+  "calculate_retry_backoff_schedule",
+  "Compute the full sequence of delays an exponential-backoff retry policy would actually produce, given a base delay, multiplier, and max retry count, optionally capped at a max delay and with full/equal jitter ranges, plus the total best-case and worst-case wait across all retries. Distinct from build_retry_after_header, which builds a single HTTP Retry-After response header.",
+  {
+    baseDelayMs: z.number().describe("Delay before the first retry, in milliseconds"),
+    multiplier: z.number().describe("Factor the delay is multiplied by after each attempt"),
+    maxRetries: z.number().int().describe("Number of retry attempts to compute (1-50)"),
+    maxDelayMs: z.number().optional().describe("Optional cap applied to every computed delay"),
+    jitter: z.enum(["none", "full", "equal"]).default("none").describe('"full" randomizes uniformly between 0 and the nominal delay; "equal" randomizes between half the nominal delay and the full value')
+  },
+  async ({ baseDelayMs, multiplier, maxRetries, maxDelayMs, jitter }) => {
+    const result = _calculateRetryBackoffSchedule({ baseDelayMs, multiplier, maxRetries, maxDelayMs, jitter });
+    if ("error" in result) return errText(result);
+    return text(JSON.stringify(result, null, 2));
+  }
+);
 server.tool("summarize_for_llm", "Extractive summarization: pick key sentences to fit a token budget.", { text: z.string(), max_tokens: z.number().int().min(10).default(200), strategy: z.enum(["extractive", "first", "last"]).default("extractive") }, async ({ text: text2, max_tokens, strategy }) => {
   return { content: [{ type: "text", text: JSON.stringify(summarizeForLlm(text2, max_tokens, strategy), null, 2) }] };
 });
@@ -2259,6 +2317,64 @@ server.tool(
     return text(JSON.stringify(result, null, 2));
   }
 );
+var _REAL_RATE_FIELDS_MCP = ["nominalRatePercent", "inflationRatePercent", "realRatePercent"];
+function _calculateRealRateOfReturn(input) {
+  const provided = (v) => typeof v === "number" && Number.isFinite(v);
+  const given = _REAL_RATE_FIELDS_MCP.filter((f) => provided(input[f]));
+  if (given.length !== 2) {
+    return { error: `Provide exactly two of nominalRatePercent, inflationRatePercent, realRatePercent (got ${given.length})` };
+  }
+  for (const f of given) {
+    const v = input[f];
+    if (v <= -100) return { error: `${f} must be greater than -100` };
+  }
+  const has = (f) => given.includes(f);
+  const nominal0 = input.nominalRatePercent;
+  const inflation0 = input.inflationRatePercent;
+  const real0 = input.realRatePercent;
+  let nominalRatePercent;
+  let inflationRatePercent;
+  let realRatePercent;
+  let solvedFor;
+  if (has("nominalRatePercent") && has("inflationRatePercent")) {
+    nominalRatePercent = nominal0;
+    inflationRatePercent = inflation0;
+    realRatePercent = ((1 + nominal0 / 100) / (1 + inflation0 / 100) - 1) * 100;
+    solvedFor = "realRatePercent";
+  } else if (has("realRatePercent") && has("inflationRatePercent")) {
+    realRatePercent = real0;
+    inflationRatePercent = inflation0;
+    nominalRatePercent = ((1 + real0 / 100) * (1 + inflation0 / 100) - 1) * 100;
+    solvedFor = "nominalRatePercent";
+  } else {
+    nominalRatePercent = nominal0;
+    realRatePercent = real0;
+    inflationRatePercent = ((1 + nominal0 / 100) / (1 + real0 / 100) - 1) * 100;
+    solvedFor = "inflationRatePercent";
+  }
+  const round4 = (n) => Math.round(n * 1e4) / 1e4;
+  return {
+    nominalRatePercent: round4(nominalRatePercent),
+    inflationRatePercent: round4(inflationRatePercent),
+    realRatePercent: round4(realRatePercent),
+    given,
+    solvedFor
+  };
+}
+server.tool(
+  "calculate_real_rate_of_return",
+  "Apply the Fisher equation, (1 + nominal) = (1 + real) * (1 + inflation), to solve for whichever of the nominal rate, inflation rate, or inflation-adjusted real rate is missing, given exactly two of the three (all as percents).",
+  {
+    nominalRatePercent: z.number().optional().describe("Nominal (stated) annual rate as a percent"),
+    inflationRatePercent: z.number().optional().describe("Annual inflation rate as a percent"),
+    realRatePercent: z.number().optional().describe("Inflation-adjusted real rate as a percent")
+  },
+  async ({ nominalRatePercent, inflationRatePercent, realRatePercent }) => {
+    const result = _calculateRealRateOfReturn({ nominalRatePercent, inflationRatePercent, realRatePercent });
+    if ("error" in result) return errText(result);
+    return text(JSON.stringify(result, null, 2));
+  }
+);
 function _computeIsbn10CheckDigitMcp(dataDigits) {
   let sum = 0;
   for (let i = 0; i < 9; i++) sum += dataDigits[i] * (10 - i);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@utilix-tech/mcp",
-  "version": "0.78.0",
+  "version": "0.79.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",