From Alpenglow to Dispersed C-Simplex

By Max Resnick

September 1, 2026

Option 1 · Straight from Alpenglow to MinCP

Algorithm 1: Alpenglow (Votor)
Straw man: Alpenglow with P proposers
Figure 1: Alpenglow with P proposers per slot. The highlighted lines are the whole change.
  1. When does the first round of votes actually get sent?
  2. How are the proposals merged when each one is an entire block?
  3. What happens to Alpenglow's fallback path once rational proposers can trigger it?

Step 1 · Alpenglow → C-Simplex RVS

Algorithm 1: Alpenglow (Votor)
Algorithm 2: C-Simplex RVS
Figure 2:

Is the fast path actually fast?

Figure 3:
Figure 4:

Step 2 · Dispersed C-Simplex

Algorithm 2: C-Simplex RVS
Algorithm 3: Dispersed C-Simplex RVS
Figure 5:
Figure 6:

Step 3 · The fixed view schedule

Algorithm 3: Dispersed C-Simplex RVS
Algorithm 4: Dispersed C-Simplex FVS
Figure 7:

Step 4 · Dispersed C-Simplex FVS → MinCP

Algorithm 4: Dispersed C-Simplex FVS
Algorithm 5: MinCP (P proposers per slot)
Figure 8: