mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-06-22 06:51:02 +00:00
00b85c51df
helps https://github.com/paritytech/polkadot-sdk/issues/439. closes https://github.com/paritytech/polkadot-sdk/issues/473. PR link in the older substrate repository: https://github.com/paritytech/substrate/pull/13498. # Context Rewards payout is processed today in a single block and limited to `MaxNominatorRewardedPerValidator`. This number is currently 512 on both Kusama and Polkadot. This PR tries to scale the nominators payout to an unlimited count in a multi-block fashion. Exposures are stored in pages, with each page capped to a certain number (`MaxExposurePageSize`). Starting out, this number would be the same as `MaxNominatorRewardedPerValidator`, but eventually, this number can be lowered through new runtime upgrades to limit the rewardeable nominators per dispatched call instruction. The changes in the PR are backward compatible. ## How payouts would work like after this change Staking exposes two calls, 1) the existing `payout_stakers` and 2) `payout_stakers_by_page`. ### payout_stakers This remains backward compatible with no signature change. If for a given era a validator has multiple pages, they can call `payout_stakers` multiple times. The pages are executed in an ascending sequence and the runtime takes care of preventing double claims. ### payout_stakers_by_page Very similar to `payout_stakers` but also accepts an extra param `page_index`. An account can choose to payout rewards only for an explicitly passed `page_index`. **Lets look at an example scenario** Given an active validator on Kusama had 1100 nominators, `MaxExposurePageSize` set to 512 for Era e. In order to pay out rewards to all nominators, the caller would need to call `payout_stakers` 3 times. - `payout_stakers(origin, stash, e)` => will pay the first 512 nominators. - `payout_stakers(origin, stash, e)` => will pay the second set of 512 nominators. - `payout_stakers(origin, stash, e)` => will pay the last set of 76 nominators. ... - `payout_stakers(origin, stash, e)` => calling it the 4th time would return an error `InvalidPage`. The above calls can also be replaced by `payout_stakers_by_page` and passing a `page_index` explicitly. ## Commission note Validator commission is paid out in chunks across all the pages where each commission chunk is proportional to the total stake of the current page. This implies higher the total stake of a page, higher will be the commission. If all the pages of a validator's single era are paid out, the sum of commission paid to the validator across all pages should be equal to what the commission would have been if we had a non-paged exposure. ### Migration Note Strictly speaking, we did not need to bump our storage version since there is no migration of storage in this PR. But it is still useful to mark a storage upgrade for the following reasons: - New storage items are introduced in this PR while some older storage items are deprecated. - For the next `HistoryDepth` eras, the exposure would be incrementally migrated to its corresponding paged storage item. - Runtimes using staking pallet would strictly need to wait at least `HistoryDepth` eras with current upgraded version (14) for the migration to complete. At some era `E` such that `E > era_at_which_V14_gets_into_effect + HistoryDepth`, we will upgrade to version X which will remove the deprecated storage items. In other words, it is a strict requirement that E<sub>x</sub> - E<sub>14</sub> > `HistoryDepth`, where E<sub>x</sub> = Era at which deprecated storages are removed from runtime, E<sub>14</sub> = Era at which runtime is upgraded to version 14. - For Polkadot and Kusama, there is a [tracker ticket](https://github.com/paritytech/polkadot-sdk/issues/433) to clean up the deprecated storage items. ### Storage Changes #### Added - ErasStakersOverview - ClaimedRewards - ErasStakersPaged #### Deprecated The following can be cleaned up after 84 eras which is tracked [here](https://github.com/paritytech/polkadot-sdk/issues/433). - ErasStakers. - ErasStakersClipped. - StakingLedger.claimed_rewards, renamed to StakingLedger.legacy_claimed_rewards. ### Config Changes - Renamed MaxNominatorRewardedPerValidator to MaxExposurePageSize. ### TODO - [x] Tracker ticket for cleaning up the old code after 84 eras. - [x] Add companion. - [x] Redo benchmarks before merge. - [x] Add Changelog for pallet_staking. - [x] Pallet should be configurable to enable/disable paged rewards. - [x] Commission payouts are distributed across pages. - [x] Review documentation thoroughly. - [x] Rename `MaxNominatorRewardedPerValidator` -> `MaxExposurePageSize`. - [x] NMap for `ErasStakersPaged`. - [x] Deprecate ErasStakers. - [x] Integrity tests. ### Followup issues [Runtime api for deprecated ErasStakers storage item](https://github.com/paritytech/polkadot-sdk/issues/426) --------- Co-authored-by: Javier Viola <javier@parity.io> Co-authored-by: Ross Bulat <ross@parity.io> Co-authored-by: command-bot <>
917 lines
27 KiB
Rust
917 lines
27 KiB
Rust
// This file is part of Substrate.
|
|
|
|
// Copyright (C) Parity Technologies (UK) Ltd.
|
|
// SPDX-License-Identifier: Apache-2.0
|
|
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
//! Tests for the module.
|
|
|
|
#![cfg(test)]
|
|
|
|
use super::{Call, Event, *};
|
|
use crate::mock::*;
|
|
use fg_primitives::ScheduledChange;
|
|
use frame_support::{
|
|
assert_err, assert_noop, assert_ok,
|
|
dispatch::{GetDispatchInfo, Pays},
|
|
traits::{Currency, KeyOwnerProofSystem, OnFinalize, OneSessionHandler},
|
|
};
|
|
use frame_system::{EventRecord, Phase};
|
|
use sp_core::H256;
|
|
use sp_keyring::Ed25519Keyring;
|
|
use sp_runtime::testing::Digest;
|
|
|
|
#[test]
|
|
fn authorities_change_logged() {
|
|
new_test_ext(vec![(1, 1), (2, 1), (3, 1)]).execute_with(|| {
|
|
initialize_block(1, Default::default());
|
|
Grandpa::schedule_change(to_authorities(vec![(4, 1), (5, 1), (6, 1)]), 0, None).unwrap();
|
|
|
|
System::note_finished_extrinsics();
|
|
Grandpa::on_finalize(1);
|
|
|
|
let header = System::finalize();
|
|
assert_eq!(
|
|
header.digest,
|
|
Digest {
|
|
logs: vec![grandpa_log(ConsensusLog::ScheduledChange(ScheduledChange {
|
|
delay: 0,
|
|
next_authorities: to_authorities(vec![(4, 1), (5, 1), (6, 1)])
|
|
})),],
|
|
}
|
|
);
|
|
|
|
assert_eq!(
|
|
System::events(),
|
|
vec![EventRecord {
|
|
phase: Phase::Finalization,
|
|
event: Event::NewAuthorities {
|
|
authority_set: to_authorities(vec![(4, 1), (5, 1), (6, 1)])
|
|
}
|
|
.into(),
|
|
topics: vec![],
|
|
},]
|
|
);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn authorities_change_logged_after_delay() {
|
|
new_test_ext(vec![(1, 1), (2, 1), (3, 1)]).execute_with(|| {
|
|
initialize_block(1, Default::default());
|
|
Grandpa::schedule_change(to_authorities(vec![(4, 1), (5, 1), (6, 1)]), 1, None).unwrap();
|
|
Grandpa::on_finalize(1);
|
|
let header = System::finalize();
|
|
assert_eq!(
|
|
header.digest,
|
|
Digest {
|
|
logs: vec![grandpa_log(ConsensusLog::ScheduledChange(ScheduledChange {
|
|
delay: 1,
|
|
next_authorities: to_authorities(vec![(4, 1), (5, 1), (6, 1)])
|
|
})),],
|
|
}
|
|
);
|
|
|
|
// no change at this height.
|
|
assert_eq!(System::events(), vec![]);
|
|
|
|
initialize_block(2, header.hash());
|
|
System::note_finished_extrinsics();
|
|
Grandpa::on_finalize(2);
|
|
|
|
let _header = System::finalize();
|
|
assert_eq!(
|
|
System::events(),
|
|
vec![EventRecord {
|
|
phase: Phase::Finalization,
|
|
event: Event::NewAuthorities {
|
|
authority_set: to_authorities(vec![(4, 1), (5, 1), (6, 1)])
|
|
}
|
|
.into(),
|
|
topics: vec![],
|
|
},]
|
|
);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn cannot_schedule_change_when_one_pending() {
|
|
new_test_ext(vec![(1, 1), (2, 1), (3, 1)]).execute_with(|| {
|
|
initialize_block(1, Default::default());
|
|
Grandpa::schedule_change(to_authorities(vec![(4, 1), (5, 1), (6, 1)]), 1, None).unwrap();
|
|
assert!(<PendingChange<Test>>::exists());
|
|
assert_noop!(
|
|
Grandpa::schedule_change(to_authorities(vec![(5, 1)]), 1, None),
|
|
Error::<Test>::ChangePending
|
|
);
|
|
|
|
Grandpa::on_finalize(1);
|
|
let header = System::finalize();
|
|
|
|
initialize_block(2, header.hash());
|
|
assert!(<PendingChange<Test>>::exists());
|
|
assert_noop!(
|
|
Grandpa::schedule_change(to_authorities(vec![(5, 1)]), 1, None),
|
|
Error::<Test>::ChangePending
|
|
);
|
|
|
|
Grandpa::on_finalize(2);
|
|
let header = System::finalize();
|
|
|
|
initialize_block(3, header.hash());
|
|
assert!(!<PendingChange<Test>>::exists());
|
|
assert_ok!(Grandpa::schedule_change(to_authorities(vec![(5, 1)]), 1, None));
|
|
|
|
Grandpa::on_finalize(3);
|
|
let _header = System::finalize();
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn dispatch_forced_change() {
|
|
new_test_ext(vec![(1, 1), (2, 1), (3, 1)]).execute_with(|| {
|
|
initialize_block(1, Default::default());
|
|
Grandpa::schedule_change(to_authorities(vec![(4, 1), (5, 1), (6, 1)]), 5, Some(0)).unwrap();
|
|
|
|
assert!(<PendingChange<Test>>::exists());
|
|
assert_noop!(
|
|
Grandpa::schedule_change(to_authorities(vec![(5, 1)]), 1, Some(0)),
|
|
Error::<Test>::ChangePending
|
|
);
|
|
|
|
Grandpa::on_finalize(1);
|
|
let mut header = System::finalize();
|
|
|
|
for i in 2..7 {
|
|
initialize_block(i, header.hash());
|
|
assert!(<PendingChange<Test>>::get().unwrap().forced.is_some());
|
|
assert_eq!(Grandpa::next_forced(), Some(11));
|
|
assert_noop!(
|
|
Grandpa::schedule_change(to_authorities(vec![(5, 1)]), 1, None),
|
|
Error::<Test>::ChangePending
|
|
);
|
|
assert_noop!(
|
|
Grandpa::schedule_change(to_authorities(vec![(5, 1)]), 1, Some(0)),
|
|
Error::<Test>::ChangePending
|
|
);
|
|
|
|
Grandpa::on_finalize(i);
|
|
header = System::finalize();
|
|
}
|
|
|
|
// change has been applied at the end of block 6.
|
|
// add a normal change.
|
|
{
|
|
initialize_block(7, header.hash());
|
|
assert!(!<PendingChange<Test>>::exists());
|
|
assert_eq!(
|
|
Grandpa::grandpa_authorities(),
|
|
to_authorities(vec![(4, 1), (5, 1), (6, 1)])
|
|
);
|
|
assert_ok!(Grandpa::schedule_change(to_authorities(vec![(5, 1)]), 1, None));
|
|
Grandpa::on_finalize(7);
|
|
header = System::finalize();
|
|
}
|
|
|
|
// run the normal change.
|
|
{
|
|
initialize_block(8, header.hash());
|
|
assert!(<PendingChange<Test>>::exists());
|
|
assert_eq!(
|
|
Grandpa::grandpa_authorities(),
|
|
to_authorities(vec![(4, 1), (5, 1), (6, 1)])
|
|
);
|
|
assert_noop!(
|
|
Grandpa::schedule_change(to_authorities(vec![(5, 1)]), 1, None),
|
|
Error::<Test>::ChangePending
|
|
);
|
|
Grandpa::on_finalize(8);
|
|
header = System::finalize();
|
|
}
|
|
|
|
// normal change applied. but we can't apply a new forced change for some
|
|
// time.
|
|
for i in 9..11 {
|
|
initialize_block(i, header.hash());
|
|
assert!(!<PendingChange<Test>>::exists());
|
|
assert_eq!(Grandpa::grandpa_authorities(), to_authorities(vec![(5, 1)]));
|
|
assert_eq!(Grandpa::next_forced(), Some(11));
|
|
assert_noop!(
|
|
Grandpa::schedule_change(to_authorities(vec![(5, 1), (6, 1)]), 5, Some(0)),
|
|
Error::<Test>::TooSoon
|
|
);
|
|
Grandpa::on_finalize(i);
|
|
header = System::finalize();
|
|
}
|
|
|
|
{
|
|
initialize_block(11, header.hash());
|
|
assert!(!<PendingChange<Test>>::exists());
|
|
assert_ok!(Grandpa::schedule_change(
|
|
to_authorities(vec![(5, 1), (6, 1), (7, 1)]),
|
|
5,
|
|
Some(0)
|
|
));
|
|
assert_eq!(Grandpa::next_forced(), Some(21));
|
|
Grandpa::on_finalize(11);
|
|
header = System::finalize();
|
|
}
|
|
let _ = header;
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn schedule_pause_only_when_live() {
|
|
new_test_ext(vec![(1, 1), (2, 1), (3, 1)]).execute_with(|| {
|
|
// we schedule a pause at block 1 with delay of 1
|
|
initialize_block(1, Default::default());
|
|
Grandpa::schedule_pause(1).unwrap();
|
|
|
|
// we've switched to the pending pause state
|
|
assert_eq!(Grandpa::state(), StoredState::PendingPause { scheduled_at: 1u64, delay: 1 });
|
|
|
|
Grandpa::on_finalize(1);
|
|
let _ = System::finalize();
|
|
|
|
initialize_block(2, Default::default());
|
|
|
|
// signaling a pause now should fail
|
|
assert_noop!(Grandpa::schedule_pause(1), Error::<Test>::PauseFailed);
|
|
|
|
Grandpa::on_finalize(2);
|
|
let _ = System::finalize();
|
|
|
|
// after finalizing block 2 the set should have switched to paused state
|
|
assert_eq!(Grandpa::state(), StoredState::Paused);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn schedule_resume_only_when_paused() {
|
|
new_test_ext(vec![(1, 1), (2, 1), (3, 1)]).execute_with(|| {
|
|
initialize_block(1, Default::default());
|
|
|
|
// the set is currently live, resuming it is an error
|
|
assert_noop!(Grandpa::schedule_resume(1), Error::<Test>::ResumeFailed);
|
|
|
|
assert_eq!(Grandpa::state(), StoredState::Live);
|
|
|
|
// we schedule a pause to be applied instantly
|
|
Grandpa::schedule_pause(0).unwrap();
|
|
Grandpa::on_finalize(1);
|
|
let _ = System::finalize();
|
|
|
|
assert_eq!(Grandpa::state(), StoredState::Paused);
|
|
|
|
// we schedule the set to go back live in 2 blocks
|
|
initialize_block(2, Default::default());
|
|
Grandpa::schedule_resume(2).unwrap();
|
|
Grandpa::on_finalize(2);
|
|
let _ = System::finalize();
|
|
|
|
initialize_block(3, Default::default());
|
|
Grandpa::on_finalize(3);
|
|
let _ = System::finalize();
|
|
|
|
initialize_block(4, Default::default());
|
|
Grandpa::on_finalize(4);
|
|
let _ = System::finalize();
|
|
|
|
// it should be live at block 4
|
|
assert_eq!(Grandpa::state(), StoredState::Live);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn time_slot_have_sane_ord() {
|
|
// Ensure that `Ord` implementation is sane.
|
|
const FIXTURE: &[TimeSlot] = &[
|
|
TimeSlot { set_id: 0, round: 0 },
|
|
TimeSlot { set_id: 0, round: 1 },
|
|
TimeSlot { set_id: 1, round: 0 },
|
|
TimeSlot { set_id: 1, round: 1 },
|
|
TimeSlot { set_id: 1, round: 2 },
|
|
];
|
|
assert!(FIXTURE.windows(2).all(|f| f[0] < f[1]));
|
|
}
|
|
|
|
/// Returns a list with 3 authorities with known keys:
|
|
/// Alice, Bob and Charlie.
|
|
pub fn test_authorities() -> AuthorityList {
|
|
let authorities = vec![Ed25519Keyring::Alice, Ed25519Keyring::Bob, Ed25519Keyring::Charlie];
|
|
|
|
authorities.into_iter().map(|id| (id.public().into(), 1u64)).collect()
|
|
}
|
|
|
|
#[test]
|
|
fn report_equivocation_current_set_works() {
|
|
let authorities = test_authorities();
|
|
|
|
new_test_ext_raw_authorities(authorities).execute_with(|| {
|
|
assert_eq!(Staking::current_era(), Some(0));
|
|
assert_eq!(Session::current_index(), 0);
|
|
|
|
start_era(1);
|
|
|
|
let authorities = Grandpa::grandpa_authorities();
|
|
let validators = Session::validators();
|
|
|
|
// make sure that all validators have the same balance
|
|
for validator in &validators {
|
|
assert_eq!(Balances::total_balance(validator), 10_000_000);
|
|
assert_eq!(Staking::slashable_balance_of(validator), 10_000);
|
|
|
|
assert_eq!(
|
|
Staking::eras_stakers(1, &validator),
|
|
pallet_staking::Exposure { total: 10_000, own: 10_000, others: vec![] },
|
|
);
|
|
}
|
|
|
|
let equivocation_authority_index = 0;
|
|
let equivocation_key = &authorities[equivocation_authority_index].0;
|
|
let equivocation_keyring = extract_keyring(equivocation_key);
|
|
|
|
let set_id = Grandpa::current_set_id();
|
|
|
|
// generate an equivocation proof, with two votes in the same round for
|
|
// different block hashes signed by the same key
|
|
let equivocation_proof = generate_equivocation_proof(
|
|
set_id,
|
|
(1, H256::random(), 10, &equivocation_keyring),
|
|
(1, H256::random(), 10, &equivocation_keyring),
|
|
);
|
|
|
|
// create the key ownership proof
|
|
let key_owner_proof =
|
|
Historical::prove((sp_consensus_grandpa::KEY_TYPE, &equivocation_key)).unwrap();
|
|
|
|
// report the equivocation and the tx should be dispatched successfully
|
|
assert_ok!(Grandpa::report_equivocation_unsigned(
|
|
RuntimeOrigin::none(),
|
|
Box::new(equivocation_proof),
|
|
key_owner_proof,
|
|
),);
|
|
|
|
start_era(2);
|
|
|
|
// check that the balance of 0-th validator is slashed 100%.
|
|
let equivocation_validator_id = validators[equivocation_authority_index];
|
|
|
|
assert_eq!(Balances::total_balance(&equivocation_validator_id), 10_000_000 - 10_000);
|
|
assert_eq!(Staking::slashable_balance_of(&equivocation_validator_id), 0);
|
|
assert_eq!(
|
|
Staking::eras_stakers(2, &equivocation_validator_id),
|
|
pallet_staking::Exposure { total: 0, own: 0, others: vec![] },
|
|
);
|
|
|
|
// check that the balances of all other validators are left intact.
|
|
for validator in &validators {
|
|
if *validator == equivocation_validator_id {
|
|
continue
|
|
}
|
|
|
|
assert_eq!(Balances::total_balance(validator), 10_000_000);
|
|
assert_eq!(Staking::slashable_balance_of(validator), 10_000);
|
|
|
|
assert_eq!(
|
|
Staking::eras_stakers(2, &validator),
|
|
pallet_staking::Exposure { total: 10_000, own: 10_000, others: vec![] },
|
|
);
|
|
}
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn report_equivocation_old_set_works() {
|
|
let authorities = test_authorities();
|
|
|
|
new_test_ext_raw_authorities(authorities).execute_with(|| {
|
|
start_era(1);
|
|
|
|
let authorities = Grandpa::grandpa_authorities();
|
|
let validators = Session::validators();
|
|
|
|
let equivocation_authority_index = 0;
|
|
let equivocation_key = &authorities[equivocation_authority_index].0;
|
|
|
|
// create the key ownership proof in the "old" set
|
|
let key_owner_proof =
|
|
Historical::prove((sp_consensus_grandpa::KEY_TYPE, &equivocation_key)).unwrap();
|
|
|
|
start_era(2);
|
|
|
|
// make sure that all authorities have the same balance
|
|
for validator in &validators {
|
|
assert_eq!(Balances::total_balance(validator), 10_000_000);
|
|
assert_eq!(Staking::slashable_balance_of(validator), 10_000);
|
|
|
|
assert_eq!(
|
|
Staking::eras_stakers(2, &validator),
|
|
pallet_staking::Exposure { total: 10_000, own: 10_000, others: vec![] },
|
|
);
|
|
}
|
|
|
|
let equivocation_keyring = extract_keyring(equivocation_key);
|
|
|
|
let set_id = Grandpa::current_set_id();
|
|
|
|
// generate an equivocation proof for the old set,
|
|
let equivocation_proof = generate_equivocation_proof(
|
|
set_id - 1,
|
|
(1, H256::random(), 10, &equivocation_keyring),
|
|
(1, H256::random(), 10, &equivocation_keyring),
|
|
);
|
|
|
|
// report the equivocation using the key ownership proof generated on
|
|
// the old set, the tx should be dispatched successfully
|
|
assert_ok!(Grandpa::report_equivocation_unsigned(
|
|
RuntimeOrigin::none(),
|
|
Box::new(equivocation_proof),
|
|
key_owner_proof,
|
|
),);
|
|
|
|
start_era(3);
|
|
|
|
// check that the balance of 0-th validator is slashed 100%.
|
|
let equivocation_validator_id = validators[equivocation_authority_index];
|
|
|
|
assert_eq!(Balances::total_balance(&equivocation_validator_id), 10_000_000 - 10_000);
|
|
assert_eq!(Staking::slashable_balance_of(&equivocation_validator_id), 0);
|
|
|
|
assert_eq!(
|
|
Staking::eras_stakers(3, &equivocation_validator_id),
|
|
pallet_staking::Exposure { total: 0, own: 0, others: vec![] },
|
|
);
|
|
|
|
// check that the balances of all other validators are left intact.
|
|
for validator in &validators {
|
|
if *validator == equivocation_validator_id {
|
|
continue
|
|
}
|
|
|
|
assert_eq!(Balances::total_balance(validator), 10_000_000);
|
|
assert_eq!(Staking::slashable_balance_of(validator), 10_000);
|
|
|
|
assert_eq!(
|
|
Staking::eras_stakers(3, &validator),
|
|
pallet_staking::Exposure { total: 10_000, own: 10_000, others: vec![] },
|
|
);
|
|
}
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn report_equivocation_invalid_set_id() {
|
|
let authorities = test_authorities();
|
|
|
|
new_test_ext_raw_authorities(authorities).execute_with(|| {
|
|
start_era(1);
|
|
|
|
let authorities = Grandpa::grandpa_authorities();
|
|
|
|
let equivocation_authority_index = 0;
|
|
let equivocation_key = &authorities[equivocation_authority_index].0;
|
|
let equivocation_keyring = extract_keyring(equivocation_key);
|
|
|
|
let key_owner_proof =
|
|
Historical::prove((sp_consensus_grandpa::KEY_TYPE, &equivocation_key)).unwrap();
|
|
|
|
let set_id = Grandpa::current_set_id();
|
|
|
|
// generate an equivocation for a future set
|
|
let equivocation_proof = generate_equivocation_proof(
|
|
set_id + 1,
|
|
(1, H256::random(), 10, &equivocation_keyring),
|
|
(1, H256::random(), 10, &equivocation_keyring),
|
|
);
|
|
|
|
// the call for reporting the equivocation should error
|
|
assert_err!(
|
|
Grandpa::report_equivocation_unsigned(
|
|
RuntimeOrigin::none(),
|
|
Box::new(equivocation_proof),
|
|
key_owner_proof,
|
|
),
|
|
Error::<Test>::InvalidEquivocationProof,
|
|
);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn report_equivocation_invalid_session() {
|
|
let authorities = test_authorities();
|
|
|
|
new_test_ext_raw_authorities(authorities).execute_with(|| {
|
|
start_era(1);
|
|
|
|
let authorities = Grandpa::grandpa_authorities();
|
|
|
|
let equivocation_authority_index = 0;
|
|
let equivocation_key = &authorities[equivocation_authority_index].0;
|
|
let equivocation_keyring = extract_keyring(equivocation_key);
|
|
|
|
// generate a key ownership proof at set id = 1
|
|
let key_owner_proof =
|
|
Historical::prove((sp_consensus_grandpa::KEY_TYPE, &equivocation_key)).unwrap();
|
|
|
|
start_era(2);
|
|
|
|
let set_id = Grandpa::current_set_id();
|
|
|
|
// generate an equivocation proof at set id = 2
|
|
let equivocation_proof = generate_equivocation_proof(
|
|
set_id,
|
|
(1, H256::random(), 10, &equivocation_keyring),
|
|
(1, H256::random(), 10, &equivocation_keyring),
|
|
);
|
|
|
|
// report an equivocation for the current set using an key ownership
|
|
// proof from the previous set, the session should be invalid.
|
|
assert_err!(
|
|
Grandpa::report_equivocation_unsigned(
|
|
RuntimeOrigin::none(),
|
|
Box::new(equivocation_proof),
|
|
key_owner_proof,
|
|
),
|
|
Error::<Test>::InvalidEquivocationProof,
|
|
);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn report_equivocation_invalid_key_owner_proof() {
|
|
let authorities = test_authorities();
|
|
|
|
new_test_ext_raw_authorities(authorities).execute_with(|| {
|
|
start_era(1);
|
|
let authorities = Grandpa::grandpa_authorities();
|
|
|
|
let invalid_owner_authority_index = 1;
|
|
let invalid_owner_key = &authorities[invalid_owner_authority_index].0;
|
|
|
|
// generate a key ownership proof for the authority at index 1
|
|
let invalid_key_owner_proof =
|
|
Historical::prove((sp_consensus_grandpa::KEY_TYPE, &invalid_owner_key)).unwrap();
|
|
|
|
let equivocation_authority_index = 0;
|
|
let equivocation_key = &authorities[equivocation_authority_index].0;
|
|
let equivocation_keyring = extract_keyring(equivocation_key);
|
|
|
|
let set_id = Grandpa::current_set_id();
|
|
|
|
// generate an equivocation proof for the authority at index 0
|
|
let equivocation_proof = generate_equivocation_proof(
|
|
set_id,
|
|
(1, H256::random(), 10, &equivocation_keyring),
|
|
(1, H256::random(), 10, &equivocation_keyring),
|
|
);
|
|
|
|
// we need to start a new era otherwise the key ownership proof won't be
|
|
// checked since the authorities are part of the current session
|
|
start_era(2);
|
|
|
|
// report an equivocation for the current set using a key ownership
|
|
// proof for a different key than the one in the equivocation proof.
|
|
assert_err!(
|
|
Grandpa::report_equivocation_unsigned(
|
|
RuntimeOrigin::none(),
|
|
Box::new(equivocation_proof),
|
|
invalid_key_owner_proof,
|
|
),
|
|
Error::<Test>::InvalidKeyOwnershipProof,
|
|
);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn report_equivocation_invalid_equivocation_proof() {
|
|
let authorities = test_authorities();
|
|
|
|
new_test_ext_raw_authorities(authorities).execute_with(|| {
|
|
start_era(1);
|
|
|
|
let authorities = Grandpa::grandpa_authorities();
|
|
|
|
let equivocation_authority_index = 0;
|
|
let equivocation_key = &authorities[equivocation_authority_index].0;
|
|
let equivocation_keyring = extract_keyring(equivocation_key);
|
|
|
|
// generate a key ownership proof at set id = 1
|
|
let key_owner_proof =
|
|
Historical::prove((sp_consensus_grandpa::KEY_TYPE, &equivocation_key)).unwrap();
|
|
|
|
let set_id = Grandpa::current_set_id();
|
|
|
|
let assert_invalid_equivocation_proof = |equivocation_proof| {
|
|
assert_err!(
|
|
Grandpa::report_equivocation_unsigned(
|
|
RuntimeOrigin::none(),
|
|
Box::new(equivocation_proof),
|
|
key_owner_proof.clone(),
|
|
),
|
|
Error::<Test>::InvalidEquivocationProof,
|
|
);
|
|
};
|
|
|
|
start_era(2);
|
|
|
|
// both votes target the same block number and hash,
|
|
// there is no equivocation.
|
|
assert_invalid_equivocation_proof(generate_equivocation_proof(
|
|
set_id,
|
|
(1, H256::zero(), 10, &equivocation_keyring),
|
|
(1, H256::zero(), 10, &equivocation_keyring),
|
|
));
|
|
|
|
// votes targetting different rounds, there is no equivocation.
|
|
assert_invalid_equivocation_proof(generate_equivocation_proof(
|
|
set_id,
|
|
(1, H256::random(), 10, &equivocation_keyring),
|
|
(2, H256::random(), 10, &equivocation_keyring),
|
|
));
|
|
|
|
// votes signed with different authority keys
|
|
assert_invalid_equivocation_proof(generate_equivocation_proof(
|
|
set_id,
|
|
(1, H256::random(), 10, &equivocation_keyring),
|
|
(1, H256::random(), 10, &Ed25519Keyring::Charlie),
|
|
));
|
|
|
|
// votes signed with a key that isn't part of the authority set
|
|
assert_invalid_equivocation_proof(generate_equivocation_proof(
|
|
set_id,
|
|
(1, H256::random(), 10, &equivocation_keyring),
|
|
(1, H256::random(), 10, &Ed25519Keyring::Dave),
|
|
));
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn report_equivocation_validate_unsigned_prevents_duplicates() {
|
|
use sp_runtime::transaction_validity::{
|
|
InvalidTransaction, TransactionPriority, TransactionSource, TransactionValidity,
|
|
ValidTransaction,
|
|
};
|
|
|
|
let authorities = test_authorities();
|
|
|
|
new_test_ext_raw_authorities(authorities).execute_with(|| {
|
|
start_era(1);
|
|
|
|
let authorities = Grandpa::grandpa_authorities();
|
|
|
|
// generate and report an equivocation for the validator at index 0
|
|
let equivocation_authority_index = 0;
|
|
let equivocation_key = &authorities[equivocation_authority_index].0;
|
|
let equivocation_keyring = extract_keyring(equivocation_key);
|
|
let set_id = Grandpa::current_set_id();
|
|
|
|
let equivocation_proof = generate_equivocation_proof(
|
|
set_id,
|
|
(1, H256::random(), 10, &equivocation_keyring),
|
|
(1, H256::random(), 10, &equivocation_keyring),
|
|
);
|
|
|
|
let key_owner_proof =
|
|
Historical::prove((sp_consensus_grandpa::KEY_TYPE, &equivocation_key)).unwrap();
|
|
|
|
let call = Call::report_equivocation_unsigned {
|
|
equivocation_proof: Box::new(equivocation_proof.clone()),
|
|
key_owner_proof: key_owner_proof.clone(),
|
|
};
|
|
|
|
// only local/inblock reports are allowed
|
|
assert_eq!(
|
|
<Grandpa as sp_runtime::traits::ValidateUnsigned>::validate_unsigned(
|
|
TransactionSource::External,
|
|
&call,
|
|
),
|
|
InvalidTransaction::Call.into(),
|
|
);
|
|
|
|
// the transaction is valid when passed as local
|
|
let tx_tag = (equivocation_key, set_id, 1u64);
|
|
|
|
assert_eq!(
|
|
<Grandpa as sp_runtime::traits::ValidateUnsigned>::validate_unsigned(
|
|
TransactionSource::Local,
|
|
&call,
|
|
),
|
|
TransactionValidity::Ok(ValidTransaction {
|
|
priority: TransactionPriority::max_value(),
|
|
requires: vec![],
|
|
provides: vec![("GrandpaEquivocation", tx_tag).encode()],
|
|
longevity: ReportLongevity::get(),
|
|
propagate: false,
|
|
})
|
|
);
|
|
|
|
// the pre dispatch checks should also pass
|
|
assert_ok!(<Grandpa as sp_runtime::traits::ValidateUnsigned>::pre_dispatch(&call));
|
|
|
|
// we submit the report
|
|
Grandpa::report_equivocation_unsigned(
|
|
RuntimeOrigin::none(),
|
|
Box::new(equivocation_proof),
|
|
key_owner_proof,
|
|
)
|
|
.unwrap();
|
|
|
|
// the report should now be considered stale and the transaction is invalid
|
|
// the check for staleness should be done on both `validate_unsigned` and on `pre_dispatch`
|
|
assert_err!(
|
|
<Grandpa as sp_runtime::traits::ValidateUnsigned>::validate_unsigned(
|
|
TransactionSource::Local,
|
|
&call,
|
|
),
|
|
InvalidTransaction::Stale,
|
|
);
|
|
|
|
assert_err!(
|
|
<Grandpa as sp_runtime::traits::ValidateUnsigned>::pre_dispatch(&call),
|
|
InvalidTransaction::Stale,
|
|
);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn on_new_session_doesnt_start_new_set_if_schedule_change_failed() {
|
|
new_test_ext(vec![(1, 1), (2, 1), (3, 1)]).execute_with(|| {
|
|
assert_eq!(Grandpa::current_set_id(), 0);
|
|
|
|
// starting a new era should lead to a change in the session
|
|
// validators and trigger a new set
|
|
start_era(1);
|
|
assert_eq!(Grandpa::current_set_id(), 1);
|
|
|
|
// we schedule a change delayed by 2 blocks, this should make it so that
|
|
// when we try to rotate the session at the beginning of the era we will
|
|
// fail to schedule a change (there's already one pending), so we should
|
|
// not increment the set id.
|
|
Grandpa::schedule_change(to_authorities(vec![(1, 1)]), 2, None).unwrap();
|
|
start_era(2);
|
|
assert_eq!(Grandpa::current_set_id(), 1);
|
|
|
|
// everything should go back to normal after.
|
|
start_era(3);
|
|
assert_eq!(Grandpa::current_set_id(), 2);
|
|
|
|
// session rotation might also fail to schedule a change if it's for a
|
|
// forced change (i.e. grandpa is stalled) and it is too soon.
|
|
<NextForced<Test>>::put(1000);
|
|
<Stalled<Test>>::put((30, 1));
|
|
|
|
// NOTE: we cannot go through normal era rotation since having `Stalled`
|
|
// defined will also trigger a new set (regardless of whether the
|
|
// session validators changed)
|
|
Grandpa::on_new_session(true, std::iter::empty(), std::iter::empty());
|
|
assert_eq!(Grandpa::current_set_id(), 2);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn cleans_up_old_set_id_session_mappings() {
|
|
new_test_ext(vec![(1, 1), (2, 1), (3, 1)]).execute_with(|| {
|
|
let max_set_id_session_entries = MaxSetIdSessionEntries::get();
|
|
|
|
start_era(max_set_id_session_entries);
|
|
|
|
// we should have a session id mapping for all the set ids from
|
|
// `max_set_id_session_entries` eras we have observed
|
|
for i in 1..=max_set_id_session_entries {
|
|
assert!(Grandpa::session_for_set(i as u64).is_some());
|
|
}
|
|
|
|
start_era(max_set_id_session_entries * 2);
|
|
|
|
// we should keep tracking the new mappings for new eras
|
|
for i in max_set_id_session_entries + 1..=max_set_id_session_entries * 2 {
|
|
assert!(Grandpa::session_for_set(i as u64).is_some());
|
|
}
|
|
|
|
// but the old ones should have been pruned by now
|
|
for i in 1..=max_set_id_session_entries {
|
|
assert!(Grandpa::session_for_set(i as u64).is_none());
|
|
}
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn always_schedules_a_change_on_new_session_when_stalled() {
|
|
new_test_ext(vec![(1, 1), (2, 1), (3, 1)]).execute_with(|| {
|
|
start_era(1);
|
|
|
|
assert!(Grandpa::pending_change().is_none());
|
|
assert_eq!(Grandpa::current_set_id(), 1);
|
|
|
|
// if the session handler reports no change then we should not schedule
|
|
// any pending change
|
|
Grandpa::on_new_session(false, std::iter::empty(), std::iter::empty());
|
|
|
|
assert!(Grandpa::pending_change().is_none());
|
|
assert_eq!(Grandpa::current_set_id(), 1);
|
|
|
|
// if grandpa is stalled then we should **always** schedule a forced
|
|
// change on a new session
|
|
<Stalled<Test>>::put((10, 1));
|
|
Grandpa::on_new_session(false, std::iter::empty(), std::iter::empty());
|
|
|
|
assert!(Grandpa::pending_change().is_some());
|
|
assert!(Grandpa::pending_change().unwrap().forced.is_some());
|
|
assert_eq!(Grandpa::current_set_id(), 2);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn report_equivocation_has_valid_weight() {
|
|
// the weight depends on the size of the validator set,
|
|
// but there's a lower bound of 100 validators.
|
|
assert!((1..=100)
|
|
.map(|validators| <Test as Config>::WeightInfo::report_equivocation(validators, 1000))
|
|
.collect::<Vec<_>>()
|
|
.windows(2)
|
|
.all(|w| w[0] == w[1]));
|
|
|
|
// after 100 validators the weight should keep increasing
|
|
// with every extra validator.
|
|
assert!((100..=1000)
|
|
.map(|validators| <Test as Config>::WeightInfo::report_equivocation(validators, 1000))
|
|
.collect::<Vec<_>>()
|
|
.windows(2)
|
|
.all(|w| w[0].ref_time() < w[1].ref_time()));
|
|
}
|
|
|
|
#[test]
|
|
fn valid_equivocation_reports_dont_pay_fees() {
|
|
let authorities = test_authorities();
|
|
|
|
new_test_ext_raw_authorities(authorities).execute_with(|| {
|
|
start_era(1);
|
|
|
|
let equivocation_key = &Grandpa::grandpa_authorities()[0].0;
|
|
let equivocation_keyring = extract_keyring(equivocation_key);
|
|
let set_id = Grandpa::current_set_id();
|
|
|
|
// generate an equivocation proof.
|
|
let equivocation_proof = generate_equivocation_proof(
|
|
set_id,
|
|
(1, H256::random(), 10, &equivocation_keyring),
|
|
(1, H256::random(), 10, &equivocation_keyring),
|
|
);
|
|
|
|
// create the key ownership proof.
|
|
let key_owner_proof =
|
|
Historical::prove((sp_consensus_grandpa::KEY_TYPE, &equivocation_key)).unwrap();
|
|
|
|
// check the dispatch info for the call.
|
|
let info = Call::<Test>::report_equivocation_unsigned {
|
|
equivocation_proof: Box::new(equivocation_proof.clone()),
|
|
key_owner_proof: key_owner_proof.clone(),
|
|
}
|
|
.get_dispatch_info();
|
|
|
|
// it should have non-zero weight and the fee has to be paid.
|
|
assert!(info.weight.any_gt(Weight::zero()));
|
|
assert_eq!(info.pays_fee, Pays::Yes);
|
|
|
|
// report the equivocation.
|
|
let post_info = Grandpa::report_equivocation_unsigned(
|
|
RuntimeOrigin::none(),
|
|
Box::new(equivocation_proof.clone()),
|
|
key_owner_proof.clone(),
|
|
)
|
|
.unwrap();
|
|
|
|
// the original weight should be kept, but given that the report
|
|
// is valid the fee is waived.
|
|
assert!(post_info.actual_weight.is_none());
|
|
assert_eq!(post_info.pays_fee, Pays::No);
|
|
|
|
// report the equivocation again which is invalid now since it is
|
|
// duplicate.
|
|
let post_info = Grandpa::report_equivocation_unsigned(
|
|
RuntimeOrigin::none(),
|
|
Box::new(equivocation_proof),
|
|
key_owner_proof,
|
|
)
|
|
.err()
|
|
.unwrap()
|
|
.post_info;
|
|
|
|
// the fee is not waived and the original weight is kept.
|
|
assert!(post_info.actual_weight.is_none());
|
|
assert_eq!(post_info.pays_fee, Pays::Yes);
|
|
})
|
|
}
|