@hashtree/core 0.1.0

package/dist/builder.d.ts

@@ -0,0 +1,137 @@
+/**
+ * Tree builder with chunking and fanout support
+ *
+ * - Large files are split into chunks
+ * - Large directories are split into sub-trees
+ * - Supports streaming appends
+ */
+import { Store, Hash, Link, LinkType } from './types.js';
+/**
+ * Default chunk size: 2MB (optimized for blossom uploads)
+ */
+export declare const DEFAULT_CHUNK_SIZE: number;
+/**
+ * Chunker function: returns chunk size for a given chunk index
+ * @param index - 0-based chunk index
+ * @returns chunk size in bytes
+ */
+export type Chunker = (index: number) => number;
+/**
+ * Create a fixed-size chunker
+ */
+export declare function fixedChunker(size: number): Chunker;
+/**
+ * Create a video-optimized chunker with smaller first chunk for fast playback start
+ * @param firstChunkSize - Size of first chunk (default: 256KB)
+ * @param regularChunkSize - Size of remaining chunks (default: 2MB)
+ */
+export declare function videoChunker(firstChunkSize?: number, regularChunkSize?: number): Chunker;
+export interface BuilderConfig {
+    store: Store;
+    /** Chunk size for splitting blobs (ignored if chunker is provided) */
+    chunkSize?: number;
+    /** Custom chunker function for variable chunk sizes */
+    chunker?: Chunker;
+    /** Hash chunks in parallel (default: true) */
+    parallel?: boolean;
+}
+export interface FileEntry {
+    name: string;
+    data: Uint8Array;
+}
+export interface DirEntry {
+    name: string;
+    hash: Hash;
+    size: number;
+    type: LinkType;
+    meta?: Record<string, unknown>;
+}
+/**
+ * TreeBuilder - builds content-addressed merkle trees
+ */
+export declare class TreeBuilder {
+    private store;
+    private chunker;
+    private parallel;
+    constructor(config: BuilderConfig);
+    /**
+     * Store a blob directly (small data)
+     * Returns the content hash
+     */
+    putBlob(data: Uint8Array): Promise<Hash>;
+    /**
+     * Store a file, chunking if necessary
+     * Returns root hash and total size
+     */
+    putFile(data: Uint8Array): Promise<{
+        hash: Hash;
+        size: number;
+    }>;
+    /**
+     * Build a balanced tree from links (for chunked files)
+     * Handles fanout by creating intermediate nodes
+     */
+    private buildTree;
+    /**
+     * Build a directory from entries
+     * Entries can be files or subdirectories
+     *
+     * Directories are encoded as MessagePack blobs. If the encoded blob exceeds
+     * chunkSize, it's chunked by bytes like files using putFile.
+     *
+     * @param entries Directory entries
+     */
+    putDirectory(entries: DirEntry[]): Promise<Hash>;
+    /**
+     * Create a tree node
+     * @param nodeType - LinkType.File or LinkType.Dir
+     */
+    putTreeNode(nodeType: LinkType.File | LinkType.Dir, links: Link[]): Promise<Hash>;
+}
+/**
+ * StreamBuilder - supports incremental appends
+ */
+export declare class StreamBuilder {
+    private store;
+    private chunker;
+    private buffer;
+    private bufferOffset;
+    private chunks;
+    private totalSize;
+    constructor(config: BuilderConfig);
+    /** Get current target chunk size */
+    private currentChunkSize;
+    /**
+     * Append data to the stream
+     */
+    append(data: Uint8Array): Promise<void>;
+    /**
+     * Flush current buffer as a chunk
+     */
+    private flushChunk;
+    /**
+     * Get current root hash without finalizing
+     * Useful for checkpoints
+     */
+    currentRoot(): Promise<Hash | null>;
+    /**
+     * Finalize the stream and return root hash
+     */
+    finalize(): Promise<{
+        hash: Hash;
+        size: number;
+    }>;
+    /**
+     * Build flat tree from chunks (for streaming files)
+     */
+    private buildTreeFromChunks;
+    /**
+     * Get stats
+     */
+    get stats(): {
+        chunks: number;
+        buffered: number;
+        totalSize: number;
+    };
+}
+//# sourceMappingURL=builder.d.ts.map

package/dist/builder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"builder.d.ts","sourceRoot":"","sources":["../src/builder.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,KAAK,EAAE,IAAI,EAAY,IAAI,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAInE;;GAEG;AACH,eAAO,MAAM,kBAAkB,QAAkB,CAAC;AAElD;;;;GAIG;AACH,MAAM,MAAM,OAAO,GAAG,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,CAAC;AAEhD;;GAEG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAElD;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAC1B,cAAc,GAAE,MAAmB,EACnC,gBAAgB,GAAE,MAA2B,GAC5C,OAAO,CAET;AAED,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,KAAK,CAAC;IACb,sEAAsE;IACtE,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,uDAAuD;IACvD,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,8CAA8C;IAC9C,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB;AAED,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,UAAU,CAAC;CAClB;AAED,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,IAAI,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CAChC;AAED;;GAEG;AACH,qBAAa,WAAW;IACtB,OAAO,CAAC,KAAK,CAAQ;IACrB,OAAO,CAAC,OAAO,CAAU;IACzB,OAAO,CAAC,QAAQ,CAAU;gBAEd,MAAM,EAAE,aAAa;IAMjC;;;OAGG;IACG,OAAO,CAAC,IAAI,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC;IAM9C;;;OAGG;IACG,OAAO,CAAC,IAAI,EAAE,UAAU,GAAG,OAAO,CAAC;QAAE,IAAI,EAAE,IAAI,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC;IA8CtE;;;OAGG;YACW,SAAS;IAgBvB;;;;;;;;OAQG;IACG,YAAY,CAAC,OAAO,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IA6BtD;;;OAGG;IACG,WAAW,CACf,QAAQ,EAAE,QAAQ,CAAC,IAAI,GAAG,QAAQ,CAAC,GAAG,EACtC,KAAK,EAAE,IAAI,EAAE,GACZ,OAAO,CAAC,IAAI,CAAC;CAUjB;AAED;;GAEG;AACH,qBAAa,aAAa;IACxB,OAAO,CAAC,KAAK,CAAQ;IACrB,OAAO,CAAC,OAAO,CAAU;IAGzB,OAAO,CAAC,MAAM,CAAa;IAC3B,OAAO,CAAC,YAAY,CAAa;IAGjC,OAAO,CAAC,MAAM,CAAc;IAC5B,OAAO,CAAC,SAAS,CAAa;gBAElB,MAAM,EAAE,aAAa;IAOjC,oCAAoC;IACpC,OAAO,CAAC,gBAAgB;IAIxB;;OAEG;IACG,MAAM,CAAC,IAAI,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC;IA+B7C;;OAEG;YACW,UAAU;IAWxB;;;OAGG;IACG,WAAW,IAAI,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC;IAiBzC;;OAEG;IACG,QAAQ,IAAI,OAAO,CAAC;QAAE,IAAI,EAAE,IAAI,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC;IAevD;;OAEG;YACW,mBAAmB;IAejC;;OAEG;IACH,IAAI,KAAK,IAAI;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,CAMnE;CACF"}

package/dist/builder.js

@@ -0,0 +1,281 @@
+/**
+ * Tree builder with chunking and fanout support
+ *
+ * - Large files are split into chunks
+ * - Large directories are split into sub-trees
+ * - Supports streaming appends
+ */
+import { LinkType } from './types.js';
+import { sha256 } from './hash.js';
+import { encodeAndHash } from './codec.js';
+/**
+ * Default chunk size: 2MB (optimized for blossom uploads)
+ */
+export const DEFAULT_CHUNK_SIZE = 2 * 1024 * 1024;
+/**
+ * Create a fixed-size chunker
+ */
+export function fixedChunker(size) {
+    return () => size;
+}
+/**
+ * Create a video-optimized chunker with smaller first chunk for fast playback start
+ * @param firstChunkSize - Size of first chunk (default: 256KB)
+ * @param regularChunkSize - Size of remaining chunks (default: 2MB)
+ */
+export function videoChunker(firstChunkSize = 256 * 1024, regularChunkSize = DEFAULT_CHUNK_SIZE) {
+    return (index) => index === 0 ? firstChunkSize : regularChunkSize;
+}
+/**
+ * TreeBuilder - builds content-addressed merkle trees
+ */
+export class TreeBuilder {
+    store;
+    chunker;
+    parallel;
+    constructor(config) {
+        this.store = config.store;
+        this.chunker = config.chunker ?? fixedChunker(config.chunkSize ?? DEFAULT_CHUNK_SIZE);
+        this.parallel = config.parallel ?? true;
+    }
+    /**
+     * Store a blob directly (small data)
+     * Returns the content hash
+     */
+    async putBlob(data) {
+        const hash = await sha256(data);
+        await this.store.put(hash, data);
+        return hash;
+    }
+    /**
+     * Store a file, chunking if necessary
+     * Returns root hash and total size
+     */
+    async putFile(data) {
+        const size = data.length;
+        const firstChunkSize = this.chunker(0);
+        // Small file - store as single blob
+        if (data.length <= firstChunkSize) {
+            const hash = await this.putBlob(data);
+            return { hash, size };
+        }
+        // Split into chunks using chunker
+        const chunkList = [];
+        const chunkSizes = [];
+        let offset = 0;
+        let chunkIndex = 0;
+        while (offset < data.length) {
+            const chunkSize = this.chunker(chunkIndex);
+            const end = Math.min(offset + chunkSize, data.length);
+            chunkList.push(data.slice(offset, end));
+            chunkSizes.push(end - offset);
+            offset = end;
+            chunkIndex++;
+        }
+        // Hash and store chunks (parallel or sequential)
+        let chunkHashes;
+        if (this.parallel) {
+            chunkHashes = await Promise.all(chunkList.map(chunk => this.putBlob(chunk)));
+        }
+        else {
+            chunkHashes = [];
+            for (const chunk of chunkList) {
+                chunkHashes.push(await this.putBlob(chunk));
+            }
+        }
+        // Build tree from chunks (leaf chunks are raw blobs)
+        const chunks = chunkHashes.map((hash, i) => ({
+            hash,
+            size: chunkSizes[i],
+            type: LinkType.Blob,
+        }));
+        const rootHash = await this.buildTree(chunks, size);
+        return { hash: rootHash, size };
+    }
+    /**
+     * Build a balanced tree from links (for chunked files)
+     * Handles fanout by creating intermediate nodes
+     */
+    async buildTree(links, totalSize) {
+        // Single link - return it directly
+        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 this.store.put(hash, data);
+        return hash;
+    }
+    /**
+     * Build a directory from entries
+     * Entries can be files or subdirectories
+     *
+     * Directories are encoded as MessagePack blobs. If the encoded blob exceeds
+     * chunkSize, it's chunked by bytes like files using putFile.
+     *
+     * @param entries Directory entries
+     */
+    async putDirectory(entries) {
+        // Sort entries by name for deterministic hashing
+        const sorted = [...entries].sort((a, b) => a.name.localeCompare(b.name));
+        const links = sorted.map(e => ({
+            hash: e.hash,
+            name: e.name,
+            size: e.size,
+            type: e.type,
+            meta: e.meta,
+        }));
+        const node = {
+            type: LinkType.Dir,
+            links,
+        };
+        const { data, hash } = await encodeAndHash(node);
+        // Small directory - store directly
+        if (data.length <= this.chunker(0)) {
+            await this.store.put(hash, data);
+            return hash;
+        }
+        // Large directory - reuse putFile for chunking
+        const { hash: rootHash } = await this.putFile(data);
+        return rootHash;
+    }
+    /**
+     * Create a tree node
+     * @param nodeType - LinkType.File or LinkType.Dir
+     */
+    async putTreeNode(nodeType, links) {
+        const node = {
+            type: nodeType,
+            links,
+        };
+        const { data, hash } = await encodeAndHash(node);
+        await this.store.put(hash, data);
+        return hash;
+    }
+}
+/**
+ * StreamBuilder - supports incremental appends
+ */
+export class StreamBuilder {
+    store;
+    chunker;
+    // Current partial chunk being built
+    buffer;
+    bufferOffset = 0;
+    // Completed chunks
+    chunks = [];
+    totalSize = 0;
+    constructor(config) {
+        this.store = config.store;
+        this.chunker = config.chunker ?? fixedChunker(config.chunkSize ?? DEFAULT_CHUNK_SIZE);
+        // Initialize buffer with first chunk size
+        this.buffer = new Uint8Array(this.chunker(0));
+    }
+    /** Get current target chunk size */
+    currentChunkSize() {
+        return this.chunker(this.chunks.length);
+    }
+    /**
+     * Append data to the stream
+     */
+    async append(data) {
+        let offset = 0;
+        while (offset < data.length) {
+            const targetSize = this.currentChunkSize();
+            // Resize buffer if needed for new chunk size
+            if (this.buffer.length !== targetSize) {
+                const newBuffer = new Uint8Array(targetSize);
+                if (this.bufferOffset > 0) {
+                    newBuffer.set(this.buffer.subarray(0, this.bufferOffset));
+                }
+                this.buffer = newBuffer;
+            }
+            const space = targetSize - this.bufferOffset;
+            const toWrite = Math.min(space, data.length - offset);
+            this.buffer.set(data.subarray(offset, offset + toWrite), this.bufferOffset);
+            this.bufferOffset += toWrite;
+            offset += toWrite;
+            // Flush full chunk
+            if (this.bufferOffset === targetSize) {
+                await this.flushChunk();
+            }
+        }
+        this.totalSize += data.length;
+    }
+    /**
+     * Flush current buffer as a chunk
+     */
+    async flushChunk() {
+        if (this.bufferOffset === 0)
+            return;
+        const chunk = this.buffer.slice(0, this.bufferOffset);
+        const hash = await sha256(chunk);
+        await this.store.put(hash, new Uint8Array(chunk));
+        this.chunks.push({ hash, size: chunk.length, type: LinkType.Blob });
+        this.bufferOffset = 0;
+    }
+    /**
+     * Get current root hash without finalizing
+     * Useful for checkpoints
+     */
+    async currentRoot() {
+        if (this.chunks.length === 0 && this.bufferOffset === 0) {
+            return null;
+        }
+        // Temporarily flush buffer
+        const tempChunks = [...this.chunks];
+        if (this.bufferOffset > 0) {
+            const chunk = this.buffer.slice(0, this.bufferOffset);
+            const hash = await sha256(chunk);
+            await this.store.put(hash, new Uint8Array(chunk));
+            tempChunks.push({ hash, size: chunk.length, type: LinkType.Blob });
+        }
+        return this.buildTreeFromChunks(tempChunks, this.totalSize);
+    }
+    /**
+     * Finalize the stream and return root hash
+     */
+    async finalize() {
+        // Flush remaining buffer
+        await this.flushChunk();
+        if (this.chunks.length === 0) {
+            // Empty stream - return hash of empty data
+            const emptyHash = await sha256(new Uint8Array(0));
+            await this.store.put(emptyHash, new Uint8Array(0));
+            return { hash: emptyHash, size: 0 };
+        }
+        const hash = await this.buildTreeFromChunks(this.chunks, this.totalSize);
+        return { hash, size: this.totalSize };
+    }
+    /**
+     * Build flat tree from chunks (for streaming files)
+     */
+    async buildTreeFromChunks(chunks, _totalSize) {
+        if (chunks.length === 1) {
+            return chunks[0].hash;
+        }
+        // Create single flat node with all links
+        const node = {
+            type: LinkType.File,
+            links: chunks,
+        };
+        const { data, hash } = await encodeAndHash(node);
+        await this.store.put(hash, data);
+        return hash;
+    }
+    /**
+     * Get stats
+     */
+    get stats() {
+        return {
+            chunks: this.chunks.length,
+            buffered: this.bufferOffset,
+            totalSize: this.totalSize,
+        };
+    }
+}
+//# sourceMappingURL=builder.js.map

package/dist/builder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"builder.js","sourceRoot":"","sources":["../src/builder.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAA+B,QAAQ,EAAE,MAAM,YAAY,CAAC;AACnE,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AACnC,OAAO,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAE3C;;GAEG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;AASlD;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,IAAY;IACvC,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC;AACpB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAC1B,iBAAyB,GAAG,GAAG,IAAI,EACnC,mBAA2B,kBAAkB;IAE7C,OAAO,CAAC,KAAa,EAAE,EAAE,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,gBAAgB,CAAC;AAC5E,CAAC;AAyBD;;GAEG;AACH,MAAM,OAAO,WAAW;IACd,KAAK,CAAQ;IACb,OAAO,CAAU;IACjB,QAAQ,CAAU;IAE1B,YAAY,MAAqB;QAC/B,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;QAC1B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,YAAY,CAAC,MAAM,CAAC,SAAS,IAAI,kBAAkB,CAAC,CAAC;QACtF,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,QAAQ,IAAI,IAAI,CAAC;IAC1C,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,OAAO,CAAC,IAAgB;QAC5B,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,IAAI,CAAC,CAAC;QAChC,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,OAAO,CAAC,IAAgB;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QACzB,MAAM,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAEvC,oCAAoC;QACpC,IAAI,IAAI,CAAC,MAAM,IAAI,cAAc,EAAE,CAAC;YAClC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACtC,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;QACxB,CAAC;QAED,kCAAkC;QAClC,MAAM,SAAS,GAAiB,EAAE,CAAC;QACnC,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,OAAO,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAC5B,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACtD,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC;YACxC,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC;YAC9B,MAAM,GAAG,GAAG,CAAC;YACb,UAAU,EAAE,CAAC;QACf,CAAC;QAED,iDAAiD;QACjD,IAAI,WAAmB,CAAC;QACxB,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,WAAW,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC/E,CAAC;aAAM,CAAC;YACN,WAAW,GAAG,EAAE,CAAC;YACjB,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;gBAC9B,WAAW,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;YAC9C,CAAC;QACH,CAAC;QAED,qDAAqD;QACrD,MAAM,MAAM,GAAW,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YACnD,IAAI;YACJ,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC;YACnB,IAAI,EAAE,QAAQ,CAAC,IAAI;SACpB,CAAC,CAAC,CAAC;QACJ,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACpD,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;IAClC,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,SAAS,CAAC,KAAa,EAAE,SAAkB;QACvD,mCAAmC;QACnC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YACtD,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACvB,CAAC;QAED,yCAAyC;QACzC,MAAM,IAAI,GAAa;YACrB,IAAI,EAAE,QAAQ,CAAC,IAAI;YACnB,KAAK;SACN,CAAC;QACF,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,MAAM,aAAa,CAAC,IAAI,CAAC,CAAC;QACjD,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,YAAY,CAAC,OAAmB;QACpC,iDAAiD;QACjD,MAAM,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAEzE,MAAM,KAAK,GAAW,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACrC,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,IAAI,EAAE,CAAC,CAAC,IAAI;SACb,CAAC,CAAC,CAAC;QAEJ,MAAM,IAAI,GAAa;YACrB,IAAI,EAAE,QAAQ,CAAC,GAAG;YAClB,KAAK;SACN,CAAC;QACF,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,MAAM,aAAa,CAAC,IAAI,CAAC,CAAC;QAEjD,mCAAmC;QACnC,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YACnC,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACjC,OAAO,IAAI,CAAC;QACd,CAAC;QAED,+CAA+C;QAC/C,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACpD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,WAAW,CACf,QAAsC,EACtC,KAAa;QAEb,MAAM,IAAI,GAAa;YACrB,IAAI,EAAE,QAAQ;YACd,KAAK;SACN,CAAC;QAEF,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,MAAM,aAAa,CAAC,IAAI,CAAC,CAAC;QACjD,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,aAAa;IAChB,KAAK,CAAQ;IACb,OAAO,CAAU;IAEzB,oCAAoC;IAC5B,MAAM,CAAa;IACnB,YAAY,GAAW,CAAC,CAAC;IAEjC,mBAAmB;IACX,MAAM,GAAW,EAAE,CAAC;IACpB,SAAS,GAAW,CAAC,CAAC;IAE9B,YAAY,MAAqB;QAC/B,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;QAC1B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,YAAY,CAAC,MAAM,CAAC,SAAS,IAAI,kBAAkB,CAAC,CAAC;QACtF,0CAA0C;QAC1C,IAAI,CAAC,MAAM,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC;IAED,oCAAoC;IAC5B,gBAAgB;QACtB,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC1C,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CAAC,IAAgB;QAC3B,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,OAAO,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAC5B,MAAM,UAAU,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAE3C,6CAA6C;YAC7C,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;gBACtC,MAAM,SAAS,GAAG,IAAI,UAAU,CAAC,UAAU,CAAC,CAAC;gBAC7C,IAAI,IAAI,CAAC,YAAY,GAAG,CAAC,EAAE,CAAC;oBAC1B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;gBAC5D,CAAC;gBACD,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;YAC1B,CAAC;YAED,MAAM,KAAK,GAAG,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC;YAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC;YAEtD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;YAC5E,IAAI,CAAC,YAAY,IAAI,OAAO,CAAC;YAC7B,MAAM,IAAI,OAAO,CAAC;YAElB,mBAAmB;YACnB,IAAI,IAAI,CAAC,YAAY,KAAK,UAAU,EAAE,CAAC;gBACrC,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC;IAChC,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,UAAU;QACtB,IAAI,IAAI,CAAC,YAAY,KAAK,CAAC;YAAE,OAAO;QAEpC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QACtD,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,KAAK,CAAC,CAAC;QACjC,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC;QAElD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;QACpE,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;IACxB,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,WAAW;QACf,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,YAAY,KAAK,CAAC,EAAE,CAAC;YACxD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,2BAA2B;QAC3B,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,IAAI,CAAC,YAAY,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;YACtD,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC;YAClD,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;QACrE,CAAC;QAED,OAAO,IAAI,CAAC,mBAAmB,CAAC,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IAC9D,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ;QACZ,yBAAyB;QACzB,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAExB,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,2CAA2C;YAC3C,MAAM,SAAS,GAAG,MAAM,MAAM,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YAClD,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YACnD,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;QACtC,CAAC;QAED,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QACzE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC;IACxC,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,mBAAmB,CAAC,MAAc,EAAE,UAAkB;QAClE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACxB,CAAC;QAED,yCAAyC;QACzC,MAAM,IAAI,GAAa;YACrB,IAAI,EAAE,QAAQ,CAAC,IAAI;YACnB,KAAK,EAAE,MAAM;SACd,CAAC;QACF,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,MAAM,aAAa,CAAC,IAAI,CAAC,CAAC;QACjD,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,IAAI,KAAK;QACP,OAAO;YACL,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM;YAC1B,QAAQ,EAAE,IAAI,CAAC,YAAY;YAC3B,SAAS,EAAE,IAAI,CAAC,SAAS;SAC1B,CAAC;IACJ,CAAC;CACF"}

package/dist/codec.d.ts

@@ -0,0 +1,37 @@
+/**
+ * MessagePack encoding/decoding for tree nodes
+ *
+ * Blobs are stored raw (not wrapped) for efficiency.
+ * Tree nodes are MessagePack-encoded.
+ *
+ * **Determinism:** We ensure deterministic output by:
+ * 1. Using fixed field order in the encoded map
+ * 2. Sorting metadata keys alphabetically before encoding
+ */
+import { TreeNode, LinkType, Hash } from './types.js';
+/**
+ * Encode a tree node to MessagePack
+ * Fields are ordered alphabetically for canonical encoding
+ */
+export declare function encodeTreeNode(node: TreeNode): Uint8Array;
+/**
+ * Try to decode MessagePack data as a tree node
+ * Returns null if data is not a valid tree node (i.e., it's a raw blob)
+ */
+export declare function tryDecodeTreeNode(data: Uint8Array): TreeNode | null;
+/**
+ * Decode MessagePack to a tree node (throws if not a tree node)
+ */
+export declare function decodeTreeNode(data: Uint8Array): TreeNode;
+/**
+ * Encode a tree node and compute its hash
+ */
+export declare function encodeAndHash(node: TreeNode): Promise<{
+    data: Uint8Array;
+    hash: Hash;
+}>;
+/**
+ * Get the type of a chunk: File, Dir, or Blob
+ */
+export declare function getNodeType(data: Uint8Array): LinkType;
+//# sourceMappingURL=codec.d.ts.map

package/dist/codec.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"codec.d.ts","sourceRoot":"","sources":["../src/codec.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,OAAO,EAAE,QAAQ,EAAQ,QAAQ,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AA2C5D;;;GAGG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,QAAQ,GAAG,UAAU,CAwBzD;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,UAAU,GAAG,QAAQ,GAAG,IAAI,CAuBnE;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,UAAU,GAAG,QAAQ,CAMzD;AAED;;GAEG;AACH,wBAAsB,aAAa,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO,CAAC;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,IAAI,EAAE,IAAI,CAAA;CAAE,CAAC,CAI7F;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,UAAU,GAAG,QAAQ,CAGtD"}

package/dist/codec.js

@@ -0,0 +1,109 @@
+/**
+ * MessagePack encoding/decoding for tree nodes
+ *
+ * Blobs are stored raw (not wrapped) for efficiency.
+ * Tree nodes are MessagePack-encoded.
+ *
+ * **Determinism:** We ensure deterministic output by:
+ * 1. Using fixed field order in the encoded map
+ * 2. Sorting metadata keys alphabetically before encoding
+ */
+import { encode, decode } from '@msgpack/msgpack';
+import { LinkType } from './types.js';
+import { sha256 } from './hash.js';
+/**
+ * Sort object keys alphabetically for deterministic encoding
+ */
+function sortObjectKeys(obj) {
+    const sorted = {};
+    for (const key of Object.keys(obj).sort()) {
+        sorted[key] = obj[key];
+    }
+    return sorted;
+}
+/**
+ * Encode a tree node to MessagePack
+ * Fields are ordered alphabetically for canonical encoding
+ */
+export function encodeTreeNode(node) {
+    // TreeNode fields in alphabetical order: l, t
+    const msgpack = {
+        l: node.links.map(link => {
+            // Link fields in alphabetical order: h, k?, m?, n?, s, t
+            // Build object with all fields in order, undefined values are omitted by msgpack
+            const l = {
+                h: link.hash,
+                k: link.key,
+                m: link.meta !== undefined ? sortObjectKeys(link.meta) : undefined,
+                n: link.name,
+                s: link.size,
+                t: link.type,
+            };
+            // Remove undefined fields to match skip_serializing_if behavior
+            if (l.k === undefined)
+                delete l.k;
+            if (l.m === undefined)
+                delete l.m;
+            if (l.n === undefined)
+                delete l.n;
+            return l;
+        }),
+        t: node.type,
+    };
+    return encode(msgpack);
+}
+/**
+ * Try to decode MessagePack data as a tree node
+ * Returns null if data is not a valid tree node (i.e., it's a raw blob)
+ */
+export function tryDecodeTreeNode(data) {
+    try {
+        const msgpack = decode(data);
+        if (msgpack.t !== LinkType.File && msgpack.t !== LinkType.Dir) {
+            return null;
+        }
+        const node = {
+            type: msgpack.t,
+            links: msgpack.l.map(l => {
+                const link = { hash: l.h, size: l.s ?? 0, type: l.t ?? LinkType.Blob };
+                if (l.n !== undefined)
+                    link.name = l.n;
+                if (l.k !== undefined)
+                    link.key = l.k;
+                if (l.m !== undefined)
+                    link.meta = l.m;
+                return link;
+            }),
+        };
+        return node;
+    }
+    catch {
+        return null;
+    }
+}
+/**
+ * Decode MessagePack to a tree node (throws if not a tree node)
+ */
+export function decodeTreeNode(data) {
+    const node = tryDecodeTreeNode(data);
+    if (!node) {
+        throw new Error('Data is not a valid tree node');
+    }
+    return node;
+}
+/**
+ * Encode a tree node and compute its hash
+ */
+export async function encodeAndHash(node) {
+    const data = encodeTreeNode(node);
+    const hash = await sha256(data);
+    return { data, hash };
+}
+/**
+ * Get the type of a chunk: File, Dir, or Blob
+ */
+export function getNodeType(data) {
+    const node = tryDecodeTreeNode(data);
+    return node?.type ?? LinkType.Blob;
+}
+//# sourceMappingURL=codec.js.map

package/dist/codec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"codec.js","sourceRoot":"","sources":["../src/codec.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAkB,QAAQ,EAAQ,MAAM,YAAY,CAAC;AAC5D,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AA+BnC;;GAEG;AACH,SAAS,cAAc,CAAoC,GAAM;IAC/D,MAAM,MAAM,GAA4B,EAAE,CAAC;IAC3C,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;QAC1C,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;IACzB,CAAC;IACD,OAAO,MAAW,CAAC;AACrB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,IAAc;IAC3C,8CAA8C;IAC9C,MAAM,OAAO,GAAoB;QAC/B,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;YACvB,yDAAyD;YACzD,iFAAiF;YACjF,MAAM,CAAC,GAAgB;gBACrB,CAAC,EAAE,IAAI,CAAC,IAAI;gBACZ,CAAC,EAAE,IAAI,CAAC,GAAG;gBACX,CAAC,EAAE,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS;gBAClE,CAAC,EAAE,IAAI,CAAC,IAAI;gBACZ,CAAC,EAAE,IAAI,CAAC,IAAI;gBACZ,CAAC,EAAE,IAAI,CAAC,IAAI;aACE,CAAC;YACjB,gEAAgE;YAChE,IAAI,CAAC,CAAC,CAAC,KAAK,SAAS;gBAAE,OAAO,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,CAAC,CAAC,KAAK,SAAS;gBAAE,OAAO,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,CAAC,CAAC,KAAK,SAAS;gBAAE,OAAO,CAAC,CAAC,CAAC,CAAC;YAClC,OAAO,CAAC,CAAC;QACX,CAAC,CAAC;QACF,CAAC,EAAE,IAAI,CAAC,IAAI;KACb,CAAC;IAEF,OAAO,MAAM,CAAC,OAAO,CAAC,CAAC;AACzB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAgB;IAChD,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAoB,CAAC;QAEhD,IAAI,OAAO,CAAC,CAAC,KAAK,QAAQ,CAAC,IAAI,IAAI,OAAO,CAAC,CAAC,KAAK,QAAQ,CAAC,GAAG,EAAE,CAAC;YAC9D,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,IAAI,GAAa;YACrB,IAAI,EAAE,OAAO,CAAC,CAAiC;YAC/C,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;gBACvB,MAAM,IAAI,GAAS,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC;gBAC7E,IAAI,CAAC,CAAC,CAAC,KAAK,SAAS;oBAAE,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;gBACvC,IAAI,CAAC,CAAC,CAAC,KAAK,SAAS;oBAAE,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBACtC,IAAI,CAAC,CAAC,CAAC,KAAK,SAAS;oBAAE,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;gBACvC,OAAO,IAAI,CAAC;YACd,CAAC,CAAC;SACH,CAAC;QAEF,OAAO,IAAI,CAAC;IACd,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,IAAgB;IAC7C,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACrC,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;IACnD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CAAC,IAAc;IAChD,MAAM,IAAI,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;IAClC,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,IAAI,CAAC,CAAC;IAChC,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AACxB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,IAAgB;IAC1C,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACrC,OAAO,IAAI,EAAE,IAAI,IAAI,QAAQ,CAAC,IAAI,CAAC;AACrC,CAAC"}

package/dist/crypto.d.ts

@@ -0,0 +1,92 @@
+/**
+ * Encryption utilities for HashTree
+ *
+ * CHK (Content Hash Key) encryption for deterministic encryption:
+ * - key = SHA256(plaintext) - content hash becomes decryption key
+ * - encryption_key = HKDF(key, salt="hashtree-chk", info="encryption-key")
+ * - ciphertext = AES-256-GCM(encryption_key, zero_nonce, plaintext)
+ *
+ * Zero nonce is safe because CHK guarantees: same key = same content.
+ * This enables deduplication: same content → same ciphertext → same hash.
+ *
+ * Format: [ciphertext][16-byte auth tag] (no IV needed with CHK)
+ *
+ * Also includes legacy functions with random IV for backward compatibility:
+ * Format: [12-byte IV][ciphertext][16-byte auth tag]
+ */
+/** 32-byte encryption key (256 bits) */
+export type EncryptionKey = Uint8Array;
+/** Generate a random 32-byte encryption key */
+export declare function generateKey(): EncryptionKey;
+/**
+ * Compute content hash (SHA256) - this becomes the decryption key for CHK
+ */
+export declare function contentHash(data: Uint8Array): Promise<EncryptionKey>;
+/**
+ * CHK encrypt: derive key from content, encrypt with zero nonce
+ *
+ * Returns: (ciphertext with auth tag, content_hash as decryption key)
+ *
+ * Zero nonce is safe because CHK guarantees: same key = same content.
+ * We never encrypt different content with the same key.
+ *
+ * The content_hash is both:
+ * - The decryption key (store securely, share with authorized users)
+ * - Enables dedup: same content → same ciphertext
+ *
+ * @param plaintext - Data to encrypt
+ * @returns Object with encrypted data and content hash (decryption key)
+ */
+export declare function encryptChk(plaintext: Uint8Array): Promise<{
+    ciphertext: Uint8Array;
+    key: EncryptionKey;
+}>;
+/**
+ * CHK decrypt: derive key from content_hash, decrypt with zero nonce
+ *
+ * @param ciphertext - Encrypted data (includes auth tag)
+ * @param key - Content hash returned from encryptChk
+ * @returns Decrypted plaintext
+ * @throws Error if decryption fails (wrong key or tampered data)
+ */
+export declare function decryptChk(ciphertext: Uint8Array, key: EncryptionKey): Promise<Uint8Array>;
+/**
+ * Calculate encrypted size for CHK (no nonce prefix, just ciphertext + auth tag)
+ */
+export declare function encryptedSizeChk(plaintextSize: number): number;
+/**
+ * Encrypt data using AES-256-GCM with random IV
+ * @deprecated Use encryptChk for deterministic CHK encryption
+ *
+ * @param plaintext - Data to encrypt
+ * @param key - 32-byte encryption key
+ * @returns Encrypted data: [12-byte IV][ciphertext + 16-byte auth tag]
+ */
+export declare function encrypt(plaintext: Uint8Array, key: EncryptionKey): Promise<Uint8Array>;
+/**
+ * Decrypt data using AES-256-GCM
+ *
+ * @param encrypted - Encrypted data: [12-byte IV][ciphertext + auth tag]
+ * @param key - 32-byte encryption key
+ * @returns Decrypted plaintext
+ * @throws Error if decryption fails (wrong key or tampered data)
+ */
+export declare function decrypt(encrypted: Uint8Array, key: EncryptionKey): Promise<Uint8Array>;
+/**
+ * Check if data could be encrypted (based on minimum size).
+ * Note: This is a heuristic - actual encrypted data might be larger.
+ */
+export declare function couldBeEncrypted(data: Uint8Array): boolean;
+/**
+ * Calculate encrypted size for given plaintext size
+ */
+export declare function encryptedSize(plaintextSize: number): number;
+/**
+ * Calculate plaintext size from encrypted size
+ */
+export declare function plaintextSize(encryptedSize: number): number;
+/** Convert key to hex string */
+export declare function keyToHex(key: EncryptionKey): string;
+/** Convert hex string to key */
+export declare function keyFromHex(hex: string): EncryptionKey;
+//# sourceMappingURL=crypto.d.ts.map