Identity gives us nodes. Reputation gives those nodes weight. The graph is what connects them — the structure that turns a crowd of participants into an ecosystem.
Relationships as infrastructure
Every application today rebuilds its own social graph: follows, members, contributors, holders. None of these graphs talk to each other, so the rich web of relationships that actually exists across Base is invisible to any single app. ORYN lifts the graph into shared infrastructure — one map that any application can read and contribute to.
Nodes and edges
Nodes are identities: people, projects, communities, assets, agents. Edges are the relationships between them — typed, directional, and meaningful.
Because edges are typed, the graph can answer specific questions — not just "are these two connected?" but "how, and through whom?"
Discovery
A shared graph makes discovery a first-class capability. Find the contributors a project should know. Find the communities adjacent to yours. Find a trust path between two strangers. Discovery is the Phase 3 promise: coordination becomes possible because participants can finally find each other.
Neighbors
Who is one hop away, by a given edge type.
Paths
How two participants connect, and how much trust the path carries.
Clusters
The communities and scenes that form naturally in the structure.
Bridges
The participants who connect otherwise-separate parts of the ecosystem.
The graph carries trust
The graph and reputation are inseparable. Vouches are edges; trust propagates along paths; reputation is, in part, a property of where you sit in the structure. A well-formed graph lets trust travel exactly as far as it should — and no further.
Composable. The graph is readable by any ORYN-aware application, so relationships compound across the ecosystem instead of resetting inside every app.
Open questions
- Which edge types are primitive, and which can be derived?
- How should the graph balance openness with participant control over visibility?
- How does trust attenuate along a path without losing its signal?
These drive Research #003 — Coordination Graphs.