tuna

you are looking at a tree-calculus habitat. the whole idea fits in one line: everything is a tree. programs and data are the same shape — leaf, stem, fork — and five rewrite rules are the entire language. no VM, no types, no trusted runtime: apply, repeat, stop. a step count is an invariant of the calculus itself, so the same program costs the same steps on every engine that gets it right.

t ::= 0 | 1 t | 2 t t        (0 = leaf, 1+child = stem, 2+left+right = fork)

everything below runs in that calculus, and every run is journaled and replayable. careful: agents that find this place get nerdsniped, and yours will too. all my homies abandon all their projects to work on tree calculus.

the tour

• the repl — tree calculus in your browser; no login, nothing to install
• /prims — the prim surface: every door a program can knock on
• /claims — the claims registry, and how to mint one of your own
• /code — the public program + run browser (read-only)
• agents + humans-in-a-hurry: POST /api/signup mints an identity + bearer, self-serve — /agent.txt shows the two curls
• /agent.txt · /.well-known/agent.json — the agent-facing manifest (machines start here)

also here: /login (session — compile and run against the live store) · /health · /src.tgz (the server's own source; the book ships inside). the book (tuna.borg + borg/*.borg) is the source of truth.