mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-08-05 12:35:41 +00:00
Robert Habermeier
be5ff4e62f
* dynamic inclusion threshold calculator * collators interface * collation helpers * initial proposal-creation future * create proposer when asked to propose * remove local_availability duty * statement table tracks includable parachain count * beginnings of timing future * finish proposal logic * remove stray println * extract shared table to separate module * change ordering * includability tracking * fix doc * initial changes to parachains module * initialise dummy block before API calls * give polkadot control over round proposer based on random seed * propose only after enough candidates * flesh out parachains module a bit more * set_heads * actually introduce set_heads to runtime * update block_builder to accept parachains * split block validity errors from real errors in evaluation * update WASM runtimes * polkadot-api methods for parachains additions * delay evaluation until candidates are ready * comments * fix dynamic inclusion with zero initial * test for includability tracker * wasm validation of parachain candidates * move primitives to primitives crate * remove runtime-std dependency from codec * adjust doc * polkadot-parachain-primitives * kill legacy polkadot-validator crate * basic-add test chain * test for basic_add parachain * move to test-chains dir * use wasm-build * new wasm directory layout * reorganize a bit more * Fix for rh-minimal-parachain (#141) * Remove extern "C" We already encountered such behavior (bug?) in pwasm-std, I believe. * Fix `panic_fmt` signature by adding `_col` Wrong `panic_fmt` signature can inhibit some optimizations in LTO mode. * Add linker flags and use wasm-gc in build script Pass --import-memory to LLD to emit wasm binary with imported memory. Also use wasm-gc instead of wasm-build. * Fix effective_max. I'm not sure why it was the way it was actually. * Recompile wasm. * Fix indent * more basic_add tests * validate parachain WASM * produce statements on receiving statements * tests for reactive statement production * fix build * add OOM lang item to runtime-io * use dynamic_inclusion when evaluating as well * fix update_includable_count * remove dead code * grumbles * actually defer round_proposer logic * update wasm * address a few more grumbles * schedule collation work as soon as BFT is started * impl future in collator * fix comment * governance proposals for adding and removing parachains * bump protocol version * tear out polkadot-specific pieces of substrate-network * extract out polkadot-specific stuff from substrate-network * begin polkadot network subsystem * grumbles * update WASM checkins * parse status from polkadot peer * allow invoke of network specialization * begin statement router implementation * remove dependency on tokio-timer * fix sanity check and have proposer factory create communication streams * pull out statement routing from consensus library * fix comments * adjust typedefs * extract consensus_gossip out of main network protocol handler * port substrate-bft to new tokio * port polkadot-consensus to new tokio * fix typo * start message processing task * initial consensus network implementation * remove known tracking from statement-table crate * extract router into separate module * defer statements until later * double signature is invalid * propagating statements * grumbles * request block data * fix compilation * embed new consensus network into service * port demo CLI to tokio * all test crates compile * some tests for fetching block data * whitespace * adjusting some tokio stuff * update exit-future * remove overly noisy warning * clean up collation work a bit * address review grumbles * fix lock order in protocol handler * rebuild wasm artifacts * tag AuthorityId::from_slice for std only * address formatting grumbles * rename event_loop to executor * some more docs for polkadot-network crate
90 lines
2.8 KiB
Rust
90 lines
2.8 KiB
Rust
// You should have received a copy of the GNU General Public License
|
|
// along with Polkadot. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
//! The statement table.
|
|
//!
|
|
//! This stores messages other authorities issue about candidates.
|
|
//!
|
|
//! These messages are used to create a proposal submitted to a BFT consensus process.
|
|
//!
|
|
//! Proposals are formed of sets of candidates which have the requisite number of
|
|
//! validity and availability votes.
|
|
//!
|
|
//! Each parachain is associated with two sets of authorities: those which can
|
|
//! propose and attest to validity of candidates, and those who can only attest
|
|
//! to availability.
|
|
|
|
extern crate substrate_codec as codec;
|
|
extern crate substrate_primitives;
|
|
extern crate polkadot_primitives as primitives;
|
|
|
|
extern crate serde;
|
|
#[macro_use]
|
|
extern crate serde_derive;
|
|
|
|
pub mod generic;
|
|
|
|
pub use generic::Table;
|
|
|
|
use primitives::parachain::{Id, CandidateReceipt, CandidateSignature as Signature};
|
|
use primitives::{SessionKey, Hash};
|
|
|
|
/// Statements about candidates on the network.
|
|
pub type Statement = generic::Statement<CandidateReceipt, Hash>;
|
|
|
|
/// Signed statements about candidates.
|
|
pub type SignedStatement = generic::SignedStatement<CandidateReceipt, Hash, SessionKey, Signature>;
|
|
|
|
/// Kinds of misbehavior, along with proof.
|
|
pub type Misbehavior = generic::Misbehavior<CandidateReceipt, Hash, SessionKey, Signature>;
|
|
|
|
/// A summary of import of a statement.
|
|
pub type Summary = generic::Summary<Hash, Id>;
|
|
|
|
/// Context necessary to construct a table.
|
|
pub trait Context {
|
|
/// Whether a authority is a member of a group.
|
|
/// Members are meant to submit candidates and vote on validity.
|
|
fn is_member_of(&self, authority: &SessionKey, group: &Id) -> bool;
|
|
|
|
/// Whether a authority is an availability guarantor of a group.
|
|
/// Guarantors are meant to vote on availability for candidates submitted
|
|
/// in a group.
|
|
fn is_availability_guarantor_of(
|
|
&self,
|
|
authority: &SessionKey,
|
|
group: &Id,
|
|
) -> bool;
|
|
|
|
// requisite number of votes for validity and availability respectively from a group.
|
|
fn requisite_votes(&self, group: &Id) -> (usize, usize);
|
|
}
|
|
|
|
impl<C: Context> generic::Context for C {
|
|
type AuthorityId = SessionKey;
|
|
type Digest = Hash;
|
|
type GroupId = Id;
|
|
type Signature = Signature;
|
|
type Candidate = CandidateReceipt;
|
|
|
|
fn candidate_digest(candidate: &CandidateReceipt) -> Hash {
|
|
candidate.hash()
|
|
}
|
|
|
|
fn candidate_group(candidate: &CandidateReceipt) -> Id {
|
|
candidate.parachain_index.clone()
|
|
}
|
|
|
|
fn is_member_of(&self, authority: &SessionKey, group: &Id) -> bool {
|
|
Context::is_member_of(self, authority, group)
|
|
}
|
|
|
|
fn is_availability_guarantor_of(&self, authority: &SessionKey, group: &Id) -> bool {
|
|
Context::is_availability_guarantor_of(self, authority, group)
|
|
}
|
|
|
|
fn requisite_votes(&self, group: &Id) -> (usize, usize) {
|
|
Context::requisite_votes(self, group)
|
|
}
|
|
}
|