DID BTCR2 JS

Appearance

Interface: SMTProof ​

Defined in: packages/method/src/core/interfaces.ts:80

SMT Proof a set of SHA-256 hashes for nodes in a Sparse Merkle Tree that together form a path from a leaf in the tree to the Merkle root, proving that the leaf is in the tree. See SMT Proof (data structure).

Example ​

json
{
  "id": "<< Hexadecimal of Root Hash >>",
  "nonce": "<< Hexadecimal of Nonce 1101 >>",
  "updateId": "<< Hexadecimal of hash(Data Block 1101) >>",
  "collapsed": "<< Hexadecimal of 0001 >>",
  "hashes": [
    "<< Hexadecimal of Hash 1110 >>",
    "<< Hexadecimal of Hash 1001 >>",
    "<< Hexadecimal of Hash 0 >>"
  ]
}

Properties ​

collapsed ​

collapsed: string

Defined in: packages/method/src/core/interfaces.ts:96

Bitmap of zero nodes within the path (see: collapsed leaves).

hashes ​

hashes: string[]

Defined in: packages/method/src/core/interfaces.ts:100

Array of SHA-256 hashes representing the sibling SMT nodes from the leaf, containing the SHA-256 hash of the BTCR2 Signed Update or the “zero identity”, to the root.

id ​

id: string

Defined in: packages/method/src/core/interfaces.ts:84

The SHA-256 hash of the root node of the Sparse Merkle Tree.

nonce? ​

optional nonce: string

Defined in: packages/method/src/core/interfaces.ts:88

Optional 256-bit nonce generated for each update. MUST be encoded as a string using the "base64url" [RFC4648] encoding.

updateId? ​

optional updateId: string

Defined in: packages/method/src/core/interfaces.ts:92

Optional BTCR2 Signed Update (data structure) hashed with the JSON Document Hashing algorithm.