Product / Platform / Routing and recipes

Routing and recipesComing

The cheapest path that can still be verified.

Before any model call: a rule, then a recipe, then a cache, then a small model, then a big one, inside token, step and cost budgets. Proven runs replay as recipes, still through the gate.

Fig.1
  1. 01S

    door

    signed entry

  2. 02N

    understand

    model reads

  3. 03N

    plan

    model proposes

  4. 04S

    gate

    rules decide

  5. 05S

    hands

    API first

  6. 06S

    check

    read back

  7. 07S

    record

    signed ledger

  8. 08N

    learn

    recipes, memory

How it works.

  1. 01 /

    Classify

    Deterministic features pick the path, from a decision table.

  2. 02 /

    Take the cheapest path

    A rule-answerable request spends no model tokens.

  3. 03 /

    Learn

    Verified runs become recipes; two failures demote them.

What you get. Each point labelled with its real status.

1.1Coming

Budgets enforced

Tokens, steps and cost checked before each model call.

1.2Coming

Fallback provider

A second model provider takes over when the first fails.

1.3Coming

Adaptive retrieval

None, context, agentic, business graph or code graph, per request.

1.4Coming

Cost per resolved task

Only verified outcomes count.