@aztec/prover-client 0.0.1-commit.03f7ef2 → 0.0.1-commit.04d373f
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/dest/config.d.ts +1 -1
- package/dest/config.d.ts.map +1 -1
- package/dest/config.js +16 -2
- package/dest/light/lightweight_checkpoint_builder.d.ts +22 -6
- package/dest/light/lightweight_checkpoint_builder.d.ts.map +1 -1
- package/dest/light/lightweight_checkpoint_builder.js +112 -28
- package/dest/mocks/fixtures.d.ts +1 -1
- package/dest/mocks/fixtures.d.ts.map +1 -1
- package/dest/mocks/fixtures.js +2 -1
- package/dest/mocks/test_context.d.ts +6 -2
- package/dest/mocks/test_context.d.ts.map +1 -1
- package/dest/mocks/test_context.js +31 -11
- package/dest/orchestrator/block-building-helpers.d.ts +5 -5
- package/dest/orchestrator/block-building-helpers.d.ts.map +1 -1
- package/dest/orchestrator/block-building-helpers.js +4 -4
- package/dest/orchestrator/block-proving-state.d.ts +4 -1
- package/dest/orchestrator/block-proving-state.d.ts.map +1 -1
- package/dest/orchestrator/block-proving-state.js +7 -0
- package/dest/orchestrator/checkpoint-proving-state.d.ts +24 -4
- package/dest/orchestrator/checkpoint-proving-state.d.ts.map +1 -1
- package/dest/orchestrator/checkpoint-proving-state.js +47 -5
- package/dest/orchestrator/checkpoint-sub-tree-orchestrator.d.ts +107 -0
- package/dest/orchestrator/checkpoint-sub-tree-orchestrator.d.ts.map +1 -0
- package/dest/orchestrator/checkpoint-sub-tree-orchestrator.js +151 -0
- package/dest/orchestrator/epoch-proving-context.d.ts +51 -0
- package/dest/orchestrator/epoch-proving-context.d.ts.map +1 -0
- package/dest/orchestrator/epoch-proving-context.js +81 -0
- package/dest/orchestrator/epoch-proving-state.d.ts +7 -6
- package/dest/orchestrator/epoch-proving-state.d.ts.map +1 -1
- package/dest/orchestrator/epoch-proving-state.js +37 -1
- package/dest/orchestrator/index.d.ts +4 -1
- package/dest/orchestrator/index.d.ts.map +1 -1
- package/dest/orchestrator/index.js +3 -0
- package/dest/orchestrator/orchestrator.d.ts +30 -25
- package/dest/orchestrator/orchestrator.d.ts.map +1 -1
- package/dest/orchestrator/orchestrator.js +549 -255
- package/dest/orchestrator/orchestrator_metrics.d.ts +1 -1
- package/dest/orchestrator/orchestrator_metrics.d.ts.map +1 -1
- package/dest/orchestrator/orchestrator_metrics.js +2 -6
- package/dest/orchestrator/proving-scheduler.d.ts +72 -0
- package/dest/orchestrator/proving-scheduler.d.ts.map +1 -0
- package/dest/orchestrator/proving-scheduler.js +117 -0
- package/dest/orchestrator/top-tree-orchestrator.d.ts +83 -0
- package/dest/orchestrator/top-tree-orchestrator.d.ts.map +1 -0
- package/dest/orchestrator/top-tree-orchestrator.js +182 -0
- package/dest/orchestrator/top-tree-proving-scheduler.d.ts +62 -0
- package/dest/orchestrator/top-tree-proving-scheduler.d.ts.map +1 -0
- package/dest/orchestrator/top-tree-proving-scheduler.js +73 -0
- package/dest/orchestrator/top-tree-proving-state.d.ts +61 -0
- package/dest/orchestrator/top-tree-proving-state.d.ts.map +1 -0
- package/dest/orchestrator/top-tree-proving-state.js +185 -0
- package/dest/orchestrator/tx-proving-state.d.ts +5 -4
- package/dest/orchestrator/tx-proving-state.d.ts.map +1 -1
- package/dest/orchestrator/tx-proving-state.js +6 -6
- package/dest/prover-client/factory.d.ts +3 -3
- package/dest/prover-client/factory.d.ts.map +1 -1
- package/dest/prover-client/prover-client.d.ts +66 -7
- package/dest/prover-client/prover-client.d.ts.map +1 -1
- package/dest/prover-client/prover-client.js +64 -11
- package/dest/proving_broker/broker_prover_facade.d.ts +7 -5
- package/dest/proving_broker/broker_prover_facade.d.ts.map +1 -1
- package/dest/proving_broker/broker_prover_facade.js +16 -22
- package/dest/proving_broker/config.d.ts +12 -64
- package/dest/proving_broker/config.d.ts.map +1 -1
- package/dest/proving_broker/config.js +22 -5
- package/dest/proving_broker/index.d.ts +2 -1
- package/dest/proving_broker/index.d.ts.map +1 -1
- package/dest/proving_broker/index.js +1 -0
- package/dest/proving_broker/proof_store/factory.d.ts +2 -5
- package/dest/proving_broker/proof_store/factory.d.ts.map +1 -1
- package/dest/proving_broker/proof_store/factory.js +7 -30
- package/dest/proving_broker/proof_store/file_store_proof_store.d.ts +18 -0
- package/dest/proving_broker/proof_store/file_store_proof_store.d.ts.map +1 -0
- package/dest/proving_broker/proof_store/file_store_proof_store.js +60 -0
- package/dest/proving_broker/proof_store/index.d.ts +2 -2
- package/dest/proving_broker/proof_store/index.d.ts.map +1 -1
- package/dest/proving_broker/proof_store/index.js +1 -1
- package/dest/proving_broker/proving_agent.d.ts +5 -9
- package/dest/proving_broker/proving_agent.d.ts.map +1 -1
- package/dest/proving_broker/proving_agent.js +4 -19
- package/dest/proving_broker/proving_broker.d.ts +8 -5
- package/dest/proving_broker/proving_broker.d.ts.map +1 -1
- package/dest/proving_broker/proving_broker.js +69 -21
- package/dest/proving_broker/proving_broker_database/persisted.d.ts +3 -2
- package/dest/proving_broker/proving_broker_database/persisted.d.ts.map +1 -1
- package/dest/proving_broker/proving_broker_database/persisted.js +391 -3
- package/dest/proving_broker/proving_broker_instrumentation.d.ts +3 -1
- package/dest/proving_broker/proving_broker_instrumentation.d.ts.map +1 -1
- package/dest/proving_broker/proving_broker_instrumentation.js +22 -35
- package/dest/proving_broker/proving_job_controller.d.ts +4 -3
- package/dest/proving_broker/proving_job_controller.d.ts.map +1 -1
- package/dest/proving_broker/proving_job_controller.js +6 -3
- package/dest/proving_broker/rpc.d.ts +6 -2
- package/dest/proving_broker/rpc.d.ts.map +1 -1
- package/dest/proving_broker/rpc.js +87 -23
- package/dest/test/mock_proof_store.d.ts +3 -3
- package/dest/test/mock_proof_store.d.ts.map +1 -1
- package/dest/test/mock_prover.d.ts +5 -5
- package/dest/test/mock_prover.d.ts.map +1 -1
- package/dest/test/mock_prover.js +3 -3
- package/package.json +19 -21
- package/src/config.ts +18 -2
- package/src/light/lightweight_checkpoint_builder.ts +159 -37
- package/src/mocks/fixtures.ts +2 -1
- package/src/mocks/test_context.ts +24 -11
- package/src/orchestrator/block-building-helpers.ts +4 -4
- package/src/orchestrator/block-proving-state.ts +9 -0
- package/src/orchestrator/checkpoint-proving-state.ts +65 -6
- package/src/orchestrator/checkpoint-sub-tree-orchestrator.ts +271 -0
- package/src/orchestrator/epoch-proving-context.ts +101 -0
- package/src/orchestrator/epoch-proving-state.ts +59 -9
- package/src/orchestrator/index.ts +8 -0
- package/src/orchestrator/orchestrator.ts +165 -293
- package/src/orchestrator/orchestrator_metrics.ts +2 -6
- package/src/orchestrator/proving-scheduler.ts +156 -0
- package/src/orchestrator/top-tree-orchestrator.ts +314 -0
- package/src/orchestrator/top-tree-proving-scheduler.ts +154 -0
- package/src/orchestrator/top-tree-proving-state.ts +220 -0
- package/src/orchestrator/tx-proving-state.ts +8 -11
- package/src/prover-client/factory.ts +6 -2
- package/src/prover-client/prover-client.ts +157 -24
- package/src/proving_broker/broker_prover_facade.ts +25 -26
- package/src/proving_broker/config.ts +25 -2
- package/src/proving_broker/index.ts +1 -0
- package/src/proving_broker/proof_store/factory.ts +10 -32
- package/src/proving_broker/proof_store/file_store_proof_store.ts +78 -0
- package/src/proving_broker/proof_store/index.ts +1 -1
- package/src/proving_broker/proving_agent.ts +6 -19
- package/src/proving_broker/proving_broker.ts +65 -16
- package/src/proving_broker/proving_broker_database/persisted.ts +17 -3
- package/src/proving_broker/proving_broker_instrumentation.ts +23 -35
- package/src/proving_broker/proving_job_controller.ts +9 -3
- package/src/proving_broker/rpc.ts +46 -20
- package/src/test/mock_prover.ts +1 -8
- package/dest/block-factory/index.d.ts +0 -2
- package/dest/block-factory/index.d.ts.map +0 -1
- package/dest/block-factory/index.js +0 -1
- package/dest/block-factory/light.d.ts +0 -38
- package/dest/block-factory/light.d.ts.map +0 -1
- package/dest/block-factory/light.js +0 -108
- package/dest/proving_broker/proof_store/gcs_proof_store.d.ts +0 -14
- package/dest/proving_broker/proof_store/gcs_proof_store.d.ts.map +0 -1
- package/dest/proving_broker/proof_store/gcs_proof_store.js +0 -52
- package/dest/proving_broker/proving_agent_instrumentation.d.ts +0 -8
- package/dest/proving_broker/proving_agent_instrumentation.d.ts.map +0 -1
- package/dest/proving_broker/proving_agent_instrumentation.js +0 -16
- package/src/block-factory/index.ts +0 -1
- package/src/block-factory/light.ts +0 -137
- package/src/proving_broker/proof_store/gcs_proof_store.ts +0 -76
- package/src/proving_broker/proving_agent_instrumentation.ts +0 -21
|
@@ -1,19 +1,383 @@
|
|
|
1
|
-
function
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
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
|
+
};
|
|
6
369
|
}
|
|
7
|
-
|
|
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';
|
|
8
375
|
import { BlockNumber } from '@aztec/foundation/branded-types';
|
|
9
|
-
import { padArrayEnd } from '@aztec/foundation/collection';
|
|
10
|
-
import { Fr } from '@aztec/foundation/curves/bn254';
|
|
11
|
-
import { AbortError } from '@aztec/foundation/error';
|
|
12
|
-
import { createLogger } from '@aztec/foundation/log';
|
|
13
376
|
import { promiseWithResolvers } from '@aztec/foundation/promise';
|
|
14
377
|
import { assertLength } from '@aztec/foundation/serialize';
|
|
15
378
|
import { pushTestData } from '@aztec/foundation/testing';
|
|
16
379
|
import { elapsed } from '@aztec/foundation/timer';
|
|
380
|
+
import { appendL1ToL2MessagesToTree } from '@aztec/stdlib/messaging';
|
|
17
381
|
import { BlockRootEmptyTxFirstRollupPrivateInputs, BlockRootFirstRollupPrivateInputs, BlockRootSingleTxFirstRollupPrivateInputs, BlockRootSingleTxRollupPrivateInputs, CheckpointRootSingleBlockRollupPrivateInputs, PrivateTxBaseRollupPrivateInputs } from '@aztec/stdlib/rollup';
|
|
18
382
|
import { MerkleTreeId } from '@aztec/stdlib/trees';
|
|
19
383
|
import { Attributes, getTelemetryClient, trackSpan, wrapCallbackInSpan } from '@aztec/telemetry-client';
|
|
@@ -21,8 +385,17 @@ import { inspect } from 'util';
|
|
|
21
385
|
import { buildHeaderFromCircuitOutputs, getLastSiblingPath, getPublicChonkVerifierPrivateInputsFromTx, getRootTreeSiblingPath, getSubtreeSiblingPath, getTreeSnapshot, insertSideEffectsAndBuildBaseRollupHints, validatePartialState, validateTx } from './block-building-helpers.js';
|
|
22
386
|
import { EpochProvingState } from './epoch-proving-state.js';
|
|
23
387
|
import { ProvingOrchestratorMetrics } from './orchestrator_metrics.js';
|
|
388
|
+
import { TopTreeProvingScheduler } from './top-tree-proving-scheduler.js';
|
|
24
389
|
import { TxProvingState } from './tx-proving-state.js';
|
|
25
|
-
|
|
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
|
+
}));
|
|
26
399
|
/**
|
|
27
400
|
* Implements an event driven proving scheduler to build the recursive proof tree. The idea being:
|
|
28
401
|
* 1. Transactions are provided to the scheduler post simulation.
|
|
@@ -34,24 +407,45 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
34
407
|
* The proving implementation is determined by the provided prover. This could be for example a local prover or a remote prover pool.
|
|
35
408
|
*/ /**
|
|
36
409
|
* The orchestrator, managing the flow of recursive proving operations required to build the rollup proof tree.
|
|
37
|
-
*/ export class ProvingOrchestrator {
|
|
410
|
+
*/ export class ProvingOrchestrator extends TopTreeProvingScheduler {
|
|
38
411
|
dbProvider;
|
|
39
|
-
prover;
|
|
40
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
|
+
}
|
|
41
443
|
provingState;
|
|
42
|
-
pendingProvingJobs;
|
|
43
444
|
provingPromise;
|
|
44
445
|
metrics;
|
|
45
|
-
// eslint-disable-next-line aztec-custom/no-non-primitive-in-collections
|
|
46
446
|
dbs;
|
|
47
|
-
constructor(dbProvider, prover, proverId, telemetryClient = getTelemetryClient()){
|
|
48
|
-
this.dbProvider = dbProvider;
|
|
49
|
-
this.prover = prover;
|
|
50
|
-
this.proverId = proverId;
|
|
51
|
-
this.provingState = undefined;
|
|
52
|
-
this.pendingProvingJobs = [];
|
|
53
|
-
this.provingPromise = undefined;
|
|
54
|
-
this.dbs = new Map();
|
|
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();
|
|
55
449
|
this.metrics = new ProvingOrchestratorMetrics(telemetryClient, 'ProvingOrchestrator');
|
|
56
450
|
}
|
|
57
451
|
get tracer() {
|
|
@@ -60,9 +454,21 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
60
454
|
getProverId() {
|
|
61
455
|
return this.proverId;
|
|
62
456
|
}
|
|
63
|
-
|
|
457
|
+
getNumActiveForks() {
|
|
458
|
+
return this.dbs.size;
|
|
459
|
+
}
|
|
460
|
+
cancelInternal() {
|
|
64
461
|
this.cancel();
|
|
65
|
-
|
|
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
|
+
});
|
|
66
472
|
}
|
|
67
473
|
startNewEpoch(epochNumber, totalNumCheckpoints, finalBlobBatchingChallenges) {
|
|
68
474
|
if (this.provingState?.verifyState()) {
|
|
@@ -73,11 +479,18 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
73
479
|
status: 'failure',
|
|
74
480
|
reason
|
|
75
481
|
}));
|
|
76
|
-
logger.info(`Starting epoch ${epochNumber} with ${totalNumCheckpoints} checkpoints.`);
|
|
482
|
+
this.logger.info(`Starting epoch ${epochNumber} with ${totalNumCheckpoints} checkpoints.`);
|
|
77
483
|
this.provingState = new EpochProvingState(epochNumber, totalNumCheckpoints, finalBlobBatchingChallenges, (provingState)=>this.checkAndEnqueueCheckpointRootRollup(provingState), resolve, reject);
|
|
78
484
|
this.provingPromise = promise;
|
|
79
485
|
}
|
|
80
|
-
|
|
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) {
|
|
81
494
|
if (!this.provingState) {
|
|
82
495
|
throw new Error('Empty epoch proving state. Call startNewEpoch before starting a checkpoint.');
|
|
83
496
|
}
|
|
@@ -113,14 +526,14 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
113
526
|
throw new Error(`Checkpoint not accepting further blocks.`);
|
|
114
527
|
}
|
|
115
528
|
const constants = checkpointProvingState.constants;
|
|
116
|
-
logger.info(`Starting block ${blockNumber} for slot ${constants.slotNumber}.`);
|
|
529
|
+
this.logger.info(`Starting block ${blockNumber} for slot ${constants.slotNumber}.`);
|
|
117
530
|
// Fork the db only when it's not already set. The db for the first block is set in `startNewCheckpoint`.
|
|
118
531
|
if (!this.dbs.has(blockNumber)) {
|
|
119
532
|
// Fork world state at the end of the immediately previous block
|
|
120
533
|
const db = await this.dbProvider.fork(BlockNumber(blockNumber - 1));
|
|
121
534
|
this.dbs.set(blockNumber, db);
|
|
122
535
|
}
|
|
123
|
-
const db = this.
|
|
536
|
+
const db = this.getDbForBlock(blockNumber);
|
|
124
537
|
// Get archive snapshot and sibling path before any txs in this block lands.
|
|
125
538
|
const lastArchiveTreeSnapshot = await getTreeSnapshot(MerkleTreeId.ARCHIVE, db);
|
|
126
539
|
const lastArchiveSiblingPath = await getRootTreeSiblingPath(MerkleTreeId.ARCHIVE, db);
|
|
@@ -140,7 +553,8 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
140
553
|
const blockEndBlobFields = blockProvingState.getBlockEndBlobFields();
|
|
141
554
|
await endSpongeBlob.absorb(blockEndBlobFields);
|
|
142
555
|
blockProvingState.setEndSpongeBlob(endSpongeBlob);
|
|
143
|
-
//
|
|
556
|
+
// Try to accumulate the out hashes and blobs as far as we can:
|
|
557
|
+
await this.provingState.accumulateCheckpointOutHashes();
|
|
144
558
|
await this.provingState.setBlobAccumulators();
|
|
145
559
|
}
|
|
146
560
|
}
|
|
@@ -154,7 +568,7 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
154
568
|
if (!txs.length) {
|
|
155
569
|
// To avoid an ugly throw below. If we require an empty block, we can just call setBlockCompleted
|
|
156
570
|
// on a block with no txs. We cannot do that here because we cannot find the blockNumber without any txs.
|
|
157
|
-
logger.warn(`Provided no txs to orchestrator addTxs.`);
|
|
571
|
+
this.logger.warn(`Provided no txs to orchestrator addTxs.`);
|
|
158
572
|
return;
|
|
159
573
|
}
|
|
160
574
|
const blockNumber = BlockNumber(txs[0].globalVariables.blockNumber);
|
|
@@ -168,8 +582,8 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
168
582
|
if (!provingState.isAcceptingTxs()) {
|
|
169
583
|
throw new Error(`Block ${blockNumber} has been initialized with transactions.`);
|
|
170
584
|
}
|
|
171
|
-
logger.info(`Adding ${txs.length} transactions to block ${blockNumber}`);
|
|
172
|
-
const db = this.
|
|
585
|
+
this.logger.info(`Adding ${txs.length} transactions to block ${blockNumber}`);
|
|
586
|
+
const db = this.getDbForBlock(blockNumber);
|
|
173
587
|
const lastArchive = provingState.lastArchiveTreeSnapshot;
|
|
174
588
|
const newL1ToL2MessageTreeSnapshot = provingState.newL1ToL2MessageTreeSnapshot;
|
|
175
589
|
const spongeBlobState = provingState.getStartSpongeBlob().clone();
|
|
@@ -179,7 +593,7 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
179
593
|
throw new Error(`Invalid proving state when adding a tx`);
|
|
180
594
|
}
|
|
181
595
|
validateTx(tx);
|
|
182
|
-
logger.
|
|
596
|
+
this.logger.debug(`Received transaction: ${tx.hash}`);
|
|
183
597
|
const startSpongeBlob = spongeBlobState.clone();
|
|
184
598
|
const [hints, treeSnapshots] = await this.prepareBaseRollupInputs(tx, lastArchive, newL1ToL2MessageTreeSnapshot, startSpongeBlob, db);
|
|
185
599
|
if (!provingState.verifyState()) {
|
|
@@ -190,10 +604,10 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
190
604
|
const txIndex = provingState.addNewTx(txProvingState);
|
|
191
605
|
if (txProvingState.requireAvmProof) {
|
|
192
606
|
this.getOrEnqueueChonkVerifier(provingState, txIndex);
|
|
193
|
-
logger.debug(`Enqueueing public VM for tx ${txIndex}`);
|
|
607
|
+
this.logger.debug(`Enqueueing public VM for tx ${txIndex}`);
|
|
194
608
|
this.enqueueVM(provingState, txIndex);
|
|
195
609
|
} else {
|
|
196
|
-
logger.debug(`Enqueueing base rollup for private-only tx ${txIndex}`);
|
|
610
|
+
this.logger.debug(`Enqueueing base rollup for private-only tx ${txIndex}`);
|
|
197
611
|
this.enqueueBaseRollup(provingState, txIndex);
|
|
198
612
|
}
|
|
199
613
|
} catch (err) {
|
|
@@ -207,7 +621,8 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
207
621
|
const blockEndBlobFields = provingState.getBlockEndBlobFields();
|
|
208
622
|
await spongeBlobState.absorb(blockEndBlobFields);
|
|
209
623
|
provingState.setEndSpongeBlob(spongeBlobState);
|
|
210
|
-
// Txs have been added to the block. Now try to accumulate the blobs as far as we can:
|
|
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();
|
|
211
626
|
await this.provingState.setBlobAccumulators();
|
|
212
627
|
}
|
|
213
628
|
/**
|
|
@@ -222,7 +637,7 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
222
637
|
const txHash = tx.getTxHash().toString();
|
|
223
638
|
const privateInputs = getPublicChonkVerifierPrivateInputsFromTx(tx, this.proverId.toField());
|
|
224
639
|
const tubeProof = promiseWithResolvers();
|
|
225
|
-
logger.debug(`Starting chonk verifier circuit for tx ${txHash}`);
|
|
640
|
+
this.logger.debug(`Starting chonk verifier circuit for tx ${txHash}`);
|
|
226
641
|
this.doEnqueueChonkVerifier(txHash, privateInputs, (proof)=>{
|
|
227
642
|
tubeProof.resolve(proof);
|
|
228
643
|
});
|
|
@@ -251,17 +666,23 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
251
666
|
throw new Error(`Block ${blockNumber} is still accepting txs. Call setBlockCompleted after all txs have been added.`);
|
|
252
667
|
}
|
|
253
668
|
// Given we've applied every change from this block, now assemble the block header:
|
|
254
|
-
logger.verbose(`Block ${blockNumber} completed. Assembling header.`);
|
|
669
|
+
this.logger.verbose(`Block ${blockNumber} completed. Assembling header.`);
|
|
255
670
|
const header = await provingState.buildBlockHeader();
|
|
256
671
|
if (expectedHeader && !header.equals(expectedHeader)) {
|
|
257
|
-
logger.error(`Block header mismatch: header=${header} expectedHeader=${expectedHeader}`);
|
|
672
|
+
this.logger.error(`Block header mismatch: header=${header} expectedHeader=${expectedHeader}`);
|
|
258
673
|
throw new Error('Block header mismatch');
|
|
259
674
|
}
|
|
260
|
-
// Get db for this block
|
|
261
|
-
const db = this.
|
|
262
|
-
|
|
263
|
-
|
|
264
|
-
|
|
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
|
+
}
|
|
265
686
|
await this.verifyBuiltBlockAgainstSyncedState(provingState);
|
|
266
687
|
return header;
|
|
267
688
|
}
|
|
@@ -269,50 +690,57 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
269
690
|
async verifyBuiltBlockAgainstSyncedState(provingState) {
|
|
270
691
|
const builtBlockHeader = provingState.getBuiltBlockHeader();
|
|
271
692
|
if (!builtBlockHeader) {
|
|
272
|
-
logger.debug('Block header not built yet, skipping header check.');
|
|
693
|
+
this.logger.debug('Block header not built yet, skipping header check.');
|
|
273
694
|
return;
|
|
274
695
|
}
|
|
275
696
|
const output = provingState.getBlockRootRollupOutput();
|
|
276
697
|
if (!output) {
|
|
277
|
-
logger.debug('Block root rollup proof not built yet, skipping header check.');
|
|
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.');
|
|
278
704
|
return;
|
|
279
705
|
}
|
|
280
706
|
const header = await buildHeaderFromCircuitOutputs(output);
|
|
281
707
|
if (!(await header.hash()).equals(await builtBlockHeader.hash())) {
|
|
282
|
-
logger.error(`Block header mismatch.\nCircuit: ${inspect(header)}\nComputed: ${inspect(builtBlockHeader)}`);
|
|
708
|
+
this.logger.error(`Block header mismatch.\nCircuit: ${inspect(header)}\nComputed: ${inspect(builtBlockHeader)}`);
|
|
283
709
|
provingState.reject(`Block header hash mismatch.`);
|
|
284
710
|
return;
|
|
285
711
|
}
|
|
286
|
-
// Get db for this block
|
|
287
712
|
const blockNumber = provingState.blockNumber;
|
|
288
|
-
const db = this.dbs.get(blockNumber);
|
|
289
|
-
const newArchive = await getTreeSnapshot(MerkleTreeId.ARCHIVE, db);
|
|
290
713
|
const syncedArchive = await getTreeSnapshot(MerkleTreeId.ARCHIVE, this.dbProvider.getSnapshot(blockNumber));
|
|
291
714
|
if (!syncedArchive.equals(newArchive)) {
|
|
292
|
-
logger.error(`Archive tree mismatch for block ${blockNumber}: world state synced to ${inspect(syncedArchive)} but built ${inspect(newArchive)}`);
|
|
715
|
+
this.logger.error(`Archive tree mismatch for block ${blockNumber}: world state synced to ${inspect(syncedArchive)} but built ${inspect(newArchive)}`);
|
|
293
716
|
provingState.reject(`Archive tree mismatch.`);
|
|
294
717
|
return;
|
|
295
718
|
}
|
|
296
719
|
const circuitArchive = output.newArchive;
|
|
297
720
|
if (!newArchive.equals(circuitArchive)) {
|
|
298
|
-
logger.error(`New archive mismatch.\nCircuit: ${output.newArchive}\nComputed: ${newArchive}`);
|
|
721
|
+
this.logger.error(`New archive mismatch.\nCircuit: ${output.newArchive}\nComputed: ${newArchive}`);
|
|
299
722
|
provingState.reject(`New archive mismatch.`);
|
|
300
723
|
return;
|
|
301
724
|
}
|
|
302
|
-
// TODO(palla/prover): This closes the fork only on the happy path. If this epoch orchestrator
|
|
303
|
-
// is aborted and never reaches this point, it will leak the fork. We need to add a global cleanup,
|
|
304
|
-
// but have to make sure it only runs once all operations are completed, otherwise some function here
|
|
305
|
-
// will attempt to access the fork after it was closed.
|
|
306
|
-
logger.debug(`Cleaning up world state fork for ${blockNumber}`);
|
|
307
|
-
void this.dbs.get(blockNumber)?.close().then(()=>this.dbs.delete(blockNumber)).catch((err)=>logger.error(`Error closing db for block ${blockNumber}`, err));
|
|
308
725
|
}
|
|
309
726
|
/**
|
|
310
|
-
* Cancel any further proving
|
|
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.
|
|
311
730
|
*/ cancel() {
|
|
312
|
-
|
|
313
|
-
controller.abort();
|
|
314
|
-
}
|
|
731
|
+
this.resetSchedulerState(this.cancelJobsOnStop);
|
|
315
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;
|
|
316
744
|
}
|
|
317
745
|
/**
|
|
318
746
|
* Returns the proof for the current epoch.
|
|
@@ -332,61 +760,11 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
332
760
|
});
|
|
333
761
|
return epochProofResult;
|
|
334
762
|
}
|
|
335
|
-
/**
|
|
336
|
-
* Enqueue a job to be scheduled
|
|
337
|
-
* @param provingState - The proving state object being operated on
|
|
338
|
-
* @param jobType - The type of job to be queued
|
|
339
|
-
* @param job - The actual job, returns a promise notifying of the job's completion
|
|
340
|
-
*/ deferredProving(provingState, request, callback) {
|
|
341
|
-
if (!provingState.verifyState()) {
|
|
342
|
-
logger.debug(`Not enqueuing job, state no longer valid`);
|
|
343
|
-
return;
|
|
344
|
-
}
|
|
345
|
-
const controller = new AbortController();
|
|
346
|
-
this.pendingProvingJobs.push(controller);
|
|
347
|
-
// We use a 'safeJob'. We don't want promise rejections in the proving pool, we want to capture the error here
|
|
348
|
-
// and reject the proving job whilst keeping the event loop free of rejections
|
|
349
|
-
const safeJob = async ()=>{
|
|
350
|
-
try {
|
|
351
|
-
// there's a delay between enqueueing this job and it actually running
|
|
352
|
-
if (controller.signal.aborted) {
|
|
353
|
-
return;
|
|
354
|
-
}
|
|
355
|
-
const result = await request(controller.signal);
|
|
356
|
-
if (!provingState.verifyState()) {
|
|
357
|
-
logger.debug(`State no longer valid, discarding result`);
|
|
358
|
-
return;
|
|
359
|
-
}
|
|
360
|
-
// we could have been cancelled whilst waiting for the result
|
|
361
|
-
// and the prover ignored the signal. Drop the result in that case
|
|
362
|
-
if (controller.signal.aborted) {
|
|
363
|
-
return;
|
|
364
|
-
}
|
|
365
|
-
await callback(result);
|
|
366
|
-
} catch (err) {
|
|
367
|
-
if (err instanceof AbortError) {
|
|
368
|
-
// operation was cancelled, probably because the block was cancelled
|
|
369
|
-
// drop this result
|
|
370
|
-
return;
|
|
371
|
-
}
|
|
372
|
-
logger.error(`Error thrown when proving job`, err);
|
|
373
|
-
provingState.reject(`${err}`);
|
|
374
|
-
} finally{
|
|
375
|
-
const index = this.pendingProvingJobs.indexOf(controller);
|
|
376
|
-
if (index > -1) {
|
|
377
|
-
this.pendingProvingJobs.splice(index, 1);
|
|
378
|
-
}
|
|
379
|
-
}
|
|
380
|
-
};
|
|
381
|
-
// let the callstack unwind before adding the job to the queue
|
|
382
|
-
setImmediate(()=>void safeJob());
|
|
383
|
-
}
|
|
384
763
|
async updateL1ToL2MessageTree(l1ToL2Messages, db) {
|
|
385
|
-
const l1ToL2MessagesPadded = padArrayEnd(l1ToL2Messages, Fr.ZERO, NUMBER_OF_L1_L2_MESSAGES_PER_ROLLUP, 'Too many L1 to L2 messages');
|
|
386
764
|
const lastL1ToL2MessageTreeSnapshot = await getTreeSnapshot(MerkleTreeId.L1_TO_L2_MESSAGE_TREE, db);
|
|
387
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);
|
|
388
766
|
// Update the local trees to include the new l1 to l2 messages
|
|
389
|
-
await db
|
|
767
|
+
await appendL1ToL2MessagesToTree(db, l1ToL2Messages);
|
|
390
768
|
const newL1ToL2MessageTreeSnapshot = await getTreeSnapshot(MerkleTreeId.L1_TO_L2_MESSAGE_TREE, db);
|
|
391
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);
|
|
392
770
|
return {
|
|
@@ -425,17 +803,17 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
425
803
|
// Executes the next level of merge if all inputs are available
|
|
426
804
|
enqueueBaseRollup(provingState, txIndex) {
|
|
427
805
|
if (!provingState.verifyState()) {
|
|
428
|
-
logger.debug('Not running base rollup, state invalid');
|
|
806
|
+
this.logger.debug('Not running base rollup, state invalid');
|
|
429
807
|
return;
|
|
430
808
|
}
|
|
431
809
|
if (!provingState.tryStartProvingBase(txIndex)) {
|
|
432
|
-
logger.debug(`Base rollup for tx ${txIndex} already started.`);
|
|
810
|
+
this.logger.debug(`Base rollup for tx ${txIndex} already started.`);
|
|
433
811
|
return;
|
|
434
812
|
}
|
|
435
813
|
const txProvingState = provingState.getTxProvingState(txIndex);
|
|
436
814
|
const { processedTx } = txProvingState;
|
|
437
815
|
const { rollupType, inputs } = txProvingState.getBaseRollupTypeAndInputs();
|
|
438
|
-
logger.debug(`Enqueuing deferred proving base rollup for ${processedTx.hash.toString()}`);
|
|
816
|
+
this.logger.debug(`Enqueuing deferred proving base rollup for ${processedTx.hash.toString()}`);
|
|
439
817
|
this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, `ProvingOrchestrator.prover.${inputs instanceof PrivateTxBaseRollupPrivateInputs ? 'getPrivateTxBaseRollupProof' : 'getPublicTxBaseRollupProof'}`, {
|
|
440
818
|
[Attributes.TX_HASH]: processedTx.hash.toString(),
|
|
441
819
|
[Attributes.PROTOCOL_CIRCUIT_NAME]: rollupType
|
|
@@ -446,7 +824,7 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
446
824
|
return this.prover.getPublicTxBaseRollupProof(inputs, signal, provingState.epochNumber);
|
|
447
825
|
}
|
|
448
826
|
}), (result)=>{
|
|
449
|
-
logger.debug(`Completed proof for ${rollupType} for tx ${processedTx.hash.toString()}`);
|
|
827
|
+
this.logger.debug(`Completed proof for ${rollupType} for tx ${processedTx.hash.toString()}`);
|
|
450
828
|
validatePartialState(result.inputs.endTreeSnapshots, txProvingState.treeSnapshots);
|
|
451
829
|
const leafLocation = provingState.setBaseRollupProof(txIndex, result);
|
|
452
830
|
if (provingState.totalNumTxs === 1) {
|
|
@@ -460,14 +838,13 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
460
838
|
// Once completed, will enqueue the the public tx base rollup.
|
|
461
839
|
getOrEnqueueChonkVerifier(provingState, txIndex) {
|
|
462
840
|
if (!provingState.verifyState()) {
|
|
463
|
-
logger.debug('Not running chonk verifier circuit, state invalid');
|
|
841
|
+
this.logger.debug('Not running chonk verifier circuit, state invalid');
|
|
464
842
|
return;
|
|
465
843
|
}
|
|
466
844
|
const txProvingState = provingState.getTxProvingState(txIndex);
|
|
467
845
|
const txHash = txProvingState.processedTx.hash.toString();
|
|
468
|
-
NESTED_RECURSIVE_ROLLUP_HONK_PROOF_LENGTH;
|
|
469
846
|
const handleResult = (result)=>{
|
|
470
|
-
logger.debug(`Got chonk verifier proof for tx index: ${txIndex}`, {
|
|
847
|
+
this.logger.debug(`Got chonk verifier proof for tx index: ${txIndex}`, {
|
|
471
848
|
txHash
|
|
472
849
|
});
|
|
473
850
|
txProvingState.setPublicChonkVerifierProof(result);
|
|
@@ -475,18 +852,18 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
475
852
|
this.checkAndEnqueueBaseRollup(provingState, txIndex);
|
|
476
853
|
};
|
|
477
854
|
if (this.provingState?.cachedChonkVerifierProofs.has(txHash)) {
|
|
478
|
-
logger.debug(`Chonk verifier proof already enqueued for tx index: ${txIndex}`, {
|
|
855
|
+
this.logger.debug(`Chonk verifier proof already enqueued for tx index: ${txIndex}`, {
|
|
479
856
|
txHash
|
|
480
857
|
});
|
|
481
858
|
void this.provingState.cachedChonkVerifierProofs.get(txHash).then(handleResult);
|
|
482
859
|
return;
|
|
483
860
|
}
|
|
484
|
-
logger.debug(`Enqueuing chonk verifier circuit for tx index: ${txIndex}`);
|
|
861
|
+
this.logger.debug(`Enqueuing chonk verifier circuit for tx index: ${txIndex}`);
|
|
485
862
|
this.doEnqueueChonkVerifier(txHash, txProvingState.getPublicChonkVerifierPrivateInputs(), handleResult);
|
|
486
863
|
}
|
|
487
864
|
doEnqueueChonkVerifier(txHash, inputs, handler, provingState = this.provingState) {
|
|
488
865
|
if (!provingState.verifyState()) {
|
|
489
|
-
logger.debug('Not running chonk verifier circuit, state invalid');
|
|
866
|
+
this.logger.debug('Not running chonk verifier circuit, state invalid');
|
|
490
867
|
return;
|
|
491
868
|
}
|
|
492
869
|
this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getPublicChonkVerifierProof', {
|
|
@@ -498,11 +875,11 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
498
875
|
// Enqueues the next level of merge if all inputs are available
|
|
499
876
|
enqueueMergeRollup(provingState, location) {
|
|
500
877
|
if (!provingState.verifyState()) {
|
|
501
|
-
logger.debug('Not running merge rollup. State no longer valid.');
|
|
878
|
+
this.logger.debug('Not running merge rollup. State no longer valid.');
|
|
502
879
|
return;
|
|
503
880
|
}
|
|
504
881
|
if (!provingState.tryStartProvingMerge(location)) {
|
|
505
|
-
logger.debug('Merge rollup already started.');
|
|
882
|
+
this.logger.debug('Merge rollup already started.');
|
|
506
883
|
return;
|
|
507
884
|
}
|
|
508
885
|
const inputs = provingState.getMergeRollupInputs(location);
|
|
@@ -516,15 +893,15 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
516
893
|
// Executes the block root rollup circuit
|
|
517
894
|
enqueueBlockRootRollup(provingState) {
|
|
518
895
|
if (!provingState.verifyState()) {
|
|
519
|
-
logger.debug('Not running block root rollup, state no longer valid');
|
|
896
|
+
this.logger.debug('Not running block root rollup, state no longer valid');
|
|
520
897
|
return;
|
|
521
898
|
}
|
|
522
899
|
if (!provingState.tryStartProvingBlockRoot()) {
|
|
523
|
-
logger.debug('Block root rollup already started.');
|
|
900
|
+
this.logger.debug('Block root rollup already started.');
|
|
524
901
|
return;
|
|
525
902
|
}
|
|
526
903
|
const { rollupType, inputs } = provingState.getBlockRootRollupTypeAndInputs();
|
|
527
|
-
logger.debug(`Enqueuing ${rollupType} for block ${provingState.blockNumber}.`);
|
|
904
|
+
this.logger.debug(`Enqueuing ${rollupType} for block ${provingState.blockNumber}.`);
|
|
528
905
|
this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getBlockRootRollupProof', {
|
|
529
906
|
[Attributes.PROTOCOL_CIRCUIT_NAME]: rollupType
|
|
530
907
|
}, (signal)=>{
|
|
@@ -540,15 +917,20 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
540
917
|
return this.prover.getBlockRootRollupProof(inputs, signal, provingState.epochNumber);
|
|
541
918
|
}
|
|
542
919
|
}), async (result)=>{
|
|
543
|
-
|
|
544
|
-
|
|
545
|
-
|
|
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
|
+
});
|
|
546
925
|
const leafLocation = provingState.setBlockRootRollupProof(result);
|
|
547
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);
|
|
548
930
|
if (checkpointProvingState.totalNumBlocks === 1) {
|
|
549
|
-
this.checkAndEnqueueCheckpointRootRollup(checkpointProvingState);
|
|
931
|
+
await this.checkAndEnqueueCheckpointRootRollup(checkpointProvingState);
|
|
550
932
|
} else {
|
|
551
|
-
this.checkAndEnqueueNextBlockMergeRollup(checkpointProvingState, leafLocation);
|
|
933
|
+
await this.checkAndEnqueueNextBlockMergeRollup(checkpointProvingState, leafLocation);
|
|
552
934
|
}
|
|
553
935
|
});
|
|
554
936
|
}
|
|
@@ -556,11 +938,11 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
556
938
|
// Enqueues the root parity circuit if all inputs are available
|
|
557
939
|
enqueueBaseParityCircuit(checkpointProvingState, provingState, baseParityIndex) {
|
|
558
940
|
if (!provingState.verifyState()) {
|
|
559
|
-
logger.debug('Not running base parity. State no longer valid.');
|
|
941
|
+
this.logger.debug('Not running base parity. State no longer valid.');
|
|
560
942
|
return;
|
|
561
943
|
}
|
|
562
944
|
if (!provingState.tryStartProvingBaseParity(baseParityIndex)) {
|
|
563
|
-
logger.warn(`Base parity ${baseParityIndex} already started.`);
|
|
945
|
+
this.logger.warn(`Base parity ${baseParityIndex} already started.`);
|
|
564
946
|
return;
|
|
565
947
|
}
|
|
566
948
|
const inputs = checkpointProvingState.getBaseParityInputs(baseParityIndex);
|
|
@@ -581,11 +963,11 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
581
963
|
// Enqueues the root rollup proof if all inputs are available
|
|
582
964
|
enqueueRootParityCircuit(provingState) {
|
|
583
965
|
if (!provingState.verifyState()) {
|
|
584
|
-
logger.debug('Not running root parity. State no longer valid.');
|
|
966
|
+
this.logger.debug('Not running root parity. State no longer valid.');
|
|
585
967
|
return;
|
|
586
968
|
}
|
|
587
969
|
if (!provingState.tryStartProvingRootParity()) {
|
|
588
|
-
logger.debug('Root parity already started.');
|
|
970
|
+
this.logger.debug('Root parity already started.');
|
|
589
971
|
return;
|
|
590
972
|
}
|
|
591
973
|
const inputs = provingState.getParityRootInputs();
|
|
@@ -600,33 +982,38 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
600
982
|
// Enqueues the next level of merge if all inputs are available
|
|
601
983
|
enqueueBlockMergeRollup(provingState, location) {
|
|
602
984
|
if (!provingState.verifyState()) {
|
|
603
|
-
logger.debug('Not running block merge rollup. State no longer valid.');
|
|
985
|
+
this.logger.debug('Not running block merge rollup. State no longer valid.');
|
|
604
986
|
return;
|
|
605
987
|
}
|
|
606
988
|
if (!provingState.tryStartProvingBlockMerge(location)) {
|
|
607
|
-
logger.debug('Block merge rollup already started.');
|
|
989
|
+
this.logger.debug('Block merge rollup already started.');
|
|
608
990
|
return;
|
|
609
991
|
}
|
|
610
992
|
const inputs = provingState.getBlockMergeRollupInputs(location);
|
|
611
993
|
this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getBlockMergeRollupProof', {
|
|
612
994
|
[Attributes.PROTOCOL_CIRCUIT_NAME]: 'rollup-block-merge'
|
|
613
|
-
}, (signal)=>this.prover.getBlockMergeRollupProof(inputs, signal, provingState.epochNumber)), (result)=>{
|
|
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
|
+
});
|
|
614
1001
|
provingState.setBlockMergeRollupProof(location, result);
|
|
615
|
-
this.checkAndEnqueueNextBlockMergeRollup(provingState, location);
|
|
1002
|
+
await this.checkAndEnqueueNextBlockMergeRollup(provingState, location);
|
|
616
1003
|
});
|
|
617
1004
|
}
|
|
618
|
-
enqueueCheckpointRootRollup(provingState) {
|
|
1005
|
+
async enqueueCheckpointRootRollup(provingState) {
|
|
619
1006
|
if (!provingState.verifyState()) {
|
|
620
|
-
logger.debug('Not running checkpoint root rollup. State no longer valid.');
|
|
1007
|
+
this.logger.debug('Not running checkpoint root rollup. State no longer valid.');
|
|
621
1008
|
return;
|
|
622
1009
|
}
|
|
623
1010
|
if (!provingState.tryStartProvingCheckpointRoot()) {
|
|
624
|
-
logger.debug('Checkpoint root rollup already started.');
|
|
1011
|
+
this.logger.debug('Checkpoint root rollup already started.');
|
|
625
1012
|
return;
|
|
626
1013
|
}
|
|
627
1014
|
const rollupType = provingState.getCheckpointRootRollupType();
|
|
628
|
-
logger.debug(`Enqueuing ${rollupType} for checkpoint ${provingState.index}.`);
|
|
629
|
-
const inputs = provingState.getCheckpointRootRollupInputs();
|
|
1015
|
+
this.logger.debug(`Enqueuing ${rollupType} for checkpoint ${provingState.index}.`);
|
|
1016
|
+
const inputs = await provingState.getCheckpointRootRollupInputs();
|
|
630
1017
|
this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getCheckpointRootRollupProof', {
|
|
631
1018
|
[Attributes.PROTOCOL_CIRCUIT_NAME]: rollupType
|
|
632
1019
|
}, (signal)=>{
|
|
@@ -639,11 +1026,14 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
639
1026
|
const computedEndBlobAccumulatorState = provingState.getEndBlobAccumulator().toBlobAccumulator();
|
|
640
1027
|
const circuitEndBlobAccumulatorState = result.inputs.endBlobAccumulator;
|
|
641
1028
|
if (!circuitEndBlobAccumulatorState.equals(computedEndBlobAccumulatorState)) {
|
|
642
|
-
logger.error(`Blob accumulator state mismatch.\nCircuit: ${inspect(circuitEndBlobAccumulatorState)}\nComputed: ${inspect(computedEndBlobAccumulatorState)}`);
|
|
1029
|
+
this.logger.error(`Blob accumulator state mismatch.\nCircuit: ${inspect(circuitEndBlobAccumulatorState)}\nComputed: ${inspect(computedEndBlobAccumulatorState)}`);
|
|
643
1030
|
provingState.reject(`Blob accumulator state mismatch.`);
|
|
644
1031
|
return;
|
|
645
1032
|
}
|
|
646
|
-
logger.debug(`Completed ${rollupType} proof for checkpoint ${provingState.index}
|
|
1033
|
+
this.logger.debug(`Completed ${rollupType} proof for checkpoint ${provingState.index}`, {
|
|
1034
|
+
checkpointIndex: provingState.index,
|
|
1035
|
+
...result.inputs.toInspect()
|
|
1036
|
+
});
|
|
647
1037
|
const leafLocation = provingState.setCheckpointRootRollupProof(result);
|
|
648
1038
|
const epochProvingState = provingState.parentEpoch;
|
|
649
1039
|
if (epochProvingState.totalNumCheckpoints === 1) {
|
|
@@ -653,61 +1043,6 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
653
1043
|
}
|
|
654
1044
|
});
|
|
655
1045
|
}
|
|
656
|
-
enqueueCheckpointMergeRollup(provingState, location) {
|
|
657
|
-
if (!provingState.verifyState()) {
|
|
658
|
-
logger.debug('Not running checkpoint merge rollup. State no longer valid.');
|
|
659
|
-
return;
|
|
660
|
-
}
|
|
661
|
-
if (!provingState.tryStartProvingCheckpointMerge(location)) {
|
|
662
|
-
logger.debug('Checkpoint merge rollup already started.');
|
|
663
|
-
return;
|
|
664
|
-
}
|
|
665
|
-
const inputs = provingState.getCheckpointMergeRollupInputs(location);
|
|
666
|
-
this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getCheckpointMergeRollupProof', {
|
|
667
|
-
[Attributes.PROTOCOL_CIRCUIT_NAME]: 'rollup-checkpoint-merge'
|
|
668
|
-
}, (signal)=>this.prover.getCheckpointMergeRollupProof(inputs, signal, provingState.epochNumber)), (result)=>{
|
|
669
|
-
logger.debug('Completed proof for checkpoint merge rollup.');
|
|
670
|
-
provingState.setCheckpointMergeRollupProof(location, result);
|
|
671
|
-
this.checkAndEnqueueNextCheckpointMergeRollup(provingState, location);
|
|
672
|
-
});
|
|
673
|
-
}
|
|
674
|
-
enqueueEpochPadding(provingState) {
|
|
675
|
-
if (!provingState.verifyState()) {
|
|
676
|
-
logger.debug('Not running epoch padding. State no longer valid.');
|
|
677
|
-
return;
|
|
678
|
-
}
|
|
679
|
-
if (!provingState.tryStartProvingPaddingCheckpoint()) {
|
|
680
|
-
logger.debug('Padding checkpoint already started.');
|
|
681
|
-
return;
|
|
682
|
-
}
|
|
683
|
-
logger.debug('Padding epoch proof with a padding block root proof.');
|
|
684
|
-
const inputs = provingState.getPaddingCheckpointInputs();
|
|
685
|
-
this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getCheckpointPaddingRollupProof', {
|
|
686
|
-
[Attributes.PROTOCOL_CIRCUIT_NAME]: 'rollup-checkpoint-padding'
|
|
687
|
-
}, (signal)=>this.prover.getCheckpointPaddingRollupProof(inputs, signal, provingState.epochNumber)), (result)=>{
|
|
688
|
-
logger.debug('Completed proof for padding checkpoint.');
|
|
689
|
-
provingState.setCheckpointPaddingProof(result);
|
|
690
|
-
this.checkAndEnqueueRootRollup(provingState);
|
|
691
|
-
});
|
|
692
|
-
}
|
|
693
|
-
// Executes the root rollup circuit
|
|
694
|
-
enqueueRootRollup(provingState) {
|
|
695
|
-
if (!provingState.verifyState()) {
|
|
696
|
-
logger.debug('Not running root rollup, state no longer valid');
|
|
697
|
-
return;
|
|
698
|
-
}
|
|
699
|
-
logger.debug(`Preparing root rollup`);
|
|
700
|
-
const inputs = provingState.getRootRollupInputs();
|
|
701
|
-
this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getRootRollupProof', {
|
|
702
|
-
[Attributes.PROTOCOL_CIRCUIT_NAME]: 'rollup-root'
|
|
703
|
-
}, (signal)=>this.prover.getRootRollupProof(inputs, signal, provingState.epochNumber)), (result)=>{
|
|
704
|
-
logger.verbose(`Orchestrator completed root rollup for epoch ${provingState.epochNumber}`);
|
|
705
|
-
provingState.setRootRollupProof(result);
|
|
706
|
-
provingState.resolve({
|
|
707
|
-
status: 'success'
|
|
708
|
-
});
|
|
709
|
-
});
|
|
710
|
-
}
|
|
711
1046
|
checkAndEnqueueNextMergeRollup(provingState, currentLocation) {
|
|
712
1047
|
if (!provingState.isReadyForMergeRollup(currentLocation)) {
|
|
713
1048
|
return;
|
|
@@ -721,45 +1056,27 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
721
1056
|
}
|
|
722
1057
|
checkAndEnqueueBlockRootRollup(provingState) {
|
|
723
1058
|
if (!provingState.isReadyForBlockRootRollup()) {
|
|
724
|
-
logger.debug('Not ready for block root rollup');
|
|
1059
|
+
this.logger.debug('Not ready for block root rollup');
|
|
725
1060
|
return;
|
|
726
1061
|
}
|
|
727
1062
|
this.enqueueBlockRootRollup(provingState);
|
|
728
1063
|
}
|
|
729
|
-
checkAndEnqueueNextBlockMergeRollup(provingState, currentLocation) {
|
|
1064
|
+
async checkAndEnqueueNextBlockMergeRollup(provingState, currentLocation) {
|
|
730
1065
|
if (!provingState.isReadyForBlockMerge(currentLocation)) {
|
|
731
1066
|
return;
|
|
732
1067
|
}
|
|
733
1068
|
const parentLocation = provingState.getParentLocation(currentLocation);
|
|
734
1069
|
if (parentLocation.level === 0) {
|
|
735
|
-
this.checkAndEnqueueCheckpointRootRollup(provingState);
|
|
1070
|
+
await this.checkAndEnqueueCheckpointRootRollup(provingState);
|
|
736
1071
|
} else {
|
|
737
1072
|
this.enqueueBlockMergeRollup(provingState, parentLocation);
|
|
738
1073
|
}
|
|
739
1074
|
}
|
|
740
|
-
checkAndEnqueueCheckpointRootRollup(provingState) {
|
|
1075
|
+
async checkAndEnqueueCheckpointRootRollup(provingState) {
|
|
741
1076
|
if (!provingState.isReadyForCheckpointRoot()) {
|
|
742
1077
|
return;
|
|
743
1078
|
}
|
|
744
|
-
this.enqueueCheckpointRootRollup(provingState);
|
|
745
|
-
}
|
|
746
|
-
checkAndEnqueueNextCheckpointMergeRollup(provingState, currentLocation) {
|
|
747
|
-
if (!provingState.isReadyForCheckpointMerge(currentLocation)) {
|
|
748
|
-
return;
|
|
749
|
-
}
|
|
750
|
-
const parentLocation = provingState.getParentLocation(currentLocation);
|
|
751
|
-
if (parentLocation.level === 0) {
|
|
752
|
-
this.checkAndEnqueueRootRollup(provingState);
|
|
753
|
-
} else {
|
|
754
|
-
this.enqueueCheckpointMergeRollup(provingState, parentLocation);
|
|
755
|
-
}
|
|
756
|
-
}
|
|
757
|
-
checkAndEnqueueRootRollup(provingState) {
|
|
758
|
-
if (!provingState.isReadyForRootRollup()) {
|
|
759
|
-
logger.debug('Not ready for root rollup');
|
|
760
|
-
return;
|
|
761
|
-
}
|
|
762
|
-
this.enqueueRootRollup(provingState);
|
|
1079
|
+
await this.enqueueCheckpointRootRollup(provingState);
|
|
763
1080
|
}
|
|
764
1081
|
/**
|
|
765
1082
|
* Executes the VM circuit for a public function, will enqueue the corresponding kernel if the
|
|
@@ -768,7 +1085,7 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
768
1085
|
* @param txIndex - The index of the transaction being proven
|
|
769
1086
|
*/ enqueueVM(provingState, txIndex) {
|
|
770
1087
|
if (!provingState.verifyState()) {
|
|
771
|
-
logger.debug(`Not running VM circuit as state is no longer valid`);
|
|
1088
|
+
this.logger.debug(`Not running VM circuit as state is no longer valid`);
|
|
772
1089
|
return;
|
|
773
1090
|
}
|
|
774
1091
|
const txProvingState = provingState.getTxProvingState(txIndex);
|
|
@@ -778,9 +1095,9 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
778
1095
|
const inputs = txProvingState.getAvmInputs();
|
|
779
1096
|
return await this.prover.getAvmProof(inputs, signal, provingState.epochNumber);
|
|
780
1097
|
});
|
|
781
|
-
this.deferredProving(provingState, doAvmProving, (
|
|
782
|
-
logger.debug(`Proven VM for tx index: ${txIndex}`);
|
|
783
|
-
txProvingState.setAvmProof(
|
|
1098
|
+
this.deferredProving(provingState, doAvmProving, (proof)=>{
|
|
1099
|
+
this.logger.debug(`Proven VM for tx index: ${txIndex}`);
|
|
1100
|
+
txProvingState.setAvmProof(proof);
|
|
784
1101
|
this.checkAndEnqueueBaseRollup(provingState, txIndex);
|
|
785
1102
|
});
|
|
786
1103
|
}
|
|
@@ -790,30 +1107,7 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
790
1107
|
return;
|
|
791
1108
|
}
|
|
792
1109
|
// We must have completed all proving (chonk verifier proof and (if required) vm proof are generated), we now move to the base rollup.
|
|
793
|
-
logger.debug(`Public functions completed for tx ${txIndex} enqueueing base rollup`);
|
|
1110
|
+
this.logger.debug(`Public functions completed for tx ${txIndex} enqueueing base rollup`);
|
|
794
1111
|
this.enqueueBaseRollup(provingState, txIndex);
|
|
795
1112
|
}
|
|
796
1113
|
}
|
|
797
|
-
_ts_decorate([
|
|
798
|
-
trackSpan('ProvingOrchestrator.startNewBlock', (blockNumber)=>({
|
|
799
|
-
[Attributes.BLOCK_NUMBER]: blockNumber
|
|
800
|
-
}))
|
|
801
|
-
], ProvingOrchestrator.prototype, "startNewBlock", null);
|
|
802
|
-
_ts_decorate([
|
|
803
|
-
trackSpan('ProvingOrchestrator.addTxs', (txs)=>({
|
|
804
|
-
[Attributes.BLOCK_TXS_COUNT]: txs.length
|
|
805
|
-
}))
|
|
806
|
-
], ProvingOrchestrator.prototype, "addTxs", null);
|
|
807
|
-
_ts_decorate([
|
|
808
|
-
trackSpan('ProvingOrchestrator.startChonkVerifierCircuits')
|
|
809
|
-
], ProvingOrchestrator.prototype, "startChonkVerifierCircuits", null);
|
|
810
|
-
_ts_decorate([
|
|
811
|
-
trackSpan('ProvingOrchestrator.setBlockCompleted', (blockNumber)=>({
|
|
812
|
-
[Attributes.BLOCK_NUMBER]: blockNumber
|
|
813
|
-
}))
|
|
814
|
-
], ProvingOrchestrator.prototype, "setBlockCompleted", null);
|
|
815
|
-
_ts_decorate([
|
|
816
|
-
trackSpan('ProvingOrchestrator.prepareBaseRollupInputs', (tx)=>({
|
|
817
|
-
[Attributes.TX_HASH]: tx.hash.toString()
|
|
818
|
-
}))
|
|
819
|
-
], ProvingOrchestrator.prototype, "prepareBaseRollupInputs", null);
|