Brute Genius Plan
brute_genius_planEnumerate the full Cartesian product for a combinatorial search space and return a cost estimate, refusing to generate a plan when the estimate exceeds your max_cost_usd ceiling.
Instructions
Enumerate the full Cartesian product and return a cost estimate.
Does NOT execute anything. Refuses to return a plan_id when the estimated cost exceeds max_cost_usd.
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"space": "<space>",
"objective": "<objective>",
"max_cost_usd": "<max_cost_usd>"
},
"name": "brute_genius_plan"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| chip | No | Accelerator type (h100, a100, l40s, cpu). | h100 |
| nodes | No | Number of nodes to shard across (1–64). | |
| space | Yes | Mapping of axis name → list of discrete values. | |
| objective | Yes | Name of a registered objective (see objectives registry). | |
| max_cost_usd | Yes | Hard ceiling in USD. Plan is refused above this. |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||