{"api":"v1","generated_at":"2026-09-15T21:52:33.200Z","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-knapsack-096b1e","pinned_page":"https://tollindex.com/e/decision-solver-use-x402atlas-com-knapsack-096b1e/at/2026-09-15T21-20Z","pinned":false,"method":"https://tollindex.com/ledger/method","snapshot_at":"2026-09-15T21:20:12.737Z","snapshot_stamp":"2026-09-15T21-20Z","endpoint":{"slug":"decision-solver-use-x402atlas-com-knapsack-096b1e","canonical_url":"https://decision-solver.use.x402atlas.com/knapsack","resource":"https://decision-solver.use.x402atlas.com/knapsack","http_method":"POST","type":"http","x402_version":2,"registries":["cdp"],"primary_registry":"cdp","curated_by_coinbase":false,"description":"0/1 knapsack solver — exact work-bounded capacity planning and portfolio selection for maximum value, with deterministic ties and reproducible DP evidence.","service_name":"Bounded Decision Solver","declared_category":"utilities","declared_tags":["0-1-knapsack-solver","optimization","operations-research","bounded-computation","deterministic"],"route_template":null,"registry_updated":"2026-09-15T06:32:27.576Z"},"derived":{"note":"fields no registry supplies; TOLL derives them and marks them derived on the page","title":"knapsack","category":"other","first_observed_by_toll":"2026-09-10T19:08:24.178Z","last_observed_by_toll":"2026-09-15T21:20:12.737Z","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-15T21:20:12.737Z","calls_30d":4,"unique_payers_30d":3,"last_called_at":"2026-09-15T06:32:27.424Z"},"validation":{"latest":{"observed_at":"2026-09-15T03:54:08.511Z","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-15T03:54:08.511Z","state":"pass","failed_checks":[],"run_id":"daily-2026-09-15","state_changed":false},{"observed_at":"2026-09-14T03:53:48.728Z","state":"pass","failed_checks":[],"run_id":"daily-2026-09-14","state_changed":false},{"observed_at":"2026-09-13T03:53:34.069Z","state":"pass","failed_checks":[],"run_id":"daily-2026-09-13","state_changed":false},{"observed_at":"2026-09-12T06:08:15.732Z","state":"pass","failed_checks":[],"run_id":"daily-2026-09-12","state_changed":false},{"observed_at":"2026-09-11T09:32:38.981Z","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":["0-1-knapsack-solver","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:27.424Z","l30DaysTotalCalls":4,"l30DaysUniquePayers":3},"resource":"https://decision-solver.use.x402atlas.com/knapsack","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"}},"description":"0/1 knapsack solver — exact work-bounded capacity planning and portfolio selection for maximum value, with deterministic ties and reproducible DP evidence.","lastUpdated":"2026-09-15T06:32:27.576Z","serviceName":"Bounded Decision Solver","x402Version":2}]}}