ccxt
Version:
78 lines (73 loc) • 2.8 kB
JavaScript
;
Object.defineProperty(exports, '__esModule', { value: true });
require('../../noble-curves/abstract/modular.js');
require('../../scure-starknet/index.js');
require('../constants.js');
require('../../scure-base/index.js');
require('../../noble-curves/abstract/utils.js');
var classHash = require('./hash/classHash.js');
// ----------------------------------------------------------------------------
class MerkleTree {
constructor(leafHashes, hashMethod = classHash.computePedersenHash) {
this.branches = [];
this.hashMethod = hashMethod;
this.leaves = leafHashes;
this.root = this.build(leafHashes);
}
/**
* Create Merkle tree
* @param leaves hex-string array
* @returns format: hex-string; Merkle tree root
*/
build(leaves) {
if (leaves.length === 1) {
return leaves[0];
}
if (leaves.length !== this.leaves.length) {
this.branches.push(leaves);
}
const newLeaves = [];
for (let i = 0; i < leaves.length; i += 2) {
if (i + 1 === leaves.length) {
newLeaves.push(MerkleTree.hash(leaves[i], '0x0', this.hashMethod));
}
else {
newLeaves.push(MerkleTree.hash(leaves[i], leaves[i + 1], this.hashMethod));
}
}
return this.build(newLeaves);
}
/**
* Create hash from ordered a and b, Pedersen hash default
* @returns format: hex-string
*/
static hash(a, b, hashMethod = classHash.computePedersenHash) {
const [aSorted, bSorted] = [BigInt(a), BigInt(b)].sort((x, y) => (x >= y ? 1 : -1));
return hashMethod(aSorted, bSorted);
}
/**
* Return path to leaf
* @param leaf hex-string
* @param branch hex-string array
* @param hashPath hex-string array
* @returns format: hex-string array
*/
getProof(leaf, branch = this.leaves, hashPath = []) {
const index = branch.indexOf(leaf);
if (index === -1) {
throw new Error('leaf not found');
}
if (branch.length === 1) {
return hashPath;
}
const isLeft = index % 2 === 0;
const neededBranch = (isLeft ? branch[index + 1] : branch[index - 1]) ?? '0x0';
const newHashPath = [...hashPath, neededBranch];
const currentBranchLevelIndex = this.leaves.length === branch.length
? -1
: this.branches.findIndex((b) => b.length === branch.length);
const nextBranch = this.branches[currentBranchLevelIndex + 1] ?? [this.root];
return this.getProof(MerkleTree.hash(isLeft ? leaf : neededBranch, isLeft ? neededBranch : leaf, this.hashMethod), nextBranch, newHashPath);
}
}
exports.MerkleTree = MerkleTree;