pub enum TreeScheme {
V3Flat,
V4Salted,
}Expand description
How a Tree’s content id is computed. The scheme is part of the
in-memory value, so Tree::hash() is a pure function of (scheme, salts, entries) and the value determines the id at every call site (MF-4).
Variants§
V3Flat
Flat BLAKE3 over the concatenated entry preimages (the historical hash).
V4Salted
Salted binary Merkle tree over per-entry leaf commitments, redactable at entry granularity. Carries a parallel 32-byte salt per entry.
Trait Implementations§
Source§impl Clone for TreeScheme
impl Clone for TreeScheme
Source§fn clone(&self) -> TreeScheme
fn clone(&self) -> TreeScheme
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreimpl Copy for TreeScheme
Source§impl Debug for TreeScheme
impl Debug for TreeScheme
impl Eq for TreeScheme
Source§impl PartialEq for TreeScheme
impl PartialEq for TreeScheme
impl StructuralPartialEq for TreeScheme
Auto Trait Implementations§
impl Freeze for TreeScheme
impl RefUnwindSafe for TreeScheme
impl Send for TreeScheme
impl Sync for TreeScheme
impl Unpin for TreeScheme
impl UnsafeUnpin for TreeScheme
impl UnwindSafe for TreeScheme
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more