00 Ground / Root Order

Root Order

Root Order names the governing dependency arrangement from which all order in the system proceeds. It records what must already hold before something else can become available. Root Order does not establish terms, branches, or domains — it holds the precedence through which all terms remain traceable. Dependency is not chronology, hierarchy, sequence, preference, or navigation; it is what must already hold. Root Order can be read through organic and engineered modes of organisation: it names the given root of the system as it actually participates, not as a mechanical reference point.

Trace

• Ground

Read

Root Order becomes recognisable where a term can be traced backward through its prior conditions without confusing dependency with sequence — where the root arrangement holds regardless of how the system is traversed, extended, or applied.

Opens

• Order
• Dependency Order
• Passage Condition

Dependency Spine

Relation
↓
Asymmetry → Bounded Asymmetry → Strained Asymmetry → Resolved Asymmetry
↓
Boundary → Availability → Strain → Bearing → Resolution

Cross-Order Pattern

The orders repeat a grounded movement without becoming identical.

First Order:
Strain → Bearing → Resolution

Second Order:
Coupling / Presence → Bearing Relation → Participation

Third Order:
Participation → Field of Participation → Nesting

Higher Order:
Nesting → Recursion

This pattern is a retrace aid, not a replacement for direct trace. A term belongs where its immediate support holds, even when it echoes a movement from another order.

Rule

A downstream term may depend on multiple prior conditions. Dependency placement follows the nearest condition that must already hold. Readable sequence may present dependency order but does not create or govern it.

Root terms let order emerge upward. Passage conditions do not make an order emerge by themselves; they regulate whether order can pass, hold, close, or remain available across a boundary or scope. High linkage alone does not make a term a root.