postchain-client 1.0.2 → 1.1.0

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

@@ -0,0 +1,130 @@
+/**
+ *
+ * @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;
+    constructor: typeof ProofNode;
+}
+/**
+ *
+ * @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);
+    constructor: typeof ProofNodeSimple;
+}
+/**
+ *
+ * @param {Buffer} merkleHash
+ */
+export function ProofHashedLeaf(merkleHash: Buffer): void;
+export class ProofHashedLeaf {
+    /**
+     *
+     * @param {Buffer} merkleHash
+     */
+    constructor(merkleHash: Buffer);
+    merkleHash: Buffer;
+    constructor: typeof ProofHashedLeaf;
+    /**
+     * @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;
+    constructor: typeof ProofValueLeaf;
+}
+/**
+ *
+ * @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;
+    constructor: typeof ProofNodeArrayHead;
+}
+/**
+ *
+ * @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;
+    constructor: typeof ProofNodeDictHead;
+}
+/**
+ *
+ */
+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

@@ -0,0 +1,116 @@
+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

@@ -0,0 +1 @@
+{"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;QACpC,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAA;KAChD;SAAM;QACL,OAAO,KAAK,CAAA;KACb;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;QAClC,OAAO,CAAC,CAAA;KACT;SAAM,IAAI,IAAI,YAAY,eAAe,EAAE;QAC1C,OAAO,CAAC,CAAA;KACT;SAAM,IAAI,IAAI,YAAY,SAAS,EAAE;QACpC,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;KACzF;SAAM;QACL,MAAM,IAAI,KAAK,CAAC,sCAAsC,GAAG,OAAO,IAAI,CAAC,CAAA;KACtE;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

@@ -0,0 +1,47 @@
+/**
+ *
+ */
+export function MerkleProofTreeFactory(): void;
+export class MerkleProofTreeFactory {
+    /**
+     * @param {BinaryTree} orginalTree
+     */
+    buildFromBinaryTree(orginalTree: 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

@@ -0,0 +1,121 @@
+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} orginalTree
+ */
+MerkleProofTreeFactory.prototype.buildFromBinaryTree = function (orginalTree, calculator) {
+    var rootElem = this.buildFromBinaryTreeInternal(orginalTree.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

@@ -0,0 +1 @@
+{"version":3,"file":"merkleprooftreefactory.js","sourceRoot":"","sources":["../../../../src/merkle/proof/merkleprooftreefactory.js"],"names":[],"mappings":"AAAA,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,WAAW,EAAE,UAAU;IACrF,IAAI,QAAQ,GAAG,IAAI,CAAC,2BAA2B,CAAC,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;IAC7E,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;QAC7B,OAAO,IAAI,eAAe,CAAC,UAAU,CAAC,CAAA;KACvC;SAAM,IAAI,IAAI,YAAY,IAAI,EAAE;QAC/B,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QAC5B,IAAI,QAAQ,IAAI,IAAI,EAAE;YACpB,IAAI,QAAQ,YAAY,eAAe,EAAE;gBACvC,OAAO,IAAI,cAAc,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAA;aAC3D;iBAAM;gBACL,MAAM,IAAI,KAAK,CAAC,qFAAqF,GAAG,QAAQ,CAAC,CAAA;aAClH;SACF;aAAM;YACL,cAAc;YACd,IAAI,IAAI,GAAG,UAAU,CAAC,iBAAiB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;YACrD,OAAO,IAAI,eAAe,CAAC,IAAI,CAAC,CAAA;SACjC;KACF;SAAM,IAAI,IAAI,YAAY,eAAe,EAAE;QAC1C,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QAC5B,IAAI,QAAQ,IAAI,IAAI,EAAE;YACpB,IAAI,QAAQ,YAAY,eAAe,EAAE;gBACvC,mBAAmB;gBACnB,OAAO,IAAI,cAAc,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAA;aAC3D;iBAAM;gBACL,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;aAC1C;SACF;aAAM;YACL,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;SAC1C;KACF;SAAM,IAAI,IAAI,YAAY,IAAI,EAAE;QAC/B,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;KAC1C;SAAM;QACL,MAAM,IAAI,KAAK,CAAC,gBAAgB,GAAG,IAAI,CAAC,CAAA;KACzC;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;QACvE,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;KACtC;SAAM;QACL,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;KACtD;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;QACpB,OAAO,QAAQ,CAAC,QAAQ,CAAA;KACzB;SAAM;QACL,OAAO,IAAI,CAAA;KACZ;AACH,CAAC,CAAA;AAED;;;;GAIG;AACH,sBAAsB,CAAC,SAAS,CAAC,sBAAsB,GAAG,UAAS,IAAI,EAAE,IAAI,EAAE,KAAK;IAClF,IAAI,IAAI,YAAY,aAAa,EAAE;QACjC,OAAO,IAAI,kBAAkB,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,4BAA4B,CAAC,IAAI,CAAC,CAAC,CAAA;KACpF;SAAM,IAAI,IAAI,YAAY,YAAY,EAAE;QACvC,OAAO,IAAI,iBAAiB,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,4BAA4B,CAAC,IAAI,CAAC,CAAC,CAAA;KACnF;SAAM,IAAI,IAAI,YAAY,IAAI,EAAE;QAC/B,OAAO,IAAI,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;KACxC;SAAM;QACL,MAAM,IAAI,KAAK,CAAC,4CAA4C,GAAG,IAAI,CAAC,CAAA;KACrE;AACH,CAAC,CAAA;AAED,MAAM,CAAC,OAAO,GAAG,EAAC,sBAAsB,EAAC,CAAA"}

package/built/src/merkle/types.js

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

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

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

package/built/src/restclient/errors.js

@@ -0,0 +1,54 @@
+export class TxRejectedError extends Error {
+    constructor(rejectReason) {
+        super("Transaction was rejected");
+        this.name = "TxRejectedError";
+        this.fullReason = rejectReason;
+        const parsed = rejectReason.match(/^\[(.+)\] Operation '(.+)' failed: (.+)$/);
+        if (parsed) {
+            this.shortReason = parsed[3];
+            this.rellLine = parsed[1];
+            this.operation = parsed[2];
+        }
+    }
+}
+export class UnexpectedStatusError extends Error {
+    constructor(status) {
+        super(`Unexpected status code from server: ${status}`);
+    }
+}
+export class LostMessageError extends Error {
+    constructor() {
+        super(`Server lost our message`);
+    }
+}
+export class UnexpectedResponseError extends Error {
+    constructor() {
+        super(`got unexpected response from server`);
+    }
+}
+export class UnvalidTxRidException extends Error {
+    constructor(txRID) {
+        super(`expected length 32 of txRID, but got ${txRID.length}`);
+    }
+}
+export class SerializedTransactionFormatException extends Error {
+    constructor() {
+        super(`messageHash is not a Buffer`);
+    }
+}
+export class GetBridFromChainException extends Error {
+    constructor(chainId, reason) {
+        super(`Error resolving BRID for chainId ${chainId}, reason: ${reason}`);
+    }
+}
+export class EmptyListOfUrlsException extends Error {
+    constructor() {
+        super(`Failed to initialize rest client with empty list of urls`);
+    }
+}
+export class InvalidBlochchainRIDException extends Error {
+    constructor() {
+        super(`Failed to initialize rest client with blockchain RID that is not 32 bytes`);
+    }
+}
+//# sourceMappingURL=errors.js.map

package/built/src/restclient/errors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"errors.js","sourceRoot":"","sources":["../../../src/restclient/errors.ts"],"names":[],"mappings":"AAAA,MAAM,OAAO,eAAgB,SAAQ,KAAK;IAOxC,YAAY,YAAoB;QAC9B,KAAK,CAAC,0BAA0B,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI,GAAG,iBAAiB,CAAC;QAC9B,IAAI,CAAC,UAAU,GAAG,YAAY,CAAC;QAC/B,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAC/B,0CAA0C,CAC3C,CAAC;QACF,IAAI,MAAM,EAAE;YACV,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;SAC5B;IACH,CAAC;CACF;AAED,MAAM,OAAO,qBAAsB,SAAQ,KAAK;IAC9C,YAAY,MAAc;QACxB,KAAK,CAAC,uCAAuC,MAAM,EAAE,CAAC,CAAC;IACzD,CAAC;CACF;AAED,MAAM,OAAO,gBAAiB,SAAQ,KAAK;IACzC;QACE,KAAK,CAAC,yBAAyB,CAAC,CAAC;IACnC,CAAC;CACF;AAED,MAAM,OAAO,uBAAwB,SAAQ,KAAK;IAChD;QACE,KAAK,CAAC,qCAAqC,CAAC,CAAC;IAC/C,CAAC;CACF;AAED,MAAM,OAAO,qBAAsB,SAAQ,KAAK;IAC9C,YAAY,KAAa;QACvB,KAAK,CAAC,wCAAwC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IAChE,CAAC;CACF;AAED,MAAM,OAAO,oCAAqC,SAAQ,KAAK;IAC7D;QACE,KAAK,CAAC,6BAA6B,CAAC,CAAC;IACvC,CAAC;CACF;AAED,MAAM,OAAO,yBAA0B,SAAQ,KAAK;IAClD,YAAY,OAAe,EAAE,MAAc;QACzC,KAAK,CAAC,oCAAoC,OAAO,aAAa,MAAM,EAAE,CAAC,CAAC;IAC1E,CAAC;CACF;AACD,MAAM,OAAO,wBAAyB,SAAQ,KAAK;IACjD;QACE,KAAK,CAAC,0DAA0D,CAAC,CAAC;IACpE,CAAC;CACF;AACD,MAAM,OAAO,6BAA8B,SAAQ,KAAK;IACtD;QACE,KAAK,CACH,2EAA2E,CAC5E,CAAC;IACJ,CAAC;CACF"}

package/built/src/restclient/interfaces.d.ts

@@ -1,4 +1,5 @@
 /// <reference types="node" />
+import { RawGtv } from "../gtv/types";
 import { QueryObject, ResponseObjectProof, RestClientConfig, StatusObject } from "./types";
 export interface RestClient {
     config: RestClientConfig;
@@ -6,7 +7,7 @@ export interface RestClient {
     postTransaction: (serializedTransaction: Buffer, callback: (error: Error, responseObject: any) => void) => void;
     getConfirmationProof: (txRID: Buffer, callback: (error: Error, responseObjectProof: ResponseObjectProof) => void) => void;
     status: (txRID: Buffer, callback: (error: Error, responseBody: StatusObject) => void) => void;
-    query: (queryObject: QueryObject, callback?: (error: Error, messages: any) => void) => Promise<any>;
+    query: (queryObject: QueryObject, callback?: (error: Error, messages: any) => void) => Promise<RawGtv>;
     waitConfirmation: (txRID: Buffer) => Promise<null | Error>;
     postAndWaitConfirmation: (serializedTransaction: Buffer, txRID: Buffer, validate?: boolean) => Promise<null>;
     getEndpointPool: () => string[];

package/built/src/restclient/interfaces.js

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

package/built/src/restclient/interfaces.js.map

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