postchain-client 2.0.0 → 2.0.2

package/built/src/merkle/proof/merkleprooftree.d.ts

@@ -1,124 +0,0 @@
-/**
- *
- * @param {Buffer} prefix
- * @param {MerkleProofElement} left
- * @param {MerkleProofElement} right
- */
-export function ProofNode(prefix: Buffer, left: typeof MerkleProofElement, right: typeof MerkleProofElement): void;
-export class ProofNode {
-    /**
-     *
-     * @param {Buffer} prefix
-     * @param {MerkleProofElement} left
-     * @param {MerkleProofElement} right
-     */
-    constructor(prefix: Buffer, left: typeof MerkleProofElement, right: typeof MerkleProofElement);
-    prefix: Buffer;
-    left: typeof MerkleProofElement;
-    right: typeof MerkleProofElement;
-}
-/**
- *
- * @param {MerkleProofElement} left
- * @param {MerkleProofElement} right
- */
-export function ProofNodeSimple(left: typeof MerkleProofElement, right: typeof MerkleProofElement): void;
-export class ProofNodeSimple {
-    /**
-     *
-     * @param {MerkleProofElement} left
-     * @param {MerkleProofElement} right
-     */
-    constructor(left: typeof MerkleProofElement, right: typeof MerkleProofElement);
-}
-/**
- *
- * @param {Buffer} merkleHash
- */
-export function ProofHashedLeaf(merkleHash: Buffer): void;
-export class ProofHashedLeaf {
-    /**
-     *
-     * @param {Buffer} merkleHash
-     */
-    constructor(merkleHash: Buffer);
-    merkleHash: Buffer;
-    /**
-     * @param {ProofHashedLeaf} other
-     */
-    equals(other: ProofHashedLeaf): boolean;
-}
-/**
- *
- * @param {*} content
- * @param {SearchablePathElement} pathElem
- */
-export function ProofValueLeaf(content: any, pathElem: SearchablePathElement): void;
-export class ProofValueLeaf {
-    /**
-     *
-     * @param {*} content
-     * @param {SearchablePathElement} pathElem
-     */
-    constructor(content: any, pathElem: SearchablePathElement);
-    content: any;
-    pathElem: SearchablePathElement;
-}
-/**
- *
- * @param {MerkleProofElement} left
- * @param {MerkleProofElement} right
- * @param {SearchablePathElement} pathElem
- */
-export function ProofNodeArrayHead(left: typeof MerkleProofElement, right: typeof MerkleProofElement, pathElem?: SearchablePathElement): void;
-export class ProofNodeArrayHead {
-    /**
-     *
-     * @param {MerkleProofElement} left
-     * @param {MerkleProofElement} right
-     * @param {SearchablePathElement} pathElem
-     */
-    constructor(left: typeof MerkleProofElement, right: typeof MerkleProofElement, pathElem?: SearchablePathElement);
-    pathElem: SearchablePathElement;
-}
-/**
- *
- * @param {MerkleProofElement} left
- * @param {MerkleProofElement} right
- * @param {SearchablePathElement} pathElem
- */
-export function ProofNodeDictHead(left: typeof MerkleProofElement, right: typeof MerkleProofElement, pathElem?: SearchablePathElement): void;
-export class ProofNodeDictHead {
-    /**
-     *
-     * @param {MerkleProofElement} left
-     * @param {MerkleProofElement} right
-     * @param {SearchablePathElement} pathElem
-     */
-    constructor(left: typeof MerkleProofElement, right: typeof MerkleProofElement, pathElem?: SearchablePathElement);
-    pathElem: SearchablePathElement;
-}
-/**
- *
- */
-export function MerkleProofElement(): void;
-/**
- *
- * @param {MerkleProofElement} root
- */
-export function MerkleProofTree(root: typeof MerkleProofElement): void;
-export class MerkleProofTree {
-    /**
-     *
-     * @param {MerkleProofElement} root
-     */
-    constructor(root: typeof MerkleProofElement);
-    root: typeof MerkleProofElement;
-    maxLevel(): any;
-    /**
-     * @param {MerkleProofElement} node
-     */
-    maxLevelInternal(node: typeof MerkleProofElement): any;
-}
-import SearchablePathElement_1 = require("../path");
-import SearchablePathElement = SearchablePathElement_1.SearchablePathElement;

package/built/src/merkle/proof/merkleprooftree.js

@@ -1,117 +0,0 @@
-"use strict";
-var SearchablePathElement = require('../path').SearchablePathElement;
-var HASH_PREFIX_NODE = require('../binarytree').HASH_PREFIX_NODE;
-var HASH_PREFIX_NODE_ARRAY = require('../binarytree').HASH_PREFIX_NODE_ARRAY;
-var HASH_PREFIX_NODE_DICT = require('../binarytree').HASH_PREFIX_NODE_DICT;
-/**
- *
- */
-function MerkleProofElement() { }
-/**
- *
- * @param {Buffer} prefix
- * @param {MerkleProofElement} left
- * @param {MerkleProofElement} right
- */
-function ProofNode(prefix, left, right) {
-    this.prefix = prefix;
-    this.left = left;
-    this.right = right;
-}
-ProofNode.prototype = Object.create(MerkleProofElement.prototype);
-ProofNode.prototype.constructor = ProofNode;
-/**
- *
- * @param {MerkleProofElement} left
- * @param {MerkleProofElement} right
- */
-function ProofNodeSimple(left, right) {
-    ProofNode.call(this, HASH_PREFIX_NODE, left, right);
-}
-ProofNodeSimple.prototype = Object.create(ProofNode.prototype);
-ProofNodeSimple.prototype.constructor = ProofNodeSimple;
-/**
- *
- * @param {*} content
- * @param {SearchablePathElement} pathElem
- */
-function ProofValueLeaf(content, pathElem) {
-    this.content = content;
-    this.pathElem = pathElem;
-}
-ProofValueLeaf.prototype = Object.create(MerkleProofElement.prototype);
-ProofValueLeaf.prototype.constructor = ProofValueLeaf;
-/**
- *
- * @param {Buffer} merkleHash
- */
-function ProofHashedLeaf(merkleHash) {
-    this.merkleHash = merkleHash;
-}
-ProofHashedLeaf.prototype = Object.create(MerkleProofElement.prototype);
-ProofHashedLeaf.prototype.constructor = ProofHashedLeaf;
-/**
- * @param {ProofHashedLeaf} other
- */
-ProofHashedLeaf.prototype.equals = function (other) {
-    if (other instanceof ProofHashedLeaf) {
-        return this.merkleHash.equals(other.merkleHash);
-    }
-    else {
-        return false;
-    }
-};
-/**
- *
- * @param {MerkleProofElement} left
- * @param {MerkleProofElement} right
- * @param {SearchablePathElement} pathElem
- */
-function ProofNodeArrayHead(left, right, pathElem = null) {
-    ProofNode.call(this, HASH_PREFIX_NODE_ARRAY, left, right);
-    this.pathElem = pathElem;
-}
-ProofNodeArrayHead.prototype = Object.create(ProofNode.prototype);
-ProofNodeArrayHead.prototype.constructor = ProofNodeArrayHead;
-/**
- *
- * @param {MerkleProofElement} left
- * @param {MerkleProofElement} right
- * @param {SearchablePathElement} pathElem
- */
-function ProofNodeDictHead(left, right, pathElem = null) {
-    ProofNode.call(this, HASH_PREFIX_NODE_DICT, left, right);
-    this.pathElem = pathElem;
-}
-ProofNodeDictHead.prototype = Object.create(ProofNode.prototype);
-ProofNodeDictHead.prototype.constructor = ProofNodeDictHead;
-/**
- *
- * @param {MerkleProofElement} root
- */
-function MerkleProofTree(root) {
-    this.root = root;
-}
-MerkleProofTree.prototype.maxLevel = function () {
-    return this.maxLevelInternal(this.root);
-};
-/**
- * @param {MerkleProofElement} node
- */
-MerkleProofTree.prototype.maxLevelInternal = function (node) {
-    if (node instanceof ProofValueLeaf) {
-        return 1;
-    }
-    else if (node instanceof ProofHashedLeaf) {
-        return 1;
-    }
-    else if (node instanceof ProofNode) {
-        return Math.max(this.maxLevelInternal(node.left), this.maxLevelInternal(node.right)) + 1;
-    }
-    else {
-        throw new Error("Should be able to handle node type: " + typeof node);
-    }
-};
-module.exports = { ProofNode, ProofNodeSimple, ProofHashedLeaf, ProofValueLeaf,
-    ProofNodeArrayHead, ProofNodeDictHead, MerkleProofElement, MerkleProofTree };
-//# sourceMappingURL=merkleprooftree.js.map

package/built/src/merkle/proof/merkleprooftree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"merkleprooftree.js","sourceRoot":"","sources":["../../../../src/merkle/proof/merkleprooftree.js"],"names":[],"mappings":";AACA,IAAI,qBAAqB,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,qBAAqB,CAAA;AACpE,IAAI,gBAAgB,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC,gBAAgB,CAAA;AAChE,IAAI,sBAAsB,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC,sBAAsB,CAAA;AAC5E,IAAI,qBAAqB,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC,qBAAqB,CAAA;AAC1E;;GAEG;AACH,SAAS,kBAAkB,KAAI,CAAC;AAEhC;;;;;GAKG;AACH,SAAS,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK;IACpC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAA;IACpB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;IAChB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;AACpB,CAAC;AAED,SAAS,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAA;AACjE,SAAS,CAAC,SAAS,CAAC,WAAW,GAAG,SAAS,CAAA;AAE3C;;;;GAIG;AACH,SAAS,eAAe,CAAC,IAAI,EAAE,KAAK;IAClC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,gBAAgB,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;AACrD,CAAC;AAED,eAAe,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAA;AAC9D,eAAe,CAAC,SAAS,CAAC,WAAW,GAAG,eAAe,CAAA;AAEvD;;;;GAIG;AACH,SAAS,cAAc,CAAC,OAAO,EAAE,QAAQ;IACvC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;IACtB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;AAC1B,CAAC;AACD,cAAc,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAA;AACtE,cAAc,CAAC,SAAS,CAAC,WAAW,GAAG,cAAc,CAAA;AAErD;;;GAGG;AACH,SAAS,eAAe,CAAC,UAAU;IACjC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAA;AAC9B,CAAC;AACD,eAAe,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAA;AACvE,eAAe,CAAC,SAAS,CAAC,WAAW,GAAG,eAAe,CAAA;AAEvD;;GAEG;AACH,eAAe,CAAC,SAAS,CAAC,MAAM,GAAG,UAAS,KAAK;IAC/C,IAAI,KAAK,YAAY,eAAe,EAAE,CAAC;QACrC,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAA;IACjD,CAAC;SAAM,CAAC;QACN,OAAO,KAAK,CAAA;IACd,CAAC;AACH,CAAC,CAAA;AAED;;;;;GAKG;AACH,SAAS,kBAAkB,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,GAAC,IAAI;IACpD,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,sBAAsB,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;IACzD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;AAC1B,CAAC;AACD,kBAAkB,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAA;AACjE,kBAAkB,CAAC,SAAS,CAAC,WAAW,GAAG,kBAAkB,CAAA;AAE7D;;;;;GAKG;AACH,SAAS,iBAAiB,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,GAAC,IAAI;IACnD,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,qBAAqB,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;IACxD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;AAC1B,CAAC;AACD,iBAAiB,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAA;AAChE,iBAAiB,CAAC,SAAS,CAAC,WAAW,GAAG,iBAAiB,CAAA;AAE3D;;;GAGG;AACH,SAAS,eAAe,CAAC,IAAI;IAC3B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;AAClB,CAAC;AAED,eAAe,CAAC,SAAS,CAAC,QAAQ,GAAG;IACnC,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AACzC,CAAC,CAAA;AAED;;GAEG;AACH,eAAe,CAAC,SAAS,CAAC,gBAAgB,GAAG,UAAS,IAAI;IACxD,IAAI,IAAI,YAAY,cAAc,EAAE,CAAC;QACnC,OAAO,CAAC,CAAA;IACV,CAAC;SAAM,IAAI,IAAI,YAAY,eAAe,EAAE,CAAC;QAC3C,OAAO,CAAC,CAAA;IACV,CAAC;SAAM,IAAI,IAAI,YAAY,SAAS,EAAE,CAAC;QACrC,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,sCAAsC,GAAG,OAAO,IAAI,CAAC,CAAA;IACvE,CAAC;AACH,CAAC,CAAA;AAED,MAAM,CAAC,OAAO,GAAG,EAAC,SAAS,EAAE,eAAe,EAAE,eAAe,EAAE,cAAc;IAC3E,kBAAkB,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,eAAe,EAAC,CAAA"}

package/built/src/merkle/proof/merkleprooftreefactory.d.ts

@@ -1,47 +0,0 @@
-/**
- *
- */
-export function MerkleProofTreeFactory(): void;
-export class MerkleProofTreeFactory {
-    /**
-     * @param {BinaryTree} originalTree
-     */
-    buildFromBinaryTree(originalTree: BinaryTree, calculator: any): MerkleProofTree;
-    /**
-     * @param {BinaryTreeElement} elem
-     * @param {*} calculator
-     */
-    buildFromBinaryTreeInternal(elem: BinaryTreeElement, calculator: any): any;
-    /**
-     * @param {Node} node
-     */
-    convertNode(node: Node, calculator: any): any;
-    /**
-     * @param {ArrayHeadNode} node
-     */
-    extractSearchablePathElement(node: ArrayHeadNode): any;
-    /**
-     * @param {Node} node
-     * @param {MerkleProofElement} left
-     * @param {MerkleProofElement} right
-     */
-    buildNodeOfCorrectType(node: Node, left: typeof MerkleProofElement, right: typeof MerkleProofElement): ProofNodeSimple | ProofNodeArrayHead | ProofNodeDictHead;
-}
-import BinaryTree_1 = require("../binarytree");
-import BinaryTree = BinaryTree_1.BinaryTree;
-import MerkleProofTree_1 = require("./merkleprooftree");
-import MerkleProofTree = MerkleProofTree_1.MerkleProofTree;
-import BinaryTreeElement_1 = require("../binarytree");
-import BinaryTreeElement = BinaryTreeElement_1.BinaryTreeElement;
-import Node_1 = require("../binarytree");
-import Node = Node_1.Node;
-import ArrayHeadNode_1 = require("../binarytree");
-import ArrayHeadNode = ArrayHeadNode_1.ArrayHeadNode;
-import MerkleProofElement_1 = require("./merkleprooftree");
-import MerkleProofElement = MerkleProofElement_1.MerkleProofElement;
-import ProofNodeSimple_1 = require("./merkleprooftree");
-import ProofNodeSimple = ProofNodeSimple_1.ProofNodeSimple;
-import ProofNodeArrayHead_1 = require("./merkleprooftree");
-import ProofNodeArrayHead = ProofNodeArrayHead_1.ProofNodeArrayHead;
-import ProofNodeDictHead_1 = require("./merkleprooftree");
-import ProofNodeDictHead = ProofNodeDictHead_1.ProofNodeDictHead;

package/built/src/merkle/proof/merkleprooftreefactory.js

@@ -1,123 +0,0 @@
-"use strict";
-const { Buffer } = require('buffer');
-var BinaryTreeElement = require('../binarytree').BinaryTreeElement;
-var Node = require('../binarytree').Node;
-var Leaf = require('../binarytree').Leaf;
-var EmptyLeaf = require('../binarytree').EmptyLeaf;
-var BinaryTree = require('../binarytree').BinaryTree;
-var ProofHashedLeaf = require('./merkleprooftree').ProofHashedLeaf;
-var ProofValueLeaf = require('./merkleprooftree').ProofValueLeaf;
-var MerkleProofElement = require('./merkleprooftree').MerkleProofElement;
-var MerkleProofTree = require('./merkleprooftree').MerkleProofTree;
-var ProofNodeArrayHead = require('./merkleprooftree').ProofNodeArrayHead;
-var ProofNodeDictHead = require('./merkleprooftree').ProofNodeDictHead;
-var PathLeafElement = require('../path').PathLeafElement;
-var SubTreeRootNode = require('../binarytree').SubTreeRootNode;
-var ArrayHeadNode = require('../binarytree').ArrayHeadNode;
-var DictHeadNode = require('../binarytree').DictHeadNode;
-var ProofNodeSimple = require('./merkleprooftree').ProofNodeSimple;
-const EMPTY_HASH = new Buffer.alloc(32);
-/**
- *
- */
-function MerkleProofTreeFactory() { }
-/**
- * @param {BinaryTree} originalTree
- */
-MerkleProofTreeFactory.prototype.buildFromBinaryTree = function (originalTree, calculator) {
-    var rootElem = this.buildFromBinaryTreeInternal(originalTree.root, calculator);
-    return new MerkleProofTree(rootElem);
-};
-/**
- * @param {BinaryTreeElement} elem
- * @param {*} calculator
- */
-MerkleProofTreeFactory.prototype.buildFromBinaryTreeInternal = function (elem, calculator) {
-    if (elem instanceof EmptyLeaf) {
-        return new ProofHashedLeaf(EMPTY_HASH);
-    }
-    else if (elem instanceof Leaf) {
-        var pathElem = elem.pathElem;
-        if (pathElem != null) {
-            if (pathElem instanceof PathLeafElement) {
-                return new ProofValueLeaf(elem.content, pathElem.previous);
-            }
-            else {
-                throw new Error("The path and structure don't match. We are at a leaf, but path elem is not a leaf: " + pathElem);
-            }
-        }
-        else {
-            // make a hash
-            var hash = calculator.calculateLeafHash(elem.content);
-            return new ProofHashedLeaf(hash);
-        }
-    }
-    else if (elem instanceof SubTreeRootNode) {
-        var pathElem = elem.pathElem;
-        if (pathElem != null) {
-            if (pathElem instanceof PathLeafElement) {
-                // Don't convert it
-                return new ProofValueLeaf(elem.content, pathElem.previous);
-            }
-            else {
-                return this.convertNode(elem, calculator);
-            }
-        }
-        else {
-            return this.convertNode(elem, calculator);
-        }
-    }
-    else if (elem instanceof Node) {
-        return this.convertNode(elem, calculator);
-    }
-    else {
-        throw new Error("Cannot handle " + elem);
-    }
-};
-/**
- * @param {Node} node
- */
-MerkleProofTreeFactory.prototype.convertNode = function (node, calculator) {
-    var left = this.buildFromBinaryTreeInternal(node.left, calculator);
-    var right = this.buildFromBinaryTreeInternal(node.right, calculator);
-    if (left instanceof ProofHashedLeaf && right instanceof ProofHashedLeaf) {
-        var addedHash = calculator.calculateNodeHash(node.getPrefixByte(), left.merkleHash, right.merkleHash);
-        return new ProofHashedLeaf(addedHash);
-    }
-    else {
-        return this.buildNodeOfCorrectType(node, left, right);
-    }
-};
-/**
- * @param {ArrayHeadNode} node
- */
-MerkleProofTreeFactory.prototype.extractSearchablePathElement = function (node) {
-    var pathElem = node.pathElem;
-    if (pathElem != null) {
-        return pathElem.previous;
-    }
-    else {
-        return null;
-    }
-};
-/**
- * @param {Node} node
- * @param {MerkleProofElement} left
- * @param {MerkleProofElement} right
- */
-MerkleProofTreeFactory.prototype.buildNodeOfCorrectType = function (node, left, right) {
-    if (node instanceof ArrayHeadNode) {
-        return new ProofNodeArrayHead(left, right, this.extractSearchablePathElement(node));
-    }
-    else if (node instanceof DictHeadNode) {
-        return new ProofNodeDictHead(left, right, this.extractSearchablePathElement(node));
-    }
-    else if (node instanceof Node) {
-        return new ProofNodeSimple(left, right);
-    }
-    else {
-        throw new Error("Should have taken care of this node type: " + node);
-    }
-};
-module.exports = { MerkleProofTreeFactory };
-//# sourceMappingURL=merkleprooftreefactory.js.map

package/built/src/merkle/proof/merkleprooftreefactory.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"merkleprooftreefactory.js","sourceRoot":"","sources":["../../../../src/merkle/proof/merkleprooftreefactory.js"],"names":[],"mappings":";AAAA,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;AACrC,IAAI,iBAAiB,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC,iBAAiB,CAAA;AAClE,IAAI,IAAI,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC,IAAI,CAAA;AACxC,IAAI,IAAI,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC,IAAI,CAAA;AACxC,IAAI,SAAS,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC,SAAS,CAAA;AAClD,IAAI,UAAU,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC,UAAU,CAAA;AACpD,IAAI,eAAe,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAC,eAAe,CAAA;AAClE,IAAI,cAAc,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAC,cAAc,CAAA;AAChE,IAAI,kBAAkB,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAC,kBAAkB,CAAA;AACxE,IAAI,eAAe,GAAI,OAAO,CAAC,mBAAmB,CAAC,CAAC,eAAe,CAAA;AACnE,IAAI,kBAAkB,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAC,kBAAkB,CAAA;AACxE,IAAI,iBAAiB,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAC,iBAAiB,CAAA;AACtE,IAAI,eAAe,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,eAAe,CAAA;AACxD,IAAI,eAAe,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC,eAAe,CAAA;AAC9D,IAAI,aAAa,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC,aAAa,CAAA;AAC1D,IAAI,YAAY,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC,YAAY,CAAA;AACxD,IAAI,eAAe,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAC,eAAe,CAAA;AAElE,MAAM,UAAU,GAAG,IAAI,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAA;AACvC;;GAEG;AACH,SAAS,sBAAsB,KAAI,CAAC;AAEpC;;GAEG;AACH,sBAAsB,CAAC,SAAS,CAAC,mBAAmB,GAAG,UAAS,YAAY,EAAE,UAAU;IACtF,IAAI,QAAQ,GAAG,IAAI,CAAC,2BAA2B,CAAC,YAAY,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;IAC9E,OAAO,IAAI,eAAe,CAAC,QAAQ,CAAC,CAAA;AACtC,CAAC,CAAA;AACD;;;GAGG;AACH,sBAAsB,CAAC,SAAS,CAAC,2BAA2B,GAAG,UAAS,IAAI,EAAE,UAAU;IACtF,IAAI,IAAI,YAAY,SAAS,EAAE,CAAC;QAC9B,OAAO,IAAI,eAAe,CAAC,UAAU,CAAC,CAAA;IACxC,CAAC;SAAM,IAAI,IAAI,YAAY,IAAI,EAAE,CAAC;QAChC,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QAC5B,IAAI,QAAQ,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,QAAQ,YAAY,eAAe,EAAE,CAAC;gBACxC,OAAO,IAAI,cAAc,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAA;YAC5D,CAAC;iBAAM,CAAC;gBACN,MAAM,IAAI,KAAK,CAAC,qFAAqF,GAAG,QAAQ,CAAC,CAAA;YACnH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,cAAc;YACd,IAAI,IAAI,GAAG,UAAU,CAAC,iBAAiB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;YACrD,OAAO,IAAI,eAAe,CAAC,IAAI,CAAC,CAAA;QAClC,CAAC;IACH,CAAC;SAAM,IAAI,IAAI,YAAY,eAAe,EAAE,CAAC;QAC3C,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QAC5B,IAAI,QAAQ,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,QAAQ,YAAY,eAAe,EAAE,CAAC;gBACxC,mBAAmB;gBACnB,OAAO,IAAI,cAAc,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAA;YAC5D,CAAC;iBAAM,CAAC;gBACN,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;YAC3C,CAAC;QACH,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;QAC3C,CAAC;IACH,CAAC;SAAM,IAAI,IAAI,YAAY,IAAI,EAAE,CAAC;QAChC,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;IAC3C,CAAC;SAAM,CAAC;QACN,MAAM,IAAI,KAAK,CAAC,gBAAgB,GAAG,IAAI,CAAC,CAAA;IAC1C,CAAC;AACH,CAAC,CAAA;AAED;;GAEG;AACH,sBAAsB,CAAC,SAAS,CAAC,WAAW,GAAG,UAAS,IAAI,EAAE,UAAU;IACtE,IAAI,IAAI,GAAG,IAAI,CAAC,2BAA2B,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;IAClE,IAAI,KAAK,GAAG,IAAI,CAAC,2BAA2B,CAAC,IAAI,CAAC,KAAK,EAAE,UAAU,CAAC,CAAA;IACpE,IAAI,IAAI,YAAY,eAAe,IAAI,KAAK,YAAY,eAAe,EAAE,CAAC;QACxE,IAAI,SAAS,GAAG,UAAU,CAAC,iBAAiB,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,CAAA;QACrG,OAAO,IAAI,eAAe,CAAC,SAAS,CAAC,CAAA;IACvC,CAAC;SAAM,CAAC;QACN,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;IACvD,CAAC;AACH,CAAC,CAAA;AAED;;GAEG;AACH,sBAAsB,CAAC,SAAS,CAAC,4BAA4B,GAAG,UAAS,IAAI;IAC3E,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;IAC5B,IAAI,QAAQ,IAAI,IAAI,EAAE,CAAC;QACrB,OAAO,QAAQ,CAAC,QAAQ,CAAA;IAC1B,CAAC;SAAM,CAAC;QACN,OAAO,IAAI,CAAA;IACb,CAAC;AACH,CAAC,CAAA;AAED;;;;GAIG;AACH,sBAAsB,CAAC,SAAS,CAAC,sBAAsB,GAAG,UAAS,IAAI,EAAE,IAAI,EAAE,KAAK;IAClF,IAAI,IAAI,YAAY,aAAa,EAAE,CAAC;QAClC,OAAO,IAAI,kBAAkB,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,4BAA4B,CAAC,IAAI,CAAC,CAAC,CAAA;IACrF,CAAC;SAAM,IAAI,IAAI,YAAY,YAAY,EAAE,CAAC;QACxC,OAAO,IAAI,iBAAiB,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,4BAA4B,CAAC,IAAI,CAAC,CAAC,CAAA;IACpF,CAAC;SAAM,IAAI,IAAI,YAAY,IAAI,EAAE,CAAC;QAChC,OAAO,IAAI,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;IACzC,CAAC;SAAM,CAAC;QACN,MAAM,IAAI,KAAK,CAAC,4CAA4C,GAAG,IAAI,CAAC,CAAA;IACtE,CAAC;AACH,CAAC,CAAA;AAED,MAAM,CAAC,OAAO,GAAG,EAAC,sBAAsB,EAAC,CAAA"}

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

@@ -1,11 +0,0 @@
-/// <reference types="node" />
-export type Step = {
-    side: number;
-    hash: Buffer;
-};
-export type StringStep = {
-    side: number;
-    hash: string;
-};
-export type Path = Step[];
-export type StringPath = StringStep[];

package/built/src/merkle/types.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=types.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/merkle/types.ts"],"names":[],"mappings":""}

package/built/test/unit/merkle/merkleHelper/merkleHelperTest.js

@@ -1,85 +0,0 @@
-import assert from "assert";
-import { hash256 } from "../../../../src/encryption/encryption";
-import { calculateRoot, merklePath, validateMerklePath } from "../../../../src/merkle/merkleHelper";
-function merkleRoot(stringList) {
-    return calculateRoot(hashList(stringList));
-}
-function stringToHash(string) {
-    return hash256(Buffer.from(string));
-}
-function hashList(stringList) {
-    return stringList.map(stringToHash);
-}
-function checkDifferent(list1, list2) {
-    const root1 = merkleRoot(list1);
-    const root2 = merkleRoot(list2);
-    expect(root1.equals(root2)).toBeFalsy();
-}
-function testPath(stringList, stringToProve) {
-    const path = merklePath(hashList(stringList), stringToHash(stringToProve));
-    expect(validateMerklePath(path, stringToHash(stringToProve), merkleRoot(stringList))).toBeTruthy();
-}
-const a = ["a"];
-const aa = ["a", "a"];
-const abcde = ["a", "b", "c", "d", "e"];
-const abcdee = ["a", "b", "c", "d", "e", "e"];
-const abcdef = ["a", "b", "c", "d", "e", "f"];
-const abcdefef = ["a", "b", "c", "d", "e", "f", "e", "f"];
-describe("MerkleHelper", function () {
-    it("merkle root of empty list is 32 0s", () => {
-        expect(merkleRoot([]).equals(Buffer.alloc(32))).toBeTruthy();
-    });
-    it("merkle root of single element", () => {
-        expect(merkleRoot(a).equals(stringToHash("a"))).toBeTruthy();
-    });
-    it("merkle root collisions", function () {
-        checkDifferent(a, aa);
-        checkDifferent(abcde, abcdee);
-        checkDifferent(abcdef, abcdefef);
-    });
-    it("merkle proof throws on empty list", () => {
-        assert.throws(() => {
-            merklePath([], stringToHash("a"));
-        }, Error);
-    });
-    it("merkle proof throws if tx not exist in list", () => {
-        assert.throws(() => {
-            merklePath(hashList(abcdee), stringToHash("f"));
-        }, Error);
-    });
-    it("merkle proof structure", () => {
-        const path = merklePath(hashList(abcde), stringToHash("e"));
-        assert.equal(path.length, 3);
-        assert.equal(path[0].side, 1); // right
-        assert.equal(path[1].side, 1); // right
-        assert.equal(path[2].side, 0); // left
-        expect(validateMerklePath(path, stringToHash("e"), merkleRoot(abcde))).toBeTruthy();
-        expect(validateMerklePath(path, stringToHash("c"), merkleRoot(abcde))).toBeFalsy();
-    });
-    it("merkle proof structure fails without hashes", () => {
-        assert.throws(() => merklePath([], stringToHash("e")), Error);
-    });
-    it("merkle path to size 20", () => {
-        const txs = [];
-        for (let i = 1; i < 20; i++) {
-            txs.push(`${i}`);
-            for (let j = 1; j <= i; j++) {
-                testPath(txs, `${j}`);
-            }
-        }
-    }, 400000);
-    it("dummy", () => {
-        testPath(["1", "2", "3"], "1");
-    });
-    it("merkle path negative test wrong side", () => {
-        const path = merklePath(hashList(abcde), stringToHash("d"));
-        path[1].side = 1; // Flip side of one path component
-        expect(validateMerklePath(path, stringToHash("d"), merkleRoot(abcde))).toBeFalsy();
-    });
-    it("merkle path negative test wrong hash", () => {
-        const path = merklePath(hashList(abcde), stringToHash("d"));
-        path[2].hash = stringToHash("invalid"); // wrong hash
-        expect(validateMerklePath(path, stringToHash("d"), merkleRoot(abcde))).toBeFalsy();
-    });
-});
-//# sourceMappingURL=merkleHelperTest.js.map

package/built/test/unit/merkle/merkleHelper/merkleHelperTest.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"merkleHelperTest.js","sourceRoot":"","sources":["../../../../../test/unit/merkle/merkleHelper/merkleHelperTest.ts"],"names":[],"mappings":"AAAA,OAAO,MAAM,MAAM,QAAQ,CAAC;AAC5B,OAAO,EAAE,OAAO,EAAE,MAAM,uCAAuC,CAAC;AAChE,OAAO,EAAE,aAAa,EAAE,UAAU,EAAE,kBAAkB,EAAE,MAAM,qCAAqC,CAAC;AAGpG,SAAS,UAAU,CAAC,UAAoB;IACtC,OAAO,aAAa,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;AAC7C,CAAC;AAED,SAAS,YAAY,CAAC,MAAc;IAClC,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;AACtC,CAAC;AAED,SAAS,QAAQ,CAAC,UAAoB;IACpC,OAAO,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;AACtC,CAAC;AAED,SAAS,cAAc,CAAC,KAAe,EAAE,KAAe;IACtD,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAChC,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAEhC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;AAC1C,CAAC;AAED,SAAS,QAAQ,CAAC,UAAoB,EAAE,aAAqB;IAC3D,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,YAAY,CAAC,aAAa,CAAC,CAAC,CAAC;IAC3E,MAAM,CACJ,kBAAkB,CAAC,IAAI,EAAE,YAAY,CAAC,aAAa,CAAC,EAAE,UAAU,CAAC,UAAU,CAAC,CAAC,CAC9E,CAAC,UAAU,EAAE,CAAC;AACjB,CAAC;AAED,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAChB,MAAM,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AACtB,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AACxC,MAAM,MAAM,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAC9C,MAAM,MAAM,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAC9C,MAAM,QAAQ,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAE1D,QAAQ,CAAC,cAAc,EAAE;IACvB,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wBAAwB,EAAE;QAC3B,cAAc,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACtB,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC9B,cAAc,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE;YACjB,UAAU,CAAC,EAAE,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;QACpC,CAAC,EAAE,KAAK,CAAC,CAAC;IACZ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE;YACjB,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,CAAC,EAAE,KAAK,CAAC,CAAC;IACZ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;QAChC,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5D,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ;QACvC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ;QACvC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO;QACtC,MAAM,CAAC,kBAAkB,CAAC,IAAI,EAAE,YAAY,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;QACpF,MAAM,CAAC,kBAAkB,CAAC,IAAI,EAAE,YAAY,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IACrF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,EAAE,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAChE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;QAChC,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5B,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC,EAAE,MAAM,CAAC,CAAC;IAEX,EAAE,CAAC,OAAO,EAAE,GAAG,EAAE;QACf,QAAQ,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,IAAI,GAAS,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;QAClE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,kCAAkC;QACpD,MAAM,CAAC,kBAAkB,CAAC,IAAI,EAAE,YAAY,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IACrF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,IAAI,GAAS,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;QAClE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,aAAa;QACrD,MAAM,CAAC,kBAAkB,CAAC,IAAI,EAAE,YAAY,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IACrF,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}