Struct DidInfo

pub struct DidInfo<M> {
    pub launcher_id: Bytes32,
    pub recovery_list_hash: Option<Bytes32>,
    pub num_verifications_required: u64,
    pub metadata: M,
    pub p2_puzzle_hash: Bytes32,
}

Information needed to construct the outer puzzle of a DID. It does not include the inner puzzle, which must be stored separately.

This type can be used on its own for parsing, or as part of the Did primitive.

Fields

launcher_id: Bytes32

The coin id of the launcher coin that created this DID’s singleton.

recovery_list_hash: Option<Bytes32>

The hash of the recovery list. This is a very infrequently used feature and is not fully supported at this time.

In the Chia reference wallet, the recovery list hash must be present even if recovery is disabled. However, in some other wallets it’s allowed to be None. This is an on-chain cost optimization and simplification.

num_verifications_required: u64

The number of verifications required to recover the DID.

metadata: M

The metadata stored in the DidLayer. This can be updated freely, but must be confirmed by an additional update spend to ensure wallets can sync it from the parent coin.

p2_puzzle_hash: Bytes32

The hash of the inner puzzle to this DID. If you encode this puzzle hash as bech32m, it’s the same as the current owner’s address.

Implementations

impl<M> DidInfo<M>

pub fn new( launcher_id: Bytes32, recovery_list_hash: Option<Bytes32>, num_verifications_required: u64, metadata: M, p2_puzzle_hash: Bytes32, ) -> Self

pub fn with_metadata<N>(self, metadata: N) -> DidInfo<N>

pub fn parse( allocator: &Allocator, puzzle: Puzzle, ) -> Result<Option<(Self, Puzzle)>, DriverError>

where M: ToClvm<Allocator> + FromClvm<Allocator>,

Parses a DidInfo from a Puzzle by extracting the DidLayer.

This will return a tuple of the DidInfo and its p2 puzzle.

If the puzzle is not a DID, this will return None instead of an error. However, if the puzzle should have been a DID but had a parsing error, this will return an error.

pub fn from_layers<I>(layers: StandardDidLayers<M, I>) -> Self

where I: ToTreeHash,

pub fn into_layers<I>(self, p2_puzzle: I) -> StandardDidLayers<M, I>

pub fn inner_puzzle_hash(&self) -> TreeHash

where M: ToTreeHash,

Calculates the inner puzzle hash of the DID singleton.

This includes the DidLayer, but not the SingletonLayer.

pub fn puzzle_hash(&self) -> TreeHash

where M: ToTreeHash,

Calculates the full puzzle hash of the DID, which is the hash of the outer SingletonLayer.

Trait Implementations

impl<M: Clone> Clone for DidInfo<M>

fn clone(&self) -> DidInfo<M>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<M: Debug> Debug for DidInfo<M>

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

Formats the value using the given formatter.

impl<M: PartialEq> PartialEq for DidInfo<M>

fn eq(&self, other: &DidInfo<M>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<M: Copy> Copy for DidInfo<M>

impl<M: Eq> Eq for DidInfo<M>

impl<M> StructuralPartialEq for DidInfo<M>