1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
package sync
import (
"context"
"testing"
"github.com/stretchr/testify/require"
"github.com/ethereum-optimism/optimism/op-node/rollup"
"github.com/ethereum-optimism/optimism/op-service/eth"
"github.com/ethereum-optimism/optimism/op-service/testlog"
"github.com/ethereum-optimism/optimism/op-service/testutils"
"github.com/ethereum/go-ethereum/common"
"github.com/ethereum/go-ethereum/log"
)
var _ L1Chain = (*testutils.FakeChainSource)(nil)
var _ L2Chain = (*testutils.FakeChainSource)(nil)
// generateFakeL2 creates a fake L2 chain with the following conditions:
// - The L2 chain is based off of the L1 chain
// - The actual L1 chain is the New L1 chain
// - Both heads are at the tip of their respective chains
func (c *syncStartTestCase) generateFakeL2(t *testing.T) (*testutils.FakeChainSource, rollup.Genesis) {
t.Helper()
log := testlog.Logger(t, log.LevelError)
chain := testutils.NewFakeChainSource([]string{c.L1, c.NewL1}, []string{c.L2}, int(c.GenesisL1Num), log)
chain.SetL2Head(len(c.L2) - 1)
genesis := testutils.FakeGenesis(c.GenesisL1, c.GenesisL2, c.GenesisL1Num)
chain.ReorgL1()
for i := 0; i < len(c.NewL1)-1; i++ {
chain.AdvanceL1()
}
return chain, genesis
}
func runeToHash(id rune) common.Hash {
var h common.Hash
copy(h[:], string(id))
return h
}
type syncStartTestCase struct {
Name string
L1 string // L1 Chain prior to a re-org or other change
L2 string // L2 Chain that follows from L1Chain
NewL1 string // New L1 chain
PreFinalizedL2 rune
PreSafeL2 rune
GenesisL1 rune
GenesisL1Num uint64
GenesisL2 rune
SeqWindowSize uint64
SafeL2Head rune
UnsafeL2Head rune
ExpectedErr error
}
func refToRune(r eth.BlockID) rune {
return rune(r.Hash.Bytes()[0])
}
func (c *syncStartTestCase) Run(t *testing.T) {
chain, genesis := c.generateFakeL2(t)
chain.SetL2Finalized(runeToHash(c.PreFinalizedL2))
chain.SetL2Safe(runeToHash(c.PreSafeL2))
cfg := &rollup.Config{
Genesis: genesis,
SeqWindowSize: c.SeqWindowSize,
}
lgr := log.NewLogger(log.DiscardHandler())
result, err := FindL2Heads(context.Background(), cfg, chain, chain, lgr, &Config{})
if c.ExpectedErr != nil {
require.ErrorIs(t, err, c.ExpectedErr, "expected error")
return
} else {
require.NoError(t, err, "expected no error")
}
gotUnsafeHead := refToRune(result.Unsafe.ID())
require.Equal(t, string(c.UnsafeL2Head), string(gotUnsafeHead), "Unsafe L2 Head not equal")
gotSafeHead := refToRune(result.Safe.ID())
require.Equal(t, string(c.SafeL2Head), string(gotSafeHead), "Safe L2 Head not equal")
}
func TestFindSyncStart(t *testing.T) {
testCases := []syncStartTestCase{
{
Name: "already synced",
GenesisL1Num: 0,
L1: "ab",
L2: "AB",
NewL1: "ab",
PreFinalizedL2: 'A',
PreSafeL2: 'A',
GenesisL1: 'a',
GenesisL2: 'A',
UnsafeL2Head: 'B',
SeqWindowSize: 2,
SafeL2Head: 'A',
ExpectedErr: nil,
},
{
Name: "already synced with safe head after genesis",
GenesisL1Num: 0,
L1: "abcdefghijkj",
L2: "ABCDEFGHIJKJ",
NewL1: "abcdefghijkj",
PreFinalizedL2: 'B',
PreSafeL2: 'D',
GenesisL1: 'a',
GenesisL2: 'A',
UnsafeL2Head: 'J',
SeqWindowSize: 2,
// Important this steps back at least one safe block so the safedb is sent the latest safe head
// again - we may be resetting because the safedb failed to write the previous entry
SafeL2Head: 'C',
ExpectedErr: nil,
},
{
Name: "small reorg long chain",
GenesisL1Num: 0,
L1: "abcdefgh",
L2: "ABCDEFGH",
NewL1: "abcdefgx",
PreFinalizedL2: 'B',
PreSafeL2: 'H',
GenesisL1: 'a',
GenesisL2: 'A',
UnsafeL2Head: 'G',
SeqWindowSize: 2,
SafeL2Head: 'C',
ExpectedErr: nil,
},
{
Name: "L1 Chain ahead",
GenesisL1Num: 0,
L1: "abcdef",
L2: "ABCDE",
NewL1: "abcdef",
PreFinalizedL2: 'A',
PreSafeL2: 'D',
GenesisL1: 'a',
GenesisL2: 'A',
UnsafeL2Head: 'E',
SeqWindowSize: 2,
SafeL2Head: 'A',
ExpectedErr: nil,
},
{
Name: "L2 Chain ahead after reorg",
GenesisL1Num: 0,
L1: "abcxyz",
L2: "ABCXYZ",
NewL1: "abcx",
PreFinalizedL2: 'B',
PreSafeL2: 'X',
GenesisL1: 'a',
GenesisL2: 'A',
UnsafeL2Head: 'Z',
SeqWindowSize: 2,
SafeL2Head: 'B',
ExpectedErr: nil,
},
{
Name: "genesis",
GenesisL1Num: 0,
L1: "a",
L2: "A",
NewL1: "a",
PreFinalizedL2: 'A',
PreSafeL2: 'A',
GenesisL1: 'a',
GenesisL2: 'A',
UnsafeL2Head: 'A',
SeqWindowSize: 2,
SafeL2Head: 'A',
ExpectedErr: nil,
},
{
Name: "reorg one step back",
GenesisL1Num: 0,
L1: "abcdefg",
L2: "ABCDEFG",
NewL1: "abcdefx",
PreFinalizedL2: 'A',
PreSafeL2: 'E',
GenesisL1: 'a',
GenesisL2: 'A',
UnsafeL2Head: 'F',
SeqWindowSize: 3,
SafeL2Head: 'A',
ExpectedErr: nil,
},
{
Name: "reorg two steps back, clip genesis and finalized",
GenesisL1Num: 0,
L1: "abc",
L2: "ABC",
PreFinalizedL2: 'A',
PreSafeL2: 'B',
NewL1: "axy",
GenesisL1: 'a',
GenesisL2: 'A',
UnsafeL2Head: 'A',
SeqWindowSize: 2,
SafeL2Head: 'A',
ExpectedErr: nil,
},
{
Name: "reorg three steps back",
GenesisL1Num: 0,
L1: "abcdefgh",
L2: "ABCDEFGH",
NewL1: "abcdexyz",
PreFinalizedL2: 'A',
PreSafeL2: 'D',
GenesisL1: 'a',
GenesisL2: 'A',
UnsafeL2Head: 'E',
SeqWindowSize: 2,
SafeL2Head: 'A',
ExpectedErr: nil,
},
{
Name: "unexpected L1 chain",
GenesisL1Num: 0,
L1: "abcdef",
L2: "ABCDEF",
NewL1: "xyzwio",
PreFinalizedL2: 'A',
PreSafeL2: 'B',
GenesisL1: 'a',
GenesisL2: 'A',
UnsafeL2Head: 0,
SeqWindowSize: 2,
ExpectedErr: WrongChainErr,
},
{
Name: "unexpected L2 chain",
GenesisL1Num: 0,
L1: "abcdef",
L2: "ABCDEF",
NewL1: "xyzwio",
PreFinalizedL2: 'A',
PreSafeL2: 'B',
GenesisL1: 'a',
GenesisL2: 'X',
UnsafeL2Head: 0,
SeqWindowSize: 2,
ExpectedErr: WrongChainErr,
},
{
Name: "offset L2 genesis",
GenesisL1Num: 3,
L1: "abcdefghi",
L2: "DEFGHI",
NewL1: "abcdefghi",
PreFinalizedL2: 'E',
PreSafeL2: 'H',
GenesisL1: 'd',
GenesisL2: 'D',
UnsafeL2Head: 'I',
SeqWindowSize: 2,
SafeL2Head: 'E',
ExpectedErr: nil,
},
{
Name: "offset L2 genesis reorg",
GenesisL1Num: 3,
L1: "abcdefgh",
L2: "DEFGH",
NewL1: "abcdxyzw",
PreFinalizedL2: 'D',
PreSafeL2: 'D',
GenesisL1: 'd',
GenesisL2: 'D',
UnsafeL2Head: 'D',
SeqWindowSize: 2,
SafeL2Head: 'D',
ExpectedErr: nil,
},
{
Name: "reorg past offset genesis",
GenesisL1Num: 3,
L1: "abcdefgh",
L2: "DEFGH",
NewL1: "abxyzwio",
PreFinalizedL2: 'D',
PreSafeL2: 'D',
GenesisL1: 'd',
GenesisL2: 'D',
UnsafeL2Head: 0,
SeqWindowSize: 2,
SafeL2Head: 'D',
ExpectedErr: WrongChainErr,
},
{
// FindL2Heads() keeps walking back to safe head after finding canonical unsafe head
// TooDeepReorgErr must not be raised
Name: "long traverse to safe head",
GenesisL1Num: 0,
L1: "abcdefgh",
L2: "ABCDEFGH",
NewL1: "abcdefgx",
PreFinalizedL2: 'B',
PreSafeL2: 'B',
GenesisL1: 'a',
GenesisL2: 'A',
UnsafeL2Head: 'G',
SeqWindowSize: 1,
SafeL2Head: 'B',
ExpectedErr: nil,
},
{
// L2 reorg is too deep
Name: "reorg too deep",
GenesisL1Num: 0,
L1: "abcdefgh",
L2: "ABCDEFGH",
NewL1: "abijklmn",
PreFinalizedL2: 'B',
PreSafeL2: 'B',
GenesisL1: 'a',
GenesisL2: 'A',
SeqWindowSize: 1,
ExpectedErr: TooDeepReorgErr,
},
}
for _, testCase := range testCases {
t.Run(testCase.Name, testCase.Run)
}
}