Search / io.github.phpranga/math-to-code-mcp
math-to-code-mcp
R0· no sign-inMath MCP server for primality, factorization, Java templates, and integer multiplication.
v1.0.1 · active · repository · descriptor JSON · versions
Search / io.github.phpranga/math-to-code-mcp
R0· no sign-inMath MCP server for primality, factorization, Java templates, and integer multiplication.
v1.0.1 · active · repository · descriptor JSON · versions
{
"mcpServers": {
"math-to-code-mcp": {
"type": "http",
"url": "https://math-to-code-mcp-production.up.railway.app/mcp"
}
}
}claude mcp add --transport http math-to-code-mcp https://math-to-code-mcp-production.up.railway.app/mcp[mcp_servers.math-to-code-mcp]
url = "https://math-to-code-mcp-production.up.railway.app/mcp"
{
"$schema": "https://opencode.ai/config.json",
"mcp": {
"math-to-code-mcp": {
"type": "remote",
"url": "https://math-to-code-mcp-production.up.railway.app/mcp",
"enabled": true
}
}
}{
"mcpServers": {
"math-to-code-mcp": {
"type": "http",
"url": "https://math-to-code-mcp-production.up.railway.app/mcp"
}
},
"deeplink": "cursor://anysphere.cursor-deeplink/mcp/install?name=math-to-code-mcp&config=eyJ0eXBlIjoiaHR0cCIsInVybCI6Imh0dHBzOi8vbWF0aC10by1jb2RlLW1jcC1wcm9kdWN0aW9uLnVwLnJhaWx3YXkuYXBwL21jcCJ9"
}{
"servers": {
"math-to-code-mcp": {
"type": "http",
"url": "https://math-to-code-mcp-production.up.railway.app/mcp"
}
}
}{
"mcpServers": {
"math-to-code-mcp": {
"httpUrl": "https://math-to-code-mcp-production.up.railway.app/mcp"
}
}
}extensions:
"math-to-code-mcp":
enabled: true
name: "math-to-code-mcp"
type: streamable_http
uri: "https://math-to-code-mcp-production.up.railway.app/mcp"
timeout: 300
protocol.modernnewest supported version is 2025-06-18; 2026-07-28 not supported, older versions are deprecated until 2027-07-28protocol.statelessonly applies to 2026-07-28 serversprotocol.transportstreamable HTTPprotocol.list_ttlonly applies to 2026-07-28 serversauth.prm, auth.as_metadata, auth.cimdno remote uses OAuthauth.secret_in_urlno templated URLtools.descriptionsevery tool has a descriptiontools.description_lengthdescriptions are concisetools.schemasevery tool has an object input schematools.annotationsno tool declares readOnlyHint or destructiveHint, so clients cannot tell safe calls from risky onestools.directory_hintsno tool declares all four of readOnlyHint, destructiveHint, idempotentHint and openWorldHint; missing: prime_analyze (readOnlyHint, destructiveHint, idempotentHint, openWorldHint); generate_java_algorithm (readOnlyHint, destructiveHint, idempotentHint, openWorldHint); common_base_multiply (readOnlyHint, destructiveHint, idempotentHint, openWorldHint)tools.token_costabout 306 tokens to load every tooltools.api_dumptools are not a one-to-one API dumpstability.changes, stability.rug_pulltool history recorded for 4 of the 7 days neededdeps.known_vulns, deps.mcp_sdk_version, deps.resolvableno npm or PyPI packageNo tool definition changes recorded. A server's first observation is its baseline; later probes record what changes.
Checks run on what our credential-free, read-only probes observe; tools are never called and no code audit is performed. How it is computed.
+repository +namespace-matches-repo +reachable +uptime-100% +updated-4d-ago
Derived from observable signals (official registry feed and our own credential-free probes); no code audit performed. How it is computed.
| remote | auth | reachable | uptime 30d | p50 | protocol | last ok |
|---|---|---|---|---|---|---|
https://math-to-code-mcp-production.up.railway.app/mcp streamable-http | none | yes | 100% | 436 ms | 2025-06-18 | 2026-10-20 |
common_base_multiply | Multiply two integers using the Common-Base Multiplication Method: x=N+a, y=N+b, xy=N^2+N(a+b)+ab. Returns the chosen base, offsets, terms, and exact result. |
generate_java_algorithm | Generate a Java implementation of a supported mathematical algorithm. This returns fixed, reviewed templates and does not execute generated code. |
prime_analyze | Check whether an integer is prime and return its prime factorization. Supports integers from -10^12 through 10^12; prime status is defined only for n >= 2. |
Schemas: list_tools.
{
"name": "io.github.phpranga/math-to-code-mcp",
"$schema": "https://static.modelcontextprotocol.io/schemas/2025-12-11/server.schema.json",
"remotes": [
{
"url": "https://math-to-code-mcp-production.up.railway.app/mcp",
"type": "streamable-http"
}
],
"version": "1.0.1",
"repository": {
"url": "https://github.com/phpranga/math-to-code-mcp",
"source": "github"
},
"description": "Math MCP server for primality, factorization, Java templates, and integer multiplication."
}