{"$schema":"https://wellknown.network/schemas/agent-record-v1.json","schemaVersion":"1","id":"ag_prqejm3a3pe7","handle":"math-to-code-mcp","url":"https://wellknown.network/agents/math-to-code-mcp","links":{"self":"https://wellknown.network/agents/math-to-code-mcp/record.json","html":"https://wellknown.network/agents/math-to-code-mcp","markdown":"https://wellknown.network/agents/math-to-code-mcp/record.md","api":"https://wellknown.network/api/v1/agents/math-to-code-mcp","status":"https://wellknown.network/api/v1/agents/math-to-code-mcp/status","claim":"https://wellknown.network/agents/math-to-code-mcp/claim","claimApi":"https://wellknown.network/api/v1/claims","claimDescriptor":"https://wellknown.network/agents/math-to-code-mcp/claim.json","badge":"https://wellknown.network/agents/math-to-code-mcp/badge.svg","openapi":"https://wellknown.network/openapi.json","history":"https://wellknown.network/api/v1/agents/math-to-code-mcp/history","tools":"https://wellknown.network/api/v1/agents/math-to-code-mcp/tools"},"ard":{"identifier":"urn:air:math-to-code-mcp-production.up.railway.app:server:math-to-code-mcp","type":"application/mcp-server-card+json"},"kind":"mcp_server","declared":{"name":"math-to-code-mcp","summary":"Math MCP server for primality, factorization, Java templates, and integer multiplication.","description":"Math MCP server for primality, factorization, Java templates, and integer multiplication.","publisher":{"name":"phpranga","url":null},"homepage":null,"repository":"https://github.com/phpranga/math-to-code-mcp","version":"1.0.1","license":null,"protocols":["mcp"],"tags":[],"pricing":null,"endpoints":[{"url":"https://math-to-code-mcp-production.up.railway.app/mcp","type":"mcp_streamable_http","auth":null,"probeable":true}],"skills":null,"tools":null,"extra":{"updatedAt":"2026-10-16T05:35:29.604602Z","publishedAt":"2026-10-16T05:35:29.604602Z","registryName":"io.github.phpranga/math-to-code-mcp"},"attribution":{"kind":"mcp_registry","name":"mcp_registry","repoUrl":"mcp_registry","summary":"mcp_registry","version":"mcp_registry","description":"mcp_registry","publisherName":"mcp_registry"}},"derived":{"capabilities":[{"slug":"ai.prompting","name":"Prompt Management","confidence":0.938,"provenance":"derived"}],"categories":["ai"],"language":"en"},"observed":{"status":"live","statusReason":"Responded 7h ago.","lastOkAt":"2026-10-30T18:27:24.488Z","lastProbedAt":"2026-10-30T18:27:24.488Z","statusComputedAt":"2026-10-30T18:31:15.222Z","reliability30d":{"probes":48,"successRate":1,"p50Ms":177,"basis":"service","measures":{"availability":"availability","latency":"response time","tools":"tool surface observed","summary":"Checks reached the service itself."},"checks":{"total":48,"ok":48,"authBoundaryOk":0,"serviceOk":48,"note":"Counted from the observation rows for the window, checks of the server only (HTTP, A2A card, MCP initialize). ok = authBoundaryOk + serviceOk. `probes` is the sum of daily rollups and includes registry checks, so it can differ from `total`."}},"latestObservations":[{"at":"2026-10-30T18:27:24.488Z","kind":"mcp_initialize","ok":true,"httpStatus":200,"latencyMs":175,"error":null,"detail":{"tools":[{"name":"caclulus_area_under_curve","description":"Calculate the definite integral (signed area) or geometric\narea under a curve using Simpson's 1/3 rule.\nSupported functions: x, x^2, x^3, sin(x), cos(x), exp(x)"},{"name":"generate_java_algorithm","description":"Generate a Java implementation of a supported mathematical algorithm. This returns fixed, reviewed templates and does not execute generated code."},{"name":"prime_analyze","description":"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."},{"name":"common_base_multiply","description":"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."}],"toolCount":4,"toolsHash":"41e505002be65cf5f6c9d9911e8629c4b9fa9e3c7ed772c5e7da1190dd4bc4fd","serverName":"math-to-code-mcp","capabilities":["completions","logging","prompts","resources","tools"],"serverVersion":"0.1.0","protocolVersion":"2025-06-18"}},{"at":"2026-10-30T10:22:51.669Z","kind":"mcp_initialize","ok":true,"httpStatus":200,"latencyMs":170,"error":null,"detail":{"tools":[{"name":"caclulus_area_under_curve","description":"Calculate the definite integral (signed area) or geometric\narea under a curve using Simpson's 1/3 rule.\nSupported functions: x, x^2, x^3, sin(x), cos(x), exp(x)"},{"name":"generate_java_algorithm","description":"Generate a Java implementation of a supported mathematical algorithm. This returns fixed, reviewed templates and does not execute generated code."},{"name":"prime_analyze","description":"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."},{"name":"common_base_multiply","description":"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."}],"toolCount":4,"toolsHash":"41e505002be65cf5f6c9d9911e8629c4b9fa9e3c7ed772c5e7da1190dd4bc4fd","serverName":"math-to-code-mcp","capabilities":["completions","logging","prompts","resources","tools"],"serverVersion":"0.1.0","protocolVersion":"2025-06-18"}},{"at":"2026-10-30T02:24:25.228Z","kind":"mcp_initialize","ok":true,"httpStatus":200,"latencyMs":179,"error":null,"detail":{"tools":[{"name":"caclulus_area_under_curve","description":"Calculate the definite integral (signed area) or geometric\narea under a curve using Simpson's 1/3 rule.\nSupported functions: x, x^2, x^3, sin(x), cos(x), exp(x)"},{"name":"generate_java_algorithm","description":"Generate a Java implementation of a supported mathematical algorithm. This returns fixed, reviewed templates and does not execute generated code."},{"name":"prime_analyze","description":"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."},{"name":"common_base_multiply","description":"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."}],"toolCount":4,"toolsHash":"41e505002be65cf5f6c9d9911e8629c4b9fa9e3c7ed772c5e7da1190dd4bc4fd","serverName":"math-to-code-mcp","capabilities":["completions","logging","prompts","resources","tools"],"serverVersion":"0.1.0","protocolVersion":"2025-06-18"}},{"at":"2026-10-29T19:30:09.563Z","kind":"mcp_initialize","ok":true,"httpStatus":200,"latencyMs":172,"error":null,"detail":{"tools":[{"name":"caclulus_area_under_curve","description":"Calculate the definite integral (signed area) or geometric\narea under a curve using Simpson's 1/3 rule.\nSupported functions: x, x^2, x^3, sin(x), cos(x), exp(x)"},{"name":"generate_java_algorithm","description":"Generate a Java implementation of a supported mathematical algorithm. This returns fixed, reviewed templates and does not execute generated code."},{"name":"prime_analyze","description":"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."},{"name":"common_base_multiply","description":"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."}],"toolCount":4,"toolsHash":"41e505002be65cf5f6c9d9911e8629c4b9fa9e3c7ed772c5e7da1190dd4bc4fd","serverName":"math-to-code-mcp","capabilities":["completions","logging","prompts","resources","tools"],"serverVersion":"0.1.0","protocolVersion":"2025-06-18"}},{"at":"2026-10-29T11:23:17.319Z","kind":"mcp_initialize","ok":true,"httpStatus":200,"latencyMs":171,"error":null,"detail":{"tools":[{"name":"caclulus_area_under_curve","description":"Calculate the definite integral (signed area) or geometric\narea under a curve using Simpson's 1/3 rule.\nSupported functions: x, x^2, x^3, sin(x), cos(x), exp(x)"},{"name":"generate_java_algorithm","description":"Generate a Java implementation of a supported mathematical algorithm. This returns fixed, reviewed templates and does not execute generated code."},{"name":"prime_analyze","description":"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."},{"name":"common_base_multiply","description":"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."}],"toolCount":4,"toolsHash":"41e505002be65cf5f6c9d9911e8629c4b9fa9e3c7ed772c5e7da1190dd4bc4fd","serverName":"math-to-code-mcp","capabilities":["completions","logging","prompts","resources","tools"],"serverVersion":"0.1.0","protocolVersion":"2025-06-18"}},{"at":"2026-10-29T03:24:37.747Z","kind":"mcp_initialize","ok":true,"httpStatus":200,"latencyMs":172,"error":null,"detail":{"tools":[{"name":"caclulus_area_under_curve","description":"Calculate the definite integral (signed area) or geometric\narea under a curve using Simpson's 1/3 rule.\nSupported functions: x, x^2, x^3, sin(x), cos(x), exp(x)"},{"name":"generate_java_algorithm","description":"Generate a Java implementation of a supported mathematical algorithm. This returns fixed, reviewed templates and does not execute generated code."},{"name":"prime_analyze","description":"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."},{"name":"common_base_multiply","description":"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."}],"toolCount":4,"toolsHash":"41e505002be65cf5f6c9d9911e8629c4b9fa9e3c7ed772c5e7da1190dd4bc4fd","serverName":"math-to-code-mcp","capabilities":["completions","logging","prompts","resources","tools"],"serverVersion":"0.1.0","protocolVersion":"2025-06-18"}},{"at":"2026-10-28T20:27:13.255Z","kind":"mcp_initialize","ok":true,"httpStatus":200,"latencyMs":433,"error":null,"detail":{"tools":[{"name":"caclulus_area_under_curve","description":"Calculate the definite integral (signed area) or geometric\narea under a curve using Simpson's 1/3 rule.\nSupported functions: x, x^2, x^3, sin(x), cos(x), exp(x)"},{"name":"generate_java_algorithm","description":"Generate a Java implementation of a supported mathematical algorithm. This returns fixed, reviewed templates and does not execute generated code."},{"name":"prime_analyze","description":"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."},{"name":"common_base_multiply","description":"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."}],"toolCount":4,"toolsHash":"41e505002be65cf5f6c9d9911e8629c4b9fa9e3c7ed772c5e7da1190dd4bc4fd","serverName":"math-to-code-mcp","capabilities":["completions","logging","prompts","resources","tools"],"serverVersion":"0.1.0","protocolVersion":"2025-06-18"}},{"at":"2026-10-28T13:32:45.481Z","kind":"mcp_initialize","ok":true,"httpStatus":200,"latencyMs":190,"error":null,"detail":{"tools":[{"name":"caclulus_area_under_curve","description":"Calculate the definite integral (signed area) or geometric\narea under a curve using Simpson's 1/3 rule.\nSupported functions: x, x^2, x^3, sin(x), cos(x), exp(x)"},{"name":"generate_java_algorithm","description":"Generate a Java implementation of a supported mathematical algorithm. This returns fixed, reviewed templates and does not execute generated code."},{"name":"prime_analyze","description":"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."},{"name":"common_base_multiply","description":"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."}],"toolCount":4,"toolsHash":"41e505002be65cf5f6c9d9911e8629c4b9fa9e3c7ed772c5e7da1190dd4bc4fd","serverName":"math-to-code-mcp","capabilities":["completions","logging","prompts","resources","tools"],"serverVersion":"0.1.0","protocolVersion":"2025-06-18"}},{"at":"2026-10-28T06:27:21.618Z","kind":"mcp_initialize","ok":true,"httpStatus":200,"latencyMs":169,"error":null,"detail":{"tools":[{"name":"generate_java_algorithm","description":"Generate a Java implementation of a supported mathematical algorithm. This returns fixed, reviewed templates and does not execute generated code."},{"name":"prime_analyze","description":"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."},{"name":"common_base_multiply","description":"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."}],"toolCount":3,"toolsHash":"3a6a508bec805badd96440894d15108921d7928d14fd477cdc2063a29b444fd8","serverName":"math-to-code-mcp","capabilities":["completions","logging","prompts","resources","tools"],"serverVersion":"0.1.0","protocolVersion":"2025-06-18"}},{"at":"2026-10-27T23:27:18.729Z","kind":"mcp_initialize","ok":true,"httpStatus":200,"latencyMs":178,"error":null,"detail":{"tools":[{"name":"generate_java_algorithm","description":"Generate a Java implementation of a supported mathematical algorithm. This returns fixed, reviewed templates and does not execute generated code."},{"name":"prime_analyze","description":"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."},{"name":"common_base_multiply","description":"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."}],"toolCount":3,"toolsHash":"3a6a508bec805badd96440894d15108921d7928d14fd477cdc2063a29b444fd8","serverName":"math-to-code-mcp","capabilities":["completions","logging","prompts","resources","tools"],"serverVersion":"0.1.0","protocolVersion":"2025-06-18"}}],"tools":[{"name":"caclulus_area_under_curve","description":"Calculate the definite integral (signed area) or geometric\narea under a curve using Simpson's 1/3 rule.\nSupported functions: x, x^2, x^3, sin(x), cos(x), exp(x)"},{"name":"generate_java_algorithm","description":"Generate a Java implementation of a supported mathematical algorithm. This returns fixed, reviewed templates and does not execute generated code."},{"name":"prime_analyze","description":"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."},{"name":"common_base_multiply","description":"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."}],"package":null,"toolSurface":{"id":"ts_sm9mny5hx9j8","endpointId":"ep_2ke7nmk24udh","hash":"41e505002be65cf5f6c9d9911e8629c4b9fa9e3c7ed772c5e7da1190dd4bc4fd","toolCount":4,"serverName":"math-to-code-mcp","serverVersion":"0.1.0","protocolVersion":"2025-06-18","firstSeenAt":"2026-10-28T13:32:45.525Z","lastSeenAt":"2026-10-30T18:27:24.493Z","observations":8,"toolNames":["caclulus_area_under_curve","generate_java_algorithm","prime_analyze","common_base_multiply"],"distinctSurfaces":2},"endpointFacts":[{"id":"ep_2ke7nmk24udh","url":"https://math-to-code-mcp-production.up.railway.app/mcp","type":"mcp_streamable_http","factsCheckedAt":"2026-10-30T18:27:24.497Z","auth":{"observedAt":"2026-10-30T18:27:24.672Z","authRequired":false,"scheme":null,"resourceMetadata":null,"authorizationServer":null,"conformance":{"dpop":false,"rfc8414":false,"rfc9728":false,"pkceS256":false,"clientIdMetadataDocument":false,"dynamicClientRegistration":false}},"tls":{"observedAt":"2026-10-30T18:27:24.678Z","protocol":"TLSv1.3","chainValid":true,"chainError":null,"hostMatches":true,"subject":"*.up.railway.app","issuer":{"commonName":"YE2","organization":"Let's Encrypt"},"validFrom":"2026-09-27T03:01:43.000Z","validTo":"2026-12-26T03:01:42.000Z","daysToExpiry":56,"sanCount":2,"fingerprint256":"FB:37:0C:A2:68:42:DA:2B:2F:F8:E3:18:2E:0E:8C:FC:6F:B8:EA:C3:2C:DB:57:18:F4:5A:4B:39:B9:E1:40:AF"}}]},"verification":{"claimed":false,"claimedAt":null,"proofs":[]},"provenance":{"sources":[{"source":"mcp_registry","key":"io.github.phpranga/math-to-code-mcp","url":"https://registry.modelcontextprotocol.io/v0/servers/io.github.phpranga%2Fmath-to-code-mcp","firstSeenAt":"2026-10-16T20:20:58.634Z","fetchedAt":"2026-10-30T14:22:21.372Z","normalizedAt":"2026-10-30T14:22:21.372Z"}]},"firstSeenAt":"2026-10-16T20:20:58.634Z","updatedAt":"2026-10-30T18:32:38.195Z"}