# Visual–World Domain Computation — Roadmap v0.2

## VWDC-01 — From Visual Reachability to Runnable World Reachability
Observation, liftability, hidden state, dynamics closure, runnable contract.

## VWDC-02 — Compositional Visual–World Reachability Graphs
- typed state nodes;
- typed operation signatures;
- multi-provider composition beyond one-stage union;
- candidate-world versus runnable-world lift;
- shortest valid paths;
- scalar/vector defect transport;
- exact-state cycle elimination;
- productive iterative type loops;
- checkpoint/restore lineage;
- edit/intervention separation;
- evidence-policy ledger;
- mixed-path Pareto frontier;
- visual composition/world composition no-go.

## Proposed VWDC-03 — Visual World Branching, Lineage, and Evidence Transport
- common ancestry;
- sibling dependence;
- checkpoint lineage;
- branch evidence aggregation;
- replay after invalidation;
- branch merge requirements;
- world-to-reality evidence transport.

## Relationship

- GVSS: visual state/navigation/provider plane.
- WDC: runnable world/branch/governor plane.
- VWDC: typed bridge.
- RRT: frozen reflexive representation meta-layer.