Our Core Concepts

The Ruliad as the Map

The Ruliad represents the complete entangled limit of all possible computations—it is the ultimate map of what is possible. Traditional approaches try to find a single path through a complex system. We instead map the entire Ruliad to understand all possible paths and their interactions.

Branchial Space as the Arena

Branchial space is the higher-dimensional space that connects all possible states of a system. Where physical space deals with the arrangement of objects, branchial space deals with the arrangement of possible futures. Our operations occur in this space of possibilities.

Computational Irreducibility as the Law of Nature

Some systems cannot be predicted without essentially performing the computation itself—this is computational irreducibility. Rather than fighting this fundamental law, we embrace it by running irreducible computations across the branchial graph.

The Three-Step Process

Rulial Sampling: We sample the Ruliad to find computational rules relevant to our problem space.

Branchial Graph Construction: We build a graph of possible futures and their relationships.

Navigational Optimization: We find optimal paths through this graph that maximize resilience and minimize risk across all possible futures.