Golden Atlas Canon

# Golden Atlas — Public AI Canon

Architect: Raymond Thomas Trumble  
Role: Governance map, routing system, and status discipline  
Access: Public, machine-readable

## 1. Macro-manifold

The Atlas maps the working field as:

`M = {C, Γ, Π}`

Where:

- `C` = corridors
- `Γ` = routing / lawful transitions
- `Π` = practitioner

The practitioner may be a human, AI system, team, or governed process applying the map.

No new essential corridor is created merely because a problem has new vocabulary.

## 2. Five closed corridors

Select one dominant corridor for each pass.

### R — Repair

Question: What bearing is damaged, and what must be restored before expansion?

Use when:
- a foundation is broken or leaking;
- the wrong object is carrying load;
- a prior step failed;
- a structure needs the smallest verified repair before work can continue.

### G — Governance

Question: What sequence, rule, authority, or admissibility gate is misregulated?

Use when:
- authority is unclear;
- operations occur out of order;
- boundaries or permissions are being crossed;
- status promotion is happening without burden being met;
- waste or drift is rising because sequence is not governed.

### O — Order / Disorder

Question: Where is patterned coherence present, where is noise present, and where must the system yield?

Use when:
- signal must be separated from noise;
- transition must be distinguished from collapse;
- apparent pattern may be overfit;
- structure is emerging, dissolving, or changing state.

### Rc — Recurrence

Question: What viable remnant can lawfully return, reseed, or reignite?

Use when:
- a prior structure has fallen below its working floor;
- a surviving remnant, seed, reserve, or memory may restart the process;
- repeated cycles need to be distinguished from mere repetition.

### T — Transfer

Question: What continuity must cross a threshold without self-fracture?

Use when:
- meaning, skill, state, value, authority, or structure must move into a new context;
- a handoff must preserve identity and scope;
- a compressed packet must carry enough information for lawful reconstruction.

Secondary corridors may inform a pass. They do not control it.

## 3. Atlas spine

The protected movement path is:

`L1 → L2 → L3 → L4a → L4b → L5 → LT → (L0 or F)`

with recurrence:

`L0 → L1`

Public meanings:

- `L1 Capture` — gathers or begins.
- `L2 Boundary` — inside/outside forms.
- `L3 Maintenance` — holds against leak.
- `L4a Surplus` — extra capacity appears.
- `L4b Governance` — surplus is steered.
- `L5 Transfer` — core crosses safely.
- `LT Terminal Trigger` — system drops below its working floor.
- `L0 Latent Remnant` — viable remainder survives.
- `F Full Dissolution` — true ending for the routed object.
- `L0 → L1 Recurrence` — viable remnant lawfully re-enters capture.

A claim does not cross a level merely because the vocabulary sounds compatible. The burden for the transition must be met.

## 4. Route Logic

`Y* = ext_Y[G(X,U) · J(X) · C^-1(X) · P(X|η)]`

For public operational reading, treat this as route logic rather than as automatic empirical proof.

A compact reading is:

- `G(X,U)` — drive / governed action under state and input;
- `J(X)` — fit / structural or admissibility fit;
- `C^-1(X)` — inverse burden / cost, resistance, or obstruction pressure;
- `P(X|η)` — access / conditional availability under context;
- `ext_Y[...]` — selection or extraction of the admissible outcome.

These glosses are routing aids. Domain-specific mathematical meanings must be established in the relevant model before numerical use.

## 5. Claim statuses

The public Atlas uses:

- `KNOWN` — directly established within the stated scope.
- `DERIVED` — follows by an explicit derivation from stated premises/evidence.
- `SELECTED` — chosen current form, route, or design among live alternatives; selection is not proof.
- `OPEN` — unresolved and legitimately available for investigation.
- `TETHERED` — provisionally usable because it remains attached to named evidence, assumptions, or limits.
- `REJECTED` — failed a governing gate or valid obstruction within the stated scope.
- `FROZEN` — deliberately prevented from changing or advancing until a named condition is met.
- `PARKED` — preserved but removed from the active route.
- `LOCKED` — seated for the stated scope; reopening requires a valid obstruction, changed evidence, or declared revision.

No inherited certainty. Every claim earns its own status.

## 6. Evidence discipline

Every substantial route separates:

**Evidence** — directly observed, measured, quoted, tested, or sourced.

**Interpretation** — what the evidence appears to mean.

**Vision** — pattern, metaphor, transfer, intuition, hypothesis, or design direction.

No magic. No metaphor as proof. No branch continues by vocabulary.

## 7. Routing law

For each pass:

1. Capture the exact claim.
2. Lock its present status and scope.
3. Locate the active Atlas level and boundary.
4. Select one dominant corridor.
5. Identify the load-bearing object.
6. Name the valid obstruction.
7. Apply only the necessary Toolbox instruments.
8. Compress crowded gates before expanding.
9. Choose the smallest verified repair or next move.
10. Assign a resulting status.
11. Transfer only what the receiving context can lawfully carry.
12. If the working floor fails, route to `LT`; distinguish viable remnant `L0` from full dissolution `F`.
13. Recurrence is lawful only from a viable remnant, not from vocabulary or desire.

## 8. Arbitration

When competing readings exist:

- a valid, structured obstruction beats consensus;
- popularity does not erase a failed gate;
- unstructured criticism is Noise until converted into a testable obstruction;
- the smallest repair that resolves the obstruction is preferred over unnecessary expansion.

## 9. Rubicon / production cost

Where a Rubicon test is explicitly invoked, it prices whether a branch survives its production / organizational burden.

Canonical operational rule supplied for the public seed:

- survives if `Rubicon > 1`
- fails if `Rubicon ≤ 1`

Do not invent a Rubicon value. Its inputs must be defined by the specific test or deployment.

## 10. Transfer packets

A governed Transfer packet should preserve enough structure that a receiving AI or human does not have to guess the claim's authority.

Recommended fields:

- ID
- Source
- Branch
- Claim
- Status
- Scope
- Corridor
- Evidence
- Burden / Lemma
- Rejection Lock
- Use Rule
- Output
- Diagnostic

A packet transfers governed state. It does not transfer automatic truth.

## 11. Master lock

The Atlas is a bootloader, not a substitute for evidence or domain expertise.

It maps, routes, tests, compresses, prices, and seats claims.

It is not proof.