Compound Fork — ASI × Compute scale

Each cell = a joint scenario "Both branches fire". Cell intensity = total |Δ| across the 200 highest-conviction tradeable predictions vs their unconditional posterior. Joint probabilities approximated via log-odds combination (assumes conditional independence given the prediction — coarse but bounded). Click a cell to drill into the dominant single-fork view.

Pick two fork families

Rows (ASI)Compute scaleEnergy / gridHumanoid deploymentRobotaxiAGIASI$1T+ IPOMars uncrewedAI pauseRecession
Cols (Compute scale)Compute scaleEnergy / gridHumanoid deploymentRobotaxiAGIASI$1T+ IPOMars uncrewedAI pauseRecession
ASI ↓ × Compute scale
COMPUTE_1GW_2027
prior 60%
COMPUTE_10GW_2028
prior 40%
COMPUTE_100GW_2030
prior 20%
COMPUTE_STARGATE_FAILURE
prior 15%
ASI_FAST_2031
prior 10%
126 claims · Σ|Δ| 16.45
133 claims · Σ|Δ| 17.68
131 claims · Σ|Δ| 18.20
124 claims · Σ|Δ| 16.30
ASI_MID_2034
prior 30%
126 claims · Σ|Δ| 16.45
133 claims · Σ|Δ| 17.68
131 claims · Σ|Δ| 18.20
124 claims · Σ|Δ| 16.30
ASI_SLOW_2040PLUS
prior 60%
124 claims · Σ|Δ| 15.92
131 claims · Σ|Δ| 17.15
129 claims · Σ|Δ| 17.67
122 claims · Σ|Δ| 15.77

Method note

Joint conditional probability is approximated via log-odds combination: logit(P(pred|A,B)) ≈ logit(P(pred|A)) + logit(P(pred|B)) − logit(P(pred)). This is the closed-form Bayesian update assuming A and B are conditionally independent given the prediction. It's correct when the two scenarios act on the prediction through different causal paths; it's pessimistic when they overlap. The exact joint requires running the Gibbs sampler with both scenarios clamped, which would be N×M=16 sampling runs (~12 minutes per refresh) instead of N+M=8 — a 2× cost for higher fidelity.