Yes, it uses kind 30078 events with tags:
d Tree name (replaceable event key)
l "hashtree" label for discovery
hash Merkle root SHA256 (64 hex chars)
key Decryption key (public trees)
encryptedKey XOR'd key (link-visible trees)
selfEncryptedKey NIP-44 encrypted (private/link-visible)
Login to reply
Replies (1)
And the merkle root is of a tree of equally-size blobs?
I ask because that might make it easy to skip to the relevant part of the video. Do we know the depth of the tree?
Although, I guess you have this size (and runtime?) metadata somewhere in the nodes of the tree?