Spec Driven Development
MCP Server that facilitates spec-driven development workflows, not just Vibe Coding.
제작자가 쓴 설명(영어 원문)
Deterministic MCP solver for real equation systems (<=6 vars), Krawczyk-certified.
이 세 가지는 절대 하나의 점수로 합치지 않아요. 의견, 측정, 인기는 서로 다른 것이니까요.
이 서버는 아직 쉬운 말로 된 요약을 쓰지 못했어요. 아래는 레지스트리에서 읽어 온 사실이에요.
쓰고 있는 AI 앱을 고른 다음 설정을 복사하세요.
필요한 것
어떤 앱을 쓰세요?
위에서 앱을 고르세요. 기억해 두었다가 다음부터는 버튼에 “…에 설치”라고 표시해요.
웹, 데스크톱, 모바일의 Claude에서 쓸 수 있어요:
https://hongchenlingjing.com/mcpClaude 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/mcpclaude mcp add lingshu-solver -- npx -y lingshu-solver프로젝트의 .cursor/mcp.json 또는 ~/.cursor/mcp.json에 붙여 넣으세요
{
"mcpServers": {
"lingshu-solver": {
"url": "https://hongchenlingjing.com/mcp"
}
}
}프로젝트의 .cursor/mcp.json 또는 ~/.cursor/mcp.json에 붙여 넣으세요
{
"mcpServers": {
"lingshu-solver": {
"command": "npx",
"args": [
"-y",
"lingshu-solver"
]
}
}
}브라우저가 앱을 열지 물어본 다음, 앱이 설정을 보여 주고 확인을 요청해요. 키 값은 비워 두니 직접 입력하세요.
프로젝트의 .vscode/mcp.json에 붙여 넣으세요
{
"servers": {
"lingshu-solver": {
"type": "http",
"url": "https://hongchenlingjing.com/mcp"
}
}
}프로젝트의 .vscode/mcp.json에 붙여 넣으세요
{
"servers": {
"lingshu-solver": {
"type": "stdio",
"command": "npx",
"args": [
"-y",
"lingshu-solver"
]
}
}
}브라우저가 앱을 열지 물어본 다음, 앱이 설정을 보여 주고 확인을 요청해요. 키 값은 비워 두니 직접 입력하세요.
ChatGPT는 인터넷에 있는 서버에만 연결할 수 있어요:
https://hongchenlingjing.com/mcp메뉴 이름은 요금제나 시기에 따라 조금 다를 수 있어요.
선택한 앱은 이 기기의 쿠키에만 저장돼요. 계정은 필요 없어요.
이 설정은 제작자의 레지스트리 정보로 만들었어요. README와 다르면 README를 따르세요.
아직 이 서버의 도구 목록을 읽지 않았어요. 엔드포인트는 차례대로 돌아가며 점검해요.
누구나 볼 수 있는 정보를 점검했고, 코드는 읽지 않았어요. 해당하지 않는 항목은 개수에서 뺐어요. · 2026년 11월 6일 점검
레지스트리 이름이 GitHub 계정 genesis-plan 기준으로 확인되었고, 이 계정이 저장소를 소유하고 있어요
아직 GitHub에서 이 저장소를 읽어 오지 않았어요
아직 GitHub에서 이 저장소를 읽어 오지 않았어요
아직 점검하지 않았어요. 엔드포인트는 차례대로 돌아가며 점검해요
아직 점검하지 않았어요. 엔드포인트는 차례대로 돌아가며 점검해요
아직 점검하지 않았어요. 엔드포인트를 점검할 때 도구 목록을 읽어요
레지스트리에서 이 카테고리의 활성 서버 전체와 비교했어요. 스타는 게시자가 저장소를 소유한 경우에만 세요.
해당하는 기본 점검 1개 중 1개를 통과했어요. 코드는 읽지 않았어요. 키나 토큰을 넣기 전에 서버가 어떤 권한을 요구하는지 확인하고, 꼭 필요한 권한만 있는 키를 쓰세요.
레지스트리에 필수 키가 나와 있지 않아요. 다만 처음 쓸 때 로그인을 요구하는 서버도 있어요.
둘 다 가능해요. 내 컴퓨터에 설치해도 되고, 클라우드 버전에 연결해도 돼요.
GitHub 저장소는 마지막으로 – 변경됐고, 최신 버전(1.0.23)은 28일 전 레지스트리에 올라왔어요.
Claude Desktop, Claude Code, Cursor, VS Code처럼 MCP를 지원하는 앱에서 쓸 수 있어요. URL로 연결되기 때문에, 원격 MCP 서버를 지원하는 앱(예: 개발자 모드의 ChatGPT)에서도 쓸 수 있어요.
같은 카테고리에는: Spec Driven Development, Remote Desktop Commander, LickityClick
같은 카테고리에서 다른 제작자가 만든 서버예요. 스타 순으로 정렬했어요.
카드 보는 법:★ GitHub 스타i세 기둥: 리뷰 · 점검 · 사용 정도i업데이트 = 최신 버전을 레지스트리에 공개한 날i
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.
Create, edit and track LickityClick short links, campaigns and click stats from your AI assistant.
제작자의 저장소에서 쓰인 그대로 가져왔어요. PopNx MCP가 검토하거나 보증한 내용이 아니에요. HTML, 이미지, 스크립트는 제거했어요. 링크를 누르면 이 사이트를 벗어나요.
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):
앞부분만 보여 드려요. 나머지는 저장소에서 읽어 보세요