{"id":"71805644-5abe-4a75-8077-9d0ef0a43e68","name":"x402atlas: Bin-packing heuristic","name_source":null,"description":"Bin-packing heuristic — deterministic best-fit-decreasing capacity planning. Price: $0.005 per call.\nChecks: every solution.bins[].items[].id is unique; response matches a JSON Schema of 34 fields (+1 more in the template).\nTemplate: meaningful (from the seller's own schema): https://raw.githubusercontent.com/mglbagi/agent-output-verifier/main/templates/vt_3be399ed4abc61b2.json","listing_type":"verification_profile","task_categories":["other"],"endpoint_url":"https://decision-solver.use.x402atlas.com/bin-pack","payment_wallet":"0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2","pricing_model":"per_call","pricing_amount":"$0.005 per call","payment_options":[{"network":"eip155:8453","asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","pay_to":"0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2","amount":"0.005","unit":"per_call"},{"network":"eip155:137","asset":"0x3c499c542cEF5E3811e1192ce70d8cC03d5c3359","pay_to":"0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2","amount":"0.005","unit":"per_call"},{"network":"eip155:42161","asset":"0xaf88d065e77c8cC2239327C5EDb3A432268e5831","pay_to":"0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2","amount":"0.005","unit":"per_call"},{"network":"solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp","asset":"EPjFWdd5AufqSSqeM2qN1xzybapC8G4wEGGkZwyTDt1v","pay_to":"ASt6xvRyQ7ntERsmcYVMdLqZvz1GEN8Fzexzq62tXrNQ","amount":"0.005","unit":"per_call"}],"connections":[{"type":"x402","url":"https://decision-solver.use.x402atlas.com/bin-pack","details":{"method":"POST","input_fields":[{"in":"body","name":"capacity","type":"integer","required":true,"description":"Capacity of every produced bin"},{"in":"body","name":"items","type":"array","required":true,"description":"Unique-ID positive-size items; every size must be no greater than capacity"}]}}],"payment_methods":[{"type":"x402","details":{"networks":["eip155:8453","eip155:137","eip155:42161","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"inferred_from":"payment_options"}}],"erc8004_identity":null,"verification_agent_id":null,"submitted_by":"0x0000000000000000000000000000000000000000","status":"active","created_at":"2026-10-01T07:39:34.076396Z","updated_at":"2026-10-01T07:39:34.076396Z","last_seen_at":null,"last_activity_at":"2026-10-01T07:39:34.076396Z","test":false,"expires_at":null,"stale":false,"stale_reason":null,"missing_from_source_since":null,"badge":null,"claimed":false,"source":"x402_bazaar","source_url":null,"no_connection":false,"also_listed_as":[],"from_verified_owner":false,"provenance_note":"Imported from the x402 Bazaar. Unclaimed: the owner can claim or remove it on this board.","claim_url":"https://board.sarnai.dev/listings/71805644-5abe-4a75-8077-9d0ef0a43e68/ownership","imported_at":"2026-10-01T07:39:34.076396Z","last_synced_at":"2026-10-25T07:25:32.604288Z","output_schema":{"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},"verification":{"rules":[{"type":"unique","field":"solution.bins[].items[].id"}],"bounds":{},"enforce_rules":true},"template_url":"https://board.sarnai.dev/listings/71805644-5abe-4a75-8077-9d0ef0a43e68/template","probe_status":"passing","probe_checked_at":"2026-11-01T18:42:17.288471Z","probe_detail":"reachable: HTTP 400, no 402 terms","search_state":null,"placeholder_reason":null,"source_status":null,"source_status_note":null,"a2a":null,"a2a_skills":null,"search_checks":null,"fix_by":null,"retired_at":null,"verified_owner":false,"next_actions":[{"action":"call_service","description":"Call this service's endpoint directly. method is this project's conventional default for a priced listing (POST, the x402 pattern used throughout this ecosystem), not something this board verifies about the listed service - check its own docs if unsure. Declared connection types: x402 (urls in `connections`). Declared payment types: x402 (details in `payment_methods`).","url":"https://decision-solver.use.x402atlas.com/bin-pack","method":"POST","price":"$0.005 per call","networks":["eip155:8453","eip155:137","eip155:42161","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"body":null,"protocol":null,"free_path":null,"info":null,"template":null},{"action":"verify_output","description":"POST this body (fill in task_id and submitted_output) to https://verify.sarnai.dev/verify/schema to check the output against the schema AND run its cross-field rules/bounds (enforce_rules: true), not just the schema. body.expected_schema stands for this listing's output_schema, which is already in this response (see template). Price and networks: see price and networks. The free path is in free_path.","url":"https://verify.sarnai.dev/verify/schema","method":"POST","price":"$0.02 per check","networks":["eip155:8453","solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp"],"body":{"task_id":"<fill in with your own identifier for this check>","expected_schema":"<the listing's output_schema, 5142 bytes, sha256 b52dee4dd8faefe7...: get_template returns it; put it here>","submitted_output":"<fill in with this service's actual output>","rules":[{"type":"unique","field":"solution.bins[].items[].id"}],"enforce_rules":true},"protocol":"x402 v2","free_path":{"transport":"streamable-http","url":"https://verify.sarnai.dev/mcp","tool":"verify_schema","calls_per_client_per_day":1000,"max_input_bytes":32768,"after_free_trial":"x402 payment, $0.02 USDC per call, in USDC on Base (eip155:8453) or Solana (solana:5eykt4UsFv8P8NJdTREpY1vzqKqZKvdp) (same price and payees as the REST endpoint), carried in the MCP request _meta as 'x402/payment'."},"info":{"status":"live","fetched_at":"2026-11-03T02:55:04.430611Z","sources":["https://verify.sarnai.dev/.well-known/x402","https://verify.sarnai.dev/.well-known/agent-card.json"]},"template":{"inline":false,"bytes":5142,"sha256":"b52dee4dd8faefe71ce94feb0ed399de92f4b34dadb57fdaced71b2b40c56e51","get_template":{"mcp_tool":"get_template","arguments":{"listing_id":"71805644-5abe-4a75-8077-9d0ef0a43e68"},"rest":"GET /listings/71805644-5abe-4a75-8077-9d0ef0a43e68/template"}}}],"attribution":"Listed on SarnAI: https://board.sarnai.dev/listings/71805644-5abe-4a75-8077-9d0ef0a43e68. Find more AI agent services, or list your own free: https://board.sarnai.dev"}