mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-06-20 07:01:02 +00:00
401540eefc
* add fast-runtime feature for reduced session times * make democracy periods fast on fast-runtime * propagate fast-runtime feature through cargo.toml files * add fast motion and term durations to Kusama * Update runtime/westend/Cargo.toml Co-authored-by: Kian Paimani <5588131+kianenigma@users.noreply.github.com> * set session time to 2 minutes to avoid block production issues * formatting * update Substrate * set democracy fast periods back to 1min * set launch period and enactment period to 1 block in fast-runtime * remove unnecessary westend period configs * add prod_or_test macro to allow specifying prod, test and env values for parameter types * move prod_or_test macro into common module and use it consistently * rename macro to prod_or_fast * cargo +nightly fmt * bump impl_versions * newline Co-authored-by: Kian Paimani <5588131+kianenigma@users.noreply.github.com> * add note that env variable is evaluated at compile time * newline Co-authored-by: Kian Paimani <5588131+kianenigma@users.noreply.github.com> * newline Co-authored-by: Kian Paimani <5588131+kianenigma@users.noreply.github.com> * cargo fmt * impl_version: 0 * impl_version: 0 * use prod_or_fast macro for LeasePeriod and LeaseOffset * use prod_or_fast macro in WND and ROC constants Co-authored-by: Kian Paimani <5588131+kianenigma@users.noreply.github.com> Co-authored-by: Giles Cope <gilescope@gmail.com>
123 lines
4.2 KiB
Rust
123 lines
4.2 KiB
Rust
// Copyright 2019-2020 Parity Technologies (UK) Ltd.
|
|
// This file is part of Polkadot.
|
|
|
|
// Polkadot is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
|
|
// Polkadot is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with Polkadot. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
#![cfg_attr(not(feature = "std"), no_std)]
|
|
|
|
/// Money matters.
|
|
pub mod currency {
|
|
use primitives::v0::Balance;
|
|
|
|
/// The existential deposit.
|
|
pub const EXISTENTIAL_DEPOSIT: Balance = 1 * CENTS;
|
|
|
|
pub const UNITS: Balance = 1_000_000_000_000;
|
|
pub const CENTS: Balance = UNITS / 100;
|
|
pub const MILLICENTS: Balance = CENTS / 1_000;
|
|
pub const GRAND: Balance = CENTS * 100_000;
|
|
|
|
pub const fn deposit(items: u32, bytes: u32) -> Balance {
|
|
items as Balance * 100 * CENTS + (bytes as Balance) * 5 * MILLICENTS
|
|
}
|
|
}
|
|
|
|
/// Time and blocks.
|
|
pub mod time {
|
|
use primitives::v0::{BlockNumber, Moment};
|
|
use runtime_common::prod_or_fast;
|
|
|
|
pub const MILLISECS_PER_BLOCK: Moment = 6000;
|
|
pub const SLOT_DURATION: Moment = MILLISECS_PER_BLOCK;
|
|
pub const EPOCH_DURATION_IN_SLOTS: BlockNumber = prod_or_fast!(1 * HOURS, 1 * MINUTES);
|
|
|
|
// These time units are defined in number of blocks.
|
|
pub const MINUTES: BlockNumber = 60_000 / (MILLISECS_PER_BLOCK as BlockNumber);
|
|
pub const HOURS: BlockNumber = MINUTES * 60;
|
|
pub const DAYS: BlockNumber = HOURS * 24;
|
|
|
|
// 1 in 4 blocks (on average, not counting collisions) will be primary babe blocks.
|
|
pub const PRIMARY_PROBABILITY: (u64, u64) = (1, 4);
|
|
}
|
|
|
|
/// Fee-related.
|
|
pub mod fee {
|
|
use frame_support::weights::{
|
|
WeightToFeeCoefficient, WeightToFeeCoefficients, WeightToFeePolynomial,
|
|
};
|
|
use primitives::v1::Balance;
|
|
use runtime_common::ExtrinsicBaseWeight;
|
|
use smallvec::smallvec;
|
|
pub use sp_runtime::Perbill;
|
|
|
|
/// The block saturation level. Fees will be updates based on this value.
|
|
pub const TARGET_BLOCK_FULLNESS: Perbill = Perbill::from_percent(25);
|
|
|
|
/// Handles converting a weight scalar to a fee value, based on the scale and granularity of the
|
|
/// node's balance type.
|
|
///
|
|
/// This should typically create a mapping between the following ranges:
|
|
/// - [0,` MAXIMUM_BLOCK_WEIGHT`]
|
|
/// - [Balance::min, Balance::max]
|
|
///
|
|
/// Yet, it can be used for any other sort of change to weight-fee. Some examples being:
|
|
/// - Setting it to `0` will essentially disable the weight fee.
|
|
/// - Setting it to `1` will cause the literal `#[weight = x]` values to be charged.
|
|
pub struct WeightToFee;
|
|
impl WeightToFeePolynomial for WeightToFee {
|
|
type Balance = Balance;
|
|
fn polynomial() -> WeightToFeeCoefficients<Self::Balance> {
|
|
// in Westend, extrinsic base weight (smallest non-zero weight) is mapped to 1/10 CENT:
|
|
let p = super::currency::CENTS;
|
|
let q = 10 * Balance::from(ExtrinsicBaseWeight::get());
|
|
smallvec![WeightToFeeCoefficient {
|
|
degree: 1,
|
|
negative: false,
|
|
coeff_frac: Perbill::from_rational(p % q, q),
|
|
coeff_integer: p / q,
|
|
}]
|
|
}
|
|
}
|
|
}
|
|
|
|
#[cfg(test)]
|
|
mod tests {
|
|
use super::{
|
|
currency::{CENTS, MILLICENTS},
|
|
fee::WeightToFee,
|
|
};
|
|
use frame_support::weights::WeightToFeePolynomial;
|
|
use runtime_common::{ExtrinsicBaseWeight, MAXIMUM_BLOCK_WEIGHT};
|
|
|
|
#[test]
|
|
// This function tests that the fee for `MAXIMUM_BLOCK_WEIGHT` of weight is correct
|
|
fn full_block_fee_is_correct() {
|
|
// A full block should cost 1,600 CENTS
|
|
println!("Base: {}", ExtrinsicBaseWeight::get());
|
|
let x = WeightToFee::calc(&MAXIMUM_BLOCK_WEIGHT);
|
|
let y = 16 * 100 * CENTS;
|
|
assert!(x.max(y) - x.min(y) < MILLICENTS);
|
|
}
|
|
|
|
#[test]
|
|
// This function tests that the fee for `ExtrinsicBaseWeight` of weight is correct
|
|
fn extrinsic_base_fee_is_correct() {
|
|
// `ExtrinsicBaseWeight` should cost 1/10 of a CENT
|
|
println!("Base: {}", ExtrinsicBaseWeight::get());
|
|
let x = WeightToFee::calc(&ExtrinsicBaseWeight::get());
|
|
let y = CENTS / 10;
|
|
assert!(x.max(y) - x.min(y) < MILLICENTS);
|
|
}
|
|
}
|