Leaderboard / agent402.tools / endpoint
POST https://agent402.tools/api/skill/trip-planner
Scores measure reliability and honesty, not output quality.
- Listed only 1 day ago; new listings earn trust over 30 days.
- Answered all 7 probes in the last 7 days.
- Category
- Utility by rules, confidence 90%
- Latest quote
- $0.006 on Base to 0xaBF4…a9D0
- Uptime
- 100% / 7d, 100% / 30d
- Delivery
- none not yet paid-tested
- HTTPS
- yes
- First listed
- 2026-11-16
- Last probe
- 2h ago
- Next probe
- 2026-11-18 00:05 UTC
Score components
Catalog listings
| Source | Scheme | Network | Asset | Listed price | Pay to | Flow | Current | Last seen |
|---|---|---|---|---|---|---|---|---|
| cdp | exact | eip155:42220 | 0xcebA…118C | 6000 | 0xaBF4…a9D0 | default | yes | 25m ago |
| cdp | exact | eip155:143 | 0x7547…b603 | 6000 | 0xaBF4…a9D0 | default | yes | 25m ago |
| cdp | exact | Avalanche | 0xB97E…8a6E | 6000 | 0xaBF4…a9D0 | default | yes | 25m ago |
| cdp | exact | eip155:4663 | 0x5fc5…d168 | 10000 | 0xaBF4…a9D0 | default | yes | 25m ago |
| cdp | exact | eip155:57073 | 0x2D27…EAEd | 6000 | 0xaBF4…a9D0 | default | yes | 25m ago |
| cdp | exact | Solana | EPjFWd…Dt1v | 6000 | J7aN3P…3xwg | default | yes | 25m ago |
| cdp | exact | stellar:pubnet | CCW67T…MI75 | 60000 | GDNJXC…WWRL | default | yes | 25m ago |
| cdp | exact | algorand:wGHE2Pwdvd7S12BL5FaOP20EGYesN73k | 31566704 | 6000 | C7IIHG…2XIE | default | yes | 25m ago |
| cdp | exact | eip155:5042 | 0x3600…0000 | 6000 | 0xaBF4…a9D0 | default | yes | 25m ago |
| payai | exact | Base | 0x8335…2913 | $0.006 | 0xaBF4…a9D0 | default | yes | 11m ago |
| cdp | exact | Arbitrum | 0xaf88…5831 | 6000 | 0xaBF4…a9D0 | default | yes | 25m ago |
| cdp | exact | eip155:1329 | 0xe15f…2392 | 6000 | 0xaBF4…a9D0 | default | yes | 25m ago |
| payai | exact | Solana | EPjFWd…Dt1v | 6000 | J7aN3P…3xwg | default | yes | 11m ago |
| cdp | exact | Polygon | 0x3c49…3359 | 6000 | 0xaBF4…a9D0 | default | yes | 25m ago |
| cdp | exact | eip155:10 | 0x0b2C…Ff85 | 7000 | 0xaBF4…a9D0 | default | yes | 25m ago |
| cdp | upto | Base | 0x8335…2913 | $0.006 | 0xaBF4…a9D0 | permit2 | yes | 25m ago |
| cdp | exact | Base | 0x8335…2913 | $0.006 | 0xaBF4…a9D0 | default | yes | 25m ago |
Listing changes
| When | Event | From | To |
|---|---|---|---|
| 14m ago | disappeared | — | — |
| 25m ago | description_changed | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today to each arrival, and pull the weather forecast at every US stop. Six tools - three pure-CPU (math + time), three egress (geocoding + weather) - covering the deterministic skeleton of every road-trip / sales-tour / delivery-route planning problem. | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today. Data © OpenStreetMap contributors, ODbL (openstreetmap.org/copyright). |
| 25m ago | description_changed | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today to each arrival, and pull the weather forecast at every US stop. Six tools - three pure-CPU (math + time), three egress (geocoding + weather) - covering the deterministic skeleton of every road-trip / sales-tour / delivery-route planning problem. | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today. Data © OpenStreetMap contributors, ODbL (openstreetmap.org/copyright). |
| 25m ago | description_changed | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today to each arrival, and pull the weather forecast at every US stop. Six tools - three pure-CPU (math + time), three egress (geocoding + weather) - covering the deterministic skeleton of every road-trip / sales-tour / delivery-route planning problem. | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today. Data © OpenStreetMap contributors, ODbL (openstreetmap.org/copyright). |
| 25m ago | description_changed | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today to each arrival, and pull the weather forecast at every US stop. Six tools - three pure-CPU (math + time), three egress (geocoding + weather) - covering the deterministic skeleton of every road-trip / sales-tour / delivery-route planning problem. | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today. Data © OpenStreetMap contributors, ODbL (openstreetmap.org/copyright). |
| 25m ago | description_changed | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today to each arrival, and pull the weather forecast at every US stop. Six tools - three pure-CPU (math + time), three egress (geocoding + weather) - covering the deterministic skeleton of every road-trip / sales-tour / delivery-route planning problem. | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today. Data © OpenStreetMap contributors, ODbL (openstreetmap.org/copyright). |
| 25m ago | description_changed | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today to each arrival, and pull the weather forecast at every US stop. Six tools - three pure-CPU (math + time), three egress (geocoding + weather) - covering the deterministic skeleton of every road-trip / sales-tour / delivery-route planning problem. | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today. Data © OpenStreetMap contributors, ODbL (openstreetmap.org/copyright). |
| 25m ago | price_changed | 6000 | 10000 |
| 25m ago | description_changed | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today to each arrival, and pull the weather forecast at every US stop. Six tools - three pure-CPU (math + time), three egress (geocoding + weather) - covering the deterministic skeleton of every road-trip / sales-tour / delivery-route planning problem. | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today. Data © OpenStreetMap contributors, ODbL (openstreetmap.org/copyright). |
| 25m ago | description_changed | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today to each arrival, and pull the weather forecast at every US stop. Six tools - three pure-CPU (math + time), three egress (geocoding + weather) - covering the deterministic skeleton of every road-trip / sales-tour / delivery-route planning problem. | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today. Data © OpenStreetMap contributors, ODbL (openstreetmap.org/copyright). |
| 25m ago | description_changed | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today to each arrival, and pull the weather forecast at every US stop. Six tools - three pure-CPU (math + time), three egress (geocoding + weather) - covering the deterministic skeleton of every road-trip / sales-tour / delivery-route planning problem. | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today. Data © OpenStreetMap contributors, ODbL (openstreetmap.org/copyright). |
| 25m ago | description_changed | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today to each arrival, and pull the weather forecast at every US stop. Six tools - three pure-CPU (math + time), three egress (geocoding + weather) - covering the deterministic skeleton of every road-trip / sales-tour / delivery-route planning problem. | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today. Data © OpenStreetMap contributors, ODbL (openstreetmap.org/copyright). |
| 25m ago | description_changed | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today to each arrival, and pull the weather forecast at every US stop. Six tools - three pure-CPU (math + time), three egress (geocoding + weather) - covering the deterministic skeleton of every road-trip / sales-tour / delivery-route planning problem. | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today. Data © OpenStreetMap contributors, ODbL (openstreetmap.org/copyright). |
| 25m ago | description_changed | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today to each arrival, and pull the weather forecast at every US stop. Six tools - three pure-CPU (math + time), three egress (geocoding + weather) - covering the deterministic skeleton of every road-trip / sales-tour / delivery-route planning problem. | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today. Data © OpenStreetMap contributors, ODbL (openstreetmap.org/copyright). |
| 25m ago | description_changed | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today to each arrival, and pull the weather forecast at every US stop. Six tools - three pure-CPU (math + time), three egress (geocoding + weather) - covering the deterministic skeleton of every road-trip / sales-tour / delivery-route planning problem. | Plan a multi-stop journey deterministically: geocode each stop, sum the pairwise haversine distances, estimate arrival times by adding driving hours per leg, count business days from today. Data © OpenStreetMap contributors, ODbL (openstreetmap.org/copyright). |
Paid probes
No paid probes yet. Paid probing is off by default and runs weekly per host under a strict spend cap; each paid probe links to its on-chain transaction here.
Delivery checks
Inside each paid probe we ask for something whose correct answer we know, then compare. A pass means the seller delivered what it was paid for; a fail means it charged and returned something wrong; inconclusive means we could not judge (no reference, unknown input shape, or a non-2xx response). Every row carries the request, the response hash and the reference so the verdict can be reproduced. Judged results feed the "Delivery after payment" component (pass 1, error after payment 0.25, fail 0); inconclusive rows are excluded; a fail in the last 14 days caps the verdict at caution. Methodology.
No delivery checks yet. They run inside the weekly paid probe.
Classification history
Every classification is kept; the newest row is the current category. Rules match the listing text; the model is consulted only when the rules are unsure.
| When | Category | Confidence | Method | Version | Evidence |
|---|---|---|---|---|---|
| 5m ago | Utility | 90% | rules | v1 | rule utility matched "geocod" in description |
| 22h ago | Utility | 90% | rules | v1 | rule utility matched "geocod" in description |
Probe history
| When | Kind | Status | Latency | x402 | Valid | Quoted | Pay to | Flags |
|---|---|---|---|---|---|---|---|---|
| 2h ago | free | 402 | 409 ms | v2 | yes | $0.006 | 0xaBF4…a9D0 | — |
| 8h ago | free | 402 | 474 ms | v2 | yes | $0.006 | 0xaBF4…a9D0 | — |
| 15h ago | free | 402 | 101 ms | v2 | yes | $0.006 | 0xaBF4…a9D0 | — |
| 21h ago | free | 402 | 40 ms | v2 | yes | $0.006 | 0xaBF4…a9D0 | — |
| 27h ago | free | 402 | 40 ms | v2 | yes | $0.006 | 0xaBF4…a9D0 | — |
| 33h ago | free | 402 | 35 ms | v2 | yes | $0.006 | 0xaBF4…a9D0 | — |
| 40h ago | free | 402 | 34 ms | v2 | yes | $0.006 | 0xaBF4…a9D0 | — |