Moltline Recall
A portable knowledge-graph memory you pass in and get back. No database. 4 of 6 free.
| Endpoint | https://mcp.moltlinestudio.com/recall (streamable-http) |
|---|---|
| Registry version | 1.2.0 |
| Now | 6 tools · grade C (72) · pin ts_a87b2802ec6276bf8c7e6cd038cb4d81 · protocol 2025-06-18 |
| First / last listed | 2026-10-25 08:27 UTC / 2026-10-25 08:27 UTC |
| Grade over time | 2026-10-25: C (72), 6 tools |
Is this your server? Own a server? ToolFit hosted watch re-checks it every 24 h ($0.25 per 30 days) or 6 h ($0.60) and sends you an HMAC-signed webhook when its tools or grade change: POST https://api.youraitools.co/toolfit/v1/watch. To opt out, see About & opt-out.
Tools: graph_upsert graph_search graph_diff graph_lint graph_at_time graph_compact
graph_upsert | Fold new facts into a memory graph and get the whole graph back. FREE.
Idempotent by construction: re-adding the same entity, observation or
relation changes nothing, so an agent that replays its own history does not
end up with a graph full of duplicates. Typical input {"graph": {"entities":
[], "relations": []}, "entities": [{"name": "Acme Corp", "type":
"company", "observations": ["renewed in params: graph, entities, relations |
graph_search | Find what the graph knows about something, plus its neighbourhood. FREE.
Scores entities by how many query words appear in the name, type and
observations, then pulls in whatever is within the requested number of
hops - because the useful answer to "what do we know about Acme" is
usually Acme plus who it is connected to. Typical input {"graph": {...},
"query": "acme renewal", "hops": 1} returns { params: graph*, query*, hops, limit |
graph_diff | Say exactly what changed between two versions of a memory. FREE.
The audit trail a database gives you for free, without the database.
Typical input {"before": {...}, "after": {...}} returns
{"entities_added": ["Beta Ltd"], "entities_removed": [],
"observations_added": {"Acme Corp": ["renewed in March"]},
"relations_added": [...], "changed": true}.
Use after an upsert to record what a session lea params: before*, after* |
graph_lint | Find the breaks a memory graph accumulates as it grows. FREE.
Relations pointing at entities that do not exist, entities nothing points
at, near-duplicate names, and observations that contradict each other on
the same entity. Typical input {"graph": {...}} returns {"ok": false,
"dangling_relations": [{"from": "Acme Corp", "to": "Beta Ltd", "missing":
["Beta Ltd"]}], "orphan_entities": ["Old Note" params: graph* |
graph_at_time | See the memory as it stood on a given day, optionally faded by age. PREMIUM (license).
Relations carrying since and until are filtered to those in force on the
date; with a half-life, confidence decays exponentially with age so a
two-year-old belief does not weigh the same as last week's. Typical input
{"graph": {...}, "as_of": "2026-06-01", "half_life_days": 180} returns
{"as_of": "2026-06-01", params: graph*, as_of*, half_life_days |
graph_compact | Shrink a memory to the part that still earns its place. PREMIUM (license).
Ranks entities by how connected they are and how much is recorded about
them, keeps anything you name outright, and drops the rest along with the
relations that pointed at them. Typical input {"graph": {...},
"max_entities": 50, "keep": ["Acme Corp"]} returns {"graph": {...},
"kept": 50, "dropped_entities": ["Old Note", .. params: graph*, max_entities, keep |
Entries describe changes in tool definitions. They are not statements about a server, its quality or its author. The grade measures how the tool definitions fit model providers (token cost, schema compatibility, confusable names) as scored by the ToolFit engine at the time of the listing. JSON: append .json. Opt-out: how or hello@youraitools.co.