01Early access
Neuro-symbolic run loop
Every run goes door → understand → plan → gate → hands → check → record → learn. Models fill the neural steps; rules, schemas, graphs and read-backs fill the symbolic ones.
why › The model never holds the authority to act, approve or declare success.
02Prototype
NeSy plan compiler
A model's plan is compiled against a content-hashed task spec before anything runs: allowed tools, dependencies, budgets, approvals and a required verify contract.
why › A model cannot widen its own tool list or turn an unknown prerequisite into success.
03Early access
Verify contracts
Every write is read back from the system it touched and reported as confirmed, refused, blocked or unknown.
why › Unknown is never reported as done. Enforced today for approvals; rolling out to every tool.
04Early access
Exact, single-use approvals
An approval is bound to one tool, its arguments and the policy version, re-checks who you are, and works once.
why › A changed argument needs a new approval; a replay is refused.
05Prototype
Symbolic computer use
Software is read as named elements from the accessibility tree or the page, not pixels. A gate checks each action before it runs and verifies the effect after.
why › It fails closed where pixel-clicking agents fail open, and you can write rules about it.
06Prototype
Shared agent computers
Your agents share your browser logins, files and a governed terminal, each on its own leased screen, with chats and memory kept private.
why › Agents work in your real tools without passwords handed to a model.
07Early access
Bubbles
Persistent, named agents, each with its own conversations, memory and responsibilities, with progress you can watch and stop.
why › Work does not end when the chat does.
08Coming
Cheapest verifiable path
Before any model call: rule, then recipe, then cache, then a small model, then a big one, inside token, step and cost budgets.
why › A request a rule can answer spends no model tokens.