Problem: Select a supported execution plan against the supplied cost, depth, duration limits, and weights. Input: JSON with plans, weights, maximum cost usd, maximum depth, maximum duration seconds. Result: ranked feasible plans, objective scores, selected plan identity. Limits: Local software evidence only; 4096 operations; 65536 request bytes.
| Network | Scheme | Amount | Pay To |
|---|---|---|---|
| Base | exact | $0.01 USDC | 0x8F43...6C12 |