MCP 服务器

Lingshu Solver

io.github.genesis-plan/lingshu-solver
科学与工程 公开且可连接 MCP 2026-07-28

此 MCP 可以做什么

Solves and verifies real-valued algebraic and transcendental equation systems and certifies polynomial real roots.

give_feedback
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.
输入模式
{'type': 'object', 'required': ['message'], 'properties': {'context': {'type': 'string', 'description': 'Optional context: the triggering scenario or input characteristics.'}, 'message': {'type': 'string', 'description': 'What you hit, what you expected, and what you actually got.'}}}
pay
Optional voluntary-support only. The hosted endpoint is no per-call charge today (metering off) (metering off: no credential required, no call limit, no per-call charge), so no payment is needed at all. This tool records a support contribution of any amount: the channel is a corporate static collection code (UnionPay aggregate QR) settling into a corporate bank account, and no payment-platform merchant API is used. AFTER PAYING: nothing to do — there is no self-crediting step and no waiting for reconciliation; the operator reconciles against the corporate bank statement, and any positive amount counts as support, not a bill. If the server has no payment method configured the order is still created but payIntent.payTo is null; in that case just keep calling the endpoint with no credential at all.
输入模式
{'type': 'object', 'required': [], 'properties': {'channel': {'type': 'string', 'description': 'Payment channel: currently fixed to corporate-static (corporate bank collection). Leave empty.'}, 'orderId': {'type': 'string', 'description': 'For self-reporting: the order id returned by a previous pay call, shaped like LS-YYYYMMDD-xxxxxx.'}, 'selfReportNote': {'type': 'string', 'description': 'Optional payment note (payer, channel, time), kept only for reconciliation, up to 200 characters.'}, 'selfReportPaid': {'type': 'boolean', 'description': 'Retired on 2026-10-02 with per-call billing: the endpoint is free, so no credit is created and nothing is released. Kept only for backwards compatibility; it is ignored. Voluntary support is any amount paid straight to the corporate account (payTo / payToQr), reconciled by the operator afterwards.'}}}
poly_roots
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.
输入模式
{'type': 'object', 'required': ['coefficients'], 'properties': {'tolerance': {'type': 'number', 'description': 'Tolerance used to decide a root (optional; internal precision is used by default).'}, 'coefficients': {'type': 'array', 'items': {'type': 'number'}, 'description': 'Polynomial coefficients, highest degree first. [1,-2,-5,6] means x^3-2x^2-5x+6.'}}}
solve
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.
输入模式
{'type': 'object', 'required': ['equations'], 'properties': {'domain': {'type': 'object', 'description': '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.'}, 'options': {'type': 'object', 'description': 'Advanced options (optional), e.g. {budget:500000, maxDepth:28}'}, 'fastMode': {'type': 'boolean', 'description': 'Fast mode (default false).'}, 'equations': {'type': 'array', 'items': {'type': 'string'}, 'description': '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].'}, 'honorPaid': {'type': 'boolean', 'description': 'Honor system: set true to declare this call personal or evaluation use. It is released for free with no verification and no balance deduction. Set false only when this runs inside a product, a commercial pipeline or an automated workflow; payment is voluntary and never enforced.'}, 'variables': {'type': 'array', 'items': {'type': 'string'}, 'description': 'Variable names (optional). If omitted they are auto-detected from the equation text, in order of appearance. Maximum 6.'}}}
verify
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.
输入模式
{'type': 'object', 'required': ['equation', 'candidate'], 'properties': {'equation': {'type': 'string', 'description': 'A single equation containing an equals sign, e.g. "x^2 = 4".'}, 'candidate': {'oneOf': [{'type': 'number'}, {'type': 'object'}, {'type': 'array'}], 'description': 'The claimed answer: a number (single variable, default variable x), {variable:value} for multiple variables, or an array in variables order.'}, 'tolerance': {'type': 'number', 'description': 'Neighbourhood radius (optional, default 1e-3) within which a matching certified root is searched.'}, 'variables': {'type': 'array', 'items': {'type': 'string'}, 'description': 'Variable names (required for multiple variables or array candidates), e.g. ["x","y"].'}}}
已更改
pay
2026年10月4日 02:41
已更改
solve
2026年10月4日 02:41
已更改
pay
2026年10月2日 02:40
已更改
verify
2026年10月2日 02:40
已更改
poly_roots
2026年10月2日 02:40
已更改
give_feedback
2026年10月2日 02:40
已更改
solve
2026年10月2日 02:40
已添加
pay
2026年9月30日 02:40
已添加
verify
2026年9月30日 02:40
已添加
poly_roots
2026年9月30日 02:40
已添加
give_feedback
2026年9月30日 02:40
已添加
solve
2026年9月30日 02:40