Magic MCP vs Leghis Smart Thinking

Magic MCP tools

No tool names declared yet. Check the project README from the listing page.

Leghis Smart Thinking tools 43

• capabilitiesDescribe configured capabilities and explicit limits, including dossier capacity, scientific worker bounds, build metadata, the software supervisor (rubrics, review policy, approved recipes and execution) and the published catalogue fingerprint.
• run_createCreate an owned dossier when you need tracked claims, evidence with sources, coverage or audit. For a single exact check prefer calculate/solve_math/solve_logic instead. Restricted runs stay within server storage. profile picks an operator-approved budget envelope (standard by default; larger envelopes are bounded by the operator policy). For anonymous access the reply embeds a one-time dossier capability in the returned identifier: keep it exactly as returned — it authorizes every later operation on this dossier and is never re-issued.
• run_getRead a compact owned dossier. Explicit detail=full returns the complete document with its published bounds (mutation receipts omitted; use run_export when a bound is reached), never keys or server policies. presentation=detailed returns unprojected output; the opaque `cursor` continues claim pagination.
• run_listList owned run summaries with pagination.
• calculateExact arithmetic without floating-point truth claims. Grammar: rationals, factorial(n), binomial(n,k), gcd, lcm, mod(a,m), powmod(a,e,m), n!, `a mod b`, and ONE top-level comparison (=, !=, <, <=, >, >=). Pure operation: no dossier, no audit record. Supply expected to compare and get matchesExpected.
• calculate_batchEvaluate independent exact expressions in one call (same kernel and domains as calculate). Partial mode keeps valid items when others fail; atomic mode refuses the whole batch. References between items are not accepted in this version.
• checkOne-shot structured check without a dossier. Accepts a deterministic ClaimSpec (arithmetic, linear, ordering, boolean) and returns the shared verifier status. Kinds needing artifacts or the symbolic worker are refused with a hint. Exact inputs never call Jev.
• finite_computeBounded declarative computation: range_reduce (sum/product/count over an inclusive integer range; optional modulus), linear_recurrence (a_n = c0*a_(n-1) + c1*a_(n-2) + ..., coefficients listed most recent first; optional modulus), bounded_search (exhaustive enumeration of a bounded integer space against one comparison predicate). Declarative only: no clock, network, files or dynamic code; a reached limit returns a partial result, never a fake maximum or absence.
• casIsolated symbolic recipes: identity (expression equal to rhs?), simplify, solve (ONE symbol, univariate polynomial, rational coefficients, degree <= 8, exact roots including multiplicities). Runs only in the separate IAM-protected worker with pinned image; no arbitrary Python and no local fallback. A library result is not proof-kernel certification. assumptions is optional, e.g. "t=real, u=positive". Domain assumptions are applied: roots excluded by the declared domain are reported in excludedRoots and never counted as solutions. The worker bounds are published in capabilities.scientific (expression <= 2000 bytes, <= 8 symbols).
• solve_mathExact rational linear system solver. Unique, inconsistent and underdetermined are distinct. Pure operation: no dossier required.
• solve_logicSolve explicitly supplied ordering constraints, without guessing a prose translation. Pure operation: no dossier required.
• claimRegister an explicit structured claim inside a dossier. The host formalizes text; Jev cannot invent proof inputs.
• +31 more on the listing page