A Minimal Viable Theory

WunderOS is autonomic computing for agents. But, first, a minimal, viable theory.

Solomonoff (1964) proved that optimal compression of any computable sequence is equivalent to optimal prediction of it. Hutter and Schmidhuber extended this to agency: the optimal universal agent is a compressor that has learned the regularities of its environment.

Prediction is the load-bearing aspect of intelligence in this framing. Compression is the mechanism that makes prediction tractable.

Recursion is one mechanism for achieving compression. Bird-Meertens (1986) teaches that structural recursion over an inductive type is a fold, a catamorphism that collapses arbitrary-depth structure into a value via an algebra that retains only load-bearing information. The fold is the mechanism; the algebra is the choice. Well-chosen folds compress.

WunderOS is built on substrate-recursion. Every agent action, every classifier output, every plan execution writes back to the substrate with full provenance. These folds compress operational experience into a representation that subsequent cycles consume as context. Cycle N’s experience becomes cycle N+1’s compressed prediction surface.

The substrate gets smarter over operational time, not because the LLM does, but because the substrate’s compression of experience improves with each cycle.

Substrate-recursion is fold-shaped compression. Fold-shaped compression is intelligence-shaped behavior at the architectural layer. The substrate is the locus of accumulated intelligence. The LLM remains the workhorse for genuinely novel reasoning. Customer agents inherit both. Token consumption decreases. Reasoning quality holds or improves. The loop closes.

Software Platform

WunderOS is an autonomic operating system for agents that combines harness engineering, systems engineering, and control theory with bare metal, HFT-grade latency, durability, and transparency.

Autonomic systems have a precise reference model, namely, MAPE-K (Monitor, Plan, Analyze, Execute over shared Knowledge). WunderOS is MAPE-K for agents: a platform where substrate-recursion makes the write path the structural through-line.

In WunderOS, every assertion carries provenance; every classification carries lineage; and every plan execution writes back into knowledge with full audit-grade traces.

We began with Wunderblock, the agentic memory subsystem. A binary-vector substrate unifies vector and graph retrieval. Three properties distinguish it, none using an LLM in any path: deterministic retrieval and ingestion; deterministic governance and lineage; and deterministic associative memory via VSA/HDC.

In WunderOS, customer agents run unchanged. Agentic frameworks issue native primitives unawares. WunderOS intercepts them invisibly, where it can provably improve upon them, answering them as syscalls. No LLM calls in any internal hot path. Agentic frameworks are the new userland.

Unification

One binary-vector substrate absorbs data streams that otherwise demand separate stores. All become Pentads; all participate in the same bind/bundle/resonate algebra.

• Agent exhaust: observations, tool outputs, session logs.
• Enterprise facts: RDBMS, ERP, CRM, HRIS. See §4 (Institutional).
• Dense embeddings: what a vector database (HNSW, IVF-PQ) would hold.
• Multimodal features: images, audio, via learned VSA projectors.
• Case-based analogies: relational patterns, reasoning cases.

Principle

LLM Minimality. Every primary path is LLM-free. Frontier calls are a fallback, never the default. They decay as per-tenant small models distill from them. Each is opt-in, metered, and recorded in Lineage.

Core Operation

Single-hop resonance: ~100ns. Binding: ~200ns. Multi-hop CSR query and inference linear in beam width, not query depth—a 10-hop query costs the same as a 3-hop query. 16,384-bit binary vectors, AVX-512 Hamming distance. No GPU required.