Struct BuiltCommitment 

pub struct BuiltCommitment { /* private fields */ }

A fully-built commitment: signed wire blob, cached hash, Merkle tree for inclusion proofs, and a sorted leaf-index lookup for the auditor’s leaf_index field.

Held inside an Arc so audit responders can grab a reference and build a reply without holding the ResponderCommitmentState read lock for the duration of the response.

Implementations

impl BuiltCommitment

pub fn build( entries: Vec<(XorName, [u8; 32])>, sender_peer_id: &[u8; 32], secret_key: &MlDsaSecretKey, sender_public_key: &[u8], ) -> Result<Self, CommitmentError>

Build a commitment over entries = [(key, bytes_hash), ...] and sign it with secret_key.

entries does not need to be sorted (the inner MerkleTree sorts internally); sender_peer_id is bound into the signature and the commitment.

Errors

Returns the wrapped CommitmentError on empty key sets, over-cap key counts, duplicates, or signing failures.

pub fn build_from_tree( tree: MerkleTree, sender_peer_id: &[u8; 32], secret_key: &MlDsaSecretKey, sender_public_key: &[u8], ) -> Result<Self, CommitmentError>

Sign and wrap an ALREADY-BUILT Merkle tree. Lets callers that already built the tree (e.g. the rotation no-op-root check, §11) avoid rebuilding it inside Self::build.

Errors

Propagates signing / serialization failures, identical to Self::build.

pub fn commitment(&self) -> &StorageCommitment

The signed wire blob.

pub fn hash(&self) -> [u8; 32]

The cached commitment hash. Equal to crate::replication::commitment::commitment_hash (self.commitment()).

pub fn tree(&self) -> &MerkleTree

The Merkle tree behind this commitment.

Used by the subtree-audit responder to plan a proof (select the nonce-determined branch and read its sibling cut-hashes).

pub fn proof_for(&self, key: &XorName) -> Option<(Vec<[u8; 32]>, u32)>

Inclusion path + leaf index for key, if it is in this commitment. Returns None if key is not committed.

pub fn contains_key(&self, key: &XorName) -> bool

Whether key is committed in this tree. Allocation-free membership check (binary search over the sorted leaf keys) — equivalent to proof_for(key).is_some() but without building the inclusion path, for hot callers (e.g. the pruner’s is_held veto) that only need the boolean.