Salesforce AgentForce CKG

io.github.Yarmoluk/ckg-agentforceVersion 0.10.3

Salesforce AgentForce knowledge graph — 40 nodes, Einstein Trust Layer, 11x fewer tokens than RAG.

Status

Responds194 msNov 14, 2026, 14:43 UTCAnswered our handshake without sign-in.

Registry data may be out of date

We could not refresh it, so this page shows the last copy.

Last checked: Nov 14, 2026, 14:43 UTC
Latency: 194 ms
Remotes responding: 1 of 1
Sign-in: No sign-in
Hosting: Hosted outside the EU (detected)
Registry data as of: Nov 14, 2026, 22:14 UTC

Data from the official MCP Registry, checked by run.zero. How we check

Connect

Streamable HTTP

https://ckg-agentforce.onrender.com/mcpResponds194 msNov 14, 2026, 14:43 UTC

No sign-in

Claude Code

claude mcp add --transport http ckg-agentforce https://ckg-agentforce.onrender.com/mcp

Claude Desktop and claude.ai

1
2
3

Settings > Connectors > Add custom connector
Name: ckg-agentforce
Remote MCP server URL: https://ckg-agentforce.onrender.com/mcp

Cursor

{
  "mcpServers": {
    "ckg-agentforce": {
      "url": "https://ckg-agentforce.onrender.com/mcp"
    }
  }
}

VS Code

code --add-mcp '{"name":"ckg-agentforce","type":"http","url":"https://ckg-agentforce.onrender.com/mcp"}'

Streamable HTTP

pypi: ckg-agentforce 0.10.3

Package only

PyPI (uvx)

claude mcp add ckg-agentforce -- uvx ckg-agentforce==0.10.3

Built your own server? run.zero hosts MCP servers on European infrastructure.

Host your own MCP server on run.zero

Tools

10 tools

Tools of Salesforce AgentForce CKG
	Description		Read-only	Idempotent	Open world
`evaluate_trust_chain`Return a machine-readable JSON trust chain + ROI analysis + payment recommendation. Designed for autonomous agent consumption. The agent reads the JSON, evaluates the ROI gate, selects the cheapest positive-ROI payment option, and purchases autonomously if budget is pre-authorized. Trust chain closes the audit gap that RAG cannot: source_hashes → SHA-256 of source docs (what was known at extraction time) graph_hash → SHA-256 of the installed graph file (what is declared now) signer_key_id → Ed25519 public key fingerprint (who is attesting) benchmark_receipt → BoundaryAttest-signed F1 claim (cryptographic performance proof) scitt_status → SCITT ledger submission status (public audit anchor) ROI gate: if total_value_per_call_usd > payment_option.price_per_call_usd → autonomous_pay = true. Returns: JSON string (schema: ckg-trust-chain-v1).	Return a machine-readable JSON trust chain + ROI analysis + payment recommendation. Designed for autonomous agent consumption. The agent reads the JSON, evaluates the ROI gate, selects the cheapest positive-ROI payment option, and purchases autonomously if budget is pre-authorized. Trust chain closes the audit gap that RAG cannot: source_hashes → SHA-256 of source docs (what was known at extraction time) graph_hash → SHA-256 of the installed graph file (what is declared now) signer_key_id → Ed25519 public key fingerprint (who is attesting) benchmark_receipt → BoundaryAttest-signed F1 claim (cryptographic performance proof) scitt_status → SCITT ledger submission status (public audit anchor) ROI gate: if total_value_per_call_usd > payment_option.price_per_call_usd → autonomous_pay = true. Returns: JSON string (schema: ckg-trust-chain-v1).	Not declared	Not declared	Not declared	Not declared
`export_benchmark_receipt`Generate a signed BoundaryAttest receipt for the agentforce CKG benchmark result. Produces a `ckg.benchmark_result.exported` claim signed with this server's Ed25519 session key. Any party holding the public key can verify the signature over the canonical JSON claim. Implements GuardrailDecisionV1 · experimental-interop-v0.1. Result: F1 0.471 over 30 queries · ckg-benchmark v0.6.2 · 4× over RAG baseline (0.123).	Generate a signed BoundaryAttest receipt for the agentforce CKG benchmark result. Produces a `ckg.benchmark_result.exported` claim signed with this server's Ed25519 session key. Any party holding the public key can verify the signature over the canonical JSON claim. Implements GuardrailDecisionV1 · experimental-interop-v0.1. Result: F1 0.471 over 30 queries · ckg-benchmark v0.6.2 · 4× over RAG baseline (0.123).	Not declared	Not declared	Not declared	Not declared
`get_prerequisites`Return the full ordered prerequisite chain for an AgentForce concept. Shows everything the concept depends on — the complete upstream path. Args: concept: Target concept — e.g. 'Autonomous Resolution', 'Multi-LoRA Serving', 'Custom Actions', 'Semantic Retrieval'.	Return the full ordered prerequisite chain for an AgentForce concept. Shows everything the concept depends on — the complete upstream path. Args: concept: Target concept — e.g. 'Autonomous Resolution', 'Multi-LoRA Serving', 'Custom Actions', 'Semantic Retrieval'.	Not declared	Not declared	Not declared	Not declared
`list_concepts`List all 40 AgentForce concepts in this knowledge graph.	List all 40 AgentForce concepts in this knowledge graph.	Not declared	Not declared	Not declared	Not declared
`query_ckg`Traverse the AgentForce knowledge graph from any concept. Returns prerequisites (what this concept needs) and dependents (what it enables). Every relationship traces to an authoritative Salesforce doc URL. Args: concept: Concept name — e.g. 'Autonomous Resolution', 'Einstein Trust Layer', 'Service Agent', 'Grounding', 'NVIDIA NIM'. depth: Traversal depth 1–5 (default 3).	Traverse the AgentForce knowledge graph from any concept. Returns prerequisites (what this concept needs) and dependents (what it enables). Every relationship traces to an authoritative Salesforce doc URL. Args: concept: Concept name — e.g. 'Autonomous Resolution', 'Einstein Trust Layer', 'Service Agent', 'Grounding', 'NVIDIA NIM'. depth: Traversal depth 1–5 (default 3).	Not declared	Not declared	Not declared	Not declared
`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.	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.	Not declared	Not declared	Not declared	Not declared
`resolution_path`Trace the exact path that determines an AgentForce autonomous resolution event. This is the $2/resolution billing path — what the agent must traverse correctly to resolve autonomously without human handoff.	Trace the exact path that determines an AgentForce autonomous resolution event. This is the $2/resolution billing path — what the agent must traverse correctly to resolve autonomously without human handoff.	Not declared	Not declared	Not declared	Not declared
`route_query`Route an AgentForce question to the optimal model and reasoning approach via graph depth. The CKG graph IS the router. AgentForce dependency chains (e.g. Einstein Trust Layer → Data Cloud → NVIDIA NIM → Resolution Criteria) have typed hops that signal reasoning complexity deterministically. No heuristic: the graph decides. Routing table: hop_depth 1 → haiku · direct (simple concept lookup) hop_depth 2 → sonnet · generic_cot (moderate chain) hop_depth 3+ → opus · sparql_cot (deep dependency, structured reasoning) Args: question: Concept name or natural language question about Salesforce AgentForce. Returns: model_tier + reasoning_approach + why + context subgraph to inject before LLM call.	Route an AgentForce question to the optimal model and reasoning approach via graph depth. The CKG graph IS the router. AgentForce dependency chains (e.g. Einstein Trust Layer → Data Cloud → NVIDIA NIM → Resolution Criteria) have typed hops that signal reasoning complexity deterministically. No heuristic: the graph decides. Routing table: hop_depth 1 → haiku · direct (simple concept lookup) hop_depth 2 → sonnet · generic_cot (moderate chain) hop_depth 3+ → opus · sparql_cot (deep dependency, structured reasoning) Args: question: Concept name or natural language question about Salesforce AgentForce. Returns: model_tier + reasoning_approach + why + context subgraph to inject before LLM call.	Not declared	Not declared	Not declared	Not declared
`search_concepts`Find AgentForce concepts by keyword. Args: query: Search term — e.g. 'resolution', 'trust', 'grounding', 'action', 'NIM'.	Find AgentForce concepts by keyword. Args: query: Search term — e.g. 'resolution', 'trust', 'grounding', 'action', 'NIM'.	Not declared	Not declared	Not declared	Not declared
`verify_source`Return the source URL and content hash for an AgentForce concept node. 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: Concept label (partial match supported). receipt: If True, also return a signed BoundaryAttest receipt envelope (experimental-interop-v0.1) binding concept_label + source_url + source_hash + timestamp to this server's ed25519 session key.	Return the source URL and content hash for an AgentForce concept node. 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: Concept label (partial match supported). receipt: If True, also return a signed BoundaryAttest receipt envelope (experimental-interop-v0.1) binding concept_label + source_url + source_hash + timestamp to this server's ed25519 session key.	Not declared	Not declared	Not declared	Not declared

Details

Registry status: Active
Published: Jul 29, 2026
Updated: Jul 29, 2026
Website: Not given
Repository: https://github.com/Yarmoluk/ckg-agentforce⁠ (opens in a new tab)
Categories (suggested): Knowledge and notes CRM DatabasesSuggested categories are assigned automatically from the registry text and may be wrong. Verified operators can correct them.
GDPR: Not declared

Are you the operator? Claim this listing