Skip to main content
Glama
projectcpu

project-cpu-mcp

by projectcpu
OverviewSchemaRelated ServersScoreDiscussions
TypeScript
Local

cpu_transport

Atomically move a resource from one of your cells to another along a waypoint chain, with transit fees and a time-delayed delivery that finalizes after arrival.

Instructions

Move a resource between cells along a waypoint chain of tokenIds, on-chain (needs a session — cpu_authenticate first). One atomic move: debits the source, pays the $CPU transit fee for every foreign Hub on the route (auto-approved once) plus gas, and escrows a time-delayed delivery. Source and target must be your own cells past their first completed reveal; the waypoints between them may be Virgin ground (no completed reveal, minted or not), cells of yours, or any cell with a finished Hub, foreign ones included. Each hop must be within radius(from)+radius(to)−1 grid steps, and radius is per cell: a plain cell reaches the move radius, a finished Hub the radius its own tier serves. Recommended flow: cpu_route_network (export the graph and plan over it) or cpu_next_hops (scout waypoints leg by leg) → chain them yourself → cpu_quote_transport (verify fee/ETA) → cpu_transport. Returns the deliveryId and arrival time; the goods credit to the target only after arrival, when you call cpu_finalize_delivery (cpu_list_my_transports shows what is ready). Every foreign finished Hub on the route charges its fee, one standing on ground with no completed reveal included; a route over only your own cells and bare Virgin ground pays none.

Input Schema

TableJSON Schema
NameRequiredDescriptionDefault
pathYesWaypoint chain of cell tokenIds [source, ...intermediate, target]. Source and target must be your own cells past their first completed reveal; every cell between them may be Virgin ground (no completed reveal, minted or not), a cell of yours, or any cell carrying a finished Hub, foreign ones included. Each hop must span at most radius(from)+radius(to)−1 grid steps, and radius is per cell: a plain cell reaches the move radius, a finished Hub the radius its own tier serves (cpu_get_game_config lists the radius of every Hub tier). Scout legal hops with cpu_next_hops and chain them yourself; the Transport contract validates.
amountYesUnits to move, as a positive integer string (matches on-map resource balances).
resourceIdYesResource type id to move (must have a balance at the source cell).

Schema Changelog

Changes observed during successful MCP inspections. Dates show when Glama detected each change.

  1. Changed2 schema fields changedv0.10.0
    • changedInput schema / properties / path / description
      Previous value: -"Waypoint chain of cell tokenIds [source, ...intermediate, target]. Every waypoint must be revealed and eligible (your own cell, or a Hub); each hop must span at most radius(from)+radius(to)−1 grid steps (a plain cell reaches moveRadius, a Hub hubRadius — see get_game_config transport). Scout legal hops with cpu_next_hops and chain them yourself; the Transport contract validates."New value: +"Waypoint chain of cell tokenIds [source, ...intermediate, target]. Source and target must be your own cells past their first completed reveal; every cell between them may be Virgin ground (no completed reveal, minted or not), a cell of yours, or any cell carrying a finished Hub, foreign ones included. Each hop must span at most radius(from)+radius(to)−1 grid steps, and radius is per cell: a plain cell reaches the move radius, a finished Hub the radius its own tier serves (cpu_get_game_config lists the radius of every Hub tier). Scout legal hops with cpu_next_hops and chain them yourself; the Transport contract validates."
    • changedInput schema / properties / path / items / maximum
      Previous value: -48990New value: +29150
  2. First observedv0.8.0

TDQS

A4.6/5.0
Behavior5/5

Does the description disclose side effects, auth requirements, rate limits, or destructive behavior?

With no annotations present, the description carries full responsibility and delivers thoroughly: it discloses the atomic debit, per-Hub transit fees, gas, escrowed delivery, delayed credit, return of deliveryId and arrival time, and the fee-free route condition. This gives an agent an accurate behavioral model.

Agents need to know what a tool does to the world before calling it. Descriptions should go beyond structured annotations to explain consequences.

Conciseness4/5

Is the description appropriately sized, front-loaded, and free of redundancy?

The description is dense but front-loaded with purpose and core constraints. It earns most of its length by covering prerequisites, radius rules, workflow, return value, and finalization. Minor redundancy remains: the foreign-Hub fee rule is stated at the beginning and again at the end, which slightly prevents a perfect score.

Shorter descriptions cost fewer tokens and are easier for agents to parse. Every sentence should earn its place.

Completeness5/5

Given the tool's complexity, does the description cover enough for an agent to succeed on first attempt?

This is a complex transactional tool with no output schema and no annotations, yet the description covers execution semantics, preconditions, route constraints, fees, return values, and follow-up actions. It even names the sibling for checking ready deliveries. Nothing essential for correct invocation is missing.

Complex tools with many parameters or behaviors need more documentation. Simple tools need less. This dimension scales expectations accordingly.

Parameters3/5

Does the description clarify parameter syntax, constraints, interactions, or defaults beyond what the schema provides?

Schema description coverage is 100%, so the baseline is 3. The description reinforces parameter meaning — path chain rules, amount as positive integer string, resourceId must have source balance — but does not add meaning beyond the detailed schema descriptions. The behavioral context it adds is more about the operation than the parameters themselves.

Input schemas describe structure but not intent. Descriptions should explain non-obvious parameter relationships and valid value ranges.

Purpose5/5

Does the description clearly state what the tool does and how it differs from similar tools?

The description opens with a specific verb-resource pair: 'Move a resource between cells along a waypoint chain of tokenIds, on-chain.' It clearly distinguishes this execution action from planning/estimation siblings like cpu_route_network, cpu_next_hops, and cpu_quote_transport by naming the recommended flow around them.

Agents choose between tools based on descriptions. A clear purpose with a specific verb and resource helps agents select the right tool.

Usage Guidelines5/5

Does the description explain when to use this tool, when not to, or what alternatives exist?

Provides an explicit workflow: plan with cpu_route_network/cpu_next_hops, quote with cpu_quote_transport, then call cpu_transport. It also states when not to expect immediate credit — finalize with cpu_finalize_delivery after arrival — and mentions the cpu_authenticate prerequisite.

Agents often have multiple tools that could apply. Explicit usage guidance like "use X instead of Y when Z" prevents misuse.

Install Server

Other Tools

Latest Blog Posts

MCP directory API

We provide all the information about MCP servers via our MCP API.

curl -X GET 'https://glama.ai/api/mcp/v1/servers/projectcpu/project-cpu-mcp'

If you have feedback or need assistance with the MCP directory API, please join our Discord server