# io.github.dushyant30suthar/endiagram-mcp (npm · @endiagram/mcp)

EN Diagram — structural verification for concurrent systems. Pure math, no AI.

- Trust score: 64/100 (medium)
- Change this week: +22
- Registry status: active
- Liveness: live
- Owner verified: no
- Last scored: 2026-08-03

## Components

- remote · `api.endiagram.com`: 58/100, [markdown](https://verifymcp.io/servers/dushyant30suthar-endiagram-mcp/api.md), [page](https://verifymcp.io/servers/dushyant30suthar-endiagram-mcp/api)
- npm · `@endiagram/mcp`: 64/100 (this document), [markdown](https://verifymcp.io/servers/dushyant30suthar-endiagram-mcp/endiagram-mcp.md), [page](https://verifymcp.io/servers/dushyant30suthar-endiagram-mcp/endiagram-mcp)

## Channel facts

- Registry: `npm`
- Package: `@endiagram/mcp`
- Version: `0.3.16`
- Transport: `stdio`

## Trust breakdown

How this component scores in each security and reliability category. Every signal is checked automatically from public evidence about the published package, including repeated runs of it in an isolated sandbox, and we only credit what we can confirm. Scores are 0–100 per category. Scoring method: https://verifymcp.io/docs/scoring (what has changed: https://verifymcp.io/docs/scoring/changelog)

Scored 2026-08-03.

- **Supply Chain Security**: 87/100
  - No malware found by supply-chain analysis.
  - Only part of the dependency tree could be resolved (95 of 99), so this covers what we could see, not the whole tree.
  - No install/post-install scripts declared.
  - Only part of the dependency tree could be resolved (95 of 99), so this covers what we could see, not the whole tree.
- **Provenance & Transparency**: 45/100
  - Source repository is publicly reachable at the declared URL.
  - Provenance check failed: no build-provenance attestation is published.
  - Clear OSI-approved license (MIT).
  - Actively maintained (last published 103 days ago).
  - Disclosure check failed: no security disclosure policy was found in the source repository.
- **Schema Quality & AI Usability**: 47/100
  - AI-judged instruction clarity (good).
  - Context-footprint check failed: tool/resource definitions use about 2269 tokens (~324/item across 7 items; 7 tools + 0 resources), over budget; trim descriptions and params.
  - Usage-examples check failed: none of the tools include examples.
- **Stability & Change Management**: 27/100
  - Stability observed for 8 of 30 days with no destabilising changes; credit accrues until the full window elapses.
- **Tool Coverage**: 100/100
  - 100% of tools have a non-trivial description (not blank, and not just the tool's name).
  - 100% of tool parameters carry a description.
- **Capabilities**: 100/100
  - Implements a supported MCP spec version (2025-11-25); the latest is 2026-07-28.

## Install

### Claude

```bash
claude mcp add dushyant30suthar-endiagram-mcp -- npx -y @endiagram/mcp
```

### Codex

```bash
codex mcp add dushyant30suthar-endiagram-mcp -- npx -y @endiagram/mcp
```

### opencode

```json
{
  "$schema": "https://opencode.ai/config.json",
  "mcp": {
    "dushyant30suthar-endiagram-mcp": {
      "type": "local",
      "command": [
        "npx",
        "-y",
        "@endiagram/mcp"
      ],
      "enabled": true
    }
  }
}
```

### OpenClaw

```bash
openclaw mcp add dushyant30suthar-endiagram-mcp --command npx --arg -y --arg @endiagram/mcp
```

### Hermes

```yaml
mcp_servers:
  dushyant30suthar-endiagram-mcp:
    command: "npx"
    args: ["-y", "@endiagram/mcp"]
```

### Other

```json
{
  "mcpServers": {
    "dushyant30suthar-endiagram-mcp": {
      "command": "npx",
      "args": [
        "-y",
        "@endiagram/mcp"
      ]
    }
  }
}
```

## Changelog

Every change recorded for this component, newest first. Days that predate change tracking, or that we cannot explain, say so: "we were watching and nothing happened" and "we were not watching" are different claims.

### 2026-08-03 (score 64, +1)

No change was recorded against any check on this day. Stability & Change Management went from 23 to 27. That category is still filling its 30-day observation window: 7 days of observed history at the previous scan, 8 at this one. The score rises as the window fills, whether or not the server changes.

### 2026-08-02 (score 63, +46)

- [security regression] Provenance: unverified → fail
- [security improvement] Install scripts: unverified → pass
- [security improvement] Known CVEs: unverified → partial
- [security improvement] Malware scan: unverified → pass
- [functional regression] Tool coverage: 100 → unverified
- [functional regression] Security disclosure: fail → unverified
- [functional improvement] Maintenance: unverified → pass
- [functional improvement] MCP protocol: unverified → pass
- [functional improvement] Stability: unverified → 0.23
- [functional improvement] Schema quality: unverified → good
- [functional improvement] License: unverified → pass
- [functional improvement] Dependency health: unverified → partial
- [functional] First check of Schema quality: unverified
- [functional] Licence: MIT

### 2026-07-31 (score 17, −7)

- [functional] We updated how we score, so this day's move reflects our rubric, not a change to the server

### 2026-07-30 (score 24, −18)

- [security regression] Malware scan: pass → unverified

### 2026-07-28 (score 42, 0)

- [functional regression] Security disclosure: unverified → fail

### 2026-07-27 (score 42)

First indexed and scored.

## MCP tools (7)

### `structure` (~266 tokens)

What is this system? Returns shape (Pipeline, Fork-Join, DAG, Star, Cycle, Tree, Complete, etc.), stages with roles, bridge nodes, cycles, parallelism, critical path, dominator tree, min-cuts, subsystems, interface nodes, actors (who does what, workload entropy), locations (where work happens, boundary crossings). Levers: node=X returns per-node centrality (betweenness, closeness, eigenvector) for a specific node. detect_findings=true flags named structural risks — unguarded-sink (sinks reachable via only pipeline actions, no JOIN/HUB gating), single-cut-path (source-sink pairs with only one vertex-disjoint path), multi-cut-path (paths with redundant defense, min-cut > 1). See server instructions for EN language syntax.

Input parameters:

- `detect_findings` (string): Set to 'true' to flag named structural findings. Possible values: unguarded-sink, single-cut-path, multi-cut-path.
- `node` (string): Node name. When provided, returns per-node centrality (betweenness, closeness, eigenvector) for this specific node instead of the overview.
- `source` (string, required): EN source code, or path to .en/.txt file

### `invariant` (~320 tokens)

What's always true — automatic findings and on-demand checks. Automatic outputs: conservationLaws (weighted entity sums constant across executions), sustainableCycles (T-invariants — action sequences returning to start state), depletableSets (entity groups whose simultaneous depletion is irreversible), behavioral.deficiency (0 means structure fully determines dynamics), behavioral.isReversible, behavioral.hasUniqueEquilibrium. On-demand via `rules`: encode domain-specific claims and verify them against the graph — this is how to check things the topology alone can't see (precedence, coverage, centrality bounds, resilience). See the rules parameter for supported sentence shapes.

Input parameters:

- `rules` (string): Custom structural rules, one per line. Four supported sentence shapes (regex-matched): (1) `no bridge that is also hub` — flags nodes that are both a bridge and a hub. (2) `every path from X to Y pas…
- `source` (string, required): EN source code, or path to .en/.txt file

### `live` (~107 tokens)

Can it deadlock? Can entities overflow? isStructurallyLive means every siphon contains a trap — no structural deadlock possible. uncoveredSiphons are entity groups that can drain permanently, with the actors and locations affected. isStructurallyBounded means no entity can accumulate without limit. unboundedCycles are action sequences that could cause overflow. See the server instructions for EN language syntax.

Input parameters:

- `source` (string, required): EN source code, or path to .en/.txt file

### `reachable` (~135 tokens)

Can X reach Y? Follows directed data flow first; falls back to undirected. `from` and `to` accept entity names or action names (resolved against the program). Path shows each step with actor and location. locationCrossings counts boundary transitions. defense_nodes checks if guards cover all paths; coverage.fullCoverage=false means unguarded routes exist. See the server instructions for EN language syntax.

Input parameters:

- `defense_nodes` (string): Comma-separated guard nodes to check coverage
- `from` (string, required): Starting node name
- `source` (string, required): EN source code
- `to` (string, required): Target node name

### `equivalent` (~282 tokens)

Are two systems the same, or what changes if I change this one? Compare mode (source_a + source_b): structural differences, edit distance, spectral equivalence. isCospectral=true means identical graph structure up to relabeling — topologically the same despite different names, actors, or locations. Evolve mode (source + patch): dry-run a change, shows diff plus new/lost bridge nodes. Patch has three directive types — plain EN statement adds an action; a line starting with `-` (and not containing `do:`) removes the named action; a statement whose action name matches an existing one replaces the original. See the server instructions for EN language syntax.

Input parameters:

- `patch` (string): EN patch for evolve mode. Three directive types: plain EN statement (`actor do: X needs: Y yields: Z at: W`) adds action X; a line starting with `-` (and not containing `do:`) removes the named actio…
- `source` (string): EN source code for evolve mode
- `source_a` (string): EN source code or path to .en/.txt file for the first system
- `source_b` (string): EN source code or path to .en/.txt file for the second system

### `compose` (~265 tokens)

How do parts combine, or how does a part stand alone? Merge mode (source_a + source_b + links): declare which entities in A are the same as entities in B; the combined graph is wired via string-equality of shared names. Extract mode (source + subsystem): pull a named subsystem out as standalone EN with boundary inputs/outputs, actors, and locations. Valid subsystem names come from structure's `subsystems` field — call structure on the source first to discover them. See the server instructions for EN language syntax.

Input parameters:

- `links` (string): Entity identifications, one per line. Format: `a.<entity name>=b.<entity name>` (A's entity is the same as B's entity). `#` starts a comment. Example: `a.user session=b.authenticated session`.
- `source` (string): EN source code for extract mode
- `source_a` (string): EN source code or path to .en/.txt file for the first system
- `source_b` (string): EN source code or path to .en/.txt file for the second system
- `subsystem` (string): Subsystem name to extract. Valid names come from structure's `subsystems` field — call structure on the source first to discover them.

### `render` (~432 tokens)

SVG or PNG diagram. Only call when user explicitly asks to visualize. The rendered image is delivered to the user, not injected into the model's context. See the server instructions for EN language syntax.

Input parameters:

- `color` (string): Seed color hex (#RRGGBB) to generate a custom theme. Overrides theme parameter. One color generates the entire palette.
- `direction` (string): Layout direction: LR (left-to-right) or TB (top-to-bottom). Default auto-detects from condensation DAG aspect ratio.
- `isDark` (string): true or false. Selects the dark or light variant of a named preset. If omitted, defaults to dark unless theme=light.
- `output` (string): File path to save the rendered image
- `quality` (string): Output quality: small, mid, or max
- `source` (string, required): EN source code, or path to .en/.txt file
- `structure_layers` (string): Bitmask for structure overlays. Bits: 1=subsystems, 2=pipelines, 4=cycles, 8=forks, 16=joins, 32=hubs, 64=deadlock, 128=overflow. Default 255 (all on). Pass 0 to hide all.
- `theme` (string): Color theme. Curated presets (each with light + dark variants; pair with `isDark`): `Editorial` (stone paper + rust focal, adapted from cathrynlavery/diagram-design), `Primer` (GitHub design system —…
- `type` (string): Output format: png (default) or svg. PNG is rasterized server-side via Batik.
- `view` (string): Group by: actors (partition by actor) or locations (partition by location). Default auto-detects topology.

## Diagnostics

Captured diagnostic sections: Provenance, Dependencies. The full working is on the page: https://verifymcp.io/servers/dushyant30suthar-endiagram-mcp/endiagram-mcp#diagnostics

## Score history

- 2026-08-03: 64
- 2026-08-02: 63
- 2026-08-01: 17
- 2026-07-31: 17
- 2026-07-30: 24
- 2026-07-28: 42
- 2026-07-27: 42

## Links

- npm package: https://www.npmjs.com/package/@endiagram/mcp
- Socket report: https://socket.dev/npm/package/@endiagram/mcp
- Repository: https://github.com/dushyant30suthar/endiagram-mcp
- Changelog RSS feed: https://verifymcp.io/servers/dushyant30suthar-endiagram-mcp/endiagram-mcp/changelog.xml
- Changelog JSON feed: https://verifymcp.io/servers/dushyant30suthar-endiagram-mcp/endiagram-mcp/changelog.json
- HTML version of this page: https://verifymcp.io/servers/dushyant30suthar-endiagram-mcp/endiagram-mcp