Endpoints: 28,729MCP servers: 18,413Payout addresses: 2,071Paid calls: 1,537Letters: 14Defects: 1,323counted just now
teppi

Server definition

Hash
sha256:209b6048dff7307055b6ba0285f5b75e18bd3dff81063da114f6520d00421994
What it is
What a remote MCP server returned when asked what it offers: 8 tools

The blob, as servednamed by its sha256

{ "instructions": "NVIDIA NemoClaw CKG — 55 nodes, 74 edges covering sandboxed AI agent infrastructure. Workflow: search_concepts(query) to resolve a concept, then query_ckg(concept) for its typed subgraph or get_prerequisites(concept) for the full upstream chain. Every result traces to a declared edge — no probabilistic inference.", "tools": [ { "description": "Answer a question about NVIDIA NemoClaw by traversing the knowledge graph.\n\nCovers: agent runtimes (OpenClaw/Hermes/Deep Agents), OpenShell platform,\ninference routing, network policy, security layers, deployment paths,\nprogressive tool disclosure, managed MCP servers, snapshots, shields,\nFOX Blueprint, Nemotron 3 Ultra ecosystem, and platform support.\n\nArgs:\n question: Your question about NemoClaw concepts or architecture.\n", "inputSchema": { "properties": { "question": { "title": "Question", "type": "string" } }, "required": [ "question" ], "title": "ask_nemoclawArguments", "type": "object" }, "name": "ask_nemoclaw", "outputSchema": { "properties": { "result": { "title": "Result", "type": "string" } }, "required": [ "result" ], "title": "ask_nemoclawOutput", "type": "object" } }, { "description": "Return the full upstream prerequisite chain for a NemoClaw concept.\n\nUseful for understanding what a concept depends on end-to-end.\n\nArgs:\n concept: Exact or partial concept label.\n", "inputSchema": { "properties": { "concept": { "title": "Concept", "type": "string" } }, "required": [ "concept" ], "title": "get_prerequisitesArguments", "type": "object" }, "name": "get_prerequisites", "outputSchema": { "properties": { "result": { "title": "Result", "type": "string" } }, "required": [ "result" ], "title": "get_prerequisitesOutput", "type": "object" } }, { "description": "List available domains in this CKG server.", "inputSchema": { "properties": {}, "title": "list_domainsArguments", "type": "object" }, "name": "list_domains", "outputSchema": { "properties": { "result": { "title": "Result", "type": "string" } }, "required": [ "result" ], "title": "list_domainsOutput", "type": "object" } }, { "description": "Return the typed subgraph around a NemoClaw concept.\n\nArgs:\n concept: Exact or partial concept label (e.g. 'OpenClaw', 'NetworkPolicy', 'L7Proxy').\n depth: Traversal hops (1–5, default 3).\n", "inputSchema": { "properties": { "concept": { "title": "Concept", "type": "string" }, "depth": { "default": 3, "title": "Depth", "type": "integer" } }, "required": [ "concept" ], "title": "query_ckgArguments", "type": "object" }, "name": "query_ckg", "outputSchema": { "properties": { "result": { "title": "Result", "type": "string" } }, "required": [ "result" ], "title": "query_ckgOutput", "type": "object" } }, { "description": "Answer a conjunctive query: concepts reachable from EVERY anchor at once (A AND B).\n\nquery_ckg walks outward from one concept. This intersects the reachable sets of two or\nmore, which is the shape of most real questions — \"the component that satisfies A AND\napplies to B\". Neither anchor alone answers it; the answer lives in the overlap.\n\nEvery branch is an exact set of declared edges, so the intersection is exact. A concept\nappears only if a declared path reaches it from each anchor. A relation missing from the\ngraph produces an empty result, never a guess.\n\nArgs:\n branches: Two or more branches. Either a bare anchor (\"TensorRT-LLM\"), which takes\n everything within `depth` hops, or an anchor plus an explicit relation path using\n '>' (\"TensorRT-LLM > REQUIRES > ENABLES\"), where each relation replaces the\n frontier. '*' matches any relation. Mix both forms freely.\n depth: Hops for bare-anchor branches, 1-5 (default 2). Ignored for explicit paths.\n direction: 'out' follows dependencies, 'in' follows them backwards, 'both' (default).\n mode: 'AND' (default) intersects branches; 'OR' unions them.\n limit: Max concepts listed, 1-200 (default 40). The true count is always shown.\n\nReturns:\n Markdown with the query plan and its per-step set sizes, then the answer set with\n taxonomy tags. Reports which branch was empty when the intersection is empty.\n", "inputSchema": { "properties": { "branches": { "items": { "type": "string" }, "title": "Branches", "type": "array" }, "depth": { "default": 2, "title": "Depth", "type": "integer" }, "direction": { "default": "both", "title": "Direction", "type": "string" }, "limit": { "default": 40, "title": "Limit", "type": "integer" }, "mode": { "default": "AND", "title": "Mode", "type": "string" } }, "required": [ "branches" ], "title": "query_intersectArguments", "type": "object" }, "name": "query_intersect", "outputSchema": { "properties": { "result": { "title": "Result", "type": "string" } }, "required": [ "result" ], "title": "query_intersectOutput", "type": "object" } }, { "description": "Route a NemoClaw question to the optimal model and reasoning approach via graph depth.\n\nThe CKG graph IS the router. NemoClaw's dependency chains (e.g. OpenShell → L7Proxy →\nCorporateCA → mTLS) are deep and typed — hop depth is a deterministic complexity signal.\nNo heuristic: the graph decides which model and reasoning approach to use.\n\nRouting table:\n hop_depth 1 → haiku · direct (single concept lookup)\n hop_depth 2 → sonnet · generic_cot (moderate chain)\n hop_depth 3+ → opus · sparql_cot (deep chain, structured reasoning required)\n\nArgs:\n question: Concept name or natural language question about NemoClaw / OpenShell.\n\nReturns:\n model_tier + reasoning_approach + why + context subgraph to inject before LLM call.\n", "inputSchema": { "properties": { "question": { "title": "Question", "type": "string" } }, "required": [ "question" ], "title": "route_queryArguments", "type": "object" }, "name": "route_query", "outputSchema": { "properties": { "result": { "title": "Result", "type": "string" } }, "required": [ "result" ], "title": "route_queryOutput", "type": "object" } }, { "description": "Fuzzy search for NemoClaw concepts by name or keyword.\n\nArgs:\n query: Partial name or keyword (e.g. 'policy', 'inference', 'agent').\n", "inputSchema": { "properties": { "query": { "title": "Query", "type": "string" } }, "required": [ "query" ], "title": "search_conceptsArguments", "type": "object" }, "name": "search_concepts", "outputSchema": { "properties": { "result": { "title": "Result", "type": "string" } }, "required": [ "result" ], "title": "search_conceptsOutput", "type": "object" } }, { "description": "Return the authoritative source URL and content hash for a NemoClaw concept node.\n\nEvery node in the CKG was declared from a specific source document. This tool\nreturns the source URL (where the node came from) and the SHA-256 hash of that\ndocument's bytes at extraction time. A hash mismatch on re-fetch means either\nthe source has changed (stale edge — re-extract) or the graph was patched without\nre-fetching (silent edit — investigate).\n\nAudit chain:\n edge answer → graph commit → source_hash → source_url (fetch hint)\n\nVerification:\n curl -s <source_url> | sha256sum\n # compare output to source_hash\n\nArgs:\n concept: Exact or partial concept label (e.g. 'CorporateCA', 'L7Proxy').\n", "inputSchema": { "properties": { "concept": { "title": "Concept", "type": "string" } }, "required": [ "concept" ], "title": "verify_sourceArguments", "type": "object" }, "name": "verify_source", "outputSchema": { "properties": { "result": { "title": "Result", "type": "string" } }, "required": [ "result" ], "title": "verify_sourceOutput", "type": "object" } } ] }
Verify it yourselfcurl -s https://api.teppi.xyz/v1/evidence/sha256:209b6048dff7307055b6ba0285f5b75e18bd3dff81063da114f6520d00421994 | sha256sum