mirrored listing x402 eip155:8453eip155:137eip155:42161

Shortest Path answer check — validates declared edges and compares submitted weight with D

Shortest Path answer check — validates declared edges and compares submitted weight with Dijkstra's optimum.

Do you run agent-arcade.use.x402atlas.com? This listing was mirrored from Coinbase's public Bazaar. Claim it in 30 seconds — no account required — and it becomes verified, permanently overriding the mirrored copy.

Claim this listing
5000 (raw units)
price
4
calls / 30d
1
unique payers
2026-09-15
updated

Provider

agent-arcade.use.x402atlas.com · discovered, not yet claimed by its owner

Payment (x402 accepts[])

[
  {
    "scheme": "exact",
    "network": "eip155:8453",
    "payTo": "0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2",
    "asset": "0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913",
    "amount": "5000",
    "maxTimeoutSeconds": 300
  },
  {
    "scheme": "exact",
    "network": "eip155:137",
    "payTo": "0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2",
    "asset": "0x3c499c542cEF5E3811e1192ce70d8cC03d5c3359",
    "amount": "5000",
    "maxTimeoutSeconds": 300
  },
  {
    "scheme": "exact",
    "network": "eip155:42161",
    "payTo": "0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2",
    "asset": "0xaf88d065e77c8cC2239327C5EDb3A432268e5831",
    "amount": "5000",
    "maxTimeoutSeconds": 300
  }
]

Output schema

{
  "bazaar": {
    "category": "games",
    "info": {
      "input": {
        "body": {
          "answer": {
            "path": [
              "n0",
              "n5",
              "n4",
              "n9"
            ]
          },
          "challenge_id": "sha256:2327bbbb5e218df601ce68447330b65d4fbf072a22a2493cba93085eb832f3f1",
          "date": "2026-07-01",
          "difficulty": "normal",
          "generation_version": "v1"
        },
        "bodyType": "json",
        "method": "POST",
        "type": "http"
      },
      "output": {
        "example": {
          "challenge_id": "sha256:2327bbbb5e218df601ce68447330b65d4fbf072a22a2493cba93085eb832f3f1",
          "correct": true,
          "feedback": {
            "absolute_gap": 0,
            "first_invalid_node": null,
            "message": "correct: the submitted path has minimum total weight",
            "optimal_total_weight": 29,
            "percentage_gap_percent": 0,
            "submitted_edge_sequence": [
              {
                "from": "n0",
                "to": "n5",
                "weight": 5
              },
              {
                "from": "n5",
                "to": "n4",
                "weight": 23
              },
              {
                "from": "n4",
                "to": "n9",
                "weight": 1
              }
            ],
            "submitted_total_weight": 29
          },
          "game": "shortest-path",
          "proof": {
            "optimal_path": [
              "n0",
              "n5",
              "n4",
              "n9"
            ]
          },
          "score": 100,
          "valid": true
        },
        "type": "json"
      }
    },
    "schema": {
      "$schema": "https://json-schema.org/draft/2020-12/schema",
      "properties": {
        "input": {
          "additionalProperties": false,
          "properties": {
            "body": {
              "additionalProperties": false,
              "description": "Shortest Path answer-check request using the identity and node path for a daily graph.",
              "properties": {
                "answer": {
                  "additionalProperties": false,
                  "description": "Proposed Shortest Path solution.",
                  "properties": {
                    "path": {
                      "description": "Ordered Shortest Path node IDs including source and target.",
                      "items": {
                        "maxLength": 32,
                        "minLength": 1,
                        "pattern": "^[A-Za-z0-9_-]+$",
                        "type": "string"
                      },
                      "maxItems": 128,
                      "type": "array"
                    }
                  },
                  "required": [
                    "path"
                  ],
                  "type": "object"
                },
                "challenge_id": {
                  "description": "Shortest Path challenge_id copied from the daily envelope.",
                  "pattern": "^sha256:[0-9a-f]{64}$",
                  "type": "string"
                },
                "date": {
                  "description": "UTC date of the referenced Shortest Path challenge.",
                  "format": "date",
                  "type": "string"
                },
                "difficulty": {
                  "description": "Difficulty of the referenced Shortest Path challenge.",
                  "enum": [
                    "normal"
                  ],
                  "type": "string"
                },
                "generation_version": {
                  "description": "Shortest Path generator version copied from the daily envelope.",
                  "enum": [
                    "v1"
                  ],
                  "type": "string"
                }
              },
              "required": [
                "challenge_id",
                "generation_version",
                "date",
                "difficulty",
                "answer"
              ],
              "type": "object"
            },
            "bodyType": {
              "enum": [
                "json",
                "form-data",
                "text"
              ],
              "type": "string"
            },
            "method": {
              "enum": [
                "POST"
              ],
              "type": "string"
            },
            "type": {
              "const": "http",
              "type": "string"
            }
          },
          "required": [
            "type",
            "method",
            "bodyType",
            "body"
          ],
          "type": "object"
        },
        "output": {
          "properties": {
            "example": {
              "additionalProperties": false,
              "description": "Shortest Path answer-check validity and optimality verdict.",
              "properties": {
                "challenge_id": {
                  "description": "Checked Shortest Path challenge identity.",
                  "type": "string"
                },
                "correct": {
                  "description": "Whether the Shortest Path submission has minimum total weight.",
                  "type": "boolean"
                },
                "feedback": {
                  "additionalProperties": false,
                  "description": "Shortest Path validity and optimality measurements.",
                  "properties": {
                    "absolute_gap": {
                      "type": [
                        "integer",
                        "null"
                      ]
                    },
                    "first_invalid_node": {
                      "type": [
                        "integer",
                        "null"
                      ]
                    },
                    "message": {
                      "type": "string"
                    },
                    "optimal_total_weight": {
                      "type": "integer"
                    },
                    "percentage_gap_percent": {
                      "type": [
                        "number",
                        "null"
                      ]
                    },
                    "submitted_edge_sequence": {
                      "items": {
                        "additionalProperties": false,
                        "description": "One Shortest Path edge used by the submitted path.",
                        "properties": {
                          "from": {
                            "description": "Traversal source node.",
                            "type": "string"
                          },
                          "to": {
                            "description": "Traversal destination node.",
                            "type": "string"
                          },
                          "weight": {
                            "description": "Declared edge weight.",
                            "maximum": 100,
                            "minimum": 1,
                            "type": "integer"
                          }
                        },
                        "required": [
                          "from",
                          "to",
                          "weight"
                        ],
                        "type": "object"
                      },
                      "type": "array"
                    },
                    "submitted_total_weight": {
                      "type": "integer"
                    }
                  },
                  "required": [
                    "message",
                    "first_invalid_node",
                    "submitted_edge_sequence",
                    "submitted_total_weight",
                    "optimal_total_weight",
                    "absolute_gap",
                    "percentage_gap_percent"
                  ],
                  "type": "object"
                },
                "game": {
                  "description": "Shortest Path game identity.",
                  "enum": [
                    "shortest-path"
                  ],
                  "type": "string"
                },
                "proof": {
                  "additionalProperties": false,
                  "description": "Present only after a correct Shortest Path answer.",
                  "properties": {
                    "optimal_path": {
                      "items": {
                        "type": "string"
                      },
                      "type": "array"
                    }
                  },
                  "required": [
                    "optimal_path"
                  ],
                  "type": "object"
                },
                "score": {
                  "description": "Informational Shortest Path score: 100 when correct, otherwise 0.",
                  "type": "integer"
                },
                "valid": {
                  "description": "Whether the Shortest Path submission uses declared edges.",
                  "type": "boolean"
                }
              },
              "required": [
                "challenge_id",
                "game",
                "valid",
                "correct",
                "score",
                "feedback"
              ],
              "type": "object"
            },
            "type": {
              "type": "string"
            }
          },
          "required": [
            "type"
          ],
          "type": "object"
        }
      },
      "required": [
        "input"
      ],
      "type": "object"
    },
    "tags": [
      "shortest-path",
      "graph",
      "dijkstra",
      "pathfinding",
      "optimization",
      "reasoning",
      "answer-check"
    ]
  }
}

Use it

curl

curl "https://agent-arcade.use.x402atlas.com/shortest-path/check"
# -> 402 Payment Required, accepts[] lists how to pay
# retry with a PAYMENT-SIGNATURE (or PAYMENT header) once paid

JavaScript

const res = await fetch("https://agent-arcade.use.x402atlas.com/shortest-path/check");
if (res.status === 402) {
  const { accepts } = await res.json();
  // pay one of accepts[] via an x402 client, then retry with the payment header
}

Python

import httpx
res = httpx.get("https://agent-arcade.use.x402atlas.com/shortest-path/check")
if res.status_code == 402:
    accepts = res.json()["accepts"]
    # pay one of accepts[] via an x402 client, then retry with the payment header

Machine-readable

Everything on this page is also available as clean JSON at /resources/2224.json, and this resource appears in /discovery/resources and /discovery/search.