ZFORGE · ARCHITECTURE · MMXXVI
ZFORGE · GEOMETRIC COMPILER

Architecture

The geometric compiler is recorded as one stack of nodes, one authority order and one compile loop. Part 1 states them. Part 2 lists each architecture variant drawn on that framework, with the nodes or stages it occupies and its status as the sources record it. Part 3 maps the Compiler Atlas nodes onto the layers of the research map.

§ 01 / 03

General framework

Stack

The Compiler Atlas lists twenty-one nodes in eight bands. Only gate nodes carry DECIDE, and only a DECIDE edge commits state. Stage is the node’s position on the layer evolution ladder: S0 named, S1 contracted, S2 anchored by an external result, S3 gated by a runnable, failable test, S4 measured against a frozen bar, S5 executing. ⚑ marks a node in which a contradiction was found and paid for.

Compiler Atlas nodes by band · stage from the Compiler Atlas (const N); the layer evolution ledger (2026-08-27) covers L0–L9 and R
NodeNameStageGate
UPSTREAM — GEOMETRIC INTERFACE
U1State + intrinsic geometryS1—
U2MGATE — metric selectionS1gate
U3Correspondence TS1—
CG𝒞_GT contract gateS1gate
U4Completion — diffusion / flow-matchS1—
U5ReconstructionS1—
TIER 1 — SUBSTRATE
A7Admission gateS3gate
L1Structural IRS3—
L2Operator domainS3—
TIER 2 — GEOMETRY & DYNAMICS
L3Transport geometryS3 ⚑—
L4StateS1—
L5Potential / dualS2—
L6Generator — sector assemblyS3 ⚑—
TIER 3 — VERIFICATION & COMMIT
L7Guard — four-valuedS4 ⚑gate
L8Event surface — base / surgeryS3 ⚑gate
TIER 0 — SPECIFICATION
L0Type / proof layerS2 ⚑—
TIER 4 — EVOLUTION
L9Higher spectral responseS2—
RRSI / operator memoryS1—
CODE SPINE (ZFORGE)
SPCompositional spine (ZForge)——
FEEDBACK
F1Metric evolution——
F2Operator memory feed——

The research map uses a second stack: layers L0–L10 and two vertical members, V1 neural proposal and V2 construction IR (intermediate representation). Both stacks use the ids L0–L9 with different meanings. Part 3 relates them; elsewhere on this page the map’s layers are called map layers.

Authority order

LEARN → PROJECT → VERIFY → DECIDE

The implemented order. It is stated in the operator contract Γ_D of the learned anisotropic Laplacian: “The network emits a raw tensor (LEARN); the admissibility projection makes the structural certificates true by construction (PROJECT); the verifier measures what the projection does not construct (VERIFY); only then is the operator admitted (DECIDE).” The network never decides whether its own operator is valid, and a projection never becomes a penalty. A run may skip a stage it does not have; it may not reverse two it has.

Status: directive D03, the contract Γ_D and the authority-order check, closed 2026-09-22 with 66 tests. Its ten certificate rows are not yet placed in the field compiler’s gate table; they are deferred until a stage producing a tensor field exists.

Documents → Learned Anisotropic Laplacian V2 — Admissible Operator · Build Record — Learned Anisotropic Laplacian V2

Earlier formulations, not reconciled with the implemented order

  • PROPOSE · PARAMETERIZE · DECIDE: edge labels of the canonical DAG (architecture map, 2026-08-27). Authority is labelled on edges, never on nodes. Every DECIDE row is compiler-owned; no path reaches a commit without passing a DECIDE gate; no learned edge writes the stratum τ, the ledger, the event trigger or promotion.
  • LEARN → PROPOSE → CONSTRAIN → CERTIFY → DECIDE: the learning plane of the Architecture Atlas (2026-09-20), kept separate from its run-time control plane, spectral gap → projector stability → structural authority → compute allocation.

At run time the default is to execute: the veto is armed only at the five hard stops, in STRICT mode and at the promotion boundary. The Architecture Atlas reads every gate, certificate and refusal on the build-time clock and at the promotion boundary.

Compile loop

X → 𝒜_θ → G_𝒜 → L_𝒜 → Spec(L_𝒜) → d_𝒜 → M → P_adm → Φ(P) → (r_geom, r_op) → 𝒜′_θ

One chain from observation to a grown operator algebra, with two returns: a nonzero operator residual r_op returns to 𝒜_θ as a missing primitive; the geometric residual r_geom returns to P_adm (fidelity). Every card in Part 2 except F2, a method, attaches to stages of this chain (Architecture Atlas §4 map).

Stages, questions and objects · Architecture Atlas §2
StageQuestionObject
XWhat was observed?measurement y = 𝒪(X)
𝒜_θWhat relations are learned?relational algebra
G_𝒜What structure does it induce?information-flow graph
L_𝒜What operator results?Laplacian / Hodge / constitutive operator
SpecWhat invariant coordinates emerge?spectral signature Σ
d_𝒜What metric follows?resistance / diffusion / response metric
MWhat geometry follows?chart (derived)
P_admWhat compact language explains it?stratified admissible program space
Φ(P)What geometry does the program produce?realized object, certificate
rWhat remains unexplained?typed residual
𝒜′Does the residual justify a new primitive?grown algebra

View A of the Compiler Atlas runs the same loop over the nodes as a cascade: U1 → U2 → U3 → CG → U4 → U5 → A7 → L1 → L2 → L3 → L4 → L5 → L6 → L7 (commit) → L8 (event) → L2 (re-admission) → L7 (certificates re-established) → F2 → R (promotion decided at the external verification boundary, EVB) → F1 → U2.

Cascade → view A

§ 02 / 03

Architecture variants

A variant is an architecture drawn on the framework of Part 1. Four are drawn as views of the Compiler Atlas. Seventeen are catalogued as cards in the Architecture Atlas document and are not drawn as views. Each status is quoted from its source with the source’s date; none is promoted above the tier its source gives it.

Compiler Atlas views

  • ACanonical DAG: the upstream interface tier U1–U5, the standing stack L0–L9 with R, the code spine and the feedback edges, drawn as one graph.
  • GTyped geometric intermediate representation (TGIR): the same machine drawn for a compiler audience; nodes map to the canonical layers and share their dossiers.
  • SStrata: history; developmental rounds G0 and R001–R010, newest on top, with the nodes each round created or revised.
  • LLineage: history; each node on its program thread, with its birth coordinate τ and recorded revisions.
  • FField compiler: the stack instantiated as a build (round R009); each stage occupies a stack slot and reuses the stack’s semantics.
  • OOperator response: prototype plan of 2026-09-22, eight layers on one closed mesh, each slotted to a stack node.

All twenty-one nodes by band → view T (TIERS)

On each view card, “Map layers” is computed from the crosswalk of Part 3: the map layers reached by the view’s nodes, direct if any node reaches the layer directly. It is derived, as the crosswalk is, and awaits the same owner review.

COMPILER ATLAS · VIEW A · ASCII DAG

Canonical DAG

The upstream interface tier U1–U5, the standing stack L0–L9 with R, the code spine SP and the feedback edges F1 and F2, drawn as one graph. Authority is an edge label, never a node; only gates carry DECIDE.

Nodes
All 21
Map layers
direct: L1 · L3 · L6 · L7; partial: L0 · L2 · L4 · L5 · L8 · L9 · V1 · V2; not reached: L10
No map layer
L4 · L5 · L8 · L9 · SP
Status
Organizing document, tier ARCHITECTURE throughout, no build status (2026-08-27). Code attached to nodes, as recorded in the Compiler Atlas (2026-09-20): BUILT at L0, L2 and L7 (L7: 686 tests); PARTIAL at A7, L1 and SP; ABSENT at L6 (automatic differentiation).
Measured
Guard L7: claim 27, recorded MEASURED; the layer evolution ledger calls it the stack’s only S4 evidence (2026-08-27).
Documents
The architecture-map documents that define this graph are not on the portal.
COMPILER ATLAS · VIEW G · TGIR VIEW

Typed geometric intermediate representation (TGIR)

The same machine drawn for a compiler audience: a type environment and structural contracts (L0); a medial intermediate representation holding state, skeleton, spectrum, topology, fields, operators and certificates (L1); typed geometric operators (L2) branching into spectral operators, a Hamiltonian lift (L6) and Finsler/Randers drift (L3); structural verification (L7) that composes on PASS and repairs or rejects on FAIL; and a backend that commits typed transitions (L8).

Nodes
L0 · L1 · L2 · L6 · L3 · L7 · L8 · SP
Map layers
direct: L3 · L7; partial: L0 · L1 · L2 · L4 · L5 · L8 · L9 · V2; not reached: L6 · L10 · V1
No map layer
L8 · SP
Status
The view carries no status tags. Node code attachments are those of view A.
Measured
None stated in the view.
Documents
No portal document.
COMPILER ATLAS · VIEW F · FIELD

Field compiler

The stack instantiated as a build (round R009). Two authoring inputs, a divisor authored as zeros and poles and a lasso drawn with its topology inferred, pass through the admission budget C = Z + P − χ (A7), the medial singular set and the FeatureComplex (L1), the Abel–Jacobi gate for χ = 0 (L7), the η field → frame → ω₄ bridge (L2, L3) and discriminant walls between chambers (L8), then resolution → seamless chart → quad flow. Fitters, the GL step and motifs propose; budgets, Abel–Jacobi and holonomy decide.

Nodes
A7 · L1 · L7 · L2 · L3 · L8
Map layers
direct: L1 · L3 · L7; partial: L0 · L2 · L4 · L8 · L9 · V2; not reached: L5 · L6 · L10 · V1
No map layer
L8
Status
Abel–Jacobi gate code BUILT, waiting for its generator (round R009), as recorded in the Compiler Atlas (2026-09-20).
Measured
Abel–Jacobi closure Σ(kᵢ − 4)pᵢ ≡ 0 (mod Λ) measured on the torus: the divisor-cap experiments.
Documents
The Orientation Atlas · Compositional Geometric Programming — Final Paper · Formal Companion · Circle-Back Ledger
COMPILER ATLAS · VIEW O · OPERATOR RESPONSE

Operator response

Prototype plan of 2026-09-22 for one closed mesh: topology M → d₀, d₁ (L1; certificate d₁d₀ = 0 and χ = β₀ − β₁ + β₂ at A7), metric (d, M) → ★₀, ★₁, ★₂ (L3), operator ★, d → L₁ (L2), field L₁, f → x (L6), response R = ⟨f, (L₁ + λ)⁻¹ f⟩ (L5), invariants Φ (L0), a symbolic law F (F2 → R; E4–E5 at F1), and verification by tests A, B, C and F (CG) with verdicts pass, fail or not applicable, mapped to allow, block or defer (L7).

Nodes
L1 · A7 · L3 · L2 · L6 · L5 · L0 · L8 · F2 · R · F1 · CG · L7 · SP
Map layers
direct: L1 · L3 · L7; partial: L0 · L2 · L4 · L5 · L6 · L8 · L9 · V1 · V2; not reached: L10
No map layer
L5 · L8 · SP
Status
Kernel and eight-layer pipeline built; E0 to E3 and E4-min run, 2026-09-23 to 2026-09-27. E0 passes. E4-min recovers one constitutive parameter. E2 fails its null controls. E1 does not reach its pre-registered support. E3 traces the refinement failure to the coexact forcing's sample point. E5 not built.
Measured
Operator features against raw posed coordinates, held-out relative error at n = 8: 0.400 against 9.78 (E1, plan construction). The symbolic search accepts a spurious law in 16 of 20 noise-only seeds (E2). One constitutive scalar is recovered to 1.3e-3 relative on three families (E4-min).
Documents
Five Problems on One Operator Substrate · The Inverse Compiler: Invariant Extraction Is Not Realization

Architecture Atlas cards

Each card quotes the Architecture Atlas: its one line, the spine stages it attaches to as primary (§4), its tier and, where the tier includes one, its measured result. None is drawn as a Compiler Atlas view. Statuses are as of 2026-09-20; a later change is noted, with its date and source, where a later record states it.

ARCHITECTURE ATLAS · A1 · SUBSTRATE

Mesh-as-Field System

“Treat a completed mesh as a discrete geometric field system: propagate information through its incidence structure, decompose the resulting fields into invariant modes, and discover the constitutive laws relating those modes by symbolic regression.”

Spine
G · L · Spec
Tier
[ARCHITECTURE]; the Hodge/Laplacian/resistance mathematics underneath is [ESTABLISHED] (Lim 1507.05379 — most of discrete Hodge theory is the linear algebra of AB = 0; Devriendt 2010.04521 — effective resistance is a metric generated by Laplacian/simplex/Schur structure; Xu 1905.13211 — algorithmic alignment lowers sample complexity under its assumptions)
Documents
The Architecture Atlas — Origins to Present
No Compiler Atlas view2026-09-20
ARCHITECTURE ATLAS · A2 · SUBSTRATE

Spectral Virtual Machine

“Make the operator record — not the neural layer — the fundamental instruction, so that networks become one implementation of an operator and conventional architectures become compilation targets.”

Spine
L · Spec
Tier
[ARCHITECTURE]
Documents
The Architecture Atlas — Origins to Present
No Compiler Atlas view2026-09-20
ARCHITECTURE ATLAS · A3 · SUBSTRATE

Local Operator Dynamics

“Global behavior from iterated local operator dynamics on the geometric substrate, with prediction separated from constraint enforcement.”

Spine
L
Tier
[POSITION] — hypothesis (“global intelligence = iterated local operator dynamics”), with the caveat that harmonic extraction may itself need global communication
Documents
The Architecture Atlas — Origins to Present
No Compiler Atlas view2026-09-20
ARCHITECTURE ATLAS · B1 · TRANSPORT

Constitutive Structural Message Passing

“Message passing is transport; make it constitutive — weight edges by the geometry’s admissible motion, protect a certified structural subspace, classify what remains.”

Spine
G · L · r
Tier
[MEASURED] (first run), [ARCHITECTURE] (the layer)
Measured
Quad surface, n = 40, depth L = 64. Corner error: GCN 28.4°, spectral low-mode protection 0.8°, constitutive 2.8°. Smooth-region error in units of input noise: 7.1×, 1.4×, 0.13×. At n = 56: constitutive corner error 0.7°; spectral protection 7.3°.
Documents
The Architecture Atlas — Origins to Present · GNN Over-Smoothing as Unconstrained Transport · From Thesis to Operator — the Quad-Surface Test
No Compiler Atlas view2026-09-20
ARCHITECTURE ATLAS · B2 · TRANSPORT

Response Representation and the Induced-Metric Family

“Represent an object by its response to structured probes, and let the metric be chosen from an operator-induced family rather than learned free.”

Spine
L · d
Tier
[ARCHITECTURE] with a [MEASURED] beachhead (transition metric; ν as reachability registered at BRIDGE tier)
Measured
Beachhead: the transition metric, a learned metric on program space.
Documents
The Architecture Atlas — Origins to Present
No Compiler Atlas view2026-09-20
ARCHITECTURE ATLAS · C2 · CERTIFICATION

Spectral Projector Certificate and Gap-Driven Authority

“Certify the invariant subspace, not the eigenvectors; let the spectral gap decide how much to trust it and how much compute to spend.”

Spine
Spec
Tier
Perturbation theory [ESTABLISHED]; the control-plane use [ARCHITECTURE]
Documents
The Architecture Atlas — Origins to Present · The Cohomological Compiler
No Compiler Atlas view2026-09-20
ARCHITECTURE ATLAS · C3 · CERTIFICATION

The Norm-Separated Fidelity Gate

“L² buys spectral coordinates and pays in the wrong currency; certify uniform claims in L∞, and for the discrete object just take the max.”

Spine
Φ
Tier
[ESTABLISHED] mathematics, [MEASURED] defect, [ARCHITECTURE] gate structure
Measured
The fidelity gate in workbench/compile_gap.py read chamfer, a mean, where hausdorff, the supremum, belongs; witnessed Hausdorff/Chamfer ratios 2.68 and 4.50. Since 2026-09-15 the gate reads hausdorff (Gate Change Notice).
Documents
The Architecture Atlas — Origins to Present · The Norm the Gate Must Use · Gate Change Notice
No Compiler Atlas view2026-09-20
ARCHITECTURE ATLAS · C4 · CERTIFICATION

Stratified Admissibility and the Layered Gate Stack

“Admissible program space is stratified by the kind of evidence that admits a point, and that kind decides whether a gate can be differentiated, relaxed, or learned.”

Spine
P_adm · Φ
Tier
[ARCHITECTURE]; the torus counterexample [ESTABLISHED]
Documents
The Architecture Atlas — Origins to Present · Geometry as an Emergent Structure of Computation · The Norm the Gate Must Use
No Compiler Atlas view2026-09-20
ARCHITECTURE ATLAS · D1 · DISCOVERY

The Typed Residual and the Three Novelties

“Three different quantities are called ν; rename them, make the witness primary, and give every residual its provenance.”

Spine
r
Tier
[MEASURED] correction; [ARCHITECTURE] typed residual
Measured
spectral_novelty (spectral/laplacian.py:72) computes ν_shift and is named and cited as if it were the projection residual; the two can disagree completely. Since 2026-09-03 the function’s docstring states that it is not the projection residual, and the name is kept for compatibility (spectral/laplacian.py). The three quantities ν_shift, ν_state and ν_task are named separately in metrology/reachability.py (2026-09-03) and metrology/operator_span.py (2026-09-15).
Documents
The Architecture Atlas — Origins to Present
No Compiler Atlas view2026-09-20
ARCHITECTURE ATLAS · D2 · DISCOVERY

Operator Invention (R2) with Certified Admission

“Turn a persistent residual into a candidate primitive through typed symbolic search, and admit it only if it compresses the corpus and carries a certificate.”

Spine
𝒜_θ · r · 𝒜′
Tier
[ARCHITECTURE]; trigger exists, search does not (the Occam ladder already returns a non-canonical verdict with a reported residual)
Documents
The Architecture Atlas — Origins to Present · Learning the Language Before the Program · Geometry as an Emergent Structure of Computation
No Compiler Atlas view2026-09-20
ARCHITECTURE ATLAS · D3 · DISCOVERY

The Open-Ended Generative Loop

“Open-endedness through persistent residuals in an expandable typed algebra — mutate programs and operators, never coordinates.”

Spine
P_adm · Φ · 𝒜′
Tier
[POSITION] — “the least solved part”
Documents
The Architecture Atlas — Origins to Present
No Compiler Atlas view2026-09-20
ARCHITECTURE ATLAS · E1 · INVERSION AND REALIZATION

The Realization Ladder

“The inverse is a realization problem with an intermediate semantic layer; invariant extraction and object realization are different computational problems.”

Spine
P_adm · Φ
Tier
[ARCHITECTURE]; consistent with the frozen master description (this is its inverse side elaborated)
Documents
The Architecture Atlas — Origins to Present · Construction Graph IR Synthesis
No Compiler Atlas view2026-09-20
ARCHITECTURE ATLAS · E2 · INVERSION AND REALIZATION

The Spectral–Hodge Realization Ladder

“Spectral methods discover, encode, and stabilize candidate cohomological shadows; Hodge theory names the admissible sector; the cycle-class map realizes; the Hodge conjecture is the statement that the realization gap vanishes.”

Spine
L · Spec · Φ
Tier
Hodge statements [ESTABLISHED]; the ladder [ARCHITECTURE]; the “spectral persistence → Hodge persistence” bridge [POSITION]
Documents
The Architecture Atlas — Origins to Present · The Cohomological Compiler
No Compiler Atlas view2026-09-20
ARCHITECTURE ATLAS · E3 · INVERSION AND REALIZATION

Emergent Metric and the Two Inversions

“Upstream refuses to assume distance; downstream refuses uncertified programs; they meet at M — and the next commitment to remove is M itself.”

Spine
𝒜_θ · G · L · Spec · d · M
Tier
[CONJECTURE] with a stated discriminator; R4 not started; R5, R6 open
Documents
The Architecture Atlas — Origins to Present · Geometry as an Emergent Structure of Computation
No Compiler Atlas view2026-09-20
ARCHITECTURE ATLAS · F1 · PROGRAM ORGANIZATION

The Six-Rung Ladder, the 2-D Plane, and the Bibliography by Arrow

“R1–R6 are positions on the assumed/learned axis, not six topics; the second axis is how much authority discovered structure receives; papers attach to arrows, not to rungs.”

Spine
all ten stages
Tier
[ARCHITECTURE]; the bibliography [ESTABLISHED] at each paper’s own scope
Documents
The Architecture Atlas — Origins to Present · The Assumed and the Learned
No Compiler Atlas view2026-09-20
ARCHITECTURE ATLAS · F2 · PROGRAM ORGANIZATION

The Adversarial Literature Method

“claim → source → scope extraction → adversarial refutation → revised claim; a failed novelty claim becomes a narrower claim, never a rhetorical defense.”

Spine
not placed in the §4 map
Tier
[ARCHITECTURE] (method)
Documents
The Architecture Atlas — Origins to Present · The Norm the Gate Must Use
No Compiler Atlas view2026-09-20
§ 03 / 03

Crosswalk

The Compiler Atlas stack and the research map stack were written separately, and they share the ids L0–L9 with different meanings. Atlas L0 is the type and proof layer; map L0 is observation. Atlas L7 is the guard; map L7 is constitutive geometry. Atlas L9 is the higher spectral response; map L9 is Abel–Jacobi global admission. The table matches each Atlas node to map layers by comparing the two definitions. No source document states this crosswalk: every row is derived and awaits owner review.

direct: the definitions name the same object · partial: they share part of it
Atlas nodeMap layersBasisProvenance
U1 State + intrinsic geometryL0 Observation / geometric substrate (partial)Both take in observations: U1 estimates an SPD (symmetric positive-definite) state from a signal stream; map L0 turns an image, sketch, point cloud, mesh or simulation state into a FeatureComplex.derived by definition match, pending owner review
U2 MGATE — metric selectionL7 Constitutive geometry (partial)
V2 Construction IR / control plane (partial)
Map L7 holds the learned metric; the gate that commits a metric belongs to the control plane V2.derived by definition match, pending owner review
U3 Correspondence TL6 Transport / correspondence (direct)Both define correspondence by Gromov–Wasserstein transport.derived by definition match, pending owner review
CG 𝒞_GT contract gateL6 Transport / correspondence (partial)
V2 Construction IR / control plane (partial)
Checks the correspondence of map L6 against a contract; the map has no separate gate layer, and certificates belong to V2.derived by definition match, pending owner review
U4 Completion — diffusion / flow-matchV1 Neural proposal / inverse (partial)A learned proposal without authority; V1 proposes structure and never renders geometry.derived by definition match, pending owner review
U5 ReconstructionL0 Observation / geometric substrate (partial)Deterministic conversion to the substrate the stack receives.derived by definition match, pending owner review
A7 Admission gateL1 Topological admission (direct)Admission by integer invariants; view F slots the admission budget C = Z + P − χ to A7.derived by definition match, pending owner review
L1 Structural IRV2 Construction IR / control plane (partial)
L1 Topological admission (partial)
L0 Observation / geometric substrate (partial)
The IR belongs with V2, though no source states how the medial graph relates to the Construction Graph; the ledger of Betti numbers and Euler characteristic with map L1; the FeatureComplex, which view F slots to L1, with map L0.derived by definition match, pending owner review
L2 Operator domainL3 Spectral operators (direct)
L2 Graph & Hodge structure (partial)
Both state M → A → L → {Lᵏ, h(L), e^(−tL), (λ, u)} with polynomial degree as the reach bound; the harmonic sector matches map L2.derived by definition match, pending owner review
L3 Transport geometryL7 Constitutive geometry (direct)
L4 Transport diagnostics → constitution (partial)
Metric, drift one-form and constraints, with Randers drift, as in map L7; constitutive transport weighting as in map L4.derived by definition match, pending owner review
L4 StatenoneNo map layer types the state; map L8 evolves a state it does not type.derived by definition match, pending owner review
L5 Potential / dualnoneNo map layer of its own; the nearest is map L8's variational steps.derived by definition match, pending owner review
L6 Generator — sector assemblyL2 Graph & Hodge structure (partial)
L8 Variational / dynamical evolution (partial)
The sector split of map L2; the sectors that classify motion in map L8.derived by definition match, pending owner review
L7 Guard — four-valuedV2 Construction IR / control plane (partial)
L8 Variational / dynamical evolution (partial)
L9 Algebraic global admission (partial)
Certificate propagation with V2; the proximal repair step with map L8; the Abel–Jacobi gate code attached to L7 checks map L9's condition.derived by definition match, pending owner review
L8 Event surface — base / surgerynoneNo map layer for topology-change events.derived by definition match, pending owner review
L0 Type / proof layerL5 Typed operator algebra (partial)
V2 Construction IR / control plane (partial)
Types and signatures with map L5; type-checking with V2.derived by definition match, pending owner review
L9 Higher spectral responsenoneMap L9 is Abel–Jacobi global admission, a different object under the same id.derived by definition match, pending owner review
R RSI / operator memoryL5 Typed operator algebra (partial)Registry growth and the novelty functional ν, as in map L5.derived by definition match, pending owner review
SP Compositional spine (ZForge)noneThe code spine that implements L0, L2, L6 and L7; the nearest map member is V2.derived by definition match, pending owner review
F1 Metric evolutionV1 Neural proposal / inverse (partial)Proposes metrics, as V1 does; its target is map L7.derived by definition match, pending owner review
F2 Operator memory feedL5 Typed operator algebra (partial)
L6 Transport / correspondence (partial)
Residuals routed to operator classes, as in map L5; unmatched mass as evidence of missing vocabulary, as in map L6.derived by definition match, pending owner review

Map layers with no Atlas node: L10, geometric and mesh realization; the Atlas ends at commit and does not draw realization. Map L9 is reached only through the Abel–Jacobi gate code attached to Atlas L7. Map L4 is reached only in part, through Atlas L3.

The word evolution differs between the stacks: map band C, Evolution, is change of structure (transport coefficients, constitutive geometry, variational steps); Atlas tier 4, Evolution, holds L9 and R, operator memory, and the Atlas’s slow-clock evolution section also draws the feedback edges F1, metric evolution, and F2, which sit on the feedback band.

Data → portal/data/architecture.json · overlay on the map → map.html?atlas=A