@aztec/prover-client 0.0.1-commit.b9865e97 → 0.0.1-commit.be03c316

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.
Files changed (78) hide show
  1. package/dest/light/lightweight_checkpoint_builder.d.ts +1 -1
  2. package/dest/light/lightweight_checkpoint_builder.d.ts.map +1 -1
  3. package/dest/light/lightweight_checkpoint_builder.js +3 -1
  4. package/dest/mocks/test_context.d.ts +9 -11
  5. package/dest/mocks/test_context.d.ts.map +1 -1
  6. package/dest/mocks/test_context.js +13 -22
  7. package/dest/orchestrator/block-building-helpers.d.ts +1 -1
  8. package/dest/orchestrator/checkpoint-proving-state.d.ts +13 -36
  9. package/dest/orchestrator/checkpoint-proving-state.d.ts.map +1 -1
  10. package/dest/orchestrator/checkpoint-proving-state.js +18 -125
  11. package/dest/orchestrator/checkpoint-sub-tree-orchestrator.d.ts +116 -62
  12. package/dest/orchestrator/checkpoint-sub-tree-orchestrator.d.ts.map +1 -1
  13. package/dest/orchestrator/checkpoint-sub-tree-orchestrator.js +1005 -90
  14. package/dest/orchestrator/chonk-cache.d.ts +39 -0
  15. package/dest/orchestrator/chonk-cache.d.ts.map +1 -0
  16. package/dest/orchestrator/chonk-cache.js +80 -0
  17. package/dest/orchestrator/index.d.ts +2 -3
  18. package/dest/orchestrator/index.d.ts.map +1 -1
  19. package/dest/orchestrator/index.js +1 -2
  20. package/dest/orchestrator/proving-scheduler.d.ts +26 -17
  21. package/dest/orchestrator/proving-scheduler.d.ts.map +1 -1
  22. package/dest/orchestrator/proving-scheduler.js +28 -25
  23. package/dest/orchestrator/top-tree-orchestrator.d.ts +11 -6
  24. package/dest/orchestrator/top-tree-orchestrator.d.ts.map +1 -1
  25. package/dest/orchestrator/top-tree-orchestrator.js +71 -21
  26. package/dest/orchestrator/top-tree-proving-state.d.ts +1 -1
  27. package/dest/orchestrator/top-tree-proving-state.d.ts.map +1 -1
  28. package/dest/orchestrator/tx-proving-state.d.ts +3 -3
  29. package/dest/orchestrator/tx-proving-state.d.ts.map +1 -1
  30. package/dest/prover-client/prover-client.d.ts +17 -19
  31. package/dest/prover-client/prover-client.d.ts.map +1 -1
  32. package/dest/prover-client/prover-client.js +24 -25
  33. package/dest/proving_broker/broker_prover_facade.d.ts +3 -3
  34. package/dest/proving_broker/broker_prover_facade.d.ts.map +1 -1
  35. package/dest/test/epoch_settlement.d.ts +36 -0
  36. package/dest/test/epoch_settlement.d.ts.map +1 -0
  37. package/dest/test/epoch_settlement.js +52 -0
  38. package/dest/test/index.d.ts +2 -0
  39. package/dest/test/index.d.ts.map +1 -0
  40. package/dest/test/index.js +1 -0
  41. package/dest/test/mock_prover.d.ts +1 -1
  42. package/dest/test/mock_prover.js +2 -2
  43. package/package.json +17 -16
  44. package/src/light/lightweight_checkpoint_builder.ts +2 -0
  45. package/src/mocks/test_context.ts +14 -34
  46. package/src/orchestrator/checkpoint-proving-state.ts +14 -168
  47. package/src/orchestrator/checkpoint-sub-tree-orchestrator.ts +902 -129
  48. package/src/orchestrator/chonk-cache.ts +99 -0
  49. package/src/orchestrator/index.ts +1 -2
  50. package/src/orchestrator/proving-scheduler.ts +29 -25
  51. package/src/orchestrator/top-tree-orchestrator.ts +114 -44
  52. package/src/orchestrator/top-tree-proving-state.ts +0 -1
  53. package/src/orchestrator/tx-proving-state.ts +3 -3
  54. package/src/prover-client/prover-client.ts +35 -49
  55. package/src/proving_broker/broker_prover_facade.ts +2 -2
  56. package/src/test/epoch_settlement.ts +82 -0
  57. package/src/test/index.ts +1 -0
  58. package/src/test/mock_prover.ts +2 -2
  59. package/dest/orchestrator/epoch-proving-context.d.ts +0 -51
  60. package/dest/orchestrator/epoch-proving-context.d.ts.map +0 -1
  61. package/dest/orchestrator/epoch-proving-context.js +0 -81
  62. package/dest/orchestrator/epoch-proving-state.d.ts +0 -75
  63. package/dest/orchestrator/epoch-proving-state.d.ts.map +0 -1
  64. package/dest/orchestrator/epoch-proving-state.js +0 -269
  65. package/dest/orchestrator/orchestrator.d.ts +0 -118
  66. package/dest/orchestrator/orchestrator.d.ts.map +0 -1
  67. package/dest/orchestrator/orchestrator.js +0 -1113
  68. package/dest/orchestrator/top-tree-proving-scheduler.d.ts +0 -62
  69. package/dest/orchestrator/top-tree-proving-scheduler.d.ts.map +0 -1
  70. package/dest/orchestrator/top-tree-proving-scheduler.js +0 -73
  71. package/dest/prover-client/server-epoch-prover.d.ts +0 -32
  72. package/dest/prover-client/server-epoch-prover.d.ts.map +0 -1
  73. package/dest/prover-client/server-epoch-prover.js +0 -40
  74. package/src/orchestrator/epoch-proving-context.ts +0 -101
  75. package/src/orchestrator/epoch-proving-state.ts +0 -380
  76. package/src/orchestrator/orchestrator.ts +0 -1111
  77. package/src/orchestrator/top-tree-proving-scheduler.ts +0 -154
  78. package/src/prover-client/server-epoch-prover.ts +0 -69
@@ -1,1113 +0,0 @@
1
- function applyDecs2203RFactory() {
2
- function createAddInitializerMethod(initializers, decoratorFinishedRef) {
3
- return function addInitializer(initializer) {
4
- assertNotFinished(decoratorFinishedRef, "addInitializer");
5
- assertCallable(initializer, "An initializer");
6
- initializers.push(initializer);
7
- };
8
- }
9
- function memberDec(dec, name, desc, initializers, kind, isStatic, isPrivate, metadata, value) {
10
- var kindStr;
11
- switch(kind){
12
- case 1:
13
- kindStr = "accessor";
14
- break;
15
- case 2:
16
- kindStr = "method";
17
- break;
18
- case 3:
19
- kindStr = "getter";
20
- break;
21
- case 4:
22
- kindStr = "setter";
23
- break;
24
- default:
25
- kindStr = "field";
26
- }
27
- var ctx = {
28
- kind: kindStr,
29
- name: isPrivate ? "#" + name : name,
30
- static: isStatic,
31
- private: isPrivate,
32
- metadata: metadata
33
- };
34
- var decoratorFinishedRef = {
35
- v: false
36
- };
37
- ctx.addInitializer = createAddInitializerMethod(initializers, decoratorFinishedRef);
38
- var get, set;
39
- if (kind === 0) {
40
- if (isPrivate) {
41
- get = desc.get;
42
- set = desc.set;
43
- } else {
44
- get = function() {
45
- return this[name];
46
- };
47
- set = function(v) {
48
- this[name] = v;
49
- };
50
- }
51
- } else if (kind === 2) {
52
- get = function() {
53
- return desc.value;
54
- };
55
- } else {
56
- if (kind === 1 || kind === 3) {
57
- get = function() {
58
- return desc.get.call(this);
59
- };
60
- }
61
- if (kind === 1 || kind === 4) {
62
- set = function(v) {
63
- desc.set.call(this, v);
64
- };
65
- }
66
- }
67
- ctx.access = get && set ? {
68
- get: get,
69
- set: set
70
- } : get ? {
71
- get: get
72
- } : {
73
- set: set
74
- };
75
- try {
76
- return dec(value, ctx);
77
- } finally{
78
- decoratorFinishedRef.v = true;
79
- }
80
- }
81
- function assertNotFinished(decoratorFinishedRef, fnName) {
82
- if (decoratorFinishedRef.v) {
83
- throw new Error("attempted to call " + fnName + " after decoration was finished");
84
- }
85
- }
86
- function assertCallable(fn, hint) {
87
- if (typeof fn !== "function") {
88
- throw new TypeError(hint + " must be a function");
89
- }
90
- }
91
- function assertValidReturnValue(kind, value) {
92
- var type = typeof value;
93
- if (kind === 1) {
94
- if (type !== "object" || value === null) {
95
- throw new TypeError("accessor decorators must return an object with get, set, or init properties or void 0");
96
- }
97
- if (value.get !== undefined) {
98
- assertCallable(value.get, "accessor.get");
99
- }
100
- if (value.set !== undefined) {
101
- assertCallable(value.set, "accessor.set");
102
- }
103
- if (value.init !== undefined) {
104
- assertCallable(value.init, "accessor.init");
105
- }
106
- } else if (type !== "function") {
107
- var hint;
108
- if (kind === 0) {
109
- hint = "field";
110
- } else if (kind === 10) {
111
- hint = "class";
112
- } else {
113
- hint = "method";
114
- }
115
- throw new TypeError(hint + " decorators must return a function or void 0");
116
- }
117
- }
118
- function applyMemberDec(ret, base, decInfo, name, kind, isStatic, isPrivate, initializers, metadata) {
119
- var decs = decInfo[0];
120
- var desc, init, value;
121
- if (isPrivate) {
122
- if (kind === 0 || kind === 1) {
123
- desc = {
124
- get: decInfo[3],
125
- set: decInfo[4]
126
- };
127
- } else if (kind === 3) {
128
- desc = {
129
- get: decInfo[3]
130
- };
131
- } else if (kind === 4) {
132
- desc = {
133
- set: decInfo[3]
134
- };
135
- } else {
136
- desc = {
137
- value: decInfo[3]
138
- };
139
- }
140
- } else if (kind !== 0) {
141
- desc = Object.getOwnPropertyDescriptor(base, name);
142
- }
143
- if (kind === 1) {
144
- value = {
145
- get: desc.get,
146
- set: desc.set
147
- };
148
- } else if (kind === 2) {
149
- value = desc.value;
150
- } else if (kind === 3) {
151
- value = desc.get;
152
- } else if (kind === 4) {
153
- value = desc.set;
154
- }
155
- var newValue, get, set;
156
- if (typeof decs === "function") {
157
- newValue = memberDec(decs, name, desc, initializers, kind, isStatic, isPrivate, metadata, value);
158
- if (newValue !== void 0) {
159
- assertValidReturnValue(kind, newValue);
160
- if (kind === 0) {
161
- init = newValue;
162
- } else if (kind === 1) {
163
- init = newValue.init;
164
- get = newValue.get || value.get;
165
- set = newValue.set || value.set;
166
- value = {
167
- get: get,
168
- set: set
169
- };
170
- } else {
171
- value = newValue;
172
- }
173
- }
174
- } else {
175
- for(var i = decs.length - 1; i >= 0; i--){
176
- var dec = decs[i];
177
- newValue = memberDec(dec, name, desc, initializers, kind, isStatic, isPrivate, metadata, value);
178
- if (newValue !== void 0) {
179
- assertValidReturnValue(kind, newValue);
180
- var newInit;
181
- if (kind === 0) {
182
- newInit = newValue;
183
- } else if (kind === 1) {
184
- newInit = newValue.init;
185
- get = newValue.get || value.get;
186
- set = newValue.set || value.set;
187
- value = {
188
- get: get,
189
- set: set
190
- };
191
- } else {
192
- value = newValue;
193
- }
194
- if (newInit !== void 0) {
195
- if (init === void 0) {
196
- init = newInit;
197
- } else if (typeof init === "function") {
198
- init = [
199
- init,
200
- newInit
201
- ];
202
- } else {
203
- init.push(newInit);
204
- }
205
- }
206
- }
207
- }
208
- }
209
- if (kind === 0 || kind === 1) {
210
- if (init === void 0) {
211
- init = function(instance, init) {
212
- return init;
213
- };
214
- } else if (typeof init !== "function") {
215
- var ownInitializers = init;
216
- init = function(instance, init) {
217
- var value = init;
218
- for(var i = 0; i < ownInitializers.length; i++){
219
- value = ownInitializers[i].call(instance, value);
220
- }
221
- return value;
222
- };
223
- } else {
224
- var originalInitializer = init;
225
- init = function(instance, init) {
226
- return originalInitializer.call(instance, init);
227
- };
228
- }
229
- ret.push(init);
230
- }
231
- if (kind !== 0) {
232
- if (kind === 1) {
233
- desc.get = value.get;
234
- desc.set = value.set;
235
- } else if (kind === 2) {
236
- desc.value = value;
237
- } else if (kind === 3) {
238
- desc.get = value;
239
- } else if (kind === 4) {
240
- desc.set = value;
241
- }
242
- if (isPrivate) {
243
- if (kind === 1) {
244
- ret.push(function(instance, args) {
245
- return value.get.call(instance, args);
246
- });
247
- ret.push(function(instance, args) {
248
- return value.set.call(instance, args);
249
- });
250
- } else if (kind === 2) {
251
- ret.push(value);
252
- } else {
253
- ret.push(function(instance, args) {
254
- return value.call(instance, args);
255
- });
256
- }
257
- } else {
258
- Object.defineProperty(base, name, desc);
259
- }
260
- }
261
- }
262
- function applyMemberDecs(Class, decInfos, metadata) {
263
- var ret = [];
264
- var protoInitializers;
265
- var staticInitializers;
266
- var existingProtoNonFields = new Map();
267
- var existingStaticNonFields = new Map();
268
- for(var i = 0; i < decInfos.length; i++){
269
- var decInfo = decInfos[i];
270
- if (!Array.isArray(decInfo)) continue;
271
- var kind = decInfo[1];
272
- var name = decInfo[2];
273
- var isPrivate = decInfo.length > 3;
274
- var isStatic = kind >= 5;
275
- var base;
276
- var initializers;
277
- if (isStatic) {
278
- base = Class;
279
- kind = kind - 5;
280
- staticInitializers = staticInitializers || [];
281
- initializers = staticInitializers;
282
- } else {
283
- base = Class.prototype;
284
- protoInitializers = protoInitializers || [];
285
- initializers = protoInitializers;
286
- }
287
- if (kind !== 0 && !isPrivate) {
288
- var existingNonFields = isStatic ? existingStaticNonFields : existingProtoNonFields;
289
- var existingKind = existingNonFields.get(name) || 0;
290
- if (existingKind === true || existingKind === 3 && kind !== 4 || existingKind === 4 && kind !== 3) {
291
- throw new Error("Attempted to decorate a public method/accessor that has the same name as a previously decorated public method/accessor. This is not currently supported by the decorators plugin. Property name was: " + name);
292
- } else if (!existingKind && kind > 2) {
293
- existingNonFields.set(name, kind);
294
- } else {
295
- existingNonFields.set(name, true);
296
- }
297
- }
298
- applyMemberDec(ret, base, decInfo, name, kind, isStatic, isPrivate, initializers, metadata);
299
- }
300
- pushInitializers(ret, protoInitializers);
301
- pushInitializers(ret, staticInitializers);
302
- return ret;
303
- }
304
- function pushInitializers(ret, initializers) {
305
- if (initializers) {
306
- ret.push(function(instance) {
307
- for(var i = 0; i < initializers.length; i++){
308
- initializers[i].call(instance);
309
- }
310
- return instance;
311
- });
312
- }
313
- }
314
- function applyClassDecs(targetClass, classDecs, metadata) {
315
- if (classDecs.length > 0) {
316
- var initializers = [];
317
- var newClass = targetClass;
318
- var name = targetClass.name;
319
- for(var i = classDecs.length - 1; i >= 0; i--){
320
- var decoratorFinishedRef = {
321
- v: false
322
- };
323
- try {
324
- var nextNewClass = classDecs[i](newClass, {
325
- kind: "class",
326
- name: name,
327
- addInitializer: createAddInitializerMethod(initializers, decoratorFinishedRef),
328
- metadata
329
- });
330
- } finally{
331
- decoratorFinishedRef.v = true;
332
- }
333
- if (nextNewClass !== undefined) {
334
- assertValidReturnValue(10, nextNewClass);
335
- newClass = nextNewClass;
336
- }
337
- }
338
- return [
339
- defineMetadata(newClass, metadata),
340
- function() {
341
- for(var i = 0; i < initializers.length; i++){
342
- initializers[i].call(newClass);
343
- }
344
- }
345
- ];
346
- }
347
- }
348
- function defineMetadata(Class, metadata) {
349
- return Object.defineProperty(Class, Symbol.metadata || Symbol.for("Symbol.metadata"), {
350
- configurable: true,
351
- enumerable: true,
352
- value: metadata
353
- });
354
- }
355
- return function applyDecs2203R(targetClass, memberDecs, classDecs, parentClass) {
356
- if (parentClass !== void 0) {
357
- var parentMetadata = parentClass[Symbol.metadata || Symbol.for("Symbol.metadata")];
358
- }
359
- var metadata = Object.create(parentMetadata === void 0 ? null : parentMetadata);
360
- var e = applyMemberDecs(targetClass, memberDecs, metadata);
361
- if (!classDecs.length) defineMetadata(targetClass, metadata);
362
- return {
363
- e: e,
364
- get c () {
365
- return applyClassDecs(targetClass, classDecs, metadata);
366
- }
367
- };
368
- };
369
- }
370
- function _apply_decs_2203_r(targetClass, memberDecs, classDecs, parentClass) {
371
- return (_apply_decs_2203_r = applyDecs2203RFactory())(targetClass, memberDecs, classDecs, parentClass);
372
- }
373
- var _dec, _dec1, _dec2, _dec3, _dec4, _initProto;
374
- import { L1_TO_L2_MSG_SUBTREE_HEIGHT, L1_TO_L2_MSG_SUBTREE_ROOT_SIBLING_PATH_LENGTH, NUM_BASE_PARITY_PER_ROOT_PARITY } from '@aztec/constants';
375
- import { BlockNumber } from '@aztec/foundation/branded-types';
376
- import { promiseWithResolvers } from '@aztec/foundation/promise';
377
- import { assertLength } from '@aztec/foundation/serialize';
378
- import { pushTestData } from '@aztec/foundation/testing';
379
- import { elapsed } from '@aztec/foundation/timer';
380
- import { appendL1ToL2MessagesToTree } from '@aztec/stdlib/messaging';
381
- import { BlockRootEmptyTxFirstRollupPrivateInputs, BlockRootFirstRollupPrivateInputs, BlockRootSingleTxFirstRollupPrivateInputs, BlockRootSingleTxRollupPrivateInputs, CheckpointRootSingleBlockRollupPrivateInputs, PrivateTxBaseRollupPrivateInputs } from '@aztec/stdlib/rollup';
382
- import { MerkleTreeId } from '@aztec/stdlib/trees';
383
- import { Attributes, getTelemetryClient, trackSpan, wrapCallbackInSpan } from '@aztec/telemetry-client';
384
- import { inspect } from 'util';
385
- import { buildHeaderFromCircuitOutputs, getLastSiblingPath, getPublicChonkVerifierPrivateInputsFromTx, getRootTreeSiblingPath, getSubtreeSiblingPath, getTreeSnapshot, insertSideEffectsAndBuildBaseRollupHints, validatePartialState, validateTx } from './block-building-helpers.js';
386
- import { EpochProvingState } from './epoch-proving-state.js';
387
- import { ProvingOrchestratorMetrics } from './orchestrator_metrics.js';
388
- import { TopTreeProvingScheduler } from './top-tree-proving-scheduler.js';
389
- import { TxProvingState } from './tx-proving-state.js';
390
- _dec = trackSpan('ProvingOrchestrator.startNewBlock', (blockNumber)=>({
391
- [Attributes.BLOCK_NUMBER]: blockNumber
392
- })), _dec1 = trackSpan('ProvingOrchestrator.addTxs', (txs)=>({
393
- [Attributes.BLOCK_TXS_COUNT]: txs.length
394
- })), _dec2 = trackSpan('ProvingOrchestrator.startChonkVerifierCircuits'), _dec3 = trackSpan('ProvingOrchestrator.setBlockCompleted', (blockNumber)=>({
395
- [Attributes.BLOCK_NUMBER]: blockNumber
396
- })), _dec4 = trackSpan('ProvingOrchestrator.prepareBaseRollupInputs', (tx)=>({
397
- [Attributes.TX_HASH]: tx.hash.toString()
398
- }));
399
- /**
400
- * Implements an event driven proving scheduler to build the recursive proof tree. The idea being:
401
- * 1. Transactions are provided to the scheduler post simulation.
402
- * 2. Tree insertions are performed as required to generate transaction specific proofs
403
- * 3. Those transaction specific proofs are generated in the necessary order accounting for dependencies
404
- * 4. Once a transaction is proven, it will be incorporated into a merge proof
405
- * 5. Merge proofs are produced at each level of the tree until the root proof is produced
406
- *
407
- * The proving implementation is determined by the provided prover. This could be for example a local prover or a remote prover pool.
408
- */ /**
409
- * The orchestrator, managing the flow of recursive proving operations required to build the rollup proof tree.
410
- */ export class ProvingOrchestrator extends TopTreeProvingScheduler {
411
- dbProvider;
412
- proverId;
413
- cancelJobsOnStop;
414
- static{
415
- ({ e: [_initProto] } = _apply_decs_2203_r(this, [
416
- [
417
- _dec,
418
- 2,
419
- "startNewBlock"
420
- ],
421
- [
422
- _dec1,
423
- 2,
424
- "addTxs"
425
- ],
426
- [
427
- _dec2,
428
- 2,
429
- "startChonkVerifierCircuits"
430
- ],
431
- [
432
- _dec3,
433
- 2,
434
- "setBlockCompleted"
435
- ],
436
- [
437
- _dec4,
438
- 2,
439
- "prepareBaseRollupInputs"
440
- ]
441
- ], []));
442
- }
443
- provingState;
444
- provingPromise;
445
- metrics;
446
- dbs;
447
- constructor(dbProvider, prover, proverId, cancelJobsOnStop = false, enqueueConcurrency, telemetryClient = getTelemetryClient(), bindings){
448
- super(prover, enqueueConcurrency, 'prover-client:orchestrator', bindings), this.dbProvider = dbProvider, this.proverId = proverId, this.cancelJobsOnStop = cancelJobsOnStop, this.provingState = (_initProto(this), undefined), this.provingPromise = undefined, this.dbs = new Map();
449
- this.metrics = new ProvingOrchestratorMetrics(telemetryClient, 'ProvingOrchestrator');
450
- }
451
- get tracer() {
452
- return this.metrics.tracer;
453
- }
454
- getProverId() {
455
- return this.proverId;
456
- }
457
- getNumActiveForks() {
458
- return this.dbs.size;
459
- }
460
- cancelInternal() {
461
- this.cancel();
462
- }
463
- wrapCircuitCall(circuitName, fn) {
464
- return wrapCallbackInSpan(this.tracer, `ProvingOrchestrator.prover.${circuitName}`, {
465
- [Attributes.PROTOCOL_CIRCUIT_NAME]: circuitName
466
- }, fn);
467
- }
468
- onRootRollupComplete(state) {
469
- state.resolve({
470
- status: 'success'
471
- });
472
- }
473
- startNewEpoch(epochNumber, totalNumCheckpoints, finalBlobBatchingChallenges) {
474
- if (this.provingState?.verifyState()) {
475
- throw new Error(`Cannot start epoch ${epochNumber} when epoch ${this.provingState.epochNumber} is still being processed.`);
476
- }
477
- const { promise: _promise, resolve, reject } = promiseWithResolvers();
478
- const promise = _promise.catch((reason)=>({
479
- status: 'failure',
480
- reason
481
- }));
482
- this.logger.info(`Starting epoch ${epochNumber} with ${totalNumCheckpoints} checkpoints.`);
483
- this.provingState = new EpochProvingState(epochNumber, totalNumCheckpoints, finalBlobBatchingChallenges, (provingState)=>this.checkAndEnqueueCheckpointRootRollup(provingState), resolve, reject);
484
- this.provingPromise = promise;
485
- }
486
- /**
487
- * Starts a new checkpoint.
488
- * @param checkpointIndex - The index of the checkpoint in the epoch.
489
- * @param constants - The constants for this checkpoint.
490
- * @param l1ToL2Messages - The set of L1 to L2 messages to be inserted at the beginning of this checkpoint.
491
- * @param totalNumBlocks - The total number of blocks expected in the checkpoint (must be at least one).
492
- * @param headerOfLastBlockInPreviousCheckpoint - The header of the last block in the previous checkpoint.
493
- */ async startNewCheckpoint(checkpointIndex, constants, l1ToL2Messages, totalNumBlocks, headerOfLastBlockInPreviousCheckpoint) {
494
- if (!this.provingState) {
495
- throw new Error('Empty epoch proving state. Call startNewEpoch before starting a checkpoint.');
496
- }
497
- if (!this.provingState.isAcceptingCheckpoints()) {
498
- throw new Error(`Epoch not accepting further checkpoints.`);
499
- }
500
- // Fork world state at the end of the immediately previous block.
501
- const lastBlockNumber = headerOfLastBlockInPreviousCheckpoint.globalVariables.blockNumber;
502
- const db = await this.dbProvider.fork(lastBlockNumber);
503
- const firstBlockNumber = BlockNumber(lastBlockNumber + 1);
504
- this.dbs.set(firstBlockNumber, db);
505
- // Get archive sibling path before any block in this checkpoint lands.
506
- const lastArchiveSiblingPath = await getLastSiblingPath(MerkleTreeId.ARCHIVE, db);
507
- // Insert all the l1 to l2 messages into the db. And get the states before and after the insertion.
508
- const { lastL1ToL2MessageTreeSnapshot, lastL1ToL2MessageSubtreeRootSiblingPath, newL1ToL2MessageTreeSnapshot, newL1ToL2MessageSubtreeRootSiblingPath } = await this.updateL1ToL2MessageTree(l1ToL2Messages, db);
509
- this.provingState.startNewCheckpoint(checkpointIndex, constants, totalNumBlocks, headerOfLastBlockInPreviousCheckpoint, lastArchiveSiblingPath, l1ToL2Messages, lastL1ToL2MessageTreeSnapshot, lastL1ToL2MessageSubtreeRootSiblingPath, newL1ToL2MessageTreeSnapshot, newL1ToL2MessageSubtreeRootSiblingPath);
510
- }
511
- /**
512
- * Starts off a new block
513
- * @param blockNumber - The block number
514
- * @param timestamp - The timestamp of the block. This is only required for constructing the private inputs for the
515
- * block that doesn't have any txs.
516
- * @param totalNumTxs - The total number of txs in the block
517
- */ async startNewBlock(blockNumber, timestamp, totalNumTxs) {
518
- if (!this.provingState) {
519
- throw new Error('Empty epoch proving state. Call startNewEpoch before starting a block.');
520
- }
521
- const checkpointProvingState = this.provingState.getCheckpointProvingStateByBlockNumber(blockNumber);
522
- if (!checkpointProvingState) {
523
- throw new Error(`Checkpoint not started. Call startNewCheckpoint first.`);
524
- }
525
- if (!checkpointProvingState.isAcceptingBlocks()) {
526
- throw new Error(`Checkpoint not accepting further blocks.`);
527
- }
528
- const constants = checkpointProvingState.constants;
529
- this.logger.info(`Starting block ${blockNumber} for slot ${constants.slotNumber}.`);
530
- // Fork the db only when it's not already set. The db for the first block is set in `startNewCheckpoint`.
531
- if (!this.dbs.has(blockNumber)) {
532
- // Fork world state at the end of the immediately previous block
533
- const db = await this.dbProvider.fork(BlockNumber(blockNumber - 1));
534
- this.dbs.set(blockNumber, db);
535
- }
536
- const db = this.getDbForBlock(blockNumber);
537
- // Get archive snapshot and sibling path before any txs in this block lands.
538
- const lastArchiveTreeSnapshot = await getTreeSnapshot(MerkleTreeId.ARCHIVE, db);
539
- const lastArchiveSiblingPath = await getRootTreeSiblingPath(MerkleTreeId.ARCHIVE, db);
540
- const blockProvingState = checkpointProvingState.startNewBlock(blockNumber, timestamp, totalNumTxs, lastArchiveTreeSnapshot, lastArchiveSiblingPath);
541
- // Enqueue base parity circuits for the first block in the checkpoint.
542
- if (blockProvingState.index === 0) {
543
- for(let i = 0; i < NUM_BASE_PARITY_PER_ROOT_PARITY; i++){
544
- this.enqueueBaseParityCircuit(checkpointProvingState, blockProvingState, i);
545
- }
546
- }
547
- // Because `addTxs` won't be called for a block without txs, and that's where the sponge blob state is computed.
548
- // We need to set its end sponge blob here, which will become the start sponge blob for the next block.
549
- if (totalNumTxs === 0) {
550
- const endState = await db.getStateReference();
551
- blockProvingState.setEndState(endState);
552
- const endSpongeBlob = blockProvingState.getStartSpongeBlob().clone();
553
- const blockEndBlobFields = blockProvingState.getBlockEndBlobFields();
554
- await endSpongeBlob.absorb(blockEndBlobFields);
555
- blockProvingState.setEndSpongeBlob(endSpongeBlob);
556
- // Try to accumulate the out hashes and blobs as far as we can:
557
- await this.provingState.accumulateCheckpointOutHashes();
558
- await this.provingState.setBlobAccumulators();
559
- }
560
- }
561
- /**
562
- * The interface to add simulated transactions to the scheduler. This can only be called once per block.
563
- * @param txs - The transactions to be proven
564
- */ async addTxs(txs) {
565
- if (!this.provingState) {
566
- throw new Error(`Empty epoch proving state. Call startNewEpoch before adding txs.`);
567
- }
568
- if (!txs.length) {
569
- // To avoid an ugly throw below. If we require an empty block, we can just call setBlockCompleted
570
- // on a block with no txs. We cannot do that here because we cannot find the blockNumber without any txs.
571
- this.logger.warn(`Provided no txs to orchestrator addTxs.`);
572
- return;
573
- }
574
- const blockNumber = BlockNumber(txs[0].globalVariables.blockNumber);
575
- const provingState = this.provingState.getBlockProvingStateByBlockNumber(blockNumber);
576
- if (!provingState) {
577
- throw new Error(`Proving state for block ${blockNumber} not found. Call startNewBlock first.`);
578
- }
579
- if (provingState.totalNumTxs !== txs.length) {
580
- throw new Error(`Block ${blockNumber} should be filled with ${provingState.totalNumTxs} txs. Received ${txs.length} txs.`);
581
- }
582
- if (!provingState.isAcceptingTxs()) {
583
- throw new Error(`Block ${blockNumber} has been initialized with transactions.`);
584
- }
585
- this.logger.info(`Adding ${txs.length} transactions to block ${blockNumber}`);
586
- const db = this.getDbForBlock(blockNumber);
587
- const lastArchive = provingState.lastArchiveTreeSnapshot;
588
- const newL1ToL2MessageTreeSnapshot = provingState.newL1ToL2MessageTreeSnapshot;
589
- const spongeBlobState = provingState.getStartSpongeBlob().clone();
590
- for (const tx of txs){
591
- try {
592
- if (!provingState.verifyState()) {
593
- throw new Error(`Invalid proving state when adding a tx`);
594
- }
595
- validateTx(tx);
596
- this.logger.debug(`Received transaction: ${tx.hash}`);
597
- const startSpongeBlob = spongeBlobState.clone();
598
- const [hints, treeSnapshots] = await this.prepareBaseRollupInputs(tx, lastArchive, newL1ToL2MessageTreeSnapshot, startSpongeBlob, db);
599
- if (!provingState.verifyState()) {
600
- throw new Error(`Unable to add transaction, preparing base inputs failed`);
601
- }
602
- await spongeBlobState.absorb(tx.txEffect.toBlobFields());
603
- const txProvingState = new TxProvingState(tx, hints, treeSnapshots, this.proverId.toField());
604
- const txIndex = provingState.addNewTx(txProvingState);
605
- if (txProvingState.requireAvmProof) {
606
- this.getOrEnqueueChonkVerifier(provingState, txIndex);
607
- this.logger.debug(`Enqueueing public VM for tx ${txIndex}`);
608
- this.enqueueVM(provingState, txIndex);
609
- } else {
610
- this.logger.debug(`Enqueueing base rollup for private-only tx ${txIndex}`);
611
- this.enqueueBaseRollup(provingState, txIndex);
612
- }
613
- } catch (err) {
614
- throw new Error(`Error adding transaction ${tx.hash.toString()} to block ${blockNumber}: ${err.message}`, {
615
- cause: err
616
- });
617
- }
618
- }
619
- const endState = await db.getStateReference();
620
- provingState.setEndState(endState);
621
- const blockEndBlobFields = provingState.getBlockEndBlobFields();
622
- await spongeBlobState.absorb(blockEndBlobFields);
623
- provingState.setEndSpongeBlob(spongeBlobState);
624
- // Txs have been added to the block. Now try to accumulate the out hashes and blobs as far as we can:
625
- await this.provingState.accumulateCheckpointOutHashes();
626
- await this.provingState.setBlobAccumulators();
627
- }
628
- /**
629
- * Kickstarts chonk verifier circuits for the specified txs. These will be used during epoch proving.
630
- * Note that if the chonk verifier circuits are not started this way, they will be started nontheless after processing.
631
- */ startChonkVerifierCircuits(txs) {
632
- if (!this.provingState?.verifyState()) {
633
- throw new Error(`Empty epoch proving state. call startNewEpoch before starting chonk verifier circuits.`);
634
- }
635
- const publicTxs = txs.filter((tx)=>tx.data.forPublic);
636
- for (const tx of publicTxs){
637
- const txHash = tx.getTxHash().toString();
638
- const privateInputs = getPublicChonkVerifierPrivateInputsFromTx(tx, this.proverId.toField());
639
- const tubeProof = promiseWithResolvers();
640
- this.logger.debug(`Starting chonk verifier circuit for tx ${txHash}`);
641
- this.doEnqueueChonkVerifier(txHash, privateInputs, (proof)=>{
642
- tubeProof.resolve(proof);
643
- });
644
- this.provingState.cachedChonkVerifierProofs.set(txHash, tubeProof.promise);
645
- }
646
- return Promise.resolve();
647
- }
648
- /**
649
- * Marks the block as completed.
650
- * Computes the block header and updates the archive tree.
651
- */ async setBlockCompleted(blockNumber, expectedHeader) {
652
- const provingState = this.provingState?.getBlockProvingStateByBlockNumber(blockNumber);
653
- if (!provingState) {
654
- throw new Error(`Block proving state for ${blockNumber} not found`);
655
- }
656
- // Abort with specific error for the block if there's one.
657
- const error = provingState.getError();
658
- if (error) {
659
- throw new Error(`Block proving failed: ${error}`);
660
- }
661
- // Abort if the proving state is not valid due to errors occurred elsewhere.
662
- if (!provingState.verifyState()) {
663
- throw new Error(`Invalid proving state when completing block ${blockNumber}.`);
664
- }
665
- if (provingState.isAcceptingTxs()) {
666
- throw new Error(`Block ${blockNumber} is still accepting txs. Call setBlockCompleted after all txs have been added.`);
667
- }
668
- // Given we've applied every change from this block, now assemble the block header:
669
- this.logger.verbose(`Block ${blockNumber} completed. Assembling header.`);
670
- const header = await provingState.buildBlockHeader();
671
- if (expectedHeader && !header.equals(expectedHeader)) {
672
- this.logger.error(`Block header mismatch: header=${header} expectedHeader=${expectedHeader}`);
673
- throw new Error('Block header mismatch');
674
- }
675
- // Get db for this block and remove from map — no other code should use it after this point.
676
- const db = this.getDbForBlock(provingState.blockNumber);
677
- this.dbs.delete(provingState.blockNumber);
678
- // Update the archive tree, capture the snapshot, and close the fork deterministically.
679
- try {
680
- this.logger.verbose(`Updating archive tree with block ${provingState.blockNumber} header ${(await header.hash()).toString()}`);
681
- await db.updateArchive(header);
682
- provingState.setBuiltArchive(await getTreeSnapshot(MerkleTreeId.ARCHIVE, db));
683
- } finally{
684
- await db.close();
685
- }
686
- await this.verifyBuiltBlockAgainstSyncedState(provingState);
687
- return header;
688
- }
689
- // Flagged as protected to disable in certain unit tests
690
- async verifyBuiltBlockAgainstSyncedState(provingState) {
691
- const builtBlockHeader = provingState.getBuiltBlockHeader();
692
- if (!builtBlockHeader) {
693
- this.logger.debug('Block header not built yet, skipping header check.');
694
- return;
695
- }
696
- const output = provingState.getBlockRootRollupOutput();
697
- if (!output) {
698
- this.logger.debug('Block root rollup proof not built yet, skipping header check.');
699
- return;
700
- }
701
- const newArchive = provingState.getBuiltArchive();
702
- if (!newArchive) {
703
- this.logger.debug('Archive snapshot not yet captured, skipping header check.');
704
- return;
705
- }
706
- const header = await buildHeaderFromCircuitOutputs(output);
707
- if (!(await header.hash()).equals(await builtBlockHeader.hash())) {
708
- this.logger.error(`Block header mismatch.\nCircuit: ${inspect(header)}\nComputed: ${inspect(builtBlockHeader)}`);
709
- provingState.reject(`Block header hash mismatch.`);
710
- return;
711
- }
712
- const blockNumber = provingState.blockNumber;
713
- const syncedArchive = await getTreeSnapshot(MerkleTreeId.ARCHIVE, this.dbProvider.getSnapshot(blockNumber));
714
- if (!syncedArchive.equals(newArchive)) {
715
- this.logger.error(`Archive tree mismatch for block ${blockNumber}: world state synced to ${inspect(syncedArchive)} but built ${inspect(newArchive)}`);
716
- provingState.reject(`Archive tree mismatch.`);
717
- return;
718
- }
719
- const circuitArchive = output.newArchive;
720
- if (!newArchive.equals(circuitArchive)) {
721
- this.logger.error(`New archive mismatch.\nCircuit: ${output.newArchive}\nComputed: ${newArchive}`);
722
- provingState.reject(`New archive mismatch.`);
723
- return;
724
- }
725
- }
726
- /**
727
- * Cancel any further proving.
728
- * If cancelJobsOnStop is true, aborts all pending jobs with the broker (which marks them as 'Aborted').
729
- * If cancelJobsOnStop is false (default), jobs remain in the broker queue and can be reused on restart/reorg.
730
- */ cancel() {
731
- this.resetSchedulerState(this.cancelJobsOnStop);
732
- this.provingState?.cancel();
733
- for (const [blockNumber, db] of this.dbs.entries()){
734
- void db.close().catch((err)=>this.logger.error(`Error closing db for block ${blockNumber}`, err));
735
- }
736
- this.dbs.clear();
737
- }
738
- getDbForBlock(blockNumber) {
739
- const db = this.dbs.get(blockNumber);
740
- if (!db) {
741
- throw new Error(`World state fork for block ${blockNumber} not found.`);
742
- }
743
- return db;
744
- }
745
- /**
746
- * Returns the proof for the current epoch.
747
- */ async finalizeEpoch() {
748
- if (!this.provingState || !this.provingPromise) {
749
- throw new Error(`Invalid proving state, an epoch must be proven before it can be finalized`);
750
- }
751
- const result = await this.provingPromise;
752
- if (result.status === 'failure') {
753
- throw new Error(`Epoch proving failed: ${result.reason}`);
754
- }
755
- await this.provingState.finalizeBatchedBlob();
756
- const epochProofResult = this.provingState.getEpochProofResult();
757
- pushTestData('epochProofResult', {
758
- proof: epochProofResult.proof.toString(),
759
- publicInputs: epochProofResult.publicInputs.toString()
760
- });
761
- return epochProofResult;
762
- }
763
- async updateL1ToL2MessageTree(l1ToL2Messages, db) {
764
- const lastL1ToL2MessageTreeSnapshot = await getTreeSnapshot(MerkleTreeId.L1_TO_L2_MESSAGE_TREE, db);
765
- const lastL1ToL2MessageSubtreeRootSiblingPath = assertLength(await getSubtreeSiblingPath(MerkleTreeId.L1_TO_L2_MESSAGE_TREE, L1_TO_L2_MSG_SUBTREE_HEIGHT, db), L1_TO_L2_MSG_SUBTREE_ROOT_SIBLING_PATH_LENGTH);
766
- // Update the local trees to include the new l1 to l2 messages
767
- await appendL1ToL2MessagesToTree(db, l1ToL2Messages);
768
- const newL1ToL2MessageTreeSnapshot = await getTreeSnapshot(MerkleTreeId.L1_TO_L2_MESSAGE_TREE, db);
769
- const newL1ToL2MessageSubtreeRootSiblingPath = assertLength(await getSubtreeSiblingPath(MerkleTreeId.L1_TO_L2_MESSAGE_TREE, L1_TO_L2_MSG_SUBTREE_HEIGHT, db), L1_TO_L2_MSG_SUBTREE_ROOT_SIBLING_PATH_LENGTH);
770
- return {
771
- lastL1ToL2MessageTreeSnapshot,
772
- lastL1ToL2MessageSubtreeRootSiblingPath,
773
- newL1ToL2MessageTreeSnapshot,
774
- newL1ToL2MessageSubtreeRootSiblingPath
775
- };
776
- }
777
- // Updates the merkle trees for a transaction. The first enqueued job for a transaction
778
- async prepareBaseRollupInputs(tx, lastArchive, newL1ToL2MessageTreeSnapshot, startSpongeBlob, db) {
779
- // We build the base rollup inputs using a mock proof and verification key.
780
- // These will be overwritten later once we have proven the chonk verifier circuit and any public kernels
781
- const [ms, hints] = await elapsed(insertSideEffectsAndBuildBaseRollupHints(tx, lastArchive, newL1ToL2MessageTreeSnapshot, startSpongeBlob, this.proverId.toField(), db));
782
- this.metrics.recordBaseRollupInputs(ms);
783
- const promises = [
784
- MerkleTreeId.NOTE_HASH_TREE,
785
- MerkleTreeId.NULLIFIER_TREE,
786
- MerkleTreeId.PUBLIC_DATA_TREE
787
- ].map(async (id)=>{
788
- return {
789
- key: id,
790
- value: await getTreeSnapshot(id, db)
791
- };
792
- });
793
- const treeSnapshots = new Map((await Promise.all(promises)).map((obj)=>[
794
- obj.key,
795
- obj.value
796
- ]));
797
- return [
798
- hints,
799
- treeSnapshots
800
- ];
801
- }
802
- // Executes the base rollup circuit and stored the output as intermediate state for the parent merge/root circuit
803
- // Executes the next level of merge if all inputs are available
804
- enqueueBaseRollup(provingState, txIndex) {
805
- if (!provingState.verifyState()) {
806
- this.logger.debug('Not running base rollup, state invalid');
807
- return;
808
- }
809
- if (!provingState.tryStartProvingBase(txIndex)) {
810
- this.logger.debug(`Base rollup for tx ${txIndex} already started.`);
811
- return;
812
- }
813
- const txProvingState = provingState.getTxProvingState(txIndex);
814
- const { processedTx } = txProvingState;
815
- const { rollupType, inputs } = txProvingState.getBaseRollupTypeAndInputs();
816
- this.logger.debug(`Enqueuing deferred proving base rollup for ${processedTx.hash.toString()}`);
817
- this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, `ProvingOrchestrator.prover.${inputs instanceof PrivateTxBaseRollupPrivateInputs ? 'getPrivateTxBaseRollupProof' : 'getPublicTxBaseRollupProof'}`, {
818
- [Attributes.TX_HASH]: processedTx.hash.toString(),
819
- [Attributes.PROTOCOL_CIRCUIT_NAME]: rollupType
820
- }, (signal)=>{
821
- if (inputs instanceof PrivateTxBaseRollupPrivateInputs) {
822
- return this.prover.getPrivateTxBaseRollupProof(inputs, signal, provingState.epochNumber);
823
- } else {
824
- return this.prover.getPublicTxBaseRollupProof(inputs, signal, provingState.epochNumber);
825
- }
826
- }), (result)=>{
827
- this.logger.debug(`Completed proof for ${rollupType} for tx ${processedTx.hash.toString()}`);
828
- validatePartialState(result.inputs.endTreeSnapshots, txProvingState.treeSnapshots);
829
- const leafLocation = provingState.setBaseRollupProof(txIndex, result);
830
- if (provingState.totalNumTxs === 1) {
831
- this.checkAndEnqueueBlockRootRollup(provingState);
832
- } else {
833
- this.checkAndEnqueueNextMergeRollup(provingState, leafLocation);
834
- }
835
- });
836
- }
837
- // Enqueues the public chonk verifier circuit for a given transaction index, or reuses the one already enqueued.
838
- // Once completed, will enqueue the the public tx base rollup.
839
- getOrEnqueueChonkVerifier(provingState, txIndex) {
840
- if (!provingState.verifyState()) {
841
- this.logger.debug('Not running chonk verifier circuit, state invalid');
842
- return;
843
- }
844
- const txProvingState = provingState.getTxProvingState(txIndex);
845
- const txHash = txProvingState.processedTx.hash.toString();
846
- const handleResult = (result)=>{
847
- this.logger.debug(`Got chonk verifier proof for tx index: ${txIndex}`, {
848
- txHash
849
- });
850
- txProvingState.setPublicChonkVerifierProof(result);
851
- this.provingState?.cachedChonkVerifierProofs.delete(txHash);
852
- this.checkAndEnqueueBaseRollup(provingState, txIndex);
853
- };
854
- if (this.provingState?.cachedChonkVerifierProofs.has(txHash)) {
855
- this.logger.debug(`Chonk verifier proof already enqueued for tx index: ${txIndex}`, {
856
- txHash
857
- });
858
- void this.provingState.cachedChonkVerifierProofs.get(txHash).then(handleResult);
859
- return;
860
- }
861
- this.logger.debug(`Enqueuing chonk verifier circuit for tx index: ${txIndex}`);
862
- this.doEnqueueChonkVerifier(txHash, txProvingState.getPublicChonkVerifierPrivateInputs(), handleResult);
863
- }
864
- doEnqueueChonkVerifier(txHash, inputs, handler, provingState = this.provingState) {
865
- if (!provingState.verifyState()) {
866
- this.logger.debug('Not running chonk verifier circuit, state invalid');
867
- return;
868
- }
869
- this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getPublicChonkVerifierProof', {
870
- [Attributes.TX_HASH]: txHash,
871
- [Attributes.PROTOCOL_CIRCUIT_NAME]: 'chonk-verifier-public'
872
- }, (signal)=>this.prover.getPublicChonkVerifierProof(inputs, signal, provingState.epochNumber)), handler);
873
- }
874
- // Executes the merge rollup circuit and stored the output as intermediate state for the parent merge/block root circuit
875
- // Enqueues the next level of merge if all inputs are available
876
- enqueueMergeRollup(provingState, location) {
877
- if (!provingState.verifyState()) {
878
- this.logger.debug('Not running merge rollup. State no longer valid.');
879
- return;
880
- }
881
- if (!provingState.tryStartProvingMerge(location)) {
882
- this.logger.debug('Merge rollup already started.');
883
- return;
884
- }
885
- const inputs = provingState.getMergeRollupInputs(location);
886
- this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getTxMergeRollupProof', {
887
- [Attributes.PROTOCOL_CIRCUIT_NAME]: 'rollup-tx-merge'
888
- }, (signal)=>this.prover.getTxMergeRollupProof(inputs, signal, provingState.epochNumber)), (result)=>{
889
- provingState.setMergeRollupProof(location, result);
890
- this.checkAndEnqueueNextMergeRollup(provingState, location);
891
- });
892
- }
893
- // Executes the block root rollup circuit
894
- enqueueBlockRootRollup(provingState) {
895
- if (!provingState.verifyState()) {
896
- this.logger.debug('Not running block root rollup, state no longer valid');
897
- return;
898
- }
899
- if (!provingState.tryStartProvingBlockRoot()) {
900
- this.logger.debug('Block root rollup already started.');
901
- return;
902
- }
903
- const { rollupType, inputs } = provingState.getBlockRootRollupTypeAndInputs();
904
- this.logger.debug(`Enqueuing ${rollupType} for block ${provingState.blockNumber}.`);
905
- this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getBlockRootRollupProof', {
906
- [Attributes.PROTOCOL_CIRCUIT_NAME]: rollupType
907
- }, (signal)=>{
908
- if (inputs instanceof BlockRootFirstRollupPrivateInputs) {
909
- return this.prover.getBlockRootFirstRollupProof(inputs, signal, provingState.epochNumber);
910
- } else if (inputs instanceof BlockRootSingleTxFirstRollupPrivateInputs) {
911
- return this.prover.getBlockRootSingleTxFirstRollupProof(inputs, signal, provingState.epochNumber);
912
- } else if (inputs instanceof BlockRootEmptyTxFirstRollupPrivateInputs) {
913
- return this.prover.getBlockRootEmptyTxFirstRollupProof(inputs, signal, provingState.epochNumber);
914
- } else if (inputs instanceof BlockRootSingleTxRollupPrivateInputs) {
915
- return this.prover.getBlockRootSingleTxRollupProof(inputs, signal, provingState.epochNumber);
916
- } else {
917
- return this.prover.getBlockRootRollupProof(inputs, signal, provingState.epochNumber);
918
- }
919
- }), async (result)=>{
920
- this.logger.debug(`Completed ${rollupType} proof for block ${provingState.blockNumber}`, {
921
- blockNumber: provingState.blockNumber,
922
- checkpointIndex: provingState.parentCheckpoint.index,
923
- ...result.inputs.toInspect()
924
- });
925
- const leafLocation = provingState.setBlockRootRollupProof(result);
926
- const checkpointProvingState = provingState.parentCheckpoint;
927
- // Verification is called from both here and setBlockCompleted. Whichever runs last
928
- // will be the first to see all three pieces (header, proof output, archive) and run the checks.
929
- await this.verifyBuiltBlockAgainstSyncedState(provingState);
930
- if (checkpointProvingState.totalNumBlocks === 1) {
931
- await this.checkAndEnqueueCheckpointRootRollup(checkpointProvingState);
932
- } else {
933
- await this.checkAndEnqueueNextBlockMergeRollup(checkpointProvingState, leafLocation);
934
- }
935
- });
936
- }
937
- // Executes the base parity circuit and stores the intermediate state for the root parity circuit
938
- // Enqueues the root parity circuit if all inputs are available
939
- enqueueBaseParityCircuit(checkpointProvingState, provingState, baseParityIndex) {
940
- if (!provingState.verifyState()) {
941
- this.logger.debug('Not running base parity. State no longer valid.');
942
- return;
943
- }
944
- if (!provingState.tryStartProvingBaseParity(baseParityIndex)) {
945
- this.logger.warn(`Base parity ${baseParityIndex} already started.`);
946
- return;
947
- }
948
- const inputs = checkpointProvingState.getBaseParityInputs(baseParityIndex);
949
- this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getBaseParityProof', {
950
- [Attributes.PROTOCOL_CIRCUIT_NAME]: 'parity-base'
951
- }, (signal)=>this.prover.getBaseParityProof(inputs, signal, provingState.epochNumber)), (provingOutput)=>{
952
- provingState.setBaseParityProof(baseParityIndex, provingOutput);
953
- this.checkAndEnqueueRootParityCircuit(provingState);
954
- });
955
- }
956
- checkAndEnqueueRootParityCircuit(provingState) {
957
- if (!provingState.isReadyForRootParity()) {
958
- return;
959
- }
960
- this.enqueueRootParityCircuit(provingState);
961
- }
962
- // Runs the root parity circuit ans stored the outputs
963
- // Enqueues the root rollup proof if all inputs are available
964
- enqueueRootParityCircuit(provingState) {
965
- if (!provingState.verifyState()) {
966
- this.logger.debug('Not running root parity. State no longer valid.');
967
- return;
968
- }
969
- if (!provingState.tryStartProvingRootParity()) {
970
- this.logger.debug('Root parity already started.');
971
- return;
972
- }
973
- const inputs = provingState.getParityRootInputs();
974
- this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getRootParityProof', {
975
- [Attributes.PROTOCOL_CIRCUIT_NAME]: 'parity-root'
976
- }, (signal)=>this.prover.getRootParityProof(inputs, signal, provingState.epochNumber)), (result)=>{
977
- provingState.setRootParityProof(result);
978
- this.checkAndEnqueueBlockRootRollup(provingState);
979
- });
980
- }
981
- // Executes the block merge rollup circuit and stored the output as intermediate state for the parent merge/block root circuit
982
- // Enqueues the next level of merge if all inputs are available
983
- enqueueBlockMergeRollup(provingState, location) {
984
- if (!provingState.verifyState()) {
985
- this.logger.debug('Not running block merge rollup. State no longer valid.');
986
- return;
987
- }
988
- if (!provingState.tryStartProvingBlockMerge(location)) {
989
- this.logger.debug('Block merge rollup already started.');
990
- return;
991
- }
992
- const inputs = provingState.getBlockMergeRollupInputs(location);
993
- this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getBlockMergeRollupProof', {
994
- [Attributes.PROTOCOL_CIRCUIT_NAME]: 'rollup-block-merge'
995
- }, (signal)=>this.prover.getBlockMergeRollupProof(inputs, signal, provingState.epochNumber)), async (result)=>{
996
- this.logger.debug(`Completed block merge rollup proof for checkpoint ${provingState.index}`, {
997
- checkpointIndex: provingState.index,
998
- mergeLocation: location,
999
- ...result.inputs.toInspect()
1000
- });
1001
- provingState.setBlockMergeRollupProof(location, result);
1002
- await this.checkAndEnqueueNextBlockMergeRollup(provingState, location);
1003
- });
1004
- }
1005
- async enqueueCheckpointRootRollup(provingState) {
1006
- if (!provingState.verifyState()) {
1007
- this.logger.debug('Not running checkpoint root rollup. State no longer valid.');
1008
- return;
1009
- }
1010
- if (!provingState.tryStartProvingCheckpointRoot()) {
1011
- this.logger.debug('Checkpoint root rollup already started.');
1012
- return;
1013
- }
1014
- const rollupType = provingState.getCheckpointRootRollupType();
1015
- this.logger.debug(`Enqueuing ${rollupType} for checkpoint ${provingState.index}.`);
1016
- const inputs = await provingState.getCheckpointRootRollupInputs();
1017
- this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getCheckpointRootRollupProof', {
1018
- [Attributes.PROTOCOL_CIRCUIT_NAME]: rollupType
1019
- }, (signal)=>{
1020
- if (inputs instanceof CheckpointRootSingleBlockRollupPrivateInputs) {
1021
- return this.prover.getCheckpointRootSingleBlockRollupProof(inputs, signal, provingState.epochNumber);
1022
- } else {
1023
- return this.prover.getCheckpointRootRollupProof(inputs, signal, provingState.epochNumber);
1024
- }
1025
- }), (result)=>{
1026
- const computedEndBlobAccumulatorState = provingState.getEndBlobAccumulator().toBlobAccumulator();
1027
- const circuitEndBlobAccumulatorState = result.inputs.endBlobAccumulator;
1028
- if (!circuitEndBlobAccumulatorState.equals(computedEndBlobAccumulatorState)) {
1029
- this.logger.error(`Blob accumulator state mismatch.\nCircuit: ${inspect(circuitEndBlobAccumulatorState)}\nComputed: ${inspect(computedEndBlobAccumulatorState)}`);
1030
- provingState.reject(`Blob accumulator state mismatch.`);
1031
- return;
1032
- }
1033
- this.logger.debug(`Completed ${rollupType} proof for checkpoint ${provingState.index}`, {
1034
- checkpointIndex: provingState.index,
1035
- ...result.inputs.toInspect()
1036
- });
1037
- const leafLocation = provingState.setCheckpointRootRollupProof(result);
1038
- const epochProvingState = provingState.parentEpoch;
1039
- if (epochProvingState.totalNumCheckpoints === 1) {
1040
- this.enqueueEpochPadding(epochProvingState);
1041
- } else {
1042
- this.checkAndEnqueueNextCheckpointMergeRollup(epochProvingState, leafLocation);
1043
- }
1044
- });
1045
- }
1046
- checkAndEnqueueNextMergeRollup(provingState, currentLocation) {
1047
- if (!provingState.isReadyForMergeRollup(currentLocation)) {
1048
- return;
1049
- }
1050
- const parentLocation = provingState.getParentLocation(currentLocation);
1051
- if (parentLocation.level === 0) {
1052
- this.checkAndEnqueueBlockRootRollup(provingState);
1053
- } else {
1054
- this.enqueueMergeRollup(provingState, parentLocation);
1055
- }
1056
- }
1057
- checkAndEnqueueBlockRootRollup(provingState) {
1058
- if (!provingState.isReadyForBlockRootRollup()) {
1059
- this.logger.debug('Not ready for block root rollup');
1060
- return;
1061
- }
1062
- this.enqueueBlockRootRollup(provingState);
1063
- }
1064
- async checkAndEnqueueNextBlockMergeRollup(provingState, currentLocation) {
1065
- if (!provingState.isReadyForBlockMerge(currentLocation)) {
1066
- return;
1067
- }
1068
- const parentLocation = provingState.getParentLocation(currentLocation);
1069
- if (parentLocation.level === 0) {
1070
- await this.checkAndEnqueueCheckpointRootRollup(provingState);
1071
- } else {
1072
- this.enqueueBlockMergeRollup(provingState, parentLocation);
1073
- }
1074
- }
1075
- async checkAndEnqueueCheckpointRootRollup(provingState) {
1076
- if (!provingState.isReadyForCheckpointRoot()) {
1077
- return;
1078
- }
1079
- await this.enqueueCheckpointRootRollup(provingState);
1080
- }
1081
- /**
1082
- * Executes the VM circuit for a public function, will enqueue the corresponding kernel if the
1083
- * previous kernel is ready
1084
- * @param provingState - The proving state being operated on
1085
- * @param txIndex - The index of the transaction being proven
1086
- */ enqueueVM(provingState, txIndex) {
1087
- if (!provingState.verifyState()) {
1088
- this.logger.debug(`Not running VM circuit as state is no longer valid`);
1089
- return;
1090
- }
1091
- const txProvingState = provingState.getTxProvingState(txIndex);
1092
- const doAvmProving = wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getAvmProof', {
1093
- [Attributes.TX_HASH]: txProvingState.processedTx.hash.toString()
1094
- }, async (signal)=>{
1095
- const inputs = txProvingState.getAvmInputs();
1096
- return await this.prover.getAvmProof(inputs, signal, provingState.epochNumber);
1097
- });
1098
- this.deferredProving(provingState, doAvmProving, (proof)=>{
1099
- this.logger.debug(`Proven VM for tx index: ${txIndex}`);
1100
- txProvingState.setAvmProof(proof);
1101
- this.checkAndEnqueueBaseRollup(provingState, txIndex);
1102
- });
1103
- }
1104
- checkAndEnqueueBaseRollup(provingState, txIndex) {
1105
- const txProvingState = provingState.getTxProvingState(txIndex);
1106
- if (!txProvingState.ready()) {
1107
- return;
1108
- }
1109
- // We must have completed all proving (chonk verifier proof and (if required) vm proof are generated), we now move to the base rollup.
1110
- this.logger.debug(`Public functions completed for tx ${txIndex} enqueueing base rollup`);
1111
- this.enqueueBaseRollup(provingState, txIndex);
1112
- }
1113
- }