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