@hashtree/core 0.1.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2025 Sirius Business Ltd.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/dist/bep52.d.ts

@@ -0,0 +1,179 @@
+/**
+ * BEP52 (BitTorrent v2) compatible merkle tree implementation
+ *
+ * Key differences from default hashtree:
+ * - 16 KiB block size (vs 256KB default)
+ * - Binary tree (2 children per node, not variable fanout)
+ * - Zero-padding for incomplete trees (pads to power of 2)
+ * - SHA256 hash algorithm
+ * - Piece layers: intermediate hash layers at piece boundaries
+ *
+ * @see https://www.bittorrent.org/beps/bep_0052.html
+ */
+import { Hash, Store } from './types.js';
+/**
+ * BEP52 block size: 16 KiB
+ */
+export declare const BEP52_BLOCK_SIZE: number;
+/**
+ * Zero hash (32 bytes of zeros) used for padding
+ */
+export declare const ZERO_HASH: Hash;
+/**
+ * Result of building a BEP52 merkle tree
+ */
+export interface Bep52Result {
+    /** Root hash (pieces root) */
+    root: Hash;
+    /** Total file size in bytes */
+    size: number;
+    /** Number of 16KB blocks */
+    blockCount: number;
+    /** Leaf hashes (one per block) */
+    leafHashes: Hash[];
+    /**
+     * Piece layer hashes at specified piece size
+     * Only populated if pieceSize > blockSize
+     */
+    pieceLayers?: Hash[];
+}
+/**
+ * Configuration for BEP52 tree building
+ */
+export interface Bep52Config {
+    /** Store for persisting blocks (optional - if not provided, only computes hashes) */
+    store?: Store;
+    /**
+     * Piece size for piece layers (must be power of 2, >= 16KB)
+     * Common values: 16KB (same as block), 32KB, 64KB, 128KB, 256KB, 512KB, 1MB, etc.
+     * If not specified, no piece layers are computed.
+     */
+    pieceSize?: number;
+}
+/**
+ * Compute the number of leaves needed (rounds up to power of 2)
+ */
+export declare function merkleNumLeafs(blocks: number): number;
+/**
+ * Get parent index in flat tree representation
+ * Tree layout: [0=root, 1=left, 2=right, 3=left-left, 4=left-right, ...]
+ */
+export declare function merkleGetParent(idx: number): number;
+/**
+ * Get sibling index
+ */
+export declare function merkleGetSibling(idx: number): number;
+/**
+ * Get first child index
+ */
+export declare function merkleGetFirstChild(idx: number): number;
+/**
+ * Get index of first leaf given number of leaves
+ */
+export declare function merkleFirstLeaf(numLeafs: number): number;
+/**
+ * Get total number of nodes in tree given number of leaves
+ */
+export declare function merkleNumNodes(numLeafs: number): number;
+/**
+ * Compute hash of two concatenated hashes (parent = H(left || right))
+ */
+export declare function merkleHashPair(left: Hash, right: Hash): Promise<Hash>;
+/**
+ * Compute the pad hash for a given depth
+ * pad(0) = zero hash
+ * pad(n) = H(pad(n-1) || pad(n-1))
+ */
+export declare function merklePadHash(depth: number): Promise<Hash>;
+/**
+ * Compute merkle root from leaf hashes with zero-padding
+ *
+ * @param leaves - Array of leaf hashes (one per 16KB block)
+ * @param numLeafs - Number of leaves in balanced tree (power of 2)
+ * @returns Root hash
+ */
+export declare function merkleRoot(leaves: Hash[], numLeafs?: number): Promise<Hash>;
+/**
+ * Build full merkle tree from leaves, returning all nodes
+ *
+ * @param leaves - Leaf hashes
+ * @returns Flat array of tree nodes [root, layer1..., leaves]
+ */
+export declare function merkleBuildTree(leaves: Hash[]): Promise<Hash[]>;
+/**
+ * Generate uncle hashes (proof) for a leaf
+ *
+ * @param tree - Full merkle tree
+ * @param leafIndex - Index of leaf in leaf layer (0-based)
+ * @param numLeafs - Number of leaves in tree
+ * @returns Array of uncle hashes from leaf to root
+ */
+export declare function merkleGetProof(tree: Hash[], leafIndex: number, numLeafs: number): Hash[];
+/**
+ * Verify a merkle proof
+ *
+ * @param leaf - Leaf hash to verify
+ * @param leafIndex - Position of leaf (0-based)
+ * @param proof - Uncle hashes from leaf to root
+ * @param root - Expected root hash
+ * @param numLeafs - Number of leaves in tree
+ * @returns True if proof is valid
+ */
+export declare function merkleVerifyProof(leaf: Hash, leafIndex: number, proof: Hash[], root: Hash, numLeafs: number): Promise<boolean>;
+/**
+ * BEP52 Tree Builder
+ *
+ * Builds a binary merkle tree compatible with BitTorrent v2.
+ */
+export declare class Bep52TreeBuilder {
+    private store?;
+    private pieceSize;
+    private blocksPerPiece;
+    constructor(config?: Bep52Config);
+    /**
+     * Build BEP52 merkle tree from file data
+     *
+     * @param data - File content
+     * @returns Tree result with root, leaf hashes, and optional piece layers
+     */
+    buildFromData(data: Uint8Array): Promise<Bep52Result>;
+    /**
+     * Compute piece layer hashes
+     * Each piece layer hash is the root of a subtree covering blocksPerPiece blocks
+     */
+    private computePieceLayers;
+    /**
+     * Build tree from pre-computed leaf hashes
+     */
+    buildFromHashes(leafHashes: Hash[], size: number): Promise<Bep52Result>;
+}
+/**
+ * Streaming BEP52 tree builder
+ * Allows incremental hashing without loading entire file into memory
+ */
+export declare class Bep52StreamBuilder {
+    private store?;
+    private buffer;
+    private bufferOffset;
+    private leafHashes;
+    private totalSize;
+    constructor(config?: Bep52Config);
+    /**
+     * Append data to the stream
+     */
+    append(data: Uint8Array): Promise<void>;
+    private flushBlock;
+    /**
+     * Finalize and return the tree result
+     */
+    finalize(): Promise<Bep52Result>;
+    /**
+     * Get current stats
+     */
+    get stats(): {
+        blocks: number;
+        buffered: number;
+        totalSize: number;
+    };
+}
+//# sourceMappingURL=bep52.d.ts.map

package/dist/bep52.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bep52.d.ts","sourceRoot":"","sources":["../src/bep52.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,IAAI,EAAE,KAAK,EAAc,MAAM,YAAY,CAAC;AAGrD;;GAEG;AACH,eAAO,MAAM,gBAAgB,QAAY,CAAC;AAE1C;;GAEG;AACH,eAAO,MAAM,SAAS,EAAE,IAAyB,CAAC;AAElD;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,8BAA8B;IAC9B,IAAI,EAAE,IAAI,CAAC;IACX,+BAA+B;IAC/B,IAAI,EAAE,MAAM,CAAC;IACb,4BAA4B;IAC5B,UAAU,EAAE,MAAM,CAAC;IACnB,kCAAkC;IAClC,UAAU,EAAE,IAAI,EAAE,CAAC;IACnB;;;OAGG;IACH,WAAW,CAAC,EAAE,IAAI,EAAE,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,qFAAqF;IACrF,KAAK,CAAC,EAAE,KAAK,CAAC;IACd;;;;OAIG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAKrD;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAEnD;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAGpD;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAEvD;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAExD;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAEvD;AAED;;GAEG;AACH,wBAAsB,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAK3E;AAED;;;;GAIG;AACH,wBAAsB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAMhE;AAED;;;;;;GAMG;AACH,wBAAsB,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,QAAQ,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAsCjF;AAED;;;;;GAKG;AACH,wBAAsB,eAAe,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CA8BrE;AAED;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI,EAAE,CAWxF;AAED;;;;;;;;;GASG;AACH,wBAAsB,iBAAiB,CACrC,IAAI,EAAE,IAAI,EACV,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,IAAI,EAAE,EACb,IAAI,EAAE,IAAI,EACV,QAAQ,EAAE,MAAM,GACf,OAAO,CAAC,OAAO,CAAC,CAkBlB;AAED;;;;GAIG;AACH,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,KAAK,CAAC,CAAQ;IACtB,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,cAAc,CAAS;gBAEnB,MAAM,GAAE,WAAgB;IAcpC;;;;;OAKG;IACG,aAAa,CAAC,IAAI,EAAE,UAAU,GAAG,OAAO,CAAC,WAAW,CAAC;IA+C3D;;;OAGG;YACW,kBAAkB;IAiBhC;;OAEG;IACG,eAAe,CAAC,UAAU,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC;CAkB9E;AAED;;;GAGG;AACH,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,KAAK,CAAC,CAAQ;IACtB,OAAO,CAAC,MAAM,CAAa;IAC3B,OAAO,CAAC,YAAY,CAAa;IACjC,OAAO,CAAC,UAAU,CAAc;IAChC,OAAO,CAAC,SAAS,CAAa;gBAElB,MAAM,GAAE,WAAgB;IAKpC;;OAEG;IACG,MAAM,CAAC,IAAI,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC;YAmB/B,UAAU;IAcxB;;OAEG;IACG,QAAQ,IAAI,OAAO,CAAC,WAAW,CAAC;IA0BtC;;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/bep52.js

@@ -0,0 +1,384 @@
+/**
+ * BEP52 (BitTorrent v2) compatible merkle tree implementation
+ *
+ * Key differences from default hashtree:
+ * - 16 KiB block size (vs 256KB default)
+ * - Binary tree (2 children per node, not variable fanout)
+ * - Zero-padding for incomplete trees (pads to power of 2)
+ * - SHA256 hash algorithm
+ * - Piece layers: intermediate hash layers at piece boundaries
+ *
+ * @see https://www.bittorrent.org/beps/bep_0052.html
+ */
+import { hashEquals } from './types.js';
+import { sha256 } from './hash.js';
+/**
+ * BEP52 block size: 16 KiB
+ */
+export const BEP52_BLOCK_SIZE = 16 * 1024;
+/**
+ * Zero hash (32 bytes of zeros) used for padding
+ */
+export const ZERO_HASH = new Uint8Array(32);
+/**
+ * Compute the number of leaves needed (rounds up to power of 2)
+ */
+export function merkleNumLeafs(blocks) {
+    if (blocks <= 0)
+        return 0;
+    let n = 1;
+    while (n < blocks)
+        n <<= 1;
+    return n;
+}
+/**
+ * Get parent index in flat tree representation
+ * Tree layout: [0=root, 1=left, 2=right, 3=left-left, 4=left-right, ...]
+ */
+export function merkleGetParent(idx) {
+    return Math.floor((idx - 1) / 2);
+}
+/**
+ * Get sibling index
+ */
+export function merkleGetSibling(idx) {
+    // Even indices have sibling to left, odd to right
+    return idx + ((idx & 1) ? 1 : -1);
+}
+/**
+ * Get first child index
+ */
+export function merkleGetFirstChild(idx) {
+    return idx * 2 + 1;
+}
+/**
+ * Get index of first leaf given number of leaves
+ */
+export function merkleFirstLeaf(numLeafs) {
+    return numLeafs - 1;
+}
+/**
+ * Get total number of nodes in tree given number of leaves
+ */
+export function merkleNumNodes(numLeafs) {
+    return numLeafs * 2 - 1;
+}
+/**
+ * Compute hash of two concatenated hashes (parent = H(left || right))
+ */
+export async function merkleHashPair(left, right) {
+    const combined = new Uint8Array(64);
+    combined.set(left, 0);
+    combined.set(right, 32);
+    return sha256(combined);
+}
+/**
+ * Compute the pad hash for a given depth
+ * pad(0) = zero hash
+ * pad(n) = H(pad(n-1) || pad(n-1))
+ */
+export async function merklePadHash(depth) {
+    let pad = ZERO_HASH;
+    for (let i = 0; i < depth; i++) {
+        pad = await merkleHashPair(pad, pad);
+    }
+    return pad;
+}
+/**
+ * Compute merkle root from leaf hashes with zero-padding
+ *
+ * @param leaves - Array of leaf hashes (one per 16KB block)
+ * @param numLeafs - Number of leaves in balanced tree (power of 2)
+ * @returns Root hash
+ */
+export async function merkleRoot(leaves, numLeafs) {
+    if (leaves.length === 0) {
+        return ZERO_HASH;
+    }
+    if (leaves.length === 1 && (numLeafs === undefined || numLeafs === 1)) {
+        return leaves[0];
+    }
+    const targetLeafs = numLeafs ?? merkleNumLeafs(leaves.length);
+    // Build tree bottom-up using scratch space
+    // This matches libtorrent's merkle_root_scratch approach
+    let current = leaves.slice();
+    let padHash = ZERO_HASH;
+    let levelSize = targetLeafs;
+    while (levelSize > 1) {
+        const nextLevel = [];
+        for (let i = 0; i < current.length; i += 2) {
+            if (i + 1 < current.length) {
+                // Both children present
+                nextLevel.push(await merkleHashPair(current[i], current[i + 1]));
+            }
+            else {
+                // Odd leaf - pair with pad
+                nextLevel.push(await merkleHashPair(current[i], padHash));
+            }
+        }
+        // Compute next level's pad hash (H(pad || pad))
+        padHash = await merkleHashPair(padHash, padHash);
+        current = nextLevel;
+        levelSize = levelSize / 2;
+    }
+    return current[0];
+}
+/**
+ * Build full merkle tree from leaves, returning all nodes
+ *
+ * @param leaves - Leaf hashes
+ * @returns Flat array of tree nodes [root, layer1..., leaves]
+ */
+export async function merkleBuildTree(leaves) {
+    if (leaves.length === 0) {
+        return [ZERO_HASH];
+    }
+    const numLeafs = merkleNumLeafs(leaves.length);
+    const numNodes = merkleNumNodes(numLeafs);
+    const tree = new Array(numNodes);
+    // Fill leaves (with zero-padding)
+    const firstLeaf = merkleFirstLeaf(numLeafs);
+    for (let i = 0; i < numLeafs; i++) {
+        tree[firstLeaf + i] = i < leaves.length ? leaves[i] : ZERO_HASH;
+    }
+    // Build parents bottom-up
+    let levelStart = firstLeaf;
+    let levelSize = numLeafs;
+    while (levelSize > 1) {
+        let parent = merkleGetParent(levelStart);
+        for (let i = levelStart; i < levelStart + levelSize; i += 2) {
+            tree[parent] = await merkleHashPair(tree[i], tree[i + 1]);
+            parent++;
+        }
+        levelStart = merkleGetParent(levelStart);
+        levelSize = levelSize / 2;
+    }
+    return tree;
+}
+/**
+ * Generate uncle hashes (proof) for a leaf
+ *
+ * @param tree - Full merkle tree
+ * @param leafIndex - Index of leaf in leaf layer (0-based)
+ * @param numLeafs - Number of leaves in tree
+ * @returns Array of uncle hashes from leaf to root
+ */
+export function merkleGetProof(tree, leafIndex, numLeafs) {
+    const proofs = [];
+    let idx = merkleFirstLeaf(numLeafs) + leafIndex;
+    while (idx > 0) {
+        const siblingIdx = merkleGetSibling(idx);
+        proofs.push(tree[siblingIdx]);
+        idx = merkleGetParent(idx);
+    }
+    return proofs;
+}
+/**
+ * Verify a merkle proof
+ *
+ * @param leaf - Leaf hash to verify
+ * @param leafIndex - Position of leaf (0-based)
+ * @param proof - Uncle hashes from leaf to root
+ * @param root - Expected root hash
+ * @param numLeafs - Number of leaves in tree
+ * @returns True if proof is valid
+ */
+export async function merkleVerifyProof(leaf, leafIndex, proof, root, numLeafs) {
+    let hash = leaf;
+    let idx = merkleFirstLeaf(numLeafs) + leafIndex;
+    for (const uncle of proof) {
+        // In flat tree: children of parent P are at 2P+1 (left) and 2P+2 (right)
+        // So odd indices are LEFT children, even indices are RIGHT children
+        if (idx & 1) {
+            // Odd index - we're on the left, uncle is on right
+            hash = await merkleHashPair(hash, uncle);
+        }
+        else {
+            // Even index - we're on the right, uncle is on left
+            hash = await merkleHashPair(uncle, hash);
+        }
+        idx = merkleGetParent(idx);
+    }
+    return hashEquals(hash, root);
+}
+/**
+ * BEP52 Tree Builder
+ *
+ * Builds a binary merkle tree compatible with BitTorrent v2.
+ */
+export class Bep52TreeBuilder {
+    store;
+    pieceSize;
+    blocksPerPiece;
+    constructor(config = {}) {
+        this.store = config.store;
+        this.pieceSize = config.pieceSize ?? BEP52_BLOCK_SIZE;
+        if (this.pieceSize < BEP52_BLOCK_SIZE) {
+            throw new Error(`Piece size must be >= ${BEP52_BLOCK_SIZE} (16KB)`);
+        }
+        if ((this.pieceSize & (this.pieceSize - 1)) !== 0) {
+            throw new Error('Piece size must be a power of 2');
+        }
+        this.blocksPerPiece = this.pieceSize / BEP52_BLOCK_SIZE;
+    }
+    /**
+     * Build BEP52 merkle tree from file data
+     *
+     * @param data - File content
+     * @returns Tree result with root, leaf hashes, and optional piece layers
+     */
+    async buildFromData(data) {
+        const size = data.length;
+        const blockCount = Math.ceil(size / BEP52_BLOCK_SIZE);
+        if (blockCount === 0) {
+            return {
+                root: ZERO_HASH,
+                size: 0,
+                blockCount: 0,
+                leafHashes: [],
+            };
+        }
+        // Hash each 16KB block
+        const leafHashes = [];
+        for (let i = 0; i < blockCount; i++) {
+            const start = i * BEP52_BLOCK_SIZE;
+            const end = Math.min(start + BEP52_BLOCK_SIZE, size);
+            const block = data.slice(start, end);
+            // Store block if store is provided
+            const hash = await sha256(block);
+            if (this.store) {
+                await this.store.put(hash, block);
+            }
+            leafHashes.push(hash);
+        }
+        // Compute root
+        const numLeafs = merkleNumLeafs(blockCount);
+        const root = await merkleRoot(leafHashes, numLeafs);
+        // Compute piece layers if piece size > block size
+        let pieceLayers;
+        if (this.pieceSize > BEP52_BLOCK_SIZE) {
+            pieceLayers = await this.computePieceLayers(leafHashes, numLeafs);
+        }
+        return {
+            root,
+            size,
+            blockCount,
+            leafHashes,
+            pieceLayers,
+        };
+    }
+    /**
+     * Compute piece layer hashes
+     * Each piece layer hash is the root of a subtree covering blocksPerPiece blocks
+     */
+    async computePieceLayers(leafHashes, _numLeafs) {
+        const pieceCount = Math.ceil(leafHashes.length / this.blocksPerPiece);
+        const layers = [];
+        for (let p = 0; p < pieceCount; p++) {
+            const start = p * this.blocksPerPiece;
+            const end = Math.min(start + this.blocksPerPiece, leafHashes.length);
+            const pieceLeaves = leafHashes.slice(start, end);
+            // Compute subtree root for this piece
+            const pieceRoot = await merkleRoot(pieceLeaves, this.blocksPerPiece);
+            layers.push(pieceRoot);
+        }
+        return layers;
+    }
+    /**
+     * Build tree from pre-computed leaf hashes
+     */
+    async buildFromHashes(leafHashes, size) {
+        const blockCount = leafHashes.length;
+        const numLeafs = merkleNumLeafs(blockCount);
+        const root = await merkleRoot(leafHashes, numLeafs);
+        let pieceLayers;
+        if (this.pieceSize > BEP52_BLOCK_SIZE) {
+            pieceLayers = await this.computePieceLayers(leafHashes, numLeafs);
+        }
+        return {
+            root,
+            size,
+            blockCount,
+            leafHashes,
+            pieceLayers,
+        };
+    }
+}
+/**
+ * Streaming BEP52 tree builder
+ * Allows incremental hashing without loading entire file into memory
+ */
+export class Bep52StreamBuilder {
+    store;
+    buffer;
+    bufferOffset = 0;
+    leafHashes = [];
+    totalSize = 0;
+    constructor(config = {}) {
+        this.store = config.store;
+        this.buffer = new Uint8Array(BEP52_BLOCK_SIZE);
+    }
+    /**
+     * Append data to the stream
+     */
+    async append(data) {
+        let offset = 0;
+        while (offset < data.length) {
+            const space = BEP52_BLOCK_SIZE - 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;
+            if (this.bufferOffset === BEP52_BLOCK_SIZE) {
+                await this.flushBlock();
+            }
+        }
+        this.totalSize += data.length;
+    }
+    async flushBlock() {
+        if (this.bufferOffset === 0)
+            return;
+        const block = this.buffer.slice(0, this.bufferOffset);
+        const hash = await sha256(block);
+        if (this.store) {
+            await this.store.put(hash, new Uint8Array(block));
+        }
+        this.leafHashes.push(hash);
+        this.bufferOffset = 0;
+    }
+    /**
+     * Finalize and return the tree result
+     */
+    async finalize() {
+        // Flush any remaining data
+        await this.flushBlock();
+        const blockCount = this.leafHashes.length;
+        if (blockCount === 0) {
+            return {
+                root: ZERO_HASH,
+                size: 0,
+                blockCount: 0,
+                leafHashes: [],
+            };
+        }
+        const numLeafs = merkleNumLeafs(blockCount);
+        const root = await merkleRoot(this.leafHashes, numLeafs);
+        return {
+            root,
+            size: this.totalSize,
+            blockCount,
+            leafHashes: this.leafHashes,
+        };
+    }
+    /**
+     * Get current stats
+     */
+    get stats() {
+        return {
+            blocks: this.leafHashes.length,
+            buffered: this.bufferOffset,
+            totalSize: this.totalSize,
+        };
+    }
+}
+//# sourceMappingURL=bep52.js.map

package/dist/bep52.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bep52.js","sourceRoot":"","sources":["../src/bep52.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAe,UAAU,EAAE,MAAM,YAAY,CAAC;AACrD,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAEnC;;GAEG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,EAAE,GAAG,IAAI,CAAC;AAE1C;;GAEG;AACH,MAAM,CAAC,MAAM,SAAS,GAAS,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;AAmClD;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,MAAc;IAC3C,IAAI,MAAM,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IAC1B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,MAAM;QAAE,CAAC,KAAK,CAAC,CAAC;IAC3B,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,GAAW;IACzC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACnC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,GAAW;IAC1C,kDAAkD;IAClD,OAAO,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,GAAW;IAC7C,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;AACrB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,QAAgB;IAC9C,OAAO,QAAQ,GAAG,CAAC,CAAC;AACtB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,QAAgB;IAC7C,OAAO,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC;AAC1B,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAAC,IAAU,EAAE,KAAW;IAC1D,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;IACpC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACtB,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IACxB,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC;AAC1B,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CAAC,KAAa;IAC/C,IAAI,GAAG,GAAG,SAAS,CAAC;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,GAAG,GAAG,MAAM,cAAc,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,MAAc,EAAE,QAAiB;IAChE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,CAAC,CAAC,EAAE,CAAC;QACtE,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;IAED,MAAM,WAAW,GAAG,QAAQ,IAAI,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAE9D,2CAA2C;IAC3C,yDAAyD;IACzD,IAAI,OAAO,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;IAC7B,IAAI,OAAO,GAAG,SAAS,CAAC;IACxB,IAAI,SAAS,GAAG,WAAW,CAAC;IAE5B,OAAO,SAAS,GAAG,CAAC,EAAE,CAAC;QACrB,MAAM,SAAS,GAAW,EAAE,CAAC;QAE7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3C,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;gBAC3B,wBAAwB;gBACxB,SAAS,CAAC,IAAI,CAAC,MAAM,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnE,CAAC;iBAAM,CAAC;gBACN,2BAA2B;gBAC3B,SAAS,CAAC,IAAI,CAAC,MAAM,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;YAC5D,CAAC;QACH,CAAC;QAED,gDAAgD;QAChD,OAAO,GAAG,MAAM,cAAc,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAEjD,OAAO,GAAG,SAAS,CAAC;QACpB,SAAS,GAAG,SAAS,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;AACpB,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CAAC,MAAc;IAClD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,CAAC,SAAS,CAAC,CAAC;IACrB,CAAC;IAED,MAAM,QAAQ,GAAG,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC/C,MAAM,QAAQ,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;IAC1C,MAAM,IAAI,GAAW,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC;IAEzC,kCAAkC;IAClC,MAAM,SAAS,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAClE,CAAC;IAED,0BAA0B;IAC1B,IAAI,UAAU,GAAG,SAAS,CAAC;IAC3B,IAAI,SAAS,GAAG,QAAQ,CAAC;IAEzB,OAAO,SAAS,GAAG,CAAC,EAAE,CAAC;QACrB,IAAI,MAAM,GAAG,eAAe,CAAC,UAAU,CAAC,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC,GAAG,UAAU,GAAG,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5D,IAAI,CAAC,MAAM,CAAC,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC1D,MAAM,EAAE,CAAC;QACX,CAAC;QACD,UAAU,GAAG,eAAe,CAAC,UAAU,CAAC,CAAC;QACzC,SAAS,GAAG,SAAS,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,cAAc,CAAC,IAAY,EAAE,SAAiB,EAAE,QAAgB;IAC9E,MAAM,MAAM,GAAW,EAAE,CAAC;IAC1B,IAAI,GAAG,GAAG,eAAe,CAAC,QAAQ,CAAC,GAAG,SAAS,CAAC;IAEhD,OAAO,GAAG,GAAG,CAAC,EAAE,CAAC;QACf,MAAM,UAAU,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;QACzC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QAC9B,GAAG,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;IAC7B,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,IAAU,EACV,SAAiB,EACjB,KAAa,EACb,IAAU,EACV,QAAgB;IAEhB,IAAI,IAAI,GAAG,IAAI,CAAC;IAChB,IAAI,GAAG,GAAG,eAAe,CAAC,QAAQ,CAAC,GAAG,SAAS,CAAC;IAEhD,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;QAC1B,yEAAyE;QACzE,oEAAoE;QACpE,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACZ,mDAAmD;YACnD,IAAI,GAAG,MAAM,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC3C,CAAC;aAAM,CAAC;YACN,oDAAoD;YACpD,IAAI,GAAG,MAAM,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC3C,CAAC;QACD,GAAG,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;IAC7B,CAAC;IAED,OAAO,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AAChC,CAAC;AAED;;;;GAIG;AACH,MAAM,OAAO,gBAAgB;IACnB,KAAK,CAAS;IACd,SAAS,CAAS;IAClB,cAAc,CAAS;IAE/B,YAAY,SAAsB,EAAE;QAClC,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;QAC1B,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,IAAI,gBAAgB,CAAC;QAEtD,IAAI,IAAI,CAAC,SAAS,GAAG,gBAAgB,EAAE,CAAC;YACtC,MAAM,IAAI,KAAK,CAAC,yBAAyB,gBAAgB,SAAS,CAAC,CAAC;QACtE,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YAClD,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;QACrD,CAAC;QAED,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,SAAS,GAAG,gBAAgB,CAAC;IAC1D,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,aAAa,CAAC,IAAgB;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QACzB,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,gBAAgB,CAAC,CAAC;QAEtD,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;YACrB,OAAO;gBACL,IAAI,EAAE,SAAS;gBACf,IAAI,EAAE,CAAC;gBACP,UAAU,EAAE,CAAC;gBACb,UAAU,EAAE,EAAE;aACf,CAAC;QACJ,CAAC;QAED,uBAAuB;QACvB,MAAM,UAAU,GAAW,EAAE,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,KAAK,GAAG,CAAC,GAAG,gBAAgB,CAAC;YACnC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,gBAAgB,EAAE,IAAI,CAAC,CAAC;YACrD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAErC,mCAAmC;YACnC,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,KAAK,CAAC,CAAC;YACjC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBACf,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACpC,CAAC;YACD,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;QAED,eAAe;QACf,MAAM,QAAQ,GAAG,cAAc,CAAC,UAAU,CAAC,CAAC;QAC5C,MAAM,IAAI,GAAG,MAAM,UAAU,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;QAEpD,kDAAkD;QAClD,IAAI,WAA+B,CAAC;QACpC,IAAI,IAAI,CAAC,SAAS,GAAG,gBAAgB,EAAE,CAAC;YACtC,WAAW,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;QACpE,CAAC;QAED,OAAO;YACL,IAAI;YACJ,IAAI;YACJ,UAAU;YACV,UAAU;YACV,WAAW;SACZ,CAAC;IACJ,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,kBAAkB,CAAC,UAAkB,EAAE,SAAiB;QACpE,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC;QACtE,MAAM,MAAM,GAAW,EAAE,CAAC;QAE1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC;YACtC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,cAAc,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;YACrE,MAAM,WAAW,GAAG,UAAU,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAEjD,sCAAsC;YACtC,MAAM,SAAS,GAAG,MAAM,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;YACrE,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACzB,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,eAAe,CAAC,UAAkB,EAAE,IAAY;QACpD,MAAM,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC;QACrC,MAAM,QAAQ,GAAG,cAAc,CAAC,UAAU,CAAC,CAAC;QAC5C,MAAM,IAAI,GAAG,MAAM,UAAU,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;QAEpD,IAAI,WAA+B,CAAC;QACpC,IAAI,IAAI,CAAC,SAAS,GAAG,gBAAgB,EAAE,CAAC;YACtC,WAAW,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;QACpE,CAAC;QAED,OAAO;YACL,IAAI;YACJ,IAAI;YACJ,UAAU;YACV,UAAU;YACV,WAAW;SACZ,CAAC;IACJ,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,kBAAkB;IACrB,KAAK,CAAS;IACd,MAAM,CAAa;IACnB,YAAY,GAAW,CAAC,CAAC;IACzB,UAAU,GAAW,EAAE,CAAC;IACxB,SAAS,GAAW,CAAC,CAAC;IAE9B,YAAY,SAAsB,EAAE;QAClC,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;QAC1B,IAAI,CAAC,MAAM,GAAG,IAAI,UAAU,CAAC,gBAAgB,CAAC,CAAC;IACjD,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,KAAK,GAAG,gBAAgB,GAAG,IAAI,CAAC,YAAY,CAAC;YACnD,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,IAAI,IAAI,CAAC,YAAY,KAAK,gBAAgB,EAAE,CAAC;gBAC3C,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC;IAChC,CAAC;IAEO,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;QAEjC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC;QACpD,CAAC;QAED,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ;QACZ,2BAA2B;QAC3B,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QAExB,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAE1C,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;YACrB,OAAO;gBACL,IAAI,EAAE,SAAS;gBACf,IAAI,EAAE,CAAC;gBACP,UAAU,EAAE,CAAC;gBACb,UAAU,EAAE,EAAE;aACf,CAAC;QACJ,CAAC;QAED,MAAM,QAAQ,GAAG,cAAc,CAAC,UAAU,CAAC,CAAC;QAC5C,MAAM,IAAI,GAAG,MAAM,UAAU,CAAC,IAAI,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;QAEzD,OAAO;YACL,IAAI;YACJ,IAAI,EAAE,IAAI,CAAC,SAAS;YACpB,UAAU;YACV,UAAU,EAAE,IAAI,CAAC,UAAU;SAC5B,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,IAAI,KAAK;QACP,OAAO;YACL,MAAM,EAAE,IAAI,CAAC,UAAU,CAAC,MAAM;YAC9B,QAAQ,EAAE,IAAI,CAAC,YAAY;YAC3B,SAAS,EAAE,IAAI,CAAC,SAAS;SAC1B,CAAC;IACJ,CAAC;CACF"}