Skip to main content
Glama

cpu_quote_transport

Preview a transport route without committing: get the actual $CPU fee with discount applied, distance, arrival time, and validation of all hops, waypoints, endpoints, and destination capacity.

Instructions

Preview a transport route (a waypoint chain of tokenIds) without committing: returns fee — the actual $CPU (decimal) you will pay across foreign hubs — and discount, the same-clan member saving already applied (the nominal fee equals fee + discount), plus the summed grid distance and the arrival timestamp. Read-only on-chain view with no side effects. It also validates the chain and names the rejection reason: a hop longer than radius(from)+radius(to)−1 grid steps, an ineligible waypoint (foreign land past its first completed reveal carrying no finished Hub — Virgin ground and foreign finished Hubs are passage, not obstacles), or endpoints that are not your own cells past their first completed reveal, or a destination with no room once liquid, reserved and pending production are counted. A successful quote validates route mechanics and economics at quote time, destination capacity included; it reserves no room and does not promise the later cpu_transport will succeed — ownership, balances, capacity, pauses, allowances and live state can still change before the send. Plan the chain with cpu_route_network when you have a code runner and with cpu_next_hops when you do not; use this before cpu_transport.

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.9/5.0
Behavior5/5

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

No annotations are provided, so the description carries the full burden and succeeds: it declares 'Read-only on-chain view with no side effects,' states it 'reserves no room,' and enumerates concrete rejection conditions (hop-length bounds, ineligible waypoints, endpoint ownership, destination capacity counting liquid/reserved/pending production). It also warns that ownership, balances, capacity, pauses, allowances and live state can change before the send — exactly the caveat an agent needs before relying on a quote.

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

Conciseness5/5

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

Long (~220 words) but front-loaded: the preview-without-commit purpose and return values come first, followed by safety, rejection logic, caveats, and sibling routing in order of descending importance. Every sentence earns its place — there is no filler or restatement of schema content, and the minor redundancy between 'without committing' and 'no side effects' reinforces rather than bloats.

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?

Given no annotations and no output schema, the description fully compensates: it explains the return payload (fee, discount, summed grid distance, arrival timestamp), defines the fee/discount identity, names every rejection category, and clarifies the limited force of a successful quote. Nothing an agent needs to decide whether and how to call the tool is missing.

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

Parameters4/5

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

The schema already documents all three parameters at 100% coverage, so the baseline is 3. The description raises it by adding validation semantics that deepen the path parameter's meaning: Virgin ground and foreign finished Hubs are passage rather than obstacles, destination room counts liquid/reserved/pending production, and the fee/discount relationship clarifies what amount implies economically. No contradiction with the schema.

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?

States a specific verb and resource: 'Preview a transport route (a waypoint chain of tokenIds) without committing,' then lists the concrete return payload (fee, discount, grid distance, arrival timestamp). It distinguishes itself from siblings by contrasting with cpu_transport (which commits) and explicitly naming the planning tools cpu_route_network and cpu_next_hops, so an agent can tell them apart without opening schemas.

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?

Explicitly routes between alternatives: 'Plan the chain with cpu_route_network when you have a code runner and with cpu_next_hops when you do not; use this before cpu_transport.' It also gives a when-not-to-trust boundary by stating the quote reserves no room and does not promise the later cpu_transport will succeed, preventing the agent from treating a successful quote as a guarantee of execution.

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

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