Struct AvidMScheme

pub struct AvidMScheme;

Dummy struct for AVID-M scheme.

Implementations

impl AvidMScheme

pub fn proof_of_incorrect_encoding( param: &AvidMParam, commit: &AvidMCommit, shares: &[AvidMShare], ) -> Result<MalEncodingProof, VidError>

Generate a proof of incorrect encoding See MalEncodingProof for details.

impl AvidMScheme

pub fn setup( recovery_threshold: usize, total_weights: usize, ) -> Result<AvidMParam, VidError>

Setup an instance for AVID-M scheme

impl AvidMScheme

fn pad_to_fields( param: &AvidMParam, payload: &[u8], ) -> Vec<<Keccak256Config as AvidMConfig>::BaseField>

Helper function. Transform the payload bytes into a list of fields elements. This function also pads the bytes with a 1 in the end, following by many 0’s until the length of the output is a multiple of param.recovery_threshold.

fn raw_encode( param: &AvidMParam, payload: &[<Keccak256Config as AvidMConfig>::BaseField], ) -> Result<(<Keccak256Config as AvidMConfig>::MerkleTree, Vec<Vec<<Keccak256Config as AvidMConfig>::BaseField>>), VidError>

Helper function. Let k = recovery_threshold and n = total_weights. This function partition the payload into many chunks, each containing k field elements. Then each chunk is encoded into n field element with Reed Solomon erasure code. They are then re-organized as n vectors, each collecting one field element from each chunk. These n vectors are then Merklized for commitment and membership proof generation.

fn pad_and_encode( param: &AvidMParam, payload: &[u8], ) -> Result<(<Keccak256Config as AvidMConfig>::MerkleTree, Vec<Vec<<Keccak256Config as AvidMConfig>::BaseField>>), VidError>

Short hand for pad_to_field and raw_encode.

fn distribute_shares( param: &AvidMParam, distribution: &[u32], mt: <Keccak256Config as AvidMConfig>::MerkleTree, raw_shares: Vec<Vec<<Keccak256Config as AvidMConfig>::BaseField>>, payload_byte_len: usize, ) -> Result<(AvidMCommit, Vec<AvidMShare>), VidError>

Consume in the constructed Merkle tree and the raw shares from raw_encode, provide the AvidM commitment and shares.

pub(crate) fn verify_internal( param: &AvidMParam, commit: &AvidMCommit, share: &RawAvidMShare, ) -> Result<Result<(), ()>, VidError>

pub(crate) fn recover_fields( param: &AvidMParam, shares: &[AvidMShare], ) -> Result<Vec<<Keccak256Config as AvidMConfig>::BaseField>, VidError>

Trait Implementations

impl VidScheme for AvidMScheme

fn recover( param: &Self::Param, _commit: &Self::Commit, shares: &[Self::Share], ) -> Result<Vec<u8>, VidError>

Recover payload data from shares.

Requirements

• Total weight of all shares must be at least recovery_threshold.
• Each share’s payload must have equal length.
• All shares must be verified under the given commitment.

Shares beyond recovery_threshold are ignored.

type Param = AvidMParam

VID Parameters

type Share = AvidMShare

VID Share type

type Commit = AvidMCommit

VID commitment type

fn commit(param: &Self::Param, payload: &[u8]) -> Result<Self::Commit, VidError>

Commit to a payload without generating shares.

fn disperse( param: &Self::Param, distribution: &[u32], payload: &[u8], ) -> Result<(Self::Commit, Vec<Self::Share>), VidError>

Disperse the given payload according to the weights in distribution.

fn verify_share( param: &Self::Param, commit: &Self::Commit, share: &Self::Share, ) -> Result<Result<(), ()>, VidError>

Verify the given VID share against the VID commit.