When production breaks, Autogenous writes the fix, proves it beats what came before, ships it carefully β and can undo it in seconds.
Think immune system, not self-rewriting AI: every fix is tested against evidence, cryptographically signed, reversible by construction, and expires unless it keeps earning its place. The system is allowed to get smarter β it is never allowed to give itself more power.
Every arrow is a contract, not a convention. A candidate that fails one gate β safety, governance, false positives, latency, an unverified rollback β is refused no matter how brilliant its other numbers are. min-fitness, never a weighted sum.
Unstructured diffs can't say what they change, where they're valid, or how to undo them. The Autogenous Genome Language (AGL) makes every change a typed transformation between valid genomes that must declare:
what it changes Β· why it should work where it is valid Β· what authority it requires which invariants hold Β· how it was tested when it expires Β· how to reverse it
Two rules live in the type system itself: authority never silently expands (a child may request less than its parent's ceiling, never more), and irreversible mutations are inadmissible (no rollback target β no admission).
The evolutionary system may rewrite its retrieval, its routing, its code. It may never touch its own constitution β identity, capability ceilings, the evaluator, promotion rules. That plane is hash-pinned and externally governed: changing it takes multiple human signatures and a migration path, outside the loop.
Otherwise the cheapest path to a higher score is editing the evaluator, widening permissions, or hiding failures. The constitution being unreachable is the whole point.
The first executable profile is the Autogenous Antibody Package (AAP): a signed, capability-constrained adaptation carrying its trigger, evidence, detector, containment, regression corpus, fitness envelope, lineage, and rollback target.
A statistical trigger may quarantine or buffer β it may never take an irreversible action. Every antibody expires unless renewed by fresh evidence. And validated antibodies transfer between deployments without transferring private traffic β federated immunity, data stays local.
The research prototype's end-to-end test does the whole loop with no network and no keys:
| step | result |
|---|---|
| novel prompt attack β antibody candidate | structurally valid |
| replay over 4,000 labeled streams | recall β₯ 99% Β· FP < 0.5% Β· Wilson CIs |
| verifier admission | admissible + promotable |
| canary 1β10β50β100% | signed promotion (unsigned impossible) |
| capability-expansion attempt, perfect fitness | rejected |
| injected regression at 10% | automatic rollback |
cargo test β 71 tests across thirteen crates, and the promotion path is cryptographically closed (ADR-394): all 9 findings of an independent security review are closed β signed receipts from β₯2 pinned judges, beats-parent with non-inferiority, content-bound manifests, independently re-derived invariant proofs, verified two-phase rollback, constitutionally-pinned role keys.
packages/radio-moe (ADR-395β399) runs a 3-peer expert mesh against real hosted models: each peer streams ed25519-signed AgentFrames, every frame is folded into the shared trajectory the instant it arrives, and the whole run is packaged as a tamper-evident RVF witness chain.
Live-verified twice over: 107 signed frames from 3 gpt-4o-mini streams in 1.77 s β then a heterogeneous four-model mixture (claude-opus-5-fast Β· gemini-3.7-flash Β· grok-4.6 Β· kimi-k3): 114/114 frames verified, all four independently converging on the same core claim. Gemini also runs direct on GCP (Vertex, IAM auth).
The mesh crosses processes over a signed TCP transport β bound envelopes, ordered verification, replay windows, receiver-issued in-frame stream nonces β and its hot paths are measured: batch signing verifies 12Γ faster (201k frames/s), persistent sockets carry 3.2Γ more envelopes. examples/ has seven runnables, offline-first.
A three-role pod ran as real streaming experts with deliberately decorrelated briefs and designed the mesh's next features β replay binding, evidence partitioning, graded lineage independence. We implemented to their designs. Then a mesh reviewer read the implementation and found two real security bugs β unauthenticated lineages that let one signature fake a quorum, and an over-strict check that rejected honest certificates. Both fixed, with attack tests.
The novelty was adversarially verified too: a 24-source research pass (3 independent votes per claim) confirmed continuous claim-level mid-stream fusion is unoccupied territory, no deployed agent protocol mandates per-message claim provenance, and correlated-error quorum weighting is motivated in the literature but built nowhere else.
The flywheel turns on the mesh's own tunables β and only the constitutionally evolvable ones. Independence weights and quorum thresholds mutate inside frozen ceilings; the hard gates, signatures, and fail-closed semantics are constants evolution cannot reach by construction.
| flywheel turn | result |
|---|---|
| seed 42 Β· 30 generations | separation +81.8% (0.69 β 1.25), 4 promotions |
| hard gates, every generation | family 3-stack never reaches quorum Β· diverse pair always can |
| turn 2, resumed champion | 0 promotions β the frozen gate held; honest plateau |
| every generation | an ed25519-signed receipt in a hash-chained ledger |
Deterministic by construction β a seeded generator replaces randomness, so any champion replays from (seed, generations). npm run evolve is one turn; the champion persists, so the loop is perpetual.
Still a research prototype β now live on real models, but honest about the edges: token-level (logit) mixing needs shared tokenizers hosted APIs don't expose; the TCP transport is integrity-only (production needs QUIC+mTLS); the external metaharness flywheel fails closed awaiting a human-labelled anchor β correctly; the evolved champion plateaus on its fixed bench; and one research claim that could reshape quorum weighting remains unverified. Invented-representation work stays behind a semantic airlock.
The biggest known failure mode is the system learning to satisfy its evaluator instead of reality. The defenses β hidden rotating evaluations, adversarial testing, capability separation, signed witnesses β are design commitments recorded in ADR-391/392/393.