{"uid":"cap_Gmr6kilR7VC0QPAA6KN4M","slug":"provenance-graph-integrity-verifier-7b381391","name":"Provenance Graph Integrity Verifier","description":"Inspect a declared dependency graph of up to 64 nodes and 128 edges: exact cycle membership, source-root reachability, and deterministic graph digest. Duplicate edges and dangling references are rejected. Hash declarations are not authenticated. New modular adapter: retained result recovery for 24 hours, minimal receipt metadata for 90 days. Existing live route unchanged.","url":"https://www.mahastrategies.com/api/v1/verify/provenance/graph-integrity?utm_source=zero.xyz","method":"POST","headers":{},"bodySchema":{"type":"object","properties":{"edges":{"type":"array","maxItems":128,"minItems":0},"nodes":{"type":"array","maxItems":64,"minItems":1},"dataClass":{"enum":["public","synthetic"],"type":"string"}}},"responseSchema":null,"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.035004","displayCostAsset":"USDC","priceDynamic":false,"priceHint":null,"priceStatus":"priced","priceSource":"probe","requiresHandshake":false,"reviewCount":0,"rating":{"score":"0.00","successRate":"0.00","reviews":0,"stars":null,"state":"unrated"},"availabilityStatus":"unknown","priceObserved":null,"sessionDeposit":null,"pricing":{"kind":"static","summary":"$0.035004/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.035004","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.035004","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_4uTLFWs0NylWMCwYaKVGP","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.035004","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Validates a declared dependency graph (up to 64 nodes, 128 edges) for cycles, source-root reachability, and produces a deterministic digest, rejecting duplicates and dangling references.","exampleAgentPrompt":"Check this declared dependency graph for cycles, dangling references, and reachability from the source root, then give me a deterministic digest — it has 12 nodes and 20 edges, and the data is synthetic.","exampleUseCases":[{"title":"Software build provenance audit","prompt":"I have a declared build dependency graph with 30 nodes and 55 edges — can you verify it has no cycles, all nodes are reachable from the root, and give me a stable digest so I can compare it against future builds? The data is public."},{"title":"CI pipeline graph validation gate","prompt":"Before we publish this release, can you run our provenance graph through integrity checks? It has 48 nodes and 90 edges, all synthetic data — flag any cycles, duplicate edges, or dangling references so we can fix them."},{"title":"Compliance fingerprinting for declared dependencies","prompt":"I need a deterministic digest of our declared dependency graph for our compliance record — the graph has 20 nodes and 35 edges and contains only public data. Also confirm there are no reachability issues from the source root."}],"resultDescription":"Returns cycle membership details (exact nodes in any cycles found), source-root reachability status for all nodes, a deterministic graph digest (hash), and rejection errors for duplicate edges or dangling references. Results are retained for 24 hours; minimal receipt metadata is kept for 90 days.","failureModes":["Graph exceeds 64 nodes or 128 edges — request rejected","Duplicate edges detected — request rejected with offending edge list","Dangling references (edges pointing to undefined nodes) — request rejected with specifics","Invalid dataClass value outside enum — schema validation error","Empty nodes array (minItems:1) — rejected with schema error","Malformed edge structure — rejected with parse error"],"whenToPreferThis":"Choose this endpoint when you need structural validation of a declared dependency or provenance graph — specifically cycle detection, reachability from a single source root, and a stable deterministic digest — on graphs up to 64 nodes and 128 edges. It is ideal for software supply chain audits, CI/CD gate checks, and compliance fingerprinting where you need authoritative rejection of malformed graphs (duplicates, dangling refs). Note: hash declarations are not authenticated, so this is not a cryptographic trust service — it is a structural integrity and digest service.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-10-19T06:44:34.641Z","isFirstParty":false,"canonicalSlug":"provenance-graph-integrity-verifier-7b381391"}