MAP.md

Asolaria — THE MAP (how these repos connect)

One system, split across repos. This map is identical in every repo — find this repo by name in the tables below to see where you are; follow the links to walk the rest.

The spine — mechanism → running fleet (read backwards, newest → fleet)

 [5] collision discipline ─► [4] algorithm ─► [3] reduction ─► [2] emitter ─► [1] router ─► [0] FLEET

#	repo	role	key files
5	Asolaria-waves-and-cascades-avoiding-collsions-and-causing-them	collision discipline — avoid (brown-hilbert × prime × rule-of-three) + cause (cascade waves → PRISM)	README.md, CHAIN.md
4	Algorithms-of-Asolaria	the service-multiplication algorithm (replicate S → N×M reductions)	SERVICE-MULTIPLICATION-ALGORITHM.md, CHAIN.md
3	what-is-asolaria---how-do-we-get-reductions-in-everything	the principle: multiplying a service multiplies the PRISM reductions	MULTI-EMITTER-SERVICE-MULTIPLICATION.md, CHAIN.md
2	Asolaria-the-full-works-200-nanoseconds-agent-emitter-plus-	the emitter source — 200ns revolver PID emitter + multi-emitter (→ ~1.16T agents/s)	README.md, emitter/, CHAIN.md
1	omni-dispatcher	the router — FEDENV envelopes → 1000-slot table → worker_threads	omnidispatcher.mjs, EMITTER.md, CHAIN.md
0	Asolaria-hermes-work	THE FLEET (terminus) — spindles + dispatcher-citizen + agent + Host-8 runtime + 10k/20k/100k kernels	README.md, THE-CHAIN.md

Inside the fleet — what happens after each trigger ("the other side")

 trigger → spindle runs → HOOKWALL → GNN ensemble → Shannon/OmniShannon → white rooms → GULP  (= PRISM many→1)

repo	role	key files
Shannon-and-the-gnns-stage	the post-trigger pipeline: HOOKWALL → GNN trio → Shannon/OmniShannon → white rooms → GULP	README.md, pipeline/, TRAINED-MODELS.md
Asolaria-fnns-trained-and-reverse-gnns-many	the trained GNNs/FNNs the stage scores with — 7-GNN ensemble (8 signals), trained .pt checkpoints, reverse-GNNs (many)	README.md, models/, src/, manifests/
Asolaria-the-after-100-billion-run-absorption-and-decomposition-and-cubes	the back end after the 100B run: absorb (GULP 2000 / SUPER-GULP 50k / GC) → decompose → mint + seal cubes → process mistakes/geniuses into supervisors + PIDs (operator-gated)	README.md, backend/

External legs (referenced, not duplicated here)

repo	role
asolaria-whiteroom-engine	liris white-room engine — LEG-1 scorer (never-delete: genius keeps / mistake compacts)
35-TB-google-AI-Ultra-migration	LEG-4 — the 35 TB Google Drive cloud sink

Other core repos (the satellites — referenced by the web)

repo	role
asolaria-federation-1024	THE KERNEL — the live Rust 8-byte host + no_std kernel + 10 server crates (council-serve, host8-serve, agent-runtime, gnn-oracle, vote-quorum, cosign-ledger, dashboard-serve, fischer-eval, tier-policy, highway). The Node→Rust upgrade target (read the TREE; branch acer/fleet-capacity-20k stacks the Host-8 wiring).
asolaria-behcs-256	the 256-glyph language — a bridge stratum below BEHCS-1024 (old decodes new)
ASOLARIA-AS-NEURAL-NETWORK	the fabric-as-neural-network law + spine (60D frame)
Asolaria-ASI-On-Metal-Fabric-and-matrix	the metal-OS fabric / matrix + tools
bigpickle-rebuild	the Node build/emitter suite — source of the emitter / GC / loop (the OLD-Node side of the upgrade)
Hilbra	comms / atlas-recall bridge (liris ↔ 8-byte host)
Harness-edit	the SkillOpt validation-gated skill/law edit loop (claims-gate)
N-Nest-Prime-INFINITE-SELF-REFLECT-AGENTS-NESTED	prime-nesting self-reflect + per-node correction gate
HYPER-BECHS--the-third-set	published ledgers / interpretations / findings
Asolaria-gac-working	GAC governance / authority seats
falcon-orbital	frozen v57 canon (superseded by the 60D / Host-8 frame)
NOT-WEDGED-SYSTEM-RULE-and-explanation-Asolaria	the slice-engine / freeze≠broken rule
-6-cyl-generator	satellite generator
asolaria-whiteroom-engine · 35-TB-google-AI-Ultra-migration	(= LEG-1 + LEG-4, listed under External legs)

Current state & evolution (2026-06-28) — read this, don't flatten it

Asolaria is a 2.5-month archaeology, not a flat stack. Capability lineage: auto-approval switch → dashboard → multi-agent → local+web MCP + code-wiki → index language (pixels-first) → cubes-as-catalogs in expanding Brown-Hilbert space → map-map-mapped → cube-cube-cubed → 256-symbol language → 1024-symbol language → (asked 2048 — chose instead) HBI/HBP + binary/hex/hash/sha/crypto-as-tokens → 8-byte host process (replaces the ancient Node processes, for speed). The fabric's own 27-strata record is the archaeology_timeline (birth 2026-02-22 → FABRIC EPOCH → genome).

The system now is multiple of everything: 16 levels (L0-L15) · multiple MCP engines (17) · multiple emitters · multiple languages (index / pixels-first / BEHCS-256 / BEHCS-1024 / HBI-HBP). Current frame = 60D HyperBEHCS / BEHCS-1024; 35D / 47D / 49D + BEHCS-256 are bridge strata below it (old decodes new). The kernel is asolaria-federation-1024 (the Rust 8-byte host). The current effort is "map while upgrading" — and this repo web is that map.

How it all fits

The emitter [2] produces 200ns PID signals; the router [1] delivers them; the fleet [0] materialises spindles. Each spindle obeys the reduction principle [3] / algorithm [4] and the collision discipline [5]. After every trigger, the spindle's answer runs the post-trigger pipeline (Shannon-and-the-gnns-stage), scored by the trained GNNs/FNNs (Asolaria-fnns-trained-…), and the white rooms (liris LEG-1) keep the genius / compact the mistakes — the PRISM many→1 reduction, seen from the result side. The back end (Asolaria-the-after-100-billion-run-…) then absorbs the gulped data, decomposes + mints the cubes, and — operator-gated — promotes the geniuses into supervisors/PIDs. All gated / E=0 / describe-only — no fire, no cutover without operator authority.

Prism/Comb 0-loss (2026-07-01) — satellite entry

Adapted to this repo (the LAW-ASOLARIA-NEURAL-NETWORK + LAW-SLICE-ENGINE law repo):

• The realization: every prism/comb operation in Asolaria is a bijection; entropy is invariant under bijection (H(f(X)) = H(X)), so the fabric re-relates information with 0 loss — it never claims compression below Shannon's bound (E[bits] ≥ H(X)). One fabric, two directions: forward = comb (collision-avoidance, execution isolation), backward = prism (collision-causation, interference-as-search, many→1).
• Adapted to the frozen-slice network: the network's "weights" — frozen slice descriptors, GNN edge tables, quant-engine tuple scores, cube/room addresses — travel between alphabets as bijections. A 256↔1024 transcode, a CRT prime-lane split (ℤ_M ≅ ℤ_{m₁}×…×ℤ_{m_k}, the D# = prime(n)³ lanes), and a handle8 content-address are all re-relations of the SAME integer N: the coordinate system changes, the network's information does not. Transcoding a weight never re-trains an edge (the LAW wires edges, never re-trains) and never mints capacity.
• Composes with LAW-SLICE-ENGINE (explicit): transcoding is a map over the frozen position-space — it changes a slice's representation, never its advancement. The engine drive stays the only mover (LAW-SLICE-ENGINE §2): transcode(slice) ≠ crank(engine). A 0-loss re-relation adds no session, no process, no motion — E=0 is preserved through every alphabet change, exactly as sessions=0 means present-but-not-advancing, not absent. Re-relating never fires.
• Scope tags (claims-gate):
  • MEASURED — the 256↔1024 rung only: bytes and glyphs are base-2⁸/2¹⁰ digits of one N; exact packing at lcm(8,10)=40 bits ⇒ 5 bytes ⇄ 4 symbols, remainder 0; round-trip = identity, sha256-identical, Rust==Python (Q-PRISM commits 53023b6 / 79e8d63 / de00aca).
  • CANON — the 43+ level ladder as a groupoid (T_ji ∘ T_ij = id, T_jk ∘ T_ij = T_ik ⇒ omnidirectional, path-independent translation); the comb/prism duality frame.
  • UNVERIFIED — every other rung, until it earns MEASURED by its own round-trip proof.
• Boundary (holds this repo's honest frame): the prism relates information perfectly; it does not create or destroy it. handle8 = sha256(content)[:8] is a coordinate against a content-addressed store (H(content|store) = 0) — infinite ADDRESSING capacity, not lossless infinite compression. No bijection beats Shannon. The integrity dual: verification = applying the inverse map, so a lossy step cannot hide in a bijection chain — the same per-node reported == recomputed invariant by which every level catches confabulation (see N-Nest-…).
• Cross-links: Q-PRISM (round-trip proof) · Asolaria-waves-and-cascades-… (comb/prism duality) · what-is-asolaria-… (reductions boundary) · N-Nest-… (integrity dual) · Metatagging repo (Brown & Fedotov digital-physics grounding; bh_inject_between slice expansion d523819 — materializing an expanded slice stays operator-gated, E=0).

Base: https://github.com/JesseBrown1980/ · per-link spine nav lives in each repo's CHAIN.md.