{"api":"v1","generated_at":"2026-09-16T05:27:40.317Z","licence":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/","attribution":"TOLL, with a link to the page cited"},"page":"https://tollindex.com/e/decision-solver-use-x402atlas-com-bin-pack-b396ae","pinned_page":"https://tollindex.com/e/decision-solver-use-x402atlas-com-bin-pack-b396ae/at/2026-09-16T04-48Z","pinned":false,"method":"https://tollindex.com/ledger/method","snapshot_at":"2026-09-16T04:48:25.992Z","snapshot_stamp":"2026-09-16T04-48Z","endpoint":{"slug":"decision-solver-use-x402atlas-com-bin-pack-b396ae","canonical_url":"https://decision-solver.use.x402atlas.com/bin-pack","resource":"https://decision-solver.use.x402atlas.com/bin-pack","http_method":"POST","type":"http","x402_version":2,"registries":["cdp"],"primary_registry":"cdp","curated_by_coinbase":false,"description":"Bin-packing heuristic — deterministic best-fit-decreasing capacity planning for placing items into bins, with feasibility evidence and an honest volume bound.","service_name":"Bounded Decision Solver","declared_category":"utilities","declared_tags":["bin-packing-heuristic","optimization","operations-research","bounded-computation","deterministic"],"route_template":null,"registry_updated":"2026-09-15T06:32:25.965Z"},"derived":{"note":"fields no registry supplies; TOLL derives them and marks them derived on the page","title":"bin pack","category":"other","first_observed_by_toll":"2026-09-10T19:08:24.178Z","last_observed_by_toll":"2026-09-16T04:48:25.991Z","observation_began":"2026-09-10"},"presence":{"listed_now":true,"first_absent_at":null,"delisting_confirmed_at":null,"events":[{"registry":"cdp","at":"2026-09-10T19:08:24.178Z","event":"listed"}]},"accepts":[{"registry":"cdp","ordinal":0,"network":"eip155:8453","asset":"0x833589fcd6edb6e08f4c7c32d4f71b54bda02913","asset_name":"USD Coin","symbol":"USDC","decimals":6,"amount_display":"0.005 USDC","amount_units":0.005,"decimals_known":true,"pay_to":"0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2","scheme":"exact"},{"registry":"cdp","ordinal":1,"network":"eip155:137","asset":"0x3c499c542cef5e3811e1192ce70d8cc03d5c3359","asset_name":"USD Coin","symbol":"USDC","decimals":6,"amount_display":"0.005 USDC","amount_units":0.005,"decimals_known":true,"pay_to":"0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2","scheme":"exact"},{"registry":"cdp","ordinal":2,"network":"eip155:42161","asset":"0xaf88d065e77c8cc2239327c5edb3a432268e5831","asset_name":"USD Coin","symbol":"USDC","decimals":6,"amount_display":"0.005 USDC","amount_units":0.005,"decimals_known":true,"pay_to":"0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2","scheme":"exact"}],"counters":{"observed_at":"2026-09-16T04:48:25.992Z","calls_30d":2,"unique_payers_30d":1,"last_called_at":"2026-09-15T06:32:25.856Z"},"validation":{"latest":{"observed_at":"2026-09-15T06:16:11.079Z","state":"pass","failed_checks":[],"endpoint_http_status":402,"run_id":"daily-2026-09-15"},"uptime":[{"days":7,"observed":5,"passed":5,"ratio":1},{"days":30,"observed":5,"passed":5,"ratio":1},{"days":90,"observed":5,"passed":5,"ratio":1}],"history_90d":[{"observed_at":"2026-09-15T06:16:11.079Z","state":"pass","failed_checks":[],"run_id":"daily-2026-09-15","state_changed":false},{"observed_at":"2026-09-14T05:46:42.810Z","state":"pass","failed_checks":[],"run_id":"daily-2026-09-14","state_changed":false},{"observed_at":"2026-09-13T05:40:02.429Z","state":"pass","failed_checks":[],"run_id":"daily-2026-09-13","state_changed":false},{"observed_at":"2026-09-12T07:56:54.213Z","state":"pass","failed_checks":[],"run_id":"daily-2026-09-12","state_changed":false},{"observed_at":"2026-09-11T11:51:24.302Z","state":"pass","failed_checks":[],"run_id":"daily-2026-09-11","state_changed":true}]},"seller":{"wallet":"0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2","page":"https://tollindex.com/seller/0x8C128f1Ee62Bb5e47867CfbAe2ad89be325Df1b2","endpoints":62,"hosts":18},"reports":0,"registry_record":{"cdp":[{"tags":["bin-packing-heuristic","optimization","operations-research","bounded-computation","deterministic"],"type":"http","accepts":[{"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}],"quality":{"lastCalledAt":"2026-09-15T06:32:25.856Z","l30DaysTotalCalls":2,"l30DaysUniquePayers":1},"resource":"https://decision-solver.use.x402atlas.com/bin-pack","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"}},"description":"Bin-packing heuristic — deterministic best-fit-decreasing capacity planning for placing items into bins, with feasibility evidence and an honest volume bound.","lastUpdated":"2026-09-15T06:32:25.965Z","serviceName":"Bounded Decision Solver","x402Version":2}]}}