@hashtree/core 0.1.0

package/dist/tree/writeAt.js

@@ -0,0 +1,282 @@
+/**
+ * writeAt - Efficiently patch bytes at a specific offset without rewriting entire file
+ *
+ * Only affected chunks and their parent nodes are rewritten.
+ * For a large file with a small patch, this is much more efficient than putFile.
+ */
+import { LinkType, toHex } from '../types.js';
+import { sha256 } from '../hash.js';
+import { encodeAndHash, decodeTreeNode, tryDecodeTreeNode } from '../codec.js';
+import { encryptChk, decryptChk } from '../crypto.js';
+/**
+ * Write data at a specific offset in an unencrypted file
+ *
+ * @param config - Tree configuration
+ * @param rootHash - Current root hash of the file
+ * @param offset - Byte offset to write at
+ * @param data - Data to write
+ * @returns New root hash
+ */
+export async function writeAt(config, rootHash, offset, data) {
+    const { store } = config;
+    // Get root data
+    const rootData = await store.get(rootHash);
+    if (!rootData) {
+        throw new Error(`Root not found: ${toHex(rootHash)}`);
+    }
+    // Check if it's a tree node or single blob
+    const node = tryDecodeTreeNode(rootData);
+    if (!node) {
+        // Single blob - modify in place
+        if (offset + data.length > rootData.length) {
+            throw new Error(`Write extends beyond file: offset=${offset}, data=${data.length}, file=${rootData.length}`);
+        }
+        const newData = new Uint8Array(rootData);
+        newData.set(data, offset);
+        const newHash = await sha256(newData);
+        await store.put(newHash, newData);
+        return { hash: newHash, size: newData.length };
+    }
+    // Multi-chunk file - find and modify affected chunks
+    const totalSize = node.links.reduce((sum, l) => sum + l.size, 0);
+    if (offset + data.length > totalSize) {
+        throw new Error(`Write extends beyond file: offset=${offset}, data=${data.length}, file=${totalSize}`);
+    }
+    const newLinks = await writeAtInNode(config, node, offset, data);
+    // Rebuild tree with new links
+    const newRootHash = await buildTreeFromLinks(config, newLinks, totalSize);
+    return { hash: newRootHash, size: totalSize };
+}
+/**
+ * Write data at a specific offset in an encrypted file
+ *
+ * @param config - Tree configuration
+ * @param rootHash - Current root hash of the encrypted file
+ * @param rootKey - Current encryption key for the root
+ * @param offset - Byte offset to write at
+ * @param data - Data to write (plaintext)
+ * @returns New root hash and key
+ */
+export async function writeAtEncrypted(config, rootHash, rootKey, offset, data) {
+    const { store } = config;
+    // Get and decrypt root
+    const encryptedRoot = await store.get(rootHash);
+    if (!encryptedRoot) {
+        throw new Error(`Root not found: ${toHex(rootHash)}`);
+    }
+    const decryptedRoot = await decryptChk(encryptedRoot, rootKey);
+    // Check if it's a tree node or single blob
+    const node = tryDecodeTreeNode(decryptedRoot);
+    if (!node) {
+        // Single blob - modify in place
+        if (offset + data.length > decryptedRoot.length) {
+            throw new Error(`Write extends beyond file: offset=${offset}, data=${data.length}, file=${decryptedRoot.length}`);
+        }
+        const newData = new Uint8Array(decryptedRoot);
+        newData.set(data, offset);
+        // Re-encrypt with CHK
+        const { ciphertext, key } = await encryptChk(newData);
+        const newHash = await sha256(ciphertext);
+        await store.put(newHash, ciphertext);
+        return { hash: newHash, size: newData.length, key };
+    }
+    // Multi-chunk file - find and modify affected chunks
+    const totalSize = node.links.reduce((sum, l) => sum + l.size, 0);
+    if (offset + data.length > totalSize) {
+        throw new Error(`Write extends beyond file: offset=${offset}, data=${data.length}, file=${totalSize}`);
+    }
+    const newLinks = await writeAtInNodeEncrypted(config, node, offset, data);
+    // Rebuild encrypted tree with new links
+    const { hash: newRootHash, key: newRootKey } = await buildEncryptedTreeFromLinks(config, newLinks, totalSize);
+    return { hash: newRootHash, size: totalSize, key: newRootKey };
+}
+/**
+ * Recursively modify chunks in a tree node (unencrypted)
+ */
+async function writeAtInNode(config, node, offset, data) {
+    const { store } = config;
+    const newLinks = [];
+    let position = 0;
+    for (const link of node.links) {
+        const linkStart = position;
+        const linkEnd = position + link.size;
+        position = linkEnd;
+        // Check if this chunk overlaps with the write range
+        const writeStart = offset;
+        const writeEnd = offset + data.length;
+        if (linkEnd <= writeStart || linkStart >= writeEnd) {
+            // No overlap - keep original link
+            newLinks.push(link);
+            continue;
+        }
+        // This chunk needs modification
+        const chunkData = await store.get(link.hash);
+        if (!chunkData) {
+            throw new Error(`Missing chunk: ${toHex(link.hash)}`);
+        }
+        if (link.type !== LinkType.Blob) {
+            // Intermediate node - recurse
+            const childNode = decodeTreeNode(chunkData);
+            const childOffset = Math.max(0, offset - linkStart);
+            const childData = data.slice(Math.max(0, linkStart - offset), Math.min(data.length, linkEnd - offset));
+            const newChildLinks = await writeAtInNode(config, childNode, childOffset, childData);
+            // Build new intermediate node
+            const newChildNode = {
+                type: LinkType.File,
+                links: newChildLinks,
+            };
+            const { data: encodedNode, hash: newChildHash } = await encodeAndHash(newChildNode);
+            await store.put(newChildHash, encodedNode);
+            newLinks.push({
+                hash: newChildHash,
+                size: link.size,
+                type: LinkType.File,
+            });
+        }
+        else {
+            // Leaf blob - modify bytes
+            const newChunkData = new Uint8Array(chunkData);
+            // Calculate which bytes to modify in this chunk
+            const chunkWriteStart = Math.max(0, writeStart - linkStart);
+            const chunkWriteEnd = Math.min(chunkData.length, writeEnd - linkStart);
+            const dataReadStart = Math.max(0, linkStart - writeStart);
+            const dataReadEnd = dataReadStart + (chunkWriteEnd - chunkWriteStart);
+            newChunkData.set(data.slice(dataReadStart, dataReadEnd), chunkWriteStart);
+            const newHash = await sha256(newChunkData);
+            await store.put(newHash, newChunkData);
+            newLinks.push({
+                hash: newHash,
+                size: newChunkData.length,
+                type: LinkType.Blob,
+            });
+        }
+    }
+    return newLinks;
+}
+/**
+ * Recursively modify chunks in an encrypted tree node
+ *
+ * NOTE: For encrypted files, link.size stores CIPHERTEXT size (includes AES-GCM tag),
+ * but offset/data are in PLAINTEXT terms. We need to decrypt each chunk to get
+ * the actual plaintext size for offset calculations.
+ */
+async function writeAtInNodeEncrypted(config, node, offset, data) {
+    const { store } = config;
+    const newLinks = [];
+    // First pass: collect plaintext sizes by decrypting headers or using heuristics
+    // AES-GCM adds 16 bytes tag, so plaintext size = ciphertext size - 16
+    const AES_GCM_TAG_SIZE = 16;
+    let position = 0; // Track plaintext position
+    for (const link of node.links) {
+        // For blobs, plaintext size = ciphertext size - tag
+        // For intermediate nodes, the size stored is the sum of child plaintext sizes
+        const plaintextSize = link.type === LinkType.Blob
+            ? link.size - AES_GCM_TAG_SIZE
+            : link.size; // Intermediate nodes store total plaintext size of subtree
+        const linkStart = position;
+        const linkEnd = position + plaintextSize;
+        position = linkEnd;
+        // Check if this chunk overlaps with the write range
+        const writeStart = offset;
+        const writeEnd = offset + data.length;
+        if (linkEnd <= writeStart || linkStart >= writeEnd) {
+            // No overlap - keep original link
+            newLinks.push(link);
+            continue;
+        }
+        // This chunk needs modification
+        if (!link.key) {
+            throw new Error(`Missing decryption key for chunk: ${toHex(link.hash)}`);
+        }
+        const encryptedChunk = await store.get(link.hash);
+        if (!encryptedChunk) {
+            throw new Error(`Missing chunk: ${toHex(link.hash)}`);
+        }
+        const decryptedChunk = await decryptChk(encryptedChunk, link.key);
+        if (link.type !== LinkType.Blob) {
+            // Intermediate node - recurse
+            const childNode = decodeTreeNode(decryptedChunk);
+            const childOffset = Math.max(0, offset - linkStart);
+            const childData = data.slice(Math.max(0, linkStart - offset), Math.min(data.length, linkEnd - offset));
+            const newChildLinks = await writeAtInNodeEncrypted(config, childNode, childOffset, childData);
+            // Build new encrypted intermediate node
+            const newChildNode = {
+                type: LinkType.File,
+                links: newChildLinks,
+            };
+            const { data: encodedNode } = await encodeAndHash(newChildNode);
+            const { ciphertext, key } = await encryptChk(encodedNode);
+            const newChildHash = await sha256(ciphertext);
+            await store.put(newChildHash, ciphertext);
+            // Recalculate total plaintext size from new links
+            const newPlaintextSize = newChildLinks.reduce((sum, l) => {
+                return sum + (l.type === LinkType.Blob ? l.size - AES_GCM_TAG_SIZE : l.size);
+            }, 0);
+            newLinks.push({
+                hash: newChildHash,
+                size: newPlaintextSize, // Store plaintext size for intermediate nodes
+                key,
+                type: LinkType.File,
+            });
+        }
+        else {
+            // Leaf blob - modify bytes
+            const newChunkData = new Uint8Array(decryptedChunk);
+            // Calculate which bytes to modify in this chunk
+            const chunkWriteStart = Math.max(0, writeStart - linkStart);
+            const chunkWriteEnd = Math.min(decryptedChunk.length, writeEnd - linkStart);
+            const dataReadStart = Math.max(0, linkStart - writeStart);
+            const dataReadEnd = dataReadStart + (chunkWriteEnd - chunkWriteStart);
+            newChunkData.set(data.slice(dataReadStart, dataReadEnd), chunkWriteStart);
+            // Re-encrypt with CHK
+            const { ciphertext, key } = await encryptChk(newChunkData);
+            const newHash = await sha256(ciphertext);
+            await store.put(newHash, ciphertext);
+            newLinks.push({
+                hash: newHash,
+                size: ciphertext.length, // Store ciphertext size for blobs
+                key,
+                type: LinkType.Blob,
+            });
+        }
+    }
+    return newLinks;
+}
+/**
+ * Build tree from links (unencrypted)
+ */
+async function buildTreeFromLinks(config, links, totalSize) {
+    const { store } = config;
+    if (links.length === 1 && links[0].size === totalSize) {
+        return links[0].hash;
+    }
+    // Create single flat node with all links
+    const node = {
+        type: LinkType.File,
+        links,
+    };
+    const { data, hash } = await encodeAndHash(node);
+    await store.put(hash, data);
+    return hash;
+}
+/**
+ * Build encrypted tree from links
+ */
+async function buildEncryptedTreeFromLinks(config, links, totalSize) {
+    const { store } = config;
+    // Single link with key - return directly
+    if (links.length === 1 && links[0].key && links[0].size === totalSize) {
+        return { hash: links[0].hash, key: links[0].key };
+    }
+    // Create single flat node with all links
+    const node = {
+        type: LinkType.File,
+        links,
+    };
+    const { data } = await encodeAndHash(node);
+    const { ciphertext, key } = await encryptChk(data);
+    const hash = await sha256(ciphertext);
+    await store.put(hash, ciphertext);
+    return { hash, key };
+}
+//# sourceMappingURL=writeAt.js.map

package/dist/tree/writeAt.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"writeAt.js","sourceRoot":"","sources":["../../src/tree/writeAt.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAA+B,QAAQ,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AAC3E,OAAO,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AACpC,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAC/E,OAAO,EAAE,UAAU,EAAE,UAAU,EAAsB,MAAM,cAAc,CAAC;AAmB1E;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,OAAO,CAC3B,MAAqB,EACrB,QAAc,EACd,MAAc,EACd,IAAgB;IAEhB,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC;IAEzB,gBAAgB;IAChB,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC3C,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,MAAM,IAAI,KAAK,CAAC,mBAAmB,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IACxD,CAAC;IAED,2CAA2C;IAC3C,MAAM,IAAI,GAAG,iBAAiB,CAAC,QAAQ,CAAC,CAAC;IACzC,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,gCAAgC;QAChC,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;YAC3C,MAAM,IAAI,KAAK,CAAC,qCAAqC,MAAM,UAAU,IAAI,CAAC,MAAM,UAAU,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;QAC/G,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC;QACzC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAE1B,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,OAAO,CAAC,CAAC;QACtC,MAAM,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAElC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC;IACjD,CAAC;IAED,qDAAqD;IACrD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAEjE,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;QACrC,MAAM,IAAI,KAAK,CAAC,qCAAqC,MAAM,UAAU,IAAI,CAAC,MAAM,UAAU,SAAS,EAAE,CAAC,CAAC;IACzG,CAAC;IAED,MAAM,QAAQ,GAAG,MAAM,aAAa,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;IAEjE,8BAA8B;IAC9B,MAAM,WAAW,GAAG,MAAM,kBAAkB,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;IAE1E,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;AAChD,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,MAAqB,EACrB,QAAc,EACd,OAAsB,EACtB,MAAc,EACd,IAAgB;IAEhB,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC;IAEzB,uBAAuB;IACvB,MAAM,aAAa,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAChD,IAAI,CAAC,aAAa,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,mBAAmB,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IACxD,CAAC;IAED,MAAM,aAAa,GAAG,MAAM,UAAU,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;IAE/D,2CAA2C;IAC3C,MAAM,IAAI,GAAG,iBAAiB,CAAC,aAAa,CAAC,CAAC;IAC9C,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,gCAAgC;QAChC,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC;YAChD,MAAM,IAAI,KAAK,CAAC,qCAAqC,MAAM,UAAU,IAAI,CAAC,MAAM,UAAU,aAAa,CAAC,MAAM,EAAE,CAAC,CAAC;QACpH,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,aAAa,CAAC,CAAC;QAC9C,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAE1B,sBAAsB;QACtB,MAAM,EAAE,UAAU,EAAE,GAAG,EAAE,GAAG,MAAM,UAAU,CAAC,OAAO,CAAC,CAAC;QACtD,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,UAAU,CAAC,CAAC;QACzC,MAAM,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QAErC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC;IACtD,CAAC;IAED,qDAAqD;IACrD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAEjE,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;QACrC,MAAM,IAAI,KAAK,CAAC,qCAAqC,MAAM,UAAU,IAAI,CAAC,MAAM,UAAU,SAAS,EAAE,CAAC,CAAC;IACzG,CAAC;IAED,MAAM,QAAQ,GAAG,MAAM,sBAAsB,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;IAE1E,wCAAwC;IACxC,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,MAAM,2BAA2B,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;IAE9G,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC;AACjE,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,aAAa,CAC1B,MAAqB,EACrB,IAAc,EACd,MAAc,EACd,IAAgB;IAEhB,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC;IACzB,MAAM,QAAQ,GAAW,EAAE,CAAC;IAC5B,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,SAAS,GAAG,QAAQ,CAAC;QAC3B,MAAM,OAAO,GAAG,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;QACrC,QAAQ,GAAG,OAAO,CAAC;QAEnB,oDAAoD;QACpD,MAAM,UAAU,GAAG,MAAM,CAAC;QAC1B,MAAM,QAAQ,GAAG,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAEtC,IAAI,OAAO,IAAI,UAAU,IAAI,SAAS,IAAI,QAAQ,EAAE,CAAC;YACnD,kCAAkC;YAClC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,SAAS;QACX,CAAC;QAED,gCAAgC;QAChC,MAAM,SAAS,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,kBAAkB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxD,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,EAAE,CAAC;YAChC,8BAA8B;YAC9B,MAAM,SAAS,GAAG,cAAc,CAAC,SAAS,CAAC,CAAC;YAC5C,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC,CAAC;YACpD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAC1B,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CAAC,EAC/B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,GAAG,MAAM,CAAC,CACxC,CAAC;YAEF,MAAM,aAAa,GAAG,MAAM,aAAa,CAAC,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;YAErF,8BAA8B;YAC9B,MAAM,YAAY,GAAa;gBAC7B,IAAI,EAAE,QAAQ,CAAC,IAAI;gBACnB,KAAK,EAAE,aAAa;aACrB,CAAC;YACF,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,MAAM,aAAa,CAAC,YAAY,CAAC,CAAC;YACpF,MAAM,KAAK,CAAC,GAAG,CAAC,YAAY,EAAE,WAAW,CAAC,CAAC;YAE3C,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,YAAY;gBAClB,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,IAAI,EAAE,QAAQ,CAAC,IAAI;aACpB,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,2BAA2B;YAC3B,MAAM,YAAY,GAAG,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC;YAE/C,gDAAgD;YAChD,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,SAAS,CAAC,CAAC;YAC5D,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,GAAG,SAAS,CAAC,CAAC;YACvE,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,GAAG,UAAU,CAAC,CAAC;YAC1D,MAAM,WAAW,GAAG,aAAa,GAAG,CAAC,aAAa,GAAG,eAAe,CAAC,CAAC;YAEtE,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,WAAW,CAAC,EAAE,eAAe,CAAC,CAAC;YAE1E,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,YAAY,CAAC,CAAC;YAC3C,MAAM,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;YAEvC,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,OAAO;gBACb,IAAI,EAAE,YAAY,CAAC,MAAM;gBACzB,IAAI,EAAE,QAAQ,CAAC,IAAI;aACpB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;;GAMG;AACH,KAAK,UAAU,sBAAsB,CACnC,MAAqB,EACrB,IAAc,EACd,MAAc,EACd,IAAgB;IAEhB,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC;IACzB,MAAM,QAAQ,GAAW,EAAE,CAAC;IAE5B,gFAAgF;IAChF,sEAAsE;IACtE,MAAM,gBAAgB,GAAG,EAAE,CAAC;IAE5B,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC,2BAA2B;IAE7C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,oDAAoD;QACpD,8EAA8E;QAC9E,MAAM,aAAa,GAAG,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI;YAC/C,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,gBAAgB;YAC9B,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,2DAA2D;QAE1E,MAAM,SAAS,GAAG,QAAQ,CAAC;QAC3B,MAAM,OAAO,GAAG,QAAQ,GAAG,aAAa,CAAC;QACzC,QAAQ,GAAG,OAAO,CAAC;QAEnB,oDAAoD;QACpD,MAAM,UAAU,GAAG,MAAM,CAAC;QAC1B,MAAM,QAAQ,GAAG,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAEtC,IAAI,OAAO,IAAI,UAAU,IAAI,SAAS,IAAI,QAAQ,EAAE,CAAC;YACnD,kCAAkC;YAClC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,SAAS;QACX,CAAC;QAED,gCAAgC;QAChC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;YACd,MAAM,IAAI,KAAK,CAAC,qCAAqC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3E,CAAC;QAED,MAAM,cAAc,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClD,IAAI,CAAC,cAAc,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,kBAAkB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxD,CAAC;QAED,MAAM,cAAc,GAAG,MAAM,UAAU,CAAC,cAAc,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QAElE,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,EAAE,CAAC;YAChC,8BAA8B;YAC9B,MAAM,SAAS,GAAG,cAAc,CAAC,cAAc,CAAC,CAAC;YACjD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC,CAAC;YACpD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAC1B,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,GAAG,MAAM,CAAC,EAC/B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,GAAG,MAAM,CAAC,CACxC,CAAC;YAEF,MAAM,aAAa,GAAG,MAAM,sBAAsB,CAAC,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;YAE9F,wCAAwC;YACxC,MAAM,YAAY,GAAa;gBAC7B,IAAI,EAAE,QAAQ,CAAC,IAAI;gBACnB,KAAK,EAAE,aAAa;aACrB,CAAC;YACF,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,MAAM,aAAa,CAAC,YAAY,CAAC,CAAC;YAChE,MAAM,EAAE,UAAU,EAAE,GAAG,EAAE,GAAG,MAAM,UAAU,CAAC,WAAW,CAAC,CAAC;YAC1D,MAAM,YAAY,GAAG,MAAM,MAAM,CAAC,UAAU,CAAC,CAAC;YAC9C,MAAM,KAAK,CAAC,GAAG,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;YAE1C,kDAAkD;YAClD,MAAM,gBAAgB,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;gBACvD,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC/E,CAAC,EAAE,CAAC,CAAC,CAAC;YAEN,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,YAAY;gBAClB,IAAI,EAAE,gBAAgB,EAAE,8CAA8C;gBACtE,GAAG;gBACH,IAAI,EAAE,QAAQ,CAAC,IAAI;aACpB,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,2BAA2B;YAC3B,MAAM,YAAY,GAAG,IAAI,UAAU,CAAC,cAAc,CAAC,CAAC;YAEpD,gDAAgD;YAChD,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,SAAS,CAAC,CAAC;YAC5D,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,MAAM,EAAE,QAAQ,GAAG,SAAS,CAAC,CAAC;YAC5E,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,GAAG,UAAU,CAAC,CAAC;YAC1D,MAAM,WAAW,GAAG,aAAa,GAAG,CAAC,aAAa,GAAG,eAAe,CAAC,CAAC;YAEtE,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE,WAAW,CAAC,EAAE,eAAe,CAAC,CAAC;YAE1E,sBAAsB;YACtB,MAAM,EAAE,UAAU,EAAE,GAAG,EAAE,GAAG,MAAM,UAAU,CAAC,YAAY,CAAC,CAAC;YAC3D,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,UAAU,CAAC,CAAC;YACzC,MAAM,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;YAErC,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,OAAO;gBACb,IAAI,EAAE,UAAU,CAAC,MAAM,EAAE,kCAAkC;gBAC3D,GAAG;gBACH,IAAI,EAAE,QAAQ,CAAC,IAAI;aACpB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,kBAAkB,CAC/B,MAAqB,EACrB,KAAa,EACb,SAAiB;IAEjB,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC;IAEzB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QACtD,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACvB,CAAC;IAED,yCAAyC;IACzC,MAAM,IAAI,GAAa;QACrB,IAAI,EAAE,QAAQ,CAAC,IAAI;QACnB,KAAK;KACN,CAAC;IACF,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,MAAM,aAAa,CAAC,IAAI,CAAC,CAAC;IACjD,MAAM,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC5B,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,2BAA2B,CACxC,MAAqB,EACrB,KAAa,EACb,SAAiB;IAEjB,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC;IAEzB,yCAAyC;IACzC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QACtE,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;IACpD,CAAC;IAED,yCAAyC;IACzC,MAAM,IAAI,GAAa;QACrB,IAAI,EAAE,QAAQ,CAAC,IAAI;QACnB,KAAK;KACN,CAAC;IACF,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,aAAa,CAAC,IAAI,CAAC,CAAC;IAC3C,MAAM,EAAE,UAAU,EAAE,GAAG,EAAE,GAAG,MAAM,UAAU,CAAC,IAAI,CAAC,CAAC;IACnD,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,UAAU,CAAC,CAAC;IACtC,MAAM,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IAClC,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;AACvB,CAAC"}

package/dist/types.d.ts

@@ -0,0 +1,274 @@
+/**
+ * HashTree - Simple content-addressed merkle tree
+ *
+ * Core principle: Every node is stored by SHA256(msgpack(node)) -> msgpack(node)
+ * This enables pure KV content-addressed storage.
+ */
+import type { TreeVisibility } from './visibility.js';
+export type { TreeVisibility };
+/**
+ * 32-byte SHA256 hash used as content address
+ */
+export type Hash = Uint8Array;
+/**
+ * Content Identifier - hash + optional decryption key
+ *
+ * For public content: just the hash
+ * For encrypted content: hash + CHK decryption key
+ */
+export interface CID {
+    /** SHA256 hash of the (encrypted) content */
+    hash: Hash;
+    /** CHK decryption key (for encrypted content) */
+    key?: Uint8Array;
+}
+/**
+ * Create a CID from hash and optional key
+ */
+export declare function cid(hash: Hash, key?: Uint8Array): CID;
+/**
+ * Link/node types - what kind of content a link points to or a node contains
+ */
+export declare enum LinkType {
+    /** Raw data blob (leaf chunk) */
+    Blob = 0,
+    /** Chunked file tree (TreeNode with unnamed links) */
+    File = 1,
+    /** Directory tree (TreeNode with named links) */
+    Dir = 2
+}
+/**
+ * A link to a child node with optional metadata
+ */
+export interface Link {
+    /** SHA256 hash of the child node's MessagePack encoding */
+    hash: Hash;
+    /** Optional name (for directory entries) */
+    name?: string;
+    /** Size of subtree in bytes (for efficient seeks). 0 for Dir links. */
+    size: number;
+    /** CHK decryption key (content hash) for encrypted nodes */
+    key?: Uint8Array;
+    /** Type of content this link points to: Blob, File, or Dir */
+    type: LinkType;
+    /** Optional metadata (for directory entries: createdAt, mimeType, thumbnail, etc.) */
+    meta?: Record<string, unknown>;
+}
+/**
+ * Tree node - contains links to children
+ * Stored as: SHA256(msgpack(TreeNode)) -> msgpack(TreeNode)
+ *
+ * For directories: type=Dir, links have names
+ * For chunked files: type=File, links are ordered chunks
+ */
+export interface TreeNode {
+    /** Type of this node: File or Dir */
+    type: LinkType.File | LinkType.Dir;
+    /** Links to child nodes */
+    links: Link[];
+}
+/**
+ * Blob - raw data (leaf)
+ * Stored as: SHA256(data) -> data
+ *
+ * Note: Blobs are stored directly as raw bytes, not as a structured type
+ */
+export type Blob = Uint8Array;
+/**
+ * Result of adding content to the tree
+ */
+export interface PutResult {
+    /** Hash of the stored node */
+    hash: Hash;
+    /** Size of the stored data */
+    size: number;
+}
+/**
+ * Options for building trees
+ */
+export interface TreeOptions {
+    /** Max links per tree node before splitting (default: 256) */
+    fanout?: number;
+    /** Max blob size before chunking (default: 2MB) */
+    chunkSize?: number;
+}
+/**
+ * Directory entry for building directory trees
+ */
+export interface DirEntry {
+    name: string;
+    hash: Hash;
+    size: number;
+    /** Type of content this entry points to: Blob, File, or Dir */
+    type: LinkType;
+}
+/**
+ * Content-addressed key-value store interface
+ */
+export interface Store {
+    /**
+     * Store data by its hash
+     * @returns true if newly stored, false if already existed
+     */
+    put(hash: Hash, data: Uint8Array): Promise<boolean>;
+    /**
+     * Retrieve data by hash
+     * @returns data or null if not found
+     */
+    get(hash: Hash): Promise<Uint8Array | null>;
+    /**
+     * Check if hash exists
+     */
+    has(hash: Hash): Promise<boolean>;
+    /**
+     * Delete by hash
+     * @returns true if deleted, false if didn't exist
+     */
+    delete(hash: Hash): Promise<boolean>;
+}
+/**
+ * Extended store with metadata support (e.g., Blossom)
+ */
+export interface StoreWithMeta extends Store {
+    /**
+     * Store with content type
+     */
+    put(hash: Hash, data: Uint8Array, contentType?: string): Promise<boolean>;
+}
+/**
+ * Hex string representation of a hash
+ */
+export type HashHex = string;
+/**
+ * Convert hash to hex string
+ */
+export declare function toHex(hash: Hash): HashHex;
+/**
+ * Convert hex string to hash
+ */
+export declare function fromHex(hex: HashHex): Hash;
+/**
+ * Compare two hashes for equality
+ */
+export declare function hashEquals(a: Hash, b: Hash): boolean;
+/**
+ * Entry returned from RefResolver.list()
+ */
+export interface RefResolverListEntry {
+    key: string;
+    cid: CID;
+    /** Tree visibility: public, link-visible, or private */
+    visibility?: TreeVisibility;
+    /** Encrypted key for link-visible trees - decrypt with link key from URL */
+    encryptedKey?: string;
+    /** Key ID for link-visible trees */
+    keyId?: string;
+    /** Self-encrypted key for private/link-visible trees - decrypt with NIP-44 */
+    selfEncryptedKey?: string;
+    /** Self-encrypted link key for link-visible trees - allows owner to recover link key */
+    selfEncryptedLinkKey?: string;
+    /** Unix timestamp when the tree was created/last updated */
+    createdAt?: number;
+}
+/**
+ * Visibility info passed to subscribe callbacks
+ */
+export interface SubscribeVisibilityInfo {
+    /** Tree visibility: public, link-visible, or private */
+    visibility: TreeVisibility;
+    /** Encrypted key for link-visible trees - decrypt with link key from URL */
+    encryptedKey?: string;
+    /** Key ID for link-visible trees */
+    keyId?: string;
+    /** Self-encrypted key for private/link-visible trees - decrypt with NIP-44 */
+    selfEncryptedKey?: string;
+    /** Self-encrypted link key for link-visible trees - allows owner to recover link key for sharing */
+    selfEncryptedLinkKey?: string;
+}
+/**
+ * Options for publishing a tree
+ */
+export interface PublishOptions {
+    /** Tree visibility: public (default), link-visible, or private */
+    visibility?: TreeVisibility;
+    /** Link key for link-visible trees - if not provided, one will be generated */
+    linkKey?: Uint8Array;
+    /** Additional l-tags to add (e.g., ['docs'] for document trees) */
+    labels?: string[];
+}
+/**
+ * Result from publishing a tree
+ */
+export interface PublishResult {
+    /** Whether the publish succeeded */
+    success: boolean;
+    /** Link key for link-visible trees (include in URL as k= param) */
+    linkKey?: Uint8Array;
+}
+/**
+ * RefResolver - Maps human-readable keys to merkle root hashes (refs)
+ *
+ * This abstraction allows different backends (Nostr, DNS, HTTP, local storage)
+ * to provide mutable pointers to immutable content-addressed data.
+ *
+ * Key format is implementation-specific, e.g.:
+ * - Nostr: "npub1.../treename"
+ * - DNS: "example.com/treename"
+ * - Local: "local/mydata"
+ *
+ * All methods wait indefinitely until data is available - caller should apply timeout if needed.
+ */
+export interface RefResolver {
+    /**
+     * Resolve a key to its current CID.
+     * Waits indefinitely until found - caller should apply timeout if needed.
+     * @returns CID (never null - waits until found)
+     */
+    resolve(key: string): Promise<CID | null>;
+    /**
+     * Subscribe to CID changes for a key.
+     * Callback fires immediately with current value (if available), then on each update.
+     * Subscription stays open indefinitely until unsubscribed.
+     *
+     * @param key The key to watch
+     * @param callback Called with new CID (or null if deleted/unavailable) and visibility info
+     * @returns Unsubscribe function
+     */
+    subscribe(key: string, callback: (cid: CID | null, visibilityInfo?: SubscribeVisibilityInfo) => void): () => void;
+    /**
+     * Publish/update a CID (optional - only for writable backends)
+     * Handles all visibility types: public, link-visible, private
+     * @param key The key to publish to
+     * @param cid The CID to publish (with encryption key if encrypted)
+     * @param options Publish options (visibility, linkKey, labels)
+     * @returns Result with success status and linkKey (for link-visible)
+     */
+    publish?(key: string, cid: CID, options?: PublishOptions): Promise<PublishResult>;
+    /**
+     * List all keys matching a prefix.
+     * Streams results as they arrive - stays open indefinitely.
+     * Callback fires on each new entry or update.
+     *
+     * @param prefix The prefix to watch (e.g., "npub1..." for all trees of a user)
+     * @param callback Called with updated list as entries arrive (includes visibility info)
+     * @returns Unsubscribe function
+     */
+    list?(prefix: string, callback: (entries: Array<RefResolverListEntry>) => void): () => void;
+    /**
+     * Stop the resolver and clean up resources
+     */
+    stop?(): void;
+    /**
+     * Inject a local list entry (for instant UI updates)
+     * This makes trees appear immediately without waiting for network
+     * @param entry The entry to inject with full visibility info
+     */
+    injectListEntry?(entry: RefResolverListEntry): void;
+    /**
+     * Delete a tree (publish event without hash to nullify)
+     * @param key The key to delete (e.g., "npub1.../treename")
+     * @returns true if deleted successfully
+     */
+    delete?(key: string): Promise<boolean>;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AACtD,YAAY,EAAE,cAAc,EAAE,CAAC;AAE/B;;GAEG;AACH,MAAM,MAAM,IAAI,GAAG,UAAU,CAAC;AAE9B;;;;;GAKG;AACH,MAAM,WAAW,GAAG;IAClB,6CAA6C;IAC7C,IAAI,EAAE,IAAI,CAAC;IACX,iDAAiD;IACjD,GAAG,CAAC,EAAE,UAAU,CAAC;CAClB;AAED;;GAEG;AACH,wBAAgB,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,UAAU,GAAG,GAAG,CAErD;AAED;;GAEG;AACH,oBAAY,QAAQ;IAClB,iCAAiC;IACjC,IAAI,IAAI;IACR,sDAAsD;IACtD,IAAI,IAAI;IACR,iDAAiD;IACjD,GAAG,IAAI;CACR;AAED;;GAEG;AACH,MAAM,WAAW,IAAI;IACnB,2DAA2D;IAC3D,IAAI,EAAE,IAAI,CAAC;IACX,4CAA4C;IAC5C,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,uEAAuE;IACvE,IAAI,EAAE,MAAM,CAAC;IACb,4DAA4D;IAC5D,GAAG,CAAC,EAAE,UAAU,CAAC;IACjB,8DAA8D;IAC9D,IAAI,EAAE,QAAQ,CAAC;IACf,sFAAsF;IACtF,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAChC;AAED;;;;;;GAMG;AACH,MAAM,WAAW,QAAQ;IACvB,qCAAqC;IACrC,IAAI,EAAE,QAAQ,CAAC,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC;IACnC,2BAA2B;IAC3B,KAAK,EAAE,IAAI,EAAE,CAAC;CACf;AAED;;;;;GAKG;AACH,MAAM,MAAM,IAAI,GAAG,UAAU,CAAC;AAE9B;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,8BAA8B;IAC9B,IAAI,EAAE,IAAI,CAAC;IACX,8BAA8B;IAC9B,IAAI,EAAE,MAAM,CAAC;CACd;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,8DAA8D;IAC9D,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,mDAAmD;IACnD,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,IAAI,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,+DAA+D;IAC/D,IAAI,EAAE,QAAQ,CAAC;CAChB;AAED;;GAEG;AACH,MAAM,WAAW,KAAK;IACpB;;;OAGG;IACH,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAEpD;;;OAGG;IACH,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;IAE5C;;OAEG;IACH,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAElC;;;OAGG;IACH,MAAM,CAAC,IAAI,EAAE,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;CACtC;AAED;;GAEG;AACH,MAAM,WAAW,aAAc,SAAQ,KAAK;IAC1C;;OAEG;IACH,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,WAAW,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;CAC3E;AAED;;GAEG;AACH,MAAM,MAAM,OAAO,GAAG,MAAM,CAAC;AAE7B;;GAEG;AACH,wBAAgB,KAAK,CAAC,IAAI,EAAE,IAAI,GAAG,OAAO,CAEzC;AAED;;GAEG;AACH,wBAAgB,OAAO,CAAC,GAAG,EAAE,OAAO,GAAG,IAAI,CAM1C;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,OAAO,CAMpD;AAED;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACnC,GAAG,EAAE,MAAM,CAAC;IACZ,GAAG,EAAE,GAAG,CAAC;IACT,wDAAwD;IACxD,UAAU,CAAC,EAAE,cAAc,CAAC;IAC5B,4EAA4E;IAC5E,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,oCAAoC;IACpC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,8EAA8E;IAC9E,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,wFAAwF;IACxF,oBAAoB,CAAC,EAAE,MAAM,CAAC;IAC9B,4DAA4D;IAC5D,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,uBAAuB;IACtC,wDAAwD;IACxD,UAAU,EAAE,cAAc,CAAC;IAC3B,4EAA4E;IAC5E,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,oCAAoC;IACpC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,8EAA8E;IAC9E,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,oGAAoG;IACpG,oBAAoB,CAAC,EAAE,MAAM,CAAC;CAC/B;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,kEAAkE;IAClE,UAAU,CAAC,EAAE,cAAc,CAAC;IAC5B,+EAA+E;IAC/E,OAAO,CAAC,EAAE,UAAU,CAAC;IACrB,mEAAmE;IACnE,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,oCAAoC;IACpC,OAAO,EAAE,OAAO,CAAC;IACjB,mEAAmE;IACnE,OAAO,CAAC,EAAE,UAAU,CAAC;CACtB;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,WAAW;IAC1B;;;;OAIG;IACH,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC;IAE1C;;;;;;;;OAQG;IACH,SAAS,CAAC,GAAG,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,GAAG,EAAE,GAAG,GAAG,IAAI,EAAE,cAAc,CAAC,EAAE,uBAAuB,KAAK,IAAI,GAAG,MAAM,IAAI,CAAC;IAElH;;;;;;;OAOG;IACH,OAAO,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,CAAC,EAAE,cAAc,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC;IAElF;;;;;;;;OAQG;IACH,IAAI,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC,oBAAoB,CAAC,KAAK,IAAI,GAAG,MAAM,IAAI,CAAC;IAE5F;;OAEG;IACH,IAAI,CAAC,IAAI,IAAI,CAAC;IAEd;;;;OAIG;IACH,eAAe,CAAC,CAAC,KAAK,EAAE,oBAAoB,GAAG,IAAI,CAAC;IAEpD;;;;OAIG;IACH,MAAM,CAAC,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;CACxC"}

package/dist/types.js

@@ -0,0 +1,47 @@
+/**
+ * Create a CID from hash and optional key
+ */
+export function cid(hash, key) {
+    return key ? { hash, key } : { hash };
+}
+/**
+ * Link/node types - what kind of content a link points to or a node contains
+ */
+export var LinkType;
+(function (LinkType) {
+    /** Raw data blob (leaf chunk) */
+    LinkType[LinkType["Blob"] = 0] = "Blob";
+    /** Chunked file tree (TreeNode with unnamed links) */
+    LinkType[LinkType["File"] = 1] = "File";
+    /** Directory tree (TreeNode with named links) */
+    LinkType[LinkType["Dir"] = 2] = "Dir";
+})(LinkType || (LinkType = {}));
+/**
+ * Convert hash to hex string
+ */
+export function toHex(hash) {
+    return Array.from(hash).map(b => b.toString(16).padStart(2, '0')).join('');
+}
+/**
+ * Convert hex string to hash
+ */
+export function fromHex(hex) {
+    const bytes = new Uint8Array(hex.length / 2);
+    for (let i = 0; i < bytes.length; i++) {
+        bytes[i] = parseInt(hex.substr(i * 2, 2), 16);
+    }
+    return bytes;
+}
+/**
+ * Compare two hashes for equality
+ */
+export function hashEquals(a, b) {
+    if (a.length !== b.length)
+        return false;
+    for (let i = 0; i < a.length; i++) {
+        if (a[i] !== b[i])
+            return false;
+    }
+    return true;
+}
+//# sourceMappingURL=types.js.map

package/dist/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AA2BA;;GAEG;AACH,MAAM,UAAU,GAAG,CAAC,IAAU,EAAE,GAAgB;IAC9C,OAAO,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC;AACxC,CAAC;AAED;;GAEG;AACH,MAAM,CAAN,IAAY,QAOX;AAPD,WAAY,QAAQ;IAClB,iCAAiC;IACjC,uCAAQ,CAAA;IACR,sDAAsD;IACtD,uCAAQ,CAAA;IACR,iDAAiD;IACjD,qCAAO,CAAA;AACT,CAAC,EAPW,QAAQ,KAAR,QAAQ,QAOnB;AAoHD;;GAEG;AACH,MAAM,UAAU,KAAK,CAAC,IAAU;IAC9B,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAC7E,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,OAAO,CAAC,GAAY;IAClC,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,KAAK,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAChD,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,CAAO,EAAE,CAAO;IACzC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IAClC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/verify.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Tree verification utilities
+ */
+import { Store, Hash } from './types.js';
+/**
+ * Verify tree integrity - checks that all referenced hashes exist
+ */
+export declare function verifyTree(store: Store, rootHash: Hash): Promise<{
+    valid: boolean;
+    missing: Hash[];
+}>;
+//# sourceMappingURL=verify.d.ts.map

package/dist/verify.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"verify.d.ts","sourceRoot":"","sources":["../src/verify.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,KAAK,EAAE,IAAI,EAAS,MAAM,YAAY,CAAC;AAGhD;;GAEG;AACH,wBAAsB,UAAU,CAC9B,KAAK,EAAE,KAAK,EACZ,QAAQ,EAAE,IAAI,GACb,OAAO,CAAC;IAAE,KAAK,EAAE,OAAO,CAAC;IAAC,OAAO,EAAE,IAAI,EAAE,CAAA;CAAE,CAAC,CA0B9C"}