mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-05-30 18:41:03 +00:00
0e40983f3b
* Fix warnings in libp2p * Force a reason when you use the fatalist disable_peer * Print more information * Slightly more concise ref-fu * Tracing for figuring out what's going into genesis * Merge * Fxi test
377 lines
12 KiB
Rust
377 lines
12 KiB
Rust
// Copyright 2017 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/>.
|
|
|
|
//! Main parachains logic. For now this is just the determination of which validators do what.
|
|
|
|
use rstd::prelude::*;
|
|
use codec::Decode;
|
|
|
|
use runtime_primitives::traits::{Hash, BlakeTwo256, Executable, RefInto, MaybeEmpty};
|
|
use primitives::parachain::{Id, Chain, DutyRoster, CandidateReceipt};
|
|
use {system, session};
|
|
|
|
use substrate_runtime_support::{StorageValue, StorageMap};
|
|
use substrate_runtime_support::dispatch::Result;
|
|
|
|
#[cfg(any(feature = "std", test))]
|
|
use rstd::marker::PhantomData;
|
|
|
|
#[cfg(any(feature = "std", test))]
|
|
use {runtime_io, runtime_primitives};
|
|
|
|
pub trait Trait: system::Trait<Hash = ::primitives::Hash> + session::Trait {
|
|
/// The position of the set_heads call in the block.
|
|
const SET_POSITION: u32;
|
|
|
|
type PublicAux: RefInto<Self::AccountId> + MaybeEmpty;
|
|
}
|
|
|
|
decl_module! {
|
|
/// Parachains module.
|
|
pub struct Module<T: Trait>;
|
|
/// Call type for parachains.
|
|
#[cfg_attr(feature = "std", derive(Serialize, Deserialize))]
|
|
pub enum Call where aux: <T as Trait>::PublicAux {
|
|
// provide candidate receipts for parachains, in ascending order by id.
|
|
fn set_heads(aux, heads: Vec<CandidateReceipt>) -> Result = 0;
|
|
}
|
|
|
|
/// Private calls for parachains.
|
|
#[cfg_attr(feature = "std", derive(Serialize, Deserialize))]
|
|
pub enum PrivCall {
|
|
fn register_parachain(id: Id, code: Vec<u8>, initial_head_data: Vec<u8>) -> Result = 0;
|
|
fn deregister_parachain(id: Id) -> Result = 1;
|
|
}
|
|
}
|
|
|
|
decl_storage! {
|
|
trait Store for Module<T: Trait>;
|
|
// Vector of all parachain IDs.
|
|
pub Parachains get(active_parachains): b"para:chains" => default Vec<Id>;
|
|
// The parachains registered at present.
|
|
pub Code get(parachain_code): b"para:code" => map [ Id => Vec<u8> ];
|
|
// The heads of the parachains registered at present. these are kept sorted.
|
|
pub Heads get(parachain_head): b"para:head" => map [ Id => Vec<u8> ];
|
|
|
|
// Did the parachain heads get updated in this block?
|
|
DidUpdate: b"para:did" => default bool;
|
|
}
|
|
|
|
impl<T: Trait> Module<T> {
|
|
/// Calculate the current block's duty roster using system's random seed.
|
|
pub fn calculate_duty_roster() -> DutyRoster {
|
|
let parachains = Self::active_parachains();
|
|
let parachain_count = parachains.len();
|
|
let validator_count = <session::Module<T>>::validator_count() as usize;
|
|
let validators_per_parachain = if parachain_count != 0 { (validator_count - 1) / parachain_count } else { 0 };
|
|
|
|
let mut roles_val = (0..validator_count).map(|i| match i {
|
|
i if i < parachain_count * validators_per_parachain => {
|
|
let idx = i / validators_per_parachain;
|
|
Chain::Parachain(parachains[idx].clone())
|
|
}
|
|
_ => Chain::Relay,
|
|
}).collect::<Vec<_>>();
|
|
|
|
let mut roles_gua = roles_val.clone();
|
|
|
|
let mut random_seed = system::Module::<T>::random_seed().to_vec();
|
|
random_seed.extend(b"validator_role_pairs");
|
|
let mut seed = BlakeTwo256::hash(&random_seed);
|
|
|
|
// shuffle
|
|
for i in 0..(validator_count - 1) {
|
|
// 8 bytes of entropy used per cycle, 32 bytes entropy per hash
|
|
let offset = (i * 8 % 32) as usize;
|
|
|
|
// number of roles remaining to select from.
|
|
let remaining = (validator_count - i) as usize;
|
|
|
|
// 4 * 2 32-bit ints per 256-bit seed.
|
|
let val_index = u32::decode(&mut &seed[offset..offset + 4]).expect("using 4 bytes for a 32-bit quantity") as usize % remaining;
|
|
let gua_index = u32::decode(&mut &seed[offset + 4..offset + 8]).expect("using 4 bytes for a 32-bit quantity") as usize % remaining;
|
|
|
|
if offset == 24 {
|
|
// into the last 8 bytes - rehash to gather new entropy
|
|
seed = BlakeTwo256::hash(&seed);
|
|
}
|
|
|
|
// exchange last item with randomly chosen first.
|
|
roles_val.swap(remaining - 1, val_index);
|
|
roles_gua.swap(remaining - 1, gua_index);
|
|
}
|
|
|
|
DutyRoster {
|
|
validator_duty: roles_val,
|
|
guarantor_duty: roles_gua,
|
|
}
|
|
}
|
|
|
|
/// Register a parachain with given code.
|
|
/// Fails if given ID is already used.
|
|
pub fn register_parachain(id: Id, code: Vec<u8>, initial_head_data: Vec<u8>) -> Result {
|
|
let mut parachains = Self::active_parachains();
|
|
match parachains.binary_search(&id) {
|
|
Ok(_) => fail!("Parachain already exists"),
|
|
Err(idx) => parachains.insert(idx, id),
|
|
}
|
|
|
|
<Code<T>>::insert(id, code);
|
|
<Parachains<T>>::put(parachains);
|
|
<Heads<T>>::insert(id, initial_head_data);
|
|
|
|
Ok(())
|
|
}
|
|
|
|
/// Deregister a parachain with given id
|
|
pub fn deregister_parachain(id: Id) -> Result {
|
|
let mut parachains = Self::active_parachains();
|
|
match parachains.binary_search(&id) {
|
|
Ok(idx) => { parachains.remove(idx); }
|
|
Err(_) => {}
|
|
}
|
|
|
|
<Code<T>>::remove(id);
|
|
<Heads<T>>::remove(id);
|
|
<Parachains<T>>::put(parachains);
|
|
Ok(())
|
|
}
|
|
|
|
fn set_heads(aux: &<T as Trait>::PublicAux, heads: Vec<CandidateReceipt>) -> Result {
|
|
ensure!(aux.is_empty(), "set_heads must not be signed");
|
|
ensure!(!<DidUpdate<T>>::exists(), "Parachain heads must be updated only once in the block");
|
|
ensure!(
|
|
<system::Module<T>>::extrinsic_index() == T::SET_POSITION,
|
|
"Parachain heads update extrinsic must be at position {} in the block"
|
|
// , T::SET_POSITION
|
|
);
|
|
|
|
let active_parachains = Self::active_parachains();
|
|
let mut iter = active_parachains.iter();
|
|
|
|
// perform this check before writing to storage.
|
|
for head in &heads {
|
|
ensure!(
|
|
iter.find(|&p| p == &head.parachain_index).is_some(),
|
|
"Submitted candidate for unregistered or out-of-order parachain {}"
|
|
// , head.parachain_index.into_inner()
|
|
);
|
|
}
|
|
|
|
for head in heads {
|
|
let id = head.parachain_index.clone();
|
|
<Heads<T>>::insert(id, head.head_data.0);
|
|
}
|
|
|
|
<DidUpdate<T>>::put(true);
|
|
|
|
Ok(())
|
|
}
|
|
}
|
|
|
|
impl<T: Trait> Executable for Module<T> {
|
|
fn execute() {
|
|
assert!(<Self as Store>::DidUpdate::take(), "Parachain heads must be updated once in the block");
|
|
}
|
|
}
|
|
|
|
/// Parachains module genesis configuration.
|
|
#[cfg(any(feature = "std", test))]
|
|
#[derive(Serialize, Deserialize)]
|
|
#[serde(rename_all = "camelCase")]
|
|
#[serde(deny_unknown_fields)]
|
|
pub struct GenesisConfig<T: Trait> {
|
|
/// The initial parachains, mapped to code.
|
|
pub parachains: Vec<(Id, Vec<u8>)>,
|
|
/// Phantom data.
|
|
#[serde(skip)]
|
|
pub phantom: PhantomData<T>,
|
|
}
|
|
|
|
#[cfg(any(feature = "std", test))]
|
|
impl<T: Trait> Default for GenesisConfig<T> {
|
|
fn default() -> Self {
|
|
GenesisConfig {
|
|
parachains: Vec::new(),
|
|
phantom: PhantomData,
|
|
}
|
|
}
|
|
}
|
|
|
|
#[cfg(any(feature = "std", test))]
|
|
impl<T: Trait> runtime_primitives::BuildStorage for GenesisConfig<T>
|
|
{
|
|
fn build_storage(mut self) -> ::std::result::Result<runtime_io::TestExternalities, String> {
|
|
use std::collections::HashMap;
|
|
use codec::Encode;
|
|
|
|
self.parachains.sort_unstable_by_key(|&(ref id, _)| id.clone());
|
|
self.parachains.dedup_by_key(|&mut (ref id, _)| id.clone());
|
|
|
|
let only_ids: Vec<_> = self.parachains.iter().map(|&(ref id, _)| id).cloned().collect();
|
|
|
|
let mut map: HashMap<_, _> = map![
|
|
Self::hash(<Parachains<T>>::key()).to_vec() => only_ids.encode()
|
|
];
|
|
|
|
for (id, code) in self.parachains {
|
|
let key = Self::hash(&<Code<T>>::key_for(&id)).to_vec();
|
|
map.insert(key, code.encode());
|
|
}
|
|
|
|
Ok(map.into())
|
|
}
|
|
}
|
|
|
|
#[cfg(test)]
|
|
mod tests {
|
|
use super::*;
|
|
use runtime_io::with_externalities;
|
|
use substrate_primitives::H256;
|
|
use runtime_primitives::BuildStorage;
|
|
use runtime_primitives::traits::{HasPublicAux, Identity, BlakeTwo256};
|
|
use runtime_primitives::testing::{Digest, Header};
|
|
use {consensus, timestamp};
|
|
|
|
#[derive(Clone, Eq, PartialEq)]
|
|
pub struct Test;
|
|
impl HasPublicAux for Test {
|
|
type PublicAux = u64;
|
|
}
|
|
impl consensus::Trait for Test {
|
|
type PublicAux = <Self as HasPublicAux>::PublicAux;
|
|
type SessionKey = u64;
|
|
}
|
|
impl system::Trait for Test {
|
|
type Index = u64;
|
|
type BlockNumber = u64;
|
|
type Hash = H256;
|
|
type Hashing = BlakeTwo256;
|
|
type Digest = Digest;
|
|
type AccountId = u64;
|
|
type Header = Header;
|
|
}
|
|
impl session::Trait for Test {
|
|
type ConvertAccountIdToSessionKey = Identity;
|
|
type OnSessionChange = ();
|
|
}
|
|
impl timestamp::Trait for Test {
|
|
const TIMESTAMP_SET_POSITION: u32 = 0;
|
|
type Moment = u64;
|
|
}
|
|
impl Trait for Test {
|
|
const SET_POSITION: u32 = 0;
|
|
|
|
type PublicAux = <Self as HasPublicAux>::PublicAux;
|
|
}
|
|
|
|
type Parachains = Module<Test>;
|
|
|
|
fn new_test_ext(parachains: Vec<(Id, Vec<u8>)>) -> runtime_io::TestExternalities {
|
|
let mut t = system::GenesisConfig::<Test>::default().build_storage().unwrap();
|
|
t.extend(consensus::GenesisConfig::<Test>{
|
|
code: vec![],
|
|
authorities: vec![1, 2, 3],
|
|
}.build_storage().unwrap());
|
|
t.extend(session::GenesisConfig::<Test>{
|
|
session_length: 1000,
|
|
validators: vec![1, 2, 3, 4, 5, 6, 7, 8],
|
|
broken_percent_late: 100,
|
|
}.build_storage().unwrap());
|
|
t.extend(GenesisConfig::<Test>{
|
|
parachains: parachains,
|
|
phantom: PhantomData,
|
|
}.build_storage().unwrap());
|
|
t
|
|
}
|
|
|
|
#[test]
|
|
fn active_parachains_should_work() {
|
|
let parachains = vec![
|
|
(5u32.into(), vec![1,2,3]),
|
|
(100u32.into(), vec![4,5,6]),
|
|
];
|
|
|
|
with_externalities(&mut new_test_ext(parachains), || {
|
|
assert_eq!(Parachains::active_parachains(), vec![5u32.into(), 100u32.into()]);
|
|
assert_eq!(Parachains::parachain_code(&5u32.into()), Some(vec![1,2,3]));
|
|
assert_eq!(Parachains::parachain_code(&100u32.into()), Some(vec![4,5,6]));
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn register_deregister() {
|
|
let parachains = vec![
|
|
(5u32.into(), vec![1,2,3]),
|
|
(100u32.into(), vec![4,5,6]),
|
|
];
|
|
|
|
with_externalities(&mut new_test_ext(parachains), || {
|
|
assert_eq!(Parachains::active_parachains(), vec![5u32.into(), 100u32.into()]);
|
|
|
|
assert_eq!(Parachains::parachain_code(&5u32.into()), Some(vec![1,2,3]));
|
|
assert_eq!(Parachains::parachain_code(&100u32.into()), Some(vec![4,5,6]));
|
|
|
|
Parachains::register_parachain(99u32.into(), vec![7,8,9], vec![1, 1, 1]).unwrap();
|
|
|
|
assert_eq!(Parachains::active_parachains(), vec![5u32.into(), 99u32.into(), 100u32.into()]);
|
|
assert_eq!(Parachains::parachain_code(&99u32.into()), Some(vec![7,8,9]));
|
|
|
|
Parachains::deregister_parachain(5u32.into()).unwrap();
|
|
|
|
assert_eq!(Parachains::active_parachains(), vec![99u32.into(), 100u32.into()]);
|
|
assert_eq!(Parachains::parachain_code(&5u32.into()), None);
|
|
});
|
|
}
|
|
|
|
#[test]
|
|
fn duty_roster_works() {
|
|
let parachains = vec![
|
|
(0u32.into(), vec![]),
|
|
(1u32.into(), vec![]),
|
|
];
|
|
|
|
with_externalities(&mut new_test_ext(parachains), || {
|
|
let check_roster = |duty_roster: &DutyRoster| {
|
|
assert_eq!(duty_roster.validator_duty.len(), 8);
|
|
assert_eq!(duty_roster.guarantor_duty.len(), 8);
|
|
for i in (0..2).map(Id::from) {
|
|
assert_eq!(duty_roster.validator_duty.iter().filter(|&&j| j == Chain::Parachain(i)).count(), 3);
|
|
assert_eq!(duty_roster.guarantor_duty.iter().filter(|&&j| j == Chain::Parachain(i)).count(), 3);
|
|
}
|
|
assert_eq!(duty_roster.validator_duty.iter().filter(|&&j| j == Chain::Relay).count(), 2);
|
|
assert_eq!(duty_roster.guarantor_duty.iter().filter(|&&j| j == Chain::Relay).count(), 2);
|
|
};
|
|
|
|
system::Module::<Test>::set_random_seed([0u8; 32].into());
|
|
let duty_roster_0 = Parachains::calculate_duty_roster();
|
|
check_roster(&duty_roster_0);
|
|
|
|
system::Module::<Test>::set_random_seed([1u8; 32].into());
|
|
let duty_roster_1 = Parachains::calculate_duty_roster();
|
|
check_roster(&duty_roster_1);
|
|
assert!(duty_roster_0 != duty_roster_1);
|
|
|
|
|
|
system::Module::<Test>::set_random_seed([2u8; 32].into());
|
|
let duty_roster_2 = Parachains::calculate_duty_roster();
|
|
check_roster(&duty_roster_2);
|
|
assert!(duty_roster_0 != duty_roster_2);
|
|
assert!(duty_roster_1 != duty_roster_2);
|
|
});
|
|
}
|
|
}
|