harn-vm 0.9.13

Async bytecode virtual machine for the Harn programming language
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18

# ── Model ladders ────────────────────────────────────────────────────────────
# Named model-fallback ladders resolved by a `ladder: "<name>"` option on
# `llm_call`. A ladder lowers onto the first-class routing chain: each step is
# one transport attempt, and the loop advances to the NEXT step only on a
# transport-class failure (connection / timeout / 429 / 5xx / throttled-empty).
# Schema-validation failures never advance — they re-ask the same step's model.
#
# Steps are ordered cheapest/first to most-capable/last. `provider` is optional
# and inferred from the model id (or the call's base provider) when omitted.
# Model aliases (haiku / sonnet / opus, resolved via `[aliases]`) are allowed.

[model_ladders.frugal]
label = "frugal: cheap-first with frontier escalation"
steps = [
  { model = "haiku", label = "cheap" },
  { model = "sonnet", label = "mid" },
  { model = "opus", label = "frontier" },
]