* bump stable to 2.1.10 * RPC: parity_getBlockReceipts (#9527) * Block receipts RPC. * Use lazy evaluation of block receipts (ecrecover). * Optimize transaction_receipt to prevent performance regression. * Fix RPC grumbles. * Add block & transaction receipt tests. * Fix conversion to block id. * Update a few parity-common dependencies (#9663) * Update a few parity-common dependencies * cleanup * cleanup * revert update of ethereum/tests * better reporting of network rlp errors * Use rlp 0.3.0-beta.1 * fix util function get_dummy_blocks * Already a Vec * encode_list returns vec already * Address grumble * No need for betas * Fix double spaces * Fix empty steps (#9939) * Don't send empty step twice or empty step then block. * Perform basic validation of locally sealed blocks. * Don't include empty step twice. * Strict empty steps validation (#10041) * Add two failings tests for strict empty steps. * Implement strict validation of empty steps. * ethcore: enable constantinople on ethereum (#10031) * ethcore: change blockreward to 2e18 for foundation after constantinople * ethcore: delay diff bomb by 2e6 blocks for foundation after constantinople * ethcore: enable eip-{145,1014,1052,1283} for foundation after constantinople * Change test miner max memory to malloc reports. (#10024) * Bump crossbeam. (#10048) * Revert "Bump crossbeam. (#10048)" This reverts commit ed1db0c2d3d3b8e6bfde3124fb03b093a264e241.
116 lines
4.2 KiB
Rust
116 lines
4.2 KiB
Rust
// Copyright 2015-2018 Parity Technologies (UK) Ltd.
|
|
// This file is part of Parity.
|
|
|
|
// Parity 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.
|
|
|
|
// Parity 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 Parity. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
//! Authority params deserialization.
|
|
|
|
use hash::Address;
|
|
use uint::Uint;
|
|
use bytes::Bytes;
|
|
use super::ValidatorSet;
|
|
|
|
/// Authority params deserialization.
|
|
#[derive(Debug, PartialEq, Deserialize)]
|
|
pub struct AuthorityRoundParams {
|
|
/// Block duration, in seconds.
|
|
#[serde(rename="stepDuration")]
|
|
pub step_duration: Uint,
|
|
/// Valid authorities
|
|
pub validators: ValidatorSet,
|
|
/// Starting step. Determined automatically if not specified.
|
|
/// To be used for testing only.
|
|
#[serde(rename="startStep")]
|
|
pub start_step: Option<Uint>,
|
|
/// Block at which score validation should start.
|
|
#[serde(rename="validateScoreTransition")]
|
|
pub validate_score_transition: Option<Uint>,
|
|
/// Block from which monotonic steps start.
|
|
#[serde(rename="validateStepTransition")]
|
|
pub validate_step_transition: Option<Uint>,
|
|
/// Whether transitions should be immediate.
|
|
#[serde(rename="immediateTransitions")]
|
|
pub immediate_transitions: Option<bool>,
|
|
/// Reward per block in wei.
|
|
#[serde(rename="blockReward")]
|
|
pub block_reward: Option<Uint>,
|
|
/// Block at which the block reward contract should start being used.
|
|
#[serde(rename="blockRewardContractTransition")]
|
|
pub block_reward_contract_transition: Option<Uint>,
|
|
/// Block reward contract address (setting the block reward contract
|
|
/// overrides the static block reward definition).
|
|
#[serde(rename="blockRewardContractAddress")]
|
|
pub block_reward_contract_address: Option<Address>,
|
|
/// Block reward code. This overrides the block reward contract address.
|
|
#[serde(rename="blockRewardContractCode")]
|
|
pub block_reward_contract_code: Option<Bytes>,
|
|
/// Block at which maximum uncle count should be considered.
|
|
#[serde(rename="maximumUncleCountTransition")]
|
|
pub maximum_uncle_count_transition: Option<Uint>,
|
|
/// Maximum number of accepted uncles.
|
|
#[serde(rename="maximumUncleCount")]
|
|
pub maximum_uncle_count: Option<Uint>,
|
|
/// Block at which empty step messages should start.
|
|
#[serde(rename="emptyStepsTransition")]
|
|
pub empty_steps_transition: Option<Uint>,
|
|
/// Maximum number of accepted empty steps.
|
|
#[serde(rename="maximumEmptySteps")]
|
|
pub maximum_empty_steps: Option<Uint>,
|
|
/// Strict validation of empty steps transition block.
|
|
pub strict_empty_steps_transition: Option<Uint>,
|
|
}
|
|
|
|
/// Authority engine deserialization.
|
|
#[derive(Debug, PartialEq, Deserialize)]
|
|
pub struct AuthorityRound {
|
|
/// Ethash params.
|
|
pub params: AuthorityRoundParams,
|
|
}
|
|
|
|
#[cfg(test)]
|
|
mod tests {
|
|
use ethereum_types::{U256, H160};
|
|
use uint::Uint;
|
|
use serde_json;
|
|
use hash::Address;
|
|
use spec::validator_set::ValidatorSet;
|
|
use spec::authority_round::AuthorityRound;
|
|
|
|
#[test]
|
|
fn authority_round_deserialization() {
|
|
let s = r#"{
|
|
"params": {
|
|
"stepDuration": "0x02",
|
|
"validators": {
|
|
"list" : ["0xc6d9d2cd449a754c494264e1809c50e34d64562b"]
|
|
},
|
|
"startStep" : 24,
|
|
"validateStepTransition": 150,
|
|
"blockReward": 5000000,
|
|
"maximumUncleCountTransition": 10000000,
|
|
"maximumUncleCount": 5
|
|
}
|
|
}"#;
|
|
|
|
let deserialized: AuthorityRound = serde_json::from_str(s).unwrap();
|
|
assert_eq!(deserialized.params.step_duration, Uint(U256::from(0x02)));
|
|
assert_eq!(deserialized.params.validators, ValidatorSet::List(vec![Address(H160::from("0xc6d9d2cd449a754c494264e1809c50e34d64562b"))]));
|
|
assert_eq!(deserialized.params.start_step, Some(Uint(U256::from(24))));
|
|
assert_eq!(deserialized.params.immediate_transitions, None);
|
|
assert_eq!(deserialized.params.maximum_uncle_count_transition, Some(Uint(10_000_000.into())));
|
|
assert_eq!(deserialized.params.maximum_uncle_count, Some(Uint(5.into())));
|
|
|
|
}
|
|
}
|