postchain-client 1.22.0 → 2.0.1

package/built/src/merkle/binarytree.js

@@ -1,146 +0,0 @@
-"use strict";
-var PathLeafElement = require('./path').PathLeafElement;
-const HASH_PREFIX_NODE = 0;
-const HASH_PREFIX_LEAF = 1;
-const HASH_PREFIX_NODE_ARRAY = 7;
-const HASH_PREFIX_NODE_DICT = 8;
-/**
- *
- */
-function BinaryTreeElement() {
-    this.pathElem = null;
-}
-BinaryTreeElement.prototype.isPath = function () {
-    return this.pathElem != null;
-};
-BinaryTreeElement.prototype.isPathLeaf = function () {
-    if (this.pathElem == null) {
-        return false;
-    }
-    if (this.pathElem instanceof PathLeafElement) {
-        return true;
-    }
-    else {
-        return false;
-    }
-};
-BinaryTreeElement.prototype.setPathElement = function (pathElem) {
-    this.pathElem = pathElem;
-};
-BinaryTreeElement.prototype.getPrefixByte = function () {
-    return HASH_PREFIX_NODE;
-};
-/**
- *
- * @param {BinaryTreeElement} left
- * @param {BinaryTreeElement} right
- */
-function Node(left, right) {
-    this.left = left;
-    this.right = right;
-}
-Node.prototype = Object.create(BinaryTreeElement.prototype);
-Node.prototype.constructor = Node;
-Node.prototype.getPrefixByte = function () {
-    return HASH_PREFIX_NODE;
-};
-/**
- *
- * @param {BinaryTreeElement} left
- * @param {BinaryTreeElement} right
- * @param {*} content
- * @param {PathSet} pathElem
- */
-function SubTreeRootNode(left, right, content, pathElem) {
-    Node.call(this, left, right);
-    this.content = content;
-    BinaryTreeElement.prototype.setPathElement.call(this, pathElem);
-}
-SubTreeRootNode.prototype = Object.create(Node.prototype);
-SubTreeRootNode.prototype.constructor = SubTreeRootNode;
-/**
- *
- * @param {*} content
- * @param {PathElement} pathElem
- */
-function Leaf(content, pathElem = null) {
-    this.content = content;
-    if (pathElem != null) {
-        if (pathElem instanceof PathLeafElement) {
-            BinaryTreeElement.prototype.setPathElement.call(this, pathElem);
-        }
-        else {
-            throw new Error("The path and object structure does not match! We are at a leaf, but the path expects a sub structure.");
-        }
-    }
-}
-Leaf.prototype = Object.create(BinaryTreeElement.prototype);
-Leaf.prototype.constructor = Leaf;
-Leaf.prototype.getPrefixByte = function () {
-    return HASH_PREFIX_LEAF;
-};
-function EmptyLeaf() { }
-EmptyLeaf.prototype = Object.create(BinaryTreeElement.prototype);
-EmptyLeaf.prototype.constructor = EmptyLeaf;
-/**
- * Wrapper class for the root object.
- * @param {BinaryTreeElement} root
- */
-function BinaryTree(root) {
-    this.root = root;
-}
-BinaryTree.prototype.maxLevel = function () {
-    return this.maxLevelInternal(this.root);
-};
-BinaryTree.prototype.maxLevelInternal = function (node) {
-    if (node instanceof EmptyLeaf) {
-        return 0;
-    }
-    else if (node instanceof Leaf) {
-        return 1;
-    }
-    else if (node instanceof Node) {
-        return Math.max(this.maxLevelInternal(node.left), this.maxLevelInternal(node.right)) + 1;
-    }
-    else {
-        throw new Error("What is this type? " + typeof node);
-    }
-};
-/**
- * Represents the top of a sub tree generated by a [Array]
- *
- * @param {*} left
- * @param {*} right
- * @param {*} content
- * @param {*} size
- * @param {PathElement} pathElem
- */
-function ArrayHeadNode(left, right, content, size, pathElem = null) {
-    SubTreeRootNode.call(this, left, right, content, pathElem);
-    this.size = size;
-}
-ArrayHeadNode.prototype = Object.create(SubTreeRootNode.prototype);
-ArrayHeadNode.prototype.constructor = ArrayHeadNode;
-ArrayHeadNode.prototype.getPrefixByte = function () {
-    return HASH_PREFIX_NODE_ARRAY;
-};
-/**
- * Represents the top a sub tree generated by a [Dictionary]
- * @param {*} left
- * @param {*} right
- * @param {*} content
- * @param {*} size
- * @param {PathElement} pathElem
- */
-function DictHeadNode(left, right, content, size, pathElem = null) {
-    SubTreeRootNode.call(this, left, right, content, pathElem);
-    this.size = size;
-}
-DictHeadNode.prototype = Object.create(SubTreeRootNode.prototype);
-DictHeadNode.prototype.constructor = DictHeadNode;
-DictHeadNode.prototype.getPrefixByte = function () {
-    return HASH_PREFIX_NODE_DICT;
-};
-module.exports = { HASH_PREFIX_NODE, HASH_PREFIX_LEAF, HASH_PREFIX_NODE_ARRAY, HASH_PREFIX_NODE_DICT,
-    Node, Leaf, EmptyLeaf, SubTreeRootNode, BinaryTreeElement, BinaryTree, ArrayHeadNode, DictHeadNode };
-//# sourceMappingURL=binarytree.js.map

package/built/src/merkle/binarytree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"binarytree.js","sourceRoot":"","sources":["../../../src/merkle/binarytree.js"],"names":[],"mappings":"AAAA,YAAY,CAAA;AAEZ,IAAI,eAAe,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC,eAAe,CAAA;AAEvD,MAAM,gBAAgB,GAAG,CAAC,CAAA;AAC1B,MAAM,gBAAgB,GAAG,CAAC,CAAA;AAC1B,MAAM,sBAAsB,GAAG,CAAC,CAAA;AAChC,MAAM,qBAAqB,GAAG,CAAC,CAAA;AAE/B;;GAEG;AACH,SAAS,iBAAiB;IACxB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAA;AACtB,CAAC;AACD,iBAAiB,CAAC,SAAS,CAAC,MAAM,GAAG;IACnC,OAAO,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAA;AAC9B,CAAC,CAAA;AACD,iBAAiB,CAAC,SAAS,CAAC,UAAU,GAAG;IACvC,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,EAAE,CAAC;QAC1B,OAAO,KAAK,CAAA;IACd,CAAC;IACD,IAAI,IAAI,CAAC,QAAQ,YAAY,eAAe,EAAE,CAAC;QAC7C,OAAO,IAAI,CAAA;IACb,CAAC;SAAM,CAAC;QACN,OAAO,KAAK,CAAA;IACd,CAAC;AACH,CAAC,CAAA;AACD,iBAAiB,CAAC,SAAS,CAAC,cAAc,GAAG,UAAS,QAAQ;IAC5D,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;AAC1B,CAAC,CAAA;AACD,iBAAiB,CAAC,SAAS,CAAC,aAAa,GAAG;IAC1C,OAAO,gBAAgB,CAAC;AAC1B,CAAC,CAAA;AAED;;;;GAIG;AACH,SAAS,IAAI,CAAC,IAAI,EAAE,KAAK;IACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACjB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;AACrB,CAAC;AAED,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAA;AAC3D,IAAI,CAAC,SAAS,CAAC,WAAW,GAAG,IAAI,CAAA;AAEjC,IAAI,CAAC,SAAS,CAAC,aAAa,GAAG;IAC7B,OAAO,gBAAgB,CAAC;AAC1B,CAAC,CAAA;AAED;;;;;;GAMG;AACH,SAAS,eAAe,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ;IACrD,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;IAC5B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;IACtB,iBAAiB,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;AACjE,CAAC;AAED,eAAe,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;AACzD,eAAe,CAAC,SAAS,CAAC,WAAW,GAAG,eAAe,CAAA;AAEvD;;;;GAIG;AACH,SAAS,IAAI,CAAC,OAAO,EAAE,QAAQ,GAAC,IAAI;IAClC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;IACtB,IAAI,QAAQ,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,QAAQ,YAAY,eAAe,EAAE,CAAC;YACxC,iBAAiB,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;QACjE,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,KAAK,CAAC,uGAAuG,CAAC,CAAA;QAC1H,CAAC;IACH,CAAC;AACH,CAAC;AAED,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAA;AAC3D,IAAI,CAAC,SAAS,CAAC,WAAW,GAAG,IAAI,CAAA;AAEjC,IAAI,CAAC,SAAS,CAAC,aAAa,GAAG;IAC7B,OAAO,gBAAgB,CAAA;AACzB,CAAC,CAAA;AAED,SAAS,SAAS,KAAI,CAAC;AACvB,SAAS,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAA;AAChE,SAAS,CAAC,SAAS,CAAC,WAAW,GAAG,SAAS,CAAA;AAE3C;;;GAGG;AACH,SAAS,UAAU,CAAC,IAAI;IACtB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;AAClB,CAAC;AAED,UAAU,CAAC,SAAS,CAAC,QAAQ,GAAG;IAC9B,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AACzC,CAAC,CAAA;AAED,UAAU,CAAC,SAAS,CAAC,gBAAgB,GAAG,UAAS,IAAI;IACnD,IAAI,IAAI,YAAY,SAAS,EAAE,CAAC;QAC9B,OAAO,CAAC,CAAA;IACV,CAAC;SAAM,IAAI,IAAI,YAAY,IAAI,EAAE,CAAC;QAChC,OAAO,CAAC,CAAA;IACV,CAAC;SAAM,IAAI,IAAI,YAAY,IAAI,EAAE,CAAC;QAChC,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAA;IAC1F,CAAC;SAAM,CAAC;QACN,MAAM,IAAI,KAAK,CAAC,qBAAqB,GAAG,OAAO,IAAI,CAAC,CAAA;IACtD,CAAC;AACH,CAAC,CAAA;AAED;;;;;;;;GAQG;AACH,SAAS,aAAa,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,GAAC,IAAI;IAC9D,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAA;IAC1D,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;AAClB,CAAC;AAED,aAAa,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC,SAAS,CAAC,CAAA;AAClE,aAAa,CAAC,SAAS,CAAC,WAAW,GAAG,aAAa,CAAA;AACnD,aAAa,CAAC,SAAS,CAAC,aAAa,GAAG;IACtC,OAAO,sBAAsB,CAAA;AAC/B,CAAC,CAAA;AAED;;;;;;;GAOG;AACH,SAAS,YAAY,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,GAAC,IAAI;IAC7D,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAA;IAC1D,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;AAClB,CAAC;AAED,YAAY,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC,SAAS,CAAC,CAAA;AACjE,YAAY,CAAC,SAAS,CAAC,WAAW,GAAG,YAAY,CAAA;AACjD,YAAY,CAAC,SAAS,CAAC,aAAa,GAAG;IACrC,OAAO,qBAAqB,CAAA;AAC9B,CAAC,CAAA;AAED,MAAM,CAAC,OAAO,GAAG,EAAC,gBAAgB,EAAE,gBAAgB,EAAE,sBAAsB,EAAE,qBAAqB;IACjG,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,eAAe,EAAE,iBAAiB,EAAE,UAAU,EAAE,aAAa,EAAE,YAAY,EAAC,CAAA"}

package/built/src/merkle/binarytreefactory.d.ts

@@ -1,86 +0,0 @@
-/**
- * The factory does the conversion between list of elements and tree of elements.
- *
- * Note: The idea is that you should sub class for each type of element you want to build.
- */
-export function BinaryTreeFactory(): void;
-export class BinaryTreeFactory {
-    /**
-     * Transforms the incoming leaf into an [BinaryTreeElement]
-     * The idea with this function is that it can be recursive (if the leaf in turn is complex object with sub objects).
-     *
-     * Note: If we don't have a path here we can try to find the leaf in the cache.
-     *
-     * @param leaf the raw data we should wrap in a leaf
-     * @param paths a collection of proof paths that might point to this leaf
-     * @return the resulting [BinaryTreeElement] the leaf got converted to
-     */
-    handleLeaf(leaf: any, paths: any, isRoot: boolean | undefined, merkleHashVersion: any): Leaf | ArrayHeadNode | DictHeadNode;
-    /**
-     *
-     */
-    getEmptyPathSet(): PathSet;
-    /**
-     * At this point we should have looked in cache.
-     *
-     * @param leaf we should turn into a tree element
-     * @param {PathSet} paths
-     * @return the tree element we created.
-     */
-    innerHandleLeaf(leaf: any, paths: PathSet, merkleHashVersion: any): Leaf | ArrayHeadNode | DictHeadNode;
-    /**
-     * Just like [handleLeaf] but we know that this leaf should not be a complex type, but something we can
-     * immediately wrap
-     *
-     * @param leaf
-     * @param {PathSet} paths
-     */
-    handlePrimitiveLeaf(leaf: any, paths: PathSet): Leaf;
-    /**
-     * Calls itself until the return value only holds 1 element
-     *
-     * Note: This method can only create standard [Node] that fills up the area between the "top" and the leaves.
-     *        These "in-between" nodes cannot be "path leaf" or have any interesting properties.
-     *
-     * @param layer What layer we aim calculate
-     * @param inList The args of nodes we should build from
-     * @return All [BinaryTreeElement] nodes of the next layer
-     */
-    buildHigherLayer(layer: any, inList: any): any;
-    build(data: any, merkleHashVersion: any): BinaryTree;
-    /**
-     * @param {PathSet} paths
-     */
-    buildWithPath(data: any, paths: PathSet, merkleHashVersion: any): BinaryTree;
-    /**
-     * @param {Array} array
-     * @param {PathSet} paths
-     */
-    buildFromArray(array: any[], paths: PathSet, merkleHashVersion: any): ArrayHeadNode;
-    /**
-     *
-     */
-    buildFromOneLeaf(array: any, orgRoot: any, pathElem: any): ArrayHeadNode;
-    /**
-     * @param {PathSet} paths
-     */
-    buildLeafElements(leafList: any, paths: PathSet, merkleHashVersion: any): any[];
-    /**
-     * @param {PathSet} paths
-     */
-    buildFromDictionary(dict: any, paths: PathSet, merkleHashVersion: any): DictHeadNode;
-    /**
-     * @param {PathSet} paths
-     */
-    buildLeafElementFromDict(keys: any, dict: any, paths: PathSet, merkleHashVersion: any): any[];
-}
-import Leaf_1 = require("./binarytree");
-import Leaf = Leaf_1.Leaf;
-import ArrayHeadNode_1 = require("./binarytree");
-import ArrayHeadNode = ArrayHeadNode_1.ArrayHeadNode;
-import DictHeadNode_1 = require("./binarytree");
-import DictHeadNode = DictHeadNode_1.DictHeadNode;
-import PathSet_1 = require("./path");
-import PathSet = PathSet_1.PathSet;
-import BinaryTree_1 = require("./binarytree");
-import BinaryTree = BinaryTree_1.BinaryTree;

package/built/src/merkle/binarytreefactory.js

@@ -1,251 +0,0 @@
-"use strict";
-var util = require('../formatter');
-const { Buffer } = require('buffer');
-var PathSet = require('./path').PathSet;
-var PathLeafElement = require('./path').PathLeafElement;
-var EmptyLeaf = require('./binarytree').EmptyLeaf;
-var Leaf = require('./binarytree').Leaf;
-var Node = require('./binarytree').Node;
-var BinaryTree = require('./binarytree').BinaryTree;
-var ArrayHeadNode = require('./binarytree').ArrayHeadNode;
-var DictHeadNode = require('./binarytree').DictHeadNode;
-const NO_PATHS = new PathSet([]);
-/**
- * The factory does the conversion between list of elements and tree of elements.
- *
- * Note: The idea is that you should sub class for each type of element you want to build.
- */
-function BinaryTreeFactory() { }
-/**
- * Transforms the incoming leaf into an [BinaryTreeElement]
- * The idea with this function is that it can be recursive (if the leaf in turn is complex object with sub objects).
- *
- * Note: If we don't have a path here we can try to find the leaf in the cache.
- *
- * @param leaf the raw data we should wrap in a leaf
- * @param paths a collection of proof paths that might point to this leaf
- * @return the resulting [BinaryTreeElement] the leaf got converted to
- */
-BinaryTreeFactory.prototype.handleLeaf = function (leaf, paths, isRoot = false, merkleHashVersion) {
-    if (merkleHashVersion == undefined || merkleHashVersion == null) {
-        console.error("stack trace", new Error().stack);
-        throw new Error("Merkle hash version is undefined or null");
-    }
-    if (paths.length == 0 && !isRoot) {
-        return this.innerHandleLeaf(leaf, this.getEmptyPathSet(), merkleHashVersion);
-    }
-    else {
-        return this.innerHandleLeaf(leaf, paths, merkleHashVersion);
-    }
-};
-/**
- *
- */
-BinaryTreeFactory.prototype.getEmptyPathSet = function () {
-    return NO_PATHS;
-};
-/**
- * At this point we should have looked in cache.
- *
- * @param leaf we should turn into a tree element
- * @param {PathSet} paths
- * @return the tree element we created.
- */
-BinaryTreeFactory.prototype.innerHandleLeaf = function (leaf, paths, merkleHashVersion) {
-    if (leaf == null) {
-        return this.handlePrimitiveLeaf(leaf, paths);
-    }
-    if (Buffer.isBuffer(leaf)) {
-        return this.handlePrimitiveLeaf(leaf, paths);
-    }
-    if (typeof leaf === 'string') {
-        return this.handlePrimitiveLeaf(leaf, paths);
-    }
-    if (typeof leaf === 'number') {
-        return this.handlePrimitiveLeaf(leaf, paths);
-    }
-    if (typeof leaf === 'bigint') {
-        return this.handlePrimitiveLeaf(leaf, paths);
-    }
-    if (typeof leaf === 'boolean') {
-        return this.handlePrimitiveLeaf(leaf ? 1 : 0, paths);
-    }
-    if (leaf.constructor === Array) {
-        return this.buildFromArray(leaf, paths, merkleHashVersion);
-    }
-    if (typeof leaf === 'object') {
-        return this.buildFromDictionary(leaf, paths, merkleHashVersion);
-    }
-    else {
-        throw new Error("Unsupported data type");
-    }
-};
-/**
- * Just like [handleLeaf] but we know that this leaf should not be a complex type, but something we can
- * immediately wrap
- *
- * @param leaf
- * @param {PathSet} paths
- */
-BinaryTreeFactory.prototype.handlePrimitiveLeaf = function (leaf, paths) {
-    var pathElem = paths.getPathLeafOrElseAnyCurrentPathElement();
-    if (pathElem != null && !(pathElem instanceof PathLeafElement)) {
-        throw new Error("Path does not match the tree structure. We are at a leaf " + leaf + " but found path element " + pathElem);
-    }
-    return new Leaf(leaf, pathElem);
-};
-/**
- * Calls itself until the return value only holds 1 element
- *
- * Note: This method can only create standard [Node] that fills up the area between the "top" and the leaves.
- *        These "in-between" nodes cannot be "path leaf" or have any interesting properties.
- *
- * @param layer What layer we aim calculate
- * @param inList The args of nodes we should build from
- * @return All [BinaryTreeElement] nodes of the next layer
- */
-BinaryTreeFactory.prototype.buildHigherLayer = function (layer, inList) {
-    if (inList.length === 0) {
-        throw new Error("Cannot work on empty arrays. Layer: " + layer);
-    }
-    else if (inList.length === 1) {
-        return inList;
-    }
-    var returnArray = new Array();
-    var nrOfNodesToCreate = Math.floor(inList.length / 2);
-    var leftValue = null;
-    var isLeft = true;
-    for (var i = 0; i < inList.length; i++) {
-        if (isLeft) {
-            leftValue = inList[i];
-            isLeft = false;
-        }
-        else {
-            var tempNode = new Node(leftValue, inList[i]);
-            returnArray.push(tempNode);
-            nrOfNodesToCreate--;
-            isLeft = true;
-            leftValue = null;
-        }
-    }
-    if (!isLeft) {
-        // If there is odd number of nodes, then move the last node up one level
-        returnArray.push(leftValue);
-    }
-    // Extra check
-    if (nrOfNodesToCreate != 0) {
-        util.logDebug("Why didn't we build exactly the correct amount? Layer: " + layer + " , residue: " + nrOfNodesToCreate + " , input args size: " + inList.length + ".");
-    }
-    return this.buildHigherLayer((layer + 1), returnArray);
-};
-BinaryTreeFactory.prototype.build = function (data, merkleHashVersion) {
-    return this.buildWithPath(data, NO_PATHS, merkleHashVersion);
-};
-/**
- * @param {PathSet} paths
- */
-BinaryTreeFactory.prototype.buildWithPath = function (data, paths, merkleHashVersion) {
-    var result = this.handleLeaf(data, paths, true, merkleHashVersion);
-    return new BinaryTree(result);
-};
-/**
- * @param {Array} array
- * @param {PathSet} paths
- */
-BinaryTreeFactory.prototype.buildFromArray = function (array, paths, merkleHashVersion) {
-    if (merkleHashVersion == undefined || merkleHashVersion == null) {
-        console.error("stack trace", new Error().stack);
-        throw new Error("Merkle hash version is undefined or null");
-    }
-    var pathElem = paths.getPathLeafOrElseAnyCurrentPathElement();
-    // 1. Build leaf layer
-    if (array.length == 0) {
-        return new ArrayHeadNode(new EmptyLeaf(), new EmptyLeaf(), array, 0, 0, pathElem);
-    }
-    var leafArray = this.buildLeafElements(array, paths, merkleHashVersion);
-    //Merkle hash version 2 and above - check
-    if (leafArray.length == 1 && leafArray[0] instanceof Node && merkleHashVersion >= 2) {
-        return new ArrayHeadNode(leafArray[0], new EmptyLeaf(), array, array.length, pathElem);
-    }
-    // 2. Build all higher layers
-    var result = this.buildHigherLayer(1, leafArray);
-    // 3. Fix and return the root node
-    var orgRoot = result[0];
-    if (orgRoot instanceof Node) {
-        return new ArrayHeadNode(orgRoot.left, orgRoot.right, array, array.length, pathElem);
-    }
-    if (orgRoot instanceof Leaf) {
-        return this.buildFromOneLeaf(array, orgRoot, pathElem);
-    }
-    else {
-        throw new Error("Should not find element of this type here");
-    }
-};
-/**
- *
- */
-BinaryTreeFactory.prototype.buildFromOneLeaf = function (array, orgRoot, pathElem) {
-    if (array.length > 1) {
-        throw new Error("How come we got a leaf returned when we had " + array.length + " elements is the args?");
-    }
-    else {
-        return new ArrayHeadNode(orgRoot, new EmptyLeaf(), array, array.length, pathElem);
-    }
-};
-/**
- * @param {PathSet} paths
- */
-BinaryTreeFactory.prototype.buildLeafElements = function (leafList, paths, merkleHashVersion) {
-    var leafArray = new Array();
-    var onlyArrayPaths = paths.keepOnlyArrayPaths(); // For performance, since we will loop soon
-    for (var i = 0; i < leafList.length; i++) {
-        var pathsRelevantForThisLeaf = onlyArrayPaths.getTailIfFirstElementIsArrayOfThisIndexFromList(i);
-        var leaf = leafList[i];
-        var binaryTreeElement = this.handleLeaf(leaf, pathsRelevantForThisLeaf, false, merkleHashVersion);
-        leafArray.push(binaryTreeElement);
-    }
-    return leafArray;
-};
-/**
- * @param {PathSet} paths
- */
-BinaryTreeFactory.prototype.buildFromDictionary = function (dict, paths, merkleHashVersion) {
-    var pathElem = paths.getPathLeafOrElseAnyCurrentPathElement();
-    // Needs to be sorted, or else the order is undefined
-    var keys = Object.keys(dict).sort();
-    if (keys.length == 0) {
-        return new DictHeadNode(new EmptyLeaf(), new EmptyLeaf(), dict, keys.length, 0, pathElem);
-    }
-    // 1. Build first (leaf) layer
-    var leafArray = this.buildLeafElementFromDict(keys, dict, paths, merkleHashVersion);
-    // 2. Build all higher layers
-    var result = this.buildHigherLayer(1, leafArray);
-    // 3. Fix and return the root node
-    var orgRoot = result[0];
-    if (orgRoot instanceof Node) {
-        return new DictHeadNode(orgRoot.left, orgRoot.right, dict, keys.length, pathElem);
-    }
-    else {
-        throw new Error("Should not find element of this type here: " + typeof orgRoot);
-    }
-};
-/**
- * @param {PathSet} paths
- */
-BinaryTreeFactory.prototype.buildLeafElementFromDict = function (keys, dict, paths, merkleHashVersion) {
-    var leafArray = new Array();
-    var onlyDictPaths = paths.keepOnlyDictPaths(); // For performance, since we will loop soon
-    for (var i = 0; i < keys.length; i++) {
-        // The key cannot not be proved, so NO_PATHS
-        var key = keys[i];
-        var keyElement = this.handleLeaf(key, NO_PATHS, false, merkleHashVersion);
-        leafArray.push(keyElement);
-        var content = dict[key];
-        var pathsRelevantForThisLeaf = onlyDictPaths.getTailIfFirstElementIsDictOfThisKeyFromList(key);
-        var contentElement = this.handleLeaf(content, pathsRelevantForThisLeaf, false, merkleHashVersion);
-        leafArray.push(contentElement);
-    }
-    return leafArray;
-};
-module.exports = { BinaryTreeFactory };
-//# sourceMappingURL=binarytreefactory.js.map

package/built/src/merkle/binarytreefactory.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"binarytreefactory.js","sourceRoot":"","sources":["../../../src/merkle/binarytreefactory.js"],"names":[],"mappings":"AAAA,YAAY,CAAA;AAEZ,IAAI,IAAI,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC;AACnC,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;AACrC,IAAI,OAAO,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAA;AACvC,IAAI,eAAe,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC,eAAe,CAAA;AACvD,IAAI,SAAS,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC,SAAS,CAAA;AACjD,IAAI,IAAI,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC,IAAI,CAAA;AACvC,IAAI,IAAI,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC,IAAI,CAAA;AACvC,IAAI,UAAU,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC,UAAU,CAAA;AACnD,IAAI,aAAa,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC,aAAa,CAAA;AACzD,IAAI,YAAY,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC,YAAY,CAAA;AAEvD,MAAM,QAAQ,GAAG,IAAI,OAAO,CAAC,EAAE,CAAC,CAAA;AAEhC;;;;GAIG;AACH,SAAS,iBAAiB,KAAI,CAAC;AAE7B;;;;;;;;;GASG;AACH,iBAAiB,CAAC,SAAS,CAAC,UAAU,GAAG,UAAS,IAAI,EAAE,KAAK,EAAE,MAAM,GAAC,KAAK,EAAE,iBAAiB;IAC5F,IAAG,iBAAiB,IAAI,SAAS,IAAI,iBAAiB,IAAI,IAAI,EAAE,CAAC;QAC/D,OAAO,CAAC,KAAK,CAAC,aAAa,EAAE,IAAI,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC;QAChD,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;IAC9D,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;QACjC,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,eAAe,EAAE,EAAE,iBAAiB,CAAC,CAAA;IAC9E,CAAC;SAAM,CAAC;QACN,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,KAAK,EAAE,iBAAiB,CAAC,CAAA;IAC7D,CAAC;AACH,CAAC,CAAA;AAED;;GAEG;AACH,iBAAiB,CAAC,SAAS,CAAC,eAAe,GAAG;IAC5C,OAAO,QAAQ,CAAA;AACjB,CAAC,CAAA;AAED;;;;;;GAMG;AACH,iBAAiB,CAAC,SAAS,CAAC,eAAe,GAAG,UAAS,IAAI,EAAE,KAAK,EAAE,iBAAiB;IACnF,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;QACjB,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;IAC9C,CAAC;IACD,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1B,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;IAC9C,CAAC;IACD,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC7B,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;IAC9C,CAAC;IACD,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC7B,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;IAC9C,CAAC;IACD,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC7B,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;IAC9C,CAAC;IACD,IAAI,OAAO,IAAI,KAAK,SAAS,EAAE,CAAC;QAC9B,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAA,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;IACrD,CAAC;IACD,IAAI,IAAI,CAAC,WAAW,KAAK,KAAK,EAAE,CAAC;QAC/B,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,KAAK,EAAE,iBAAiB,CAAC,CAAA;IAC5D,CAAC;IACD,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC7B,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,KAAK,EAAE,iBAAiB,CAAC,CAAA;IACjE,CAAC;SAAM,CAAC;QACN,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAA;IAC1C,CAAC;AACH,CAAC,CAAA;AAED;;;;;;GAMG;AACH,iBAAiB,CAAC,SAAS,CAAC,mBAAmB,GAAG,UAAS,IAAI,EAAE,KAAK;IACpE,IAAI,QAAQ,GAAG,KAAK,CAAC,sCAAsC,EAAE,CAAA;IAC7D,IAAI,QAAQ,IAAI,IAAI,IAAI,CAAC,CAAC,QAAQ,YAAY,eAAe,CAAC,EAAE,CAAC;QAC7D,MAAM,IAAI,KAAK,CAAC,2DAA2D,GAAG,IAAI,GAAG,0BAA0B,GAAG,QAAQ,CAAC,CAAA;IAC/H,CAAC;IACD,OAAO,IAAI,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;AACjC,CAAC,CAAA;AAED;;;;;;;;;GASG;AACH,iBAAiB,CAAC,SAAS,CAAC,gBAAgB,GAAG,UAAS,KAAK,EAAE,MAAM;IACnE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,KAAK,CAAC,sCAAsC,GAAG,KAAK,CAAC,CAAA;IACnE,CAAC;SAAM,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7B,OAAO,MAAM,CAAA;IACjB,CAAC;IAED,IAAI,WAAW,GAAG,IAAI,KAAK,EAAE,CAAA;IAC7B,IAAI,iBAAiB,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IACrD,IAAI,SAAS,GAAG,IAAI,CAAA;IACpB,IAAI,MAAM,GAAG,IAAI,CAAA;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,IAAI,MAAM,EAAE,CAAC;YACX,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;YACrB,MAAM,GAAG,KAAK,CAAA;QAChB,CAAC;aAAM,CAAC;YACN,IAAI,QAAQ,GAAG,IAAI,IAAI,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;YAC7C,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;YAC1B,iBAAiB,EAAE,CAAA;YACnB,MAAM,GAAG,IAAI,CAAA;YACb,SAAS,GAAG,IAAI,CAAA;QAClB,CAAC;IACH,CAAC;IAED,IAAI,CAAC,MAAM,EAAE,CAAC;QACV,wEAAwE;QACxE,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;IAC/B,CAAC;IAED,cAAc;IACd,IAAI,iBAAiB,IAAI,CAAC,EAAE,CAAC;QAC3B,IAAI,CAAC,QAAQ,CAAC,yDAAyD,GAAG,KAAK,GAAG,cAAc,GAAG,iBAAiB,GAAE,sBAAsB,GAAG,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,CAAA;IACrK,CAAC;IAED,OAAO,IAAI,CAAC,gBAAgB,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,CAAA;AACxD,CAAC,CAAA;AAED,iBAAiB,CAAC,SAAS,CAAC,KAAK,GAAG,UAAS,IAAI,EAAE,iBAAiB;IAClE,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAA;AAC9D,CAAC,CAAA;AAED;;GAEG;AACH,iBAAiB,CAAC,SAAS,CAAC,aAAa,GAAG,UAAS,IAAI,EAAE,KAAK,EAAE,iBAAiB;IACjF,IAAI,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,iBAAiB,CAAC,CAAA;IAElE,OAAO,IAAI,UAAU,CAAC,MAAM,CAAC,CAAA;AAC/B,CAAC,CAAA;AACD;;;GAGG;AACH,iBAAiB,CAAC,SAAS,CAAC,cAAc,GAAG,UAAS,KAAK,EAAE,KAAK,EAAE,iBAAiB;IACnF,IAAG,iBAAiB,IAAI,SAAS,IAAI,iBAAiB,IAAI,IAAI,EAAE,CAAC;QAC/D,OAAO,CAAC,KAAK,CAAC,aAAa,EAAE,IAAI,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC;QAChD,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;IAC9D,CAAC;IACD,IAAI,QAAQ,GAAI,KAAK,CAAC,sCAAsC,EAAE,CAAA;IAE9D,sBAAsB;IACtB,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACtB,OAAO,IAAI,aAAa,CAAC,IAAI,SAAS,EAAE,EAAE,IAAI,SAAS,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAA;IACnF,CAAC;IAED,IAAI,SAAS,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,EAAE,iBAAiB,CAAC,CAAA;IACvE,yCAAyC;IACzC,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,YAAY,IAAI,IAAI,iBAAiB,IAAI,CAAC,EAAE,CAAC;QACpF,OAAO,IAAI,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,SAAS,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;IACxF,CAAC;IAED,6BAA6B;IAC7B,IAAI,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,EAAE,SAAS,CAAC,CAAA;IAEhD,kCAAkC;IAClC,IAAI,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;IACvB,IAAI,OAAO,YAAY,IAAI,EAAE,CAAC;QAC5B,OAAO,IAAI,aAAa,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;IACtF,CAAC;IACD,IAAI,OAAO,YAAY,IAAI,EAAE,CAAC;QAC5B,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAA;IACxD,CAAC;SAAM,CAAC;QACN,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAA;IAC9D,CAAC;AACL,CAAC,CAAA;AAED;;GAEG;AACH,iBAAiB,CAAC,SAAS,CAAC,gBAAgB,GAAG,UAAS,KAAK,EAAE,OAAO,EAAE,QAAQ;IAC9E,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,8CAA8C,GAAG,KAAK,CAAC,MAAM,GAAG,wBAAwB,CAAC,CAAA;IAC7G,CAAC;SAAM,CAAC;QACJ,OAAO,IAAI,aAAa,CAAC,OAAO,EAAE,IAAI,SAAS,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;IACrF,CAAC;AACH,CAAC,CAAA;AAED;;GAEG;AACH,iBAAiB,CAAC,SAAS,CAAC,iBAAiB,GAAG,UAAS,QAAQ,EAAE,KAAK,EAAE,iBAAiB;IACzF,IAAI,SAAS,GAAG,IAAI,KAAK,EAAE,CAAA;IAC3B,IAAI,cAAc,GAAG,KAAK,CAAC,kBAAkB,EAAE,CAAA,CAAC,2CAA2C;IAC3F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,IAAI,wBAAwB,GAAG,cAAc,CAAC,+CAA+C,CAAC,CAAC,CAAC,CAAA;QAChG,IAAI,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;QACtB,IAAI,iBAAiB,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,wBAAwB,EAAE,KAAK,EAAE,iBAAiB,CAAC,CAAA;QACjG,SAAS,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAA;IACnC,CAAC;IAED,OAAO,SAAS,CAAA;AAClB,CAAC,CAAA;AAED;;GAEG;AACH,iBAAiB,CAAC,SAAS,CAAC,mBAAmB,GAAG,UAAS,IAAI,EAAE,KAAK,EAAE,iBAAiB;IACvF,IAAI,QAAQ,GAAG,KAAK,CAAC,sCAAsC,EAAE,CAAA;IAC7D,qDAAqD;IACrD,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAA;IACnC,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACnB,OAAO,IAAI,YAAY,CAAC,IAAI,SAAS,EAAE,EAAE,IAAI,SAAS,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAA;IAC7F,CAAC;IAED,8BAA8B;IAC9B,IAAI,SAAS,GAAG,IAAI,CAAC,wBAAwB,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,iBAAiB,CAAC,CAAA;IAEnF,6BAA6B;IAC7B,IAAI,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,EAAE,SAAS,CAAC,CAAA;IAEhD,kCAAkC;IAClC,IAAI,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;IACvB,IAAI,OAAO,YAAY,IAAI,EAAE,CAAC;QAC5B,OAAO,IAAI,YAAY,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;IACnF,CAAC;SAAM,CAAC;QACN,MAAM,IAAI,KAAK,CAAC,6CAA6C,GAAG,OAAO,OAAO,CAAC,CAAA;IACjF,CAAC;AACH,CAAC,CAAA;AAED;;GAEG;AACH,iBAAiB,CAAC,SAAS,CAAC,wBAAwB,GAAG,UAAS,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,iBAAiB;IAClG,IAAI,SAAS,GAAG,IAAI,KAAK,EAAE,CAAA;IAC3B,IAAI,aAAa,GAAG,KAAK,CAAC,iBAAiB,EAAE,CAAA,CAAC,2CAA2C;IAEzF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,4CAA4C;QAC5C,IAAI,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;QACjB,IAAI,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,iBAAiB,CAAC,CAAA;QACzE,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;QAE1B,IAAI,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAA;QACvB,IAAI,wBAAwB,GAAG,aAAa,CAAC,4CAA4C,CAAC,GAAG,CAAC,CAAA;QAC9F,IAAI,cAAc,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,wBAAwB,EAAE,KAAK,EAAE,iBAAiB,CAAC,CAAA;QACjG,SAAS,CAAC,IAAI,CAAC,cAAc,CAAC,CAAA;IAChC,CAAC;IAED,OAAO,SAAS,CAAA;AAClB,CAAC,CAAA;AAED,MAAM,CAAC,OAAO,GAAG,EAAC,iBAAiB,EAAC,CAAA"}

package/built/src/merkle/merkleHelper.d.ts

@@ -1,18 +0,0 @@
-/// <reference types="node" />
-import { Path } from "./types";
-import { Buffer } from "buffer";
-export declare function calculateRoot(hashes: Buffer[], depth?: number, leafDepth?: number): Buffer;
-export declare function merklePath(hashes: Buffer[], target: Buffer): Path;
-/**
- *
- * @param path The merkle path to validate.
- * Format [{side: <0|1>, hash: <hash buffer depth n-1>},
- *         {side: <0|1>, hash: <hash buffer depth n-2>},
- *         ...,
- *         {side: <0|1>, hash: <hash buffer depth 1>}]
-
- * @param target the leaf hash that the path proves belongs in the merkleRoot
- * @param merkleRoot The merkle root that supposedly contains the target via the supplied path.
- * The merkle root is typically taken from a block header.
- */
-export declare function validateMerklePath(path: Path, target: Buffer, merkleRoot: Buffer): boolean;

package/built/src/merkle/merkleHelper.js

@@ -1,110 +0,0 @@
-import { hashConcat } from "../encryption/encryption";
-import { Buffer } from "buffer";
-var internalNodePrefix = Buffer.alloc(1, 0);
-var leafPrefix = Buffer.alloc(1, 1);
-var nonExistingNodeHash = Buffer.alloc(32);
-export function calculateRoot(hashes, depth, leafDepth) {
-    var numTransactions = hashes.length;
-    if (numTransactions === 0) {
-        return Buffer.alloc(32);
-    }
-    if (depth === undefined) {
-        depth = 0;
-    }
-    if (!leafDepth) {
-        leafDepth = Math.ceil(Math.log2(numTransactions));
-    }
-    if (depth === leafDepth) {
-        return hashes[0];
-    }
-    var maxLeavesPerChild = Math.pow(2, leafDepth - depth - 1);
-    var prefix = depth === leafDepth - 1 ? leafPrefix : internalNodePrefix;
-    if (numTransactions <= maxLeavesPerChild) {
-        var left = calculateRoot(hashes, depth + 1, leafDepth);
-        return hashConcat([prefix, left, nonExistingNodeHash]);
-    }
-    var left = calculateRoot(hashes.slice(0, maxLeavesPerChild), depth + 1, leafDepth);
-    var right = calculateRoot(hashes.slice(maxLeavesPerChild), depth + 1, leafDepth);
-    return hashConcat([prefix, left, prefix, right]);
-}
-function internalMerklePath(hashes, targetIndex, depth, leafDepth) {
-    var numTransactions = hashes.length;
-    if (depth === leafDepth) {
-        return [];
-    }
-    var maxLeavesPerChild = Math.pow(2, leafDepth - depth - 1);
-    var prefix = depth == leafDepth - 1 ? leafPrefix : internalNodePrefix;
-    if (numTransactions <= maxLeavesPerChild) {
-        var path = internalMerklePath(hashes, targetIndex, depth + 1, leafDepth);
-        path.push({ side: 1, hash: nonExistingNodeHash });
-        return path;
-    }
-    if (targetIndex < maxLeavesPerChild) {
-        var path = internalMerklePath(hashes.slice(0, maxLeavesPerChild), targetIndex, depth + 1, leafDepth);
-        var right = calculateRoot(hashes.slice(maxLeavesPerChild), depth + 1, leafDepth);
-        path.push({ side: 1, hash: right });
-    }
-    else {
-        var left = calculateRoot(hashes.slice(0, maxLeavesPerChild), depth + 1, leafDepth);
-        var path = internalMerklePath(hashes.slice(maxLeavesPerChild), targetIndex - maxLeavesPerChild, depth + 1, leafDepth);
-        path.push({ side: 0, hash: left });
-    }
-    return path;
-}
-/*
- * a path looks like this:
- * {merklePath: [{side: <0|1>, hash: <hash buffer depth n-1>},
- *               {side: <0|1>, hash: <hash buffer depth n-2>},
- *               ...
- *               {side: <0|1>, hash: <hash buffer depth 1>}]}
- */
-export function merklePath(hashes, target) {
-    if (!hashes || hashes.length == 0) {
-        throw new Error("Cannot make merkle path from empty transaction set");
-    }
-    var index = -1;
-    for (var i = 0; i < hashes.length; i++) {
-        if (hashes[i].equals(target)) {
-            index = i;
-            break;
-        }
-    }
-    if (index === -1) {
-        throw new Error("Target is not in list of hashes");
-    }
-    var leafDepth = Math.ceil(Math.log2(hashes.length));
-    var path = internalMerklePath(hashes, index, 0, leafDepth);
-    return path;
-}
-/**
- *
- * @param path The merkle path to validate.
- * Format [{side: <0|1>, hash: <hash buffer depth n-1>},
- *         {side: <0|1>, hash: <hash buffer depth n-2>},
- *         ...,
- *         {side: <0|1>, hash: <hash buffer depth 1>}]
-
- * @param target the leaf hash that the path proves belongs in the merkleRoot
- * @param merkleRoot The merkle root that supposedly contains the target via the supplied path.
- * The merkle root is typically taken from a block header.
- */
-export function validateMerklePath(path, target, merkleRoot) {
-    let currentHash = target;
-    for (let i = 0; i < path.length; i++) {
-        const item = path[i];
-        const prefix = (i === 0) ? Buffer.from([1]) : Buffer.from([0]);
-        if (item.side === 0) {
-            currentHash = hashConcat([prefix, item.hash, prefix, currentHash]);
-        }
-        else {
-            if (item.hash.equals(nonExistingNodeHash)) {
-                currentHash = hashConcat([prefix, currentHash, nonExistingNodeHash]);
-            }
-            else {
-                currentHash = hashConcat([prefix, currentHash, prefix, item.hash]);
-            }
-        }
-    }
-    return merkleRoot.equals(currentHash);
-}
-//# sourceMappingURL=merkleHelper.js.map

package/built/src/merkle/merkleHelper.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"merkleHelper.js","sourceRoot":"","sources":["../../../src/merkle/merkleHelper.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAEtD,OAAO,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAEhC,IAAI,kBAAkB,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC5C,IAAI,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACpC,IAAI,mBAAmB,GAAG,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;AAE3C,MAAM,UAAU,aAAa,CAAC,MAAiB,EAAE,KAAc,EAAE,SAAkB;IAC/E,IAAI,eAAe,GAAG,MAAM,CAAC,MAAM,CAAC;IACpC,IAAI,eAAe,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACtB,KAAK,GAAG,CAAC,CAAC;IACd,CAAC;IAED,IAAI,CAAC,SAAS,EAAE,CAAC;QACb,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC;IACtD,CAAC;IAED,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACtB,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IAED,IAAI,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;IAC3D,IAAI,MAAM,GAAG,KAAK,KAAK,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,kBAAkB,CAAC;IACvE,IAAI,eAAe,IAAI,iBAAiB,EAAE,CAAC;QACvC,IAAI,IAAI,GAAG,aAAa,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC;QACvD,OAAO,UAAU,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,mBAAmB,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED,IAAI,IAAI,GAAG,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,iBAAiB,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC;IACnF,IAAI,KAAK,GAAG,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC;IACjF,OAAO,UAAU,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;AACrD,CAAC;AACD,SAAS,kBAAkB,CAAC,MAAiB,EAAE,WAAoB,EAAE,KAAc,EAAE,SAAiB;IAClG,IAAI,eAAe,GAAG,MAAM,CAAC,MAAM,CAAC;IAEpC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACtB,OAAO,EAAE,CAAC;IACd,CAAC;IAED,IAAI,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;IAC3D,IAAI,MAAM,GAAG,KAAK,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,kBAAkB,CAAC;IACtE,IAAI,eAAe,IAAI,iBAAiB,EAAE,CAAC;QACvC,IAAI,IAAI,GAAG,kBAAkB,CAAC,MAAM,EAAE,WAAW,EAAE,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC;QACzE,IAAI,CAAC,IAAI,CAAC,EAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,mBAAmB,EAAC,CAAC,CAAC;QAChD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,IAAI,WAAW,GAAG,iBAAiB,EAAE,CAAC;QAClC,IAAI,IAAI,GAAG,kBAAkB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,iBAAiB,CAAC,EAAE,WAAW,EAAE,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC;QACrG,IAAI,KAAK,GAAG,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC;QACjF,IAAI,CAAC,IAAI,CAAC,EAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAC,CAAC,CAAC;IACtC,CAAC;SAAM,CAAC;QACJ,IAAI,IAAI,GAAG,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,iBAAiB,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC;QACnF,IAAI,IAAI,GAAG,kBAAkB,CAAC,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,EAAE,WAAW,GAAG,iBAAiB,EAAE,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC;QACtH,IAAI,CAAC,IAAI,CAAC,EAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAC,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,IAAI,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CAAC,MAAiB,EAAE,MAAe;IACzD,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QAChC,MAAM,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAAC;IAC1E,CAAC;IACD,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3B,KAAK,GAAG,CAAC,CAAC;YACV,MAAM;QACV,CAAC;IACL,CAAC;IACD,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;QACf,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;IACvD,CAAC;IAED,IAAI,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IACpD,IAAI,IAAI,GAAG,kBAAkB,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;IAC3D,OAAO,IAAI,CAAC;AAChB,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAU,EAAE,MAAe,EAAE,UAAmB;IAC/E,IAAI,WAAW,GAAG,MAAM,CAAC;IAEzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAErB,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE/D,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAClB,WAAW,GAAG,UAAU,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC;QACvE,CAAC;aAAM,CAAC;YACJ,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,EAAE,CAAC;gBACxC,WAAW,GAAG,UAAU,CAAC,CAAC,MAAM,EAAE,WAAW,EAAE,mBAAmB,CAAC,CAAC,CAAC;YACzE,CAAC;iBAAM,CAAC;gBACJ,WAAW,GAAG,UAAU,CAAC,CAAC,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YACvE,CAAC;QACL,CAAC;IAEL,CAAC;IAED,OAAO,UAAU,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;AAC1C,CAAC"}