← The evidence ledger
Evidence row 2201770
Observed , by sync.x402_bazaar/1.
- Kind
- listing
- About
- source_record x402_bazaar:https://graph-algorithms.x402tookit.com/bellman-ford
- Recorded
- Previous row
- None: the first of its kind about this subject
- Body SHA-256
- 6d2742dc5957670c441908d29736a29e73e8923f8c65755b82f92a8600de337e
- Leaf
- 0xa1b51b967ec811c040d2362ab7e131b8c8e86c21e767b3abedf58cbea3546e0a
What was observed
{
"endpoints": [
[
"x402",
"https://graph-algorithms.x402tookit.com/bellman-ford"
]
],
"name": "Graph Algorithms",
"owner_address": "0xb531320805c5bed1d46aeadcf4f008fdf172dbda",
"raw": {
"accepts": [
{
"amount": "20000",
"asset": "0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913",
"extra": {
"name": "USD Coin",
"version": "2"
},
"maxTimeoutSeconds": 300,
"network": "eip155:8453",
"payTo": "0xb531320805C5BED1D46AEaDcF4F008FDF172DBDa",
"scheme": "exact"
},
{
"amount": "20000",
"asset": "EPjFWdd5AufqSSqeM2qN1xzybapC8G4wEGGkZwyTDt1v",
"extra": {
"feePayer": "D6ZhtNQ5nT9ZnTHUbqXZsTx5MH2rPFiBBggX4hY1WePM",
"transactionVersions": [
0
]
},
"maxTimeoutSeconds": 300,
"network": "solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp",
"payTo": "DUPiupXtuox38dcGoXUKer5mAydCzmaHjrbQ66qeEm8s",
"scheme": "exact"
},
{
"amount": "20000",
"asset": "0x3c499c542cEF5E3811e1192ce70d8cC03d5c3359",
"extra": {
"name": "USD Coin",
"version": "2"
},
"maxTimeoutSeconds": 300,
"network": "eip155:137",
"payTo": "0xb531320805C5BED1D46AEaDcF4F008FDF172DBDa",
"scheme": "exact"
},
{
"amount": "20000",
"asset": "0xaf88d065e77c8cC2239327C5EDb3A432268e5831",
"extra": {
"name": "USD Coin",
"version": "2"
},
"maxTimeoutSeconds": 300,
"network": "eip155:42161",
"payTo": "0xb531320805C5BED1D46AEaDcF4F008FDF172DBDa",
"scheme": "exact"
}
],
"description": "Bellman-Ford shortest paths with negative weights; reports a negative cycle reachable from the source.",
"extensions": {
"bazaar": {
"info": {
"input": {
"method": "GET",
"queryParams": {
"edges": "s,t,6; s,y,7; t,x,5; t,y,8; t,z,-4; x,t,-2; y,x,-3; y,z,9; z,x,7; z,s,2",
"source": "s",
"target": "z"
},
"type": "http"
},
"output": {
"example": {
"asOf": "2026-10-21T01:36:13.708Z",
"degraded": false,
"directed": true,
"disclaimer": "Screening signal computed from the named public source. Not financial, legal or investment advice; provided as is. Verify at the source before acting.",
"distance": -2,
"distances": {
"s": 0,
"t": 2,
"x": 4,
"y": 7,
"z": -2
},
"edgeCount": 10,
"hops": 4,
"negativeCycle": null,
"nodeCount": 5,
"notChecked": [
"graphs over 200 nodes or 1000 edges (refused)",
"negative cycles NOT reachable from the source (they do not affect its distances and are not reported)"
],
"path": [
"s",
"y",
"…3 more"
],
"reasons": [
"No negative cycle is reachable from the source, so distances are well defined."
],
"source": "Bellman-Ford algorithm, computed locally (CLRS ch. 24.1)",
"startNode": "s",
"summary": "Shortest s to z is -2 via s > y > x > t > z.",
"target": "z",
"unreachable": [],
"verdict": "PATH_FOUND"
},
"type": "json"
}
},
"schema": {
"$schema": "https://json-schema.org/draft/2020-12/schema",
"properties": {
"input": {
"additionalProperties": false,
"properties": {
"method": {
"enum": [
"GET"
],
"type": "string"
},
"queryParams": {
"properties": {
"directed": {
"description": "true (default); with false any negative edge is itself a negative cycle",
"type": "boolean"
},
"edges": {
"description": "Edges separated by ; or newline, each 'from,to' or 'from,to,weight' (default weight 1), or a JSON array of [from,to,weight]; up to 200 nodes, 1000 edges, 60000 characters; node names 1-32 characters of letters, digits, _ . : + -",
"type": "string"
},
"nodes": {
"description": "Optional extra node names (comma or space separated) so isolated nodes are counted; the total still counts toward the 200-node cap",
"type": "string"
},
"source": {
"description": "Start node name; must appear in edges",
"type": "string"
},
"target": {
"description": "Optional end node; if given the path to it is returned",
"type": "string"
}
},
"required": [
"edges",
"source"
],
"type": "object"
},
"type": {
"const": "http",
"type": "string"
}
},
"required": [
"type",
"method"
],
"type": "object"
},
"output": {
"properties": {
"example": {
"properties": {
"asOf": {
"type": [
"null",
"string"
]
},
"degraded": {
"type": [
"boolean",
"null"
]
},
"directed": {
"type": [
"boolean",
"null"
]
},
"disclaimer": {
"type": [
"null",
"string"
]
},
"distance": {
"type": [
"null",
"number"
]
},
"distances": {
"properties": {
"s": {
"type": [
"null",
"number"
]
},
"t": {
"type": [
"null",
"number"
]
},
"x": {
"type": [
"null",
"number"
]
},
"y": {
"type": [
"null",
"number"
]
},
"z": {
"type": [
"null",
"number"
]
}
},
"type": [
"null",
"object"
]
},
"edgeCount": {
"type": [
"null",
"number"
]
},
"hops": {
"type": [
"null",
"number"
]
},
"negativeCycle": {},
"nodeCount": {
"type": [
"null",
"number"
]
},
"notChecked": {
"items": {
"type": "string"
},
"type": [
"array",
"null"
]
},
"path": {
"items": {
"type": "string"
},
"type": [
"array",
"null"
]
},
"reasons": {
"items": {
"type": "string"
},
"type": [
"array",
"null"
]
},
"source": {
"type": [
"null",
"string"
]
},
"startNode": {
"type": [
"null",
"string"
]
},
"summary": {
"type": [
"null",
"string"
]
},
"target": {
"type": [
"null",
"string"
]
},
"unreachable": {
"type": [
"array",
"null"
]
},
"verdict": {
"type": [
"null",
"string"
]
}
},
"type": "object"
},
"type": {
"type": "string"
}
},
"required": [
"type"
],
"type": "object"
}
},
"required": [
"input"
],
"type": "object"
}
}
},
"lastUpdated": "2026-11-01T23:26:50.184Z",
"quality": {
"l30DaysTotalCalls": 1,
"l30DaysUniquePayers": 1,
"lastCalledAt": "2026-11-01T23:26:50.025Z"
},
"resource": "https://graph-algorithms.x402tookit.com/bellman-ford",
"serviceName": "Graph Algorithms",
"tags": [
"graph",
"bellman-ford",
"negative-weights",
"algorithm"
],
"type": "http",
"x402Version": 2
},
"source": "x402_bazaar",
"summary": "Bellman-Ford shortest paths with negative weights; reports a negative cycle reachable from the source."
}What the leaf hashes
{"body":"6d2742dc5957670c441908d29736a29e73e8923f8c65755b82f92a8600de337e","id":2201770,"kind":"listing","method":"sync.x402_bazaar/1","observed_us":1793646808841313,"prev":null,"subject":"x402_bazaar:https://graph-algorithms.x402tookit.com/bellman-ford","subject_kind":"source_record"}Proof
Fold these into the leaf in order, hashing each sorted pair with keccak256, to reach the root of (444186 rows).
- 0xa1b4d9a9cb4f96696be4987b20682c585ae7e476e72348228a8c83bed1c42cc7
- 0xc78205b7c70618567f1c49692e2d6d71949211941ae1b115c2d0790660352174
- 0xe74fd845d074afa732ebe6c2cb281e4bf2e6c7e2282c9289d320eaae0386a3da
- 0x676af20c546fcfe9af88a9c3741e0ffb2971319894f5a5c1522527cd2168bf57
- 0x753fb504b83ca2f83502bf069fe0100b45e7f60b92120b5314d1dbd1f37bd49a
- 0xdcd5181e11f622dfd6311da5de5221abb9108e6160a8f62bac416f543f2ef231
- 0xb7178f233827b18d803d1cf3378472ff82722d70bb629584817aa7b553c6cc9d
- 0x4ba6079ad29c9708286b07759515a86ad140b13418b667c8401bc1940808a608
- 0xa88e06be93950f8b5b1216a005fb12df30e1d2feb736ba012e2116f06ba0a91e
- 0xa82a96f568e62be402a9228d12647353722cf91ef46de966a280ce8e05445731
- 0x6f9acc6b04be50d13cf7c3d84756813a7c409ddc4ad821bee277ee447409e7c0
- 0x521c6b8b7cc237cb9afeeb07debb739b49c1f394630b79cb24e75cbd2492c4e3
- 0x0503999a04120486c11b5e359e441fd5221b6b3e14bbdcfd7b1b4e8cbc5077ce
- 0x44d08992eb52b7db0b3504ba234d634742d61c21889da1eb00242ce07e97334b
- 0x7abf7290721a0b95be706db03c09de9df65bcba8e18ffe4616da43d9c31d6b0a
- 0x7731256c7406f95d30aabe3bbcb574b72535b9c28e8eb3db363210761a28a6b9
- 0x07ad80c0c234ecea379a2f4450dfd0804db049dbc62abe77af6306049ca6b6c2
- 0x98cbbf2c68ab4c0b4db782aeb88bea1f30b02178cf8b5d3d24a931d19492ea6d
- 0x252cce55f1a3d5391c16f82d7f62494429a5f69b03486d4cfcfb7b2c96d6c884
- Day root
- 0x78fecaabbe319e56f5c4b80fc02e2052e198ad24781da8832a475ff65f2002d1
- Chained
- 0xdc35957db5d1371ca382b9152878ffece28ec7c5cb4f98fd71ddb367f8b999b2
- Published
- On Arc Testnet, block 70432815: 0x56b814612eb2e3e544153df3e91e1f7199106d1e430c7d8c6b653feeb9ebe9af