mirror of
https://github.com/QuilibriumNetwork/ceremonyclient.git
synced 2026-02-21 10:27:26 +08:00
c797d482f9
* wip: conversion of hotstuff from flow into Q-oriented model * bulk of tests * remaining non-integration tests * add integration test, adjust log interface, small tweaks * further adjustments, restore full pacemaker shape * add component lifecycle management+supervisor * further refinements * resolve timeout hanging * mostly finalized state for consensus * bulk of engine swap out * lifecycle-ify most types * wiring nearly complete, missing needed hooks for proposals * plugged in, vetting message validation paths * global consensus, plugged in and verified * app shard now wired in too * do not decode empty keys.yml (#456) * remove obsolete engine.maxFrames config parameter (#454) * default to Info log level unless debug is enabled (#453) * respect config's "logging" section params, remove obsolete single-file logging (#452) * Trivial code cleanup aiming to reduce Go compiler warnings (#451) * simplify range traversal * simplify channel read for single select case * delete rand.Seed() deprecated in Go 1.20 and no-op as of Go 1.24 * simplify range traversal * simplify channel read for single select case * remove redundant type from array * simplify range traversal * simplify channel read for single select case * RC slate * finalize 2.1.0.5 * Update comments in StrictMonotonicCounter Fix comment formatting and clarify description. --------- Co-authored-by: Black Swan <3999712+blacks1ne@users.noreply.github.com>
31 lines
1.0 KiB
Go
31 lines
1.0 KiB
Go
package consensus
|
|
|
|
import (
|
|
"context"
|
|
|
|
"source.quilibrium.com/quilibrium/monorepo/consensus/models"
|
|
)
|
|
|
|
// LeaderProvider handles leader selection. State is provided, if relevant to
|
|
// the upstream consensus engine.
|
|
type LeaderProvider[
|
|
StateT models.Unique,
|
|
PeerIDT models.Unique,
|
|
CollectedT models.Unique,
|
|
] interface {
|
|
// GetNextLeaders returns a list of node indices, in priority order. Note that
|
|
// it is assumed that if no error is returned, GetNextLeaders should produce
|
|
// a non-empty list. If a list of size smaller than minimumProvers is
|
|
// provided, the liveness check will loop until the list is greater than that.
|
|
GetNextLeaders(ctx context.Context, prior *StateT) ([]PeerIDT, error)
|
|
// ProveNextState prepares a non-finalized new state from the prior, to be
|
|
// proposed and voted upon. Provided context may be canceled, should be used
|
|
// to halt long-running prover operations.
|
|
ProveNextState(
|
|
ctx context.Context,
|
|
rank uint64,
|
|
filter []byte,
|
|
priorState models.Identity,
|
|
) (*StateT, error)
|
|
}
|