Struct IntentTree 

pub struct IntentTree { /* private fields */ }

A Merkle tree over a set of authorized intent hashes.

The root commits to the full intent set without revealing its members. Leaves are sorted and deduplicated, so the root is deterministic regardless of insertion order.

Implementations

impl IntentTree

pub fn build(intents: Vec<IntentHash>) -> Result<Self, A1Error>

Build a tree from a set of intent hashes. Returns A1Error::EmptyTree if intents is empty.

pub fn root(&self) -> IntentHash

The Merkle root — the canonical commitment to this intent set.

pub fn prove(&self, intent: &IntentHash) -> Result<MerkleProof, A1Error>

Generate an inclusion proof for intent. Returns A1Error::IntentNotFound if the intent is not in this tree.

pub fn contains(&self, intent: &IntentHash) -> bool

pub fn leaf_count(&self) -> usize