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.
Optional
numThe 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)
Optional
preimagesThe preimages of the leaves (only used if isHashed = true). Oftentimes, this is used for private codes so should not be present when user-facing.
Optional
seedSeed code for generating the leaves
Optional
treeThe Merkle tree
Optional
treeThe Merkle tree options for how to build it
Deep copies the object and returns a new instance.
Converts the object to a different NumberType equivalent.
Compares this object's fields to another object's fields for equality. Equality is determined by comparing the JSON representations of the objects.
If normalizeNumberTypes
is true, then all number types will be compared as strings (i.e. "1n" === "1" === 1). Else, they will be compared as their native types (i.e. 1n !== 1 !== "1").
Optional
normalizeNumberTypes: boolean
True if the leaves are hashed. Hash(preimage[i]) = leaves[i]