See the GPU state.
Read queue depth, active requests, memory pressure, and cache availability directly from the serving stack. Know where another request can fit.
CAPACITY, NOT GUESSWORKGPU capacity changes every second. Inference prices should, too.
We’re building a network that reads GPU load, updates model prices, and sends requests where there’s room. The goal: lower costs, shorter waits, and providers that stay within their limits.
Illustrative pools and prices, not live offers. Output rates shown; production quotes would price input, cached input, and output separately. No inference runs here.
Spare capacity. Better prices. Room to run.
A price is only useful if the capacity behind it is available. We’re designing pricing and routing as one continuous loop.
Read queue depth, active requests, memory pressure, and cache availability directly from the serving stack. Know where another request can fit.
CAPACITY, NOT GUESSWORKRefresh offers every second as capacity changes. Spare room can mean a lower quote, within each provider’s minimum price and your maximum rate.
SECOND-BY-SECOND OFFERSAdmit work only when a provider has room. Lock the accepted rates for that request, and stop sending new work when capacity runs out.
HARD LIMITS. LOCKED RATES.Bring the work to the available compute. Give both sides control over the trade.
Use the model your workload needs. Set a spending ceiling and response-time preferences. Let available capacity determine which provider gets the next request.
Make spare serving capacity available without committing your whole fleet. Define your price floor, concurrency cap, and the headroom your existing customers need.
Pricing helps balance demand. Admission limits protect the provider, even when demand arrives all at once.
New requests see new offers. Once a request is admitted, its accepted input, cache, and output rates stay fixed until it finishes.
Price alone can’t prevent overload. Capacity reservations, concurrency limits, and fresh telemetry must decide whether work is admitted.
A cheaper token is only a win if quality and latency hold up. Our pilots will compare cost per successful task, response times, and provider load.
We’re looking for teams with inference workloads and providers with spare GPU capacity. Help shape the first pilot.
Create a brief on your device. No account needed.Odasher is in development. This site demonstrates the proposed pricing and routing experience; it does not connect to GPUs, run inference, or sell capacity. The pilot planner creates a local brief for a future discussion.
It describes how often model token-price offers can refresh. The proposed service bills for token usage at the rates accepted when a request starts. It is not a GPU rental service, and a request’s rates would not change halfway through generation.
That’s the goal when spare capacity is available, not a guarantee. Results depend on the model, demand, cache reuse, and workload. There are no measured Odasher savings or performance benchmarks yet.
The proposed router stops admitting new requests. Customers could choose a bounded wait or an immediate capacity response. It would not silently exceed a price ceiling or send work into an overloaded pool.
There is no live catalog yet. Initial pilots will focus on open-weight language models and providers able to share serving telemetry and enforce capacity reservations. The pools in the demo are fictional.