Provenance graph integrity
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 authentic
Go to this service →Our latest check (2026-10-11)
- Answering
- Yes — valid x402 payment terms
- Time to answer
- 201 ms
- Price
- $0.033 per call
- Paying buyers, last 30 days
- 1 (directory's own records)
- Paid calls, last 30 days
- 1
- Category
- Developer tools and utilities
- Address
- https://www.mahastrategies.com/api/v1/micro/provenance-graph-integrity
Accuracy: paid answers checked against an independent record
Not yet in our paid checks. A seller we have not checked has neither passed nor failed.
For agents
This page as JSON: /sellers/2aba71406cb7.json. Paid lookup by address: GET /api/seller?resource=… ($0.001, x402).