{
  "data": {
    "tool": {
      "category": "gpu-compute",
      "endpoint": "https://mcp.matrix-compute.net/mcp",
      "jsonUrl": "https://www.anchorterminal.com/api/v1/tools/matrix-compute-mcp.json",
      "kind": "mcp",
      "listed": "indexed",
      "liveUrl": "https://www.anchorterminal.com/api/v1/live/matrix-compute-mcp.json",
      "markdownUrl": "https://www.anchorterminal.com/tools/matrix-compute-mcp.md",
      "mcpTools": {
        "check": {
          "checker": "anchor-check/1.0",
          "totalTokens": 1305,
          "counts": {
            "error": 0,
            "note": 1,
            "warn": 8
          },
          "findings": [
            {
              "rule": "TC12",
              "severity": "warn",
              "tool": "batch_similarity_search",
              "message": "no type for corpus_embeddings, queries",
              "fix": "Give every parameter a type (or an enum)."
            },
            {
              "rule": "TC12",
              "severity": "warn",
              "tool": "compute_pca_svd",
              "message": "no type for matrix",
              "fix": "Give every parameter a type (or an enum)."
            },
            {
              "rule": "TC12",
              "severity": "warn",
              "tool": "execute_distributed_matmul",
              "message": "no type for matrix_a, matrix_b",
              "fix": "Give every parameter a type (or an enum)."
            },
            {
              "rule": "TC16",
              "severity": "warn",
              "tool": "batch_similarity_search",
              "message": "no readOnlyHint or destructiveHint",
              "fix": "Its name starts with \"search\"; if it only reads, set readOnlyHint: true so harnesses can run it without asking."
            },
            {
              "rule": "TC16",
              "severity": "warn",
              "tool": "compute_pca_svd",
              "message": "no readOnlyHint or destructiveHint",
              "fix": "Set readOnlyHint: true if it only reads; otherwise set destructiveHint and idempotentHint."
            },
            {
              "rule": "TC16",
              "severity": "warn",
              "tool": "estimate_job_cost",
              "message": "no readOnlyHint or destructiveHint",
              "fix": "Set readOnlyHint: true if it only reads; otherwise set destructiveHint and idempotentHint."
            },
            {
              "rule": "TC16",
              "severity": "warn",
              "tool": "execute_distributed_matmul",
              "message": "no readOnlyHint or destructiveHint",
              "fix": "Set readOnlyHint: true if it only reads; otherwise set destructiveHint and idempotentHint."
            },
            {
              "rule": "TC16",
              "severity": "warn",
              "tool": "get_network_status",
              "message": "no readOnlyHint or destructiveHint",
              "fix": "Its name starts with \"get\"; if it only reads, set readOnlyHint: true so harnesses can run it without asking."
            },
            {
              "rule": "TC24",
              "severity": "note",
              "message": "5 of 5 tools have no outputSchema",
              "fix": "Declare outputSchema for tools that return structured data, and return structuredContent that matches it."
            }
          ]
        },
        "checkedAt": "2026-11-17T04:18:09Z",
        "count": 5,
        "note": "answered without the initialize handshake",
        "schemaTokens": 1305,
        "status": "ok",
        "tools": [
          {
            "name": "get_network_status",
            "description": "Queries the Matrix Compute discovery relay for live GPU worker availability, total VRAM capacity, confidential computing (TEE) enclaves, and sats_per_gflop pricing.",
            "inputSchema": {
              "additionalProperties": false,
              "properties": {
                "max_price_per_gflop": {
                  "description": "Maximum worker price filter in satoshis per GFLOP (optional).",
                  "type": "number"
                },
                "min_vram_mb": {
                  "description": "Minimum worker VRAM filter in MB (optional).",
                  "type": "integer"
                }
              },
              "type": "object"
            }
          },
          {
            "name": "estimate_job_cost",
            "description": "Calculates exact upload/download network bandwidth (MB), task count, GFLOPs, and satoshi cost estimates for a distributed matrix multiplication C (m x n) = A (m x k) x B (k x n).",
            "inputSchema": {
              "additionalProperties": false,
              "properties": {
                "dtype": {
                  "default": "fp32",
                  "description": "Precision format ('fp32', 'fp16', 'bf16').",
                  "enum": [
                    "fp32",
                    "fp16",
                    "bf16"
                  ],
                  "type": "string"
                },
                "grid_cols": {
                  "description": "Column partitions P_c when using output_grid_2d.",
                  "type": "integer"
                },
                "grid_rows": {
                  "description": "Row partitions P_r when using output_grid_2d.",
                  "type": "integer"
                },
                "k": {
                  "description": "Inner dimension K (columns of A / rows of B).",
                  "type": "integer"
                },
                "m": {
                  "description": "Rows of matrix A (M \u003e 0).",
                  "type": "integer"
                },
                "n": {
                  "description": "Columns of matrix B (N \u003e 0).",
                  "type": "integer"
                },
                "num_strips": {
                  "default": 4,
                  "description": "Strip count when using outer_product_1d.",
                  "type": "integer"
                },
                "partitioning_strategy": {
                  "default": "output_grid_2d",
                  "description": "Matrix partitioning strategy.",
                  "enum": [
                    "output_grid_2d",
                    "outer_product_1d",
                    "block_3d"
                  ],
                  "type": "string"
                },
                "sats_per_gflop": {
                  "description": "Override worker price in satoshis per GFLOP.",
                  "type": "number"
                },
                "tile_size": {
                  "default": 1024,
                  "description": "Tile block size dimension.",
                  "type": "integer"
                }
              },
              "required": [
                "m",
                "k",
                "n"
              ],
              "type": "object"
            }
          },
          {
            "name": "execute_distributed_matmul",
            "description": "Executes verified distributed matrix multiplication C = A x B across decentralized GPU workers with dynamic Freivalds verification and L402 settlement. Accepts file paths (.npy, .npz, .safetensors) or inline 2D JSON arrays.",
            "inputSchema": {
              "additionalProperties": false,
              "properties": {
                "dtype": {
                  "default": "fp32",
                  "description": "Computation precision ('fp32', 'fp16', 'bf16').",
                  "enum": [
                    "fp32",
                    "fp16",
                    "bf16"
                  ],
                  "type": "string"
                },
                "matrix_a": {
                  "description": "File path (.npy/.npz/.safetensors) or inline 2D array for matrix A (M x K)."
                },
                "matrix_b": {
                  "description": "File path (.npy/.npz/.safetensors) or inline 2D array for matrix B (K x N)."
                },
                "output_path": {
                  "description": "Optional output file path (.npy, .npz, or .safetensors) to write C.",
                  "type": "string"
                },
                "partitioning_strategy": {
                  "default": "output_grid_2d",
                  "description": "Matrix partitioning topology.",
                  "enum": [
                    "output_grid_2d",
                    "outer_product_1d",
                    "block_3d"
                  ],
                  "type": "string"
                },
                "tensor_key_a": {
                  "description": "Optional tensor key when loading matrix_a from .safetensors or .npz.",
                  "type": "string"
                },
                "tensor_key_b": {
                  "description": "Optional tensor key when loading matrix_b from .safetensors or .npz.",
                  "type": "string"
                },
                "tile_size": {
                  "description": "Optional tile block size override.",
                  "type": "integer"
                }
              },
              "required": [
                "matrix_a",
                "matrix_b"
              ],
              "type": "object"
            }
          },
          {
            "name": "batch_similarity_search",
            "description": "Runs exact cosine similarity search between query embeddings (M x D) and corpus embeddings (N x D) on distributed GPUs using OUTPUT_GRID_2D zero-reduction tiling.",
            "inputSchema": {
              "additionalProperties": false,
              "properties": {
                "corpus_embeddings": {
                  "description": "File path (.npy/.npz/.safetensors) or inline 2D array of shape (N, D)."
                },
                "dtype": {
                  "default": "fp32",
                  "description": "Target GEMM precision.",
                  "enum": [
                    "fp32",
                    "fp16",
                    "bf16"
                  ],
                  "type": "string"
                },
                "output_path": {
                  "description": "Optional file path (.npy/.safetensors) to save the full similarity matrix.",
                  "type": "string"
                },
                "queries": {
                  "description": "File path (.npy/.npz/.safetensors) or inline 2D array of shape (M, D)."
                },
                "top_k": {
                  "default": 5,
                  "description": "Number of top matching corpus indices and scores to return per query.",
                  "type": "integer"
                }
              },
              "required": [
                "queries",
                "corpus_embeddings"
              ],
              "type": "object"
            }
          },
          {
            "name": "compute_pca_svd",
            "description": "Computes verified top-k Principal Component Analysis (PCA) / Singular Value Decomposition (SVD) on distributed GPU workers via randomized subspace iteration or stateful power iteration.",
            "inputSchema": {
              "additionalProperties": false,
              "properties": {
                "center": {
                  "default": true,
                  "description": "Mean-center columns before decomposition (standard PCA).",
                  "type": "boolean"
                },
                "k": {
                  "description": "Number of top singular/principal components to extract.",
                  "type": "integer"
                },
                "matrix": {
                  "description": "File path (.npy/.npz/.safetensors) or inline 2D array of shape (M, N)."
                },
                "method": {
                  "default": "randomized",
                  "description": "Decomposition algorithm ('randomized' or 'power_iteration').",
                  "enum": [
                    "randomized",
                    "power_iteration"
                  ],
                  "type": "string"
                },
                "output_path": {
                  "description": "Optional output file path (.npz or .safetensors) to save U, S, Vt.",
                  "type": "string"
                }
              },
              "required": [
                "matrix",
                "k"
              ],
              "type": "object"
            }
          }
        ]
      },
      "name": "matrix-compute-mcp",
      "note": "Indexed from the official MCP registry: facts and our own checks, not reviewed, so no score, grade or rank.",
      "packages": [
        {
          "registryType": "pypi",
          "identifier": "matrix-compute-mcp",
          "version": "0.1.4",
          "transport": "stdio"
        }
      ],
      "pageJsonUrl": "https://www.anchorterminal.com/tools/matrix-compute-mcp.json",
      "popularity": {
        "githubStars": 0,
        "pypiWeekly": 414
      },
      "registryName": "com.matrix-compute/matrix-compute-mcp",
      "remotes": [
        {
          "type": "streamable-http",
          "url": "https://mcp.matrix-compute.net/mcp"
        }
      ],
      "repository": "https://github.com/matrixmultiplyconsortium/matrix-compute-mcp",
      "reviewed": false,
      "slug": "matrix-compute-mcp",
      "source": "the official MCP registry",
      "sourceUrl": "https://registry.modelcontextprotocol.io/v0.1/servers?search=com.matrix-compute/matrix-compute-mcp",
      "summary": "P2P GPU matrix multiply, exact cosine search, and PCA/SVD verified via Freivalds' algorithm.",
      "updatedAt": "2026-11-15T17:57:03Z",
      "url": "https://www.anchorterminal.com/tools/matrix-compute-mcp",
      "vendor": "matrix-compute.com",
      "vendorUrl": "https://matrix-compute.com",
      "version": "0.1.4",
      "websiteUrl": "",
      "where": "both",
      "why": [
        "vendor"
      ]
    }
  },
  "kind": "anchor.page",
  "links": {
    "api": "https://www.anchorterminal.com/api/v1/index.json",
    "html": "https://www.anchorterminal.com/tools/matrix-compute-mcp",
    "json": "https://www.anchorterminal.com/tools/matrix-compute-mcp.json",
    "llms": "https://www.anchorterminal.com/llms.txt",
    "markdown": "https://www.anchorterminal.com/tools/matrix-compute-mcp.md",
    "mcp": "https://www.anchorterminal.com/mcp",
    "slim": "https://www.anchorterminal.com/tools/matrix-compute-mcp.min.md"
  },
  "markdown": "# matrix-compute-mcp\n\n\u003e Indexed, not reviewed: facts from the official MCP registry and our own checks. No score, grade or rank, and not in the rankings until the panel reviews it. How the index works: https://www.anchorterminal.com/indexed/\n\n- Kind: MCP server, by matrix-compute.com (https://matrix-compute.com)\n- Category: GPU \u0026 serverless compute (https://www.anchorterminal.com/categories/gpu-compute.md)\n- Listed because: It's published in the registry under matrix-compute.com, a namespace the registry only gives to whoever proves they control that domain.\n- What the official MCP registry says: P2P GPU matrix multiply, exact cosine search, and PCA/SVD verified via Freivalds' algorithm.\n\n## Facts\n\n- MCP registry: `com.matrix-compute/matrix-compute-mcp` 0.1.4\n- Endpoint: https://mcp.matrix-compute.net/mcp (streamable HTTP)\n- Package: pypi `matrix-compute-mcp` (stdio)\n- Source: https://github.com/matrixmultiplyconsortium/matrix-compute-mcp\n- PyPI downloads a week: 414\n- GitHub stars: 0\n- Registry entry updated: 2026-11-15\n\n## Tools\n\n- Tools it lists (5, about 1,305 tokens of context, `tools/list` without credentials, checked 2026-11-17 04:18 UTC):\n  - `get_network_status`: Queries the Matrix Compute discovery relay for live GPU worker availability, total VRAM capacity, confidential computing (TEE) enclaves, and sats_per_gflop…\n  - `estimate_job_cost`: Calculates exact upload/download network bandwidth (MB), task count, GFLOPs, and satoshi cost estimates for a distributed matrix multiplication C (m x n) = A…\n  - `execute_distributed_matmul`: Executes verified distributed matrix multiplication C = A x B across decentralized GPU workers with dynamic Freivalds verification and L402 settlement. Accepts…\n  - `batch_similarity_search`: Runs exact cosine similarity search between query embeddings (M x D) and corpus embeddings (N x D) on distributed GPUs using OUTPUT_GRID_2D zero-reduction…\n  - `compute_pca_svd`: Computes verified top-k Principal Component Analysis (PCA) / Singular Value Decomposition (SVD) on distributed GPU workers via randomized subspace iteration or…\n- How its tools read to an agent (0 errors, 8 warnings, 1 note, about 1,305 tokens; rules at https://www.anchorterminal.com/check.md; not part of the score):\n  - warn TC12 batch_similarity_search: no type for corpus_embeddings, queries\n  - warn TC12 compute_pca_svd: no type for matrix\n  - warn TC12 execute_distributed_matmul: no type for matrix_a, matrix_b\n  - warn TC16 batch_similarity_search: no readOnlyHint or destructiveHint\n  - warn TC16 compute_pca_svd: no readOnlyHint or destructiveHint\n  - warn TC16 estimate_job_cost: no readOnlyHint or destructiveHint\n  - warn TC16 execute_distributed_matmul: no readOnlyHint or destructiveHint\n  - warn TC16 get_network_status: no readOnlyHint or destructiveHint\n  - note TC24 server: 5 of 5 tools have no outputSchema\n\n- JSON: https://www.anchorterminal.com/api/v1/tools/matrix-compute-mcp.json\n- Being indexed says nothing about quality, and nobody can pay for it. Ask for a review: https://www.anchorterminal.com/builders/#claiming\n",
  "meta": {
    "attribution": "Anchor Terminal (https://www.anchorterminal.com)",
    "attributionRequired": true,
    "credit": "CC BY 4.0, credit Anchor Terminal and link the page or API address you took it from (https://www.anchorterminal.com/terms/#data)",
    "docs": "https://www.anchorterminal.com/docs/",
    "generatedAt": "2026-11-17",
    "license": "CC-BY-4.0",
    "method": "https://www.anchorterminal.com/benchmark/",
    "methodology": "0.8",
    "openapi": "https://www.anchorterminal.com/openapi.json",
    "preview": false,
    "run": "2026-10-01",
    "runLabel": "October 2026 research run",
    "terms": "https://www.anchorterminal.com/terms/#data"
  },
  "page": {
    "breadcrumbs": [
      {
        "name": "Home",
        "url": "https://www.anchorterminal.com/"
      },
      {
        "name": "Terminal",
        "url": "https://www.anchorterminal.com/tools/"
      },
      {
        "name": "Indexed",
        "url": "https://www.anchorterminal.com/indexed/"
      },
      {
        "name": "matrix-compute-mcp",
        "url": ""
      }
    ],
    "description": "matrix-compute-mcp, an MCP server by matrix-compute.com, listed from the official MCP registry. Indexed, not reviewed: facts and our own checks, no score or ranking. P2P GPU matrix multiply, exact cosine search, and PCA/SVD verified via Freivalds' algorithm.",
    "facts": [
      "not reviewed",
      "not ranked",
      "facts only"
    ],
    "h1": "matrix-compute-mcp",
    "image": "https://www.anchorterminal.com/assets/og/indexed.png",
    "path": "/tools/matrix-compute-mcp",
    "published": "",
    "section": "indexed",
    "title": "matrix-compute-mcp: MCP server, indexed from the official MCP registry",
    "toc": null,
    "updated": "2026-11-17",
    "url": "https://www.anchorterminal.com/tools/matrix-compute-mcp"
  },
  "tokens": {
    "markdown": 950,
    "slim": 880
  },
  "version": 1
}
