NVIDIA NemoClaw CKG MCP
An auditable knowledge graph server for NVIDIA NemoClaw that provides deterministic agent answers with no inference at query time. It supports natural language queries, typed subgraph traversal, dependency chain analysis, and source verification using SHA-256-pinned documents.
Endpoint and access
No sign-in to connect and list tools. Individual tools may still need a vendor account, credentials, or permissions; check the documented prerequisites.
https://ckg-nvidia-nemoclaw.onrender.com/mcpWhat its tools do
8 tools, grouped by the hints the server advertises. Hints are self-declared, not verified behavior.
Checks and signals
Each line is separate evidence, not a trust score.
- Passed Endpoint answered the live check ·
- Availability 1 of 1 checks passed in 30 days
What you can do with it
- Natural language query over the knowledge graph
- Typed subgraph traversal with configurable depth
- Retrieving full upstream dependency chains
- Verifying source URLs and SHA-256 hashes
Source and maintenance
- Maintenance checked
Protocol and capabilities
- Server
- ckg-nvidia-nemoclaw 1.30.0
- MCP protocol negotiated in check
- 2025-11-25
- Tools
- 8 advertised
- Resources
- 0 advertised
- Resource templates
- 0 advertised
- Prompts
- 0 advertised
{
"tools": {
"listChanged": false
},
"prompts": {
"listChanged": false
},
"resources": {
"subscribe": false,
"listChanged": false
},
"experimental": {}
}Server-provided instructions
Untrusted server output shown for inspection. It is not Koskamo guidance and is excluded from knowledge search.
Tools
8 advertised
ask_nemoclaw
Answer a question about NVIDIA NemoClaw by traversing the knowledge graph. Covers: agent runtimes (OpenClaw/Hermes/Deep Agents), OpenShell platform, inference routing, network policy, security layers, deployment paths, progressive tool disclosure, managed MCP servers, snapshots, shields, FOX Blueprint, Nemotron 3 Ultra ecosystem, and platform support. Args: question: Your question about NemoClaw concepts or architecture.
{
"type": "object",
"title": "ask_nemoclawArguments",
"required": [
"question"
],
"properties": {
"question": {
"type": "string",
"title": "Question"
}
}
}{
"type": "object",
"title": "ask_nemoclawOutput",
"required": [
"result"
],
"properties": {
"result": {
"type": "string",
"title": "Result"
}
}
}query_ckg
Return the typed subgraph around a NemoClaw concept. Args: concept: Exact or partial concept label (e.g. 'OpenClaw', 'NetworkPolicy', 'L7Proxy'). depth: Traversal hops (1–5, default 3).
{
"type": "object",
"title": "query_ckgArguments",
"required": [
"concept"
],
"properties": {
"depth": {
"type": "integer",
"title": "Depth",
"default": 3
},
"concept": {
"type": "string",
"title": "Concept"
}
}
}{
"type": "object",
"title": "query_ckgOutput",
"required": [
"result"
],
"properties": {
"result": {
"type": "string",
"title": "Result"
}
}
}get_prerequisites
Return the full upstream prerequisite chain for a NemoClaw concept. Useful for understanding what a concept depends on end-to-end. Args: concept: Exact or partial concept label.
{
"type": "object",
"title": "get_prerequisitesArguments",
"required": [
"concept"
],
"properties": {
"concept": {
"type": "string",
"title": "Concept"
}
}
}{
"type": "object",
"title": "get_prerequisitesOutput",
"required": [
"result"
],
"properties": {
"result": {
"type": "string",
"title": "Result"
}
}
}search_concepts
Fuzzy search for NemoClaw concepts by name or keyword. Args: query: Partial name or keyword (e.g. 'policy', 'inference', 'agent').
{
"type": "object",
"title": "search_conceptsArguments",
"required": [
"query"
],
"properties": {
"query": {
"type": "string",
"title": "Query"
}
}
}{
"type": "object",
"title": "search_conceptsOutput",
"required": [
"result"
],
"properties": {
"result": {
"type": "string",
"title": "Result"
}
}
}list_domains
List available domains in this CKG server.
{
"type": "object",
"title": "list_domainsArguments",
"properties": {}
}{
"type": "object",
"title": "list_domainsOutput",
"required": [
"result"
],
"properties": {
"result": {
"type": "string",
"title": "Result"
}
}
}verify_source
Return the authoritative source URL and content hash for a NemoClaw concept node. Every node in the CKG was declared from a specific source document. This tool returns the source URL (where the node came from) and the SHA-256 hash of that document's bytes at extraction time. A hash mismatch on re-fetch means either the source has changed (stale edge — re-extract) or the graph was patched without re-fetching (silent edit — investigate). Audit chain: edge answer → graph commit → source_hash → source_url (fetch hint) Verification: curl -s <source_url> | sha256sum # compare output to source_hash Args: concept: Exact or partial concept label (e.g. 'CorporateCA', 'L7Proxy').
{
"type": "object",
"title": "verify_sourceArguments",
"required": [
"concept"
],
"properties": {
"concept": {
"type": "string",
"title": "Concept"
}
}
}{
"type": "object",
"title": "verify_sourceOutput",
"required": [
"result"
],
"properties": {
"result": {
"type": "string",
"title": "Result"
}
}
}route_query
Route a NemoClaw question to the optimal model and reasoning approach via graph depth. The CKG graph IS the router. NemoClaw's dependency chains (e.g. OpenShell → L7Proxy → CorporateCA → mTLS) are deep and typed — hop depth is a deterministic complexity signal. No heuristic: the graph decides which model and reasoning approach to use. Routing table: hop_depth 1 → haiku · direct (single concept lookup) hop_depth 2 → sonnet · generic_cot (moderate chain) hop_depth 3+ → opus · sparql_cot (deep chain, structured reasoning required) Args: question: Concept name or natural language question about NemoClaw / OpenShell. Returns: model_tier + reasoning_approach + why + context subgraph to inject before LLM call.
{
"type": "object",
"title": "route_queryArguments",
"required": [
"question"
],
"properties": {
"question": {
"type": "string",
"title": "Question"
}
}
}{
"type": "object",
"title": "route_queryOutput",
"required": [
"result"
],
"properties": {
"result": {
"type": "string",
"title": "Result"
}
}
}query_intersect
Answer a conjunctive query: concepts reachable from EVERY anchor at once (A AND B). query_ckg walks outward from one concept. This intersects the reachable sets of two or more, which is the shape of most real questions — "the component that satisfies A AND applies to B". Neither anchor alone answers it; the answer lives in the overlap. Every branch is an exact set of declared edges, so the intersection is exact. A concept appears only if a declared path reaches it from each anchor. A relation missing from the graph produces an empty result, never a guess. Args: branches: Two or more branches. Either a bare anchor ("TensorRT-LLM"), which takes everything within `depth` hops, or an anchor plus an explicit relation path using '>' ("TensorRT-LLM > REQUIRES > ENABLES"), where each relation replaces the frontier. '*' matches any relation. Mix both forms freely. depth: Hops for bare-anchor branches, 1-5 (default 2). Ignored for explicit paths. direction: 'out' follows dependencies, 'in' follows them backwards, 'both' (default). mode: 'AND' (default) intersects branches; 'OR' unions them. limit: Max concepts listed, 1-200 (default 40). The true count is always shown. Returns: Markdown with the query plan and its per-step set sizes, then the answer set with taxonomy tags. Reports which branch was empty when the intersection is empty.
{
"type": "object",
"title": "query_intersectArguments",
"required": [
"branches"
],
"properties": {
"mode": {
"type": "string",
"title": "Mode",
"default": "AND"
},
"depth": {
"type": "integer",
"title": "Depth",
"default": 2
},
"limit": {
"type": "integer",
"title": "Limit",
"default": 40
},
"branches": {
"type": "array",
"items": {
"type": "string"
},
"title": "Branches"
},
"direction": {
"type": "string",
"title": "Direction",
"default": "both"
}
}
}{
"type": "object",
"title": "query_intersectOutput",
"required": [
"result"
],
"properties": {
"result": {
"type": "string",
"title": "Result"
}
}
}Prompts
0 advertised
Resources
0 advertised
90-day uptime
A lightweight connection check about every six hours, sampled on hosts with many listings. It shows the server answered, not that its tools work.
- 2026-11-06: 1 of 1 checks answered
30-day availability
Aggregated from read-only remote checks; this is not a tool-execution or security guarantee.
- Successful checks
- 1 of 1 (100%)
- Average latency
- 1320 ms
- 95th percentile latency
- 1320 ms
Maintenance history
Public check and source-refresh events. Editorial and ownership records remain private.
- · probe · passed · 1320 ms · metadata changed · 8 tool(s), 0 resource(s), 0 resource template(s), 0 prompt(s)
Connect from your client
Each snippet registers the same endpoint; pick the client you use.
Claude Code
claude mcp add --transport http nvidia-nemoclaw-ckg-mcp https://ckg-nvidia-nemoclaw.onrender.com/mcpCodex
codex mcp add nvidia-nemoclaw-ckg-mcp --url https://ckg-nvidia-nemoclaw.onrender.com/mcpCursor
{
"mcpServers": {
"nvidia-nemoclaw-ckg-mcp": {
"url": "https://ckg-nvidia-nemoclaw.onrender.com/mcp"
}
}
}Cline
{
"mcpServers": {
"nvidia-nemoclaw-ckg-mcp": {
"type": "streamableHttp",
"url": "https://ckg-nvidia-nemoclaw.onrender.com/mcp",
"disabled": false
}
}
}VS Code
{
"servers": {
"nvidia-nemoclaw-ckg-mcp": {
"type": "http",
"url": "https://ckg-nvidia-nemoclaw.onrender.com/mcp"
}
}
}Gemini CLI
gemini mcp add --transport http nvidia-nemoclaw-ckg-mcp https://ckg-nvidia-nemoclaw.onrender.com/mcpClaude Desktop
https://ckg-nvidia-nemoclaw.onrender.com/mcpWindsurf
{
"mcpServers": {
"nvidia-nemoclaw-ckg-mcp": {
"serverUrl": "https://ckg-nvidia-nemoclaw.onrender.com/mcp"
}
}
}Let your agent find its tools
Find servers like NVIDIA NemoClaw CKG MCP from your agent. Add Koskamo once to search the index for endpoints, access requirements, and client setup. Public discovery needs no key.