@aztec/world-state 0.1.0-alpha11
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/.eslintrc.cjs +1 -0
- package/.tsbuildinfo +1 -0
- package/README.md +40 -0
- package/dest/index.d.ts +4 -0
- package/dest/index.d.ts.map +1 -0
- package/dest/index.js +4 -0
- package/dest/merkle-tree/merkle_tree_operations_facade.d.ts +117 -0
- package/dest/merkle-tree/merkle_tree_operations_facade.d.ts.map +1 -0
- package/dest/merkle-tree/merkle_tree_operations_facade.js +133 -0
- package/dest/synchroniser/config.d.ts +19 -0
- package/dest/synchroniser/config.d.ts.map +1 -0
- package/dest/synchroniser/config.js +13 -0
- package/dest/synchroniser/index.d.ts +3 -0
- package/dest/synchroniser/index.d.ts.map +1 -0
- package/dest/synchroniser/index.js +3 -0
- package/dest/synchroniser/server_world_state_synchroniser.d.ts +62 -0
- package/dest/synchroniser/server_world_state_synchroniser.d.ts.map +1 -0
- package/dest/synchroniser/server_world_state_synchroniser.js +134 -0
- package/dest/synchroniser/server_world_state_synchroniser.test.d.ts +2 -0
- package/dest/synchroniser/server_world_state_synchroniser.test.d.ts.map +1 -0
- package/dest/synchroniser/server_world_state_synchroniser.test.js +215 -0
- package/dest/synchroniser/world_state_synchroniser.d.ts +34 -0
- package/dest/synchroniser/world_state_synchroniser.d.ts.map +1 -0
- package/dest/synchroniser/world_state_synchroniser.js +11 -0
- package/dest/utils.d.ts +12 -0
- package/dest/utils.d.ts.map +1 -0
- package/dest/utils.js +14 -0
- package/dest/world-state-db/index.d.ts +165 -0
- package/dest/world-state-db/index.d.ts.map +1 -0
- package/dest/world-state-db/index.js +21 -0
- package/dest/world-state-db/merkle_trees.d.ts +200 -0
- package/dest/world-state-db/merkle_trees.d.ts.map +1 -0
- package/dest/world-state-db/merkle_trees.js +373 -0
- package/package.json +15 -0
- package/src/index.ts +3 -0
- package/src/merkle-tree/merkle_tree_operations_facade.ts +164 -0
- package/src/synchroniser/config.ts +27 -0
- package/src/synchroniser/index.ts +2 -0
- package/src/synchroniser/server_world_state_synchroniser.test.ts +281 -0
- package/src/synchroniser/server_world_state_synchroniser.ts +151 -0
- package/src/synchroniser/world_state_synchroniser.ts +36 -0
- package/src/utils.ts +24 -0
- package/src/world-state-db/index.ts +215 -0
- package/src/world-state-db/merkle_trees.ts +547 -0
- package/tsconfig.json +23 -0
|
@@ -0,0 +1,373 @@
|
|
|
1
|
+
import { CONTRACT_TREE_HEIGHT, CONTRACT_TREE_ROOTS_TREE_HEIGHT, CircuitsWasm, L1_TO_L2_MESSAGES_ROOTS_TREE_HEIGHT, L1_TO_L2_MESSAGES_TREE_HEIGHT, NULLIFIER_TREE_HEIGHT, PRIVATE_DATA_TREE_HEIGHT, PRIVATE_DATA_TREE_ROOTS_TREE_HEIGHT, PUBLIC_DATA_TREE_HEIGHT, } from '@aztec/circuits.js';
|
|
2
|
+
import { Pedersen, SparseTree, StandardIndexedTree, StandardTree, newTree, } from '@aztec/merkle-tree';
|
|
3
|
+
import { INITIAL_NULLIFIER_TREE_SIZE, } from './index.js';
|
|
4
|
+
import { MerkleTreeOperationsFacade } from '../merkle-tree/merkle_tree_operations_facade.js';
|
|
5
|
+
import { MerkleTreeId, merkleTreeIds } from '@aztec/types';
|
|
6
|
+
import { SerialQueue } from '@aztec/foundation/fifo';
|
|
7
|
+
import { createDebugLogger } from '@aztec/foundation/log';
|
|
8
|
+
/**
|
|
9
|
+
* A convenience class for managing multiple merkle trees.
|
|
10
|
+
*/
|
|
11
|
+
export class MerkleTrees {
|
|
12
|
+
constructor(db, log = createDebugLogger('aztec:merkle_trees')) {
|
|
13
|
+
this.db = db;
|
|
14
|
+
this.log = log;
|
|
15
|
+
this.trees = [];
|
|
16
|
+
this.jobQueue = new SerialQueue();
|
|
17
|
+
}
|
|
18
|
+
/**
|
|
19
|
+
* Initialises the collection of Merkle Trees.
|
|
20
|
+
* @param optionalWasm - WASM instance to use for hashing (if not provided PrimitivesWasm will be used).
|
|
21
|
+
*/
|
|
22
|
+
async init(optionalWasm) {
|
|
23
|
+
const wasm = optionalWasm ?? (await CircuitsWasm.get());
|
|
24
|
+
const hasher = new Pedersen(wasm);
|
|
25
|
+
const contractTree = await newTree(StandardTree, this.db, hasher, `${MerkleTreeId[MerkleTreeId.CONTRACT_TREE]}`, CONTRACT_TREE_HEIGHT);
|
|
26
|
+
const contractTreeRootsTree = await newTree(StandardTree, this.db, hasher, `${MerkleTreeId[MerkleTreeId.CONTRACT_TREE_ROOTS_TREE]}`, CONTRACT_TREE_ROOTS_TREE_HEIGHT);
|
|
27
|
+
const nullifierTree = await newTree(StandardIndexedTree, this.db, hasher, `${MerkleTreeId[MerkleTreeId.NULLIFIER_TREE]}`, NULLIFIER_TREE_HEIGHT, INITIAL_NULLIFIER_TREE_SIZE);
|
|
28
|
+
const privateDataTree = await newTree(StandardTree, this.db, hasher, `${MerkleTreeId[MerkleTreeId.PRIVATE_DATA_TREE]}`, PRIVATE_DATA_TREE_HEIGHT);
|
|
29
|
+
const privateDataTreeRootsTree = await newTree(StandardTree, this.db, hasher, `${MerkleTreeId[MerkleTreeId.PRIVATE_DATA_TREE_ROOTS_TREE]}`, PRIVATE_DATA_TREE_ROOTS_TREE_HEIGHT);
|
|
30
|
+
const publicDataTree = await newTree(SparseTree, this.db, hasher, `${MerkleTreeId[MerkleTreeId.PUBLIC_DATA_TREE]}`, PUBLIC_DATA_TREE_HEIGHT);
|
|
31
|
+
const l1Tol2MessagesTree = await newTree(StandardTree, this.db, hasher, `${MerkleTreeId[MerkleTreeId.L1_TO_L2_MESSAGES_TREE]}`, L1_TO_L2_MESSAGES_TREE_HEIGHT);
|
|
32
|
+
const l1Tol2MessagesRootsTree = await newTree(StandardTree, this.db, hasher, `${MerkleTreeId[MerkleTreeId.L1_TO_L2_MESSAGES_ROOTS_TREE]}`, L1_TO_L2_MESSAGES_ROOTS_TREE_HEIGHT);
|
|
33
|
+
this.trees = [
|
|
34
|
+
contractTree,
|
|
35
|
+
contractTreeRootsTree,
|
|
36
|
+
nullifierTree,
|
|
37
|
+
privateDataTree,
|
|
38
|
+
privateDataTreeRootsTree,
|
|
39
|
+
publicDataTree,
|
|
40
|
+
l1Tol2MessagesTree,
|
|
41
|
+
l1Tol2MessagesRootsTree,
|
|
42
|
+
];
|
|
43
|
+
this.jobQueue.start();
|
|
44
|
+
// The roots trees must contain the empty roots of their data trees
|
|
45
|
+
await this.updateHistoricRootsTrees(true);
|
|
46
|
+
const historicRootsTrees = [contractTreeRootsTree, privateDataTreeRootsTree, l1Tol2MessagesRootsTree];
|
|
47
|
+
await Promise.all(historicRootsTrees.map(tree => tree.commit()));
|
|
48
|
+
}
|
|
49
|
+
/**
|
|
50
|
+
* Method to asynchronously create and initialise a MerkleTrees instance.
|
|
51
|
+
* @param db - The db instance to use for data persistance.
|
|
52
|
+
* @param wasm - WASM instance to use for hashing (if not provided PrimitivesWasm will be used).
|
|
53
|
+
* @returns - A fully initialised MerkleTrees instance.
|
|
54
|
+
*/
|
|
55
|
+
static async new(db, wasm) {
|
|
56
|
+
const merkleTrees = new MerkleTrees(db);
|
|
57
|
+
await merkleTrees.init(wasm);
|
|
58
|
+
return merkleTrees;
|
|
59
|
+
}
|
|
60
|
+
/**
|
|
61
|
+
* Stops the job queue (waits for all jobs to finish).
|
|
62
|
+
*/
|
|
63
|
+
async stop() {
|
|
64
|
+
await this.jobQueue.end();
|
|
65
|
+
}
|
|
66
|
+
/**
|
|
67
|
+
* Gets a view of this db that returns uncommitted data.
|
|
68
|
+
* @returns - A facade for this instance.
|
|
69
|
+
*/
|
|
70
|
+
asLatest() {
|
|
71
|
+
return new MerkleTreeOperationsFacade(this, true);
|
|
72
|
+
}
|
|
73
|
+
/**
|
|
74
|
+
* Gets a view of this db that returns committed data only.
|
|
75
|
+
* @returns - A facade for this instance.
|
|
76
|
+
*/
|
|
77
|
+
asCommitted() {
|
|
78
|
+
return new MerkleTreeOperationsFacade(this, false);
|
|
79
|
+
}
|
|
80
|
+
/**
|
|
81
|
+
* Inserts into the roots trees (CONTRACT_TREE_ROOTS_TREE, PRIVATE_DATA_TREE_ROOTS_TREE, L1_TO_L2_MESSAGES_TREE_ROOTS_TREE)
|
|
82
|
+
* the current roots of the corresponding trees (CONTRACT_TREE, PRIVATE_DATA_TREE, L1_TO_L2_MESSAGES_TREE).
|
|
83
|
+
* @param includeUncommitted - Indicates whether to include uncommitted data.
|
|
84
|
+
*/
|
|
85
|
+
async updateHistoricRootsTrees(includeUncommitted) {
|
|
86
|
+
for (const [newTree, rootTree] of [
|
|
87
|
+
[MerkleTreeId.PRIVATE_DATA_TREE, MerkleTreeId.PRIVATE_DATA_TREE_ROOTS_TREE],
|
|
88
|
+
[MerkleTreeId.CONTRACT_TREE, MerkleTreeId.CONTRACT_TREE_ROOTS_TREE],
|
|
89
|
+
[MerkleTreeId.L1_TO_L2_MESSAGES_TREE, MerkleTreeId.L1_TO_L2_MESSAGES_ROOTS_TREE],
|
|
90
|
+
]) {
|
|
91
|
+
const newTreeInfo = await this.getTreeInfo(newTree, includeUncommitted);
|
|
92
|
+
await this.appendLeaves(rootTree, [newTreeInfo.root]);
|
|
93
|
+
}
|
|
94
|
+
}
|
|
95
|
+
/**
|
|
96
|
+
* Gets the tree info for the specified tree.
|
|
97
|
+
* @param treeId - Id of the tree to get information from.
|
|
98
|
+
* @param includeUncommitted - Indicates whether to include uncommitted data.
|
|
99
|
+
* @returns The tree info for the specified tree.
|
|
100
|
+
*/
|
|
101
|
+
async getTreeInfo(treeId, includeUncommitted) {
|
|
102
|
+
return await this.synchronise(() => this._getTreeInfo(treeId, includeUncommitted));
|
|
103
|
+
}
|
|
104
|
+
/**
|
|
105
|
+
* Get the current roots of the commitment trees.
|
|
106
|
+
* @param includeUncommitted - Indicates whether to include uncommitted data.
|
|
107
|
+
* @returns The current roots of the trees.
|
|
108
|
+
*/
|
|
109
|
+
getCommitmentTreeRoots(includeUncommitted) {
|
|
110
|
+
const roots = [
|
|
111
|
+
MerkleTreeId.PRIVATE_DATA_TREE,
|
|
112
|
+
MerkleTreeId.CONTRACT_TREE,
|
|
113
|
+
MerkleTreeId.L1_TO_L2_MESSAGES_TREE,
|
|
114
|
+
MerkleTreeId.NULLIFIER_TREE,
|
|
115
|
+
].map(tree => this.trees[tree].getRoot(includeUncommitted));
|
|
116
|
+
return {
|
|
117
|
+
privateDataTreeRoot: roots[0],
|
|
118
|
+
contractDataTreeRoot: roots[1],
|
|
119
|
+
l1Tol2MessagesTreeRoot: roots[2],
|
|
120
|
+
nullifierTreeRoot: roots[3],
|
|
121
|
+
};
|
|
122
|
+
}
|
|
123
|
+
/**
|
|
124
|
+
* Gets the value at the given index.
|
|
125
|
+
* @param treeId - The ID of the tree to get the leaf value from.
|
|
126
|
+
* @param index - The index of the leaf.
|
|
127
|
+
* @param includeUncommitted - Indicates whether to include uncommitted changes.
|
|
128
|
+
* @returns Leaf value at the given index (undefined if not found).
|
|
129
|
+
*/
|
|
130
|
+
async getLeafValue(treeId, index, includeUncommitted) {
|
|
131
|
+
return await this.synchronise(() => this.trees[treeId].getLeafValue(index, includeUncommitted));
|
|
132
|
+
}
|
|
133
|
+
/**
|
|
134
|
+
* Gets the sibling path for a leaf in a tree.
|
|
135
|
+
* @param treeId - The ID of the tree.
|
|
136
|
+
* @param index - The index of the leaf.
|
|
137
|
+
* @param includeUncommitted - Indicates whether the sibling path should incro include uncommitted data.
|
|
138
|
+
* @returns The sibling path for the leaf.
|
|
139
|
+
*/
|
|
140
|
+
async getSiblingPath(treeId, index, includeUncommitted) {
|
|
141
|
+
return await this.synchronise(() => this._getSiblingPath(treeId, index, includeUncommitted));
|
|
142
|
+
}
|
|
143
|
+
/**
|
|
144
|
+
* Appends leaves to a tree.
|
|
145
|
+
* @param treeId - The ID of the tree.
|
|
146
|
+
* @param leaves - The leaves to append.
|
|
147
|
+
* @returns Empty promise.
|
|
148
|
+
*/
|
|
149
|
+
async appendLeaves(treeId, leaves) {
|
|
150
|
+
return await this.synchronise(() => this._appendLeaves(treeId, leaves));
|
|
151
|
+
}
|
|
152
|
+
/**
|
|
153
|
+
* Commits all pending updates.
|
|
154
|
+
* @returns Empty promise.
|
|
155
|
+
*/
|
|
156
|
+
async commit() {
|
|
157
|
+
return await this.synchronise(() => this._commit());
|
|
158
|
+
}
|
|
159
|
+
/**
|
|
160
|
+
* Rolls back all pending updates.
|
|
161
|
+
* @returns Empty promise.
|
|
162
|
+
*/
|
|
163
|
+
async rollback() {
|
|
164
|
+
return await this.synchronise(() => this._rollback());
|
|
165
|
+
}
|
|
166
|
+
/**
|
|
167
|
+
* Finds the index of the largest leaf whose value is less than or equal to the provided value.
|
|
168
|
+
* @param treeId - The ID of the tree to search.
|
|
169
|
+
* @param value - The value to be inserted into the tree.
|
|
170
|
+
* @param includeUncommitted - If true, the uncommitted changes are included in the search.
|
|
171
|
+
* @returns The found leaf index and a flag indicating if the corresponding leaf's value is equal to `newValue`.
|
|
172
|
+
*/
|
|
173
|
+
async getPreviousValueIndex(treeId, value, includeUncommitted) {
|
|
174
|
+
return await this.synchronise(() => Promise.resolve(this._getIndexedTree(treeId).findIndexOfPreviousValue(value, includeUncommitted)));
|
|
175
|
+
}
|
|
176
|
+
/**
|
|
177
|
+
* Gets the leaf data at a given index and tree.
|
|
178
|
+
* @param treeId - The ID of the tree get the leaf from.
|
|
179
|
+
* @param index - The index of the leaf to get.
|
|
180
|
+
* @param includeUncommitted - Indicates whether to include uncommitted data.
|
|
181
|
+
* @returns Leaf data.
|
|
182
|
+
*/
|
|
183
|
+
async getLeafData(treeId, index, includeUncommitted) {
|
|
184
|
+
return await this.synchronise(() => Promise.resolve(this._getIndexedTree(treeId).getLatestLeafDataCopy(index, includeUncommitted)));
|
|
185
|
+
}
|
|
186
|
+
/**
|
|
187
|
+
* Returns the index of a leaf given its value, or undefined if no leaf with that value is found.
|
|
188
|
+
* @param treeId - The ID of the tree.
|
|
189
|
+
* @param value - The leaf value to look for.
|
|
190
|
+
* @param includeUncommitted - Indicates whether to include uncommitted data.
|
|
191
|
+
* @returns The index of the first leaf found with a given value (undefined if not found).
|
|
192
|
+
*/
|
|
193
|
+
async findLeafIndex(treeId, value, includeUncommitted) {
|
|
194
|
+
return await this.synchronise(async () => {
|
|
195
|
+
const tree = this.trees[treeId];
|
|
196
|
+
for (let i = 0n; i < tree.getNumLeaves(includeUncommitted); i++) {
|
|
197
|
+
const currentValue = await tree.getLeafValue(i, includeUncommitted);
|
|
198
|
+
if (currentValue && currentValue.equals(value)) {
|
|
199
|
+
return i;
|
|
200
|
+
}
|
|
201
|
+
}
|
|
202
|
+
return undefined;
|
|
203
|
+
});
|
|
204
|
+
}
|
|
205
|
+
/**
|
|
206
|
+
* Updates a leaf in a tree at a given index.
|
|
207
|
+
* @param treeId - The ID of the tree.
|
|
208
|
+
* @param leaf - The new leaf value.
|
|
209
|
+
* @param index - The index to insert into.
|
|
210
|
+
* @returns Empty promise.
|
|
211
|
+
*/
|
|
212
|
+
async updateLeaf(treeId, leaf, index) {
|
|
213
|
+
return await this.synchronise(() => this._updateLeaf(treeId, leaf, index));
|
|
214
|
+
}
|
|
215
|
+
/**
|
|
216
|
+
* Handles a single L2 block (i.e. Inserts the new commitments into the merkle tree).
|
|
217
|
+
* @param block - The L2 block to handle.
|
|
218
|
+
*/
|
|
219
|
+
async handleL2Block(block) {
|
|
220
|
+
await this.synchronise(() => this._handleL2Block(block));
|
|
221
|
+
}
|
|
222
|
+
/**
|
|
223
|
+
* Batch insert multiple leaves into the tree.
|
|
224
|
+
* @param treeId - The ID of the tree.
|
|
225
|
+
* @param leaves - Leaves to insert into the tree.
|
|
226
|
+
* @param treeHeight - Height of the tree.
|
|
227
|
+
* @param subtreeHeight - Height of the subtree.
|
|
228
|
+
* @returns The data for the leaves to be updated when inserting the new ones.
|
|
229
|
+
*/
|
|
230
|
+
async batchInsert(treeId, leaves, treeHeight, subtreeHeight) {
|
|
231
|
+
const tree = this.trees[treeId];
|
|
232
|
+
if (!('batchInsert' in tree)) {
|
|
233
|
+
throw new Error('Tree does not support `batchInsert` method');
|
|
234
|
+
}
|
|
235
|
+
return await this.synchronise(() => tree.batchInsert(leaves, treeHeight, subtreeHeight));
|
|
236
|
+
}
|
|
237
|
+
/**
|
|
238
|
+
* Waits for all jobs to finish before executing the given function.
|
|
239
|
+
* @param fn - The function to execute.
|
|
240
|
+
* @returns Promise containing the result of the function.
|
|
241
|
+
*/
|
|
242
|
+
async synchronise(fn) {
|
|
243
|
+
return await this.jobQueue.put(fn);
|
|
244
|
+
}
|
|
245
|
+
/**
|
|
246
|
+
* Returns the tree info for the specified tree id.
|
|
247
|
+
* @param treeId - Id of the tree to get information from.
|
|
248
|
+
* @param includeUncommitted - Indicates whether to include uncommitted data.
|
|
249
|
+
* @returns The tree info for the specified tree.
|
|
250
|
+
*/
|
|
251
|
+
_getTreeInfo(treeId, includeUncommitted) {
|
|
252
|
+
const treeInfo = {
|
|
253
|
+
treeId,
|
|
254
|
+
root: this.trees[treeId].getRoot(includeUncommitted),
|
|
255
|
+
size: this.trees[treeId].getNumLeaves(includeUncommitted),
|
|
256
|
+
depth: this.trees[treeId].getDepth(),
|
|
257
|
+
};
|
|
258
|
+
return Promise.resolve(treeInfo);
|
|
259
|
+
}
|
|
260
|
+
/**
|
|
261
|
+
* Returns an instance of an indexed tree.
|
|
262
|
+
* @param treeId - Id of the tree to get an instance of.
|
|
263
|
+
* @returns The indexed tree for the specified tree id.
|
|
264
|
+
*/
|
|
265
|
+
_getIndexedTree(treeId) {
|
|
266
|
+
return this.trees[treeId];
|
|
267
|
+
}
|
|
268
|
+
/**
|
|
269
|
+
* Returns the sibling path for a leaf in a tree.
|
|
270
|
+
* @param treeId - Id of the tree to get the sibling path from.
|
|
271
|
+
* @param index - Index of the leaf to get the sibling path for.
|
|
272
|
+
* @param includeUncommitted - Indicates whether to include uncommitted updates in the sibling path.
|
|
273
|
+
* @returns Promise containing the sibling path for the leaf.
|
|
274
|
+
*/
|
|
275
|
+
_getSiblingPath(treeId, index, includeUncommitted) {
|
|
276
|
+
return Promise.resolve(this.trees[treeId].getSiblingPath(index, includeUncommitted));
|
|
277
|
+
}
|
|
278
|
+
/**
|
|
279
|
+
* Appends leaves to a tree.
|
|
280
|
+
* @param treeId - Id of the tree to append leaves to.
|
|
281
|
+
* @param leaves - Leaves to append.
|
|
282
|
+
* @returns Empty promise.
|
|
283
|
+
*/
|
|
284
|
+
async _appendLeaves(treeId, leaves) {
|
|
285
|
+
const tree = this.trees[treeId];
|
|
286
|
+
if (!('appendLeaves' in tree)) {
|
|
287
|
+
throw new Error('Tree does not support `appendLeaves` method');
|
|
288
|
+
}
|
|
289
|
+
return await tree.appendLeaves(leaves);
|
|
290
|
+
}
|
|
291
|
+
async _updateLeaf(treeId, leaf, index) {
|
|
292
|
+
const tree = this.trees[treeId];
|
|
293
|
+
if (!('updateLeaf' in tree)) {
|
|
294
|
+
throw new Error('Tree does not support `updateLeaf` method');
|
|
295
|
+
}
|
|
296
|
+
return await tree.updateLeaf(leaf, index);
|
|
297
|
+
}
|
|
298
|
+
/**
|
|
299
|
+
* Commits all pending updates.
|
|
300
|
+
* @returns Empty promise.
|
|
301
|
+
*/
|
|
302
|
+
async _commit() {
|
|
303
|
+
for (const tree of this.trees) {
|
|
304
|
+
await tree.commit();
|
|
305
|
+
}
|
|
306
|
+
}
|
|
307
|
+
/**
|
|
308
|
+
* Rolls back all pending updates.
|
|
309
|
+
* @returns Empty promise.
|
|
310
|
+
*/
|
|
311
|
+
async _rollback() {
|
|
312
|
+
for (const tree of this.trees) {
|
|
313
|
+
await tree.rollback();
|
|
314
|
+
}
|
|
315
|
+
}
|
|
316
|
+
/**
|
|
317
|
+
* Handles a single L2 block (i.e. Inserts the new commitments into the merkle tree).
|
|
318
|
+
* @param l2Block - The L2 block to handle.
|
|
319
|
+
*/
|
|
320
|
+
async _handleL2Block(l2Block) {
|
|
321
|
+
const compareRoot = (root, treeId) => {
|
|
322
|
+
const treeRoot = this.trees[treeId].getRoot(true);
|
|
323
|
+
return treeRoot.equals(root.toBuffer());
|
|
324
|
+
};
|
|
325
|
+
const rootChecks = [
|
|
326
|
+
compareRoot(l2Block.endContractTreeSnapshot.root, MerkleTreeId.CONTRACT_TREE),
|
|
327
|
+
compareRoot(l2Block.endNullifierTreeSnapshot.root, MerkleTreeId.NULLIFIER_TREE),
|
|
328
|
+
compareRoot(l2Block.endPrivateDataTreeSnapshot.root, MerkleTreeId.PRIVATE_DATA_TREE),
|
|
329
|
+
compareRoot(l2Block.endPublicDataTreeRoot, MerkleTreeId.PUBLIC_DATA_TREE),
|
|
330
|
+
compareRoot(l2Block.endTreeOfHistoricContractTreeRootsSnapshot.root, MerkleTreeId.CONTRACT_TREE_ROOTS_TREE),
|
|
331
|
+
compareRoot(l2Block.endTreeOfHistoricPrivateDataTreeRootsSnapshot.root, MerkleTreeId.PRIVATE_DATA_TREE_ROOTS_TREE),
|
|
332
|
+
compareRoot(l2Block.endL1ToL2MessageTreeSnapshot.root, MerkleTreeId.L1_TO_L2_MESSAGES_TREE),
|
|
333
|
+
compareRoot(l2Block.endTreeOfHistoricL1ToL2MessageTreeRootsSnapshot.root, MerkleTreeId.L1_TO_L2_MESSAGES_ROOTS_TREE),
|
|
334
|
+
];
|
|
335
|
+
const ourBlock = rootChecks.every(x => x);
|
|
336
|
+
if (ourBlock) {
|
|
337
|
+
this.log(`Block ${l2Block.number} is ours, committing world state..`);
|
|
338
|
+
await this._commit();
|
|
339
|
+
}
|
|
340
|
+
else {
|
|
341
|
+
this.log(`Block ${l2Block.number} is not ours, rolling back world state and committing state from chain..`);
|
|
342
|
+
await this._rollback();
|
|
343
|
+
for (const [tree, leaves] of [
|
|
344
|
+
[MerkleTreeId.CONTRACT_TREE, l2Block.newContracts],
|
|
345
|
+
[MerkleTreeId.NULLIFIER_TREE, l2Block.newNullifiers],
|
|
346
|
+
[MerkleTreeId.PRIVATE_DATA_TREE, l2Block.newCommitments],
|
|
347
|
+
[MerkleTreeId.L1_TO_L2_MESSAGES_TREE, l2Block.newL1ToL2Messages],
|
|
348
|
+
]) {
|
|
349
|
+
await this._appendLeaves(tree, leaves.map(fr => fr.toBuffer()));
|
|
350
|
+
}
|
|
351
|
+
for (const dataWrite of l2Block.newPublicDataWrites) {
|
|
352
|
+
if (dataWrite.isEmpty())
|
|
353
|
+
continue;
|
|
354
|
+
const { newValue, leafIndex } = dataWrite;
|
|
355
|
+
await this._updateLeaf(MerkleTreeId.PUBLIC_DATA_TREE, newValue.toBuffer(), leafIndex.value);
|
|
356
|
+
}
|
|
357
|
+
for (const [newTree, rootTree] of [
|
|
358
|
+
[MerkleTreeId.PRIVATE_DATA_TREE, MerkleTreeId.PRIVATE_DATA_TREE_ROOTS_TREE],
|
|
359
|
+
[MerkleTreeId.CONTRACT_TREE, MerkleTreeId.CONTRACT_TREE_ROOTS_TREE],
|
|
360
|
+
[MerkleTreeId.L1_TO_L2_MESSAGES_TREE, MerkleTreeId.L1_TO_L2_MESSAGES_ROOTS_TREE],
|
|
361
|
+
]) {
|
|
362
|
+
const newTreeRoot = this.trees[newTree].getRoot(true);
|
|
363
|
+
await this._appendLeaves(rootTree, [newTreeRoot]);
|
|
364
|
+
}
|
|
365
|
+
await this._commit();
|
|
366
|
+
}
|
|
367
|
+
for (const treeId of merkleTreeIds()) {
|
|
368
|
+
const info = await this._getTreeInfo(treeId, false);
|
|
369
|
+
this.log(`Tree ${MerkleTreeId[treeId]} synched with size ${info.size} root ${info.root.toString('hex')}`);
|
|
370
|
+
}
|
|
371
|
+
}
|
|
372
|
+
}
|
|
373
|
+
//# sourceMappingURL=data:application/json;base64,{"version":3,"file":"merkle_trees.js","sourceRoot":"","sources":["../../src/world-state-db/merkle_trees.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,oBAAoB,EACpB,+BAA+B,EAC/B,YAAY,EAEZ,mCAAmC,EACnC,6BAA6B,EAC7B,qBAAqB,EACrB,wBAAwB,EACxB,mCAAmC,EACnC,uBAAuB,GACxB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAKL,QAAQ,EAER,UAAU,EACV,mBAAmB,EACnB,YAAY,EAEZ,OAAO,GACR,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EAEL,2BAA2B,GAM5B,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,0BAA0B,EAAE,MAAM,iDAAiD,CAAC;AAC7F,OAAO,EAAW,YAAY,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AACpE,OAAO,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AACrD,OAAO,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAG1D;;GAEG;AACH,MAAM,OAAO,WAAW;IAItB,YAAoB,EAAmB,EAAU,MAAM,iBAAiB,CAAC,oBAAoB,CAAC;QAA1E,OAAE,GAAF,EAAE,CAAiB;QAAU,QAAG,GAAH,GAAG,CAA0C;QAHtF,UAAK,GAAwC,EAAE,CAAC;QAChD,aAAQ,GAAG,IAAI,WAAW,EAAE,CAAC;IAE4D,CAAC;IAElG;;;OAGG;IACI,KAAK,CAAC,IAAI,CAAC,YAA0B;QAC1C,MAAM,IAAI,GAAG,YAAY,IAAI,CAAC,MAAM,YAAY,CAAC,GAAG,EAAE,CAAC,CAAC;QACxD,MAAM,MAAM,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,YAAY,GAAmB,MAAM,OAAO,CAChD,YAAY,EACZ,IAAI,CAAC,EAAE,EACP,MAAM,EACN,GAAG,YAAY,CAAC,YAAY,CAAC,aAAa,CAAC,EAAE,EAC7C,oBAAoB,CACrB,CAAC;QACF,MAAM,qBAAqB,GAAmB,MAAM,OAAO,CACzD,YAAY,EACZ,IAAI,CAAC,EAAE,EACP,MAAM,EACN,GAAG,YAAY,CAAC,YAAY,CAAC,wBAAwB,CAAC,EAAE,EACxD,+BAA+B,CAChC,CAAC;QACF,MAAM,aAAa,GAAG,MAAM,OAAO,CACjC,mBAAmB,EACnB,IAAI,CAAC,EAAE,EACP,MAAM,EACN,GAAG,YAAY,CAAC,YAAY,CAAC,cAAc,CAAC,EAAE,EAC9C,qBAAqB,EACrB,2BAA2B,CAC5B,CAAC;QACF,MAAM,eAAe,GAAmB,MAAM,OAAO,CACnD,YAAY,EACZ,IAAI,CAAC,EAAE,EACP,MAAM,EACN,GAAG,YAAY,CAAC,YAAY,CAAC,iBAAiB,CAAC,EAAE,EACjD,wBAAwB,CACzB,CAAC;QACF,MAAM,wBAAwB,GAAmB,MAAM,OAAO,CAC5D,YAAY,EACZ,IAAI,CAAC,EAAE,EACP,MAAM,EACN,GAAG,YAAY,CAAC,YAAY,CAAC,4BAA4B,CAAC,EAAE,EAC5D,mCAAmC,CACpC,CAAC;QACF,MAAM,cAAc,GAAmB,MAAM,OAAO,CAClD,UAAU,EACV,IAAI,CAAC,EAAE,EACP,MAAM,EACN,GAAG,YAAY,CAAC,YAAY,CAAC,gBAAgB,CAAC,EAAE,EAChD,uBAAuB,CACxB,CAAC;QACF,MAAM,kBAAkB,GAAmB,MAAM,OAAO,CACtD,YAAY,EACZ,IAAI,CAAC,EAAE,EACP,MAAM,EACN,GAAG,YAAY,CAAC,YAAY,CAAC,sBAAsB,CAAC,EAAE,EACtD,6BAA6B,CAC9B,CAAC;QACF,MAAM,uBAAuB,GAAmB,MAAM,OAAO,CAC3D,YAAY,EACZ,IAAI,CAAC,EAAE,EACP,MAAM,EACN,GAAG,YAAY,CAAC,YAAY,CAAC,4BAA4B,CAAC,EAAE,EAC5D,mCAAmC,CACpC,CAAC;QACF,IAAI,CAAC,KAAK,GAAG;YACX,YAAY;YACZ,qBAAqB;YACrB,aAAa;YACb,eAAe;YACf,wBAAwB;YACxB,cAAc;YACd,kBAAkB;YAClB,uBAAuB;SACxB,CAAC;QAEF,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QAEtB,mEAAmE;QACnE,MAAM,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,CAAC;QAC1C,MAAM,kBAAkB,GAAG,CAAC,qBAAqB,EAAE,wBAAwB,EAAE,uBAAuB,CAAC,CAAC;QACtG,MAAM,OAAO,CAAC,GAAG,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACnE,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,EAAmB,EAAE,IAAkB;QAC7D,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,EAAE,CAAC,CAAC;QACxC,MAAM,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7B,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,IAAI;QACf,MAAM,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;IAC5B,CAAC;IAED;;;OAGG;IACI,QAAQ;QACb,OAAO,IAAI,0BAA0B,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACpD,CAAC;IAED;;;OAGG;IACI,WAAW;QAChB,OAAO,IAAI,0BAA0B,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACrD,CAAC;IAED;;;;OAIG;IACI,KAAK,CAAC,wBAAwB,CAAC,kBAA2B;QAC/D,KAAK,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,IAAI;YAChC,CAAC,YAAY,CAAC,iBAAiB,EAAE,YAAY,CAAC,4BAA4B,CAAC;YAC3E,CAAC,YAAY,CAAC,aAAa,EAAE,YAAY,CAAC,wBAAwB,CAAC;YACnE,CAAC,YAAY,CAAC,sBAAsB,EAAE,YAAY,CAAC,4BAA4B,CAAC;SACxE,EAAE;YACV,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,kBAAkB,CAAC,CAAC;YACxE,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;SACvD;IACH,CAAC;IAED;;;;;OAKG;IACI,KAAK,CAAC,WAAW,CAAC,MAAoB,EAAE,kBAA2B;QACxE,OAAO,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAAC,CAAC;IACrF,CAAC;IAED;;;;OAIG;IACI,sBAAsB,CAAC,kBAA2B;QACvD,MAAM,KAAK,GAAG;YACZ,YAAY,CAAC,iBAAiB;YAC9B,YAAY,CAAC,aAAa;YAC1B,YAAY,CAAC,sBAAsB;YACnC,YAAY,CAAC,cAAc;SAC5B,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC,CAAC;QAE5D,OAAO;YACL,mBAAmB,EAAE,KAAK,CAAC,CAAC,CAAC;YAC7B,oBAAoB,EAAE,KAAK,CAAC,CAAC,CAAC;YAC9B,sBAAsB,EAAE,KAAK,CAAC,CAAC,CAAC;YAChC,iBAAiB,EAAE,KAAK,CAAC,CAAC,CAAC;SAC5B,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACI,KAAK,CAAC,YAAY,CACvB,MAAoB,EACpB,KAAa,EACb,kBAA2B;QAE3B,OAAO,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC,CAAC;IAClG,CAAC;IAED;;;;;;OAMG;IACI,KAAK,CAAC,cAAc,CACzB,MAAoB,EACpB,KAAa,EACb,kBAA2B;QAE3B,OAAO,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,KAAK,EAAE,kBAAkB,CAAC,CAAC,CAAC;IAC/F,CAAC;IAED;;;;;OAKG;IACI,KAAK,CAAC,YAAY,CAAC,MAAoB,EAAE,MAAgB;QAC9D,OAAO,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC1E,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,MAAM;QACjB,OAAO,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;IACtD,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,QAAQ;QACnB,OAAO,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;IACxD,CAAC;IAED;;;;;;OAMG;IACI,KAAK,CAAC,qBAAqB,CAChC,MAAqB,EACrB,KAAa,EACb,kBAA2B;QAW3B,OAAO,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,CACjC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,wBAAwB,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC,CAClG,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACI,KAAK,CAAC,WAAW,CACtB,MAAqB,EACrB,KAAa,EACb,kBAA2B;QAE3B,OAAO,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,CACjC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,qBAAqB,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC,CAC/F,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACI,KAAK,CAAC,aAAa,CACxB,MAAoB,EACpB,KAAa,EACb,kBAA2B;QAE3B,OAAO,MAAM,IAAI,CAAC,WAAW,CAAC,KAAK,IAAI,EAAE;YACvC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,kBAAkB,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC/D,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC;gBACpE,IAAI,YAAY,IAAI,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE;oBAC9C,OAAO,CAAC,CAAC;iBACV;aACF;YACD,OAAO,SAAS,CAAC;QACnB,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACI,KAAK,CAAC,UAAU,CAAC,MAAoC,EAAE,IAAuB,EAAE,KAAa;QAClG,OAAO,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7E,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,aAAa,CAAC,KAAc;QACvC,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED;;;;;;;OAOG;IACI,KAAK,CAAC,WAAW,CAKtB,MAAoB,EACpB,MAAgB,EAChB,UAAsB,EACtB,aAA4B;QAK5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAwB,CAAC;QACvD,IAAI,CAAC,CAAC,aAAa,IAAI,IAAI,CAAC,EAAE;YAC5B,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;SAC/D;QACD,OAAO,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,UAAU,EAAE,aAAa,CAAC,CAAC,CAAC;IAC3F,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,WAAW,CAAI,EAAoB;QAC/C,OAAO,MAAM,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACrC,CAAC;IAED;;;;;OAKG;IACK,YAAY,CAAC,MAAoB,EAAE,kBAA2B;QACpE,MAAM,QAAQ,GAAG;YACf,MAAM;YACN,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,kBAAkB,CAAC;YACpD,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,kBAAkB,CAAC;YACzD,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE;SACzB,CAAC;QACd,OAAO,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACnC,CAAC;IAED;;;;OAIG;IACK,eAAe,CAAC,MAAqB;QAC3C,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAgB,CAAC;IAC3C,CAAC;IAED;;;;;;OAMG;IACK,eAAe,CACrB,MAAoB,EACpB,KAAa,EACb,kBAA2B;QAE3B,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,cAAc,CAAI,KAAK,EAAE,kBAAkB,CAAC,CAAC,CAAC;IAC1F,CAAC;IAED;;;;;OAKG;IACK,KAAK,CAAC,aAAa,CAAC,MAAoB,EAAE,MAAgB;QAChE,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAChC,IAAI,CAAC,CAAC,cAAc,IAAI,IAAI,CAAC,EAAE;YAC7B,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;SAChE;QACD,OAAO,MAAM,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;IACzC,CAAC;IAEO,KAAK,CAAC,WAAW,CACvB,MAAoC,EACpC,IAAuB,EACvB,KAAa;QAEb,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAChC,IAAI,CAAC,CAAC,YAAY,IAAI,IAAI,CAAC,EAAE;YAC3B,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;SAC9D;QACD,OAAO,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAC5C,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,OAAO;QACnB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE;YAC7B,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC;SACrB;IACH,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,SAAS;QACrB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE;YAC7B,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;SACvB;IACH,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,cAAc,CAAC,OAAgB;QAC3C,MAAM,WAAW,GAAG,CAAC,IAAQ,EAAE,MAAoB,EAAE,EAAE;YACrD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAClD,OAAO,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;QAC1C,CAAC,CAAC;QACF,MAAM,UAAU,GAAG;YACjB,WAAW,CAAC,OAAO,CAAC,uBAAuB,CAAC,IAAI,EAAE,YAAY,CAAC,aAAa,CAAC;YAC7E,WAAW,CAAC,OAAO,CAAC,wBAAwB,CAAC,IAAI,EAAE,YAAY,CAAC,cAAc,CAAC;YAC/E,WAAW,CAAC,OAAO,CAAC,0BAA0B,CAAC,IAAI,EAAE,YAAY,CAAC,iBAAiB,CAAC;YACpF,WAAW,CAAC,OAAO,CAAC,qBAAqB,EAAE,YAAY,CAAC,gBAAgB,CAAC;YACzE,WAAW,CAAC,OAAO,CAAC,0CAA0C,CAAC,IAAI,EAAE,YAAY,CAAC,wBAAwB,CAAC;YAC3G,WAAW,CACT,OAAO,CAAC,6CAA6C,CAAC,IAAI,EAC1D,YAAY,CAAC,4BAA4B,CAC1C;YACD,WAAW,CAAC,OAAO,CAAC,4BAA4B,CAAC,IAAI,EAAE,YAAY,CAAC,sBAAsB,CAAC;YAC3F,WAAW,CACT,OAAO,CAAC,+CAA+C,CAAC,IAAI,EAC5D,YAAY,CAAC,4BAA4B,CAC1C;SACF,CAAC;QACF,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1C,IAAI,QAAQ,EAAE;YACZ,IAAI,CAAC,GAAG,CAAC,SAAS,OAAO,CAAC,MAAM,oCAAoC,CAAC,CAAC;YACtE,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;SACtB;aAAM;YACL,IAAI,CAAC,GAAG,CAAC,SAAS,OAAO,CAAC,MAAM,0EAA0E,CAAC,CAAC;YAC5G,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;YAEvB,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI;gBAC3B,CAAC,YAAY,CAAC,aAAa,EAAE,OAAO,CAAC,YAAY,CAAC;gBAClD,CAAC,YAAY,CAAC,cAAc,EAAE,OAAO,CAAC,aAAa,CAAC;gBACpD,CAAC,YAAY,CAAC,iBAAiB,EAAE,OAAO,CAAC,cAAc,CAAC;gBACxD,CAAC,YAAY,CAAC,sBAAsB,EAAE,OAAO,CAAC,iBAAiB,CAAC;aACxD,EAAE;gBACV,MAAM,IAAI,CAAC,aAAa,CACtB,IAAI,EACJ,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,CAChC,CAAC;aACH;YAED,KAAK,MAAM,SAAS,IAAI,OAAO,CAAC,mBAAmB,EAAE;gBACnD,IAAI,SAAS,CAAC,OAAO,EAAE;oBAAE,SAAS;gBAClC,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,SAAS,CAAC;gBAC1C,MAAM,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,gBAAgB,EAAE,QAAQ,CAAC,QAAQ,EAAE,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC;aAC7F;YAED,KAAK,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,IAAI;gBAChC,CAAC,YAAY,CAAC,iBAAiB,EAAE,YAAY,CAAC,4BAA4B,CAAC;gBAC3E,CAAC,YAAY,CAAC,aAAa,EAAE,YAAY,CAAC,wBAAwB,CAAC;gBACnE,CAAC,YAAY,CAAC,sBAAsB,EAAE,YAAY,CAAC,4BAA4B,CAAC;aACxE,EAAE;gBACV,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBACtD,MAAM,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC;aACnD;YACD,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;SACtB;QACD,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,EAAE;YACpC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YACpD,IAAI,CAAC,GAAG,CAAC,QAAQ,YAAY,CAAC,MAAM,CAAC,sBAAsB,IAAI,CAAC,IAAI,SAAS,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;SAC3G;IACH,CAAC;CACF"}
|
package/package.json
ADDED
|
@@ -0,0 +1,15 @@
|
|
|
1
|
+
{
|
|
2
|
+
"name": "@aztec/world-state",
|
|
3
|
+
"version": "0.1.0-alpha11",
|
|
4
|
+
"exports": "./dest/index.js",
|
|
5
|
+
"type": "module",
|
|
6
|
+
"dependencies": {
|
|
7
|
+
"@aztec/circuits.js": "0.1.0-alpha11",
|
|
8
|
+
"@aztec/foundation": "0.1.0-alpha11",
|
|
9
|
+
"@aztec/merkle-tree": "0.1.0-alpha11",
|
|
10
|
+
"@aztec/types": "0.1.0-alpha11",
|
|
11
|
+
"levelup": "^5.1.1",
|
|
12
|
+
"memdown": "^6.1.1",
|
|
13
|
+
"tslib": "^2.4.0"
|
|
14
|
+
}
|
|
15
|
+
}
|
package/src/index.ts
ADDED
|
@@ -0,0 +1,164 @@
|
|
|
1
|
+
import { LeafData, MerkleTreeDb, TreeInfo, MerkleTreeOperations, CurrentCommitmentTreeRoots } from '../index.js';
|
|
2
|
+
import { L2Block, MerkleTreeId } from '@aztec/types';
|
|
3
|
+
import { LowLeafWitnessData, SiblingPath } from '@aztec/merkle-tree';
|
|
4
|
+
|
|
5
|
+
/**
|
|
6
|
+
* Wraps a MerkleTreeDbOperations to call all functions with a preset includeUncommitted flag.
|
|
7
|
+
*/
|
|
8
|
+
export class MerkleTreeOperationsFacade implements MerkleTreeOperations {
|
|
9
|
+
constructor(private trees: MerkleTreeDb, private includeUncommitted: boolean) {}
|
|
10
|
+
|
|
11
|
+
/**
|
|
12
|
+
* Returns the tree info for the specified tree id.
|
|
13
|
+
* @param treeId - Id of the tree to get information from.
|
|
14
|
+
* @param includeUncommitted - Indicates whether to include uncommitted data.
|
|
15
|
+
* @returns The tree info for the specified tree.
|
|
16
|
+
*/
|
|
17
|
+
getTreeInfo(treeId: MerkleTreeId): Promise<TreeInfo> {
|
|
18
|
+
return this.trees.getTreeInfo(treeId, this.includeUncommitted);
|
|
19
|
+
}
|
|
20
|
+
|
|
21
|
+
/**
|
|
22
|
+
* Get the current roots of the commitment trees.
|
|
23
|
+
* @returns The current roots of the trees.
|
|
24
|
+
*/
|
|
25
|
+
getCommitmentTreeRoots(): CurrentCommitmentTreeRoots {
|
|
26
|
+
return this.trees.getCommitmentTreeRoots(this.includeUncommitted);
|
|
27
|
+
}
|
|
28
|
+
|
|
29
|
+
/**
|
|
30
|
+
* Appends a set of leaf values to the tree.
|
|
31
|
+
* @param treeId - Id of the tree to append leaves to.
|
|
32
|
+
* @param leaves - The set of leaves to be appended.
|
|
33
|
+
* @returns The tree info of the specified tree.
|
|
34
|
+
*/
|
|
35
|
+
appendLeaves(treeId: MerkleTreeId, leaves: Buffer[]): Promise<void> {
|
|
36
|
+
return this.trees.appendLeaves(treeId, leaves);
|
|
37
|
+
}
|
|
38
|
+
|
|
39
|
+
/**
|
|
40
|
+
* Returns the sibling path for a requested leaf index.
|
|
41
|
+
* @param treeId - Id of the tree to get the sibling path from.
|
|
42
|
+
* @param index - The index of the leaf for which a sibling path is required.
|
|
43
|
+
* @returns A promise with the sibling path of the specified leaf index.
|
|
44
|
+
*/
|
|
45
|
+
getSiblingPath(treeId: MerkleTreeId, index: bigint): Promise<SiblingPath<number>> {
|
|
46
|
+
return this.trees.getSiblingPath(treeId, index, this.includeUncommitted);
|
|
47
|
+
}
|
|
48
|
+
|
|
49
|
+
/**
|
|
50
|
+
* Finds the index of the largest leaf whose value is less than or equal to the provided value.
|
|
51
|
+
* @param treeId - The ID of the tree to search.
|
|
52
|
+
* @param value - The value to be inserted into the tree.
|
|
53
|
+
* @param includeUncommitted - If true, the uncommitted changes are included in the search.
|
|
54
|
+
* @returns The found leaf index and a flag indicating if the corresponding leaf's value is equal to `newValue`.
|
|
55
|
+
*/
|
|
56
|
+
getPreviousValueIndex(
|
|
57
|
+
treeId: MerkleTreeId.NULLIFIER_TREE,
|
|
58
|
+
value: bigint,
|
|
59
|
+
): Promise<{
|
|
60
|
+
/**
|
|
61
|
+
* The index of the found leaf.
|
|
62
|
+
*/
|
|
63
|
+
index: number;
|
|
64
|
+
/**
|
|
65
|
+
* A flag indicating if the corresponding leaf's value is equal to `newValue`.
|
|
66
|
+
*/
|
|
67
|
+
alreadyPresent: boolean;
|
|
68
|
+
}> {
|
|
69
|
+
return this.trees.getPreviousValueIndex(treeId, value, this.includeUncommitted);
|
|
70
|
+
}
|
|
71
|
+
|
|
72
|
+
/**
|
|
73
|
+
* Updates a leaf in a tree at a given index.
|
|
74
|
+
* @param treeId - The ID of the tree.
|
|
75
|
+
* @param leaf - The new leaf value.
|
|
76
|
+
* @param index - The index to insert into.
|
|
77
|
+
* @returns Empty promise.
|
|
78
|
+
*/
|
|
79
|
+
updateLeaf(treeId: MerkleTreeId.NULLIFIER_TREE, leaf: LeafData, index: bigint): Promise<void> {
|
|
80
|
+
return this.trees.updateLeaf(treeId, leaf, index);
|
|
81
|
+
}
|
|
82
|
+
|
|
83
|
+
/**
|
|
84
|
+
* Gets the leaf data at a given index and tree.
|
|
85
|
+
* @param treeId - The ID of the tree get the leaf from.
|
|
86
|
+
* @param index - The index of the leaf to get.
|
|
87
|
+
* @returns Leaf data.
|
|
88
|
+
*/
|
|
89
|
+
getLeafData(treeId: MerkleTreeId.NULLIFIER_TREE, index: number): Promise<LeafData | undefined> {
|
|
90
|
+
return this.trees.getLeafData(treeId, index, this.includeUncommitted);
|
|
91
|
+
}
|
|
92
|
+
|
|
93
|
+
/**
|
|
94
|
+
* Returns the index of a leaf given its value, or undefined if no leaf with that value is found.
|
|
95
|
+
* @param treeId - The ID of the tree.
|
|
96
|
+
* @param value - The leaf value to look for.
|
|
97
|
+
* @returns The index of the first leaf found with a given value (undefined if not found).
|
|
98
|
+
*/
|
|
99
|
+
findLeafIndex(treeId: MerkleTreeId, value: Buffer): Promise<bigint | undefined> {
|
|
100
|
+
return this.trees.findLeafIndex(treeId, value, this.includeUncommitted);
|
|
101
|
+
}
|
|
102
|
+
|
|
103
|
+
/**
|
|
104
|
+
* Gets the value at the given index.
|
|
105
|
+
* @param treeId - The ID of the tree to get the leaf value from.
|
|
106
|
+
* @param index - The index of the leaf.
|
|
107
|
+
* @param includeUncommitted - Indicates whether to include uncommitted changes.
|
|
108
|
+
* @returns Leaf value at the given index (undefined if not found).
|
|
109
|
+
*/
|
|
110
|
+
getLeafValue(treeId: MerkleTreeId, index: bigint): Promise<Buffer | undefined> {
|
|
111
|
+
return this.trees.getLeafValue(treeId, index, this.includeUncommitted);
|
|
112
|
+
}
|
|
113
|
+
|
|
114
|
+
/**
|
|
115
|
+
* Inserts into the roots trees (CONTRACT_TREE_ROOTS_TREE, PRIVATE_DATA_TREE_ROOTS_TREE)
|
|
116
|
+
* the current roots of the corresponding trees (CONTRACT_TREE, PRIVATE_DATA_TREE).
|
|
117
|
+
* @returns Empty promise.
|
|
118
|
+
*/
|
|
119
|
+
public updateHistoricRootsTrees(): Promise<void> {
|
|
120
|
+
return this.trees.updateHistoricRootsTrees(this.includeUncommitted);
|
|
121
|
+
}
|
|
122
|
+
|
|
123
|
+
/**
|
|
124
|
+
* Handles a single L2 block (i.e. Inserts the new commitments into the merkle tree).
|
|
125
|
+
* @param block - The L2 block to handle.
|
|
126
|
+
* @returns Empty promise.
|
|
127
|
+
*/
|
|
128
|
+
public handleL2Block(block: L2Block): Promise<void> {
|
|
129
|
+
return this.trees.handleL2Block(block);
|
|
130
|
+
}
|
|
131
|
+
|
|
132
|
+
/**
|
|
133
|
+
* Commits all pending updates.
|
|
134
|
+
* @returns Empty promise.
|
|
135
|
+
*/
|
|
136
|
+
public async commit(): Promise<void> {
|
|
137
|
+
return await this.trees.commit();
|
|
138
|
+
}
|
|
139
|
+
|
|
140
|
+
/**
|
|
141
|
+
* Rolls back all pending updates.
|
|
142
|
+
* @returns Empty promise.
|
|
143
|
+
*/
|
|
144
|
+
public async rollback(): Promise<void> {
|
|
145
|
+
return await this.trees.rollback();
|
|
146
|
+
}
|
|
147
|
+
|
|
148
|
+
/**
|
|
149
|
+
* Batch insert multiple leaves into the tree.
|
|
150
|
+
* @param treeId - The ID of the tree.
|
|
151
|
+
* @param leaves - Leaves to insert into the tree.
|
|
152
|
+
* @param treeHeight - Height of the tree.
|
|
153
|
+
* @param subtreeHeight - Height of the subtree.
|
|
154
|
+
* @returns The data for the leaves to be updated when inserting the new ones.
|
|
155
|
+
*/
|
|
156
|
+
public batchInsert(
|
|
157
|
+
treeId: MerkleTreeId,
|
|
158
|
+
leaves: Buffer[],
|
|
159
|
+
treeHeight: number,
|
|
160
|
+
subtreeHeight: number,
|
|
161
|
+
): Promise<[LowLeafWitnessData<number>[], SiblingPath<number>] | [undefined, SiblingPath<number>]> {
|
|
162
|
+
return this.trees.batchInsert(treeId, leaves, treeHeight, subtreeHeight);
|
|
163
|
+
}
|
|
164
|
+
}
|
|
@@ -0,0 +1,27 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* World State synchroniser configuration values.
|
|
3
|
+
*/
|
|
4
|
+
export interface WorldStateConfig {
|
|
5
|
+
/**
|
|
6
|
+
* The frequency in which to check.
|
|
7
|
+
*/
|
|
8
|
+
checkInterval: number;
|
|
9
|
+
|
|
10
|
+
/**
|
|
11
|
+
* Size of queue of L2 blocks to store.
|
|
12
|
+
*/
|
|
13
|
+
l2QueueSize: number;
|
|
14
|
+
}
|
|
15
|
+
|
|
16
|
+
/**
|
|
17
|
+
* Returns the configuration values for the world state synchroniser.
|
|
18
|
+
* @returns The configuration values for the world state synchroniser.
|
|
19
|
+
*/
|
|
20
|
+
export function getConfigEnvVars(): WorldStateConfig {
|
|
21
|
+
const { WS_CHECK_INTERVAL, WS_L2_BLOCK_QUEUE_SIZE } = process.env;
|
|
22
|
+
const envVars: WorldStateConfig = {
|
|
23
|
+
checkInterval: WS_CHECK_INTERVAL ? +WS_CHECK_INTERVAL : 100,
|
|
24
|
+
l2QueueSize: WS_L2_BLOCK_QUEUE_SIZE ? +WS_L2_BLOCK_QUEUE_SIZE : 1000,
|
|
25
|
+
};
|
|
26
|
+
return envVars;
|
|
27
|
+
}
|