Struct Proposal 

pub struct Proposal<T: NodeType> {
    pub block_header: T::BlockHeader,
    pub view_number: ViewNumber,
    pub epoch: EpochNumber,
    pub justify_qc: QuorumCertificate2<T>,
    pub next_epoch_justify_qc: Option<SimpleCertificate<T, Vote2Data<T>, SuccessThreshold>>,
    pub upgrade_certificate: Option<UpgradeCertificate2<T>>,
    pub view_change_evidence: Option<TimeoutEvidence<T>>,
    pub next_drb_result: Option<DrbResult>,
    pub state_cert: Option<LightClientStateUpdateCertificateV2<T>>,
}

Proposal to append a block.

Fields

block_header: T::BlockHeader

The block header to append

view_number: ViewNumber

view number for the proposal

epoch: EpochNumber

The epoch number corresponding to the block number.

justify_qc: QuorumCertificate2<T>

certificate that the proposal is chaining from

next_epoch_justify_qc: Option<SimpleCertificate<T, Vote2Data<T>, SuccessThreshold>>

certificate proving the last block of the epoch is decided

upgrade_certificate: Option<UpgradeCertificate2<T>>

Possible upgrade certificate, which the leader may optionally attach. It binds this proposal’s epoch; the Leaf2 carries it stripped of it.

view_change_evidence: Option<TimeoutEvidence<T>>

Possible timeout certificate.

If the justify_qc is not for a proposal in the immediately preceding view, then a timeout certificate must be attached.

next_drb_result: Option<DrbResult>

The DRB result for the next epoch.

This is required only for the last block of the epoch. Nodes will verify that it’s consistent with the result from their computations.

state_cert: Option<LightClientStateUpdateCertificateV2<T>>

The light client state update certificate for the next epoch. This is required for the epoch root.

Trait Implementations

impl<T: Clone + NodeType> Clone for Proposal<T>

where T::BlockHeader: Clone,

fn clone(&self) -> Proposal<T>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug + NodeType> Debug for Proposal<T>

where T::BlockHeader: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de, T: NodeType> Deserialize<'de> for Proposal<T>

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T: Eq + NodeType> Eq for Proposal<T>

where T::BlockHeader: Eq,

impl<T: NodeType> From<Proposal<T>> for QuorumProposalWrapper<T>

fn from(p: Proposal<T>) -> Self

Converts to this type from the input type.

impl<T: NodeType> From<Proposal<T>> for Leaf2<T>

fn from(p: Proposal<T>) -> Self

Converts to this type from the input type.

impl<T: NodeType> From<QuorumProposalWrapper<T>> for Proposal<T>

fn from(wrapper: QuorumProposalWrapper<T>) -> Self

Converts to this type from the input type.

impl<T: NodeType> HasEpoch for Proposal<T>

fn epoch(&self) -> Option<EpochNumber>

Returns Epoch

impl<T: NodeType> HasViewNumber for Proposal<T>

fn view_number(&self) -> ViewNumber

Returns the view number the type refers to.

impl<T: Hash + NodeType> Hash for Proposal<T>

where T::BlockHeader: Hash,

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T: PartialEq + NodeType> PartialEq for Proposal<T>

where T::BlockHeader: PartialEq,

fn eq(&self, other: &Proposal<T>) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl<T> Serialize for Proposal<T>

where T: Serialize + NodeType, T::BlockHeader: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T: PartialEq + NodeType> StructuralPartialEq for Proposal<T>

where T::BlockHeader: PartialEq,