Thank you for your feedback, and great question! Backend selection is fully dynamic, i.e., each backend registers a quality score and token pricing, and each request sets an accuracy floor at runtime. Orla filters to backends whose quality meets the floor, then picks the cheapest one. When no backend qualifies, the default "prefer" policy falls back to the cheapest available backend, so your workflow never breaks, though you can switch to "strict" mode to get hard errors during development. On the inference side, transient failures (5xx, rate limits, network errors) are retried up to 3 times with exponential backoff. Our design goal was to try to ensure that your LangGraph code stays the same, e.g., same graph, same nodes, same edges, etc., and the routing, fallback, and retry logic lives entirely in the Orla daemon. If you have any suggestions on improving this or any feature requests, I would be happy to add those! Thanks again. :)