Optional
currThe current code being used for the challenge. Used behind the scenes
True if the leaves are hashed. Hash(preimage[i]) = leaves[i]
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
Example
Example