Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 | 27x 2x 2x 2x 2x 2x 2x 2x 30x 2x 2x 2x 2x 71688x 71688x 71688x 71688x 2x 30x 30x 30x 71697x 71697x 71697x 71697x 71697x 30x 143396x 71688x 143385x 71688x 71688x 71688x 4x 27x 2x 2x 2x 71688x 2x 2x 2x | import { Field, Poseidon } from "o1js";
type MerkleNodesMap = {
[level: number]: {
[nodes: string]: Field;
};
};
type MerkleNode = {
level: number;
index: bigint;
digest: Field;
};
class DynamicMerkleTree {
private height: number;
private nodes: MerkleNodesMap;
protected zeroes: Field[];
private size: number;
constructor(height: number) {
this.height = height;
this.nodes = {};
this.generateZeroes();
this.size = 0;
}
private generateZeroes() {
this.zeroes = new Array(this.height);
this.zeroes[0] = Field(0);
for (let i = 1; i < this.height; i += 1) {
this.zeroes[i] = Poseidon.hash([this.zeroes[i - 1], this.zeroes[i - 1]]);
}
}
private recalculateMerkleTree(newHeight: number) {
Iif (newHeight <= this.height) {
throw Error("New height must not be lower or equal to existed");
}
this.height = newHeight;
this.generateZeroes();
const levelZeroNodes = this.nodes[0];
Iif (!levelZeroNodes) {
return [];
}
const nodes = Object.entries(levelZeroNodes).map(([index, digest]) => ({
level: 0,
index: BigInt(index),
digest,
}));
this.setLeaves(nodes);
}
public getRoot() {
return this.getNode(this.height - 1, BigInt(0));
}
public setLeaves(leaves: MerkleNode[]) {
Iif (this.size + leaves.length >= this.leafCount) {
this.recalculateMerkleTree(this.height + 1);
}
let cacheSet = new Set<bigint>();
for (let i = 0; i < leaves.length; i++) {
const currentIndex = leaves[i].index;
const parentIndex =
(currentIndex - (currentIndex % BigInt(2))) / BigInt(2);
cacheSet.add(parentIndex);
this.setLeaf(currentIndex, leaves[i].digest);
}
for (let level = 1; level < this.height; level += 1) {
const intermediateCacheSet = new Set<bigint>();
intermediateCacheSet.clear();
for (const currentIndex of cacheSet) {
const parentIndex =
(currentIndex - (currentIndex % BigInt(2))) / BigInt(2);
intermediateCacheSet.add(parentIndex);
const leftChild = this.getNode(level - 1, currentIndex * BigInt(2));
const rightChild = this.getNode(
level - 1,
currentIndex * BigInt(2) + BigInt(1)
);
this.setNode({
level,
index: currentIndex,
digest: Poseidon.hash([leftChild, rightChild]),
});
}
cacheSet = intermediateCacheSet;
}
}
public getNode(level: number, index: bigint): Field {
return this.nodes[level]?.[index.toString()] ?? this.zeroes[level];
}
public isNodeExist(level: number, index: bigint): boolean {
return !!this.nodes[level]?.[index.toString()];
}
public setNode(node: MerkleNode) {
(this.nodes[node.level] ??= {})[node.index.toString()] = node.digest;
}
public setLeaf(index: bigint, digest: Field) {
if (!this.isNodeExist(0, index)) {
this.size += 1;
}
this.setNode({
level: 0,
index,
digest,
});
}
get leafCount() {
return 2 ** (this.height - 1);
}
}
export function calculateMerkleTreeRootFast(
height: number,
fields: Field[]
): { leafCount: number; root: Field } {
const nodes: MerkleNode[] = [];
const length = fields.length;
for (let i = 0; i < length; i++) {
nodes.push({ level: 0, index: BigInt(i), digest: fields[i] });
}
const tree: DynamicMerkleTree = new DynamicMerkleTree(height);
tree.setLeaves(nodes);
return { leafCount: tree.leafCount, root: tree.getRoot() };
}
|