pub struct TargetedFeeAdjustment<T, S, V, M, X>(/* private fields */);
Expand description
A struct to update the weight multiplier per block. It implements Convert<Multiplier, Multiplier>
, meaning that it can convert the previous multiplier to the next one. This should
be called on on_finalize
of a block, prior to potentially cleaning the weight data from the
system pallet.
given: s = previous block weight s’= ideal block weight m = maximum block weight diff = (s - s’)/m v = 0.00001 t1 = (v * diff) t2 = (v * diff)^2 / 2 then: next_multiplier = prev_multiplier * (1 + t1 + t2)
Where (s', v)
must be given as the Get
implementation of the T
generic type. Moreover, M
must provide the minimum allowed value for the multiplier. Note that a runtime should ensure
with tests that the combination of this M
and V
is not such that the multiplier can drop to
zero and never recover.
Note that s'
is interpreted as a portion in the normal transaction capacity of the block.
For example, given s' == 0.25
and AvailableBlockRatio = 0.75
, then the target fullness is
0.25 of the normal capacity and 0.1875 of the entire block.
Since block weight is multi-dimension, we use the scarcer resource, referred as limiting
dimension, for calculation of fees. We determine the limiting dimension by comparing the
dimensions using the ratio of dimension_value / max_dimension_value
and selecting the largest
ratio. For instance, if a block is 30% full based on ref_time
and 25% full based on
proof_size
, we identify ref_time
as the limiting dimension, indicating that the block is 30%
full.
This implementation implies the bound:
v ≤ p / k * (s − s')
- or, solving for
p
:p >= v * k * (s - s')
where p
is the amount of change over k
blocks.
Hence:
- in a fully congested chain:
p >= v * k * (1 - s')
. - in an empty chain:
p >= v * k * (-s')
.
For example, when all blocks are full and there are 28800 blocks per day (default in
substrate-node
) and v == 0.00001, s’ == 0.1875, we’d have:
p >= 0.00001 * 28800 * 0.8125 p >= 0.234
Meaning that fees can change by around ~23% per day, given extreme congestion.
More info can be found at: https://research.web3.foundation/en/latest/polkadot/overview/2-token-economics.html
Trait Implementations§
Source§impl<T, S, V, M, X> MultiplierUpdate for TargetedFeeAdjustment<T, S, V, M, X>
impl<T, S, V, M, X> MultiplierUpdate for TargetedFeeAdjustment<T, S, V, M, X>
Source§fn min() -> FixedU128
fn min() -> FixedU128
convert
function should be at least this.Source§fn max() -> FixedU128
fn max() -> FixedU128
convert
function should be less or equal this.Source§fn target() -> Perquintill
fn target() -> Perquintill
Source§fn variability() -> FixedU128
fn variability() -> FixedU128
Auto Trait Implementations§
impl<T, S, V, M, X> Freeze for TargetedFeeAdjustment<T, S, V, M, X>
impl<T, S, V, M, X> RefUnwindSafe for TargetedFeeAdjustment<T, S, V, M, X>
impl<T, S, V, M, X> Send for TargetedFeeAdjustment<T, S, V, M, X>
impl<T, S, V, M, X> Sync for TargetedFeeAdjustment<T, S, V, M, X>
impl<T, S, V, M, X> Unpin for TargetedFeeAdjustment<T, S, V, M, X>
impl<T, S, V, M, X> UnwindSafe for TargetedFeeAdjustment<T, S, V, M, X>
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
Source§impl<T> CheckedConversion for T
impl<T> CheckedConversion for T
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<I, T> ExtractContext<I, ()> for T
impl<I, T> ExtractContext<I, ()> for T
Source§fn extract_context(self, _original_input: I)
fn extract_context(self, _original_input: I)
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§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, Outer> IsWrappedBy<Outer> for T
impl<T, Outer> IsWrappedBy<Outer> for T
Source§impl<I> RecreateContext<I> for I
impl<I> RecreateContext<I> for I
Source§fn recreate_context(_original_input: I, tail: I) -> I
fn recreate_context(_original_input: I, tail: I) -> I
Source§impl<T> SaturatedConversion for T
impl<T> SaturatedConversion for T
Source§fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
fn saturated_from<T>(t: T) -> Selfwhere
Self: UniqueSaturatedFrom<T>,
Source§fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
fn saturated_into<T>(self) -> Twhere
Self: UniqueSaturatedInto<T>,
T
. Read moreSource§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>
Source§impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
impl<S, T> UncheckedInto<T> for Swhere
T: UncheckedFrom<S>,
Source§fn unchecked_into(self) -> T
fn unchecked_into(self) -> T
unchecked_from
.Source§impl<T, S> UniqueSaturatedInto<T> for S
impl<T, S> UniqueSaturatedInto<T> for S
Source§fn unique_saturated_into(self) -> T
fn unique_saturated_into(self) -> T
T
.