Struct akd::append_only_zks::Azks

source ·
pub struct Azks {
    pub latest_epoch: u64,
    pub num_nodes: u64,
}
Expand description

An append-only zero knowledge set, the data structure used to efficiently implement a auditable key directory.

Fields§

§latest_epoch: u64

The latest complete epoch

§num_nodes: u64

The number of nodes is the total size of this tree

Implementations§

source§

impl Azks

source

pub async fn new<TC: Configuration, S: Database>( storage: &StorageManager<S> ) -> Result<Self, AkdError>

Creates a new azks

source

pub async fn batch_insert_nodes<TC: Configuration, S: Database + 'static>( &mut self, storage: &StorageManager<S>, nodes: Vec<AzksElement>, insert_mode: InsertMode ) -> Result<(), AkdError>

Insert a batch of new leaves.

source

pub async fn get_membership_proof<TC: Configuration, S: Database>( &self, storage: &StorageManager<S>, label: NodeLabel ) -> Result<MembershipProof, AkdError>

Returns the Merkle membership proof for the trie as it stood at epoch

source

pub async fn get_non_membership_proof<TC: Configuration, S: Database>( &self, storage: &StorageManager<S>, label: NodeLabel ) -> Result<NonMembershipProof, AkdError>

In a compressed trie, the proof consists of the longest prefix of the label that is included in the trie, as well as its children, to show that none of the children is equal to the given label.

source

pub async fn get_append_only_proof<TC: Configuration, S: Database + 'static>( &self, storage: &StorageManager<S>, start_epoch: u64, end_epoch: u64 ) -> Result<AppendOnlyProof, AkdError>

An append-only proof for going from start_epoch to end_epoch consists of roots of subtrees the azks tree that remain unchanged from start_epoch to end_epoch and the leaves inserted into the tree after start_epoch and up until end_epoch. If there is no errors, this function returns an Ok result, containing the append-only proof and otherwise, it returns an AkdError.

RESTRICTIONS: Note that start_epoch and end_epoch are valid only when the following are true

  • start_epoch <= end_epoch
  • start_epoch and end_epoch are both existing epochs of this AZKS
source

pub async fn get_root_hash<TC: Configuration, S: Database>( &self, storage: &StorageManager<S> ) -> Result<Digest, AkdError>

Gets the root hash for this azks

source

pub fn get_latest_epoch(&self) -> u64

Gets the latest epoch of this azks. If an update aka epoch transition is in progress, this should return the most recent completed epoch.

Trait Implementations§

source§

impl Clone for Azks

source§

fn clone(&self) -> Azks

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl Debug for Azks

source§

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

Formats the value using the given formatter. Read more
source§

impl Hash for Azks

source§

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher. Read more
1.3.0 · source§

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
source§

impl Ord for Azks

source§

fn cmp(&self, other: &Azks) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · source§

fn max(self, other: Self) -> Self
where Self: Sized,

Compares and returns the maximum of two values. Read more
1.21.0 · source§

fn min(self, other: Self) -> Self
where Self: Sized,

Compares and returns the minimum of two values. Read more
1.50.0 · source§

fn clamp(self, min: Self, max: Self) -> Self
where Self: Sized + PartialOrd,

Restrict a value to a certain interval. Read more
source§

impl PartialEq for Azks

source§

fn eq(&self, other: &Azks) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl PartialOrd for Azks

source§

fn partial_cmp(&self, other: &Azks) -> Option<Ordering>

This method returns an ordering between self and other values if one exists. Read more
1.0.0 · source§

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · source§

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator. Read more
1.0.0 · source§

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 · source§

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator. Read more
source§

impl SizeOf for Azks

source§

fn size_of(&self) -> usize

Retrieve the in-memory size of a structure
source§

impl Storable for Azks

§

type StorageKey = u8

This particular storage will have a key type
source§

fn data_type() -> StorageType

Must return a valid storage type
source§

fn get_id(&self) -> u8

Retrieve an instance of the id of this storable. The combination of the storable’s StorageType and this id are globally unique
source§

fn get_full_binary_key_id(key: &u8) -> Vec<u8>

Retrieve the full binary version of a key (for comparisons)
source§

fn key_from_full_binary(bin: &[u8]) -> Result<u8, String>

Reformat a key from the full-binary specification
source§

fn get_full_binary_id(&self) -> Vec<u8>

Retrieve the full binary version of a key (for comparisons)
source§

impl Eq for Azks

source§

impl StructuralPartialEq for Azks

source§

impl Sync for Azks

Auto Trait Implementations§

§

impl Freeze for Azks

§

impl RefUnwindSafe for Azks

§

impl Send for Azks

§

impl Unpin for Azks

§

impl UnwindSafe for Azks

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> Same for T

§

type Output = T

Should always be Self
source§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.