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