Forge Pool

Appearance

Graph ​

graph@1 is the Forge Pool primitive family for graph-oriented execution.

It covers workloads where computation depends on nodes, edges, connectivity, expansion, path selection, graph scoring, or relationship propagation.

What graph@1 is For ​

Typical uses include:

  • pathfinding
  • route expansion
  • dependency analysis
  • graph traversal
  • connected component discovery
  • structural scoring
  • network propagation

Kernel Position ​

Like all primitive families, graph@1 executes through the canonical Kernel contract.

http
POST /api/v0/ops/execute

Graph execution remains governed by the same system-wide rules:

  • deterministic contract resolution
  • policy-aware execution planning
  • shardable runtime behavior where applicable
  • replayable outputs and artifacts

Example Identity ​

json
{
  "op": {
    "name": "graph",
    "version": 1,
    "profile": "traversal.v1"
  }
}

Expected Workload Shapes ​

Graph workloads may include:

  • node and edge sets
  • traversal constraints
  • scoring functions
  • source / target definitions
  • frontier expansion rules
  • output truncation or ranking policies

Why Graph Matters in the Kernel ​

Many real-world systems are graph-shaped even when they are described in business language.

Supply chains, identity systems, routing systems, dependencies, institution maps, knowledge networks, and retrieval flows all become clearer when modeled as graph execution.

graph@1 makes that computational class first-class inside the Planetary Kernel.