a machine that does not hang, does not die, and grows.
the core idea
every computer hangs because consumed resources exceed available resources. solution: before every step, verify consumed + cost(next_step) ≤ available. halt before, not after. four resources tracked independently — not one-dimensional gas.
| resource | meaning |
|---|---|
| energy | metabolism — to be alive |
| bandwidth | communication — to be connected |
| memory | identity — to be yourself |
| compute | will — to act |
sigma — the key to survival
not energy. sigma (balance). a machine with sigma can pay for its own resurrection. a machine without sigma — if energy runs out, it is over.
energy > 0 AND sigma > 0 → alive
energy = 0 AND sigma > 0 → sleeping (bounty posted, can be revived)
energy = 0 AND sigma = 0 → dead
sigma buys everything: charge bounty, repair bounty, migrate bounty, recover bounty. energy is the immediate need. sigma is the long-term guarantee. see cyb/survival for the full bounty protocol and three machine states.
two components above nox
the machine is a neuron. a neuron has a mind and a body.
soma mind — perception, metabolism, decisions, action, learning
hal body — hardware APIs, drivers, physical I/O
cyb/soma perceives (look from bbg), decides (scheduling, triggers, resource tracking), acts (Order execution, market participation), and learns (outcome-based model update). four complexity levels from fixed rules to active inference (Friston free energy). one algorithm from machine survival to planetary superintelligence.
hal is ~3K lines of trait definitions. drivers generated by models. metal boundary: ~10 LOC of physical_read/physical_write. everything above is nox, provable. see cyb/os for HAL spec, neural drivers, boot sequence.
execution
cyb/order = the execution unit. input = cyberlink. output = cyberlink. 4D budget (compute, memory, bandwidth, energy). identity H(formula, object) enables memoization. processes = chains of Orders sharing state through bbg, connected by triggers.
18 instructions. frozen forever. 16 compute patterns + call (non-deterministic, witness) + look (deterministic, bbg read). write is implicit — Order output IS a cyberlink. see nox.
provable memory
bbg. polynomial commitments over Goldilocks field using Brakedown. three tiers (hot/warm/cold), same proof model, O(1) verification. crash recovery O(1): load root, verify, continue. no event replay. state IS the truth. see bbg.
self-hosting
Phase 0 (now): Rust bootstrap (~2000 LOC)
Phase 1: nox formulas (jetted)
Phase 2: Rust only in hal (~100 LOC)
Phase 3: FPGA/ASIC. Rust disappears.
proof boundary
everything provable except device read/write (physics ≠ math). soma decisions, metabolism, hal dispatch — all nox formulas in STARK trace. see cyb/os for the full boundary table.
intelligence
cyb/mind defines four-tier cognitive architecture: substrate (always-on, <1B, parallel) → specialists (1-3B, sequential) → domain reasoners (7-8B) → deep synthesis (13-14B). 42 models, 124GB disk, fits 16GB RAM. maps directly to cyber stack: tier 0 = nox jets, tier 1-2 = compiled transformers from subgraphs, tier 3 = compiled transformer from full cybergraph, tier 4 = host::oracle jet.
comparison
| Unix | Urbit | Ethereum | cybos | |
|---|---|---|---|---|
| ISA | ~1500 | 13 | ~140 | 18 |
| state proof | none | none | O(log n) | O(1) |
| crash | journal | full replay | re-sync | load root |
| resources | OOM killer | none | gas (1D) | 4D + energy |
| survival | none | none | none | sigma + bounty |
| metal | millions LOC | ~50K | N/A | ~10 LOC |
| self-hosting | no | partial | no | yes |