mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-06-18 18:51:02 +00:00
Vivek Pandya
bc53b9a03a
* Change copyright year to 2023 from 2022 * Fix incorrect update of copyright year * Remove years from copy right header * Fix remaining files * Fix typo in a header and remove update-copyright.sh
95 lines
3.0 KiB
Rust
95 lines
3.0 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.
|
|
|
|
//! Fuzzing for phragmms.
|
|
|
|
mod common;
|
|
|
|
use common::*;
|
|
use honggfuzz::fuzz;
|
|
use rand::{self, SeedableRng};
|
|
use sp_npos_elections::{
|
|
assignment_ratio_to_staked_normalized, phragmms, to_supports, BalancingConfig, ElectionResult,
|
|
EvaluateSupport, VoteWeight,
|
|
};
|
|
use sp_runtime::Perbill;
|
|
|
|
fn main() {
|
|
loop {
|
|
fuzz!(|data: (usize, usize, usize, usize, u64)| {
|
|
let (mut target_count, mut voter_count, mut iterations, mut to_elect, seed) = data;
|
|
let rng = rand::rngs::SmallRng::seed_from_u64(seed);
|
|
target_count = to_range(target_count, 100, 200);
|
|
voter_count = to_range(voter_count, 100, 200);
|
|
iterations = to_range(iterations, 5, 30);
|
|
to_elect = to_range(to_elect, 25, target_count);
|
|
|
|
println!(
|
|
"++ [voter_count: {} / target_count:{} / to_elect:{} / iterations:{}]",
|
|
voter_count, target_count, to_elect, iterations,
|
|
);
|
|
let (unbalanced, candidates, voters, stake_of_tree) = generate_random_npos_result(
|
|
voter_count as u64,
|
|
target_count as u64,
|
|
to_elect,
|
|
rng,
|
|
ElectionType::Phragmms(None),
|
|
);
|
|
|
|
let stake_of = |who: &AccountId| -> VoteWeight { *stake_of_tree.get(who).unwrap() };
|
|
|
|
let unbalanced_score = {
|
|
let staked =
|
|
assignment_ratio_to_staked_normalized(unbalanced.assignments, &stake_of)
|
|
.unwrap();
|
|
let score = to_supports(&staked).evaluate();
|
|
|
|
if score.minimal_stake == 0 {
|
|
// such cases cannot be improved by balancing.
|
|
return
|
|
}
|
|
score
|
|
};
|
|
|
|
let config = BalancingConfig { iterations, tolerance: 0 };
|
|
let balanced: ElectionResult<AccountId, Perbill> =
|
|
phragmms(to_elect, candidates, voters, Some(config)).unwrap();
|
|
|
|
let balanced_score = {
|
|
let staked =
|
|
assignment_ratio_to_staked_normalized(balanced.assignments, &stake_of).unwrap();
|
|
to_supports(staked.as_ref()).evaluate()
|
|
};
|
|
|
|
let enhance = balanced_score.strict_threshold_better(unbalanced_score, Perbill::zero());
|
|
|
|
println!(
|
|
"iter = {} // {:?} -> {:?} [{}]",
|
|
iterations, unbalanced_score, balanced_score, enhance,
|
|
);
|
|
|
|
// The only guarantee of balancing is such that the first and third element of the score
|
|
// cannot decrease.
|
|
assert!(
|
|
balanced_score.minimal_stake >= unbalanced_score.minimal_stake &&
|
|
balanced_score.sum_stake == unbalanced_score.sum_stake &&
|
|
balanced_score.sum_stake_squared <= unbalanced_score.sum_stake_squared
|
|
);
|
|
});
|
|
}
|
|
}
|