# Provenance Graph Integrity Verifier

> Provenance Graph Integrity Verifier is a paid API for AI agents from www.mahastrategies.com, paid per call via x402, $0.035004/call, status unknown (last checked 2026-10-19).

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.

## Facts

- Endpoint: POST https://www.mahastrategies.com/api/v1/verify/provenance/graph-integrity?utm_source=zero.xyz
- Price: $0.035004/call
- Payment: x402
- Status: unknown
- Last checked: 2026-10-19
- Activations on Zero: 0
- Tags: x402
- Canonical page: https://www.zero.xyz/c/provenance-graph-integrity-verifier-7b381391
- Structured record (JSON): https://api.zero.xyz/v1/capabilities/cap_Gmr6kilR7VC0QPAA6KN4M

Status and success rate cover calls made through Zero and Zero's own probes. Third-party monitors may report differently.

## How to call it through Zero

Zero handles the 402 payment challenge and records the run. With the Zero CLI installed (`npm i -g @zeroxyz/cli`):

```sh
zero fetch --capability provenance-graph-integrity-verifier-7b381391 -d '<json body>'
```

Example prompt: 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.

## When to prefer this

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.

## Known failure modes

- 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

## How this service works

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.

## Output

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.

## Request schema (JSON Schema)

```json
{
 "type": "object",
 "properties": {
  "edges": {
   "type": "array",
   "maxItems": 128,
   "minItems": 0
  },
  "nodes": {
   "type": "array",
   "maxItems": 64,
   "minItems": 1
  },
  "dataClass": {
   "enum": [
    "public",
    "synthetic"
   ],
   "type": "string"
  }
 }
}
```

## More

- Live health (JSON, refreshed every minute): https://www.zero.xyz/c/provenance-graph-integrity-verifier-7b381391/health.json
- [Zero catalog index](https://www.zero.xyz/llms.txt)
- [Other services from www.mahastrategies.com](https://www.zero.xyz/host/www.mahastrategies.com/llms.txt)