Skip to main content
Glama
genesis-plan

lingshu-solver

by genesis-plan

灵数求解器 · Lingshu Solver

≤6 维确定性实数方程组求解引擎 · 面向 AI 智能体与普通用户的 MCP 工具

灵数求解器(代号 Epsilon,V4.1)是一个离线、确定性、零数据的实数方程组求解器, 覆盖 ≤6 个变量、实数解、轻量数值定位。它不要求用户提供初值,采用区间算术做保守收缩 + Krawczyk 算子做解认证,并尽力穷尽多解。


🚀 快速上手(30 秒)

如果你完全不懂技术 —— 直接用网页版

打开这个链接就能用,不用安装任何东西: 👉 https://genesis-plan.github.io/lingshu-solver/ (GitHub Pages,海外/通用)

国内用户(更快,腾讯云 COS 托管): 👉 https://hclj-1409755229.cos.ap-guangzhou.myqcloud.com/lingshu-solver/index.html

在输入框写方程(例如 x^2 + y^2 = 25 和 x + y = 7),点求解即可。 页面里有 6 个示例按钮,点一下就知道它能解什么。

如果你是 AI 用户(Claude / Cursor / Cline 等)

方式 A · 远程托管(零安装,免密即用) 我们已部署常驻公网服务,直接填 URL 即可,无需本机装 Node:

{
  "mcpServers": {
    "lingshu-solver": {
      "url": "http://159.75.154.206:3000/mcp"
    }
  }
}

端点:http://159.75.154.206:3000/mcp(Streamable HTTP)。服务运行于腾讯云轻量服务器,开机自启、崩溃自动拉起。 ⚠️ 当前为裸 IP + HTTP 临时端点,hongchenlingjing.com 备案通过后我们将切换为 https://hongchenlingjing.com/mcp 固定 HTTPS 域名(届时更新此处)。此临时端点可用于对接测试,Smithery 等需 HTTPS 的平台待备案后正式接入。

方式 B · 本地 stdio(需本机 Node)

{
  "mcpServers": {
    "lingshu-solver": {
      "command": "npx",
      "args": ["-y", "lingshu-solver"]
    }
  }
}

npx 版需本包发布到 npm 后才可用(正在处理);在此之前可先 git clone 后用方式 C。

方式 C · 本地 clone + 指定路径

git clone https://github.com/genesis-plan/lingshu-solver.git
cd lingshu-solver
node mcp-server.js

MCP 配置:

{ "mcpServers": { "lingshu-solver": { "command": "node", "args": ["本地绝对路径/灵数求解器/mcp-server.js"] } } }

如果你是开发者

git clone https://github.com/genesis-plan/lingshu-solver.git
cd lingshu-solver
node mcp-server.js        # 启动 MCP 服务端
node test/regression.js   # 跑回归测试(28 用例)

本仓库包含:

  • index.html —— 单文件产品(浏览器内 UI + 已验证核心脚本 <script id="solver-core">)

  • solver-core.js —— Node 引擎加载器(读取 index.html 核心脚本,零依赖,供 MCP/测试复用)

  • mcp-server.js —— 零依赖 MCP stdio 服务端(手工 JSON-RPC 2.0 + Content-Length 分帧)

  • package.json —— 标准元数据,npx lingshu-solver 一行接入

  • test/ —— 回归套件 + 冒烟测试 + 三套常驻考卷


Related MCP server: Math MCP Server

能力边界(诚实声明)

维度

说明

已验证解

每个找到的解都经 Krawczyk 认证(tier=proven),误差 ≤ 认证半径,数学保真

穷尽性

尽力穷尽多解;极端病态(雅可比高度奇异、解簇极近)在预算内可能遗漏个别解,此时显式标记 truncated=true,绝不谎称已穷尽

truncated 语义

仅表示「全局分支未在预算内完全判定所有盒子(无法证明已穷尽)」,不等于一定遗漏;绝大多数情况全部真解已找到

变量数

≤6

数值范围

默认搜索域 ±1e6;对快增长函数(exp/sinh)或大域,建议显式给定 domain 以避免剪枝失效

确定性

无随机分支,同输入永远同输出

部署

纯本地、离线、零数据(无网络、无存储、无第三方依赖)

不保证:对一切输入 100% 穷尽;对高度病态系统在预算内必收敛。这些是诚实边界,不是缺陷。


作为 MCP 工具使用

1. 三种接入形态

形态

端点 / 命令

适用

远程 HTTP(已上线)

http://159.75.154.206:3000/mcp

任何支持 Streamable HTTP 的 MCP 客户端,零安装

本地 stdio(npx)

npx -y lingshu-solver

本机已装 Node,待 npm 发布后可用

本地 stdio(clone)

node mcp-server.js

开发者 / 离线自托管

远程 HTTP 服务端代码:http-mcp-server.js(零依赖,仅用 Node 内置模块;与 mcp-server.js 共享 solver-core.js 求解核心,结果同源一致)。如需自托管远程服务:

PORT=3000 node http-mcp-server.js

2. 在 MCP 客户端(Claude Desktop / Cursor / Cline / VS Code 等)配置

推荐 · 远程托管(零安装,已上线):

{
  "mcpServers": {
    "lingshu-solver": {
      "url": "http://159.75.154.206:3000/mcp"
    }
  }
}

本地 stdio · 一行命令(需先发 npm,暂未发布;当前请用 clone 版):

{
  "mcpServers": {
    "lingshu-solver": {
      "command": "npx",
      "args": ["-y", "lingshu-solver"]
    }
  }
}

注:npx lingshu-solver 需本包发布到 npm 后才可用,我们正在处理。在此之前请用下方「手动指定本地路径」版(先 clone 仓库)。

备选 · 手动指定本地路径(已 clone 仓库时):

{
  "mcpServers": {
    "lingshu-solver": {
      "command": "node",
      "args": ["把这里替换成你本地的绝对路径/灵数求解器/mcp-server.js"]
    }
  }
}

手动版需将 args 中的路径替换为你本机的 mcp-server.js 绝对路径(例如 C:/Users/你的用户名/Desktop/灵数求解器/mcp-server.js)。npx 版无需此步。

工具一:solve

输入:

{
  "equations": ["x^2 + y^2 = 25", "x + y = 7"],
  "variables": ["x", "y"],
  "domain": { "x": [-30, 30], "y": [-30, 30] }
}
  • equations:方程字符串数组(必填),支持 + - * / ^ sqrt log sin cos tan exp abs,以及 in-text 域约束 "x ∈ [-30,30]"。

  • variables:变量名数组(可选,不填则按出现顺序自动识别,最多 6 个)。

  • domain:显式搜索域(可选)。对"有限解·部分"演示或快增长函数建议给定,否则默认 ±1e6 可能剪枝失效并触发 truncated。

输出精度固定 6 位小数(产品规格「6位小数有限网格」),不提供位数切换;解点 values 经网格吸附,实际残差通常 ≤ 1e-9。

输出(节选):

{
  "resultType": 2,
  "resultTypeName": "finite",
  "certified": true,
  "truncated": false,
  "precisionDecimals": 6,
  "solutionCount": 2,
  "recommended": { "values": [3, 4], "tier": "proven", "residual": 0 },
  "solutions": [ { "values": [3, 4], "tier": "proven", "residual": 0 }, ... ],
  "warnings": []
}
  • resultType:1=empty(无解) / 2=finite(有限解) / 3=infinite(无限解集,仅给距原点最近的推荐解)。

  • tier:proven(Krawczyk 认证)/ candidate(未证但可能为解)/ structural(结构推导)。

工具二:give_feedback

AI 智能体遇到卡点/错误/疑似问题时主动回报,仅落本地 feedback.log,不外传:

{ "name": "give_feedback", "arguments": { "message": "x^2=4 期望2解", "context": "批量求解场景" } }

本地验证

node verify_core.js        # 引擎加载 + 6 个代表性用例
node mcp_smoke.js          # MCP 字节级冒烟(initialize/tools/list/tools/call)
node mcp_smoke2.js         # give_feedback + 错误结构化(不泄露堆栈)
node test/regression.js    # 三套常驻考卷回归(28 用例,known 命中率统计)

示例(6 类结果覆盖)

标题

方程

预期

最少 1 变量

x^2 = 4

2 解

最多 6 变量

6 元三对角线性

唯一解

空集无解

x+y=3 与 x+y=5

空集(sound 证无解)

有限解·全部

圆 × 双曲线 x²+y²=4, xy=1

4 解全认证

有限解·部分

sin(20x)=0.5, sin(20y)=0.5(域 [-30,30])

多解 + truncated 横幅

无限解·推荐

x+y=3

无限集,推荐 (1.5,1.5)


文档

  • 《灵数求解器_代码流程中文说明.md》—— 从解析到输出的完整内部流程(面向数学背景读者)

  • 《灵数求解器商业化战略白皮书.md》—— 定位、能力边界、风险

  • 发明专利申请书系列(已提交)

许可

Apache License 2.0 —— 见 LICENSE。

Available Tools

4 tools
give_feedbackAInspect

Report a problem to the operator when solve hits a dead end, returns an error, or produces something you believe is wrong. The text is written to a local log only and is never transmitted anywhere else.

ParametersJSON Schema
NameRequiredDescriptionDefault
contextNoOptional context: the triggering scenario or input characteristics.
messageYesWhat you hit, what you expected, and what you actually got.

TDQS

A4.2/5.0
Behavior4/5

Does the description disclose side effects, auth requirements, rate limits, or destructive behavior?

With no annotations, the description carries the full behavioral burden and discloses the key side effect: text is written to a local log only and never transmitted elsewhere. It does not cover log location, permissions, or return behavior, but the critical data-handling trait is stated.

Agents need to know what a tool does to the world before calling it. Descriptions should go beyond structured annotations to explain consequences.

Conciseness5/5

Is the description appropriately sized, front-loaded, and free of redundancy?

The description is two efficient sentences. The primary purpose and trigger conditions are front-loaded, and the second sentence adds essential behavioral context without waste.

Shorter descriptions cost fewer tokens and are easier for agents to parse. Every sentence should earn its place.

Completeness4/5

Given the tool's complexity, does the description cover enough for an agent to succeed on first attempt?

For a simple two-parameter feedback tool with no output schema and no annotations, the description covers purpose, usage triggers, and data handling adequately. It could be slightly more complete by clarifying whether feedback should also be given when verify finds issues, but the core context is sufficient.

Complex tools with many parameters or behaviors need more documentation. Simple tools need less. This dimension scales expectations accordingly.

Parameters3/5

Does the description clarify parameter syntax, constraints, interactions, or defaults beyond what the schema provides?

Schema description coverage is 100%, and the schema already documents both context and message thoroughly. The description adds no parameter-specific syntax, format, or constraints beyond what the schema provides, so the baseline of 3 is appropriate.

Input schemas describe structure but not intent. Descriptions should explain non-obvious parameter relationships and valid value ranges.

Purpose5/5

Does the description clearly state what the tool does and how it differs from similar tools?

The description states a specific verb and target: reporting a problem to the operator. It also specifies the exact triggering conditions tied to the sibling tool solve, making it easy to distinguish from computational siblings like solve, verify, and poly_roots.

Agents choose between tools based on descriptions. A clear purpose with a specific verb and resource helps agents select the right tool.

Usage Guidelines4/5

Does the description explain when to use this tool, when not to, or what alternatives exist?

It clearly says when to use the tool: when solve hits a dead end, returns an error, or produces something believed wrong. It does not state when not to use it or name explicit alternatives, but the contextual guidance is strong and actionable.

Agents often have multiple tools that could apply. Explicit usage guidance like "use X instead of Y when Z" prevents misuse.

poly_rootsAInspect

All real roots of a polynomial, each individually certified by Krawczyk with a strict error box. Coefficients are ordered highest degree first, so [1,-2,-5,6] means x^3-2x^2-5x+6. Deterministic and reproducible; complex roots are not returned (real numbers only). Use it as a reliable polynomial root component instead of letting a general language model estimate roots. Free to use: pass honorPaid:true to declare personal or evaluation use.

ParametersJSON Schema
NameRequiredDescriptionDefault
toleranceNoTolerance used to decide a root (optional; internal precision is used by default).
coefficientsYesPolynomial coefficients, highest degree first. [1,-2,-5,6] means x^3-2x^2-5x+6.

TDQS

A3.6/5.0
Behavior4/5

Does the description disclose side effects, auth requirements, rate limits, or destructive behavior?

With no annotations, the description carries the full load and does well: it discloses determinism/reproducibility, the Krawczyk certification with strict error boxes, exclusion of complex roots, and the honorPaid licensing declaration. It omits failure behavior for malformed or non-polynomial input and does not explain that honorPaid is not present in the declared input schema, which is a notable gap.

Agents need to know what a tool does to the world before calling it. Descriptions should go beyond structured annotations to explain consequences.

Conciseness4/5

Is the description appropriately sized, front-loaded, and free of redundancy?

Front-loaded with the core purpose and scope, then the coefficient-ordering convention and the licensing note. Four sentences with little waste, though the honorPaid sentence is longer than the information warrants.

Shorter descriptions cost fewer tokens and are easier for agents to parse. Every sentence should earn its place.

Completeness3/5

Given the tool's complexity, does the description cover enough for an agent to succeed on first attempt?

No output schema exists, so the description must cover returns; it explains the certificate and error box but not the shape of the result (list of roots? objects with bounds?). It also never reconciles the honorPaid parameter with a schema that lacks it, leaving the agent unsure how to satisfy the licensing requirement.

Complex tools with many parameters or behaviors need more documentation. Simple tools need less. This dimension scales expectations accordingly.

Parameters3/5

Does the description clarify parameter syntax, constraints, interactions, or defaults beyond what the schema provides?

Schema coverage is 100% and the schema already documents coefficients ordering and tolerance defaults, so the description's repetition of the [1,-2,-5,6] example adds no new meaning. The only novel parameter information is honorPaid, which is not in the schema at all, creating ambiguity rather than usable semantics.

Input schemas describe structure but not intent. Descriptions should explain non-obvious parameter relationships and valid value ranges.

Purpose4/5

Does the description clearly state what the tool does and how it differs from similar tools?

States a specific verb and resource – returning all real roots of a polynomial – plus the scope qualifier that complex roots are excluded and roots are certified by Krawczyk with a strict error box. It does not explicitly compare itself to siblings like solve or verify, so an agent still has to infer the boundary between this and a general solver.

Agents choose between tools based on descriptions. A clear purpose with a specific verb and resource helps agents select the right tool.

Usage Guidelines3/5

Does the description explain when to use this tool, when not to, or what alternatives exist?

It advises use 'instead of letting a general language model estimate roots', which implies when to reach for it, but gives no when-not guidance and never names the sibling solve/verify tools it should be preferred over or combined with. Requirements and prerequisites for input are not stated.

Agents often have multiple tools that could apply. Explicit usage guidance like "use X instead of Y when Z" prevents misuse.

solveAInspect

Deterministic solver for systems of real equations. This is not a language model: no randomness, and identical input always returns an identical, reproducible result. Use it when you need a verifiable, reproducible numeric answer for algebraic equations or common transcendentals (sin/cos/tan/log/exp/sqrt/abs); it works well as a non-hallucinating math backend for an AI agent. Not suitable for symbolic algebra, closed-form proofs, initial-value ODEs, or mandatory integer equality. INPUT: equations (array of strings containing an equals sign, e.g. ["x^2+y^2=25","x+y=7"]); supported operators + - * / ^ sqrt log sin cos tan exp abs, with in-text domain constraints such as x in [-30,30]; variables (optional, auto-detected, max 6); domain (optional, e.g. {"x":[-30,30]}), defaulting to +/-1e6 per variable. HARD LIMITS: at most 6 variables; 1 to 64 equations and the equation count must be at least the variable count; up to 100KB of equation text per call; output is fixed at 6 decimal places and is not configurable. OUTPUT (JSON): resultType is empty (no real solutions, proven), finite (finite verified solutions) or infinite (infinite solution set, only the recommended nearest-to-origin solution is given); summary; solutions[] with values[] (6-decimal numbers), tier (proven means Krawczyk-certified, otherwise likely or candidate), certified, text; residual and other internals under internals; recommended holds the compact nearest-to-origin structure. truncated=true means the global branch-and-bound did not finish inside the budget; it does not necessarily mean solutions were missed and in most cases every real solution was found; narrow the domain or raise options.budget and retry if you need a completeness guarantee. Errors return error.type (invalid_input or internal_error). If something looks wrong, call give_feedback rather than guessing. The same input always produces the exact same output, so caching and retries are safe. PAYMENT: this endpoint is free to use. Pass honorPaid:true to declare personal or evaluation use and the call is served with no verification and no balance deduction; payment is voluntary and never enforced.

ParametersJSON Schema
NameRequiredDescriptionDefault
domainNoExplicit search domain (optional), e.g. {"x":[-30,30],"y":[-30,30]}. Recommended for near-infinite solution sets or fast-growing functions such as exp or sinh; without it the default +/-1e6 may fail to prune and set truncated.
optionsNoAdvanced options (optional), e.g. {budget:500000, maxDepth:28}
fastModeNoFast mode (default false).
equationsYesArray of equation strings, e.g. ["x^2 + y^2 = 25", "x + y = 7"]. Supports + - * / ^ sqrt log sin cos tan exp abs, plus in-text domain constraints such as x in [-30,30].
variablesNoVariable names (optional). If omitted they are auto-detected from the equation text, in order of appearance. Maximum 6.

TDQS

A4.8/5.0
Behavior5/5

Does the description disclose side effects, auth requirements, rate limits, or destructive behavior?

No annotations are supplied, so the description carries full burden and does so richly: determinism/reproducibility ('identical input always returns an identical output, so caching and retries are safe'), hard limits, error taxonomy (invalid_input/internal_error), truncated semantics, and payment behavior. This is exactly the behavioral disclosure a mutation-free but complex tool needs.

Agents need to know what a tool does to the world before calling it. Descriptions should go beyond structured annotations to explain consequences.

Conciseness4/5

Is the description appropriately sized, front-loaded, and free of redundancy?

Front-loaded with purpose, then INPUT/HARD LIMITS/OUTPUT/PAYMENT headers that make scanning easy; each block is substantive rather than filler. It is long, and the OUTPUT block is verbose because no output schema exists, but the payment paragraph is the only portion that could be trimmed.

Shorter descriptions cost fewer tokens and are easier for agents to parse. Every sentence should earn its place.

Completeness5/5

Given the tool's complexity, does the description cover enough for an agent to succeed on first attempt?

With no output schema and nested options/domain objects, the description supplies the return contract itself (resultType enum, solutions[].tier/certified, truncated, error.type), so an agent knows what it will get back. Nothing material is missing for correct invocation or interpretation.

Complex tools with many parameters or behaviors need more documentation. Simple tools need less. This dimension scales expectations accordingly.

Parameters4/5

Does the description clarify parameter syntax, constraints, interactions, or defaults beyond what the schema provides?

Schema coverage is already 100%, so the schema handles per-parameter meaning; the description still adds constraints the schema does not encode (max 6 variables, 1-64 equations, equation count >= variable count, 100KB cap, 6-decimal fixed output, domain defaulting to +/1e6). It stops short of explaining options.budget/maxDepth or fastMode, which the schema also leaves thin.

Input schemas describe structure but not intent. Descriptions should explain non-obvious parameter relationships and valid value ranges.

Purpose5/5

Does the description clearly state what the tool does and how it differs from similar tools?

States a specific verb+resource ('deterministic solver for systems of real equations') and immediately separates itself from siblings by naming what it is not: not symbolic algebra, not an ODE solver, not a language model. An agent can distinguish it from poly_roots/verify without opening any schema.

Agents choose between tools based on descriptions. A clear purpose with a specific verb and resource helps agents select the right tool.

Usage Guidelines5/5

Does the description explain when to use this tool, when not to, or what alternatives exist?

Explicitly frames when to use it ('verifiable, reproducible numeric answer for algebraic equations or common transcendentals') and when not ('Not suitable for symbolic algebra, closed-form proofs, initial-value ODEs, or mandatory integer equality'), plus it routes failures to give_feedback. This is the full when/when-not/alternative pattern.

Agents often have multiple tools that could apply. Explicit usage guidance like "use X instead of Y when Z" prevents misuse.

verifyAInspect

Check whether a claimed answer is correct. Give the equation plus a candidate value (a number for a single variable, {variable:value} pairs, or an array in variable order); the same certified kernel runs in a neighbourhood around the candidate. If a matching certified root is found the result is verified together with the error box; otherwise it is refuted and the nearest certified root is returned, so the calling agent immediately sees the correct value. Deterministic, not an LLM, reproducible across calls. Free to use: pass honorPaid:true to declare personal or evaluation use.

ParametersJSON Schema
NameRequiredDescriptionDefault
equationYesA single equation containing an equals sign, e.g. "x^2 = 4".
candidateYesThe claimed answer: a number (single variable, default variable x), {variable:value} for multiple variables, or an array in variables order.
toleranceNoNeighbourhood radius (optional, default 1e-3) within which a matching certified root is searched.
variablesNoVariable names (required for multiple variables or array candidates), e.g. ["x","y"].

TDQS

A4.3/5.0
Behavior4/5

Does the description disclose side effects, auth requirements, rate limits, or destructive behavior?

No annotations exist, so the description carries the full burden, and it does well: it discloses the certified-kernel neighbourhood search, determinism and reproducibility, the refutation branch returning the nearest certified root, and a pricing/usage declaration via honorPaid. It omits failure modes such as malformed equation or non-convergence behaviour.

Agents need to know what a tool does to the world before calling it. Descriptions should go beyond structured annotations to explain consequences.

Conciseness4/5

Is the description appropriately sized, front-loaded, and free of redundancy?

The core behaviour and input forms are front-loaded in the first two sentences, and every sentence carries information. It runs slightly long, with the honorPaid pricing clause appended as a trailing sentence that is easy to skim past.

Shorter descriptions cost fewer tokens and are easier for agents to parse. Every sentence should earn its place.

Completeness4/5

Given the tool's complexity, does the description cover enough for an agent to succeed on first attempt?

For a 4-parameter tool with no annotations and no output schema, the description covers both outcomes (verified with error box vs refuted with nearest certified root) so the agent knows what it will receive. It stops short of describing invalid-input or timeout behaviour, which is a minor gap.

Complex tools with many parameters or behaviors need more documentation. Simple tools need less. This dimension scales expectations accordingly.

Parameters4/5

Does the description clarify parameter syntax, constraints, interactions, or defaults beyond what the schema provides?

Schema description coverage is 100%, so baseline is 3, but the description adds meaning beyond the schema by explaining that the candidate is evaluated within a neighbourhood of the supplied value ('the same certified kernel runs in a neighbourhood around the candidate'), which contextualises what tolerance actually does.

Input schemas describe structure but not intent. Descriptions should explain non-obvious parameter relationships and valid value ranges.

Purpose5/5

Does the description clearly state what the tool does and how it differs from similar tools?

States a specific verb and object ('Check whether a claimed answer is correct') and frames the tool as a verifier of a supplied candidate rather than a solver, which cleanly separates it from siblings solve and poly_roots. An agent can select it without opening the schema.

Agents choose between tools based on descriptions. A clear purpose with a specific verb and resource helps agents select the right tool.

Usage Guidelines4/5

Does the description explain when to use this tool, when not to, or what alternatives exist?

Gives clear context for use: supply an equation plus a candidate value, and the tool certifies or refutes it. It does not explicitly say when not to use it (e.g. use solve/poly_roots when no candidate exists), so routing to alternatives is left to inference.

Agents often have multiple tools that could apply. Explicit usage guidance like "use X instead of Y when Z" prevents misuse.

Tool Schema Changelog

Recent tool additions, removals, and schema changes observed during successful MCP inspections.

  1. 4 tool updatesv1.0.22
    • Changedgive_feedback2 fields changed
      • changedInput schema / properties / context / description
        Previous value: -"可选上下文:触发场景、输入特征等。"New value: +"Optional context: the triggering scenario or input characteristics."
      • changedInput schema / properties / message / description
        Previous value: -"反馈内容:遇到了什么、期望什么、实际得到什么。"New value: +"What you hit, what you expected, and what you actually got."
    • Changedpoly_roots2 fields changed
      • changedInput schema / properties / coefficients / description
        Previous value: -"多项式系数,最高次在前。如 [1,-2,-5,6] 对应 x³−2x²−5x+6。"New value: +"Polynomial coefficients, highest degree first. [1,-2,-5,6] means x^3-2x^2-5x+6."
      • changedInput schema / properties / tolerance / description
        Previous value: -"根的判定容差(可选,默认内部精度)"New value: +"Tolerance used to decide a root (optional; internal precision is used by default)."
    • Changedsolve5 fields changed
      • changedInput schema / properties / domain / description
        Previous value: -"显式搜索域(可选)。形如 {\"x\":[-30,30],\"y\":[-30,30]}。对\"有限解·部分\"演示或快增长函数(exp/sinh)建议显式给定,否则默认 ±1e6 可能剪枝失效并触发 truncated。"New value: +"Explicit search domain (optional), e.g. {\"x\":[-30,30],\"y\":[-30,30]}. Recommended for near-infinite solution sets or fast-growing functions such as exp or sinh; without it the default +/-1e6 may fail to prune and set truncated."
      • changedInput schema / properties / equations / description
        Previous value: -"方程字符串数组,如 [\"x^2 + y^2 = 25\", \"x + y = 7\"]。支持 + - * / ^ sqrt log sin cos tan exp abs,以及 in-text 域约束 \"x ∈ [-30,30]\"。"New value: +"Array of equation strings, e.g. [\"x^2 + y^2 = 25\", \"x + y = 7\"]. Supports + - * / ^ sqrt log sin cos tan exp abs, plus in-text domain constraints such as x in [-30,30]."
      • changedInput schema / properties / fastMode / description
        Previous value: -"快速模式(默认 false)"New value: +"Fast mode (default false)."
      • changedInput schema / properties / options / description
        Previous value: -"高级选项(可选),如 {budget:500000, maxDepth:28}"New value: +"Advanced options (optional), e.g. {budget:500000, maxDepth:28}"
      • changedInput schema / properties / variables / description
        Previous value: -"变量名数组(可选)。不填则由方程文本自动识别,顺序按出现。最多 6 个。"New value: +"Variable names (optional). If omitted they are auto-detected from the equation text, in order of appearance. Maximum 6."
    • Changedverify4 fields changed
      • changedInput schema / properties / candidate / description
        Previous value: -"声称的答案:数字(单变量,默认变量 x)、{变量:值}(多变量)、或按 variables 顺序的数组。"New value: +"The claimed answer: a number (single variable, default variable x), {variable:value} for multiple variables, or an array in variables order."
      • changedInput schema / properties / equation / description
        Previous value: -"含 \"=\" 的方程,如 \"x^2 = 4\"。"New value: +"A single equation containing an equals sign, e.g. \"x^2 = 4\"."
      • changedInput schema / properties / tolerance / description
        Previous value: -"邻域半径(可选,默认 1e-3),在该邻域内寻找匹配的认证根。"New value: +"Neighbourhood radius (optional, default 1e-3) within which a matching certified root is searched."
      • changedInput schema / properties / variables / description
        Previous value: -"变量名(多变量或数组候选时必填),如 [\"x\",\"y\"]。"New value: +"Variable names (required for multiple variables or array candidates), e.g. [\"x\",\"y\"]."
  2. 2 tool updatesv1.0.15
    • Addedpoly_roots
    • Addedverify
  3. 2 tool updatesv1.0.2
    • First observedgive_feedback
    • First observedsolve

TDQS

A4/5.0

Scored across 4 tools

Disambiguation4/5

solve, poly_roots, verify, and give_feedback mostly have distinct roles: solving systems, finding polynomial roots, validating candidate answers, and reporting issues. However, solve and poly_roots can overlap for single polynomial equations, so an agent may occasionally hesitate between them.

Naming Consistency3/5

Names are readable and mostly snake_case, but they mix patterns: solve and verify are simple verbs, give_feedback is verb_noun, and poly_roots is a noun. The set lacks a single predictable naming convention.

Tool Count5/5

Four tools is well-scoped for a deterministic math solver with verification and feedback. Each tool appears to earn its place, and there is no obvious bloat or thinness.

Completeness4/5

The surface covers solving equations, polynomial roots, verifying claimed answers, and reporting problems, which matches the core numeric-solver domain. Minor gaps exist around explicit configuration/help tooling, but solve already exposes relevant options in its input.

Maintenance

ActivityActive
ResponsivenessNo issues

Related MCP Connectors

Related MCP Servers

  • A
    license
    A
    quality
    C
    maintenance
    Provides 21 mathematical tools across 6 domains including basic calculations, array operations, statistics, financial mathematics, linear algebra, and calculus. Supports batch execution for complex multi-step workflows with intelligent dependency resolution.
    21
    6
    MIT
  • A
    license
    B
    quality
    A
    maintenance
    Provides secure mathematical computation capabilities including expression evaluation, symbolic math (derivatives, simplification), matrix operations, statistics, and unit conversion, with multi-tier acceleration through WebAssembly and WebWorkers for high-performance calculations.
    7
    84 npm
    ISC
  • A
    license
    A
    quality
    B
    maintenance
    Enables reliable engineering and scientific computation through tools for exact arithmetic, unit-aware formulas, calculus, linear algebra, statistics, uncertainty propagation, and physical constants, all executed safely in reproducible subprocesses.
    8
    MIT
  • A
    license
    Not graded
    quality
    C
    maintenance
    Provides deterministic tools for symbolic math, equation solving, relation verification, reasoning structure audits, and validated CAD primitives, returning evidence artifacts for every result.
    MIT