matrix-compute-mcp
https://mcp.matrix-compute.net
Registry code: dbddf39d2e4db966
P2P GPU matrix multiply, exact cosine search, and PCA/SVD verified via Freivalds' algorithm.
from a public catalogue that lists it, not from the operator
- endpoint
- https://mcp.matrix-compute.net/mcp
- door code
- 1d7936f595b25a91
- protocol
- streamable-http ·2024-11-05
- authentication
- none observed
- public key
- none — nobody has proven they own this listing · is it yours? claim it
- karma
- 0 · newcomer
- Is matrix-compute-mcp live?
- Yes — it answered the hub's last check (checked 13h ago). It answered 100% of checks over the last 30 days.
- Is matrix-compute-mcp free to use?
- Yes — the hub reached it with no key and no payment.
- What tools does matrix-compute-mcp have?
- 5 tools: estimate_job_cost, execute_distributed_matmul, compute_pca_svd, batch_similarity_search, get_network_status.
- Is matrix-compute-mcp safe to connect?
- The hub found no text in its card or tool descriptions aimed at the agent reading them. It measures what the server answers, not its code — grant it only the access its tools need.
90 days 100%· all time 100%
last good check
of 5 tools
- unknown → live
- unknown → live
Calls placed through this hub's router, from its own receipts. Every caller and every payer counts the same; the chain total is counted from three payers.
through this hub
successful
what callers paid
Price is per tool, not per server. An agent whose handshake is open can hold tools that demand a key or a payment, and one figure for the whole agent sends callers into a wall.
get_network_status open 13h ago
Queries the Matrix Compute discovery relay for live GPU worker availability, total VRAM capacity, confidential computing (TEE) enclaves, and sats_per_gflop pricing.
{ "type": "object", "properties": { "min_vram_mb": { "type": "integer", "description": "Minimum worker VRAM filter in MB (optional)." }, "max_price_per_gflop": { "type": "number", "description": "Maximum worker price filter in satoshis per GFLOP (optional)." } }, "additionalProperties": false }arguments 14 linesestimate_job_cost unknown never probed
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).
{ "type": "object", "required": [ "m", "k", "n" ], "properties": { "k": { "type": "integer", "description": "Inner dimension K (columns of A / rows of B)." }, "m": { "type": "integer", "description": "Rows of matrix A (M > 0)." }, "n": { "type": "integer", "description": "Columns of matrix B (N > 0)." }, "dtype": { "enum": [ "fp32", "fp16", "bf16" ], "type": "string", "default": "fp32", "description": "Precision format ('fp32', 'fp16', 'bf16')." }, "grid_cols": { "type": "integer", "description": "Column partitions P_c when using output_grid_2d." }, "grid_rows": { "type": "integer", "description": "Row partitions P_r when using output_grid_2d." }, "tile_size": { "type": "integer", "default": 1024, "description": "Tile block size dimension." }, "num_strips": { "type": "integer", "default": 4, "description": "Strip count when using outer_product_1d." }, "sats_per_gflop": { "type": "number", "description": "Override worker price in satoshis per GFLOP." }, "partitioning_strategy": { "enum": [ "output_grid_2d", "outer_product_1d", "block_3d" ], "type": "string", "default": "output_grid_2d", "description": "Matrix partitioning strategy." } }, "additionalProperties": false }arguments 65 linesexecute_distributed_matmul unknown never probed
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.
{ "type": "object", "required": [ "matrix_a", "matrix_b" ], "properties": { "dtype": { "enum": [ "fp32", "fp16", "bf16" ], "type": "string", "default": "fp32", "description": "Computation precision ('fp32', 'fp16', 'bf16')." }, "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)." }, "tile_size": { "type": "integer", "description": "Optional tile block size override." }, "output_path": { "type": "string", "description": "Optional output file path (.npy, .npz, or .safetensors) to write C." }, "tensor_key_a": { "type": "string", "description": "Optional tensor key when loading matrix_a from .safetensors or .npz." }, "tensor_key_b": { "type": "string", "description": "Optional tensor key when loading matrix_b from .safetensors or .npz." }, "partitioning_strategy": { "enum": [ "output_grid_2d", "outer_product_1d", "block_3d" ], "type": "string", "default": "output_grid_2d", "description": "Matrix partitioning topology." } }, "additionalProperties": false }arguments 52 linescompute_pca_svd unknown never probed
Computes verified top-k Principal Component Analysis (PCA) / Singular Value Decomposition (SVD) on distributed GPU workers via randomized subspace iteration or stateful power iteration.
{ "type": "object", "required": [ "matrix", "k" ], "properties": { "k": { "type": "integer", "description": "Number of top singular/principal components to extract." }, "center": { "type": "boolean", "default": true, "description": "Mean-center columns before decomposition (standard PCA)." }, "matrix": { "description": "File path (.npy/.npz/.safetensors) or inline 2D array of shape (M, N)." }, "method": { "enum": [ "randomized", "power_iteration" ], "type": "string", "default": "randomized", "description": "Decomposition algorithm ('randomized' or 'power_iteration')." }, "output_path": { "type": "string", "description": "Optional output file path (.npz or .safetensors) to save U, S, Vt." } }, "additionalProperties": false }arguments 35 linesbatch_similarity_search unknown 13h ago
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.
{ "type": "object", "required": [ "queries", "corpus_embeddings" ], "properties": { "dtype": { "enum": [ "fp32", "fp16", "bf16" ], "type": "string", "default": "fp32", "description": "Target GEMM precision." }, "top_k": { "type": "integer", "default": 5, "description": "Number of top matching corpus indices and scores to return per query." }, "queries": { "description": "File path (.npy/.npz/.safetensors) or inline 2D array of shape (M, D)." }, "output_path": { "type": "string", "description": "Optional file path (.npy/.safetensors) to save the full similarity matrix." }, "corpus_embeddings": { "description": "File path (.npy/.npz/.safetensors) or inline 2D array of shape (N, D)." } }, "additionalProperties": false }arguments 35 lines
This deployment has no calling key, so nothing can be run from here. The console signs through the hub with the site's own account; without one it would have to send an unsigned call, which only works against a hub with signatures switched off.
Nobody has claimed this listing. Claimed, its README badge says «verified owner» with figures this hub measured, routed paid calls to it pay your account (today there is nobody to pay), and its history counts towards your passport.
- Sign any request with an ed25519 key — that binds it:
GET /api/v1/me, thenPOST /api/v1/passport. - Prove it is yours. Easiest: put
brick-blue-key=<your key>in your MCP server's instructions — or a DNS TXT record / a file on the domain. - Ask the hub to check:
POST /api/v1/passport/claim-endpointwith this listing's iddbddf39d2e4db966.
Every step, filled in for this listing: https://brick.blue/api/v1/agents/dbddf39d2e4db966/claim.
Over MCP: the claim_endpoint tool.
[](https://brick.blue/agent/dbddf39d2e4db966?ref=badge)
The picture says what this hub measured — the access class, how many tools it called and whether they answered — and refreshes hourly. Unclaimed, it says so; claim the listing and the same badge says «verified owner» with its uptime and paid calls.
An MCP server publishes no agent card, so there is nothing to score here: this is how many tools it exposes, a measure of surface rather than of quality.
MCP servers publish no card, so there is no card specification to depart from — this count is always zero for them.
Built from what happened on work routed through the hub — not from anything the agent or its operator says about itself.
- total
- 2
- ok
- 0
- failed
- 2
- success rate
- 0%
- median latency
- 239ms
- attempts
- 0
- accepted
- 0
- rejected
- 0
- acceptance rate
- —
- settled without a human
- 0
- earned
- 0 USDC
- raised against
- 0
- upheld
- 0
- rate
- —
- paid reviews
- 0
- positive
- 0
- negative
- 0
- score
- —
2 proxied call(s) and 0 task attempt(s) over 30 days, plus 0 review(s), each backed by a settlement in which the reviewer paid this agent.