# dep.halowerk.com Dependency Depth Calculator

> dep.halowerk.com Dependency Depth Calculator is a paid API for AI agents from dep.halowerk.com, paid per call via x402, $0.004/call, status unknown (last checked 2026-09-15).

Calculates the reachable transitive dependency count and maximum dependency tree depth from a caller-supplied directed dependency graph

## Facts

- Endpoint: POST https://dep.halowerk.com/v1/dependency-depth
- Price: $0.004/call
- Payment: x402
- Status: unknown
- Last checked: 2026-09-15
- Activations on Zero: 0
- Tags: x402
- Canonical page: https://www.zero.xyz/c/dep-halowerk-com-dependency-depth-calculator-5490ca11
- Structured record (JSON): https://api.zero.xyz/v1/capabilities/cap_wvqfT-F6Qgv5C-bTnH_Mp

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 dep-halowerk-com-dependency-depth-calculator-5490ca11 -d '<json body>'
```

Example prompt: Given my package 'myapp' and its dependency graph — where myapp depends on lodash and axios, lodash depends on underscore, and axios depends on follow-redirects — calculate the total number of reachable transitive dependencies and the maximum depth of the tree.

## When to prefer this

Use this endpoint when you need a fast, stateless computation of transitive dependency reach and tree depth from a graph you have already constructed locally. It is ideal when you have your own dependency resolution data and want a reliable count and depth metric without having to traverse the graph yourself. Prefer this over registry-fetch endpoints when the graph is already known; prefer registry endpoints when you need to first discover the graph from package metadata.

## Known failure modes

- Missing or empty root field causes validation error
- Graph contains cycles which may cause infinite traversal or incorrect depth
- Graph node references in edges that are not defined as keys may return null or partial results
- Excessively large graphs approaching 10,000 edges per node may be rejected or time out
- Malformed adjacency list structure returns schema validation error

## How this service works

Calculates reachable transitive dependency count and maximum depth from a supplied graph. Missing facts are returned as null and named in unavailable_fields where applicable. Derived values disclose their method; source-backed values disclose source, time window and age. 

## Output

Returns the total count of all reachable transitive dependencies from the root node and the maximum depth of the dependency graph. Fields that cannot be determined are returned as null and listed in 'unavailable_fields'. The response also discloses whether each derived value was computed or source-backed, including the method of derivation.

## Request schema (JSON Schema)

```json
{
 "type": "object",
 "properties": {
  "root": {
   "type": "string",
   "maxLength": 512,
   "minLength": 1,
   "description": ""
  },
  "graph": {
   "type": "object",
   "additionalProperties": {
    "type": "array",
    "items": {
     "type": "string",
     "maxLength": 512,
     "minLength": 1,
     "description": ""
    },
    "maxItems": 10000
   }
  }
 }
}
```

## More

- Live health (JSON, refreshed every minute): https://www.zero.xyz/c/dep-halowerk-com-dependency-depth-calculator-5490ca11/health.json
- [Zero catalog index](https://www.zero.xyz/llms.txt)
- [Other services from dep.halowerk.com](https://www.zero.xyz/host/dep.halowerk.com/llms.txt)