Struct Rotation 

pub struct Rotation {
    pub rotator: PublicKey,
    pub scope: RekeyScope,
    pub new_epoch: Epoch,
    pub prev_epoch: Epoch,
    pub prev_commit: [u8; 32],
    pub blobs: Vec<RekeyBlob>,
    pub declared_chunks: u32,
    pub held_chunks: BTreeSet<u32>,
}

A collected rotation: all chunks sharing one correlation key, and whether the set is complete (all n chunks present).

Fields

rotator: PublicKey

scope: RekeyScope

new_epoch: Epoch

prev_epoch: Epoch

prev_commit: [u8; 32]

blobs: Vec<RekeyBlob>

The union of every chunk’s blobs.

declared_chunks: u32

Total chunk count n declared by the chunks.

held_chunks: BTreeSet<u32>

Distinct chunk indices actually held.

Implementations

impl Rotation

pub fn is_complete(&self) -> bool

True once every declared chunk index 1..=n is held — the precondition for concluding removal (a missing chunk is “keep recovering”, never a removal).

pub fn continuity(&self, held_epoch: Epoch, held_key: &[u8; 32]) -> Continuity

This rotation’s continuity against the (epoch, key) I hold for its scope — the check_continuity verdict at the aggregated-rotation level (same prevcommit test), so a follower can gate adoption without a raw chunk.

Trait Implementations

impl Clone for Rotation

fn clone(&self) -> Rotation

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Rotation

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

Formats the value using the given formatter.