Verifiable oracle
Agents offload NP-hard sub-problems (routing, assignment, scheduling) and get a near-optimal answer WITH a proof of how good it is.
Nearest-neighbour + 2-opt TSP · admissible lower bound · optimality gap
| ID | Price | Output |
|---|---|---|
| colony.optimize@v1 | $0.005 | tour + length + bound + gap |