# Visual–World Domain Computation — Roadmap v0.4

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

## VWDC-02 — Compositional Visual–World Reachability Graphs
Typed mixed paths, provider composition, world lift/fork/render, defect and evidence paths.

## VWDC-03 — Visual World Branching, Lineage, and Evidence Transport
Shared ancestry, branch dependence, replay, invalidation, reality transport.

## VWDC-04 — Active Branch Design, Dependence-Aware World Experimentation, and Evidence Value
- evidence-purpose branch vocabulary;
- general value of branch experiment;
- correlated-seed diminishing returns;
- backend-diversification premium;
- paired-counterfactual coupling;
- sensitivity/robustness branches;
- falsification branch value;
- Bayesian falsification stopping;
- falsification/prevalence separation;
- internal versus external validation;
- irreducible transport floor;
- finite-horizon branch Bellman control;
- STOP theorem;
- experiment-selection regret;
- branch experiment Pareto frontier;
- multi-budget feasibility.

## Proposed VWDC-05 — Reality-Tethered World Calibration, Transport Contracts, and External Validity
Formalize and maintain the world-to-reality bridge.