@aztec/prover-client 0.0.1-fake-ceab37513c → 0.0.6-commit.a2d1860fe9
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 +2 -2
- package/dest/config.d.ts.map +1 -1
- package/dest/config.js +2 -2
- package/dest/index.d.ts +1 -1
- package/dest/light/index.d.ts +2 -0
- package/dest/light/index.d.ts.map +1 -0
- package/dest/light/index.js +1 -0
- package/dest/light/lightweight_checkpoint_builder.d.ts +48 -0
- package/dest/light/lightweight_checkpoint_builder.d.ts.map +1 -0
- package/dest/light/lightweight_checkpoint_builder.js +202 -0
- package/dest/mocks/fixtures.d.ts +5 -5
- package/dest/mocks/fixtures.d.ts.map +1 -1
- package/dest/mocks/fixtures.js +35 -16
- package/dest/mocks/test_context.d.ts +39 -33
- package/dest/mocks/test_context.d.ts.map +1 -1
- package/dest/mocks/test_context.js +141 -82
- package/dest/orchestrator/block-building-helpers.d.ts +34 -34
- package/dest/orchestrator/block-building-helpers.d.ts.map +1 -1
- package/dest/orchestrator/block-building-helpers.js +151 -187
- package/dest/orchestrator/block-proving-state.d.ts +71 -55
- package/dest/orchestrator/block-proving-state.d.ts.map +1 -1
- package/dest/orchestrator/block-proving-state.js +280 -185
- package/dest/orchestrator/checkpoint-proving-state.d.ts +76 -0
- package/dest/orchestrator/checkpoint-proving-state.d.ts.map +1 -0
- package/dest/orchestrator/checkpoint-proving-state.js +243 -0
- package/dest/orchestrator/epoch-proving-state.d.ts +40 -32
- package/dest/orchestrator/epoch-proving-state.d.ts.map +1 -1
- package/dest/orchestrator/epoch-proving-state.js +165 -85
- package/dest/orchestrator/index.d.ts +1 -1
- package/dest/orchestrator/orchestrator.d.ts +51 -35
- package/dest/orchestrator/orchestrator.d.ts.map +1 -1
- package/dest/orchestrator/orchestrator.js +847 -329
- package/dest/orchestrator/orchestrator_metrics.d.ts +1 -3
- package/dest/orchestrator/orchestrator_metrics.d.ts.map +1 -1
- package/dest/orchestrator/orchestrator_metrics.js +2 -15
- package/dest/orchestrator/tx-proving-state.d.ts +15 -12
- package/dest/orchestrator/tx-proving-state.d.ts.map +1 -1
- package/dest/orchestrator/tx-proving-state.js +27 -33
- package/dest/prover-client/factory.d.ts +3 -3
- package/dest/prover-client/factory.d.ts.map +1 -1
- package/dest/prover-client/index.d.ts +1 -1
- package/dest/prover-client/prover-client.d.ts +5 -5
- package/dest/prover-client/prover-client.d.ts.map +1 -1
- package/dest/prover-client/prover-client.js +15 -10
- package/dest/prover-client/server-epoch-prover.d.ts +13 -11
- package/dest/prover-client/server-epoch-prover.d.ts.map +1 -1
- package/dest/prover-client/server-epoch-prover.js +9 -9
- package/dest/proving_broker/broker_prover_facade.d.ts +28 -21
- package/dest/proving_broker/broker_prover_facade.d.ts.map +1 -1
- package/dest/proving_broker/broker_prover_facade.js +45 -36
- package/dest/proving_broker/config.d.ts +24 -8
- package/dest/proving_broker/config.d.ts.map +1 -1
- package/dest/proving_broker/config.js +26 -3
- package/dest/proving_broker/factory.d.ts +1 -1
- package/dest/proving_broker/fixtures.d.ts +3 -2
- package/dest/proving_broker/fixtures.d.ts.map +1 -1
- package/dest/proving_broker/fixtures.js +3 -2
- package/dest/proving_broker/index.d.ts +1 -1
- 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 -1
- package/dest/proving_broker/proof_store/index.d.ts.map +1 -1
- package/dest/proving_broker/proof_store/index.js +1 -0
- package/dest/proving_broker/proof_store/inline_proof_store.d.ts +1 -1
- package/dest/proving_broker/proof_store/inline_proof_store.d.ts.map +1 -1
- package/dest/proving_broker/proof_store/proof_store.d.ts +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 +7 -4
- package/dest/proving_broker/proving_broker.d.ts.map +1 -1
- package/dest/proving_broker/proving_broker.js +64 -30
- package/dest/proving_broker/proving_broker_database/memory.d.ts +3 -2
- package/dest/proving_broker/proving_broker_database/memory.d.ts.map +1 -1
- package/dest/proving_broker/proving_broker_database/persisted.d.ts +5 -3
- package/dest/proving_broker/proving_broker_database/persisted.d.ts.map +1 -1
- package/dest/proving_broker/proving_broker_database/persisted.js +392 -3
- package/dest/proving_broker/proving_broker_database.d.ts +3 -2
- package/dest/proving_broker/proving_broker_database.d.ts.map +1 -1
- package/dest/proving_broker/proving_broker_instrumentation.d.ts +1 -1
- package/dest/proving_broker/proving_broker_instrumentation.d.ts.map +1 -1
- package/dest/proving_broker/proving_broker_instrumentation.js +15 -35
- package/dest/proving_broker/proving_job_controller.d.ts +5 -3
- package/dest/proving_broker/proving_job_controller.d.ts.map +1 -1
- package/dest/proving_broker/proving_job_controller.js +46 -24
- package/dest/proving_broker/rpc.d.ts +7 -5
- package/dest/proving_broker/rpc.d.ts.map +1 -1
- package/dest/proving_broker/rpc.js +8 -0
- package/dest/test/mock_proof_store.d.ts +1 -1
- package/dest/test/mock_proof_store.d.ts.map +1 -1
- package/dest/test/mock_prover.d.ts +23 -19
- package/dest/test/mock_prover.d.ts.map +1 -1
- package/dest/test/mock_prover.js +38 -23
- package/package.json +21 -20
- package/src/config.ts +2 -2
- package/src/light/index.ts +1 -0
- package/src/light/lightweight_checkpoint_builder.ts +294 -0
- package/src/mocks/fixtures.ts +43 -37
- package/src/mocks/test_context.ts +201 -114
- package/src/orchestrator/block-building-helpers.ts +233 -313
- package/src/orchestrator/block-proving-state.ts +324 -247
- package/src/orchestrator/checkpoint-proving-state.ts +349 -0
- package/src/orchestrator/epoch-proving-state.ts +229 -132
- package/src/orchestrator/orchestrator.ts +630 -385
- package/src/orchestrator/orchestrator_metrics.ts +2 -25
- package/src/orchestrator/tx-proving-state.ts +49 -60
- package/src/prover-client/factory.ts +6 -2
- package/src/prover-client/prover-client.ts +31 -23
- package/src/prover-client/server-epoch-prover.ts +30 -21
- package/src/proving_broker/broker_prover_facade.ts +183 -118
- package/src/proving_broker/config.ts +30 -1
- package/src/proving_broker/fixtures.ts +8 -3
- 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 -0
- package/src/proving_broker/proving_agent.ts +6 -19
- package/src/proving_broker/proving_broker.ts +72 -28
- package/src/proving_broker/proving_broker_database/memory.ts +2 -1
- package/src/proving_broker/proving_broker_database/persisted.ts +20 -5
- package/src/proving_broker/proving_broker_database.ts +2 -1
- package/src/proving_broker/proving_broker_instrumentation.ts +14 -35
- package/src/proving_broker/proving_job_controller.ts +51 -25
- package/src/proving_broker/rpc.ts +14 -0
- package/src/test/mock_prover.ts +144 -74
- package/dest/bin/get-proof-inputs.d.ts +0 -2
- package/dest/bin/get-proof-inputs.d.ts.map +0 -1
- package/dest/bin/get-proof-inputs.js +0 -51
- 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 -36
- package/dest/block-factory/light.d.ts.map +0 -1
- package/dest/block-factory/light.js +0 -87
- 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/bin/get-proof-inputs.ts +0 -59
- package/src/block-factory/index.ts +0 -1
- package/src/block-factory/light.ts +0 -114
- package/src/proving_broker/proof_store/gcs_proof_store.ts +0 -76
- package/src/proving_broker/proving_agent_instrumentation.ts +0 -21
|
@@ -1,33 +1,403 @@
|
|
|
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
|
+
};
|
|
369
|
+
}
|
|
370
|
+
function _apply_decs_2203_r(targetClass, memberDecs, classDecs, parentClass) {
|
|
371
|
+
return (_apply_decs_2203_r = applyDecs2203RFactory())(targetClass, memberDecs, classDecs, parentClass);
|
|
6
372
|
}
|
|
7
|
-
|
|
8
|
-
import { L1_TO_L2_MSG_SUBTREE_HEIGHT,
|
|
9
|
-
import {
|
|
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, NESTED_RECURSIVE_ROLLUP_HONK_PROOF_LENGTH, NUMBER_OF_L1_L2_MESSAGES_PER_ROLLUP, NUM_BASE_PARITY_PER_ROOT_PARITY } from '@aztec/constants';
|
|
375
|
+
import { BlockNumber } from '@aztec/foundation/branded-types';
|
|
376
|
+
import { padArrayEnd } from '@aztec/foundation/collection';
|
|
377
|
+
import { Fr } from '@aztec/foundation/curves/bn254';
|
|
10
378
|
import { AbortError } from '@aztec/foundation/error';
|
|
11
|
-
import { Fr } from '@aztec/foundation/fields';
|
|
12
379
|
import { createLogger } from '@aztec/foundation/log';
|
|
13
380
|
import { promiseWithResolvers } from '@aztec/foundation/promise';
|
|
14
381
|
import { assertLength } from '@aztec/foundation/serialize';
|
|
15
382
|
import { pushTestData } from '@aztec/foundation/testing';
|
|
16
383
|
import { elapsed } from '@aztec/foundation/timer';
|
|
17
|
-
import {
|
|
18
|
-
import { readAvmMinimalPublicTxInputsFromFile } from '@aztec/simulator/public/fixtures';
|
|
19
|
-
import { L2Block } from '@aztec/stdlib/block';
|
|
20
|
-
import { BaseParityInputs } from '@aztec/stdlib/parity';
|
|
21
|
-
import { EmptyBlockRootRollupInputs, PrivateBaseRollupInputs, SingleTxBlockRootRollupInputs, TubeInputs } from '@aztec/stdlib/rollup';
|
|
384
|
+
import { BlockRootEmptyTxFirstRollupPrivateInputs, BlockRootFirstRollupPrivateInputs, BlockRootSingleTxFirstRollupPrivateInputs, BlockRootSingleTxRollupPrivateInputs, CheckpointRootSingleBlockRollupPrivateInputs, PrivateTxBaseRollupPrivateInputs } from '@aztec/stdlib/rollup';
|
|
22
385
|
import { MerkleTreeId } from '@aztec/stdlib/trees';
|
|
23
|
-
import { toNumBlobFields } from '@aztec/stdlib/tx';
|
|
24
386
|
import { Attributes, getTelemetryClient, trackSpan, wrapCallbackInSpan } from '@aztec/telemetry-client';
|
|
25
387
|
import { inspect } from 'util';
|
|
26
|
-
import {
|
|
388
|
+
import { buildHeaderFromCircuitOutputs, getLastSiblingPath, getPublicChonkVerifierPrivateInputsFromTx, getRootTreeSiblingPath, getSubtreeSiblingPath, getTreeSnapshot, insertSideEffectsAndBuildBaseRollupHints, validatePartialState, validateTx } from './block-building-helpers.js';
|
|
27
389
|
import { EpochProvingState } from './epoch-proving-state.js';
|
|
28
390
|
import { ProvingOrchestratorMetrics } from './orchestrator_metrics.js';
|
|
29
391
|
import { TxProvingState } from './tx-proving-state.js';
|
|
30
|
-
|
|
392
|
+
_dec = trackSpan('ProvingOrchestrator.startNewBlock', (blockNumber)=>({
|
|
393
|
+
[Attributes.BLOCK_NUMBER]: blockNumber
|
|
394
|
+
})), _dec1 = trackSpan('ProvingOrchestrator.addTxs', (txs)=>({
|
|
395
|
+
[Attributes.BLOCK_TXS_COUNT]: txs.length
|
|
396
|
+
})), _dec2 = trackSpan('ProvingOrchestrator.startChonkVerifierCircuits'), _dec3 = trackSpan('ProvingOrchestrator.setBlockCompleted', (blockNumber)=>({
|
|
397
|
+
[Attributes.BLOCK_NUMBER]: blockNumber
|
|
398
|
+
})), _dec4 = trackSpan('ProvingOrchestrator.prepareBaseRollupInputs', (tx)=>({
|
|
399
|
+
[Attributes.TX_HASH]: tx.hash.toString()
|
|
400
|
+
}));
|
|
31
401
|
/**
|
|
32
402
|
* Implements an event driven proving scheduler to build the recursive proof tree. The idea being:
|
|
33
403
|
* 1. Transactions are provided to the scheduler post simulation.
|
|
@@ -43,19 +413,53 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
43
413
|
dbProvider;
|
|
44
414
|
prover;
|
|
45
415
|
proverId;
|
|
416
|
+
cancelJobsOnStop;
|
|
417
|
+
static{
|
|
418
|
+
({ e: [_initProto] } = _apply_decs_2203_r(this, [
|
|
419
|
+
[
|
|
420
|
+
_dec,
|
|
421
|
+
2,
|
|
422
|
+
"startNewBlock"
|
|
423
|
+
],
|
|
424
|
+
[
|
|
425
|
+
_dec1,
|
|
426
|
+
2,
|
|
427
|
+
"addTxs"
|
|
428
|
+
],
|
|
429
|
+
[
|
|
430
|
+
_dec2,
|
|
431
|
+
2,
|
|
432
|
+
"startChonkVerifierCircuits"
|
|
433
|
+
],
|
|
434
|
+
[
|
|
435
|
+
_dec3,
|
|
436
|
+
2,
|
|
437
|
+
"setBlockCompleted"
|
|
438
|
+
],
|
|
439
|
+
[
|
|
440
|
+
_dec4,
|
|
441
|
+
2,
|
|
442
|
+
"prepareBaseRollupInputs"
|
|
443
|
+
]
|
|
444
|
+
], []));
|
|
445
|
+
}
|
|
46
446
|
provingState;
|
|
47
447
|
pendingProvingJobs;
|
|
48
448
|
provingPromise;
|
|
49
449
|
metrics;
|
|
450
|
+
// eslint-disable-next-line aztec-custom/no-non-primitive-in-collections
|
|
50
451
|
dbs;
|
|
51
|
-
|
|
452
|
+
logger;
|
|
453
|
+
constructor(dbProvider, prover, proverId, cancelJobsOnStop = false, telemetryClient = getTelemetryClient(), bindings){
|
|
52
454
|
this.dbProvider = dbProvider;
|
|
53
455
|
this.prover = prover;
|
|
54
456
|
this.proverId = proverId;
|
|
55
|
-
this.
|
|
457
|
+
this.cancelJobsOnStop = cancelJobsOnStop;
|
|
458
|
+
this.provingState = (_initProto(this), undefined);
|
|
56
459
|
this.pendingProvingJobs = [];
|
|
57
460
|
this.provingPromise = undefined;
|
|
58
461
|
this.dbs = new Map();
|
|
462
|
+
this.logger = createLogger('prover-client:orchestrator', bindings);
|
|
59
463
|
this.metrics = new ProvingOrchestratorMetrics(telemetryClient, 'ProvingOrchestrator');
|
|
60
464
|
}
|
|
61
465
|
get tracer() {
|
|
@@ -64,86 +468,152 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
64
468
|
getProverId() {
|
|
65
469
|
return this.proverId;
|
|
66
470
|
}
|
|
471
|
+
getNumActiveForks() {
|
|
472
|
+
return this.dbs.size;
|
|
473
|
+
}
|
|
67
474
|
stop() {
|
|
68
475
|
this.cancel();
|
|
69
476
|
return Promise.resolve();
|
|
70
477
|
}
|
|
71
|
-
startNewEpoch(epochNumber,
|
|
478
|
+
startNewEpoch(epochNumber, totalNumCheckpoints, finalBlobBatchingChallenges) {
|
|
479
|
+
if (this.provingState?.verifyState()) {
|
|
480
|
+
throw new Error(`Cannot start epoch ${epochNumber} when epoch ${this.provingState.epochNumber} is still being processed.`);
|
|
481
|
+
}
|
|
72
482
|
const { promise: _promise, resolve, reject } = promiseWithResolvers();
|
|
73
483
|
const promise = _promise.catch((reason)=>({
|
|
74
484
|
status: 'failure',
|
|
75
485
|
reason
|
|
76
486
|
}));
|
|
77
|
-
|
|
78
|
-
|
|
79
|
-
}
|
|
80
|
-
logger.info(`Starting epoch ${epochNumber} with ${totalNumBlocks} blocks`);
|
|
81
|
-
this.provingState = new EpochProvingState(epochNumber, firstBlockNumber, totalNumBlocks, finalBlobBatchingChallenges, resolve, reject);
|
|
487
|
+
this.logger.info(`Starting epoch ${epochNumber} with ${totalNumCheckpoints} checkpoints.`);
|
|
488
|
+
this.provingState = new EpochProvingState(epochNumber, totalNumCheckpoints, finalBlobBatchingChallenges, (provingState)=>this.checkAndEnqueueCheckpointRootRollup(provingState), resolve, reject);
|
|
82
489
|
this.provingPromise = promise;
|
|
83
490
|
}
|
|
84
491
|
/**
|
|
85
|
-
* Starts
|
|
86
|
-
* @param
|
|
87
|
-
* @param
|
|
88
|
-
* @
|
|
89
|
-
|
|
492
|
+
* Starts a new checkpoint.
|
|
493
|
+
* @param checkpointIndex - The index of the checkpoint in the epoch.
|
|
494
|
+
* @param constants - The constants for this checkpoint.
|
|
495
|
+
* @param l1ToL2Messages - The set of L1 to L2 messages to be inserted at the beginning of this checkpoint.
|
|
496
|
+
* @param totalNumBlocks - The total number of blocks expected in the checkpoint (must be at least one).
|
|
497
|
+
* @param headerOfLastBlockInPreviousCheckpoint - The header of the last block in the previous checkpoint.
|
|
498
|
+
*/ async startNewCheckpoint(checkpointIndex, constants, l1ToL2Messages, totalNumBlocks, headerOfLastBlockInPreviousCheckpoint) {
|
|
90
499
|
if (!this.provingState) {
|
|
91
|
-
throw new Error(
|
|
92
|
-
}
|
|
93
|
-
if (!this.provingState
|
|
94
|
-
throw new Error(`Epoch not accepting further
|
|
95
|
-
}
|
|
96
|
-
|
|
97
|
-
|
|
98
|
-
const db = await this.dbProvider.fork(
|
|
99
|
-
|
|
100
|
-
|
|
101
|
-
|
|
102
|
-
// Get archive snapshot before this block lands
|
|
103
|
-
const lastArchive = await getTreeSnapshot(MerkleTreeId.ARCHIVE, db);
|
|
500
|
+
throw new Error('Empty epoch proving state. Call startNewEpoch before starting a checkpoint.');
|
|
501
|
+
}
|
|
502
|
+
if (!this.provingState.isAcceptingCheckpoints()) {
|
|
503
|
+
throw new Error(`Epoch not accepting further checkpoints.`);
|
|
504
|
+
}
|
|
505
|
+
// Fork world state at the end of the immediately previous block.
|
|
506
|
+
const lastBlockNumber = headerOfLastBlockInPreviousCheckpoint.globalVariables.blockNumber;
|
|
507
|
+
const db = await this.dbProvider.fork(lastBlockNumber);
|
|
508
|
+
const firstBlockNumber = BlockNumber(lastBlockNumber + 1);
|
|
509
|
+
this.dbs.set(firstBlockNumber, db);
|
|
510
|
+
// Get archive sibling path before any block in this checkpoint lands.
|
|
104
511
|
const lastArchiveSiblingPath = await getLastSiblingPath(MerkleTreeId.ARCHIVE, db);
|
|
105
|
-
|
|
106
|
-
const
|
|
107
|
-
|
|
108
|
-
|
|
109
|
-
|
|
512
|
+
// Insert all the l1 to l2 messages into the db. And get the states before and after the insertion.
|
|
513
|
+
const { lastL1ToL2MessageTreeSnapshot, lastL1ToL2MessageSubtreeRootSiblingPath, newL1ToL2MessageTreeSnapshot, newL1ToL2MessageSubtreeRootSiblingPath } = await this.updateL1ToL2MessageTree(l1ToL2Messages, db);
|
|
514
|
+
this.provingState.startNewCheckpoint(checkpointIndex, constants, totalNumBlocks, headerOfLastBlockInPreviousCheckpoint, lastArchiveSiblingPath, l1ToL2Messages, lastL1ToL2MessageTreeSnapshot, lastL1ToL2MessageSubtreeRootSiblingPath, newL1ToL2MessageTreeSnapshot, newL1ToL2MessageSubtreeRootSiblingPath);
|
|
515
|
+
}
|
|
516
|
+
/**
|
|
517
|
+
* Starts off a new block
|
|
518
|
+
* @param blockNumber - The block number
|
|
519
|
+
* @param timestamp - The timestamp of the block. This is only required for constructing the private inputs for the
|
|
520
|
+
* block that doesn't have any txs.
|
|
521
|
+
* @param totalNumTxs - The total number of txs in the block
|
|
522
|
+
*/ async startNewBlock(blockNumber, timestamp, totalNumTxs) {
|
|
523
|
+
if (!this.provingState) {
|
|
524
|
+
throw new Error('Empty epoch proving state. Call startNewEpoch before starting a block.');
|
|
525
|
+
}
|
|
526
|
+
const checkpointProvingState = this.provingState.getCheckpointProvingStateByBlockNumber(blockNumber);
|
|
527
|
+
if (!checkpointProvingState) {
|
|
528
|
+
throw new Error(`Checkpoint not started. Call startNewCheckpoint first.`);
|
|
529
|
+
}
|
|
530
|
+
if (!checkpointProvingState.isAcceptingBlocks()) {
|
|
531
|
+
throw new Error(`Checkpoint not accepting further blocks.`);
|
|
532
|
+
}
|
|
533
|
+
const constants = checkpointProvingState.constants;
|
|
534
|
+
this.logger.info(`Starting block ${blockNumber} for slot ${constants.slotNumber}.`);
|
|
535
|
+
// Fork the db only when it's not already set. The db for the first block is set in `startNewCheckpoint`.
|
|
536
|
+
if (!this.dbs.has(blockNumber)) {
|
|
537
|
+
// Fork world state at the end of the immediately previous block
|
|
538
|
+
const db = await this.dbProvider.fork(BlockNumber(blockNumber - 1));
|
|
539
|
+
this.dbs.set(blockNumber, db);
|
|
540
|
+
}
|
|
541
|
+
const db = this.getDbForBlock(blockNumber);
|
|
542
|
+
// Get archive snapshot and sibling path before any txs in this block lands.
|
|
543
|
+
const lastArchiveTreeSnapshot = await getTreeSnapshot(MerkleTreeId.ARCHIVE, db);
|
|
544
|
+
const lastArchiveSiblingPath = await getRootTreeSiblingPath(MerkleTreeId.ARCHIVE, db);
|
|
545
|
+
const blockProvingState = checkpointProvingState.startNewBlock(blockNumber, timestamp, totalNumTxs, lastArchiveTreeSnapshot, lastArchiveSiblingPath);
|
|
546
|
+
// Enqueue base parity circuits for the first block in the checkpoint.
|
|
547
|
+
if (blockProvingState.index === 0) {
|
|
548
|
+
for(let i = 0; i < NUM_BASE_PARITY_PER_ROOT_PARITY; i++){
|
|
549
|
+
this.enqueueBaseParityCircuit(checkpointProvingState, blockProvingState, i);
|
|
550
|
+
}
|
|
551
|
+
}
|
|
552
|
+
// Because `addTxs` won't be called for a block without txs, and that's where the sponge blob state is computed.
|
|
553
|
+
// We need to set its end sponge blob here, which will become the start sponge blob for the next block.
|
|
554
|
+
if (totalNumTxs === 0) {
|
|
555
|
+
const endState = await db.getStateReference();
|
|
556
|
+
blockProvingState.setEndState(endState);
|
|
557
|
+
const endSpongeBlob = blockProvingState.getStartSpongeBlob().clone();
|
|
558
|
+
const blockEndBlobFields = blockProvingState.getBlockEndBlobFields();
|
|
559
|
+
await endSpongeBlob.absorb(blockEndBlobFields);
|
|
560
|
+
blockProvingState.setEndSpongeBlob(endSpongeBlob);
|
|
561
|
+
// Try to accumulate the out hashes and blobs as far as we can:
|
|
562
|
+
await this.provingState.accumulateCheckpointOutHashes();
|
|
563
|
+
await this.provingState.setBlobAccumulators();
|
|
110
564
|
}
|
|
111
565
|
}
|
|
112
566
|
/**
|
|
113
567
|
* The interface to add simulated transactions to the scheduler. This can only be called once per block.
|
|
114
568
|
* @param txs - The transactions to be proven
|
|
115
569
|
*/ async addTxs(txs) {
|
|
570
|
+
if (!this.provingState) {
|
|
571
|
+
throw new Error(`Empty epoch proving state. Call startNewEpoch before adding txs.`);
|
|
572
|
+
}
|
|
116
573
|
if (!txs.length) {
|
|
117
574
|
// To avoid an ugly throw below. If we require an empty block, we can just call setBlockCompleted
|
|
118
575
|
// on a block with no txs. We cannot do that here because we cannot find the blockNumber without any txs.
|
|
119
|
-
logger.warn(`Provided no txs to orchestrator addTxs.`);
|
|
576
|
+
this.logger.warn(`Provided no txs to orchestrator addTxs.`);
|
|
120
577
|
return;
|
|
121
578
|
}
|
|
122
|
-
const blockNumber = txs[0].globalVariables.blockNumber;
|
|
123
|
-
const provingState = this.provingState
|
|
579
|
+
const blockNumber = BlockNumber(txs[0].globalVariables.blockNumber);
|
|
580
|
+
const provingState = this.provingState.getBlockProvingStateByBlockNumber(blockNumber);
|
|
124
581
|
if (!provingState) {
|
|
125
|
-
throw new Error(`
|
|
582
|
+
throw new Error(`Proving state for block ${blockNumber} not found. Call startNewBlock first.`);
|
|
583
|
+
}
|
|
584
|
+
if (provingState.totalNumTxs !== txs.length) {
|
|
585
|
+
throw new Error(`Block ${blockNumber} should be filled with ${provingState.totalNumTxs} txs. Received ${txs.length} txs.`);
|
|
126
586
|
}
|
|
127
|
-
if (provingState.
|
|
587
|
+
if (!provingState.isAcceptingTxs()) {
|
|
128
588
|
throw new Error(`Block ${blockNumber} has been initialized with transactions.`);
|
|
129
589
|
}
|
|
130
|
-
|
|
131
|
-
|
|
132
|
-
|
|
590
|
+
this.logger.info(`Adding ${txs.length} transactions to block ${blockNumber}`);
|
|
591
|
+
const db = this.getDbForBlock(blockNumber);
|
|
592
|
+
const lastArchive = provingState.lastArchiveTreeSnapshot;
|
|
593
|
+
const newL1ToL2MessageTreeSnapshot = provingState.newL1ToL2MessageTreeSnapshot;
|
|
594
|
+
const spongeBlobState = provingState.getStartSpongeBlob().clone();
|
|
133
595
|
for (const tx of txs){
|
|
134
596
|
try {
|
|
135
597
|
if (!provingState.verifyState()) {
|
|
136
598
|
throw new Error(`Invalid proving state when adding a tx`);
|
|
137
599
|
}
|
|
138
600
|
validateTx(tx);
|
|
139
|
-
logger.
|
|
140
|
-
const
|
|
141
|
-
const
|
|
601
|
+
this.logger.debug(`Received transaction: ${tx.hash}`);
|
|
602
|
+
const startSpongeBlob = spongeBlobState.clone();
|
|
603
|
+
const [hints, treeSnapshots] = await this.prepareBaseRollupInputs(tx, lastArchive, newL1ToL2MessageTreeSnapshot, startSpongeBlob, db);
|
|
604
|
+
if (!provingState.verifyState()) {
|
|
605
|
+
throw new Error(`Unable to add transaction, preparing base inputs failed`);
|
|
606
|
+
}
|
|
607
|
+
await spongeBlobState.absorb(tx.txEffect.toBlobFields());
|
|
608
|
+
const txProvingState = new TxProvingState(tx, hints, treeSnapshots, this.proverId.toField());
|
|
142
609
|
const txIndex = provingState.addNewTx(txProvingState);
|
|
143
|
-
this.getOrEnqueueTube(provingState, txIndex);
|
|
144
610
|
if (txProvingState.requireAvmProof) {
|
|
145
|
-
|
|
611
|
+
this.getOrEnqueueChonkVerifier(provingState, txIndex);
|
|
612
|
+
this.logger.debug(`Enqueueing public VM for tx ${txIndex}`);
|
|
146
613
|
this.enqueueVM(provingState, txIndex);
|
|
614
|
+
} else {
|
|
615
|
+
this.logger.debug(`Enqueueing base rollup for private-only tx ${txIndex}`);
|
|
616
|
+
this.enqueueBaseRollup(provingState, txIndex);
|
|
147
617
|
}
|
|
148
618
|
} catch (err) {
|
|
149
619
|
throw new Error(`Error adding transaction ${tx.hash.toString()} to block ${blockNumber}: ${err.message}`, {
|
|
@@ -151,21 +621,32 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
151
621
|
});
|
|
152
622
|
}
|
|
153
623
|
}
|
|
624
|
+
const endState = await db.getStateReference();
|
|
625
|
+
provingState.setEndState(endState);
|
|
626
|
+
const blockEndBlobFields = provingState.getBlockEndBlobFields();
|
|
627
|
+
await spongeBlobState.absorb(blockEndBlobFields);
|
|
628
|
+
provingState.setEndSpongeBlob(spongeBlobState);
|
|
629
|
+
// Txs have been added to the block. Now try to accumulate the out hashes and blobs as far as we can:
|
|
630
|
+
await this.provingState.accumulateCheckpointOutHashes();
|
|
631
|
+
await this.provingState.setBlobAccumulators();
|
|
154
632
|
}
|
|
155
633
|
/**
|
|
156
|
-
* Kickstarts
|
|
157
|
-
* Note that if the
|
|
158
|
-
*/
|
|
634
|
+
* Kickstarts chonk verifier circuits for the specified txs. These will be used during epoch proving.
|
|
635
|
+
* Note that if the chonk verifier circuits are not started this way, they will be started nontheless after processing.
|
|
636
|
+
*/ startChonkVerifierCircuits(txs) {
|
|
159
637
|
if (!this.provingState?.verifyState()) {
|
|
160
|
-
throw new Error(`
|
|
638
|
+
throw new Error(`Empty epoch proving state. call startNewEpoch before starting chonk verifier circuits.`);
|
|
161
639
|
}
|
|
162
|
-
|
|
640
|
+
const publicTxs = txs.filter((tx)=>tx.data.forPublic);
|
|
641
|
+
for (const tx of publicTxs){
|
|
163
642
|
const txHash = tx.getTxHash().toString();
|
|
164
|
-
const
|
|
643
|
+
const privateInputs = getPublicChonkVerifierPrivateInputsFromTx(tx, this.proverId.toField());
|
|
165
644
|
const tubeProof = promiseWithResolvers();
|
|
166
|
-
logger.debug(`Starting
|
|
167
|
-
this.
|
|
168
|
-
|
|
645
|
+
this.logger.debug(`Starting chonk verifier circuit for tx ${txHash}`);
|
|
646
|
+
this.doEnqueueChonkVerifier(txHash, privateInputs, (proof)=>{
|
|
647
|
+
tubeProof.resolve(proof);
|
|
648
|
+
});
|
|
649
|
+
this.provingState.cachedChonkVerifierProofs.set(txHash, tubeProof.promise);
|
|
169
650
|
}
|
|
170
651
|
return Promise.resolve();
|
|
171
652
|
}
|
|
@@ -177,65 +658,98 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
177
658
|
if (!provingState) {
|
|
178
659
|
throw new Error(`Block proving state for ${blockNumber} not found`);
|
|
179
660
|
}
|
|
180
|
-
if
|
|
181
|
-
|
|
182
|
-
|
|
183
|
-
|
|
661
|
+
// Abort with specific error for the block if there's one.
|
|
662
|
+
const error = provingState.getError();
|
|
663
|
+
if (error) {
|
|
664
|
+
throw new Error(`Block proving failed: ${error}`);
|
|
184
665
|
}
|
|
666
|
+
// Abort if the proving state is not valid due to errors occurred elsewhere.
|
|
185
667
|
if (!provingState.verifyState()) {
|
|
186
|
-
throw new Error(`
|
|
187
|
-
}
|
|
188
|
-
|
|
189
|
-
|
|
190
|
-
|
|
191
|
-
|
|
192
|
-
|
|
193
|
-
|
|
194
|
-
await this.checkAndEnqueueBlockRootRollup(provingState);
|
|
195
|
-
return provingState.block;
|
|
196
|
-
}
|
|
197
|
-
/** Returns the block as built for a given index. */ getBlock(index) {
|
|
198
|
-
const block = this.provingState?.blocks[index]?.block;
|
|
199
|
-
if (!block) {
|
|
200
|
-
throw new Error(`Block at index ${index} not available`);
|
|
201
|
-
}
|
|
202
|
-
return block;
|
|
203
|
-
}
|
|
204
|
-
async buildBlock(provingState, expectedHeader) {
|
|
205
|
-
// Collect all new nullifiers, commitments, and contracts from all txs in this block to build body
|
|
206
|
-
const txs = provingState.allTxs.map((a)=>a.processedTx);
|
|
207
|
-
// Get db for this block
|
|
208
|
-
const db = this.dbs.get(provingState.blockNumber);
|
|
209
|
-
// Given we've applied every change from this block, now assemble the block header
|
|
210
|
-
// and update the archive tree, so we're ready to start processing the next block
|
|
211
|
-
const { header, body } = await buildHeaderAndBodyFromTxs(txs, provingState.globalVariables, provingState.newL1ToL2Messages, db);
|
|
668
|
+
throw new Error(`Invalid proving state when completing block ${blockNumber}.`);
|
|
669
|
+
}
|
|
670
|
+
if (provingState.isAcceptingTxs()) {
|
|
671
|
+
throw new Error(`Block ${blockNumber} is still accepting txs. Call setBlockCompleted after all txs have been added.`);
|
|
672
|
+
}
|
|
673
|
+
// Given we've applied every change from this block, now assemble the block header:
|
|
674
|
+
this.logger.verbose(`Block ${blockNumber} completed. Assembling header.`);
|
|
675
|
+
const header = await provingState.buildBlockHeader();
|
|
212
676
|
if (expectedHeader && !header.equals(expectedHeader)) {
|
|
213
|
-
logger.error(`Block header mismatch: header=${header} expectedHeader=${expectedHeader}`);
|
|
677
|
+
this.logger.error(`Block header mismatch: header=${header} expectedHeader=${expectedHeader}`);
|
|
214
678
|
throw new Error('Block header mismatch');
|
|
215
679
|
}
|
|
216
|
-
|
|
217
|
-
|
|
218
|
-
|
|
219
|
-
|
|
220
|
-
|
|
221
|
-
|
|
222
|
-
|
|
223
|
-
|
|
680
|
+
// Get db for this block and remove from map — no other code should use it after this point.
|
|
681
|
+
const db = this.getDbForBlock(provingState.blockNumber);
|
|
682
|
+
this.dbs.delete(provingState.blockNumber);
|
|
683
|
+
// Update the archive tree, capture the snapshot, and close the fork deterministically.
|
|
684
|
+
try {
|
|
685
|
+
this.logger.verbose(`Updating archive tree with block ${provingState.blockNumber} header ${(await header.hash()).toString()}`);
|
|
686
|
+
await db.updateArchive(header);
|
|
687
|
+
provingState.setBuiltArchive(await getTreeSnapshot(MerkleTreeId.ARCHIVE, db));
|
|
688
|
+
} finally{
|
|
689
|
+
await db.close();
|
|
690
|
+
}
|
|
691
|
+
await this.verifyBuiltBlockAgainstSyncedState(provingState);
|
|
692
|
+
return header;
|
|
224
693
|
}
|
|
225
694
|
// Flagged as protected to disable in certain unit tests
|
|
226
|
-
async verifyBuiltBlockAgainstSyncedState(
|
|
227
|
-
const
|
|
695
|
+
async verifyBuiltBlockAgainstSyncedState(provingState) {
|
|
696
|
+
const builtBlockHeader = provingState.getBuiltBlockHeader();
|
|
697
|
+
if (!builtBlockHeader) {
|
|
698
|
+
this.logger.debug('Block header not built yet, skipping header check.');
|
|
699
|
+
return;
|
|
700
|
+
}
|
|
701
|
+
const output = provingState.getBlockRootRollupOutput();
|
|
702
|
+
if (!output) {
|
|
703
|
+
this.logger.debug('Block root rollup proof not built yet, skipping header check.');
|
|
704
|
+
return;
|
|
705
|
+
}
|
|
706
|
+
const newArchive = provingState.getBuiltArchive();
|
|
707
|
+
if (!newArchive) {
|
|
708
|
+
this.logger.debug('Archive snapshot not yet captured, skipping header check.');
|
|
709
|
+
return;
|
|
710
|
+
}
|
|
711
|
+
const header = await buildHeaderFromCircuitOutputs(output);
|
|
712
|
+
if (!(await header.hash()).equals(await builtBlockHeader.hash())) {
|
|
713
|
+
this.logger.error(`Block header mismatch.\nCircuit: ${inspect(header)}\nComputed: ${inspect(builtBlockHeader)}`);
|
|
714
|
+
provingState.reject(`Block header hash mismatch.`);
|
|
715
|
+
return;
|
|
716
|
+
}
|
|
717
|
+
const blockNumber = provingState.blockNumber;
|
|
718
|
+
const syncedArchive = await getTreeSnapshot(MerkleTreeId.ARCHIVE, this.dbProvider.getSnapshot(blockNumber));
|
|
228
719
|
if (!syncedArchive.equals(newArchive)) {
|
|
229
|
-
|
|
720
|
+
this.logger.error(`Archive tree mismatch for block ${blockNumber}: world state synced to ${inspect(syncedArchive)} but built ${inspect(newArchive)}`);
|
|
721
|
+
provingState.reject(`Archive tree mismatch.`);
|
|
722
|
+
return;
|
|
723
|
+
}
|
|
724
|
+
const circuitArchive = output.newArchive;
|
|
725
|
+
if (!newArchive.equals(circuitArchive)) {
|
|
726
|
+
this.logger.error(`New archive mismatch.\nCircuit: ${output.newArchive}\nComputed: ${newArchive}`);
|
|
727
|
+
provingState.reject(`New archive mismatch.`);
|
|
728
|
+
return;
|
|
230
729
|
}
|
|
231
730
|
}
|
|
232
731
|
/**
|
|
233
|
-
* Cancel any further proving
|
|
732
|
+
* Cancel any further proving.
|
|
733
|
+
* If cancelJobsOnStop is true, aborts all pending jobs with the broker (which marks them as 'Aborted').
|
|
734
|
+
* If cancelJobsOnStop is false (default), jobs remain in the broker queue and can be reused on restart/reorg.
|
|
234
735
|
*/ cancel() {
|
|
235
|
-
|
|
236
|
-
controller.
|
|
736
|
+
if (this.cancelJobsOnStop) {
|
|
737
|
+
for (const controller of this.pendingProvingJobs){
|
|
738
|
+
controller.abort();
|
|
739
|
+
}
|
|
237
740
|
}
|
|
238
741
|
this.provingState?.cancel();
|
|
742
|
+
for (const [blockNumber, db] of this.dbs.entries()){
|
|
743
|
+
void db.close().catch((err)=>this.logger.error(`Error closing db for block ${blockNumber}`, err));
|
|
744
|
+
}
|
|
745
|
+
this.dbs.clear();
|
|
746
|
+
}
|
|
747
|
+
getDbForBlock(blockNumber) {
|
|
748
|
+
const db = this.dbs.get(blockNumber);
|
|
749
|
+
if (!db) {
|
|
750
|
+
throw new Error(`World state fork for block ${blockNumber} not found.`);
|
|
751
|
+
}
|
|
752
|
+
return db;
|
|
239
753
|
}
|
|
240
754
|
/**
|
|
241
755
|
* Returns the proof for the current epoch.
|
|
@@ -247,14 +761,7 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
247
761
|
if (result.status === 'failure') {
|
|
248
762
|
throw new Error(`Epoch proving failed: ${result.reason}`);
|
|
249
763
|
}
|
|
250
|
-
|
|
251
|
-
// TODO(MW): EpochProvingState uses this.blocks.filter(b => !!b).length as total blocks, use this below:
|
|
252
|
-
const finalBlock = this.provingState.blocks[this.provingState.totalNumBlocks - 1];
|
|
253
|
-
if (!finalBlock || !finalBlock.endBlobAccumulator) {
|
|
254
|
-
throw new Error(`Epoch's final block not ready for finalize`);
|
|
255
|
-
}
|
|
256
|
-
const finalBatchedBlob = await finalBlock.endBlobAccumulator.finalize();
|
|
257
|
-
this.provingState.setFinalBatchedBlob(finalBatchedBlob);
|
|
764
|
+
await this.provingState.finalizeBatchedBlob();
|
|
258
765
|
const epochProofResult = this.provingState.getEpochProofResult();
|
|
259
766
|
pushTestData('epochProofResult', {
|
|
260
767
|
proof: epochProofResult.proof.toString(),
|
|
@@ -263,25 +770,13 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
263
770
|
return epochProofResult;
|
|
264
771
|
}
|
|
265
772
|
/**
|
|
266
|
-
* Starts the proving process for the given transaction and adds it to our state
|
|
267
|
-
* @param tx - The transaction whose proving we wish to commence
|
|
268
|
-
* @param provingState - The proving state being worked on
|
|
269
|
-
*/ async prepareTransaction(tx, provingState) {
|
|
270
|
-
const txInputs = await this.prepareBaseRollupInputs(provingState, tx);
|
|
271
|
-
if (!txInputs) {
|
|
272
|
-
// This should not be possible
|
|
273
|
-
throw new Error(`Unable to add transaction, preparing base inputs failed`);
|
|
274
|
-
}
|
|
275
|
-
return txInputs;
|
|
276
|
-
}
|
|
277
|
-
/**
|
|
278
773
|
* Enqueue a job to be scheduled
|
|
279
774
|
* @param provingState - The proving state object being operated on
|
|
280
775
|
* @param jobType - The type of job to be queued
|
|
281
776
|
* @param job - The actual job, returns a promise notifying of the job's completion
|
|
282
777
|
*/ deferredProving(provingState, request, callback) {
|
|
283
|
-
if (!provingState
|
|
284
|
-
logger.debug(`Not enqueuing job, state no longer valid`);
|
|
778
|
+
if (!provingState.verifyState()) {
|
|
779
|
+
this.logger.debug(`Not enqueuing job, state no longer valid`);
|
|
285
780
|
return;
|
|
286
781
|
}
|
|
287
782
|
const controller = new AbortController();
|
|
@@ -295,8 +790,8 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
295
790
|
return;
|
|
296
791
|
}
|
|
297
792
|
const result = await request(controller.signal);
|
|
298
|
-
if (!provingState
|
|
299
|
-
logger.debug(`State no longer valid, discarding result`);
|
|
793
|
+
if (!provingState.verifyState()) {
|
|
794
|
+
this.logger.debug(`State no longer valid, discarding result`);
|
|
300
795
|
return;
|
|
301
796
|
}
|
|
302
797
|
// we could have been cancelled whilst waiting for the result
|
|
@@ -311,7 +806,7 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
311
806
|
// drop this result
|
|
312
807
|
return;
|
|
313
808
|
}
|
|
314
|
-
logger.error(`Error thrown when proving job`, err);
|
|
809
|
+
this.logger.error(`Error thrown when proving job`, err);
|
|
315
810
|
provingState.reject(`${err}`);
|
|
316
811
|
} finally{
|
|
317
812
|
const index = this.pendingProvingJobs.indexOf(controller);
|
|
@@ -323,31 +818,26 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
323
818
|
// let the callstack unwind before adding the job to the queue
|
|
324
819
|
setImmediate(()=>void safeJob());
|
|
325
820
|
}
|
|
326
|
-
async
|
|
821
|
+
async updateL1ToL2MessageTree(l1ToL2Messages, db) {
|
|
327
822
|
const l1ToL2MessagesPadded = padArrayEnd(l1ToL2Messages, Fr.ZERO, NUMBER_OF_L1_L2_MESSAGES_PER_ROLLUP, 'Too many L1 to L2 messages');
|
|
328
|
-
const
|
|
329
|
-
const
|
|
330
|
-
const l1ToL2MessageSubtreeSiblingPath = assertLength(await getSubtreeSiblingPath(MerkleTreeId.L1_TO_L2_MESSAGE_TREE, L1_TO_L2_MSG_SUBTREE_HEIGHT, db), L1_TO_L2_MSG_SUBTREE_SIBLING_PATH_LENGTH);
|
|
823
|
+
const lastL1ToL2MessageTreeSnapshot = await getTreeSnapshot(MerkleTreeId.L1_TO_L2_MESSAGE_TREE, db);
|
|
824
|
+
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);
|
|
331
825
|
// Update the local trees to include the new l1 to l2 messages
|
|
332
826
|
await db.appendLeaves(MerkleTreeId.L1_TO_L2_MESSAGE_TREE, l1ToL2MessagesPadded);
|
|
333
|
-
const
|
|
827
|
+
const newL1ToL2MessageTreeSnapshot = await getTreeSnapshot(MerkleTreeId.L1_TO_L2_MESSAGE_TREE, db);
|
|
828
|
+
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);
|
|
334
829
|
return {
|
|
335
|
-
|
|
336
|
-
|
|
337
|
-
|
|
338
|
-
|
|
830
|
+
lastL1ToL2MessageTreeSnapshot,
|
|
831
|
+
lastL1ToL2MessageSubtreeRootSiblingPath,
|
|
832
|
+
newL1ToL2MessageTreeSnapshot,
|
|
833
|
+
newL1ToL2MessageSubtreeRootSiblingPath
|
|
339
834
|
};
|
|
340
835
|
}
|
|
341
836
|
// Updates the merkle trees for a transaction. The first enqueued job for a transaction
|
|
342
|
-
async prepareBaseRollupInputs(
|
|
343
|
-
if (!provingState.verifyState() || !provingState.spongeBlobState) {
|
|
344
|
-
logger.debug('Not preparing base rollup inputs, state invalid');
|
|
345
|
-
return;
|
|
346
|
-
}
|
|
347
|
-
const db = this.dbs.get(provingState.blockNumber);
|
|
837
|
+
async prepareBaseRollupInputs(tx, lastArchive, newL1ToL2MessageTreeSnapshot, startSpongeBlob, db) {
|
|
348
838
|
// We build the base rollup inputs using a mock proof and verification key.
|
|
349
|
-
// These will be overwritten later once we have proven the
|
|
350
|
-
const [ms, hints] = await elapsed(insertSideEffectsAndBuildBaseRollupHints(tx,
|
|
839
|
+
// These will be overwritten later once we have proven the chonk verifier circuit and any public kernels
|
|
840
|
+
const [ms, hints] = await elapsed(insertSideEffectsAndBuildBaseRollupHints(tx, lastArchive, newL1ToL2MessageTreeSnapshot, startSpongeBlob, this.proverId.toField(), db));
|
|
351
841
|
this.metrics.recordBaseRollupInputs(ms);
|
|
352
842
|
const promises = [
|
|
353
843
|
MerkleTreeId.NOTE_HASH_TREE,
|
|
@@ -363,10 +853,6 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
363
853
|
obj.key,
|
|
364
854
|
obj.value
|
|
365
855
|
]));
|
|
366
|
-
if (!provingState.verifyState()) {
|
|
367
|
-
logger.debug(`Discarding proving job, state no longer valid`);
|
|
368
|
-
return;
|
|
369
|
-
}
|
|
370
856
|
return [
|
|
371
857
|
hints,
|
|
372
858
|
treeSnapshots
|
|
@@ -376,145 +862,150 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
376
862
|
// Executes the next level of merge if all inputs are available
|
|
377
863
|
enqueueBaseRollup(provingState, txIndex) {
|
|
378
864
|
if (!provingState.verifyState()) {
|
|
379
|
-
logger.debug('Not running base rollup, state invalid');
|
|
865
|
+
this.logger.debug('Not running base rollup, state invalid');
|
|
866
|
+
return;
|
|
867
|
+
}
|
|
868
|
+
if (!provingState.tryStartProvingBase(txIndex)) {
|
|
869
|
+
this.logger.debug(`Base rollup for tx ${txIndex} already started.`);
|
|
380
870
|
return;
|
|
381
871
|
}
|
|
382
872
|
const txProvingState = provingState.getTxProvingState(txIndex);
|
|
383
873
|
const { processedTx } = txProvingState;
|
|
384
874
|
const { rollupType, inputs } = txProvingState.getBaseRollupTypeAndInputs();
|
|
385
|
-
logger.debug(`Enqueuing deferred proving base rollup for ${processedTx.hash.toString()}`);
|
|
386
|
-
this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, `ProvingOrchestrator.prover.${inputs instanceof
|
|
875
|
+
this.logger.debug(`Enqueuing deferred proving base rollup for ${processedTx.hash.toString()}`);
|
|
876
|
+
this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, `ProvingOrchestrator.prover.${inputs instanceof PrivateTxBaseRollupPrivateInputs ? 'getPrivateTxBaseRollupProof' : 'getPublicTxBaseRollupProof'}`, {
|
|
387
877
|
[Attributes.TX_HASH]: processedTx.hash.toString(),
|
|
388
878
|
[Attributes.PROTOCOL_CIRCUIT_NAME]: rollupType
|
|
389
879
|
}, (signal)=>{
|
|
390
|
-
if (inputs instanceof
|
|
391
|
-
return this.prover.
|
|
880
|
+
if (inputs instanceof PrivateTxBaseRollupPrivateInputs) {
|
|
881
|
+
return this.prover.getPrivateTxBaseRollupProof(inputs, signal, provingState.epochNumber);
|
|
392
882
|
} else {
|
|
393
|
-
return this.prover.
|
|
883
|
+
return this.prover.getPublicTxBaseRollupProof(inputs, signal, provingState.epochNumber);
|
|
394
884
|
}
|
|
395
|
-
}),
|
|
396
|
-
logger.debug(`Completed proof for ${rollupType} for tx ${processedTx.hash.toString()}`);
|
|
397
|
-
validatePartialState(result.inputs.
|
|
885
|
+
}), (result)=>{
|
|
886
|
+
this.logger.debug(`Completed proof for ${rollupType} for tx ${processedTx.hash.toString()}`);
|
|
887
|
+
validatePartialState(result.inputs.endTreeSnapshots, txProvingState.treeSnapshots);
|
|
398
888
|
const leafLocation = provingState.setBaseRollupProof(txIndex, result);
|
|
399
889
|
if (provingState.totalNumTxs === 1) {
|
|
400
|
-
|
|
890
|
+
this.checkAndEnqueueBlockRootRollup(provingState);
|
|
401
891
|
} else {
|
|
402
|
-
|
|
892
|
+
this.checkAndEnqueueNextMergeRollup(provingState, leafLocation);
|
|
403
893
|
}
|
|
404
894
|
});
|
|
405
895
|
}
|
|
406
|
-
// Enqueues the
|
|
407
|
-
// Once completed, will enqueue the
|
|
408
|
-
|
|
896
|
+
// Enqueues the public chonk verifier circuit for a given transaction index, or reuses the one already enqueued.
|
|
897
|
+
// Once completed, will enqueue the the public tx base rollup.
|
|
898
|
+
getOrEnqueueChonkVerifier(provingState, txIndex) {
|
|
409
899
|
if (!provingState.verifyState()) {
|
|
410
|
-
logger.debug('Not running
|
|
900
|
+
this.logger.debug('Not running chonk verifier circuit, state invalid');
|
|
411
901
|
return;
|
|
412
902
|
}
|
|
413
903
|
const txProvingState = provingState.getTxProvingState(txIndex);
|
|
414
904
|
const txHash = txProvingState.processedTx.hash.toString();
|
|
905
|
+
NESTED_RECURSIVE_ROLLUP_HONK_PROOF_LENGTH;
|
|
415
906
|
const handleResult = (result)=>{
|
|
416
|
-
logger.debug(`Got
|
|
907
|
+
this.logger.debug(`Got chonk verifier proof for tx index: ${txIndex}`, {
|
|
417
908
|
txHash
|
|
418
909
|
});
|
|
419
|
-
txProvingState.
|
|
420
|
-
this.provingState?.
|
|
421
|
-
this.
|
|
910
|
+
txProvingState.setPublicChonkVerifierProof(result);
|
|
911
|
+
this.provingState?.cachedChonkVerifierProofs.delete(txHash);
|
|
912
|
+
this.checkAndEnqueueBaseRollup(provingState, txIndex);
|
|
422
913
|
};
|
|
423
|
-
if (this.provingState?.
|
|
424
|
-
logger.debug(`
|
|
914
|
+
if (this.provingState?.cachedChonkVerifierProofs.has(txHash)) {
|
|
915
|
+
this.logger.debug(`Chonk verifier proof already enqueued for tx index: ${txIndex}`, {
|
|
425
916
|
txHash
|
|
426
917
|
});
|
|
427
|
-
void this.provingState.
|
|
918
|
+
void this.provingState.cachedChonkVerifierProofs.get(txHash).then(handleResult);
|
|
428
919
|
return;
|
|
429
920
|
}
|
|
430
|
-
logger.debug(`Enqueuing
|
|
431
|
-
this.
|
|
921
|
+
this.logger.debug(`Enqueuing chonk verifier circuit for tx index: ${txIndex}`);
|
|
922
|
+
this.doEnqueueChonkVerifier(txHash, txProvingState.getPublicChonkVerifierPrivateInputs(), handleResult);
|
|
432
923
|
}
|
|
433
|
-
|
|
434
|
-
if (!provingState
|
|
435
|
-
logger.debug('Not running
|
|
924
|
+
doEnqueueChonkVerifier(txHash, inputs, handler, provingState = this.provingState) {
|
|
925
|
+
if (!provingState.verifyState()) {
|
|
926
|
+
this.logger.debug('Not running chonk verifier circuit, state invalid');
|
|
436
927
|
return;
|
|
437
928
|
}
|
|
438
|
-
this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.
|
|
929
|
+
this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getPublicChonkVerifierProof', {
|
|
439
930
|
[Attributes.TX_HASH]: txHash,
|
|
440
|
-
[Attributes.PROTOCOL_CIRCUIT_NAME]: '
|
|
441
|
-
}, (signal)=>this.prover.
|
|
931
|
+
[Attributes.PROTOCOL_CIRCUIT_NAME]: 'chonk-verifier-public'
|
|
932
|
+
}, (signal)=>this.prover.getPublicChonkVerifierProof(inputs, signal, provingState.epochNumber)), handler);
|
|
442
933
|
}
|
|
443
934
|
// Executes the merge rollup circuit and stored the output as intermediate state for the parent merge/block root circuit
|
|
444
935
|
// Enqueues the next level of merge if all inputs are available
|
|
445
936
|
enqueueMergeRollup(provingState, location) {
|
|
446
937
|
if (!provingState.verifyState()) {
|
|
447
|
-
logger.debug('Not running merge rollup. State no longer valid.');
|
|
938
|
+
this.logger.debug('Not running merge rollup. State no longer valid.');
|
|
939
|
+
return;
|
|
940
|
+
}
|
|
941
|
+
if (!provingState.tryStartProvingMerge(location)) {
|
|
942
|
+
this.logger.debug('Merge rollup already started.');
|
|
448
943
|
return;
|
|
449
944
|
}
|
|
450
945
|
const inputs = provingState.getMergeRollupInputs(location);
|
|
451
|
-
this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.
|
|
452
|
-
[Attributes.PROTOCOL_CIRCUIT_NAME]: 'merge
|
|
453
|
-
}, (signal)=>this.prover.
|
|
946
|
+
this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getTxMergeRollupProof', {
|
|
947
|
+
[Attributes.PROTOCOL_CIRCUIT_NAME]: 'rollup-tx-merge'
|
|
948
|
+
}, (signal)=>this.prover.getTxMergeRollupProof(inputs, signal, provingState.epochNumber)), (result)=>{
|
|
454
949
|
provingState.setMergeRollupProof(location, result);
|
|
455
|
-
|
|
950
|
+
this.checkAndEnqueueNextMergeRollup(provingState, location);
|
|
456
951
|
});
|
|
457
952
|
}
|
|
458
953
|
// Executes the block root rollup circuit
|
|
459
|
-
|
|
954
|
+
enqueueBlockRootRollup(provingState) {
|
|
460
955
|
if (!provingState.verifyState()) {
|
|
461
|
-
logger.debug('Not running block root rollup, state no longer valid');
|
|
956
|
+
this.logger.debug('Not running block root rollup, state no longer valid');
|
|
957
|
+
return;
|
|
958
|
+
}
|
|
959
|
+
if (!provingState.tryStartProvingBlockRoot()) {
|
|
960
|
+
this.logger.debug('Block root rollup already started.');
|
|
462
961
|
return;
|
|
463
962
|
}
|
|
464
|
-
|
|
465
|
-
|
|
466
|
-
logger.debug(`Enqueuing ${rollupType} for block ${provingState.blockNumber} with ${provingState.newL1ToL2Messages.length} l1 to l2 msgs.`);
|
|
963
|
+
const { rollupType, inputs } = provingState.getBlockRootRollupTypeAndInputs();
|
|
964
|
+
this.logger.debug(`Enqueuing ${rollupType} for block ${provingState.blockNumber}.`);
|
|
467
965
|
this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getBlockRootRollupProof', {
|
|
468
966
|
[Attributes.PROTOCOL_CIRCUIT_NAME]: rollupType
|
|
469
967
|
}, (signal)=>{
|
|
470
|
-
if (inputs instanceof
|
|
471
|
-
return this.prover.
|
|
472
|
-
} else if (inputs instanceof
|
|
473
|
-
return this.prover.
|
|
968
|
+
if (inputs instanceof BlockRootFirstRollupPrivateInputs) {
|
|
969
|
+
return this.prover.getBlockRootFirstRollupProof(inputs, signal, provingState.epochNumber);
|
|
970
|
+
} else if (inputs instanceof BlockRootSingleTxFirstRollupPrivateInputs) {
|
|
971
|
+
return this.prover.getBlockRootSingleTxFirstRollupProof(inputs, signal, provingState.epochNumber);
|
|
972
|
+
} else if (inputs instanceof BlockRootEmptyTxFirstRollupPrivateInputs) {
|
|
973
|
+
return this.prover.getBlockRootEmptyTxFirstRollupProof(inputs, signal, provingState.epochNumber);
|
|
974
|
+
} else if (inputs instanceof BlockRootSingleTxRollupPrivateInputs) {
|
|
975
|
+
return this.prover.getBlockRootSingleTxRollupProof(inputs, signal, provingState.epochNumber);
|
|
474
976
|
} else {
|
|
475
977
|
return this.prover.getBlockRootRollupProof(inputs, signal, provingState.epochNumber);
|
|
476
978
|
}
|
|
477
979
|
}), async (result)=>{
|
|
478
|
-
provingState.
|
|
479
|
-
const
|
|
480
|
-
|
|
481
|
-
|
|
482
|
-
|
|
483
|
-
|
|
484
|
-
|
|
485
|
-
|
|
486
|
-
if (!dbArchiveRoot.equals(circuitArchiveRoot)) {
|
|
487
|
-
logger.error(`New archive root mismatch.\nCircuit: ${result.inputs.newArchive.root}\nComputed: ${dbArchiveRoot}`);
|
|
488
|
-
provingState.reject(`New archive root mismatch.`);
|
|
489
|
-
}
|
|
490
|
-
const endBlobAccumulatorPublicInputs = BlobAccumulatorPublicInputs.fromBatchedBlobAccumulator(provingState.endBlobAccumulator);
|
|
491
|
-
const circuitEndBlobAccumulatorState = result.inputs.blobPublicInputs.endBlobAccumulator;
|
|
492
|
-
if (!circuitEndBlobAccumulatorState.equals(endBlobAccumulatorPublicInputs)) {
|
|
493
|
-
logger.error(`Blob accumulator state mismatch.\nCircuit: ${inspect(circuitEndBlobAccumulatorState)}\nComputed: ${inspect(endBlobAccumulatorPublicInputs)}`);
|
|
494
|
-
provingState.reject(`Blob accumulator state mismatch.`);
|
|
495
|
-
}
|
|
496
|
-
logger.debug(`Completed ${rollupType} proof for block ${provingState.block.number}`);
|
|
497
|
-
// validatePartialState(result.inputs.end, tx.treeSnapshots); // TODO(palla/prover)
|
|
498
|
-
const epochProvingState = this.provingState;
|
|
499
|
-
const leafLocation = epochProvingState.setBlockRootRollupProof(provingState.index, result);
|
|
500
|
-
if (epochProvingState.totalNumBlocks === 1) {
|
|
501
|
-
this.enqueueEpochPadding(epochProvingState);
|
|
980
|
+
this.logger.debug(`Completed ${rollupType} proof for block ${provingState.blockNumber}`);
|
|
981
|
+
const leafLocation = provingState.setBlockRootRollupProof(result);
|
|
982
|
+
const checkpointProvingState = provingState.parentCheckpoint;
|
|
983
|
+
// Verification is called from both here and setBlockCompleted. Whichever runs last
|
|
984
|
+
// will be the first to see all three pieces (header, proof output, archive) and run the checks.
|
|
985
|
+
await this.verifyBuiltBlockAgainstSyncedState(provingState);
|
|
986
|
+
if (checkpointProvingState.totalNumBlocks === 1) {
|
|
987
|
+
await this.checkAndEnqueueCheckpointRootRollup(checkpointProvingState);
|
|
502
988
|
} else {
|
|
503
|
-
this.checkAndEnqueueNextBlockMergeRollup(
|
|
989
|
+
await this.checkAndEnqueueNextBlockMergeRollup(checkpointProvingState, leafLocation);
|
|
504
990
|
}
|
|
505
991
|
});
|
|
506
992
|
}
|
|
507
993
|
// Executes the base parity circuit and stores the intermediate state for the root parity circuit
|
|
508
994
|
// Enqueues the root parity circuit if all inputs are available
|
|
509
|
-
enqueueBaseParityCircuit(
|
|
995
|
+
enqueueBaseParityCircuit(checkpointProvingState, provingState, baseParityIndex) {
|
|
510
996
|
if (!provingState.verifyState()) {
|
|
511
|
-
logger.debug('Not running base parity. State no longer valid.');
|
|
997
|
+
this.logger.debug('Not running base parity. State no longer valid.');
|
|
998
|
+
return;
|
|
999
|
+
}
|
|
1000
|
+
if (!provingState.tryStartProvingBaseParity(baseParityIndex)) {
|
|
1001
|
+
this.logger.warn(`Base parity ${baseParityIndex} already started.`);
|
|
512
1002
|
return;
|
|
513
1003
|
}
|
|
1004
|
+
const inputs = checkpointProvingState.getBaseParityInputs(baseParityIndex);
|
|
514
1005
|
this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getBaseParityProof', {
|
|
515
|
-
[Attributes.PROTOCOL_CIRCUIT_NAME]: 'base
|
|
1006
|
+
[Attributes.PROTOCOL_CIRCUIT_NAME]: 'parity-base'
|
|
516
1007
|
}, (signal)=>this.prover.getBaseParityProof(inputs, signal, provingState.epochNumber)), (provingOutput)=>{
|
|
517
|
-
provingState.setBaseParityProof(
|
|
1008
|
+
provingState.setBaseParityProof(baseParityIndex, provingOutput);
|
|
518
1009
|
this.checkAndEnqueueRootParityCircuit(provingState);
|
|
519
1010
|
});
|
|
520
1011
|
}
|
|
@@ -528,110 +1019,182 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
528
1019
|
// Enqueues the root rollup proof if all inputs are available
|
|
529
1020
|
enqueueRootParityCircuit(provingState) {
|
|
530
1021
|
if (!provingState.verifyState()) {
|
|
531
|
-
logger.debug('Not running root parity. State no longer valid.');
|
|
1022
|
+
this.logger.debug('Not running root parity. State no longer valid.');
|
|
1023
|
+
return;
|
|
1024
|
+
}
|
|
1025
|
+
if (!provingState.tryStartProvingRootParity()) {
|
|
1026
|
+
this.logger.debug('Root parity already started.');
|
|
532
1027
|
return;
|
|
533
1028
|
}
|
|
534
|
-
const inputs = provingState.
|
|
1029
|
+
const inputs = provingState.getParityRootInputs();
|
|
535
1030
|
this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getRootParityProof', {
|
|
536
|
-
[Attributes.PROTOCOL_CIRCUIT_NAME]: 'root
|
|
537
|
-
}, (signal)=>this.prover.getRootParityProof(inputs, signal, provingState.epochNumber)),
|
|
1031
|
+
[Attributes.PROTOCOL_CIRCUIT_NAME]: 'parity-root'
|
|
1032
|
+
}, (signal)=>this.prover.getRootParityProof(inputs, signal, provingState.epochNumber)), (result)=>{
|
|
538
1033
|
provingState.setRootParityProof(result);
|
|
539
|
-
|
|
1034
|
+
this.checkAndEnqueueBlockRootRollup(provingState);
|
|
540
1035
|
});
|
|
541
1036
|
}
|
|
542
1037
|
// Executes the block merge rollup circuit and stored the output as intermediate state for the parent merge/block root circuit
|
|
543
1038
|
// Enqueues the next level of merge if all inputs are available
|
|
544
1039
|
enqueueBlockMergeRollup(provingState, location) {
|
|
545
1040
|
if (!provingState.verifyState()) {
|
|
546
|
-
logger.debug('Not running block merge rollup. State no longer valid.');
|
|
1041
|
+
this.logger.debug('Not running block merge rollup. State no longer valid.');
|
|
1042
|
+
return;
|
|
1043
|
+
}
|
|
1044
|
+
if (!provingState.tryStartProvingBlockMerge(location)) {
|
|
1045
|
+
this.logger.debug('Block merge rollup already started.');
|
|
547
1046
|
return;
|
|
548
1047
|
}
|
|
549
1048
|
const inputs = provingState.getBlockMergeRollupInputs(location);
|
|
550
1049
|
this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getBlockMergeRollupProof', {
|
|
551
|
-
[Attributes.PROTOCOL_CIRCUIT_NAME]: 'block-merge
|
|
552
|
-
}, (signal)=>this.prover.getBlockMergeRollupProof(inputs, signal, provingState.epochNumber)), (result)=>{
|
|
1050
|
+
[Attributes.PROTOCOL_CIRCUIT_NAME]: 'rollup-block-merge'
|
|
1051
|
+
}, (signal)=>this.prover.getBlockMergeRollupProof(inputs, signal, provingState.epochNumber)), async (result)=>{
|
|
553
1052
|
provingState.setBlockMergeRollupProof(location, result);
|
|
554
|
-
this.checkAndEnqueueNextBlockMergeRollup(provingState, location);
|
|
1053
|
+
await this.checkAndEnqueueNextBlockMergeRollup(provingState, location);
|
|
1054
|
+
});
|
|
1055
|
+
}
|
|
1056
|
+
async enqueueCheckpointRootRollup(provingState) {
|
|
1057
|
+
if (!provingState.verifyState()) {
|
|
1058
|
+
this.logger.debug('Not running checkpoint root rollup. State no longer valid.');
|
|
1059
|
+
return;
|
|
1060
|
+
}
|
|
1061
|
+
if (!provingState.tryStartProvingCheckpointRoot()) {
|
|
1062
|
+
this.logger.debug('Checkpoint root rollup already started.');
|
|
1063
|
+
return;
|
|
1064
|
+
}
|
|
1065
|
+
const rollupType = provingState.getCheckpointRootRollupType();
|
|
1066
|
+
this.logger.debug(`Enqueuing ${rollupType} for checkpoint ${provingState.index}.`);
|
|
1067
|
+
const inputs = await provingState.getCheckpointRootRollupInputs();
|
|
1068
|
+
this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getCheckpointRootRollupProof', {
|
|
1069
|
+
[Attributes.PROTOCOL_CIRCUIT_NAME]: rollupType
|
|
1070
|
+
}, (signal)=>{
|
|
1071
|
+
if (inputs instanceof CheckpointRootSingleBlockRollupPrivateInputs) {
|
|
1072
|
+
return this.prover.getCheckpointRootSingleBlockRollupProof(inputs, signal, provingState.epochNumber);
|
|
1073
|
+
} else {
|
|
1074
|
+
return this.prover.getCheckpointRootRollupProof(inputs, signal, provingState.epochNumber);
|
|
1075
|
+
}
|
|
1076
|
+
}), (result)=>{
|
|
1077
|
+
const computedEndBlobAccumulatorState = provingState.getEndBlobAccumulator().toBlobAccumulator();
|
|
1078
|
+
const circuitEndBlobAccumulatorState = result.inputs.endBlobAccumulator;
|
|
1079
|
+
if (!circuitEndBlobAccumulatorState.equals(computedEndBlobAccumulatorState)) {
|
|
1080
|
+
this.logger.error(`Blob accumulator state mismatch.\nCircuit: ${inspect(circuitEndBlobAccumulatorState)}\nComputed: ${inspect(computedEndBlobAccumulatorState)}`);
|
|
1081
|
+
provingState.reject(`Blob accumulator state mismatch.`);
|
|
1082
|
+
return;
|
|
1083
|
+
}
|
|
1084
|
+
this.logger.debug(`Completed ${rollupType} proof for checkpoint ${provingState.index}.`);
|
|
1085
|
+
const leafLocation = provingState.setCheckpointRootRollupProof(result);
|
|
1086
|
+
const epochProvingState = provingState.parentEpoch;
|
|
1087
|
+
if (epochProvingState.totalNumCheckpoints === 1) {
|
|
1088
|
+
this.enqueueEpochPadding(epochProvingState);
|
|
1089
|
+
} else {
|
|
1090
|
+
this.checkAndEnqueueNextCheckpointMergeRollup(epochProvingState, leafLocation);
|
|
1091
|
+
}
|
|
1092
|
+
});
|
|
1093
|
+
}
|
|
1094
|
+
enqueueCheckpointMergeRollup(provingState, location) {
|
|
1095
|
+
if (!provingState.verifyState()) {
|
|
1096
|
+
this.logger.debug('Not running checkpoint merge rollup. State no longer valid.');
|
|
1097
|
+
return;
|
|
1098
|
+
}
|
|
1099
|
+
if (!provingState.tryStartProvingCheckpointMerge(location)) {
|
|
1100
|
+
this.logger.debug('Checkpoint merge rollup already started.');
|
|
1101
|
+
return;
|
|
1102
|
+
}
|
|
1103
|
+
const inputs = provingState.getCheckpointMergeRollupInputs(location);
|
|
1104
|
+
this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getCheckpointMergeRollupProof', {
|
|
1105
|
+
[Attributes.PROTOCOL_CIRCUIT_NAME]: 'rollup-checkpoint-merge'
|
|
1106
|
+
}, (signal)=>this.prover.getCheckpointMergeRollupProof(inputs, signal, provingState.epochNumber)), (result)=>{
|
|
1107
|
+
this.logger.debug('Completed proof for checkpoint merge rollup.');
|
|
1108
|
+
provingState.setCheckpointMergeRollupProof(location, result);
|
|
1109
|
+
this.checkAndEnqueueNextCheckpointMergeRollup(provingState, location);
|
|
555
1110
|
});
|
|
556
1111
|
}
|
|
557
1112
|
enqueueEpochPadding(provingState) {
|
|
558
1113
|
if (!provingState.verifyState()) {
|
|
559
|
-
logger.debug('Not running epoch padding. State no longer valid.');
|
|
1114
|
+
this.logger.debug('Not running epoch padding. State no longer valid.');
|
|
560
1115
|
return;
|
|
561
1116
|
}
|
|
562
|
-
|
|
563
|
-
|
|
564
|
-
|
|
565
|
-
|
|
566
|
-
|
|
567
|
-
|
|
568
|
-
|
|
1117
|
+
if (!provingState.tryStartProvingPaddingCheckpoint()) {
|
|
1118
|
+
this.logger.debug('Padding checkpoint already started.');
|
|
1119
|
+
return;
|
|
1120
|
+
}
|
|
1121
|
+
this.logger.debug('Padding epoch proof with a padding block root proof.');
|
|
1122
|
+
const inputs = provingState.getPaddingCheckpointInputs();
|
|
1123
|
+
this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getCheckpointPaddingRollupProof', {
|
|
1124
|
+
[Attributes.PROTOCOL_CIRCUIT_NAME]: 'rollup-checkpoint-padding'
|
|
1125
|
+
}, (signal)=>this.prover.getCheckpointPaddingRollupProof(inputs, signal, provingState.epochNumber)), (result)=>{
|
|
1126
|
+
this.logger.debug('Completed proof for padding checkpoint.');
|
|
1127
|
+
provingState.setCheckpointPaddingProof(result);
|
|
569
1128
|
this.checkAndEnqueueRootRollup(provingState);
|
|
570
1129
|
});
|
|
571
1130
|
}
|
|
572
1131
|
// Executes the root rollup circuit
|
|
573
1132
|
enqueueRootRollup(provingState) {
|
|
574
1133
|
if (!provingState.verifyState()) {
|
|
575
|
-
logger.debug('Not running root rollup, state no longer valid');
|
|
1134
|
+
this.logger.debug('Not running root rollup, state no longer valid');
|
|
576
1135
|
return;
|
|
577
1136
|
}
|
|
578
|
-
logger.debug(`Preparing root rollup`);
|
|
1137
|
+
this.logger.debug(`Preparing root rollup`);
|
|
579
1138
|
const inputs = provingState.getRootRollupInputs();
|
|
580
1139
|
this.deferredProving(provingState, wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getRootRollupProof', {
|
|
581
|
-
[Attributes.PROTOCOL_CIRCUIT_NAME]: 'root
|
|
1140
|
+
[Attributes.PROTOCOL_CIRCUIT_NAME]: 'rollup-root'
|
|
582
1141
|
}, (signal)=>this.prover.getRootRollupProof(inputs, signal, provingState.epochNumber)), (result)=>{
|
|
583
|
-
logger.verbose(`Orchestrator completed root rollup for epoch ${provingState.epochNumber}`);
|
|
1142
|
+
this.logger.verbose(`Orchestrator completed root rollup for epoch ${provingState.epochNumber}`);
|
|
584
1143
|
provingState.setRootRollupProof(result);
|
|
585
1144
|
provingState.resolve({
|
|
586
1145
|
status: 'success'
|
|
587
1146
|
});
|
|
588
1147
|
});
|
|
589
1148
|
}
|
|
590
|
-
|
|
1149
|
+
checkAndEnqueueNextMergeRollup(provingState, currentLocation) {
|
|
591
1150
|
if (!provingState.isReadyForMergeRollup(currentLocation)) {
|
|
592
1151
|
return;
|
|
593
1152
|
}
|
|
594
1153
|
const parentLocation = provingState.getParentLocation(currentLocation);
|
|
595
1154
|
if (parentLocation.level === 0) {
|
|
596
|
-
|
|
1155
|
+
this.checkAndEnqueueBlockRootRollup(provingState);
|
|
597
1156
|
} else {
|
|
598
1157
|
this.enqueueMergeRollup(provingState, parentLocation);
|
|
599
1158
|
}
|
|
600
1159
|
}
|
|
601
|
-
|
|
602
|
-
const blockNumber = provingState.blockNumber;
|
|
603
|
-
// Accumulate as far as we can, in case blocks came in out of order and we are behind:
|
|
604
|
-
await this.provingState?.setBlobAccumulators(blockNumber);
|
|
1160
|
+
checkAndEnqueueBlockRootRollup(provingState) {
|
|
605
1161
|
if (!provingState.isReadyForBlockRootRollup()) {
|
|
606
|
-
logger.debug('Not ready for block root rollup');
|
|
1162
|
+
this.logger.debug('Not ready for block root rollup');
|
|
607
1163
|
return;
|
|
608
1164
|
}
|
|
609
|
-
|
|
610
|
-
|
|
1165
|
+
this.enqueueBlockRootRollup(provingState);
|
|
1166
|
+
}
|
|
1167
|
+
async checkAndEnqueueNextBlockMergeRollup(provingState, currentLocation) {
|
|
1168
|
+
if (!provingState.isReadyForBlockMerge(currentLocation)) {
|
|
1169
|
+
return;
|
|
1170
|
+
}
|
|
1171
|
+
const parentLocation = provingState.getParentLocation(currentLocation);
|
|
1172
|
+
if (parentLocation.level === 0) {
|
|
1173
|
+
await this.checkAndEnqueueCheckpointRootRollup(provingState);
|
|
1174
|
+
} else {
|
|
1175
|
+
this.enqueueBlockMergeRollup(provingState, parentLocation);
|
|
1176
|
+
}
|
|
1177
|
+
}
|
|
1178
|
+
async checkAndEnqueueCheckpointRootRollup(provingState) {
|
|
1179
|
+
if (!provingState.isReadyForCheckpointRoot()) {
|
|
611
1180
|
return;
|
|
612
1181
|
}
|
|
613
|
-
|
|
614
|
-
// is aborted and never reaches this point, it will leak the fork. We need to add a global cleanup,
|
|
615
|
-
// but have to make sure it only runs once all operations are completed, otherwise some function here
|
|
616
|
-
// will attempt to access the fork after it was closed.
|
|
617
|
-
logger.debug(`Cleaning up world state fork for ${blockNumber}`);
|
|
618
|
-
void this.dbs.get(blockNumber)?.close().then(()=>this.dbs.delete(blockNumber)).catch((err)=>logger.error(`Error closing db for block ${blockNumber}`, err));
|
|
619
|
-
await this.enqueueBlockRootRollup(provingState);
|
|
1182
|
+
await this.enqueueCheckpointRootRollup(provingState);
|
|
620
1183
|
}
|
|
621
|
-
|
|
622
|
-
if (!provingState.
|
|
1184
|
+
checkAndEnqueueNextCheckpointMergeRollup(provingState, currentLocation) {
|
|
1185
|
+
if (!provingState.isReadyForCheckpointMerge(currentLocation)) {
|
|
623
1186
|
return;
|
|
624
1187
|
}
|
|
625
1188
|
const parentLocation = provingState.getParentLocation(currentLocation);
|
|
626
1189
|
if (parentLocation.level === 0) {
|
|
627
1190
|
this.checkAndEnqueueRootRollup(provingState);
|
|
628
1191
|
} else {
|
|
629
|
-
this.
|
|
1192
|
+
this.enqueueCheckpointMergeRollup(provingState, parentLocation);
|
|
630
1193
|
}
|
|
631
1194
|
}
|
|
632
1195
|
checkAndEnqueueRootRollup(provingState) {
|
|
633
1196
|
if (!provingState.isReadyForRootRollup()) {
|
|
634
|
-
logger.debug('Not ready for root rollup');
|
|
1197
|
+
this.logger.debug('Not ready for root rollup');
|
|
635
1198
|
return;
|
|
636
1199
|
}
|
|
637
1200
|
this.enqueueRootRollup(provingState);
|
|
@@ -643,74 +1206,29 @@ const logger = createLogger('prover-client:orchestrator');
|
|
|
643
1206
|
* @param txIndex - The index of the transaction being proven
|
|
644
1207
|
*/ enqueueVM(provingState, txIndex) {
|
|
645
1208
|
if (!provingState.verifyState()) {
|
|
646
|
-
logger.debug(`Not running VM circuit as state is no longer valid`);
|
|
1209
|
+
this.logger.debug(`Not running VM circuit as state is no longer valid`);
|
|
647
1210
|
return;
|
|
648
1211
|
}
|
|
649
1212
|
const txProvingState = provingState.getTxProvingState(txIndex);
|
|
650
|
-
// This function tries to do AVM proving. If there is a failure, it fakes the proof unless AVM_PROVING_STRICT is defined.
|
|
651
|
-
// Nothing downstream depends on the AVM proof yet. So having this mode lets us incrementally build the AVM circuit.
|
|
652
1213
|
const doAvmProving = wrapCallbackInSpan(this.tracer, 'ProvingOrchestrator.prover.getAvmProof', {
|
|
653
1214
|
[Attributes.TX_HASH]: txProvingState.processedTx.hash.toString()
|
|
654
1215
|
}, async (signal)=>{
|
|
655
1216
|
const inputs = txProvingState.getAvmInputs();
|
|
656
|
-
|
|
657
|
-
// TODO(#14234)[Unconditional PIs validation]: Remove the whole try-catch logic and
|
|
658
|
-
// just keep the next line but removing the second argument (false).
|
|
659
|
-
return await this.prover.getAvmProof(inputs, false, signal, provingState.epochNumber);
|
|
660
|
-
} catch (err) {
|
|
661
|
-
if (process.env.AVM_PROVING_STRICT) {
|
|
662
|
-
logger.error(`Error thrown when proving AVM circuit with AVM_PROVING_STRICT on`, err);
|
|
663
|
-
throw err;
|
|
664
|
-
} else {
|
|
665
|
-
logger.warn(`Error thrown when proving AVM circuit but AVM_PROVING_STRICT is off. Use snapshotted
|
|
666
|
-
AVM inputs and carrying on. ${inspect(err)}.`);
|
|
667
|
-
try {
|
|
668
|
-
this.metrics.incAvmFallback();
|
|
669
|
-
const snapshotAvmPrivateInputs = readAvmMinimalPublicTxInputsFromFile();
|
|
670
|
-
return await this.prover.getAvmProof(snapshotAvmPrivateInputs, true, signal, provingState.epochNumber);
|
|
671
|
-
} catch (err) {
|
|
672
|
-
logger.error(`Error thrown when proving snapshotted AVM inputs.`, err);
|
|
673
|
-
throw err;
|
|
674
|
-
}
|
|
675
|
-
}
|
|
676
|
-
}
|
|
1217
|
+
return await this.prover.getAvmProof(inputs, signal, provingState.epochNumber);
|
|
677
1218
|
});
|
|
678
|
-
this.deferredProving(provingState, doAvmProving, (
|
|
679
|
-
logger.debug(`Proven VM for tx index: ${txIndex}`);
|
|
680
|
-
txProvingState.setAvmProof(
|
|
681
|
-
this.
|
|
1219
|
+
this.deferredProving(provingState, doAvmProving, (proof)=>{
|
|
1220
|
+
this.logger.debug(`Proven VM for tx index: ${txIndex}`);
|
|
1221
|
+
txProvingState.setAvmProof(proof);
|
|
1222
|
+
this.checkAndEnqueueBaseRollup(provingState, txIndex);
|
|
682
1223
|
});
|
|
683
1224
|
}
|
|
684
|
-
|
|
1225
|
+
checkAndEnqueueBaseRollup(provingState, txIndex) {
|
|
685
1226
|
const txProvingState = provingState.getTxProvingState(txIndex);
|
|
686
1227
|
if (!txProvingState.ready()) {
|
|
687
1228
|
return;
|
|
688
1229
|
}
|
|
689
|
-
// We must have completed all proving (
|
|
690
|
-
logger.debug(`Public functions completed for tx ${txIndex} enqueueing base rollup`);
|
|
1230
|
+
// We must have completed all proving (chonk verifier proof and (if required) vm proof are generated), we now move to the base rollup.
|
|
1231
|
+
this.logger.debug(`Public functions completed for tx ${txIndex} enqueueing base rollup`);
|
|
691
1232
|
this.enqueueBaseRollup(provingState, txIndex);
|
|
692
1233
|
}
|
|
693
1234
|
}
|
|
694
|
-
_ts_decorate([
|
|
695
|
-
trackSpan('ProvingOrchestrator.startNewBlock', (globalVariables)=>({
|
|
696
|
-
[Attributes.BLOCK_NUMBER]: globalVariables.blockNumber
|
|
697
|
-
}))
|
|
698
|
-
], ProvingOrchestrator.prototype, "startNewBlock", null);
|
|
699
|
-
_ts_decorate([
|
|
700
|
-
trackSpan('ProvingOrchestrator.addTxs', (txs)=>({
|
|
701
|
-
[Attributes.BLOCK_TXS_COUNT]: txs.length
|
|
702
|
-
}))
|
|
703
|
-
], ProvingOrchestrator.prototype, "addTxs", null);
|
|
704
|
-
_ts_decorate([
|
|
705
|
-
trackSpan('ProvingOrchestrator.startTubeCircuits')
|
|
706
|
-
], ProvingOrchestrator.prototype, "startTubeCircuits", null);
|
|
707
|
-
_ts_decorate([
|
|
708
|
-
trackSpan('ProvingOrchestrator.setBlockCompleted', (blockNumber)=>({
|
|
709
|
-
[Attributes.BLOCK_NUMBER]: blockNumber
|
|
710
|
-
}))
|
|
711
|
-
], ProvingOrchestrator.prototype, "setBlockCompleted", null);
|
|
712
|
-
_ts_decorate([
|
|
713
|
-
trackSpan('ProvingOrchestrator.prepareBaseRollupInputs', (_, tx)=>({
|
|
714
|
-
[Attributes.TX_HASH]: tx.hash.toString()
|
|
715
|
-
}))
|
|
716
|
-
], ProvingOrchestrator.prototype, "prepareBaseRollupInputs", null);
|