An MCP server for executable mathematics that enables agents to construct objects, compute invariants, search for witnesses, and verify results with independently checkable evidence.
Enables Claude Desktop and MCP-compatible agents to formulate, solve, and certify mathematical optimization problems using production-grade open-source solvers, providing mathematically grounded decisions.
Enables MCP-capable agents to solve scheduling and integer optimization problems using Google OR-Tools, return proven-optimal or valid solutions, independently verify proposed solutions, and explain infeasible rule sets.
Enables rigorous, machine-checked mathematical proving and proof review through 23 local tools that formalize propositions, verify each inference step with SMT and symbolic solvers, search for counterexamples, and run exact number-theoretic and high-precision arithmetic. Verdicts are strictly separated into proven, refuted, inconclusive, verified, sound_with_gaps, and flawed, so unproven steps are disclosed rather than hidden.