package primitives

Get desktop application:
View/edit binary Protocol Buffers messages

Used in: rpc.AccountVaultDetails, rpc.AccountVaultUpdate

• optional Digest key = 1

  Asset vault key represented as a word.

• optional Digest value = 2

  Asset value represented as a word.

A hash digest, the result of a hash function.

Used in: account.AccountHeader, account.AccountStorageHeader.StorageSlot, account.AccountSummary, account.AccountWitness, blockchain.BlockHeader, blockchain.SignBlockResponse, note.NoteHeader, note.NoteId, note.NoteMetadata, note.NoteScriptRoot, note.NoteSyncAttachment, Asset, IndexedDigest, MerklePath, MmrDelta, PartialSmt, PartialSmtNode, SmtLeafEntry, SparseMerklePath, rpc.AccountRequest.AccountDetailRequest, rpc.AccountRequest.AccountDetailRequest.StorageMapDetailRequest.MapKeys, rpc.AccountStorageDetails.AccountStorageMapDetails.AllMapEntries.StorageMapEntry, rpc.AccountStorageDetails.AccountStorageMapDetails.PartialStorageMap, rpc.AccountVaultUpdate, rpc.ConsumedNoteRef, rpc.RpcStatus, rpc.StorageMapUpdate, rpc.SyncNullifiersResponse.NullifierUpdate, sequencer.AuthInputs, sequencer.AuthenticatedTransaction, sequencer.NullifierRecord, transaction.InputNoteCommitment, transaction.TransactionHeader, transaction.TransactionId

• fixed64 d0 = 1

• fixed64 d1 = 2

• fixed64 d2 = 3

• fixed64 d3 = 4

A digest together with its SMT leaf index.

Used in: PartialSmt

• fixed64 index = 1

• optional Digest value = 2

A fully materialized SMT leaf together with its index.

Used in: PartialSmt

• fixed64 index = 1

• optional SmtLeaf leaf = 2

Represents a Merkle path.

Used in: rpc.BlockHeaderByNumberResponse, rpc.SyncNotesResponse.NoteSyncBlock

• repeated Digest siblings = 1

  List of sibling node hashes, in order from the root to the leaf.

Represents an MMR delta.

Used in: rpc.SyncChainMmrResponse

• uint64 forest = 1

  The number of leaf nodes in the MMR.

• repeated Digest data = 2

  New and changed MMR peaks.

A compact representation of a partial SMT containing the nodes needed to reconstruct the tracked openings.

Used in: rpc.AccountStorageDetails.AccountStorageMapDetails.PartialStorageMap

• optional Digest root = 1

  The root expected after reconstruction.

• repeated PartialSmtNodeLevel node_levels = 2

  Boundary nodes needed to reconstruct intermediate nodes, grouped by depth.

• repeated IndexedSmtLeaf leaves = 3

  Fully materialized, non-empty leaves.

• repeated IndexedDigest value_only_leaves = 4

  Leaves for which only the hash is known.

A boundary node needed to reconstruct a partial SMT.

Used in: PartialSmtNodeLevel

• fixed64 index = 1

  Position of the node within its depth.

• oneof value

  • Digest digest = 2

    Hash of a non-empty boundary node.

  • bool empty_subtree_root = 3

    Indicates the canonical empty subtree root for the containing depth.

Partial SMT boundary nodes at a single depth.

Used in: PartialSmt

• uint32 depth = 1

  Depth of all nodes in this group.

• repeated PartialSmtNode nodes = 2

  Boundary nodes at this depth.

A leaf in an SMT, sitting at depth 64. A leaf can contain 0, 1 or multiple leaf entries.

Used in: IndexedSmtLeaf, SmtOpening

• oneof leaf

  • uint64 empty_leaf_index = 1

    An empty leaf index.

  • SmtLeafEntry single = 2

    A single leaf entry.

  • SmtLeafEntryList multiple = 3

    Multiple leaf entries.

Represents a single SMT leaf entry.

Used in: SmtLeaf, SmtLeafEntryList

• optional Digest key = 1

  The key of the entry.

• optional Digest value = 2

  The value of the entry.

Multiple leaf entries when hash collisions occur at the same leaf position.

Used in: SmtLeaf

• repeated SmtLeafEntry entries = 1

  The list of entries at this leaf.

The opening of a leaf in an SMT.

• optional SparseMerklePath path = 1

  The Merkle path to the leaf.

• optional SmtLeaf leaf = 2

  The leaf itself.

A different representation of a Merkle path designed for memory efficiency.

Used in: account.AccountWitness, note.NoteInclusionInBlockProof, SmtOpening

• fixed64 empty_nodes_mask = 1

  A bitmask representing empty nodes. The set bit corresponds to the depth of an empty node. The least significant bit (bit 0) describes depth 1 node (root's children). The `bit index + 1` is equal to node's depth.

• repeated Digest siblings = 2

  The non-empty nodes, stored in depth-order, but not contiguous across depth.