# Visual–World Domain Computation — Roadmap v0.3

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

## VWDC-02 — Compositional Visual–World Reachability Graphs
Typed mixed graph, composition, defect transport, cycles, lift gates, path evidence.

## VWDC-03 — Visual World Branching, Lineage, and Evidence Transport
- shared-ancestry dependence;
- effective branch sample size;
- paired counterfactual coupling;
- evaluator/model common modes;
- branch independence profiles;
- evidence dependency DAG;
- invalidation closure;
- clean-checkpoint replay;
- correlation-aware aggregation;
- universal-claim counterexample asymmetry;
- simulation consensus no-go;
- reality transport error composition;
- merge admissibility;
- multi-parent lineage DAG;
- separate lineage/dependency/communication/transport graphs.

## Proposed VWDC-04 — Active Branch Design, Dependence-Aware World Experimentation, and Evidence Value
Choose the next branch/validation action by evidence purpose and value.