原型 · 预览版:收录官方注册中心里的全部服务器,每 30 分钟同步一次。评价和账户功能将在后续阶段推出。
PopNx MCP为使用 AI 的人准备的 MCP 服务器 · 用大白话讲清楚

Lingshu Solver

作者:genesis-plan版本 1.0.23i★ –i电脑或云端
注册名称io.github.genesis-plan/lingshu-solver

安装

概览

作者提供的说明(英文原文)

Deterministic MCP solver for real equation systems (<=6 vars), Krawczyk-certified.

PopNx MCP 的三大支柱

这三项永远不会合并成一个分数:意见、测量和人气是不同的东西。

它能帮你做什么

我们还没有为它写通俗的介绍。下面是我们从注册中心读取到的事实。

安装

选择你使用的 AI 应用,然后复制设置。

安装之前

你需要

  • 在云端运行无需安装任何东西,通过互联网连接
  • npm已安装 Node.js(用于 npx 命令)

你用的是哪个应用?

在上方选择你的应用。我们会记住它,下次按钮会显示“安装到 …”。

适用于网页版、桌面版和手机版 Claude:

  1. 打开 Settings → Connectors
  2. 点击 Add custom connector
  3. 粘贴下面的地址,然后点击 Add
  4. 如果要求登录,请登录作者的服务
SettingsConnectors1+ Add2https://…3
https://hongchenlingjing.com/mcp

或者在你的电脑上运行

打开 Claude Desktop → Settings → Developer → Edit Config,把下面的内容粘贴到 claude_desktop_config.json

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

在终端中运行这条命令

claude mcp add --transport http lingshu-solver https://hongchenlingjing.com/mcp

或者在你的电脑上运行

claude mcp add lingshu-solver -- npx -y lingshu-solver

在 Cursor 中打开

或者自己复制设置

粘贴到项目中的 .cursor/mcp.json,或 ~/.cursor/mcp.json

{
  "mcpServers": {
    "lingshu-solver": {
      "url": "https://hongchenlingjing.com/mcp"
    }
  }
}

或者在你的电脑上运行

在 Cursor 中打开

或者自己复制设置

粘贴到项目中的 .cursor/mcp.json,或 ~/.cursor/mcp.json

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

浏览器会先询问是否打开应用,然后应用会显示设置并请你确认。密钥的值会留空,由你自己填写。

在 VS Code 中打开

或者自己复制设置

粘贴到项目中的 .vscode/mcp.json

{
  "servers": {
    "lingshu-solver": {
      "type": "http",
      "url": "https://hongchenlingjing.com/mcp"
    }
  }
}

或者在你的电脑上运行

在 VS Code 中打开

或者自己复制设置

粘贴到项目中的 .vscode/mcp.json

{
  "servers": {
    "lingshu-solver": {
      "type": "stdio",
      "command": "npx",
      "args": [
        "-y",
        "lingshu-solver"
      ]
    }
  }
}

浏览器会先询问是否打开应用,然后应用会显示设置并请你确认。密钥的值会留空,由你自己填写。

ChatGPT 只能连接互联网上的服务器:

  1. 打开网页版 ChatGPT → Settings → Connectors (Apps)
  2. 点击 Create 或 Add(部分套餐需要先在 Advanced 中开启 Developer mode)
  3. 粘贴下面的地址,起个名字,然后保存
  4. 如果要求登录,请登录作者的服务
SettingsConnectors1+ Create2https://…3
https://hongchenlingjing.com/mcp

菜单名称可能因套餐和版本不同而略有差异。

你的选择通过 Cookie 保存在这台设备上,无需账户。

这些设置是根据作者在注册中心的条目生成的。如果 README 的写法不同,请以 README 为准。

它能做什么

我们还没有读取这个服务器的工具列表;我们会轮流检查各个端点。

基础检查i

我们检查的是任何人都能看到的信息;我们没有阅读代码。不适用的检查项不计入总数。 · 检查于 2026年11月6日

  • ✓ 通过

    作者与仓库一致

    注册名称已通过 GitHub 账户 genesis-plan 验证,该账户拥有此仓库

  • … 尚未检查

    仍在维护

    我们还没有从 GitHub 读取这个仓库

  • … 尚未检查

    有许可证

    我们还没有从 GitHub 读取这个仓库

  • … 尚未检查

    端点有响应

    尚未检查;我们会轮流检查各个端点

  • … 尚未检查

    使用 OAuth 登录

    尚未检查;我们会轮流检查各个端点

  • … 尚未检查

    工具描述中没有隐藏指令

    尚未检查;我们会在检查端点时读取工具列表

与“其他”中的其他服务器比较i

  • 星标数多于此分类中其他 32375 个服务器的 0%
  • 发布到注册中心的时间比此分类中其他 32375 个服务器的 58% 更新
  • 基础检查结果等于或优于此分类中其他 32375 个服务器的 100%

与注册中心里这个分类中所有活跃的服务器比较。只有当发布者拥有该仓库时,星标数才计入。

常见问题

Lingshu Solver 安全吗?

它在 1 项适用的基础检查中通过了 1 项。我们没有阅读代码。在添加密钥或令牌之前,请先看看这个服务器要求哪些权限,并使用只具备所需权限的密钥。

它需要哪些密钥或代码?

注册中心没有列出必需的密钥,不过有些服务器会在首次使用时要求你登录。

它在我的电脑上运行还是在云端?

两种方式都可以:安装在你的电脑上,或者连接云端版本。

它还在维护吗?

GitHub 仓库最后更新于–,最新版本(1.0.23)于28天前进入注册中心。

哪些应用可以使用它?

支持 MCP 的应用,例如 Claude Desktop、Claude Code、Cursor 和 VS Code。它通过 URL 连接,所以接受远程 MCP 服务器的应用也可以使用,例如开启开发者模式的 ChatGPT。

有什么可以替代它?

同一分类中有:Spec Driven Development, Remote Desktop Commander, DiffCI

替代选择

同一分类中其他作者的服务器,按星标数排序。

如何看卡片:★ GitHub 星标i三大支柱:评价 · 检查 · 使用情况i更新 = 最新版本发布到注册中心的时间i

Spec Driven Development

作者:formulahendry

MCP Server that facilitates spec-driven development workflows, not just Vibe Coding.

在你的电脑上运行★ 440MIT14个月前更新
安装

Remote Desktop Commander

作者:desktop-commander

Remote Desktop Commander: use files, terminal and processes on your own computers from any AI app.

在云端运行★ 211昨天更新
安装

DiffCI

作者:DiffCI

Fail-closed, change-aware verification for AI coding agents with affected-test guidance.

电脑或云端今天更新
安装

作者的 README

打开 README

按原文从作者的仓库复制。PopNx MCP 没有审查或背书其内容。HTML、图片和脚本已被移除。链接会离开本站。

Lingshu Solver

Category: Certified Real-Root Computation

A deterministic solver for systems of real equations. The same problem always produces the same

answer — no language model, no randomness, no hallucination. Every solution it reports is

reproducible and checkable by substitution, and the result carries structured decision fields that

tell the calling agent exactly what to do next.

Built for AI agents. Connect it as an MCP tool and your model stops guessing arithmetic. It is a deterministic, non-LLM numerical engine: same input, same answer, every reported solution checkable by substitution, and — crucially — every result comes with a trust block that tells the agent whether the answer is complete, safe to use, or needs more work. You branch on those fields; you never re-derive completeness yourself. Three things matter to a calling agent, and all three are built in:

What an agent needsWhat this tool does
A verdict it can branch on without guessingevery result carries a conclusion — exactly one of 全部解 / 部分解 / 无解 / 计算资源不足 (all / partial / none / budget-exhausted) — plus canAssert for programmatic use, so you never have to re-derive completeness yourself
An 8-level `trust` block for the "how much do I believe it" questiontrustLevel (8 values, incl. complete_but_shown_partially — search *finished*, only the page was capped), safeToUse, and provenCount / candidateCount so you never have to count solutions yourself
Honesty about "no answer"an empty result is never silently "no real solution" — meaningOfEmpty distinguishes *proven* empty / not found within budget / input not solvable
A proof of completeness when one existstrust.completeness compares the number of solutions found against a theorem-proven upper bound (BKK mixed volume of the Newton polytopes, Bézout, multi-homogeneous Bézout, Milnor–Thom, Descartes/fewnomial). complete = the count hits the bound, so you may say "these are all of them". Anything else says so instead of guessing
Inequality constraints that are actually enforcedx^2=0, x>0 returns no solution, not x=0 — a final gate substitutes every candidate back into the problem's own inequalities (open endpoints included) and drops the violators
A way to fix its own mistakeverify returns the certified corrected value and how far off the original was, so a wrong number becomes a repair, not a retry loop

It also does 1D/2D/3D geometry through one geometry tool (130 closed-form ops: distance, intersection, area, volume, angle, convex hull, point-in-polygon, rotation, bounding box, plus the classical triangle and circle theorems — five centres, Euler line and OI² = R(R−2r), Heron, Stewart, Ceva, Menelaus, Ptolemy, Miquel, Napoleon, Pick, pole/polar, Brahmagupta, plus a tropical/convex bridge (Newton polytope, BKK mixed-volume bound, regular-subdivision multiplicities) — and 3D tetrahedron/Monge point). Same contract as the solver: a trust block tells the agent whether the value is exact, whether the computation *proved* there is definitely_none, or whether the input itself is degenerate (parallel / collinear / coplanar) — and in the last case the correct move is to report the degeneracy, never to invent a number.

Humans can use the web page too (zero install) — but the design target is the agent: compact tool descriptions, structured errors that say what to change, and no prose the model has to pay for on every turn.

🔬 Live demo against the production endpoint: https://hclj-1409755229.cos.ap-guangzhou.myqcloud.com/lingshu-solver/demo.html — call the real MCP endpoint right from the browser and watch poly_roots return certified real roots and verify judge a candidate value. Thirty seconds is enough to see why "an LLM will mis-compute this, Lingshu can certify it".

Yesa deterministic (non-LLM) numerical engine for systems of real equations; algebraic equations and common transcendentals (sin/cos/tan/log/exp/sqrt/abs) all work
Noa symbolic CAS (no analytic derivation), an ODE solver, an integer-programming solver, and it does not claim completeness it did not prove — the completeness block is a theorem-backed bound where one exists, and unknown everywhere else

30 seconds to start

① AI agent (MCP — pick either form)

// local stdio — permanently free, unlimited, offline. Recommended.

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

// hosted endpoint — no install, always on, reachable over the public internet

{ "mcpServers": { "lingshu-solver": { "type": "http", "url": "https://hongchenlingjing.com/mcp" } } }

It also works if you never pay: the hosted endpoint runs on an honor system — pass

"honorPaid": true in the solve arguments and the call is released for free (no verification, no

balance deduction). The npx local version and the web version are permanently free. If you do want to

support it, see the payment page — a corporate account, self-service

crediting, effective immediately, no human approval anywhere in the loop.

② Web (zero install, permanently free)

Type equations into the box (for example x^2 + y^2 = 25 and x + y = 7) and press solve. Everything is computed inside your browser; the equations never leave your device.

③ Developer

git clone https://github.com/genesis-plan/lingshu-solver.git

cd lingshu-solver node mcp-server.js # start the local MCP (stdio) server node test/regression.js # standing regression suite


Discovery — where agents find Lingshu

  • npm — npx -y lingshu-solver (local stdio, permanently free, offline)
  • Hosted endpoint — https://hongchenlingjing.com/mcp (MCP Streamable HTTP; always on, no install, no key)
  • Auto-indexed MCP directories — Glama · HiMCP · LobeHub

To surface it in more clients, point any MCP client at the hosted endpoint above, or submit the repo to Smithery, the official MCP Registry, or mcp.so. The hosted endpoint is the canonical discovery URL.

Honest boundaries

DimensionWhat it means
Verified solutionsevery reported solution is Krawczyk-certified (tier=proven); error is within the certified radius; mathematically faithful
Completenessproved where a bound exists. For polynomial systems the engine derives a rigorous upper bound on the number of isolated solutions (BKK mixed volume of the Newton polytopes, Bézout, multi-homogeneous Bézout, Milnor–Thom, Descartes/fewnomial) and reports trust.completeness. complete means the number found equals that bound, so "these are all the solutions" is a theorem, not a guess. incomplete / unknown never pretends otherwise
scope caveatthe bound's scope is a closed enum. "(C*)^n" (BKK) counts only solutions where every variable is non-zero, so a solution with a zero coordinate is outside the count — complete there means "all non-zero solutions found"
truncated semanticsonly means "the global branch search did not finish inside the budget"; it does not mean solutions were missed. In most cases every real solution was found
Variables≤ 6
Equations1–64 (server-side guard), and the count must be ≥ the variable count
Search rangedefault ±1e6 per variable; supply domain explicitly for fast-growing functions (exp/sinh)
Output precisionNo user-facing switch. Internal computation is fixed at 6 decimals; the agent-facing display is 4 decimals (precisionDecimals) while solutions[].values keep full float precision
Determinismno random branching; identical input always yields identical output, so caching is safe
Dataweb version sends nothing upward; local version runs offline; the hosted endpoint does not persist equation contents
Dependencieszero third-party dependencies (Node built-ins and standard browser APIs only)

Not guaranteed: 100% exhaustiveness for every input, or convergence inside budget for highly pathological systems. That is the honest floor of numerical mathematics ("guaranteeing all solutions" is undecidable in the general case), not a defect to be fixed.


Documentation

The machine-readable description for AI agents lives at llms.txt.

Three of the design docs are in English; the deep-dive docs (design rationale, technical reference, licence and pricing, contract, versioning, history) are still in their original Chinese. Each row below tells you which is which.

DocLanguageContents
01 · Product roleENwhat it is, what problem it solves, who it is for, capabilities and limits, official wording
02 · User guideENthe three forms, the MCP tool contract (input/output/errors), self-hosting, FAQ
05 · Use casesENapplicable scenarios (agent backend / multi-agent / off-chain computation / tax and finance control / on-prem / education / audit) and the ones that do not apply
03 · Design ideas中文six design principles, why it is trustworthy, why no LLM, what it deliberately refuses to do
04 · Technical reference中文mathematical framework, algorithm pipeline, operator table, hard spec constraints, test suite
06 · Commercial licence and pricing中文licence model, what is free, hosted-endpoint metering, enterprise annual licence, invoicing
07 · Licence contract中文commercial licence template, clause walkthrough, signing flow
08 · Versioning中文version semantics, release flow and the consistency checklist, compatibility promises, history
09 · Project history中文how it got from the original problem to where it stands now

If you read only one page, read 01 · Product role — it states the limits and the approved wording.

Privacy and security commitments are published separately: privacy.html.


Licence (summary)

Free for non-commercial use; commercial use requires written permission (a proprietary licence of our own, not an open-source licence):

  • Non-commercial, free: personal study / research / teaching / evaluation; internal use by non-profit organisations and educational institutions; internal evaluation by teams with annual revenue up to RMB 1 million (≤ 3 instances).
  • Commercial use needs prior written permission: any product, service or business operated for profit, resale of SaaS/cloud/API, integration,

只显示了开头部分;其余内容请在仓库中阅读

问 PopNx