Bounded Decision Solver
Assignment solver — exact minimum-cost worker-to-task matching for resource allocation, with deterministic choices and a primal/dual optimality certificate.
Offering
- Provider
- decision-solver.use.x402atlas.com
- Method
- POST
- Offering type
- Api Endpoint
- Transport type
- http
- Category
- Business And Commerce
- Delivery
- Not provided
- Pricing model
- Not provided
- x402 version
- 2
Endpoint context
- URL
https://decision-solver.use.x402atlas.com/assignment- MIME type
- Not provided
- First seen
- 2026-10-16T01:50:10.647Z
- Last seen
- Tags
- assignment-solver, optimization, operations-research, bounded-computation, deterministic
Payment pricing
x402 payment terms are the authoritative price for calling this endpoint.
- Payment option 1
- 0.005 USDC
Atomic price: 5000 · Network: eip155:8453 · Asset: USDC · Scheme: exact - Payment option 2
- 0.005 USDC
Atomic price: 5000 · Network: eip155:137 · Asset: USDC · Scheme: exact - Payment option 3
- 0.005 USDC
Atomic price: 5000 · Network: eip155:42161 · Asset: USDC · Scheme: exact - Payment option 4
- 0.005 USDC
Atomic price: 5000 · Network: solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp · Asset: USDC · Scheme: exact
Raw x402 terms
[
{
"scheme": "exact",
"network": "eip155:8453",
"asset": "0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913",
"amount": "5000",
"payTo": "0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2"
},
{
"scheme": "exact",
"network": "eip155:137",
"asset": "0x3c499c542cEF5E3811e1192ce70d8cC03d5c3359",
"amount": "5000",
"payTo": "0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2"
},
{
"scheme": "exact",
"network": "eip155:42161",
"asset": "0xaf88d065e77c8cC2239327C5EDb3A432268e5831",
"amount": "5000",
"payTo": "0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2"
},
{
"scheme": "exact",
"network": "solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp",
"asset": "EPjFWdd5AufqSSqeM2qN1xzybapC8G4wEGGkZwyTDt1v",
"amount": "5000",
"payTo": "ASt6xvRyQ7ntERsmcYVMdLqZvz1GEN8Fzexzq62tXrNQ"
}
]Observed health
- Status
- Reachable
- Latest latency
- 10 ms
- Average latency
- 16 ms
- HTTP status
- 405
- Last checked
- Reachability
- 100% over 12 checks
Latency is measured to the first response headers. A reachable result does not verify response accuracy or merchant identity.
Input schema
{
"additionalProperties": false,
"properties": {
"body": {
"additionalProperties": false,
"properties": {
"costs": {
"description": "Rectangular worker-by-task cost matrix; workers <= tasks and each worker receives one distinct task",
"items": {
"description": "One worker's signed integer costs in task-index order; every row must have the same length",
"items": {
"description": "Cost of assigning this worker to this task",
"maximum": 1000000000,
"minimum": -1000000000,
"type": "integer"
},
"maxItems": 64,
"minItems": 1,
"type": "array"
},
"maxItems": 64,
"minItems": 1,
"type": "array"
}
},
"required": [
"costs"
],
"type": "object"
},
"bodyType": {
"enum": [
"json",
"form-data",
"text"
],
"type": "string"
},
"method": {
"enum": [
"POST"
],
"type": "string"
},
"type": {
"const": "http",
"type": "string"
}
},
"required": [
"type",
"method",
"bodyType",
"body"
],
"type": "object"
}Output schema
{
"properties": {
"example": {
"additionalProperties": false,
"properties": {
"_atlas": {
"additionalProperties": false,
"description": "Atlas documentation and related-route metadata added after deployment",
"properties": {
"docs": {
"description": "Documentation URL for this bridge",
"format": "uri",
"maxLength": 512,
"type": "string"
},
"related": {
"description": "Bounded related Atlas routes",
"items": {
"additionalProperties": false,
"description": "One related Atlas route",
"properties": {
"bridge": {
"description": "Related bridge name",
"maxLength": 64,
"type": "string"
},
"docs": {
"description": "Related bridge documentation URL",
"format": "uri",
"maxLength": 512,
"type": "string"
},
"summary": {
"description": "Short capability summary",
"maxLength": 256,
"type": "string"
},
"url": {
"description": "Related route URL",
"format": "uri",
"maxLength": 512,
"type": "string"
}
},
"required": [
"bridge",
"url",
"docs",
"summary"
],
"type": "object"
},
"maxItems": 3,
"type": "array"
}
},
"required": [
"docs"
],
"type": "object"
},
"algorithm_version": {
"const": "hungarian-min-v1",
"description": "Pinned deterministic algorithm and certificate contract",
"type": "string"
},
"certificate": {
"additionalProperties": false,
"description": "Independently checkable primal/dual certificate for the padded square matrix",
"properties": {
"column_potentials": {
"description": "Signed column dual potentials",
"items": {
"description": "Signed dual potential value",
"type": "integer"
},
"maxItems": 64,
"minItems": 1,
"type": "array"
},
"padded_assignment": {
"description": "Task index matched to each padded worker",
"items": {
"description": "Zero-based padded task index",
"maximum": 63,
"minimum": 0,
"type": "integer"
},
"maxItems": 64,
"minItems": 1,
"type": "array"
},
"row_potentials": {
"description": "Signed row dual potentials",
"items": {
"description": "Signed dual potential value",
"type": "integer"
},
"maxItems": 64,
"minItems": 1,
"type": "array"
}
},
"required": [
"padded_assignment",
"row_potentials",
"column_potentials"
],
"type": "object"
},
"objective": {
"const": "minimum_total_cost",
"description": "The solver minimizes the sum of selected assignment costs",
"type": "string"
},
"objective_value": {
"description": "Proven minimum total cost",
"maximum": 64000000000,
"minimum": -64000000000,
"type": "integer"
},
"operation": {
"const": "assignment",
"description": "Stable route operation name",
"type": "string"
},
"optimal": {
"const": true,
"description": "True because the primal/dual certificate proves this exact optimum",
"type": "boolean"
},
"solution": {
"additionalProperties": false,
"description": "Customer assignment excluding padded dummy workers",
"properties": {
"assignments": {
"description": "Exactly one assignment per input worker, ordered by worker index",
"items": {
"additionalProperties": false,
"description": "One chosen worker-to-task edge",
"properties": {
"cost": {
"description": "Input cost on the chosen edge",
"maximum": 1000000000,
"minimum": -1000000000,
"type": "integer"
},
"task_index": {
"description": "Zero-based input task index",
"maximum": 63,
"minimum": 0,
"type": "integer"
},
"worker_index": {
"description": "Zero-based input worker index",
"maximum": 63,
"minimum": 0,
"type": "integer"
}
},
"required": [
"worker_index",
"task_index",
"cost"
],
"type": "object"
},
"maxItems": 64,
"minItems": 1,
"type": "array"
}
},
"required": [
"assignments"
],
"type": "object"
},
"warnings": {
"description": "Always empty for this exact solver",
"items": {
"description": "Human-readable warning",
"type": "string"
},
"maxItems": 0,
"type": "array"
},
"work_units": {
"description": "Counted Hungarian inner comparisons",
"maximum": 262144,
"minimum": 0,
"type": "integer"
}
},
"required": [
"operation",
"algorithm_version",
"objective",
"objective_value",
"optimal",
"solution",
"work_units",
"certificate",
"warnings"
],
"type": "object"
},
"type": {
"type": "string"
}
},
"required": [
"type"
],
"type": "object"
}