← The evidence ledger
Evidence row 3755882
Observed , by sync.agentic_market/1.
- Kind
- listing
- About
- source_record agentic_market:graph-algorithms-x402tookit-com
- Recorded
- Previous row
- #2189803
- Body SHA-256
- 4caef0db9af3f4045b1245be3f4e3e51ebc77e01a1fc5f3d2a5e81a55339647d
- Leaf
- 0x3d321c13913dcafd9fe3325d048d842dbf12b4b75bc7269705f37dff8feebc22
What was observed
{
"endpoints": [
[
"x402",
"https://graph-algorithms.x402tookit.com/all-pairs-shortest"
],
[
"x402",
"https://graph-algorithms.x402tookit.com/bellman-ford"
],
[
"x402",
"https://graph-algorithms.x402tookit.com/connected-components"
],
[
"x402",
"https://graph-algorithms.x402tookit.com/graph-stats"
],
[
"x402",
"https://graph-algorithms.x402tookit.com/minimum-spanning-tree"
],
[
"x402",
"https://graph-algorithms.x402tookit.com/shortest-path"
]
],
"name": "graph-algorithms.x402tookit.com",
"owner_address": null,
"raw": {
"caip2_networks": [
"eip155:137",
"eip155:42161",
"eip155:8453",
"solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"
],
"category": "",
"description": "",
"domain": "graph-algorithms.x402tookit.com",
"endpoints": [
{
"description": "Floyd-Warshall all-pairs shortest distances for up to 100 nodes; negative weights ok; detects negative cycles.",
"method": "GET",
"parameters": [
{
"default": null,
"description": "",
"enumValues": [],
"example": "1,2,3; 1,3,8; 1,5,-4; 2,4,1; 2,5,7; 3,2,4; 4,1,2; 4,3,-5; 5,4,6",
"group": "query",
"name": "edges",
"required": false,
"type": "string"
},
{
"default": null,
"description": "",
"enumValues": [],
"example": "3",
"group": "query",
"name": "from",
"required": false,
"type": "string"
},
{
"default": null,
"description": "",
"enumValues": [],
"example": "5",
"group": "query",
"name": "to",
"required": false,
"type": "string"
}
],
"pricing": {
"amount": "0.03",
"currency": "USDC",
"maxAmount": "",
"minAmount": "",
"network": "eip155:8453",
"scheme": "exact"
},
"providerName": "",
"quality": {
"l30DaysTotalCalls": "1",
"l30DaysUniquePayers": "1"
},
"serviceName": "Graph Algorithms",
"tags": [
"graph",
"floyd-warshall",
"all-pairs",
"shortest-path"
],
"url": "https://graph-algorithms.x402tookit.com/all-pairs-shortest"
},
{
"description": "Bellman-Ford shortest paths with negative weights; reports a negative cycle reachable from the source.",
"method": "GET",
"parameters": [
{
"default": null,
"description": "",
"enumValues": [],
"example": "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",
"group": "query",
"name": "edges",
"required": false,
"type": "string"
},
{
"default": null,
"description": "",
"enumValues": [],
"example": "s",
"group": "query",
"name": "source",
"required": false,
"type": "string"
},
{
"default": null,
"description": "",
"enumValues": [],
"example": "z",
"group": "query",
"name": "target",
"required": false,
"type": "string"
}
],
"pricing": {
"amount": "0.02",
"currency": "USDC",
"maxAmount": "",
"minAmount": "",
"network": "eip155:8453",
"scheme": "exact"
},
"providerName": "",
"quality": {
"l30DaysTotalCalls": "1",
"l30DaysUniquePayers": "1"
},
"serviceName": "Graph Algorithms",
"tags": [
"graph",
"bellman-ford",
"negative-weights",
"algorithm"
],
"url": "https://graph-algorithms.x402tookit.com/bellman-ford"
},
{
"description": "Connected components of an edge list; with directed=true also strongly connected components via Tarjan.",
"method": "GET",
"parameters": [
{
"default": null,
"description": "",
"enumValues": [],
"example": true,
"group": "query",
"name": "directed",
"required": false,
"type": "boolean"
},
{
"default": null,
"description": "",
"enumValues": [],
"example": "a,b; b,c; c,a; c,d; d,e; e,d",
"group": "query",
"name": "edges",
"required": false,
"type": "string"
}
],
"pricing": {
"amount": "0.02",
"currency": "USDC",
"maxAmount": "",
"minAmount": "",
"network": "eip155:8453",
"scheme": "exact"
},
"providerName": "",
"quality": {
"l30DaysTotalCalls": "1",
"l30DaysUniquePayers": "1"
},
"serviceName": "Graph Algorithms",
"tags": [
"graph",
"connected-components",
"tarjan",
"scc"
],
"url": "https://graph-algorithms.x402tookit.com/connected-components"
},
{
"description": "Graph statistics: degree sequence, density, bipartite check, tree or forest test, and diameter if connected.",
"method": "GET",
"parameters": [
{
"default": null,
"description": "",
"enumValues": [],
"example": "0,1; 1,2; 2,3; 3,4; 4,0; 0,5; 1,7; 2,9; 3,6; 4,8; 5,7; 7,9; 9,6; 6,8; 8,5",
"group": "query",
"name": "edges",
"required": false,
"type": "string"
}
],
"pricing": {
"amount": "0.02",
"currency": "USDC",
"maxAmount": "",
"minAmount": "",
"network": "eip155:8453",
"scheme": "exact"
},
"providerName": "",
"quality": {
"l30DaysTotalCalls": "1",
"l30DaysUniquePayers": "1"
},
"serviceName": "Graph Algorithms",
"tags": [
"graph",
"degree",
"bipartite",
"diameter"
],
"url": "https://graph-algorithms.x402tookit.com/graph-stats"
},
{
"description": "Kruskal minimum spanning tree of an undirected weighted edge list; returns a spanning forest if disconnected.",
"method": "GET",
"parameters": [
{
"default": null,
"description": "",
"enumValues": [],
"example": "a,b,4; a,h,8; b,c,8; b,h,11; c,d,7; c,f,4; c,i,2; d,e,9; d,f,14; e,f,10; f,g,2; g,h,1; g,i,6; h,i,7",
"group": "query",
"name": "edges",
"required": false,
"type": "string"
}
],
"pricing": {
"amount": "0.02",
"currency": "USDC",
"maxAmount": "",
"minAmount": "",
"network": "eip155:8453",
"scheme": "exact"
},
"providerName": "",
"quality": {
"l30DaysTotalCalls": "1",
"l30DaysUniquePayers": "1"
},
"serviceName": "Graph Algorithms",
"tags": [
"graph",
"kruskal",
"mst",
"algorithm"
],
"url": "https://graph-algorithms.x402tookit.com/minimum-spanning-tree"
},
{
"description": "Dijkstra shortest path and distances from a source on a weighted edge list; negative weights point to /bellman-ford.",
"method": "GET",
"parameters": [
{
"default": null,
"description": "",
"enumValues": [],
"example": "s,t,10; s,y,5; t,x,1; t,y,2; y,t,3; y,x,9; y,z,2; x,z,4; z,x,6; z,s,7",
"group": "query",
"name": "edges",
"required": false,
"type": "string"
},
{
"default": null,
"description": "",
"enumValues": [],
"example": "s",
"group": "query",
"name": "source",
"required": false,
"type": "string"
},
{
"default": null,
"description": "",
"enumValues": [],
"example": "x",
"group": "query",
"name": "target",
"required": false,
"type": "string"
}
],
"pricing": {
"amount": "0.02",
"currency": "USDC",
"maxAmount": "",
"minAmount": "",
"network": "eip155:8453",
"scheme": "exact"
},
"providerName": "",
"quality": {
"l30DaysTotalCalls": "1",
"l30DaysUniquePayers": "1"
},
"serviceName": "Graph Algorithms",
"tags": [
"graph",
"dijkstra",
"shortest-path",
"algorithm"
],
"url": "https://graph-algorithms.x402tookit.com/shortest-path"
}
],
"enriched": false,
"iconUrl": "",
"id": "graph-algorithms-x402tookit-com",
"integrationType": "",
"isNew": false,
"name": "graph-algorithms.x402tookit.com",
"networks": [
"Base",
"eip155:137",
"eip155:42161",
"solana:5eykt4usfv8p8njdtrepy1vzqkqzkvdp"
],
"priceSummary": {
"avgCostBasis": "exact",
"avgCostPerTransaction": "0.021667",
"currency": "USDC",
"maxAmount": "0.03",
"minAmount": "0.02"
},
"provider": "graph-algorithms.x402tookit.com",
"providerUrl": "",
"serviceName": "Graph Algorithms",
"tags": [
"graph",
"floyd-warshall",
"all-pairs",
"shortest-path",
"bellman-ford",
"negative-weights",
"algorithm",
"connected-components",
"tarjan",
"scc",
"degree",
"bipartite",
"diameter",
"kruskal",
"mst",
"dijkstra"
]
},
"source": "agentic_market",
"summary": ""
}What the leaf hashes
{"body":"4caef0db9af3f4045b1245be3f4e3e51ebc77e01a1fc5f3d2a5e81a55339647d","id":3755882,"kind":"listing","method":"sync.agentic_market/1","observed_us":1793989724821830,"prev":2189803,"subject":"agentic_market:graph-algorithms-x402tookit-com","subject_kind":"source_record"}Proof
Fold these into the leaf in order, hashing each sorted pair with keccak256, to reach the root of (303443 rows).
- 0x3d323b4530635ac00c3d106eda8cde72094d673f02ad51a971052c64b3d60cfe
- 0x29088e46233a0fd44852532e776c2e64c384a0f3035dc78f91a647f60c56dea8
- 0x6311be5e95944f596acccba73fd636d957b9835ee75eeae8cd503464beaa2521
- 0x5fb40d9103671d9d012f29cc9b946095ff220d89fb725c3315bec59f5e377624
- 0x11a5ce364c436f0df8d97342c83b0c3e42f57e9515ff42572fd4993f0bc13b15
- 0xd94872dc36a0c9a050deffa5f21b2070420a2c6bc29a752c6ea468fd0c228c38
- 0x600d1abcf8a7bf9c04e00aa9cd0d9f98ee5d2548dea29b0b402305f7a86ee8dd
- 0xbe0dde7572aead1962885fdee4097389ce3cef3b2345ce3e35a6bccc11caecbd
- 0x11e0959f21b29704721f3228db80ca55b1e592bd3719a3740b1040820c6eb460
- 0xd38866862ce365f8f55b16471367e576245e695dd177fceeb06468e6c3b3ac8b
- 0x4e6088a61a3ae9b3cfdb45638d2fa860f77bd19f17e96b3bc95d035830cb9239
- 0x5288a9334eb4b29f21a51190969364cb32784154601a126e1d9e8b4e405c6ac9
- 0x59bd144c9e7342b3df8e59fc9509435c9555450984e97fefbfc08702bdaf57a5
- 0x0391cd09482a72b233cbeae67d3b018b52668bdda462ad6890dcef531af5784b
- 0x3e5703f087c9966ff9f302cea33450db9f9fde7cafb8269b22ded1b2a3da03b0
- 0xdfedd18f60be5438b67a88cd42d31ead60bf5dbfc8d726e3d83be13474b3bd3f
- 0x4a618d78b1cebba8beec4ef22aaac9187dcdfb39064e0be537ca2600abb90740
- 0x119743aadcddb571b28b442b62196d4a0afc4e1c9979c2d477d34fcc9413deaf
- 0xc0d08d48601d1be90bcfc025e66bcaa0030120d688dd9c919b36c2c4446f4948
- Day root
- 0xb30ccefe7182c6f767e1fcbfb5f64ffd649da831f665f65c5ff39cd40512284f
- Chained
- 0xc383f7ef68d2914082484765aa09e42c12c59a74a096ae64127c562618c506d3
- Published
- On Arc Testnet, block 71111178: 0xfba13cb7ee4ada7f2fee3702a786a2201596be2ffea37dfc281ab4c8e9942fe1