@aztec/archiver 0.0.1-commit.9b94fc1 → 0.0.1-commit.9badcec54

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (213) hide show
  1. package/README.md +162 -22
  2. package/dest/archiver.d.ts +140 -0
  3. package/dest/archiver.d.ts.map +1 -0
  4. package/dest/archiver.js +750 -0
  5. package/dest/config.d.ts +30 -0
  6. package/dest/config.d.ts.map +1 -0
  7. package/dest/{archiver/config.js → config.js} +24 -7
  8. package/dest/errors.d.ts +65 -0
  9. package/dest/errors.d.ts.map +1 -0
  10. package/dest/errors.js +91 -0
  11. package/dest/factory.d.ts +8 -7
  12. package/dest/factory.d.ts.map +1 -1
  13. package/dest/factory.js +99 -15
  14. package/dest/index.d.ts +11 -4
  15. package/dest/index.d.ts.map +1 -1
  16. package/dest/index.js +9 -3
  17. package/dest/interfaces.d.ts +9 -0
  18. package/dest/interfaces.d.ts.map +1 -0
  19. package/dest/interfaces.js +3 -0
  20. package/dest/l1/bin/retrieve-calldata.d.ts +3 -0
  21. package/dest/l1/bin/retrieve-calldata.d.ts.map +1 -0
  22. package/dest/l1/bin/retrieve-calldata.js +152 -0
  23. package/dest/l1/calldata_retriever.d.ts +135 -0
  24. package/dest/l1/calldata_retriever.d.ts.map +1 -0
  25. package/dest/l1/calldata_retriever.js +403 -0
  26. package/dest/l1/data_retrieval.d.ts +88 -0
  27. package/dest/l1/data_retrieval.d.ts.map +1 -0
  28. package/dest/{archiver → l1}/data_retrieval.js +87 -160
  29. package/dest/l1/debug_tx.d.ts +19 -0
  30. package/dest/l1/debug_tx.d.ts.map +1 -0
  31. package/dest/l1/debug_tx.js +73 -0
  32. package/dest/l1/spire_proposer.d.ts +70 -0
  33. package/dest/l1/spire_proposer.d.ts.map +1 -0
  34. package/dest/l1/spire_proposer.js +149 -0
  35. package/dest/l1/trace_tx.d.ts +97 -0
  36. package/dest/l1/trace_tx.d.ts.map +1 -0
  37. package/dest/l1/trace_tx.js +91 -0
  38. package/dest/l1/types.d.ts +12 -0
  39. package/dest/l1/types.d.ts.map +1 -0
  40. package/dest/l1/types.js +3 -0
  41. package/dest/l1/validate_trace.d.ts +32 -0
  42. package/dest/l1/validate_trace.d.ts.map +1 -0
  43. package/dest/l1/validate_trace.js +154 -0
  44. package/dest/modules/data_source_base.d.ts +91 -0
  45. package/dest/modules/data_source_base.d.ts.map +1 -0
  46. package/dest/modules/data_source_base.js +222 -0
  47. package/dest/modules/data_store_updater.d.ts +86 -0
  48. package/dest/modules/data_store_updater.d.ts.map +1 -0
  49. package/dest/modules/data_store_updater.js +333 -0
  50. package/dest/modules/instrumentation.d.ts +52 -0
  51. package/dest/modules/instrumentation.d.ts.map +1 -0
  52. package/dest/modules/instrumentation.js +138 -0
  53. package/dest/modules/l1_synchronizer.d.ts +73 -0
  54. package/dest/modules/l1_synchronizer.d.ts.map +1 -0
  55. package/dest/modules/l1_synchronizer.js +1154 -0
  56. package/dest/modules/validation.d.ts +17 -0
  57. package/dest/modules/validation.d.ts.map +1 -0
  58. package/dest/{archiver → modules}/validation.js +9 -3
  59. package/dest/store/block_store.d.ts +230 -0
  60. package/dest/store/block_store.d.ts.map +1 -0
  61. package/dest/store/block_store.js +942 -0
  62. package/dest/store/contract_class_store.d.ts +17 -0
  63. package/dest/store/contract_class_store.d.ts.map +1 -0
  64. package/dest/store/contract_class_store.js +64 -0
  65. package/dest/store/contract_instance_store.d.ts +24 -0
  66. package/dest/store/contract_instance_store.d.ts.map +1 -0
  67. package/dest/{archiver/kv_archiver_store → store}/contract_instance_store.js +7 -3
  68. package/dest/store/kv_archiver_store.d.ts +377 -0
  69. package/dest/store/kv_archiver_store.d.ts.map +1 -0
  70. package/dest/store/kv_archiver_store.js +494 -0
  71. package/dest/store/l2_tips_cache.d.ts +20 -0
  72. package/dest/store/l2_tips_cache.d.ts.map +1 -0
  73. package/dest/store/l2_tips_cache.js +109 -0
  74. package/dest/store/log_store.d.ts +57 -0
  75. package/dest/store/log_store.d.ts.map +1 -0
  76. package/dest/store/log_store.js +531 -0
  77. package/dest/store/message_store.d.ts +44 -0
  78. package/dest/store/message_store.d.ts.map +1 -0
  79. package/dest/{archiver/kv_archiver_store → store}/message_store.js +36 -23
  80. package/dest/{archiver/structs → structs}/data_retrieval.d.ts +1 -1
  81. package/dest/structs/data_retrieval.d.ts.map +1 -0
  82. package/dest/structs/inbox_message.d.ts +15 -0
  83. package/dest/structs/inbox_message.d.ts.map +1 -0
  84. package/dest/{archiver/structs → structs}/inbox_message.js +6 -5
  85. package/dest/structs/published.d.ts +2 -0
  86. package/dest/structs/published.d.ts.map +1 -0
  87. package/dest/test/fake_l1_state.d.ts +210 -0
  88. package/dest/test/fake_l1_state.d.ts.map +1 -0
  89. package/dest/test/fake_l1_state.js +490 -0
  90. package/dest/test/index.d.ts +2 -1
  91. package/dest/test/index.d.ts.map +1 -1
  92. package/dest/test/index.js +4 -1
  93. package/dest/test/mock_archiver.d.ts +16 -8
  94. package/dest/test/mock_archiver.d.ts.map +1 -1
  95. package/dest/test/mock_archiver.js +19 -14
  96. package/dest/test/mock_l1_to_l2_message_source.d.ts +7 -6
  97. package/dest/test/mock_l1_to_l2_message_source.d.ts.map +1 -1
  98. package/dest/test/mock_l1_to_l2_message_source.js +23 -12
  99. package/dest/test/mock_l2_block_source.d.ts +59 -20
  100. package/dest/test/mock_l2_block_source.d.ts.map +1 -1
  101. package/dest/test/mock_l2_block_source.js +276 -85
  102. package/dest/test/mock_structs.d.ts +83 -4
  103. package/dest/test/mock_structs.d.ts.map +1 -1
  104. package/dest/test/mock_structs.js +157 -11
  105. package/dest/test/noop_l1_archiver.d.ts +26 -0
  106. package/dest/test/noop_l1_archiver.d.ts.map +1 -0
  107. package/dest/test/noop_l1_archiver.js +71 -0
  108. package/package.json +20 -20
  109. package/src/archiver.ts +510 -0
  110. package/src/{archiver/config.ts → config.ts} +37 -14
  111. package/src/errors.ts +146 -0
  112. package/src/factory.ts +154 -17
  113. package/src/index.ts +11 -3
  114. package/src/interfaces.ts +9 -0
  115. package/src/l1/README.md +55 -0
  116. package/src/l1/bin/retrieve-calldata.ts +194 -0
  117. package/src/l1/calldata_retriever.ts +512 -0
  118. package/src/{archiver → l1}/data_retrieval.ts +146 -233
  119. package/src/l1/debug_tx.ts +99 -0
  120. package/src/l1/spire_proposer.ts +152 -0
  121. package/src/l1/trace_tx.ts +128 -0
  122. package/src/l1/types.ts +13 -0
  123. package/src/l1/validate_trace.ts +229 -0
  124. package/src/modules/data_source_base.ts +347 -0
  125. package/src/modules/data_store_updater.ts +437 -0
  126. package/src/modules/instrumentation.ts +196 -0
  127. package/src/modules/l1_synchronizer.ts +961 -0
  128. package/src/{archiver → modules}/validation.ts +13 -8
  129. package/src/store/block_store.ts +1245 -0
  130. package/src/store/contract_class_store.ts +82 -0
  131. package/src/{archiver/kv_archiver_store → store}/contract_instance_store.ts +10 -7
  132. package/src/store/kv_archiver_store.ts +713 -0
  133. package/src/store/l2_tips_cache.ts +134 -0
  134. package/src/store/log_store.ts +733 -0
  135. package/src/{archiver/kv_archiver_store → store}/message_store.ts +48 -28
  136. package/src/{archiver/structs → structs}/inbox_message.ts +7 -7
  137. package/src/{archiver/structs → structs}/published.ts +0 -1
  138. package/src/test/fake_l1_state.ts +747 -0
  139. package/src/test/fixtures/debug_traceTransaction-multicall3.json +88 -0
  140. package/src/test/fixtures/debug_traceTransaction-multiplePropose.json +153 -0
  141. package/src/test/fixtures/debug_traceTransaction-proxied.json +122 -0
  142. package/src/test/fixtures/trace_transaction-multicall3.json +65 -0
  143. package/src/test/fixtures/trace_transaction-multiplePropose.json +319 -0
  144. package/src/test/fixtures/trace_transaction-proxied.json +128 -0
  145. package/src/test/fixtures/trace_transaction-randomRevert.json +216 -0
  146. package/src/test/index.ts +4 -0
  147. package/src/test/mock_archiver.ts +23 -16
  148. package/src/test/mock_l1_to_l2_message_source.ts +19 -11
  149. package/src/test/mock_l2_block_source.ts +346 -93
  150. package/src/test/mock_structs.ts +289 -13
  151. package/src/test/noop_l1_archiver.ts +114 -0
  152. package/dest/archiver/archiver.d.ts +0 -287
  153. package/dest/archiver/archiver.d.ts.map +0 -1
  154. package/dest/archiver/archiver.js +0 -1408
  155. package/dest/archiver/archiver_store.d.ts +0 -255
  156. package/dest/archiver/archiver_store.d.ts.map +0 -1
  157. package/dest/archiver/archiver_store.js +0 -4
  158. package/dest/archiver/archiver_store_test_suite.d.ts +0 -8
  159. package/dest/archiver/archiver_store_test_suite.d.ts.map +0 -1
  160. package/dest/archiver/archiver_store_test_suite.js +0 -1289
  161. package/dest/archiver/config.d.ts +0 -21
  162. package/dest/archiver/config.d.ts.map +0 -1
  163. package/dest/archiver/data_retrieval.d.ts +0 -79
  164. package/dest/archiver/data_retrieval.d.ts.map +0 -1
  165. package/dest/archiver/errors.d.ts +0 -12
  166. package/dest/archiver/errors.d.ts.map +0 -1
  167. package/dest/archiver/errors.js +0 -17
  168. package/dest/archiver/index.d.ts +0 -7
  169. package/dest/archiver/index.d.ts.map +0 -1
  170. package/dest/archiver/index.js +0 -4
  171. package/dest/archiver/instrumentation.d.ts +0 -35
  172. package/dest/archiver/instrumentation.d.ts.map +0 -1
  173. package/dest/archiver/instrumentation.js +0 -140
  174. package/dest/archiver/kv_archiver_store/block_store.d.ts +0 -124
  175. package/dest/archiver/kv_archiver_store/block_store.d.ts.map +0 -1
  176. package/dest/archiver/kv_archiver_store/block_store.js +0 -370
  177. package/dest/archiver/kv_archiver_store/contract_class_store.d.ts +0 -18
  178. package/dest/archiver/kv_archiver_store/contract_class_store.d.ts.map +0 -1
  179. package/dest/archiver/kv_archiver_store/contract_class_store.js +0 -120
  180. package/dest/archiver/kv_archiver_store/contract_instance_store.d.ts +0 -24
  181. package/dest/archiver/kv_archiver_store/contract_instance_store.d.ts.map +0 -1
  182. package/dest/archiver/kv_archiver_store/kv_archiver_store.d.ts +0 -168
  183. package/dest/archiver/kv_archiver_store/kv_archiver_store.d.ts.map +0 -1
  184. package/dest/archiver/kv_archiver_store/kv_archiver_store.js +0 -296
  185. package/dest/archiver/kv_archiver_store/log_store.d.ts +0 -49
  186. package/dest/archiver/kv_archiver_store/log_store.d.ts.map +0 -1
  187. package/dest/archiver/kv_archiver_store/log_store.js +0 -336
  188. package/dest/archiver/kv_archiver_store/message_store.d.ts +0 -39
  189. package/dest/archiver/kv_archiver_store/message_store.d.ts.map +0 -1
  190. package/dest/archiver/structs/data_retrieval.d.ts.map +0 -1
  191. package/dest/archiver/structs/inbox_message.d.ts +0 -15
  192. package/dest/archiver/structs/inbox_message.d.ts.map +0 -1
  193. package/dest/archiver/structs/published.d.ts +0 -3
  194. package/dest/archiver/structs/published.d.ts.map +0 -1
  195. package/dest/archiver/validation.d.ts +0 -17
  196. package/dest/archiver/validation.d.ts.map +0 -1
  197. package/dest/rpc/index.d.ts +0 -9
  198. package/dest/rpc/index.d.ts.map +0 -1
  199. package/dest/rpc/index.js +0 -15
  200. package/src/archiver/archiver.ts +0 -1858
  201. package/src/archiver/archiver_store.ts +0 -305
  202. package/src/archiver/archiver_store_test_suite.ts +0 -1264
  203. package/src/archiver/errors.ts +0 -26
  204. package/src/archiver/index.ts +0 -6
  205. package/src/archiver/instrumentation.ts +0 -187
  206. package/src/archiver/kv_archiver_store/block_store.ts +0 -481
  207. package/src/archiver/kv_archiver_store/contract_class_store.ts +0 -176
  208. package/src/archiver/kv_archiver_store/kv_archiver_store.ts +0 -422
  209. package/src/archiver/kv_archiver_store/log_store.ts +0 -406
  210. package/src/rpc/index.ts +0 -16
  211. /package/dest/{archiver/structs → structs}/data_retrieval.js +0 -0
  212. /package/dest/{archiver/structs → structs}/published.js +0 -0
  213. /package/src/{archiver/structs → structs}/data_retrieval.ts +0 -0
@@ -0,0 +1,1154 @@
1
+ function applyDecs2203RFactory() {
2
+ function createAddInitializerMethod(initializers, decoratorFinishedRef) {
3
+ return function addInitializer(initializer) {
4
+ assertNotFinished(decoratorFinishedRef, "addInitializer");
5
+ assertCallable(initializer, "An initializer");
6
+ initializers.push(initializer);
7
+ };
8
+ }
9
+ function memberDec(dec, name, desc, initializers, kind, isStatic, isPrivate, metadata, value) {
10
+ var kindStr;
11
+ switch(kind){
12
+ case 1:
13
+ kindStr = "accessor";
14
+ break;
15
+ case 2:
16
+ kindStr = "method";
17
+ break;
18
+ case 3:
19
+ kindStr = "getter";
20
+ break;
21
+ case 4:
22
+ kindStr = "setter";
23
+ break;
24
+ default:
25
+ kindStr = "field";
26
+ }
27
+ var ctx = {
28
+ kind: kindStr,
29
+ name: isPrivate ? "#" + name : name,
30
+ static: isStatic,
31
+ private: isPrivate,
32
+ metadata: metadata
33
+ };
34
+ var decoratorFinishedRef = {
35
+ v: false
36
+ };
37
+ ctx.addInitializer = createAddInitializerMethod(initializers, decoratorFinishedRef);
38
+ var get, set;
39
+ if (kind === 0) {
40
+ if (isPrivate) {
41
+ get = desc.get;
42
+ set = desc.set;
43
+ } else {
44
+ get = function() {
45
+ return this[name];
46
+ };
47
+ set = function(v) {
48
+ this[name] = v;
49
+ };
50
+ }
51
+ } else if (kind === 2) {
52
+ get = function() {
53
+ return desc.value;
54
+ };
55
+ } else {
56
+ if (kind === 1 || kind === 3) {
57
+ get = function() {
58
+ return desc.get.call(this);
59
+ };
60
+ }
61
+ if (kind === 1 || kind === 4) {
62
+ set = function(v) {
63
+ desc.set.call(this, v);
64
+ };
65
+ }
66
+ }
67
+ ctx.access = get && set ? {
68
+ get: get,
69
+ set: set
70
+ } : get ? {
71
+ get: get
72
+ } : {
73
+ set: set
74
+ };
75
+ try {
76
+ return dec(value, ctx);
77
+ } finally{
78
+ decoratorFinishedRef.v = true;
79
+ }
80
+ }
81
+ function assertNotFinished(decoratorFinishedRef, fnName) {
82
+ if (decoratorFinishedRef.v) {
83
+ throw new Error("attempted to call " + fnName + " after decoration was finished");
84
+ }
85
+ }
86
+ function assertCallable(fn, hint) {
87
+ if (typeof fn !== "function") {
88
+ throw new TypeError(hint + " must be a function");
89
+ }
90
+ }
91
+ function assertValidReturnValue(kind, value) {
92
+ var type = typeof value;
93
+ if (kind === 1) {
94
+ if (type !== "object" || value === null) {
95
+ throw new TypeError("accessor decorators must return an object with get, set, or init properties or void 0");
96
+ }
97
+ if (value.get !== undefined) {
98
+ assertCallable(value.get, "accessor.get");
99
+ }
100
+ if (value.set !== undefined) {
101
+ assertCallable(value.set, "accessor.set");
102
+ }
103
+ if (value.init !== undefined) {
104
+ assertCallable(value.init, "accessor.init");
105
+ }
106
+ } else if (type !== "function") {
107
+ var hint;
108
+ if (kind === 0) {
109
+ hint = "field";
110
+ } else if (kind === 10) {
111
+ hint = "class";
112
+ } else {
113
+ hint = "method";
114
+ }
115
+ throw new TypeError(hint + " decorators must return a function or void 0");
116
+ }
117
+ }
118
+ function applyMemberDec(ret, base, decInfo, name, kind, isStatic, isPrivate, initializers, metadata) {
119
+ var decs = decInfo[0];
120
+ var desc, init, value;
121
+ if (isPrivate) {
122
+ if (kind === 0 || kind === 1) {
123
+ desc = {
124
+ get: decInfo[3],
125
+ set: decInfo[4]
126
+ };
127
+ } else if (kind === 3) {
128
+ desc = {
129
+ get: decInfo[3]
130
+ };
131
+ } else if (kind === 4) {
132
+ desc = {
133
+ set: decInfo[3]
134
+ };
135
+ } else {
136
+ desc = {
137
+ value: decInfo[3]
138
+ };
139
+ }
140
+ } else if (kind !== 0) {
141
+ desc = Object.getOwnPropertyDescriptor(base, name);
142
+ }
143
+ if (kind === 1) {
144
+ value = {
145
+ get: desc.get,
146
+ set: desc.set
147
+ };
148
+ } else if (kind === 2) {
149
+ value = desc.value;
150
+ } else if (kind === 3) {
151
+ value = desc.get;
152
+ } else if (kind === 4) {
153
+ value = desc.set;
154
+ }
155
+ var newValue, get, set;
156
+ if (typeof decs === "function") {
157
+ newValue = memberDec(decs, name, desc, initializers, kind, isStatic, isPrivate, metadata, value);
158
+ if (newValue !== void 0) {
159
+ assertValidReturnValue(kind, newValue);
160
+ if (kind === 0) {
161
+ init = newValue;
162
+ } else if (kind === 1) {
163
+ init = newValue.init;
164
+ get = newValue.get || value.get;
165
+ set = newValue.set || value.set;
166
+ value = {
167
+ get: get,
168
+ set: set
169
+ };
170
+ } else {
171
+ value = newValue;
172
+ }
173
+ }
174
+ } else {
175
+ for(var i = decs.length - 1; i >= 0; i--){
176
+ var dec = decs[i];
177
+ newValue = memberDec(dec, name, desc, initializers, kind, isStatic, isPrivate, metadata, value);
178
+ if (newValue !== void 0) {
179
+ assertValidReturnValue(kind, newValue);
180
+ var newInit;
181
+ if (kind === 0) {
182
+ newInit = newValue;
183
+ } else if (kind === 1) {
184
+ newInit = newValue.init;
185
+ get = newValue.get || value.get;
186
+ set = newValue.set || value.set;
187
+ value = {
188
+ get: get,
189
+ set: set
190
+ };
191
+ } else {
192
+ value = newValue;
193
+ }
194
+ if (newInit !== void 0) {
195
+ if (init === void 0) {
196
+ init = newInit;
197
+ } else if (typeof init === "function") {
198
+ init = [
199
+ init,
200
+ newInit
201
+ ];
202
+ } else {
203
+ init.push(newInit);
204
+ }
205
+ }
206
+ }
207
+ }
208
+ }
209
+ if (kind === 0 || kind === 1) {
210
+ if (init === void 0) {
211
+ init = function(instance, init) {
212
+ return init;
213
+ };
214
+ } else if (typeof init !== "function") {
215
+ var ownInitializers = init;
216
+ init = function(instance, init) {
217
+ var value = init;
218
+ for(var i = 0; i < ownInitializers.length; i++){
219
+ value = ownInitializers[i].call(instance, value);
220
+ }
221
+ return value;
222
+ };
223
+ } else {
224
+ var originalInitializer = init;
225
+ init = function(instance, init) {
226
+ return originalInitializer.call(instance, init);
227
+ };
228
+ }
229
+ ret.push(init);
230
+ }
231
+ if (kind !== 0) {
232
+ if (kind === 1) {
233
+ desc.get = value.get;
234
+ desc.set = value.set;
235
+ } else if (kind === 2) {
236
+ desc.value = value;
237
+ } else if (kind === 3) {
238
+ desc.get = value;
239
+ } else if (kind === 4) {
240
+ desc.set = value;
241
+ }
242
+ if (isPrivate) {
243
+ if (kind === 1) {
244
+ ret.push(function(instance, args) {
245
+ return value.get.call(instance, args);
246
+ });
247
+ ret.push(function(instance, args) {
248
+ return value.set.call(instance, args);
249
+ });
250
+ } else if (kind === 2) {
251
+ ret.push(value);
252
+ } else {
253
+ ret.push(function(instance, args) {
254
+ return value.call(instance, args);
255
+ });
256
+ }
257
+ } else {
258
+ Object.defineProperty(base, name, desc);
259
+ }
260
+ }
261
+ }
262
+ function applyMemberDecs(Class, decInfos, metadata) {
263
+ var ret = [];
264
+ var protoInitializers;
265
+ var staticInitializers;
266
+ var existingProtoNonFields = new Map();
267
+ var existingStaticNonFields = new Map();
268
+ for(var i = 0; i < decInfos.length; i++){
269
+ var decInfo = decInfos[i];
270
+ if (!Array.isArray(decInfo)) continue;
271
+ var kind = decInfo[1];
272
+ var name = decInfo[2];
273
+ var isPrivate = decInfo.length > 3;
274
+ var isStatic = kind >= 5;
275
+ var base;
276
+ var initializers;
277
+ if (isStatic) {
278
+ base = Class;
279
+ kind = kind - 5;
280
+ staticInitializers = staticInitializers || [];
281
+ initializers = staticInitializers;
282
+ } else {
283
+ base = Class.prototype;
284
+ protoInitializers = protoInitializers || [];
285
+ initializers = protoInitializers;
286
+ }
287
+ if (kind !== 0 && !isPrivate) {
288
+ var existingNonFields = isStatic ? existingStaticNonFields : existingProtoNonFields;
289
+ var existingKind = existingNonFields.get(name) || 0;
290
+ if (existingKind === true || existingKind === 3 && kind !== 4 || existingKind === 4 && kind !== 3) {
291
+ throw new Error("Attempted to decorate a public method/accessor that has the same name as a previously decorated public method/accessor. This is not currently supported by the decorators plugin. Property name was: " + name);
292
+ } else if (!existingKind && kind > 2) {
293
+ existingNonFields.set(name, kind);
294
+ } else {
295
+ existingNonFields.set(name, true);
296
+ }
297
+ }
298
+ applyMemberDec(ret, base, decInfo, name, kind, isStatic, isPrivate, initializers, metadata);
299
+ }
300
+ pushInitializers(ret, protoInitializers);
301
+ pushInitializers(ret, staticInitializers);
302
+ return ret;
303
+ }
304
+ function pushInitializers(ret, initializers) {
305
+ if (initializers) {
306
+ ret.push(function(instance) {
307
+ for(var i = 0; i < initializers.length; i++){
308
+ initializers[i].call(instance);
309
+ }
310
+ return instance;
311
+ });
312
+ }
313
+ }
314
+ function applyClassDecs(targetClass, classDecs, metadata) {
315
+ if (classDecs.length > 0) {
316
+ var initializers = [];
317
+ var newClass = targetClass;
318
+ var name = targetClass.name;
319
+ for(var i = classDecs.length - 1; i >= 0; i--){
320
+ var decoratorFinishedRef = {
321
+ v: false
322
+ };
323
+ try {
324
+ var nextNewClass = classDecs[i](newClass, {
325
+ kind: "class",
326
+ name: name,
327
+ addInitializer: createAddInitializerMethod(initializers, decoratorFinishedRef),
328
+ metadata
329
+ });
330
+ } finally{
331
+ decoratorFinishedRef.v = true;
332
+ }
333
+ if (nextNewClass !== undefined) {
334
+ assertValidReturnValue(10, nextNewClass);
335
+ newClass = nextNewClass;
336
+ }
337
+ }
338
+ return [
339
+ defineMetadata(newClass, metadata),
340
+ function() {
341
+ for(var i = 0; i < initializers.length; i++){
342
+ initializers[i].call(newClass);
343
+ }
344
+ }
345
+ ];
346
+ }
347
+ }
348
+ function defineMetadata(Class, metadata) {
349
+ return Object.defineProperty(Class, Symbol.metadata || Symbol.for("Symbol.metadata"), {
350
+ configurable: true,
351
+ enumerable: true,
352
+ value: metadata
353
+ });
354
+ }
355
+ return function applyDecs2203R(targetClass, memberDecs, classDecs, parentClass) {
356
+ if (parentClass !== void 0) {
357
+ var parentMetadata = parentClass[Symbol.metadata || Symbol.for("Symbol.metadata")];
358
+ }
359
+ var metadata = Object.create(parentMetadata === void 0 ? null : parentMetadata);
360
+ var e = applyMemberDecs(targetClass, memberDecs, metadata);
361
+ if (!classDecs.length) defineMetadata(targetClass, metadata);
362
+ return {
363
+ e: e,
364
+ get c () {
365
+ return applyClassDecs(targetClass, classDecs, metadata);
366
+ }
367
+ };
368
+ };
369
+ }
370
+ function _apply_decs_2203_r(targetClass, memberDecs, classDecs, parentClass) {
371
+ return (_apply_decs_2203_r = applyDecs2203RFactory())(targetClass, memberDecs, classDecs, parentClass);
372
+ }
373
+ var _dec, _dec1, _dec2, _dec3, _initProto;
374
+ import { asyncPool } from '@aztec/foundation/async-pool';
375
+ import { maxBigint } from '@aztec/foundation/bigint';
376
+ import { BlockNumber, CheckpointNumber } from '@aztec/foundation/branded-types';
377
+ import { Buffer16, Buffer32 } from '@aztec/foundation/buffer';
378
+ import { pick } from '@aztec/foundation/collection';
379
+ import { createLogger } from '@aztec/foundation/log';
380
+ import { retryTimes } from '@aztec/foundation/retry';
381
+ import { count } from '@aztec/foundation/string';
382
+ import { Timer, elapsed } from '@aztec/foundation/timer';
383
+ import { isDefined, isErrorClass } from '@aztec/foundation/types';
384
+ import { L2BlockSourceEvents } from '@aztec/stdlib/block';
385
+ import { getEpochAtSlot, getSlotAtNextL1Block } from '@aztec/stdlib/epoch-helpers';
386
+ import { computeInHashFromL1ToL2Messages } from '@aztec/stdlib/messaging';
387
+ import { execInSpan, trackSpan } from '@aztec/telemetry-client';
388
+ import { InitialCheckpointNumberNotSequentialError } from '../errors.js';
389
+ import { retrieveCheckpointsFromRollup, retrieveL1ToL2Message, retrieveL1ToL2Messages, retrievedToPublishedCheckpoint } from '../l1/data_retrieval.js';
390
+ import { MessageStoreError } from '../store/message_store.js';
391
+ import { ArchiverDataStoreUpdater } from './data_store_updater.js';
392
+ import { validateCheckpointAttestations } from './validation.js';
393
+ _dec = trackSpan('Archiver.syncFromL1'), _dec1 = trackSpan('Archiver.handleEpochPrune'), _dec2 = trackSpan('Archiver.handleL1ToL2Messages'), _dec3 = trackSpan('Archiver.handleCheckpoints');
394
+ /**
395
+ * Handles L1 synchronization for the archiver.
396
+ * Responsible for fetching checkpoints, L1→L2 messages, and handling L1 reorgs.
397
+ */ export class ArchiverL1Synchronizer {
398
+ publicClient;
399
+ debugClient;
400
+ rollup;
401
+ inbox;
402
+ store;
403
+ config;
404
+ blobClient;
405
+ epochCache;
406
+ dateProvider;
407
+ instrumentation;
408
+ l1Constants;
409
+ events;
410
+ log;
411
+ static{
412
+ ({ e: [_initProto] } = _apply_decs_2203_r(this, [
413
+ [
414
+ _dec,
415
+ 2,
416
+ "syncFromL1"
417
+ ],
418
+ [
419
+ _dec1,
420
+ 2,
421
+ "handleEpochPrune"
422
+ ],
423
+ [
424
+ _dec2,
425
+ 2,
426
+ "handleL1ToL2Messages"
427
+ ],
428
+ [
429
+ _dec3,
430
+ 2,
431
+ "handleCheckpoints"
432
+ ]
433
+ ], []));
434
+ }
435
+ l1BlockNumber;
436
+ l1BlockHash;
437
+ l1Timestamp;
438
+ updater;
439
+ tracer;
440
+ constructor(publicClient, debugClient, rollup, inbox, store, config, blobClient, epochCache, dateProvider, instrumentation, l1Constants, events, tracer, l2TipsCache, log = createLogger('archiver:l1-sync')){
441
+ this.publicClient = publicClient;
442
+ this.debugClient = debugClient;
443
+ this.rollup = rollup;
444
+ this.inbox = inbox;
445
+ this.store = store;
446
+ this.config = config;
447
+ this.blobClient = blobClient;
448
+ this.epochCache = epochCache;
449
+ this.dateProvider = dateProvider;
450
+ this.instrumentation = instrumentation;
451
+ this.l1Constants = l1Constants;
452
+ this.events = events;
453
+ this.log = log;
454
+ _initProto(this);
455
+ this.updater = new ArchiverDataStoreUpdater(this.store, l2TipsCache, {
456
+ rollupManaLimit: l1Constants.rollupManaLimit
457
+ });
458
+ this.tracer = tracer;
459
+ }
460
+ /** Sets new config */ setConfig(newConfig) {
461
+ this.config = newConfig;
462
+ }
463
+ /** Returns the last L1 block number that was synced. */ getL1BlockNumber() {
464
+ return this.l1BlockNumber;
465
+ }
466
+ /** Returns the last L1 timestamp that was synced. */ getL1Timestamp() {
467
+ return this.l1Timestamp;
468
+ }
469
+ /** Checks that the ethereum node we are connected to has a latest timestamp no more than the allowed drift. Throw if not. */ async testEthereumNodeSynced() {
470
+ const maxAllowedDelay = this.config.maxAllowedEthClientDriftSeconds;
471
+ if (maxAllowedDelay === 0) {
472
+ return;
473
+ }
474
+ const { number, timestamp: l1Timestamp } = await this.publicClient.getBlock({
475
+ includeTransactions: false
476
+ });
477
+ const currentTime = BigInt(this.dateProvider.nowInSeconds());
478
+ if (currentTime - l1Timestamp > BigInt(maxAllowedDelay)) {
479
+ throw new Error(`Ethereum node is out of sync (last block synced ${number} at ${l1Timestamp} vs current time ${currentTime})`);
480
+ }
481
+ }
482
+ async syncFromL1(initialSyncComplete) {
483
+ // In between the various calls to L1, the block number can move meaning some of the following
484
+ // calls will return data for blocks that were not present during earlier calls. To combat this
485
+ // we ensure that all data retrieval methods only retrieve data up to the currentBlockNumber
486
+ // captured at the top of this function.
487
+ const currentL1Block = await this.publicClient.getBlock({
488
+ includeTransactions: false
489
+ });
490
+ const currentL1BlockNumber = currentL1Block.number;
491
+ const currentL1BlockHash = Buffer32.fromString(currentL1Block.hash);
492
+ const currentL1Timestamp = currentL1Block.timestamp;
493
+ const currentL1BlockData = {
494
+ l1BlockNumber: currentL1BlockNumber,
495
+ l1BlockHash: currentL1BlockHash
496
+ };
497
+ if (this.l1BlockHash && currentL1BlockHash.equals(this.l1BlockHash)) {
498
+ this.log.trace(`No new L1 blocks since last sync at L1 block ${this.l1BlockNumber}`);
499
+ return;
500
+ }
501
+ // Warn if the latest L1 block timestamp is too old
502
+ const maxAllowedDelay = this.config.maxAllowedEthClientDriftSeconds;
503
+ const now = this.dateProvider.nowInSeconds();
504
+ if (maxAllowedDelay > 0 && Number(currentL1Timestamp) <= now - maxAllowedDelay) {
505
+ this.log.warn(`Latest L1 block ${currentL1BlockNumber} timestamp ${currentL1Timestamp} is too old. Make sure your Ethereum node is synced.`, {
506
+ currentL1BlockNumber,
507
+ currentL1Timestamp,
508
+ now,
509
+ maxAllowedDelay
510
+ });
511
+ }
512
+ // Load sync point for blocks defaulting to start block
513
+ const { blocksSynchedTo = this.l1Constants.l1StartBlock } = await this.store.getSynchPoint();
514
+ this.log.debug(`Starting new archiver sync iteration`, {
515
+ blocksSynchedTo,
516
+ currentL1BlockData
517
+ });
518
+ // Sync L1 to L2 messages. We retry this a few times since there are error conditions that reset the sync point, requiring a new iteration.
519
+ // Note that we cannot just wait for the l1 synchronizer to loop again, since the synchronizer would report as synced up to the current L1
520
+ // block, when that wouldn't be the case, since L1 to L2 messages would need another iteration.
521
+ await retryTimes(()=>this.handleL1ToL2Messages(currentL1BlockData), 'Handling L1 to L2 messages', 3, 0.1);
522
+ if (currentL1BlockNumber > blocksSynchedTo) {
523
+ // First we retrieve new checkpoints and L2 blocks and store them in the DB. This will also update the
524
+ // pending chain validation status, proven checkpoint number, and synched L1 block number.
525
+ const rollupStatus = await this.handleCheckpoints(blocksSynchedTo, currentL1BlockNumber, initialSyncComplete);
526
+ // Then we try pruning uncheckpointed blocks if a new slot was mined without checkpoints
527
+ await this.pruneUncheckpointedBlocks(currentL1Timestamp);
528
+ // Then we prune the current epoch if it'd reorg on next submission.
529
+ // Note that we don't do this before retrieving checkpoints because we may need to retrieve
530
+ // checkpoints from more than 2 epochs ago, so we want to make sure we have the latest view of
531
+ // the chain locally before we start unwinding stuff. This can be optimized by figuring out
532
+ // up to which point we're pruning, and then requesting checkpoints up to that point only.
533
+ const { rollupCanPrune } = await this.handleEpochPrune(rollupStatus.provenCheckpointNumber, currentL1BlockNumber, currentL1Timestamp);
534
+ // If the last checkpoint we processed had an invalid attestation, we manually advance the L1 syncpoint
535
+ // past it, since otherwise we'll keep downloading it and reprocessing it on every iteration until
536
+ // we get a valid checkpoint to advance the syncpoint.
537
+ if (!rollupStatus.validationResult?.valid && rollupStatus.lastL1BlockWithCheckpoint !== undefined) {
538
+ await this.store.setCheckpointSynchedL1BlockNumber(rollupStatus.lastL1BlockWithCheckpoint);
539
+ }
540
+ // And lastly we check if we are missing any checkpoints behind us due to a possible L1 reorg.
541
+ // We only do this if rollup cant prune on the next submission. Otherwise we will end up
542
+ // re-syncing the checkpoints we have just unwound above. We also dont do this if the last checkpoint is invalid,
543
+ // since the archiver will rightfully refuse to sync up to it.
544
+ if (!rollupCanPrune && rollupStatus.validationResult?.valid) {
545
+ await this.checkForNewCheckpointsBeforeL1SyncPoint(rollupStatus, blocksSynchedTo, currentL1BlockNumber);
546
+ }
547
+ this.instrumentation.updateL1BlockHeight(currentL1BlockNumber);
548
+ }
549
+ // Update the finalized L2 checkpoint based on L1 finality.
550
+ await this.updateFinalizedCheckpoint();
551
+ // After syncing has completed, update the current l1 block number and timestamp,
552
+ // otherwise we risk announcing to the world that we've synced to a given point,
553
+ // but the corresponding blocks have not been processed (see #12631).
554
+ this.l1Timestamp = currentL1Timestamp;
555
+ this.l1BlockNumber = currentL1BlockNumber;
556
+ this.l1BlockHash = currentL1BlockHash;
557
+ const l1BlockNumberAtEnd = await this.publicClient.getBlockNumber();
558
+ this.log.debug(`Archiver sync iteration complete`, {
559
+ l1BlockNumberAtStart: currentL1BlockNumber,
560
+ l1TimestampAtStart: currentL1Timestamp,
561
+ l1BlockNumberAtEnd
562
+ });
563
+ }
564
+ /** Query L1 for its finalized block and update the finalized checkpoint accordingly. */ async updateFinalizedCheckpoint() {
565
+ try {
566
+ const finalizedL1Block = await this.publicClient.getBlock({
567
+ blockTag: 'finalized',
568
+ includeTransactions: false
569
+ });
570
+ const finalizedL1BlockNumber = finalizedL1Block.number;
571
+ const finalizedCheckpointNumber = await this.rollup.getProvenCheckpointNumber({
572
+ blockNumber: finalizedL1BlockNumber
573
+ });
574
+ const localFinalizedCheckpointNumber = await this.store.getFinalizedCheckpointNumber();
575
+ if (localFinalizedCheckpointNumber !== finalizedCheckpointNumber) {
576
+ await this.updater.setFinalizedCheckpointNumber(finalizedCheckpointNumber);
577
+ this.log.info(`Updated finalized chain to checkpoint ${finalizedCheckpointNumber}`, {
578
+ finalizedCheckpointNumber,
579
+ finalizedL1BlockNumber
580
+ });
581
+ }
582
+ } catch (err) {
583
+ // The rollup contract may not exist at the finalized L1 block right after deployment.
584
+ if (!err?.message?.includes('returned no data')) {
585
+ this.log.warn(`Failed to update finalized checkpoint: ${err}`);
586
+ }
587
+ }
588
+ }
589
+ /** Prune all proposed local blocks that should have been checkpointed by now. */ async pruneUncheckpointedBlocks(currentL1Timestamp) {
590
+ const [lastCheckpointedBlockNumber, lastProposedBlockNumber] = await Promise.all([
591
+ this.store.getCheckpointedL2BlockNumber(),
592
+ this.store.getLatestBlockNumber()
593
+ ]);
594
+ // If there are no uncheckpointed blocks, we got nothing to do
595
+ if (lastProposedBlockNumber === lastCheckpointedBlockNumber) {
596
+ this.log.trace(`No uncheckpointed blocks to prune.`);
597
+ return;
598
+ }
599
+ // What's the slot at the next L1 block? All blocks for slots strictly before this one should've been checkpointed by now.
600
+ const slotAtNextL1Block = getSlotAtNextL1Block(currentL1Timestamp, this.l1Constants);
601
+ const firstUncheckpointedBlockNumber = BlockNumber(lastCheckpointedBlockNumber + 1);
602
+ // What's the slot of the first uncheckpointed block?
603
+ const [firstUncheckpointedBlockHeader] = await this.store.getBlockHeaders(firstUncheckpointedBlockNumber, 1);
604
+ const firstUncheckpointedBlockSlot = firstUncheckpointedBlockHeader?.getSlot();
605
+ if (firstUncheckpointedBlockSlot === undefined || firstUncheckpointedBlockSlot >= slotAtNextL1Block) {
606
+ return;
607
+ }
608
+ // Prune provisional blocks from slots that have ended without being checkpointed.
609
+ // This also clears any proposed checkpoint whose blocks are being pruned.
610
+ this.log.warn(`Pruning blocks after block ${lastCheckpointedBlockNumber} due to slot ${firstUncheckpointedBlockSlot} not being checkpointed`, {
611
+ firstUncheckpointedBlockHeader: firstUncheckpointedBlockHeader.toInspect(),
612
+ slotAtNextL1Block
613
+ });
614
+ const prunedBlocks = await this.updater.removeUncheckpointedBlocksAfter(lastCheckpointedBlockNumber);
615
+ if (prunedBlocks.length > 0) {
616
+ this.events.emit(L2BlockSourceEvents.L2PruneUncheckpointed, {
617
+ type: L2BlockSourceEvents.L2PruneUncheckpointed,
618
+ slotNumber: firstUncheckpointedBlockSlot,
619
+ blocks: prunedBlocks
620
+ });
621
+ }
622
+ }
623
+ /** Queries the rollup contract on whether a prune can be executed on the immediate next L1 block. */ async canPrune(currentL1BlockNumber, currentL1Timestamp) {
624
+ const time = (currentL1Timestamp ?? 0n) + BigInt(this.l1Constants.ethereumSlotDuration);
625
+ const result = await this.rollup.canPruneAtTime(time, {
626
+ blockNumber: currentL1BlockNumber
627
+ });
628
+ if (result) {
629
+ this.log.debug(`Rollup contract allows pruning at L1 block ${currentL1BlockNumber} time ${time}`, {
630
+ currentL1Timestamp,
631
+ pruneTime: time,
632
+ currentL1BlockNumber
633
+ });
634
+ }
635
+ return result;
636
+ }
637
+ /** Checks if there'd be a reorg for the next checkpoint submission and start pruning now. */ async handleEpochPrune(provenCheckpointNumber, currentL1BlockNumber, currentL1Timestamp) {
638
+ const rollupCanPrune = await this.canPrune(currentL1BlockNumber, currentL1Timestamp);
639
+ const localPendingCheckpointNumber = await this.store.getSynchedCheckpointNumber();
640
+ const canPrune = localPendingCheckpointNumber > provenCheckpointNumber && rollupCanPrune;
641
+ if (canPrune) {
642
+ const timer = new Timer();
643
+ const pruneFrom = CheckpointNumber(provenCheckpointNumber + 1);
644
+ const header = await this.getCheckpointHeader(pruneFrom);
645
+ if (header === undefined) {
646
+ throw new Error(`Missing checkpoint header ${pruneFrom}`);
647
+ }
648
+ const pruneFromSlotNumber = header.slotNumber;
649
+ const pruneFromEpochNumber = getEpochAtSlot(pruneFromSlotNumber, this.l1Constants);
650
+ const checkpointsToUnwind = localPendingCheckpointNumber - provenCheckpointNumber;
651
+ // Fetch checkpoints and blocks in bounded batches to avoid unbounded concurrent
652
+ // promises when the gap between local pending and proven checkpoint numbers is large.
653
+ const BATCH_SIZE = 10;
654
+ const indices = Array.from({
655
+ length: checkpointsToUnwind
656
+ }, (_, i)=>CheckpointNumber(i + pruneFrom));
657
+ const checkpoints = (await asyncPool(BATCH_SIZE, indices, (idx)=>this.store.getCheckpointData(idx))).filter(isDefined);
658
+ const newBlocks = (await asyncPool(BATCH_SIZE, checkpoints, (cp)=>this.store.getBlocksForCheckpoint(CheckpointNumber(cp.checkpointNumber)))).filter(isDefined).flat();
659
+ // Emit an event for listening services to react to the chain prune
660
+ this.events.emit(L2BlockSourceEvents.L2PruneUnproven, {
661
+ type: L2BlockSourceEvents.L2PruneUnproven,
662
+ epochNumber: pruneFromEpochNumber,
663
+ blocks: newBlocks
664
+ });
665
+ this.log.debug(`L2 prune from ${provenCheckpointNumber + 1} to ${localPendingCheckpointNumber} will occur on next checkpoint submission.`);
666
+ await this.updater.removeCheckpointsAfter(provenCheckpointNumber);
667
+ this.log.warn(`Removed ${count(checkpointsToUnwind, 'checkpoint')} after checkpoint ${provenCheckpointNumber} ` + `due to predicted reorg at L1 block ${currentL1BlockNumber}. ` + `Updated latest checkpoint is ${await this.store.getSynchedCheckpointNumber()}.`);
668
+ this.instrumentation.processPrune(timer.ms());
669
+ // TODO(palla/reorg): Do we need to set the block synched L1 block number here?
670
+ // Seems like the next iteration should handle this.
671
+ // await this.store.setCheckpointSynchedL1BlockNumber(currentL1BlockNumber);
672
+ }
673
+ return {
674
+ rollupCanPrune
675
+ };
676
+ }
677
+ nextRange(end, limit) {
678
+ const batchSize = this.config.batchSize * this.l1Constants.slotDuration / this.l1Constants.ethereumSlotDuration;
679
+ const nextStart = end + 1n;
680
+ const nextEnd = nextStart + BigInt(batchSize);
681
+ if (nextEnd > limit) {
682
+ return [
683
+ nextStart,
684
+ limit
685
+ ];
686
+ }
687
+ return [
688
+ nextStart,
689
+ nextEnd
690
+ ];
691
+ }
692
+ async handleL1ToL2Messages(currentL1Block) {
693
+ // Load the syncpoint, which may have been updated in a previous iteration
694
+ const { messagesSynchedTo = {
695
+ l1BlockNumber: this.l1Constants.l1StartBlock,
696
+ l1BlockHash: this.l1Constants.l1StartBlockHash
697
+ } } = await this.store.getSynchPoint();
698
+ // Nothing to do if L1 block number has not moved forward
699
+ const currentL1BlockNumber = currentL1Block.l1BlockNumber;
700
+ if (currentL1BlockNumber <= messagesSynchedTo.l1BlockNumber) {
701
+ return true;
702
+ }
703
+ // Compare local message store state with the remote. If they match, we just advance the match pointer.
704
+ const remoteMessagesState = await this.inbox.getState({
705
+ blockNumber: currentL1BlockNumber
706
+ });
707
+ const localLastMessage = await this.store.getLastL1ToL2Message();
708
+ if (await this.localStateMatches(localLastMessage, remoteMessagesState)) {
709
+ this.log.trace(`Local L1 to L2 messages are already in sync with remote at L1 block ${currentL1BlockNumber}`);
710
+ await this.store.setMessageSyncState(currentL1Block, remoteMessagesState.treeInProgress);
711
+ return true;
712
+ }
713
+ // If not, then we are out of sync. Most likely there are new messages on the inbox, so we try retrieving them.
714
+ // However, it could also be the case that there was an L1 reorg and our syncpoint is no longer valid.
715
+ // If that's the case, we'd get an exception out of the message store since the rolling hash of the first message
716
+ // we try to insert would not match the one in the db, in which case we rollback to the last common message with L1.
717
+ try {
718
+ await this.retrieveAndStoreMessages(messagesSynchedTo.l1BlockNumber, currentL1BlockNumber);
719
+ } catch (error) {
720
+ if (isErrorClass(error, MessageStoreError)) {
721
+ this.log.warn(`Failed to store L1 to L2 messages retrieved from L1: ${error.message}. Rolling back syncpoint to retry.`, {
722
+ inboxMessage: error.inboxMessage
723
+ });
724
+ await this.rollbackL1ToL2Messages(remoteMessagesState.treeInProgress);
725
+ return false;
726
+ }
727
+ throw error;
728
+ }
729
+ // Note that, if there are no new messages to insert, but there was an L1 reorg that pruned out last messages,
730
+ // we'd notice by comparing our local state with the remote one again, and seeing they don't match even after
731
+ // our sync attempt. In this case, we also rollback our syncpoint, and trigger a retry.
732
+ const localLastMessageAfterSync = await this.store.getLastL1ToL2Message();
733
+ if (!await this.localStateMatches(localLastMessageAfterSync, remoteMessagesState)) {
734
+ this.log.warn(`Local L1 to L2 messages state does not match remote after sync attempt. Rolling back syncpoint to retry.`, {
735
+ localLastMessageAfterSync,
736
+ remoteMessagesState
737
+ });
738
+ await this.rollbackL1ToL2Messages(remoteMessagesState.treeInProgress);
739
+ return false;
740
+ }
741
+ // Advance the syncpoint after a successful sync
742
+ await this.store.setMessageSyncState(currentL1Block, remoteMessagesState.treeInProgress);
743
+ return true;
744
+ }
745
+ /** Checks if the local rolling hash and message count matches the remote state */ async localStateMatches(localLastMessage, remoteState) {
746
+ const localMessageCount = await this.store.getTotalL1ToL2MessageCount();
747
+ this.log.trace(`Comparing local and remote inbox state`, {
748
+ localMessageCount,
749
+ localLastMessage,
750
+ remoteState
751
+ });
752
+ return remoteState.totalMessagesInserted === localMessageCount && remoteState.messagesRollingHash.equals(localLastMessage?.rollingHash ?? Buffer16.ZERO);
753
+ }
754
+ /** Retrieves L1 to L2 messages from L1 in batches and stores them. */ async retrieveAndStoreMessages(fromL1Block, toL1Block) {
755
+ let searchStartBlock = 0n;
756
+ let searchEndBlock = fromL1Block;
757
+ let lastMessage;
758
+ let messageCount = 0;
759
+ do {
760
+ [searchStartBlock, searchEndBlock] = this.nextRange(searchEndBlock, toL1Block);
761
+ this.log.trace(`Retrieving L1 to L2 messages in L1 blocks ${searchStartBlock}-${searchEndBlock}`);
762
+ const messages = await retrieveL1ToL2Messages(this.inbox, searchStartBlock, searchEndBlock);
763
+ const timer = new Timer();
764
+ await this.store.addL1ToL2Messages(messages);
765
+ const perMsg = timer.ms() / messages.length;
766
+ this.instrumentation.processNewMessages(messages.length, perMsg);
767
+ for (const msg of messages){
768
+ this.log.debug(`Downloaded L1 to L2 message`, {
769
+ ...msg,
770
+ leaf: msg.leaf.toString()
771
+ });
772
+ lastMessage = msg;
773
+ messageCount++;
774
+ }
775
+ }while (searchEndBlock < toL1Block)
776
+ if (messageCount > 0) {
777
+ this.log.info(`Retrieved ${messageCount} new L1 to L2 messages up to message with index ${lastMessage?.index} for checkpoint ${lastMessage?.checkpointNumber}`, {
778
+ lastMessage,
779
+ messageCount
780
+ });
781
+ }
782
+ }
783
+ /**
784
+ * Rolls back local L1 to L2 messages to the last common message with L1, and updates the syncpoint to the L1 block of that message.
785
+ * If no common message is found, rolls back all messages and sets the syncpoint to the start block.
786
+ */ async rollbackL1ToL2Messages(remoteTreeInProgress) {
787
+ // Slowly go back through our messages until we find the last common message.
788
+ // We could query the logs in batch as an optimization, but the depth of the reorg should not be deep, and this
789
+ // is a very rare case, so it's fine to query one log at a time.
790
+ let commonMsg;
791
+ let messagesToDelete = 0;
792
+ this.log.verbose(`Searching most recent common L1 to L2 message`);
793
+ for await (const localMsg of this.store.iterateL1ToL2Messages({
794
+ reverse: true
795
+ })){
796
+ const remoteMsg = await retrieveL1ToL2Message(this.inbox, localMsg);
797
+ const logCtx = {
798
+ remoteMsg,
799
+ localMsg: localMsg
800
+ };
801
+ if (remoteMsg && remoteMsg.rollingHash.equals(localMsg.rollingHash)) {
802
+ this.log.verbose(`Found most recent common L1 to L2 message at index ${localMsg.index} on L1 block ${localMsg.l1BlockNumber}`, logCtx);
803
+ commonMsg = remoteMsg;
804
+ break;
805
+ } else if (remoteMsg) {
806
+ this.log.debug(`Local L1 to L2 message with index ${localMsg.index} has different rolling hash`, logCtx);
807
+ messagesToDelete++;
808
+ } else {
809
+ this.log.debug(`Local L1 to L2 message with index ${localMsg.index} not found on L1`, logCtx);
810
+ messagesToDelete++;
811
+ }
812
+ }
813
+ // Delete everything after the common message we found, if anything needs to be deleted.
814
+ // Do not exit early if there are no messages to delete, we still want to update the syncpoint.
815
+ if (messagesToDelete > 0) {
816
+ const lastGoodIndex = commonMsg?.index;
817
+ this.log.warn(`Rolling back all local L1 to L2 messages after index ${lastGoodIndex ?? 'initial'}`);
818
+ await this.store.removeL1ToL2Messages(lastGoodIndex !== undefined ? lastGoodIndex + 1n : 0n);
819
+ }
820
+ // Update the syncpoint so the loop below reprocesses the changed messages. We go to the block before
821
+ // the last common one, so we force reprocessing it, in case new messages were added on that same L1 block
822
+ // after the last common message.
823
+ const syncPointL1BlockNumber = commonMsg ? commonMsg.l1BlockNumber - 1n : this.l1Constants.l1StartBlock;
824
+ const syncPointL1BlockHash = await this.getL1BlockHash(syncPointL1BlockNumber);
825
+ const messagesSyncPoint = {
826
+ l1BlockNumber: syncPointL1BlockNumber,
827
+ l1BlockHash: syncPointL1BlockHash
828
+ };
829
+ await this.store.setMessageSyncState(messagesSyncPoint, remoteTreeInProgress);
830
+ this.log.verbose(`Updated messages syncpoint to L1 block ${syncPointL1BlockNumber}`, {
831
+ ...messagesSyncPoint,
832
+ remoteTreeInProgress
833
+ });
834
+ return messagesSyncPoint;
835
+ }
836
+ async getL1BlockHash(l1BlockNumber) {
837
+ const block = await this.publicClient.getBlock({
838
+ blockNumber: l1BlockNumber,
839
+ includeTransactions: false
840
+ });
841
+ if (!block) {
842
+ throw new Error(`Missing L1 block ${l1BlockNumber}`);
843
+ }
844
+ return Buffer32.fromString(block.hash);
845
+ }
846
+ async handleCheckpoints(blocksSynchedTo, currentL1BlockNumber, initialSyncComplete) {
847
+ const localPendingCheckpointNumber = await this.store.getSynchedCheckpointNumber();
848
+ const initialValidationResult = await this.store.getPendingChainValidationStatus();
849
+ const { provenCheckpointNumber, provenArchive, pendingCheckpointNumber, pendingArchive, archiveOfMyCheckpoint: archiveForLocalPendingCheckpointNumber } = await execInSpan(this.tracer, 'Archiver.getRollupStatus', ()=>this.rollup.status(localPendingCheckpointNumber, {
850
+ blockNumber: currentL1BlockNumber
851
+ }));
852
+ const rollupStatus = {
853
+ provenCheckpointNumber,
854
+ provenArchive: provenArchive.toString(),
855
+ pendingCheckpointNumber,
856
+ pendingArchive: pendingArchive.toString(),
857
+ validationResult: initialValidationResult
858
+ };
859
+ this.log.trace(`Retrieved rollup status at current L1 block ${currentL1BlockNumber}.`, {
860
+ localPendingCheckpointNumber,
861
+ blocksSynchedTo,
862
+ currentL1BlockNumber,
863
+ archiveForLocalPendingCheckpointNumber,
864
+ ...rollupStatus
865
+ });
866
+ const updateProvenCheckpoint = async ()=>{
867
+ // Annoying edge case: if proven checkpoint is moved back to 0 due to a reorg at the beginning of the chain,
868
+ // we need to set it to zero. This is an edge case because we dont have a checkpoint zero (initial checkpoint is one),
869
+ // so localCheckpointForDestinationProvenCheckpointNumber would not be found below.
870
+ if (provenCheckpointNumber === 0) {
871
+ const localProvenCheckpointNumber = await this.store.getProvenCheckpointNumber();
872
+ if (localProvenCheckpointNumber !== provenCheckpointNumber) {
873
+ await this.updater.setProvenCheckpointNumber(provenCheckpointNumber);
874
+ this.log.info(`Rolled back proven chain to checkpoint ${provenCheckpointNumber}`, {
875
+ provenCheckpointNumber
876
+ });
877
+ }
878
+ }
879
+ const localCheckpointForDestinationProvenCheckpointNumber = await this.store.getCheckpointData(provenCheckpointNumber);
880
+ // Sanity check. I've hit what seems to be a state where the proven checkpoint is set to a value greater than the latest
881
+ // synched checkpoint when requesting L2Tips from the archiver. This is the only place where the proven checkpoint is set.
882
+ const synched = await this.store.getSynchedCheckpointNumber();
883
+ if (localCheckpointForDestinationProvenCheckpointNumber && synched < localCheckpointForDestinationProvenCheckpointNumber.checkpointNumber) {
884
+ this.log.error(`Hit local checkpoint greater than last synched checkpoint: ${localCheckpointForDestinationProvenCheckpointNumber.checkpointNumber} > ${synched}`);
885
+ }
886
+ this.log.trace(`Local checkpoint for remote proven checkpoint ${provenCheckpointNumber} is ${localCheckpointForDestinationProvenCheckpointNumber?.archive.root.toString() ?? 'undefined'}`);
887
+ if (localCheckpointForDestinationProvenCheckpointNumber && provenArchive.equals(localCheckpointForDestinationProvenCheckpointNumber.archive.root)) {
888
+ const localProvenCheckpointNumber = await this.store.getProvenCheckpointNumber();
889
+ if (localProvenCheckpointNumber !== provenCheckpointNumber) {
890
+ await this.updater.setProvenCheckpointNumber(provenCheckpointNumber);
891
+ this.log.info(`Updated proven chain to checkpoint ${provenCheckpointNumber}`, {
892
+ provenCheckpointNumber
893
+ });
894
+ const provenSlotNumber = localCheckpointForDestinationProvenCheckpointNumber.header.slotNumber;
895
+ const provenEpochNumber = getEpochAtSlot(provenSlotNumber, this.l1Constants);
896
+ const lastBlockNumberInCheckpoint = localCheckpointForDestinationProvenCheckpointNumber.startBlock + localCheckpointForDestinationProvenCheckpointNumber.blockCount - 1;
897
+ this.events.emit(L2BlockSourceEvents.L2BlockProven, {
898
+ type: L2BlockSourceEvents.L2BlockProven,
899
+ blockNumber: BlockNumber(lastBlockNumberInCheckpoint),
900
+ slotNumber: provenSlotNumber,
901
+ epochNumber: provenEpochNumber
902
+ });
903
+ this.instrumentation.updateLastProvenCheckpoint(localCheckpointForDestinationProvenCheckpointNumber);
904
+ } else {
905
+ this.log.trace(`Proven checkpoint ${provenCheckpointNumber} already stored.`);
906
+ }
907
+ }
908
+ };
909
+ // This is an edge case that we only hit if there are no proposed checkpoints.
910
+ // If we have 0 checkpoints locally and there are no checkpoints onchain there is nothing to do.
911
+ const noCheckpoints = localPendingCheckpointNumber === 0 && pendingCheckpointNumber === 0;
912
+ if (noCheckpoints) {
913
+ await this.store.setCheckpointSynchedL1BlockNumber(currentL1BlockNumber);
914
+ this.log.debug(`No checkpoints to retrieve from ${blocksSynchedTo + 1n} to ${currentL1BlockNumber}, no checkpoints on chain`);
915
+ return rollupStatus;
916
+ }
917
+ await updateProvenCheckpoint();
918
+ // Related to the L2 reorgs of the pending chain. We are only interested in actually addressing a reorg if there
919
+ // are any state that could be impacted by it. If we have no checkpoints, there is no impact.
920
+ if (localPendingCheckpointNumber > 0) {
921
+ const localPendingCheckpoint = await this.store.getCheckpointData(localPendingCheckpointNumber);
922
+ if (localPendingCheckpoint === undefined) {
923
+ throw new Error(`Missing checkpoint ${localPendingCheckpointNumber}`);
924
+ }
925
+ const localPendingArchiveRoot = localPendingCheckpoint.archive.root.toString();
926
+ const noCheckpointSinceLast = localPendingCheckpoint && pendingArchive.toString() === localPendingArchiveRoot;
927
+ if (noCheckpointSinceLast) {
928
+ // We believe the following line causes a problem when we encounter L1 re-orgs.
929
+ // Basically, by setting the synched L1 block number here, we are saying that we have
930
+ // processed all checkpoints up to the current L1 block number and we will not attempt to retrieve logs from
931
+ // this block again (or any blocks before).
932
+ // However, in the re-org scenario, our L1 node is temporarily lying to us and we end up potentially missing checkpoints.
933
+ // We must only set this block number based on actually retrieved logs.
934
+ // TODO(#8621): Tackle this properly when we handle L1 Re-orgs.
935
+ // await this.store.setCheckpointSynchedL1BlockNumber(currentL1BlockNumber);
936
+ this.log.debug(`No checkpoints to retrieve from ${blocksSynchedTo + 1n} to ${currentL1BlockNumber}`);
937
+ return rollupStatus;
938
+ }
939
+ const localPendingCheckpointInChain = archiveForLocalPendingCheckpointNumber.equals(localPendingCheckpoint.archive.root);
940
+ if (!localPendingCheckpointInChain) {
941
+ // If our local pending checkpoint tip is not in the chain on L1 a "prune" must have happened
942
+ // or the L1 have reorged.
943
+ // In any case, we have to figure out how far into the past the action will take us.
944
+ // For simplicity here, we will simply rewind until we end in a checkpoint that is also on the chain on L1.
945
+ this.log.debug(`L2 prune has been detected due to local pending checkpoint ${localPendingCheckpointNumber} not in chain`, {
946
+ localPendingCheckpointNumber,
947
+ localPendingArchiveRoot,
948
+ archiveForLocalPendingCheckpointNumber
949
+ });
950
+ let tipAfterUnwind = localPendingCheckpointNumber;
951
+ while(true){
952
+ const candidateCheckpoint = await this.store.getCheckpointData(tipAfterUnwind);
953
+ if (candidateCheckpoint === undefined) {
954
+ break;
955
+ }
956
+ const archiveAtContract = await this.rollup.archiveAt(candidateCheckpoint.checkpointNumber);
957
+ this.log.trace(`Checking local checkpoint ${candidateCheckpoint.checkpointNumber} with archive ${candidateCheckpoint.archive.root}`, {
958
+ archiveAtContract,
959
+ archiveLocal: candidateCheckpoint.archive.root.toString()
960
+ });
961
+ if (archiveAtContract.equals(candidateCheckpoint.archive.root)) {
962
+ break;
963
+ }
964
+ tipAfterUnwind--;
965
+ }
966
+ const checkpointsToRemove = localPendingCheckpointNumber - tipAfterUnwind;
967
+ await this.updater.removeCheckpointsAfter(CheckpointNumber(tipAfterUnwind));
968
+ this.log.warn(`Removed ${count(checkpointsToRemove, 'checkpoint')} after checkpoint ${tipAfterUnwind} ` + `due to mismatched checkpoint hashes at L1 block ${currentL1BlockNumber}. ` + `Updated L2 latest checkpoint is ${await this.store.getSynchedCheckpointNumber()}.`);
969
+ }
970
+ }
971
+ // Retrieve checkpoints in batches. Each batch is estimated to accommodate up to 'blockBatchSize' L1 blocks,
972
+ // computed using the L2 block time vs the L1 block time.
973
+ let searchStartBlock = blocksSynchedTo;
974
+ let searchEndBlock = blocksSynchedTo;
975
+ let lastRetrievedCheckpoint;
976
+ let lastL1BlockWithCheckpoint = undefined;
977
+ do {
978
+ [searchStartBlock, searchEndBlock] = this.nextRange(searchEndBlock, currentL1BlockNumber);
979
+ this.log.trace(`Retrieving checkpoints from L1 block ${searchStartBlock} to ${searchEndBlock}`);
980
+ // TODO(md): Retrieve from blob client then from consensus client, then from peers
981
+ const retrievedCheckpoints = await execInSpan(this.tracer, 'Archiver.retrieveCheckpointsFromRollup', ()=>retrieveCheckpointsFromRollup(this.rollup, this.publicClient, this.debugClient, this.blobClient, searchStartBlock, searchEndBlock, this.instrumentation, this.log, !initialSyncComplete));
982
+ if (retrievedCheckpoints.length === 0) {
983
+ // We are not calling `setBlockSynchedL1BlockNumber` because it may cause sync issues if based off infura.
984
+ // See further details in earlier comments.
985
+ this.log.trace(`Retrieved no new checkpoints from L1 block ${searchStartBlock} to ${searchEndBlock}`);
986
+ continue;
987
+ }
988
+ this.log.debug(`Retrieved ${retrievedCheckpoints.length} new checkpoints between L1 blocks ${searchStartBlock} and ${searchEndBlock}`, {
989
+ lastProcessedCheckpoint: retrievedCheckpoints[retrievedCheckpoints.length - 1].l1,
990
+ searchStartBlock,
991
+ searchEndBlock
992
+ });
993
+ const publishedCheckpoints = await Promise.all(retrievedCheckpoints.map((b)=>retrievedToPublishedCheckpoint(b)));
994
+ const validCheckpoints = [];
995
+ for (const published of publishedCheckpoints){
996
+ const validationResult = this.config.skipValidateCheckpointAttestations ? {
997
+ valid: true
998
+ } : await validateCheckpointAttestations(published, this.epochCache, this.l1Constants, this.log);
999
+ // Only update the validation result if it has changed, so we can keep track of the first invalid checkpoint
1000
+ // in case there is a sequence of more than one invalid checkpoint, as we need to invalidate the first one.
1001
+ // There is an exception though: if a checkpoint is invalidated and replaced with another invalid checkpoint,
1002
+ // we need to update the validation result, since we need to be able to invalidate the new one.
1003
+ // See test 'chain progresses if an invalid checkpoint is invalidated with an invalid one' for more info.
1004
+ if (rollupStatus.validationResult?.valid !== validationResult.valid || !rollupStatus.validationResult.valid && !validationResult.valid && rollupStatus.validationResult.checkpoint.checkpointNumber === validationResult.checkpoint.checkpointNumber) {
1005
+ rollupStatus.validationResult = validationResult;
1006
+ }
1007
+ if (!validationResult.valid) {
1008
+ this.log.warn(`Skipping checkpoint ${published.checkpoint.number} due to invalid attestations`, {
1009
+ checkpointHash: published.checkpoint.hash(),
1010
+ l1BlockNumber: published.l1.blockNumber,
1011
+ ...pick(validationResult, 'reason')
1012
+ });
1013
+ // Emit event for invalid checkpoint detection
1014
+ this.events.emit(L2BlockSourceEvents.InvalidAttestationsCheckpointDetected, {
1015
+ type: L2BlockSourceEvents.InvalidAttestationsCheckpointDetected,
1016
+ validationResult
1017
+ });
1018
+ continue;
1019
+ }
1020
+ // Check the inHash of the checkpoint against the l1->l2 messages.
1021
+ // The messages should've been synced up to the currentL1BlockNumber and must be available for the published
1022
+ // checkpoints we just retrieved.
1023
+ const l1ToL2Messages = await this.store.getL1ToL2Messages(published.checkpoint.number);
1024
+ const computedInHash = computeInHashFromL1ToL2Messages(l1ToL2Messages);
1025
+ const publishedInHash = published.checkpoint.header.inHash;
1026
+ if (!computedInHash.equals(publishedInHash)) {
1027
+ this.log.fatal(`Mismatch inHash for checkpoint ${published.checkpoint.number}`, {
1028
+ checkpointHash: published.checkpoint.hash(),
1029
+ l1BlockNumber: published.l1.blockNumber,
1030
+ computedInHash,
1031
+ publishedInHash
1032
+ });
1033
+ // Throwing an error since this is most likely caused by a bug.
1034
+ throw new Error(`Mismatch inHash for checkpoint ${published.checkpoint.number}. Expected ${computedInHash} but got ${publishedInHash}`);
1035
+ }
1036
+ validCheckpoints.push(published);
1037
+ this.log.debug(`Ingesting new checkpoint ${published.checkpoint.number} with ${published.checkpoint.blocks.length} blocks`, {
1038
+ checkpointHash: published.checkpoint.hash(),
1039
+ l1BlockNumber: published.l1.blockNumber,
1040
+ ...published.checkpoint.header.toInspect(),
1041
+ blocks: published.checkpoint.blocks.map((b)=>b.getStats())
1042
+ });
1043
+ }
1044
+ for (const published of validCheckpoints){
1045
+ this.instrumentation.processCheckpointL1Timing({
1046
+ slotNumber: published.checkpoint.header.slotNumber,
1047
+ l1Timestamp: published.l1.timestamp,
1048
+ l1Constants: this.l1Constants
1049
+ });
1050
+ }
1051
+ try {
1052
+ const updatedValidationResult = rollupStatus.validationResult === initialValidationResult ? undefined : rollupStatus.validationResult;
1053
+ const [processDuration, result] = await elapsed(()=>execInSpan(this.tracer, 'Archiver.addCheckpoints', ()=>this.updater.addCheckpoints(validCheckpoints, updatedValidationResult)));
1054
+ if (validCheckpoints.length > 0) {
1055
+ this.instrumentation.processNewCheckpointedBlocks(processDuration / validCheckpoints.length, validCheckpoints.flatMap((c)=>c.checkpoint.blocks));
1056
+ }
1057
+ // If blocks were pruned due to conflict with L1 checkpoints, emit event
1058
+ if (result.prunedBlocks && result.prunedBlocks.length > 0) {
1059
+ const prunedCheckpointNumber = result.prunedBlocks[0].checkpointNumber;
1060
+ const prunedSlotNumber = result.prunedBlocks[0].header.globalVariables.slotNumber;
1061
+ this.log.info(`Pruned ${result.prunedBlocks.length} mismatching blocks for checkpoint ${prunedCheckpointNumber}`, {
1062
+ prunedBlocks: result.prunedBlocks.map((b)=>b.toBlockInfo()),
1063
+ prunedSlotNumber,
1064
+ prunedCheckpointNumber
1065
+ });
1066
+ // Emit event for listening services to react to the prune.
1067
+ // Note: slotNumber comes from the first pruned block. If pruned blocks theoretically spanned multiple slots,
1068
+ // only one slot number would be reported (though in practice all blocks in a checkpoint span a single slot).
1069
+ this.events.emit(L2BlockSourceEvents.L2PruneUncheckpointed, {
1070
+ type: L2BlockSourceEvents.L2PruneUncheckpointed,
1071
+ slotNumber: prunedSlotNumber,
1072
+ blocks: result.prunedBlocks
1073
+ });
1074
+ }
1075
+ } catch (err) {
1076
+ if (err instanceof InitialCheckpointNumberNotSequentialError) {
1077
+ const { previousCheckpointNumber, newCheckpointNumber } = err;
1078
+ const previousCheckpoint = previousCheckpointNumber ? await this.store.getCheckpointData(CheckpointNumber(previousCheckpointNumber)) : undefined;
1079
+ const updatedL1SyncPoint = previousCheckpoint?.l1.blockNumber ?? this.l1Constants.l1StartBlock;
1080
+ await this.store.setCheckpointSynchedL1BlockNumber(updatedL1SyncPoint);
1081
+ this.log.warn(`Attempting to insert checkpoint ${newCheckpointNumber} with previous block ${previousCheckpointNumber}. Rolling back L1 sync point to ${updatedL1SyncPoint} to try and fetch the missing blocks.`, {
1082
+ previousCheckpointNumber,
1083
+ newCheckpointNumber,
1084
+ updatedL1SyncPoint
1085
+ });
1086
+ }
1087
+ throw err;
1088
+ }
1089
+ for (const checkpoint of validCheckpoints){
1090
+ this.log.info(`Downloaded checkpoint ${checkpoint.checkpoint.number}`, {
1091
+ checkpointHash: checkpoint.checkpoint.hash(),
1092
+ checkpointNumber: checkpoint.checkpoint.number,
1093
+ blockCount: checkpoint.checkpoint.blocks.length,
1094
+ txCount: checkpoint.checkpoint.blocks.reduce((acc, b)=>acc + b.body.txEffects.length, 0),
1095
+ header: checkpoint.checkpoint.header.toInspect(),
1096
+ archiveRoot: checkpoint.checkpoint.archive.root.toString(),
1097
+ archiveNextLeafIndex: checkpoint.checkpoint.archive.nextAvailableLeafIndex
1098
+ });
1099
+ }
1100
+ lastRetrievedCheckpoint = validCheckpoints.at(-1) ?? lastRetrievedCheckpoint;
1101
+ lastL1BlockWithCheckpoint = retrievedCheckpoints.at(-1)?.l1.blockNumber ?? lastL1BlockWithCheckpoint;
1102
+ }while (searchEndBlock < currentL1BlockNumber)
1103
+ // Important that we update AFTER inserting the blocks.
1104
+ await updateProvenCheckpoint();
1105
+ return {
1106
+ ...rollupStatus,
1107
+ lastRetrievedCheckpoint,
1108
+ lastL1BlockWithCheckpoint
1109
+ };
1110
+ }
1111
+ async checkForNewCheckpointsBeforeL1SyncPoint(status, blocksSynchedTo, currentL1BlockNumber) {
1112
+ const { lastRetrievedCheckpoint, pendingCheckpointNumber } = status;
1113
+ // Compare the last checkpoint we have (either retrieved in this round or loaded from store) with what the
1114
+ // rollup contract told us was the latest one (pinned at the currentL1BlockNumber).
1115
+ const latestLocalCheckpointNumber = lastRetrievedCheckpoint?.checkpoint.number ?? await this.store.getSynchedCheckpointNumber();
1116
+ if (latestLocalCheckpointNumber < pendingCheckpointNumber) {
1117
+ // Here we have consumed all logs until the `currentL1Block` we pinned at the beginning of the archiver loop,
1118
+ // but still haven't reached the pending checkpoint according to the call to the rollup contract.
1119
+ // We suspect an L1 reorg that added checkpoints *behind* us. If that is the case, it must have happened between
1120
+ // the last checkpoint we saw and the current one, so we reset the last synched L1 block number. In the edge case
1121
+ // we don't have one, we go back 2 L1 epochs, which is the deepest possible reorg (assuming Casper is working).
1122
+ let latestLocalCheckpointArchive = undefined;
1123
+ let targetL1BlockNumber = maxBigint(currentL1BlockNumber - 64n, 0n);
1124
+ if (lastRetrievedCheckpoint) {
1125
+ latestLocalCheckpointArchive = lastRetrievedCheckpoint.checkpoint.archive.root.toString();
1126
+ targetL1BlockNumber = lastRetrievedCheckpoint.l1.blockNumber;
1127
+ } else if (latestLocalCheckpointNumber > 0) {
1128
+ const checkpoint = await this.store.getRangeOfCheckpoints(latestLocalCheckpointNumber, 1).then(([c])=>c);
1129
+ latestLocalCheckpointArchive = checkpoint.archive.root.toString();
1130
+ targetL1BlockNumber = checkpoint.l1.blockNumber;
1131
+ }
1132
+ this.log.warn(`Failed to reach checkpoint ${pendingCheckpointNumber} at ${currentL1BlockNumber} (latest is ${latestLocalCheckpointNumber}). ` + `Rolling back last synched L1 block number to ${targetL1BlockNumber}.`, {
1133
+ latestLocalCheckpointNumber,
1134
+ latestLocalCheckpointArchive,
1135
+ blocksSynchedTo,
1136
+ currentL1BlockNumber,
1137
+ ...status
1138
+ });
1139
+ await this.store.setCheckpointSynchedL1BlockNumber(targetL1BlockNumber);
1140
+ } else {
1141
+ this.log.trace(`No new checkpoints behind L1 sync point to retrieve.`, {
1142
+ latestLocalCheckpointNumber,
1143
+ pendingCheckpointNumber
1144
+ });
1145
+ }
1146
+ }
1147
+ async getCheckpointHeader(number) {
1148
+ const checkpoint = await this.store.getCheckpointData(number);
1149
+ if (!checkpoint) {
1150
+ return undefined;
1151
+ }
1152
+ return checkpoint.header;
1153
+ }
1154
+ }