Abstract — When relationships are trapped inside individual applications, the ecosystem cannot see itself. This track studies the coordination graph as shared infrastructure, and the network theory that turns a map of connections into discovery and trust.
Motivation
Coordination is a structural property. Whether two participants can find and trust each other depends on the shape of the network between them. We study what edges are primitive, how discovery works over a shared graph, and how trust attenuates along a path.
Questions
- Which edge types are primitive, and which can be derived from others?
- How does discovery work efficiently over a large, evolving graph?
- How does trust attenuate along a path without losing its signal?
- How do we balance an open, legible graph with participant control over visibility?
Approach
We model the ecosystem as a typed, directional graph whose nodes are identities and whose edges encode relationships such as contributes_to, belongs_to, and vouches_for. We borrow from network theory — centrality, clustering, bridges, path length — to ask which structural signals are useful for discovery and for routing trust.
| Unit of study | Typed edges and the structural queries over them. |
|---|---|
| Feeds primitive | Graph (Phase 3 — Relationships, Discovery). |
| Draws on | Network theory — centrality, clustering, path analysis. |
Coordination is structural. Lift relationships into a shared graph and discovery, trust routing, and collaboration become first-class capabilities of the ecosystem.
What it unlocks
A shared coordination graph is what finally lets participants find each other across application borders — the precondition for the coordination ORYN exists to enable.
Status
Open. This research informs the Phase 3 graph and the eventual Phase 4 protocol.