Consensus proposer selection is inflexible
Consensus proposer selection is inflexible: a task in LegoFlow-SWE (Harbor dataset). The consensus engine currently uses a hardcoded round‑robin proposer selection algorithm: (height + round) % validator count . This makes it impossible to restrict proposing to a specific, limited set of…
The task
The consensus engine currently uses a hardcoded round‑robin proposer selection algorithm: `(height + round) % validator_count`. This makes it impossible to restrict proposing to a specific, limited set of validators – a requirement for Starknet.
Part of Lego-X/LegoFlow-SWE.