pub struct BalancedModel;Expand description
The BalancedFair model evaluates candidates by combining both the total backing and the average backing per backer. This approach balances candidates who have a few very large backers versus those with many smaller backers.
Concept: Total + Average External Fairness
Each candidate has a list of (Backer, Backed) pairs.
The model computes:
total = sum of all Backed valuesaverage = total / number of backersscore = total + average
Candidates are then sorted in descending order by this combined score.
§Characteristics:
- Balanced aggregation: Rewards both high total support and broad distribution.
- No self-weighting: Excludes candidate self-contributions.
- Overflow-safe: Uses saturating arithmetic.
- Deterministic ordering: Sorted descending by combined score.
- Context-free: Stateless and reproducible ranking.
§Applications:
- Governance systems balancing “big backers” vs “broad support”.
- Collaborative projects or token-based delegation systems.
- Reward allocation where both total and average contributions matter.
§References:
- Weighted voting - Wikipedia
- Delegated voting / Liquid democracy
- Osborne, M. J., An Introduction to Game Theory, Oxford University Press, 2004
Trait Implementations§
Source§impl Debug for BalancedModel
impl Debug for BalancedModel
Source§impl Default for BalancedModel
impl Default for BalancedModel
Source§fn default() -> BalancedModel
fn default() -> BalancedModel
Source§impl<Candidate, FairWeight, Backer, Backed, Input, Output> PurePluginModel<Input, (), Output> for BalancedModelwhere
Input: IntoIterator<Item = (Candidate, FairWeight)> + Clone,
Output: FromIterator<Candidate>,
FairWeight: IntoIterator<Item = (Backer, Backed)> + Clone,
Backed: Clone + Ord + Zero + Saturating + Add<Output = Backed> + Div<usize, Output = Backed>,
Candidate: Clone,
impl<Candidate, FairWeight, Backer, Backed, Input, Output> PurePluginModel<Input, (), Output> for BalancedModelwhere
Input: IntoIterator<Item = (Candidate, FairWeight)> + Clone,
Output: FromIterator<Candidate>,
FairWeight: IntoIterator<Item = (Backer, Backed)> + Clone,
Backed: Clone + Ord + Zero + Saturating + Add<Output = Backed> + Div<usize, Output = Backed>,
Candidate: Clone,
Source§fn compute(&self, input: Input, _context: &()) -> Output
fn compute(&self, input: Input, _context: &()) -> Output
Computes the balanced fair rank of candidates imperatively.
Steps:
- Iterate over each candidate and collect all
(Backer, Backed)pairs. - Compute total backing as the saturating sum of
Backed. - Compute average backing per backer.
- Compute score = total + average.
- Sort candidates by descending score.
- Return only the ordered candidates.
Auto Trait Implementations§
impl Freeze for BalancedModel
impl RefUnwindSafe for BalancedModel
impl Send for BalancedModel
impl Sync for BalancedModel
impl Unpin for BalancedModel
impl UnwindSafe for BalancedModel
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
§impl<T> CheckedConversion for T
impl<T> CheckedConversion for T
§fn checked_from<T>(t: T) -> Option<Self>where
Self: TryFrom<T>,
fn checked_from<T>(t: T) -> Option<Self>where
Self: TryFrom<T>,
§fn checked_into<T>(self) -> Option<T>where
Self: TryInto<T>,
fn checked_into<T>(self) -> Option<T>where
Self: TryInto<T>,
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T, U, Tag> IntoTag<U, Tag> for Twhere
U: FromTag<T, Tag>,
Tag: DiscriminantTag,
impl<T, U, Tag> IntoTag<U, Tag> for Twhere
U: FromTag<T, Tag>,
Tag: DiscriminantTag,
§impl<Src, Dest> IntoTuple<Dest> for Srcwhere
Dest: FromTuple<Src>,
impl<Src, Dest> IntoTuple<Dest> for Srcwhere
Dest: FromTuple<Src>,
fn into_tuple(self) -> Dest
§impl<T> IsType<T> for T
impl<T> IsType<T> for T
§impl<T, Outer> IsWrappedBy<Outer> for T
impl<T, Outer> IsWrappedBy<Outer> for T
Source§impl<T, Time> Logging<Time> for Twhere
Time: Time,
impl<T, Time> Logging<Time> for Twhere
Time: Time,
Source§const FALLBACK_TARGET: &'static str = "routine"
const FALLBACK_TARGET: &'static str = "routine"
Default logging target if none is provided.
Most routines, especially offchain workers or background tasks, use this target for simplicity.
It allows a consistent place to look for routine logs without requiring every call to specify a target.
Note: This target is only a conveninence and may be somewhat vague. To ensure errors can still be traced accurately, the logged messages should include additional metadata (e.g., module name, error index, or contextual info) so that the source of the error can be identified even if the target is generic.
Source§type Logger = DispatchError
type Logger = DispatchError
The type taken and returned for logging.
We simply return the same [DispatchError] that was logged,
so logging does not change control flow or error propagation.
DispatchError is used because in Substrate it encompasses all
runtime errors - including module errors, token errors, arithmetic
issues, and transactional boundaries - making it the universal
substrate-side error representation.
Source§type Level = LogLevel
type Level = LogLevel
The log level type.
We use the LogLevel enum to standardize severity levels
(Info, Warn, Error, Debug) across all routine logs.
Source§fn log(
level: <T as Logging<Time>>::Level,
err: &<T as Logging<Time>>::Logger,
timestamp: Time,
target: Option<&str>,
fmt: Option<fn(Time, &<T as Logging<Time>>::Level, &str, &str) -> String>,
) -> <T as Logging<Time>>::Logger
fn log( level: <T as Logging<Time>>::Level, err: &<T as Logging<Time>>::Logger, timestamp: Time, target: Option<&str>, fmt: Option<fn(Time, &<T as Logging<Time>>::Level, &str, &str) -> String>, ) -> <T as Logging<Time>>::Logger
Source§fn info(
err: &Self::Logger,
timestamp: Timestamp,
target: Option<&str>,
fmt: Option<fn(Timestamp, &Self::Level, &str, &str) -> String>,
) -> Self::Loggerwhere
Self: Sized,
fn info(
err: &Self::Logger,
timestamp: Timestamp,
target: Option<&str>,
fmt: Option<fn(Timestamp, &Self::Level, &str, &str) -> String>,
) -> Self::Loggerwhere
Self: Sized,
Source§fn warn(
err: &Self::Logger,
timestamp: Timestamp,
target: Option<&str>,
fmt: Option<fn(Timestamp, &Self::Level, &str, &str) -> String>,
) -> Self::Loggerwhere
Self: Sized,
fn warn(
err: &Self::Logger,
timestamp: Timestamp,
target: Option<&str>,
fmt: Option<fn(Timestamp, &Self::Level, &str, &str) -> String>,
) -> Self::Loggerwhere
Self: Sized,
§impl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
§fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
§fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
T. Read more§impl<T, U> TryIntoKey<U> for Twhere
U: TryFromKey<T>,
impl<T, U> TryIntoKey<U> for Twhere
U: TryFromKey<T>,
type Error = <U as TryFromKey<T>>::Error
fn try_into_key(self) -> Result<U, <U as TryFromKey<T>>::Error>
§impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
§fn unchecked_into(self) -> T
fn unchecked_into(self) -> T
unchecked_from.§impl<T, S> UniqueSaturatedInto<T> for S
impl<T, S> UniqueSaturatedInto<T> for S
§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
T.