Struct OperationSecretTree 

pub struct OperationSecretTree { /* private fields */ }

Available on crate feature extensions-draft and crate feature virtual-clients-draft and (32-bit or 64-bit) only.

Per-emulation-epoch Virtual Client Operation Secret Tree.

Rooted at the epoch’s epoch_base_secret and shaped like the emulation group’s ratchet tree at the corresponding epoch (sized by the leaf count, including blank leaves). Node secrets and per-leaf operation ratchets are derived lazily on first use, and consumed material is deleted as it is used (see the module documentation for the forward-secrecy rules).

Concurrency

One tree is shared by all higher-level groups the virtual client is a member of. Every derivation mutates it, so a load-derive-store cycle against the storage provider must be atomic per emulation epoch. Applications that process messages for multiple higher-level groups in parallel must serialize these cycles. Two concurrent cycles on separate copies of the tree can allocate the same generation for two different operations (the key reuse the draft forbids) and last-write-wins persistence loses the other copy’s punctured nodes and retained skipped generations.

Trait Implementations

impl Debug for OperationSecretTree

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for OperationSecretTree

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Entity<CURRENT_VERSION> for OperationSecretTree

impl Serialize for OperationSecretTree

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl VcOperationTree<CURRENT_VERSION> for OperationSecretTree