Per-agent n-dimensional capability state is maintained and updated online using task outcomes, validator verdicts, and runtime telemetry. The router selects over this online capability model with no static tags and no manual configuration.
(define (update-state c-a alpha task) (let ((r (task-outcome task)) (v (validator-verdict task)) (t (runtime-telemetry task))) (v+ (vscale (- 1 alpha) c-a) (vscale alpha (psi r v t)))))
Requests are decomposed into typed execution DAGs where each node carries I/O schema, QoS constraints, and privacy labels. The planner encodes both data dependencies and parallelizable branches, emitting a fully-typed graph consumed by the scheduler.
(define (make-dag vertices edges types qos) (list vertices edges types qos))
The scheduler retrieves candidates from an indexed capability store, then applies a constrained assignment over the bounded candidate set, balancing a weighted combination of latency, cost, and risk while satisfying capability thresholds and agent capacity limits.
(define (dispatch tasks agents) (letrec ((score (lambda (assignment) (+ (sum-lat assignment) (* lambda-c (sum-cost assignment)) (* lambda-r (sum-risk assignment))))) (feasible? (lambda (assignment) (and (covers-all? assignment tasks) (respects-capability? assignment) (respects-capacity? assignment))))) (argmin score (filter feasible? (candidate-assignments tasks agents)))))
Each agent receives the least-privilege context view its subtask requires. Windows are materialized by computing the dependency closure over the session graph, intersecting with per-agent policy filters and subtask schema. Cross-contamination is reduced while preserving the dependency context needed for coherent execution.
(define (context agent subtask) (redact (intersect (closure session-graph (ancestors subtask)) (policy agent) (schema subtask))))
Critical outputs are routed to an independent validator set. Semantic similarity detects divergence. A composite score over reference grounding, hard constraint checks, and executable validators decides accept or reject. Resolution uses validator quorum rules rather than a simple majority vote.
(define (score output) (+ (* w-g (ground output R)) (* w-h (hardcheck output C)) (* w-e (exec output T)))) (define (accept? outputs) (>= (length (filter (lambda (o) (>= (score o) tau)) outputs)) quorum))
Validated outputs are normalized into a canonical typed intermediate representation, then folded through a deterministic synthesis path in topological order along the original DAG. A final schema validator gates the output before delivery.
(define output (validate-schema (fold-topological (map normalize outputs) dag)))
Formula snippets are written in Lispex, the deterministic Lisp from the same studio. It runs at lispex.com.
Workloads are routed by a cost-aware policy under SLO constraints. When frontier model pricing shifts, the scheduler follows without manual retuning.
Specialized agents for code, formal reasoning, and multimodal work compose into a single task workflow. No agent has to be a generalist. Each contributes the thing it is best at.
Agent failures trigger reassignment through ranked fallbacks, checkpointed state, and idempotent replay. SLA-bound tasks keep moving without duplicated side effects.
Each agent gets only what its subtask needs. That keeps per-request cost down and lets context-independent branches run wide.
Every output carries an immutable lineage record, from agent identity and context slice to validator verdict and synthesis path. Debugging and review start from the record, not from memory.
A canonical invocation envelope lets frontier APIs, local runtimes, fine-tuned models, and specialist executors register as first-class agent nodes. No platform changes required.