{"slug":"detect-halowerk-com-v1-integration-agent-budgeted-task-seque-83417c","title":"Zulaessige Aufgabenfolgen unter expliziten Preisen, Aufrufgrenzen und Kontingent","host":"detect.halowerk.com","method":"POST","resource":"https://detect.halowerk.com/v1/integration/agent-budgeted-task-sequence","category":"other","description":"Zulaessige Aufgabenfolgen unter expliziten Preisen, Aufrufgrenzen und Kontingenten berechnen.","price_listed":0.003,"price_asked":0.003,"state":"answering","state_label":"Answering","checks_7d":3,"answered_7d":3,"latency_ms_median":878,"reported_calls_30d":1,"reported_payers_30d":1,"networks":["eip155:8453"],"badge":"unverified","paid_checks_7d":0,"paid_ok_7d":0,"example_input":{"body":{"artifact":{"task_budget":{"actions":[{"cost_units":2,"from":"start","max_uses":1,"to":"mid"},{"cost_units":3,"from":"mid","max_uses":1,"to":"goal"},{"cost_units":6,"from":"start","max_uses":1,"to":"goal"}],"claimed_plan":[0,1],"goal":"goal","max_steps":3,"per_call_limit_units":6,"start":"start","states":["start","mid","goal"],"total_budget_units":4}}},"bodyType":"json","method":"POST","type":"http"},"output_schema":{"$schema":"https://json-schema.org/draft/2020-12/schema","properties":{"input":{"additionalProperties":false,"properties":{"body":{"additionalProperties":false,"properties":{"artifact":{"additionalProperties":true,"properties":{"task_budget":{}},"required":["task_budget"],"type":"object"}},"required":["artifact"],"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":{"properties":{"example":{"additionalProperties":false,"properties":{"billable":{"type":"boolean"},"findings":{"items":{"additionalProperties":false,"properties":{"confidence":{"maximum":100,"minimum":0,"type":"integer"},"evidence":{"type":"array"},"id":{"const":"agent-budgeted-task-sequence"},"limits":{"items":{"type":"string"},"type":"array"},"module":{"const":"agent-budgeted-task-sequence"},"module_cpu_ms":{"minimum":0,"type":"number"},"state":{"enum":["observed","not_observed","unknown"]},"value":{"anyOf":[{"type":"null"},{"additionalProperties":false,"properties":{"budget_feasible":{"type":"boolean"},"claimed_plan_cost_units":{"maximum":9007199254740991,"minimum":-9007199254740991,"type":"integer"},"claimed_plan_steps":{"maximum":9007199254740991,"minimum":-9007199254740991,"type":"integer"},"claimed_plan_valid":{"type":"boolean"},"declared_actions":{"maximum":9007199254740991,"minimum":-9007199254740991,"type":"integer"},"declared_states":{"maximum":9007199254740991,"minimum":-9007199254740991,"type":"integer"},"minimum_declared_cost_units":{"anyOf":[{"maximum":9007199254740991,"minimum":-9007199254740991,"type":"integer"},{"type":"null"}]}},"required":["budget_feasible","claimed_plan_cost_units","claimed_plan_steps","claimed_plan_valid","declared_actions","declared_states","minimum_declared_cost_units"],"type":"object"}]},"warnings":{"items":{"type":"string"},"type":"array"}},"required":["module","state","value","confidence","evidence","limits","warnings","module_cpu_ms"],"type":"object"},"maxItems":1,"minItems":1,"type":"array"},"known_count":{"maximum":1,"minimum":0,"type":"integer"},"scope":{"additionalProperties":false,"properties":{"contact_values_returned":{"const":false},"network":{"const":false},"supplied_artifact_only":{"const":true}},"required":["supplied_artifact_only","network","contact_values_returned"],"type":"object"},"warnings":{"type":"array"}},"required":["findings","known_count","billable","warnings","scope"],"type":"object"},"type":{"type":"string"}},"required":["type"],"type":"object"}},"required":["input"],"type":"object"},"history":[{"day":"2026-11-04","reachable":true,"status":402,"valid_402":true,"asked_usdc":0.003,"price_match":true,"latency_ms":895,"error":null},{"day":"2026-11-03","reachable":true,"status":402,"valid_402":true,"asked_usdc":0.003,"price_match":true,"latency_ms":873,"error":null},{"day":"2026-11-02","reachable":true,"status":402,"valid_402":true,"asked_usdc":0.003,"price_match":true,"latency_ms":878,"error":null}],"description_full":"Zulaessige Aufgabenfolgen unter expliziten Preisen, Aufrufgrenzen und Kontingenten berechnen.","last_updated":"2026-11-02T15:56:06.239Z","schemes":["exact"]}