New Constellation v1.0
6 algorithms / 6 scenarios2026-11-14
6 algorithms / 6 scenarios2026-11-14
The paper, as code
Each algorithm of New Constellation: Multiple Concurrent Proposers for Alpenglow beside the code that runs it, and each lemma beside the Fault Lab scenario that shows it.
- k 3
- κ 4
- w 16
- δlocal 10 ms
- δblock 50 ms
- δglobal 250 ms
- Δtimeout 750 ms
[ Algorithms ]
Algorithm 1
- lines 1-6
Network::start_window / Network::ticknode/crates/acrux-node/src/protocol.rsCrash from window startimplemented - lines 7-9
Network::begin_block()node/crates/acrux-node/src/protocol.rsLast lookimplemented - lines 10-13
Network::prepare_early / Network::complete_earlynode/crates/acrux-node/src/protocol.rsimplemented - lines 14-16
ExchangeEngine::launch()node/crates/acrux-node/src/exchange.rsLast lookimplemented - lines 17
Network::try_vote / Network::receive / Wire::Handovernode/crates/acrux-node/src/protocol.rsimplemented - lines 18-19
Network::tick()node/crates/acrux-node/src/protocol.rsimplemented - lines 20-23
ExchangeEngine::receive_commit()node/crates/acrux-node/src/exchange.rsSplit commitmentsimplemented - lines 24-32
ExchangeEngine::launch / ExchangeState::attestation_vectornode/crates/acrux-node/src/exchange.rsLast lookimplemented
Algorithm 2
- lines 1-8
LocalSlot / WindowRun / Network::start_window / Network::try_votenode/crates/acrux-node/src/protocol.rsCrash from window startimplemented - lines 9-10
Network::tick / Network::try_votenode/crates/acrux-node/src/protocol.rsCrash from window startimplemented - lines 11-16
Network::receive / Wire::Relaynode/crates/acrux-node/src/protocol.rsEquivocationimplemented - lines 17-23
Network::receive / Wire::Attestnode/crates/acrux-node/src/protocol.rsSplit commitmentsimplemented - lines 24-30
Network::try_execute()node/crates/acrux-node/src/protocol.rsCensorshipimplemented - lines 31-37
Network::try_execute()node/crates/acrux-node/src/protocol.rsCrash from window startimplemented - lines 38-42
SvmExecutor::execute_slot()node/crates/acrux-execution/src/execution.rsCensorshipimplemented - lines 43-52
Network::try_vote()node/crates/acrux-node/src/protocol.rsCrash from window startimplemented - lines 53-59
Network::try_execute / Network::try_votenode/crates/acrux-node/src/protocol.rsSplit commitmentsimplemented
Algorithm 3
- lines 1-4
build_schedule()node/crates/acrux-schedule/src/lib.rsimplemented - lines 5
build_schedule (windows sorted into regional runs, the seeded draw order kept inside each region)node/crates/acrux-schedule/src/lib.rsimplemented - lines 6-15
build_schedule()node/crates/acrux-schedule/src/lib.rsimplemented
Algorithm 4
- lines 1-8
sort_transactions / select_with_feesnode/crates/acrux-execution/src/selection.rsCensorshipimplemented - lines 9-11
SvmExecutor::execute_slot()node/crates/acrux-execution/src/execution.rsCensorshipimplemented - lines 12-29
select_with_fees()node/crates/acrux-execution/src/selection.rsCensorshipimplemented - lines 30-37
SvmExecutor::charge_inclusion / SvmExecutor::execute_slotnode/crates/acrux-execution/src/execution.rsCensorshipimplemented - lines 38-50
select_with_fees()node/crates/acrux-execution/src/selection.rsCensorshipimplemented
Theorem 2.1
Votor::drive / Votor::ready_parentnode/crates/acrux-consensus/src/lib.rsCrash from window startimplemented
Lemma 2.2
Network::try_execute / Network::try_votenode/crates/acrux-node/src/protocol.rsCensorshipimplemented
Lemma 2.3
encrypt_slice / decrypt_slicenode/crates/acrux-crypto/src/lib.rsLast lookimplemented
Lemma 2.4
Network::receive()node/crates/acrux-node/src/protocol.rsEquivocationimplemented
Section 3.2
FragmentSubmission::verify / ThresholdCache::accept_at / validate_decoded / Network::submit_fragmentnode/crates/acrux-execution/src/threshold.rsPrivate front-runimplemented
Section 3.4
SvmExecutor::charge_inclusion / SvmExecutor::execute_slotnode/crates/acrux-execution/src/execution.rsimplemented
Lemma 2.4
ExchangeEngine::receive_commit (two signed commitments become a Wire::Equivocation proof)node/crates/acrux-node/src/exchange.rsEquivocationimplemented
Algorithm 2
- lines 53-59
agreed()node/crates/acrux-node/src/agreement.rsSplit commitmentsimplemented
Fault Lab
run (sandbox cluster, events.jsonl, outcome.json)node/crates/acrux-node/src/lab.rsimplementedNetwork::lab_inject / Network::lab_concludenode/crates/acrux-node/src/protocol.rsimplemented
Section 3.4
SvmExecutor::advance_blockhash (recent blockhashes, replay window)node/crates/acrux-execution/src/execution.rsimplemented
Algorithm 2
- lines 24-42
Replay::apply (acrux node follow decrypts, merges and re-executes every finalized slot)node/crates/acrux-node/src/cli.rsimplemented
[ Lemmas / Fault Lab ]
- Lemma 2.3 — Proposal hidingLast lookThe late proposal is dropped and disagreeing vectors produce a skip certificate.
- Lemma 2.2 — Selective-censorship resistanceCensorshipThe honest proposer’s transaction enters the agreed xblock and finalizes.
- Theorem 2.1 — NewCon correctnessCrash from window startThe window continues with P = {1,2}; the first vote waits for the attestation deadline.
- Lemma 2.4 — Accountable equivocationEquivocationThe two signed commitments form a slashing proof and the cblock is skipped.
- Lemma 2.2 — Selective-censorship resistanceSplit commitmentsDifferent attestation vectors prevent agreement and yield a skip certificate.
- Section 3.2 — Threshold transactions; Lemma 2.3Private front-runOne fragment is unreadable; the honest same-slot fragments reconstruct the swap after commitment.
[ Parameters as the net runs them ]
- k · concurrent proposers
- 3
- κ · slots per consensus slot
- 4
- w · slots per window
- 16
- δlocal · local delay
- 10 ms
- δblock · slot
- 50 ms
- δglobal · network delay
- 250 ms
- Δtimeout
- 750 ms
- m · execution tracks
- 4
- ρ · fee-payer reserve
- 0.001 SOL
- bcu · CU per track
- 2 000 000
- fragment expiry
- 8 slots
- α · stake-weighted windows
- 0.5
- n_min · hub members
- 4
- ρ_min · hub stake
- 12 000 000