{"name":"io.github.Yarmoluk/ckg-agentforce","slug":"yarmoluk-ckg-agentforce","title":"Salesforce AgentForce CKG","description":"Salesforce AgentForce knowledge graph — 40 nodes, Einstein Trust Layer, 11x fewer tokens than RAG.","url":"https://mcp.market/server/yarmoluk-ckg-agentforce","rating":null,"grade":"B","score":75,"certified":false,"status":"active","category":"sales","tags":["sales","ai"],"presence":{"score":14,"stars":null,"forks":null,"downloads_week":66,"last_push_at":null,"license":"MIT"},"uptime":{"percent":100,"checks":28,"ok":28,"last_checked_at":"2026-09-27T16:11:30.994Z","last_ok_at":"2026-09-27T16:11:30.994Z","latency_ms":762},"claimed":false,"transport":"mixed","callable_via_gateway":true,"default_price_micros":0,"repository":"https://github.com/Yarmoluk/ckg-agentforce","website":null,"version":"0.10.3","remotes":[{"type":"streamable-http","url":"https://ckg-agentforce.onrender.com/mcp"}],"packages":[{"registryType":"pypi","identifier":"ckg-agentforce","version":"0.10.3","runtimeHint":"uvx","transport":{"type":"stdio"}}],"tools":[{"name":"evaluate_trust_chain","description":"Return a machine-readable JSON trust chain + ROI analysis + payment recommendation.\n\nDesigned for autonomous agent consumption. The agent reads the JSON, evaluates the\nROI gate, selects the cheapest positive-ROI payment option, and purchases autonomously\nif budget is pre-authorized.\n\nTrust chain closes the audit gap that RAG cannot:\n  source_hashes  → SHA-256 of source docs (what was known at extraction time)\n  graph_hash     → SHA-256 of the installed graph file (what is declared now)\n  signer_key_id  → Ed25519 public key fingerprint (who is attesting)\n  benchmark_receipt → BoundaryAttest-signed F1 claim (cryptographic performance proof)\n  scitt_status   → SCITT ledger submission status (public audit anchor)\n\nROI gate: if total_value_per_call_usd > payment_option.price_per_call_usd → autonomous_pay = true.\n\nReturns: JSON string (schema: ckg-trust-chain-v1).\n","write_action":false,"price_micros":0,"input_schema":{"type":"object","properties":{},"title":"evaluate_trust_chainArguments"}},{"name":"export_benchmark_receipt","description":"Generate a signed BoundaryAttest receipt for the agentforce CKG benchmark result.\n\nProduces a `ckg.benchmark_result.exported` claim signed with this server's Ed25519\nsession key. Any party holding the public key can verify the signature over the canonical\nJSON claim. Implements GuardrailDecisionV1 · experimental-interop-v0.1.\n\nResult: F1 0.471 over 30 queries · ckg-benchmark v0.6.2 · 4× over RAG baseline (0.123).\n","write_action":false,"price_micros":0,"input_schema":{"type":"object","properties":{},"title":"export_benchmark_receiptArguments"}},{"name":"get_prerequisites","description":"Return the full ordered prerequisite chain for an AgentForce concept.\n\nShows everything the concept depends on — the complete upstream path.\n\nArgs:\n    concept: Target concept — e.g. 'Autonomous Resolution', 'Multi-LoRA Serving',\n             'Custom Actions', 'Semantic Retrieval'.\n","write_action":false,"price_micros":0,"input_schema":{"type":"object","properties":{"concept":{"title":"Concept","type":"string"}},"required":["concept"],"title":"get_prerequisitesArguments"}},{"name":"list_concepts","description":"List all 40 AgentForce concepts in this knowledge graph.","write_action":false,"price_micros":0,"input_schema":{"type":"object","properties":{},"title":"list_conceptsArguments"}},{"name":"query_ckg","description":"Traverse the AgentForce knowledge graph from any concept.\n\nReturns prerequisites (what this concept needs) and dependents (what it enables).\nEvery relationship traces to an authoritative Salesforce doc URL.\n\nArgs:\n    concept: Concept name — e.g. 'Autonomous Resolution', 'Einstein Trust Layer',\n             'Service Agent', 'Grounding', 'NVIDIA NIM'.\n    depth:   Traversal depth 1–5 (default 3).\n","write_action":false,"price_micros":0,"input_schema":{"type":"object","properties":{"concept":{"title":"Concept","type":"string"},"depth":{"default":3,"title":"Depth","type":"integer"}},"required":["concept"],"title":"query_ckgArguments"}},{"name":"query_intersect","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","write_action":false,"price_micros":0,"input_schema":{"type":"object","properties":{"branches":{"items":{"type":"string"},"title":"Branches","type":"array"},"depth":{"default":2,"title":"Depth","type":"integer"},"direction":{"default":"both","title":"Direction","type":"string"},"mode":{"default":"AND","title":"Mode","type":"string"},"limit":{"default":40,"title":"Limit","type":"integer"}},"required":["branches"],"title":"query_intersectArguments"}},{"name":"resolution_path","description":"Trace the exact path that determines an AgentForce autonomous resolution event.\n\nThis is the $2/resolution billing path — what the agent must traverse correctly\nto resolve autonomously without human handoff.\n","write_action":false,"price_micros":0,"input_schema":{"type":"object","properties":{},"title":"resolution_pathArguments"}},{"name":"route_query","description":"Route an AgentForce question to the optimal model and reasoning approach via graph depth.\n\nThe CKG graph IS the router. AgentForce dependency chains (e.g. Einstein Trust Layer →\nData Cloud → NVIDIA NIM → Resolution Criteria) have typed hops that signal reasoning\ncomplexity deterministically. No heuristic: the graph decides.\n\nRouting table:\n  hop_depth 1  → haiku  · direct        (simple concept lookup)\n  hop_depth 2  → sonnet · generic_cot   (moderate chain)\n  hop_depth 3+ → opus   · sparql_cot    (deep dependency, structured reasoning)\n\nArgs:\n    question: Concept name or natural language question about Salesforce AgentForce.\n\nReturns:\n    model_tier + reasoning_approach + why + context subgraph to inject before LLM call.\n","write_action":false,"price_micros":0,"input_schema":{"type":"object","properties":{"question":{"title":"Question","type":"string"}},"required":["question"],"title":"route_queryArguments"}},{"name":"search_concepts","description":"Find AgentForce concepts by keyword.\n\nArgs:\n    query: Search term — e.g. 'resolution', 'trust', 'grounding', 'action', 'NIM'.\n","write_action":false,"price_micros":0,"input_schema":{"type":"object","properties":{"query":{"title":"Query","type":"string"}},"required":["query"],"title":"search_conceptsArguments"}},{"name":"verify_source","description":"Return the source URL and content hash for an AgentForce concept node.\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: Concept label (partial match supported).\n    receipt: If True, also return a signed BoundaryAttest receipt envelope\n             (experimental-interop-v0.1) binding concept_label + source_url\n             + source_hash + timestamp to this server's ed25519 session key.\n","write_action":false,"price_micros":0,"input_schema":{"type":"object","properties":{"concept":{"title":"Concept","type":"string"},"receipt":{"default":false,"title":"Receipt","type":"boolean"}},"required":["concept"],"title":"verify_sourceArguments"}}],"scan":{"score":75,"grade":"B","scanned_at":"2026-09-24T17:25:14.829Z","report":{"scannerVersion":"0.1.9","scannedAt":"2026-09-24T17:25:14.724Z","components":{"code":{"score":25,"max":25,"notes":["13 source files scanned"]},"reliability":{"score":20,"max":20,"notes":["remote reachable in 866ms"]},"poisoning":{"score":15,"max":15,"notes":["10 tool descriptions checked"]},"auth":{"score":10,"max":15,"notes":["open endpoint, read-only tools"]},"maintenance":{"score":3,"max":15,"notes":["repository not readable: repo not found"]},"identity":{"score":2,"max":10,"notes":["no repository or website to verify"]}},"findings":[],"inputs":{"probes":[{"url":"https://ckg-agentforce.onrender.com/mcp","reachable":true,"authRequired":false,"latencyMs":866,"serverInfo":{"name":"ckg-agentforce","version":"1.30.0"}}],"packages":[{"registryType":"pypi","identifier":"ckg-agentforce","version":"0.10.3","found":true,"weeklyDownloads":66,"license":"MIT","dependencyCount":4,"publishedAt":"2026-07-29T16:48:10.900370Z","repositoryUrl":"https://github.com/Yarmoluk/ckg-agentforce"}],"repo":{"found":false,"owner":"Yarmoluk","repo":"ckg-agentforce","error":"repo not found"},"icon":{"url":null,"source":"none"},"presence":{"stars":null,"forks":null,"downloadsWeek":66,"license":"MIT","lastPushAt":null,"score":14}}}},"grade_history":[],"reviews":[]}