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": "a",
"size": 8
},
{
"id": "b",
"size": 7
},
{
"id": "c",
"size": 6
},
{
"id": "d",
"size": 5
},
{
"id": "e",
"size": 4
}
],
"capacity": 10
},
"type": "http",
"method": "POST",
"bodyType": "json"
},
"output": {
"type": "json",
"example": {
"optimal": false,
"solution": {
"bins": [
{
"load": 8,
"index": 0,
"items": [
{
"id": "a",
"size": 8,
"original_index": 0
}
],
"remaining": 2
},
{
"load": 7,
"index": 1,
"items": [
{
"id": "b",
"size": 7,
"original_index": 1
}
],
"remaining": 3
},
{
"load": 10,
"index": 2,
"items": [
{
"id": "c",
"size": 6,
"original_index": 2
},
{
"id": "e",
"size": 4,
"original_index": 4
}
],
"remaining": 0
},
{
"load": 5,
"index": 3,
"items": [
{
"id": "d",
"size": 5,
"original_index": 3
}
],
"remaining": 5
}
],
"bin_count": 4
},
"warnings": [
"Best-fit decreasing is a heuristic; a nonzero reported bound is only an upper bound on the unknown optimality gap."
],
"objective": "minimum_bin_count",
"operation": "bin-pack",
"work_units": 10,
"certificate": {
"capacity": 10,
"algorithm": "best-fit-decreasing-v1",
"item_count": 5,
"total_size": 30,
"capacity_feasible": true,
"item_conservation": true,
"volume_lower_bound": 3
},
"objective_value": 4,
"algorithm_version": "best-fit-decreasing-v1",
"optimality_gap_upper_bound": 1
}
}
},
"tags": [
"bin-packing-heuristic",
"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",
"size"
],
"properties": {
"id": {
"type": "string",
"pattern": "^[ -~]+$",
"maxLength": 64,
"minLength": 1,
"description": "Unique printable-ASCII item identifier"
},
"size": {
"type": "integer",
"maximum": 1000000000,
"minimum": 1,
"description": "Positive size not exceeding the request capacity"
}
},
"description": "One indivisible item to pack",
"additionalProperties": false
},
"maxItems": 1000,
"minItems": 1,
"description": "Unique-ID positive-size items; every size must be no greater than capacity"
},
"capacity": {
"type": "integer",
"maximum": 1000000000,
"minimum": 1,
"description": "Capacity of every produced bin"
}
},
"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",
"optimality_gap_upper_bound",
"solution",
"work_units",
"certificate",
"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",
"description": "True only when produced bin count equals the valid volume lower bound; false makes no claim about the unknown optimum"
},
"solution": {
"type": "object",
"required": [
"bins",
"bin_count"
],
"properties": {
"bins": {
"type": "array",
"items": {
"type": "object",
"required": [
"index",
"load",
"remaining",
"items"
],
"properties": {
"load": {
"type": "integer",
"maximum": 1000000000,
"minimum": 0,
"description": "Total item size in this bin"
},
"index": {
"type": "integer",
"maximum": 999,
"minimum": 0,
"description": "Stable zero-based bin index"
},
"items": {
"type": "array",
"items": {
"type": "object",
"required": [
"id",
"original_index",
"size"
],
"properties": {
"id": {
"type": "string",
"pattern": "^[ -~]+$",
"maxLength": 64,
"minLength": 1,
"description": "Input item identifier"
},
"size": {
"type": "integer",
"maximum": 1000000000,
"minimum": 0,
"description": "Input item size"
},
"original_index": {
"type": "integer",
"maximum": 999,
"minimum": 0,
"description": "Zero-based input index"
}
},
"description": "One conserved item placement",
"additionalProperties": false
},
"maxItems": 1000,
"minItems": 1,
"description": "Items placed in this bin in deterministic placement order"
},
"remaining": {
"type": "integer",
"maximum": 1000000000,
"minimum": 0,
"description": "Capacity minus load"
}
},
"description": "One produced bin",
"additionalProperties": false
},
"maxItems": 1000,
"minItems": 1,
"description": "Produced bins in stable creation order"
},
"bin_count": {
"type": "integer",
"maximum": 1000,
"minimum": 0,
"description": "Number of produced bins"
}
},
"description": "Deterministic best-fit-decreasing packing",
"additionalProperties": false
},
"warnings": {
"type": "array",
"items": {
"type": "string",
"description": "Human-readable heuristic interpretation warning"
},
"maxItems": 1,
"minItems": 1,
"description": "Required honesty warning that the heuristic bound is not the actual optimality gap"
},
"objective": {
"type": "string",
"const": "minimum_bin_count",
"description": "The heuristic attempts to minimize produced bin count without exact search"
},
"operation": {
"type": "string",
"const": "bin-pack",
"description": "Stable route operation name"
},
"work_units": {
"type": "integer",
"maximum": 1000000,
"minimum": 0,
"description": "Candidate-bin feasibility checks performed by the heuristic"
},
"certificate": {
"type": "object",
"required": [
"algorithm",
"item_count",
"total_size",
"capacity",
"volume_lower_bound",
"item_conservation",
"capacity_feasible"
],
"properties": {
"capacity": {
"type": "integer",
"maximum": 1000000000,
"minimum": 1,
"description": "Per-bin capacity"
},
"algorithm": {
"type": "string",
"const": "best-fit-decreasing-v1",
"description": "Heuristic algorithm used to produce the packing"
},
"item_count": {
"type": "integer",
"maximum": 1000,
"minimum": 1,
"description": "Number of input items conserved by the packing"
},
"total_size": {
"type": "integer",
"maximum": 1000000000000,
"minimum": 0,
"description": "Sum of all input item sizes"
},
"capacity_feasible": {
"type": "boolean",
"const": true,
"description": "True when every produced bin load is at most capacity"
},
"item_conservation": {
"type": "boolean",
"const": true,
"description": "True when every input item appears exactly once in the solution"
},
"volume_lower_bound": {
"type": "integer",
"maximum": 1000,
"minimum": 1,
"description": "ceil(total_size/capacity), a valid lower bound on optimum bin count"
}
},
"description": "Independently checkable feasibility, conservation, and volume-lower-bound evidence; not a general optimality certificate",
"additionalProperties": false
},
"objective_value": {
"type": "integer",
"maximum": 1000,
"minimum": 0,
"description": "Produced bin count; it is not necessarily the unknown optimum"
},
"optimality_proof": {
"type": "string",
"const": "matches-volume-lower-bound",
"description": "Present only when optimal is true; omitted when optimal is false"
},
"algorithm_version": {
"type": "string",
"const": "best-fit-decreasing-v1",
"description": "Pinned deterministic best-fit-decreasing heuristic contract"
},
"optimality_gap_upper_bound": {
"type": "integer",
"maximum": 999,
"minimum": 0,
"description": "Produced bin count minus volume lower bound; an upper bound on the unknown optimality gap, never the actual gap"
}
},
"additionalProperties": false
}
}
}
}
},
"category": "utilities"
}
}Provenance
- Seen in the source catalog
- 2026-09-15 06:32Z
- Last indexed by Roundhouse
- 2026-09-24 17:30Z
- 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/bin-pack, 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.