Spec Driven Development
MCP Server that facilitates spec-driven development workflows, not just Vibe Coding.
Description from the maker (original English)
Deterministic MCP solver for real equation systems (<=6 vars), Krawczyk-certified.
These three are never merged into one score: opinions, measurements and popularity are different things.
We have not written a plain-language summary for this one yet. Below are the facts we read from the registry.
Pick the AI app you use, then copy the settings.
You need
Which app do you use?
Pick your app above. We remember it, so next time the button says “Install in …”.
Works in Claude on the web, desktop and mobile:
https://hongchenlingjing.com/mcpOpen Claude Desktop → Settings → Developer → Edit Config, and paste this into claude_desktop_config.json
{
"mcpServers": {
"lingshu-solver": {
"command": "npx",
"args": [
"-y",
"lingshu-solver"
]
}
}
}Run this in your terminal
claude mcp add --transport http lingshu-solver https://hongchenlingjing.com/mcpclaude mcp add lingshu-solver -- npx -y lingshu-solverPaste into .cursor/mcp.json in your project, or ~/.cursor/mcp.json
{
"mcpServers": {
"lingshu-solver": {
"url": "https://hongchenlingjing.com/mcp"
}
}
}Paste into .cursor/mcp.json in your project, or ~/.cursor/mcp.json
{
"mcpServers": {
"lingshu-solver": {
"command": "npx",
"args": [
"-y",
"lingshu-solver"
]
}
}
}Your browser asks to open the app, then the app shows the settings and asks you to confirm. Key values are left empty for you to fill in.
Paste into .vscode/mcp.json in your project
{
"servers": {
"lingshu-solver": {
"type": "http",
"url": "https://hongchenlingjing.com/mcp"
}
}
}Paste into .vscode/mcp.json in your project
{
"servers": {
"lingshu-solver": {
"type": "stdio",
"command": "npx",
"args": [
"-y",
"lingshu-solver"
]
}
}
}Your browser asks to open the app, then the app shows the settings and asks you to confirm. Key values are left empty for you to fill in.
ChatGPT connects only to servers on the internet:
https://hongchenlingjing.com/mcpMenu names can differ slightly by plan and over time.
Your choice stays on this device in a cookie; no account needed.
These settings are generated from the maker’s registry entry. If the README says otherwise, follow the README.
We have not read this server’s tool list yet; we check endpoints in rotation.
We check information anyone can see; we have not read the code. Checks that do not apply are left out of the count. · Checked Nov 6, 2026
The registry name was verified with the GitHub account genesis-plan, which owns the repo
We have not read this repo from GitHub yet
We have not read this repo from GitHub yet
Not checked yet; we check endpoints in rotation
Not checked yet; we check endpoints in rotation
Not checked yet; we read the tool list when we check the endpoint
Compared with every active server in this category in the registry. Stars count only when the publisher owns the repo.
It passed 1 of 1 applicable basic checks. We have not read the code. Before adding a key or token, see what access the server asks for and use a key with only the permissions you need.
The registry does not list a required key, though some servers ask you to sign in on first use.
Either way works: install it on your computer or connect to the cloud version.
The GitHub repo last changed –, and the latest version (1.0.23) reached the registry 28 days ago.
Apps that support MCP, such as Claude Desktop, Claude Code, Cursor and VS Code. It connects by URL, so apps that accept remote MCP servers work too, such as ChatGPT in developer mode.
In the same category: Spec Driven Development, Remote Desktop Commander, FOGA node
Servers in the same category from other makers, sorted by stars.
Reading a card:★ GitHub starsiThree pillars: reviews · checks · usageiUpdated = latest version published to the registryi
MCP Server that facilitates spec-driven development workflows, not just Vibe Coding.
Remote Desktop Commander: use files, terminal and processes on your own computers from any AI app.
A Finch OG Agent cell as an MCP server: read the world, dry-run and take ERC-8414 tenders by policy.
Copied from the maker’s repo as written. PopNx MCP has not reviewed or endorsed it. HTML, images and scripts are removed. Links lead off this site.
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 needs | What this tool does |
|---|---|
| A verdict it can branch on without guessing | every 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" question | trustLevel (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 exists | trust.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 enforced | x^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 mistake | verify 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".
| Yes | a deterministic (non-LLM) numerical engine for systems of real equations; algebraic equations and common transcendentals (sin/cos/tan/log/exp/sqrt/abs) all work |
| No | a 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 |
① 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": truein thesolvearguments and the call is released for free (no verification, no
balance deduction). The
npxlocal 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
npx -y lingshu-solver (local stdio, permanently free, offline)https://hongchenlingjing.com/mcp (MCP Streamable HTTP; always on, no install, no key)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.
| Dimension | What it means |
|---|---|
| Verified solutions | every reported solution is Krawczyk-certified (tier=proven); error is within the certified radius; mathematically faithful |
| Completeness | proved 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 caveat | the 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 semantics | only 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 |
| Equations | 1–64 (server-side guard), and the count must be ≥ the variable count |
| Search range | default ±1e6 per variable; supply domain explicitly for fast-growing functions (exp/sinh) |
| Output precision | No 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 |
| Determinism | no random branching; identical input always yields identical output, so caching is safe |
| Data | web version sends nothing upward; local version runs offline; the hosted endpoint does not persist equation contents |
| Dependencies | zero 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.
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.
| Doc | Language | Contents |
|---|---|---|
| 01 · Product role | EN | what it is, what problem it solves, who it is for, capabilities and limits, official wording |
| 02 · User guide | EN | the three forms, the MCP tool contract (input/output/errors), self-hosting, FAQ |
| 05 · Use cases | EN | applicable 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.
Free for non-commercial use; commercial use requires written permission (a proprietary licence of our own, not an open-source licence):
Only the beginning is shown; read the rest in the repo