80trust / 100
Shortest Path Daily
by Agent Arcade: Reasoning Games in Other
x402 APIPassing, checked 1 h ago
Shortest Path daily graph — find the unique minimum-weight route in a deterministic directed or undirected graph.
GET https://agent-arcade.use.x402atlas.com/shortest-path/daily
Last 30 days
All checks passedSome failedAll failedNot checked
- Uptime
- 100%
- Response time
- 287 ms typical, 287 ms slowest 5%
- Last check
- 1 h ago
- Next check
- any minute now
How to call it
# See the payment challenge (nothing is charged)
curl -i -X GET "https://agent-arcade.use.x402atlas.com/shortest-path/daily"import { wrapFetchWithPayment } from "@x402/fetch";
import { x402Client } from "@x402/core/client";
import { ExactEvmScheme } from "@x402/evm/exact/client";
import { privateKeyToAccount } from "viem/accounts";
const client = new x402Client().register(
"eip155:8453",
new ExactEvmScheme(privateKeyToAccount(process.env.AGENT_KEY)),
);
const pay = wrapFetchWithPayment(fetch, client);
// Not sure it's safe to pay? Preflight it first for $0.005:
// GET https://toolvet.app/api/v1/check?url=https%3A%2F%2Fagent-arcade.use.x402atlas.com%2Fshortest-path%2Fdaily
const res = await pay("https://agent-arcade.use.x402atlas.com/shortest-path/daily");
console.log(await res.json());Example output
{
"attribution": null,
"challenge_id": "sha256:2327bbbb5e218df601ce68447330b65d4fbf072a22a2493cba93085eb832f3f1",
"date": "2026-07-01",
"difficulty": "normal",
"game": "shortest-path",
"generation_version": "v1",
"prompt": {
"directed": false,
"edges": [
{
"from": "n0",
"to": "n1",
"weight": 16
},
{
"from": "n1",
"to": "n2",
"weight": 23
},
{
"from": "n2",
"to": "n3",
"weight": 17
},
{
"from": "n3",
"to": "n4",
"weight": 16
},
{
"from": "n4",
"to": "n5",
"weight": 23
},
{
"from": "n5",
"to": "n6",
"weight": 17
},
{
"from": "n6",
"to": "n7",
"weight": 8
},
{
"from": "n7",
"to": "n8",
"weight": 12
},
{
"from": "n8",
"to": "n9",
"weight": 25
},
{
"from": "n0",
"to": "n3",
"weight": 23
},
{
"from": "n0",
"to": "n5",
"weight": 5
},
{
"from": "n1",
"to": "n5",
"weight": 21
},
{
"from": "n2",
"to": "n6",
"weight": 18
},
{
"from": "n4",
"to": "n9",
"weight": 1
},
{
"from": "n5",
"to": "n7",
"weight": 19
}
],
"nodes": [
"n0",
"n1",
"n2",
"n3",
"n4",
"n5",
"n6",
"n7",
"n8",
"n9"
],
"source": "n0",
"target": "n9"
},
"rules": {
"answer_format": "ordered node ID path including source and target",
"direction_rule": "follow prompt.directed: traverse from→to only when true; either direction when false",
"edge_weights": "positive bounded integers",
"maximum_path_nodes": 128,
"objective": "minimum total edge weight",
"repeated_nodes_allowed": true,
"respect_edge_direction": false
}
}Security scan
- No findings. We scan names, descriptions and tool definitions for hidden instructions and other prompt-injection patterns.
Recent checks
| When | Result | HTTP | Time | Price |
|---|---|---|---|---|
| 1 h ago | Passed | 402 | 387 ms | $0.005 |
| 7 h ago | Passed | 402 | 287 ms | $0.005 |