Add Rainbow Raccoon / FAMM / NUVMAP architecture manual

(cherry picked from commit b7f3ce59d964108a3084ce66c1f53af9f0bc18b8)

docs/architecture/RAINBOW_RACCOON_FAMM_NUVMAP_MANUAL_2026_05_20.md

@@ -0,0 +1,232 @@
+# Rainbow Raccoon / FAMM / NUVMAP Architecture Manual
+
+Status: BEAUTIFUL_PROVISIONAL
+Date: 2026-05-20
+
+## Core Keeper Equation
+
+D_hat = V ∘ R ∘ L ∘ E_AttnRes ∘ C ∘ B ∘ N ∘ RRC ∘ Gamma ∘ S(D)
+
+Meaning:
+
+- S(D): Static Astro Equation Computer
+- Gamma: gamma/astro carrier packets
+- RRC: Rainbow Raccoon Compiler manifold typing
+- N: NUVMAP sparse projection
+- B: BraidStorm traversal
+- C: chirality admissibility gate
+- E_AttnRes: eigensolid closure with selective residual history retrieval
+- L: logogram expansion
+- R: residual repair
+- V: exact verification
+
+## Primitive
+
+The primitive is no longer storage.
+
+The primitive is:
+
+admissible reconstruction topology with selective residual memory.
+
+## Compression Interpretation
+
+Traditional compression:
+
+object -> smaller object
+
+This architecture:
+
+object -> lawful manifold deformation -> sparse replay skeleton -> replay -> exact object
+
+The object itself is not the primary stored artifact.
+
+The stored artifact is:
+
+- lawful traversal
+- stable reconstruction skeleton
+- residual repair stream
+- receipt proofs
+
+## Rainbow Raccoon Compiler
+
+RRC determines manifold type before routing.
+
+RRC(D) = (M_k, Lambda_k, Phi_k, chi_k, epsilon_k, M_semantic)
+
+It decides:
+
+- which transforms are lawful
+- which braid routes are admissible
+- which eigensolid closures are legal
+- which reconstruction grammar applies
+
+## Semantic Mass Numbers
+
+M(D) = f(compressibility, symmetry, closure stability, reuse, invariance)
+
+Semantic mass estimates:
+
+- lawful transport cost
+- reconstruction stability
+- traversal complexity
+- residual risk
+
+## NUVMAP
+
+NUVMAP is sparse topological address space.
+
+Typical coordinate:
+
+nu_i = (r_i, chi_i, sigma_i, q_i, h_i)
+
+Millions of braid candidates collapse into sparse occupied manifold regions.
+
+## BraidStorm
+
+BraidStorm explores lawful reconstruction traversals.
+
+beta_i = traversal strand
+
+B(D) = sum_i beta_i
+
+Crossings represent reconstruction operations.
+
+## Chirality
+
+Chirality is orientation admissibility.
+
+Local braid chirality is directional.
+
+Eigensolid chirality becomes a quasi-omnidirectional orientation spectrum after closure.
+
+## Rope Aggregation
+
+Compatible braid families collapse into rope bundles.
+
+R_j = sum(q_i beta_i)
+
+Ropes store:
+
+- semantic mass
+- residual pressure
+- closure score
+- traversal moments
+- receipt hashes
+
+## Eigensolids
+
+Eigensolids are stable reconstruction bodies.
+
+E* = Closure(sum_i R_i)
+
+An eigensolid is:
+
+- stable
+- replayable
+- low residual
+- admissible
+- closure-preserving
+
+## Logogram Alphabet
+
+Logograms are callable reconstruction glyphs.
+
+Field glyphs:
+
+rho, Omega, mu, Phi
+
+Carrier glyphs:
+
+Gamma, chi, kappa, tau, Lambda, epsilon
+
+Traversal glyphs:
+
+beta, R, E*, otimes
+
+Repair glyphs:
+
+Delta, oplus, r
+
+Verification glyphs:
+
+V, H, equivalence
+
+## Residual Repair
+
+D_exact = D_approx oplus Delta
+
+Approximate lawful replay is allowed first.
+
+Exactness is restored afterward.
+
+## Verification
+
+V(D_hat, D) = 1 iff D_hat == D
+
+Verification modes may include:
+
+- byte exact hashes
+- deterministic replay
+- Lean proofs
+- SAT/SMT witnesses
+- rational arithmetic verification
+
+## FAMM Scar Memory
+
+FAMM stores prior traversal and obstruction experience.
+
+A scar is a remembered overlap obstruction.
+
+FAMM acts as finite associative manifold memory.
+
+## Attention Residuals Fold-In
+
+Source:
+
+Kimi Team, Attention Residuals, arXiv:2603.15031.
+
+Key imported principle:
+
+Do not accumulate all history with unit weight.
+
+Instead:
+
+E_AttnRes = Closure(sum_i softmax(M_i - Omega_i + S_i) R_i)
+
+Where:
+
+- M_i = semantic mass
+- Omega_i = obstruction burden
+- S_i = FAMM scar support
+- R_i = rope/eigensolid state
+
+Block AttnRes corresponds directly to:
+
+braids -> ropes -> eigensolids
+
+## Inclusion-Exclusion Fold-In
+
+Eigensolid closure behaves like topological inclusion-exclusion.
+
+M(E*) = sum_i M(R_i)
+          - sum overlap(R_i, R_j)
+          + higher-order closure corrections
+
+The stable reconstruction body is what remains after overlap cancellation.
+
+## DwarFS Interpretation
+
+DwarFS demonstrates a practical analog:
+
+mountable compressed archive
+-> random-access replay surface
+-> lazy reconstruction
+
+Project translation:
+
+not decompress-then-use
+but mount-and-replay.
+
+## Final Compact Statement
+
+Compression = lawful manifold replay + residual exactness + selective residual memory.