mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-05-30 17:31:03 +00:00
Rename Palette to FRAME (#4182)
* palette -> frame * PALETTE, Palette -> FRAME * Move folder pallete -> frame * Update docs/Structure.adoc Co-Authored-By: Benjamin Kampmann <ben.kampmann@googlemail.com> * Update docs/README.adoc Co-Authored-By: Benjamin Kampmann <ben.kampmann@googlemail.com> * Update README.adoc
This commit is contained in:
@@ -0,0 +1,28 @@
|
||||
[package]
|
||||
name = "pallet-randomness-collective-flip"
|
||||
version = "2.0.0"
|
||||
authors = ["Parity Technologies <admin@parity.io>"]
|
||||
edition = "2018"
|
||||
|
||||
[dependencies]
|
||||
safe-mix = { version = "1.0", default-features = false }
|
||||
codec = { package = "parity-scale-codec", version = "1.0.0", default-features = false, features = ["derive"] }
|
||||
sr-primitives = { path = "../../primitives/sr-primitives", default-features = false }
|
||||
support = { package = "frame-support", path = "../support", default-features = false }
|
||||
system = { package = "frame-system", path = "../system", default-features = false }
|
||||
rstd = { package = "sr-std", path = "../../primitives/sr-std", default-features = false }
|
||||
|
||||
[dev-dependencies]
|
||||
primitives = { package = "substrate-primitives", path = "../../primitives/core" }
|
||||
runtime-io = { package = "sr-io", path = "../../primitives/sr-io" }
|
||||
|
||||
[features]
|
||||
default = ["std"]
|
||||
std = [
|
||||
"safe-mix/std",
|
||||
"system/std",
|
||||
"codec/std",
|
||||
"support/std",
|
||||
"sr-primitives/std",
|
||||
"rstd/std",
|
||||
]
|
||||
@@ -0,0 +1,280 @@
|
||||
// Copyright 2019 Parity Technologies (UK) Ltd.
|
||||
// This file is part of Substrate.
|
||||
|
||||
// Substrate 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.
|
||||
|
||||
// Substrate 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 Substrate. If not, see <http://www.gnu.org/licenses/>.
|
||||
|
||||
//! # Randomness Module
|
||||
//!
|
||||
//! The Randomness Collective Flip module provides a [`random`](./struct.Module.html#method.random)
|
||||
//! function that generates low-influence random values based on the block hashes from the previous
|
||||
//! `81` blocks. Low-influence randomness can be useful when defending against relatively weak
|
||||
//! adversaries.
|
||||
//!
|
||||
//! ## Public Functions
|
||||
//!
|
||||
//! See the [`Module`](./struct.Module.html) struct for details of publicly available functions.
|
||||
//!
|
||||
//! ## Usage
|
||||
//!
|
||||
//! ### Prerequisites
|
||||
//!
|
||||
//! Import the Randomness Collective Flip module and derive your module's configuration trait from
|
||||
//! the system trait.
|
||||
//!
|
||||
//! ### Example - Get random seed for the current block
|
||||
//!
|
||||
//! ```
|
||||
//! use support::{decl_module, dispatch::Result, traits::Randomness};
|
||||
//!
|
||||
//! pub trait Trait: system::Trait {}
|
||||
//!
|
||||
//! decl_module! {
|
||||
//! pub struct Module<T: Trait> for enum Call where origin: T::Origin {
|
||||
//! pub fn random_module_example(origin) -> Result {
|
||||
//! let _random_seed = <pallet_randomness_collective_flip::Module<T>>::random_seed();
|
||||
//! Ok(())
|
||||
//! }
|
||||
//! }
|
||||
//! }
|
||||
//! # fn main() { }
|
||||
//! ```
|
||||
|
||||
#![cfg_attr(not(feature = "std"), no_std)]
|
||||
|
||||
use rstd::{prelude::*, convert::TryInto};
|
||||
use sr_primitives::traits::Hash;
|
||||
use support::{decl_module, decl_storage, traits::Randomness};
|
||||
use safe_mix::TripletMix;
|
||||
use codec::Encode;
|
||||
use system::Trait;
|
||||
|
||||
const RANDOM_MATERIAL_LEN: u32 = 81;
|
||||
|
||||
fn block_number_to_index<T: Trait>(block_number: T::BlockNumber) -> usize {
|
||||
// on_initialize is called on the first block after genesis
|
||||
let index = (block_number - 1.into()) % RANDOM_MATERIAL_LEN.into();
|
||||
index.try_into().ok().expect("Something % 81 is always smaller than usize; qed")
|
||||
}
|
||||
|
||||
decl_module! {
|
||||
pub struct Module<T: Trait> for enum Call where origin: T::Origin {
|
||||
fn on_initialize(block_number: T::BlockNumber) {
|
||||
let parent_hash = <system::Module<T>>::parent_hash();
|
||||
|
||||
<RandomMaterial<T>>::mutate(|ref mut values| if values.len() < RANDOM_MATERIAL_LEN as usize {
|
||||
values.push(parent_hash)
|
||||
} else {
|
||||
let index = block_number_to_index::<T>(block_number);
|
||||
values[index] = parent_hash;
|
||||
});
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
decl_storage! {
|
||||
trait Store for Module<T: Trait> as RandomnessCollectiveFlip {
|
||||
/// Series of block headers from the last 81 blocks that acts as random seed material. This
|
||||
/// is arranged as a ring buffer with `block_number % 81` being the index into the `Vec` of
|
||||
/// the oldest hash.
|
||||
RandomMaterial get(fn random_material): Vec<T::Hash>;
|
||||
}
|
||||
}
|
||||
|
||||
impl<T: Trait> Randomness<T::Hash> for Module<T> {
|
||||
/// Get a low-influence "random" value.
|
||||
///
|
||||
/// Being a deterministic block chain, real randomness is difficult to come by. This gives you
|
||||
/// something that approximates it. `subject` is a context identifier and allows you to get a
|
||||
/// different result to other callers of this function; use it like
|
||||
/// `random(&b"my context"[..])`. This is initially implemented through a low-influence
|
||||
/// "triplet mix" convolution of previous block hash values. In the future it will be generated
|
||||
/// from a secure verifiable random function (VRF).
|
||||
///
|
||||
/// ### Security Notes
|
||||
///
|
||||
/// This randomness uses a low-influence function, drawing upon the block hashes from the
|
||||
/// previous 81 blocks. Its result for any given subject will be known far in advance by anyone
|
||||
/// observing the chain. Any block producer has significant influence over their block hashes
|
||||
/// bounded only by their computational resources. Our low-influence function reduces the actual
|
||||
/// block producer's influence over the randomness, but increases the influence of small
|
||||
/// colluding groups of recent block producers.
|
||||
///
|
||||
/// Some BABE blocks have VRF outputs where the block producer has exactly one bit of influence,
|
||||
/// either they make the block or they do not make the block and thus someone else makes the
|
||||
/// next block. Yet, this randomness is not fresh in all BABE blocks.
|
||||
///
|
||||
/// If that is an insufficient security guarantee then two things can be used to improve this
|
||||
/// randomness:
|
||||
///
|
||||
/// - Name, in advance, the block number whose random value will be used; ensure your module
|
||||
/// retains a buffer of previous random values for its subject and then index into these in
|
||||
/// order to obviate the ability of your user to look up the parent hash and choose when to
|
||||
/// transact based upon it.
|
||||
/// - Require your user to first commit to an additional value by first posting its hash.
|
||||
/// Require them to reveal the value to determine the final result, hashing it with the
|
||||
/// output of this random function. This reduces the ability of a cabal of block producers
|
||||
/// from conspiring against individuals.
|
||||
///
|
||||
/// WARNING: Hashing the result of this function will remove any low-influence properties it has
|
||||
/// and mean that all bits of the resulting value are entirely manipulatable by the author of
|
||||
/// the parent block, who can determine the value of `parent_hash`.
|
||||
fn random(subject: &[u8]) -> T::Hash {
|
||||
let block_number = <system::Module<T>>::block_number();
|
||||
let index = block_number_to_index::<T>(block_number);
|
||||
|
||||
let hash_series = <RandomMaterial<T>>::get();
|
||||
if !hash_series.is_empty() {
|
||||
// Always the case after block 1 is initialised.
|
||||
hash_series.iter()
|
||||
.cycle()
|
||||
.skip(index)
|
||||
.take(RANDOM_MATERIAL_LEN as usize)
|
||||
.enumerate()
|
||||
.map(|(i, h)| (i as i8, subject, h).using_encoded(T::Hashing::hash))
|
||||
.triplet_mix()
|
||||
} else {
|
||||
T::Hash::default()
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#[cfg(test)]
|
||||
mod tests {
|
||||
use super::*;
|
||||
use primitives::H256;
|
||||
use sr_primitives::{
|
||||
Perbill, traits::{BlakeTwo256, OnInitialize, Header as _, IdentityLookup}, testing::Header,
|
||||
};
|
||||
use support::{impl_outer_origin, parameter_types, traits::Randomness};
|
||||
|
||||
#[derive(Clone, PartialEq, Eq)]
|
||||
pub struct Test;
|
||||
|
||||
impl_outer_origin! {
|
||||
pub enum Origin for Test {}
|
||||
}
|
||||
|
||||
parameter_types! {
|
||||
pub const BlockHashCount: u64 = 250;
|
||||
pub const MaximumBlockWeight: u32 = 1024;
|
||||
pub const MaximumBlockLength: u32 = 2 * 1024;
|
||||
pub const AvailableBlockRatio: Perbill = Perbill::one();
|
||||
}
|
||||
|
||||
impl system::Trait for Test {
|
||||
type Origin = Origin;
|
||||
type Index = u64;
|
||||
type BlockNumber = u64;
|
||||
type Call = ();
|
||||
type Hash = H256;
|
||||
type Hashing = BlakeTwo256;
|
||||
type AccountId = u64;
|
||||
type Lookup = IdentityLookup<Self::AccountId>;
|
||||
type Header = Header;
|
||||
type Event = ();
|
||||
type BlockHashCount = BlockHashCount;
|
||||
type MaximumBlockWeight = MaximumBlockWeight;
|
||||
type AvailableBlockRatio = AvailableBlockRatio;
|
||||
type MaximumBlockLength = MaximumBlockLength;
|
||||
type Version = ();
|
||||
}
|
||||
|
||||
type System = system::Module<Test>;
|
||||
type CollectiveFlip = Module<Test>;
|
||||
|
||||
fn new_test_ext() -> runtime_io::TestExternalities {
|
||||
let t = system::GenesisConfig::default().build_storage::<Test>().unwrap();
|
||||
t.into()
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn test_block_number_to_index() {
|
||||
for i in 1 .. 1000 {
|
||||
assert_eq!((i - 1) as usize % 81, block_number_to_index::<Test>(i));
|
||||
}
|
||||
}
|
||||
|
||||
fn setup_blocks(blocks: u64) {
|
||||
let mut parent_hash = System::parent_hash();
|
||||
|
||||
for i in 1 .. (blocks + 1) {
|
||||
System::initialize(&i, &parent_hash, &Default::default(), &Default::default());
|
||||
CollectiveFlip::on_initialize(i);
|
||||
|
||||
let header = System::finalize();
|
||||
parent_hash = header.hash();
|
||||
System::set_block_number(*header.number());
|
||||
}
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn test_random_material_parital() {
|
||||
new_test_ext().execute_with(|| {
|
||||
let genesis_hash = System::parent_hash();
|
||||
|
||||
setup_blocks(38);
|
||||
|
||||
let random_material = CollectiveFlip::random_material();
|
||||
|
||||
assert_eq!(random_material.len(), 38);
|
||||
assert_eq!(random_material[0], genesis_hash);
|
||||
});
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn test_random_material_filled() {
|
||||
new_test_ext().execute_with(|| {
|
||||
let genesis_hash = System::parent_hash();
|
||||
|
||||
setup_blocks(81);
|
||||
|
||||
let random_material = CollectiveFlip::random_material();
|
||||
|
||||
assert_eq!(random_material.len(), 81);
|
||||
assert_ne!(random_material[0], random_material[1]);
|
||||
assert_eq!(random_material[0], genesis_hash);
|
||||
});
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn test_random_material_filled_twice() {
|
||||
new_test_ext().execute_with(|| {
|
||||
let genesis_hash = System::parent_hash();
|
||||
|
||||
setup_blocks(162);
|
||||
|
||||
let random_material = CollectiveFlip::random_material();
|
||||
|
||||
assert_eq!(random_material.len(), 81);
|
||||
assert_ne!(random_material[0], random_material[1]);
|
||||
assert_ne!(random_material[0], genesis_hash);
|
||||
});
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn test_random() {
|
||||
new_test_ext().execute_with(|| {
|
||||
setup_blocks(162);
|
||||
|
||||
assert_eq!(System::block_number(), 162);
|
||||
assert_eq!(CollectiveFlip::random_seed(), CollectiveFlip::random_seed());
|
||||
assert_ne!(CollectiveFlip::random(b"random_1"), CollectiveFlip::random(b"random_2"));
|
||||
|
||||
let random = CollectiveFlip::random_seed();
|
||||
|
||||
assert_ne!(random, H256::zero());
|
||||
assert!(!CollectiveFlip::random_material().contains(&random));
|
||||
});
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user