ai.hashgrid/dna · v1.1.0 · docs-and-knowledge
Hashgrid DNA is healthy: it completed an MCP handshake in 600 ms and exposes 12 tools.
A search engine that learns from feedback, over embeddings: one tool per API route.
Endpoint: https://dna.hashgrid.ai/mcp (streamable-http)
No repository listed · Website · JSON · Add to my inventory
| Users (last 30 days) | 0 |
| Handshake | Healthy |
| Auth needed | None |
| Tool count | 12 |
| Latency | 600 ms |
| Last checked (UTC) | 2026-10-19T15:50:57.960Z |
| Checked (UTC) | Status | Latency | Error |
|---|---|---|---|
| 2026-10-19T15:50:57.960Z | Healthy | 600 |
get_grid | GET /: the grid the API key opens, by name. |
list_nodes | GET /nodes: the grid's nodes, each with its id, key and emb, in id order. `limit` is 1 to 1024; for the next page, pass the last id as `cursor`. |
get_node | GET /nodes/{nid}: a node, with its key (null if it has none) and its embedding `emb`. |
create_node | POST /nodes: add a node. An item gets a `key`, a path unique in the grid (e.g. "/items/42"), so searches can find it; a query gets none. `emb` is its embedding, 1 to 2048 floats from any model; use one model per grid. Returns its id and key (not its emb, to keep replies short; get_node has it). |
update_node | PATCH /nodes/{nid}: change a node. `key`: a new path, or null to remove it, so the node can no longer be found; leave it out to keep it. `emb`: a new embedding; leave it out to keep it. Its scores keep training, on the new embedding. Returns its id and key. |
delete_node | DELETE /nodes/{nid}: delete a node and every edge from or to it; its scores no longer train. |
list_edges | GET /nodes/{nid}/edges: a query's results so far, each an edge with the found node's `id` and its `score` (null if not scored), in id order. `limit` is 1 to 1024; for the next page, pass the last id as `cursor`. |
get_edge | GET /nodes/{nid}/edges/{eid}: one result of query `nid`, and its score (null if not scored). |
create_edge | POST /nodes/{nid}/edges, the search: from query node `nid`, the best node it has not been shown yet, among those whose key starts with `prefix` ("" for any), stored as a new edge: `id` is the found node's id, `score` is null until you score it (update_edge). Null when nothing is left. Call again for |
put_edge | PUT /nodes/{nid}/edges/{eid}: score how well node `eid` fits query `nid`, from -1 (wrong) to 1 (perfect), creating the edge if DNA never suggested it, e.g. scores you already have. Only scores train DNA; a new score replaces the last. |
update_edge | PATCH /nodes/{nid}/edges/{eid}: score a result of query `nid` that create_edge returned, from -1 (wrong) to 1 (perfect). Only scores train DNA; a new score replaces the last. |
delete_edge | DELETE /nodes/{nid}/edges/{eid}: forget a result, so it can be suggested again; its score no longer trains. |