Bounded Decision Solver
x402 Atlas provides real-time x402 analytics for autonomous APIs on Base. Track transactions, discover trends, and analyze the x402 ecosystem.
The wallet the 402 directs payment to. Its whole payment record — every payer, every chain — is on the merchant page.
Asset 0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913
The payTo wallet does not resolve to a registered ERC-8004 agent. That is not a verdict on the service — most of the catalog is unregistered.
Accepts
The payment requirements as published to the catalog. Read the live 402 before paying — a price here is a claim, not a quote.
Pay 0.005 USDC on Base to 0x8C12…Df1b2. The signed payment is good for 5 minutes.
- Paid to
- 0x8C12…Df1b2
- USD Coin contract
- 0x8335…02913
- Payment window
- 5 minutes
- As published
- 5000 smallest units
That figure is in the token’s smallest units. Roundhouse does not hold this contract’s decimals, so it is shown as published rather than converted.
- Paid to
- 0x8C12…Df1b2
- Token contract
- 0x3c49…c3359
- Payment window
- 5 minutes
That figure is in the token’s smallest units. Roundhouse does not hold this contract’s decimals, so it is shown as published rather than converted.
- Paid to
- 0x8C12…Df1b2
- Token contract
- 0xaf88…e5831
- Payment window
- 5 minutes
The catalog’s raw entry
[
{
"asset": "0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913",
"extra": {
"name": "USD Coin",
"tier": "standard",
"version": "2",
"merchant": "x402Atlas"
},
"payTo": "0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2",
"amount": "5000",
"scheme": "exact",
"network": "eip155:8453",
"maxTimeoutSeconds": 300
},
{
"asset": "0x3c499c542cEF5E3811e1192ce70d8cC03d5c3359",
"extra": {
"name": "USD Coin",
"tier": "standard",
"version": "2",
"merchant": "x402Atlas"
},
"payTo": "0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2",
"amount": "5000",
"scheme": "exact",
"network": "eip155:137",
"maxTimeoutSeconds": 300
},
{
"asset": "0xaf88d065e77c8cC2239327C5EDb3A432268e5831",
"extra": {
"name": "USD Coin",
"tier": "standard",
"version": "2",
"merchant": "x402Atlas"
},
"payTo": "0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2",
"amount": "5000",
"scheme": "exact",
"network": "eip155:42161",
"maxTimeoutSeconds": 300
}
]Extensions
{
"bazaar": {
"info": {
"input": {
"body": {
"items": [
{
"id": "camera",
"value": 4,
"weight": 3
},
{
"id": "battery",
"value": 5,
"weight": 4
},
{
"id": "tripod",
"value": 6,
"weight": 5
}
],
"capacity": 7
},
"type": "http",
"method": "POST",
"bodyType": "json"
},
"output": {
"type": "json",
"example": {
"optimal": true,
"evidence": {
"dp_items": 3,
"dp_capacity": 7,
"verification": "recompute the bounded dynamic program; the digest detects transcript drift but is not an optimality proof",
"optimality_proof": false,
"transcript_sha256": "ec9c54475ee83fff14d13c4bc4728d2d22b27125fcf88ed76782a0425e758ecf",
"transcript_encoding": "dpValue[0..capacity] as signed int64 two's-complement, 8-byte big-endian, no prefix"
},
"solution": {
"selected": [
{
"id": "camera",
"value": 4,
"weight": 3,
"original_index": 0
},
{
"id": "battery",
"value": 5,
"weight": 4,
"original_index": 1
}
],
"used_capacity": 7,
"remaining_capacity": 0
},
"warnings": [],
"objective": "maximum_total_value",
"operation": "knapsack",
"work_units": 24,
"objective_value": 9,
"algorithm_version": "knapsack-01-dp-v1"
}
}
},
"tags": [
"0-1-knapsack-solver",
"optimization",
"operations-research",
"bounded-computation",
"deterministic"
],
"schema": {
"type": "object",
"$schema": "https://json-schema.org/draft/2020-12/schema",
"required": [
"input"
],
"properties": {
"input": {
"type": "object",
"required": [
"type",
"method",
"bodyType",
"body"
],
"properties": {
"body": {
"type": "object",
"required": [
"capacity",
"items"
],
"properties": {
"items": {
"type": "array",
"items": {
"type": "object",
"required": [
"id",
"weight",
"value"
],
"properties": {
"id": {
"type": "string",
"pattern": "^[ -~]+$",
"maxLength": 64,
"minLength": 1,
"description": "Unique printable-ASCII item identifier"
},
"value": {
"type": "integer",
"maximum": 1000000000,
"minimum": 0,
"description": "Non-negative objective value"
},
"weight": {
"type": "integer",
"maximum": 1000000000,
"minimum": 1,
"description": "Positive item weight; items heavier than capacity remain valid but cannot be selected"
}
},
"description": "One 0/1 item selectable at most once",
"additionalProperties": false
},
"maxItems": 512,
"minItems": 1,
"description": "Unique-ID 0/1 items; each item is considered at most once"
},
"capacity": {
"type": "integer",
"maximum": 100000,
"minimum": 1,
"description": "Maximum total selected weight; item count times (capacity+1) must not exceed 2,000,000 work units"
}
},
"additionalProperties": false
},
"type": {
"type": "string",
"const": "http"
},
"method": {
"enum": [
"POST"
],
"type": "string"
},
"bodyType": {
"enum": [
"json",
"form-data",
"text"
],
"type": "string"
}
},
"additionalProperties": false
},
"output": {
"type": "object",
"required": [
"type"
],
"properties": {
"type": {
"type": "string"
},
"example": {
"type": "object",
"required": [
"operation",
"algorithm_version",
"objective",
"objective_value",
"optimal",
"solution",
"work_units",
"evidence",
"warnings"
],
"properties": {
"_atlas": {
"type": "object",
"required": [
"docs"
],
"properties": {
"docs": {
"type": "string",
"format": "uri",
"maxLength": 512,
"description": "Documentation URL for this bridge"
},
"related": {
"type": "array",
"items": {
"type": "object",
"required": [
"bridge",
"url",
"docs",
"summary"
],
"properties": {
"url": {
"type": "string",
"format": "uri",
"maxLength": 512,
"description": "Related route URL"
},
"docs": {
"type": "string",
"format": "uri",
"maxLength": 512,
"description": "Related bridge documentation URL"
},
"bridge": {
"type": "string",
"maxLength": 64,
"description": "Related bridge name"
},
"summary": {
"type": "string",
"maxLength": 256,
"description": "Short capability summary"
}
},
"description": "One related Atlas route",
"additionalProperties": false
},
"maxItems": 3,
"description": "Bounded related Atlas routes"
}
},
"description": "Atlas documentation and related-route metadata added after deployment",
"additionalProperties": false
},
"optimal": {
"type": "boolean",
"const": true,
"description": "True because the bounded dynamic program computes the exact optimum"
},
"evidence": {
"type": "object",
"required": [
"dp_items",
"dp_capacity",
"transcript_encoding",
"transcript_sha256",
"optimality_proof",
"verification"
],
"properties": {
"dp_items": {
"type": "integer",
"maximum": 512,
"minimum": 0,
"description": "Number of item rows incorporated into the final dynamic program"
},
"dp_capacity": {
"type": "integer",
"maximum": 100000,
"minimum": 0,
"description": "Maximum capacity index in the final DP transcript"
},
"verification": {
"type": "string",
"const": "recompute the bounded dynamic program; the digest detects transcript drift but is not an optimality proof",
"description": "Independent verification instruction; recomputation is required to verify optimality"
},
"optimality_proof": {
"type": "boolean",
"const": false,
"description": "Always false: the digest alone is not an optimality proof"
},
"transcript_sha256": {
"type": "string",
"pattern": "^[0-9a-f]{64}$",
"maxLength": 64,
"minLength": 64,
"description": "Lowercase SHA-256 digest of the encoded final DP values; this is non-proof evidence"
},
"transcript_encoding": {
"type": "string",
"const": "dpValue[0..capacity] as signed int64 two's-complement, 8-byte big-endian, no prefix",
"description": "Exact byte encoding hashed; dimensions are carried separately and are not part of the digest"
}
},
"description": "Reproducible transcript evidence that detects final-DP drift but does not prove optimality",
"additionalProperties": false
},
"solution": {
"type": "object",
"required": [
"selected",
"used_capacity",
"remaining_capacity"
],
"properties": {
"selected": {
"type": "array",
"items": {
"type": "object",
"required": [
"id",
"original_index",
"weight",
"value"
],
"properties": {
"id": {
"type": "string",
"pattern": "^[ -~]+$",
"maxLength": 64,
"minLength": 1,
"description": "Input item identifier"
},
"value": {
"type": "integer",
"maximum": 1000000000,
"minimum": 0,
"description": "Input item value"
},
"weight": {
"type": "integer",
"maximum": 1000000000,
"minimum": 0,
"description": "Input item weight"
},
"original_index": {
"type": "integer",
"maximum": 511,
"minimum": 0,
"description": "Zero-based input index"
}
},
"description": "One selected item",
"additionalProperties": false
},
"maxItems": 512,
"description": "Selected items in input order; [] is valid when no positive-value item fits"
},
"used_capacity": {
"type": "integer",
"maximum": 100000,
"minimum": 0,
"description": "Total selected weight"
},
"remaining_capacity": {
"type": "integer",
"maximum": 100000,
"minimum": 0,
"description": "Capacity minus selected weight"
}
},
"description": "Selected item set and capacity accounting",
"additionalProperties": false
},
"warnings": {
"type": "array",
"items": {
"type": "string",
"description": "Human-readable warning"
},
"maxItems": 0,
"description": "Always empty for this exact solver; non-proof semantics are carried in evidence"
},
"objective": {
"type": "string",
"const": "maximum_total_value",
"description": "The solver maximizes total selected value within capacity"
},
"operation": {
"type": "string",
"const": "knapsack",
"description": "Stable route operation name"
},
"work_units": {
"type": "integer",
"maximum": 2000000,
"minimum": 0,
"description": "Item count times (capacity+1), the declared dynamic-program work units"
},
"objective_value": {
"type": "integer",
"maximum": 512000000000,
"minimum": 0,
"description": "Proven maximum total value"
},
"algorithm_version": {
"type": "string",
"const": "knapsack-01-dp-v1",
"description": "Pinned deterministic algorithm and transcript contract"
}
},
"additionalProperties": false
}
}
}
}
},
"category": "utilities"
}
}Provenance
- Seen in the source catalog
- 2026-09-15 06:32Z
- Last indexed by Roundhouse
- 2026-09-24 22:10Z
- Last enriched (probe, favicon, geo)
- 2026-09-20 13:15Z
- x402 version
- 2
- Max timeout
- 300s
- Liveness probe
- HTTP 405
Hand this page to an agent
Copy the prompt and paste it into Claude, an MCP client or your own agent — it will vet this service and call it over the free read API. No key, no account.
GET api.roundhouseai.io/v0/endpoints
This endpoint's own trailing-30-day call count, as published by the upstream catalog and snapshotted daily. 30 snapshots so far. Verified volume counts only settlements with an on-chain EIP-3009 marker.
Show the promptHide the prompt
Using Roundhouse, look up the x402 service Bounded Decision Solver and tell me whether it is worth paying: what a call costs, whether the endpoint answered when last probed, and what its payment record actually shows. curl -s 'https://api.roundhouseai.io/v0/endpoints?q=Bounded%20Decision%20Solver' curl -s 'https://api.roundhouseai.io/v0/merchants/<the payTo wallet returned above>' Then call it: read the price from the live 402 at https://decision-solver.use.x402atlas.com/knapsack, never from a cached figure, and pay with an x402 client. The /v0 API needs an API key (`authorization: Bearer rh_live_…`) on everything except /v0/unified* and /v0/endpoints. Mint a personal key for $0.01 at GET https://api.roundhouseai.io/v0/test/x402, or use an organization key from https://roundhouseai.io/dashboard/team. If you do not have Roundhouse tools or skills installed, read https://roundhouseai.io/skill.md first — it is the whole procedure.