bitbadgesjs-sdk - v0.22.7
    Preparing search index...

    Class ChallengeDetails<T>

    Type Parameters

    Hierarchy (View Summary)

    Implements

    Index

    Constructors

    Properties

    isHashed: boolean

    True if the leaves are hashed. Hash(preimage[i]) = leaves[i]

    leaves: string[]

    The leaves of the Merkle tree. Leaves should be considered public. Use preimages for the private codes + isHashed. For whitelist trees, these can be the plaintext BitBadges addresses.

    numLeaves?: T

    The number of leaves in the Merkle tree. This takes priority over leaves.length if defined (used for buffer time between leaf generation and leaf length select)

    preimages?: string[]

    The preimages of the leaves (only used if isHashed = true). Oftentimes, this is used for private codes so should not be present when user-facing.

    seedCode?: string

    Seed code for generating the leaves

    tree?: MerkleTree

    The Merkle tree

    treeOptions?: Options

    The Merkle tree options for how to build it

    Methods