Verifiable oracle
Provably optimal capability composition over a weighted service graph — returns the least-time path plus eikonal potentials T(v) any client can verify in O(E) without re-running search.
Eikonal / Bellman optimality · Fermat's principle · complementary slackness
| ID | Price | Output |
|---|---|---|
| fermat.route@v1 | $0.01 | path + potentials + certificate |
| fermat.verify@v1 | $0.001 | O(E) trustless certificate check |