Socket
Socket
Sign inDemoInstall

merkletreejs

Package Overview
Dependencies
3
Maintainers
1
Versions
77
Alerts
File Explorer

Advanced tools

Install Socket

Detect and block malicious and high-risk dependencies

Install

Comparing version 0.2.13 to 0.2.14

16

dist/MerkleTree.d.ts

@@ -176,3 +176,3 @@ /// <reference types="node" />

*/
getProof(leaf: Buffer, index?: number): any[];
getProof(leaf: Buffer | string, index?: number): any[];
/**

@@ -190,3 +190,3 @@ * getHexProof

*/
getHexProof(leaf: Buffer, index?: number): string[];
getHexProof(leaf: Buffer | string, index?: number): string[];
/**

@@ -204,3 +204,3 @@ * getPositionalHexProof

*/
getPositionalHexProof(leaf: Buffer, index?: number): (string | number)[][];
getPositionalHexProof(leaf: Buffer | string, index?: number): (string | number)[][];
/**

@@ -264,3 +264,3 @@ * marshalProof

*/
getHexMultiProof(tree: Buffer[], indices: number[]): string[];
getHexMultiProof(tree: Buffer[] | string[], indices: number[]): string[];
/**

@@ -280,3 +280,3 @@ * getProofFlags

*/
getProofFlags(leaves: any[], proofs: Buffer[]): boolean[];
getProofFlags(leaves: any[], proofs: Buffer[] | string[]): boolean[];
/**

@@ -298,3 +298,3 @@ * verify

*/
verify(proof: any[], targetNode: Buffer, root: Buffer): boolean;
verify(proof: any[], targetNode: Buffer | string, root: Buffer | string): boolean;
/**

@@ -320,3 +320,3 @@ * verifyMultiProof

*/
verifyMultiProof(root: Buffer, indices: number[], leaves: Buffer[], depth: number, proof: Buffer[]): boolean;
verifyMultiProof(root: Buffer | string, indices: number[], leaves: Buffer[] | string[], depth: number, proof: Buffer[] | string[]): boolean;
/**

@@ -383,3 +383,3 @@ * getDepth

*/
static getMultiProof(tree: Buffer[], indices: number[]): Buffer[];
static getMultiProof(tree: Buffer[] | string[], indices: number[]): Buffer[];
/**

@@ -386,0 +386,0 @@ * getPairNode

@@ -575,2 +575,3 @@ "use strict";

}
const _proofs = proofs.map(this.bufferify);
const tested = [];

@@ -584,3 +585,3 @@ const flags = [];

const pairElement = this._getPairNode(layer, idx);
const proofUsed = proofs.includes(layer[idx]) || proofs.includes(pairElement);
const proofUsed = _proofs.includes(layer[idx]) || _proofs.includes(pairElement);
pairElement && flags.push(!proofUsed);

@@ -633,2 +634,6 @@ tested.push(layer[idx]);

}
else if (Buffer.isBuffer(node)) {
data = node;
isLeftNode = true;
}
else if (node instanceof Object) {

@@ -635,0 +640,0 @@ data = this.bufferify(node.data);

{
"name": "merkletreejs",
"version": "0.2.13",
"version": "0.2.14",
"description": "Construct Merkle Trees and verify proofs",

@@ -5,0 +5,0 @@ "main": "dist/index.js",

Sorry, the diff of this file is too big to display

SocketSocket SOC 2 Logo

Product

  • Package Alerts
  • Integrations
  • Docs
  • Pricing
  • FAQ
  • Roadmap

Stay in touch

Get open source security insights delivered straight into your inbox.


  • Terms
  • Privacy
  • Security

Made with ⚡️ by Socket Inc