|
| 1 | +// Copyright 2024-2026, Offchain Labs, Inc. |
| 2 | +// For license information, see https://github.com/OffchainLabs/nitro/blob/master/LICENSE.md |
| 3 | + |
| 4 | +package gethexec |
| 5 | + |
| 6 | +import ( |
| 7 | + "fmt" |
| 8 | + "math/big" |
| 9 | + "testing" |
| 10 | + |
| 11 | + "github.com/ethereum/go-ethereum/core/rawdb" |
| 12 | +) |
| 13 | + |
| 14 | +func TestClassicOutboxRetrieverGetMsg(t *testing.T) { |
| 15 | + t.Parallel() |
| 16 | + db := rawdb.NewMemoryDatabase() |
| 17 | + |
| 18 | + leaves := [][]byte{ |
| 19 | + []byte("message-0"), |
| 20 | + []byte("message-1"), |
| 21 | + []byte("message-2"), |
| 22 | + []byte("message-3"), |
| 23 | + } |
| 24 | + root, merkleSize, err := BuildClassicMerkleTree(db, leaves) |
| 25 | + if err != nil { |
| 26 | + t.Fatal(err) |
| 27 | + } |
| 28 | + if err := WriteClassicBatchHeader(db, big.NewInt(0), root, merkleSize); err != nil { |
| 29 | + t.Fatal(err) |
| 30 | + } |
| 31 | + |
| 32 | + retriever := NewClassicOutboxRetriever(db) |
| 33 | + |
| 34 | + for i, expected := range leaves { |
| 35 | + msg, err := retriever.GetMsg(big.NewInt(0), uint64(i)) //#nosec G115 |
| 36 | + if err != nil { |
| 37 | + t.Fatalf("GetMsg(batch=0, index=%d) error: %v", i, err) |
| 38 | + } |
| 39 | + if string(msg.Data) != string(expected) { |
| 40 | + t.Errorf("GetMsg(batch=0, index=%d) data = %q, want %q", i, msg.Data, expected) |
| 41 | + } |
| 42 | + if msg.PathInt == nil { |
| 43 | + t.Errorf("GetMsg(batch=0, index=%d) PathInt is nil", i) |
| 44 | + } |
| 45 | + // 4-leaf tree has depth 2, so proof should have 2 sibling nodes |
| 46 | + if len(msg.ProofNodes) != 2 { |
| 47 | + t.Errorf("GetMsg(batch=0, index=%d) proof length = %d, want 2", i, len(msg.ProofNodes)) |
| 48 | + } |
| 49 | + } |
| 50 | +} |
| 51 | + |
| 52 | +func TestClassicOutboxRetrieverSingleLeaf(t *testing.T) { |
| 53 | + t.Parallel() |
| 54 | + db := rawdb.NewMemoryDatabase() |
| 55 | + |
| 56 | + leaves := [][]byte{[]byte("only-message")} |
| 57 | + root, merkleSize, err := BuildClassicMerkleTree(db, leaves) |
| 58 | + if err != nil { |
| 59 | + t.Fatal(err) |
| 60 | + } |
| 61 | + if err := WriteClassicBatchHeader(db, big.NewInt(1), root, merkleSize); err != nil { |
| 62 | + t.Fatal(err) |
| 63 | + } |
| 64 | + |
| 65 | + retriever := NewClassicOutboxRetriever(db) |
| 66 | + msg, err := retriever.GetMsg(big.NewInt(1), 0) |
| 67 | + if err != nil { |
| 68 | + t.Fatalf("GetMsg error: %v", err) |
| 69 | + } |
| 70 | + if string(msg.Data) != "only-message" { |
| 71 | + t.Errorf("data = %q, want %q", msg.Data, "only-message") |
| 72 | + } |
| 73 | + // Single leaf: no merkle traversal needed, so no proof nodes |
| 74 | + if len(msg.ProofNodes) != 0 { |
| 75 | + t.Errorf("proof length = %d, want 0", len(msg.ProofNodes)) |
| 76 | + } |
| 77 | +} |
| 78 | + |
| 79 | +func TestClassicOutboxRetrieverNonPowerOfTwoLeaves(t *testing.T) { |
| 80 | + t.Parallel() |
| 81 | + db := rawdb.NewMemoryDatabase() |
| 82 | + |
| 83 | + // 3 leaves exercises the non-power-of-two branch (bits.OnesCount64 != 1) |
| 84 | + leaves := [][]byte{ |
| 85 | + []byte("leaf-0"), |
| 86 | + []byte("leaf-1"), |
| 87 | + []byte("leaf-2"), |
| 88 | + } |
| 89 | + root, merkleSize, err := BuildClassicMerkleTree(db, leaves) |
| 90 | + if err != nil { |
| 91 | + t.Fatal(err) |
| 92 | + } |
| 93 | + if err := WriteClassicBatchHeader(db, big.NewInt(0), root, merkleSize); err != nil { |
| 94 | + t.Fatal(err) |
| 95 | + } |
| 96 | + |
| 97 | + retriever := NewClassicOutboxRetriever(db) |
| 98 | + for i, expected := range leaves { |
| 99 | + msg, err := retriever.GetMsg(big.NewInt(0), uint64(i)) //#nosec G115 |
| 100 | + if err != nil { |
| 101 | + t.Fatalf("GetMsg(index=%d) error: %v", i, err) |
| 102 | + } |
| 103 | + if string(msg.Data) != string(expected) { |
| 104 | + t.Errorf("GetMsg(index=%d) data = %q, want %q", i, msg.Data, expected) |
| 105 | + } |
| 106 | + } |
| 107 | +} |
| 108 | + |
| 109 | +func TestClassicOutboxRetrieverErrors(t *testing.T) { |
| 110 | + t.Parallel() |
| 111 | + db := rawdb.NewMemoryDatabase() |
| 112 | + |
| 113 | + leaves := [][]byte{[]byte("msg-0"), []byte("msg-1")} |
| 114 | + root, merkleSize, err := BuildClassicMerkleTree(db, leaves) |
| 115 | + if err != nil { |
| 116 | + t.Fatal(err) |
| 117 | + } |
| 118 | + if err := WriteClassicBatchHeader(db, big.NewInt(0), root, merkleSize); err != nil { |
| 119 | + t.Fatal(err) |
| 120 | + } |
| 121 | + |
| 122 | + retriever := NewClassicOutboxRetriever(db) |
| 123 | + |
| 124 | + // Non-existent batch |
| 125 | + _, err = retriever.GetMsg(big.NewInt(99), 0) |
| 126 | + if err == nil { |
| 127 | + t.Error("expected error for non-existent batch, got nil") |
| 128 | + } |
| 129 | + |
| 130 | + // Index out of range |
| 131 | + _, err = retriever.GetMsg(big.NewInt(0), 999) |
| 132 | + if err == nil { |
| 133 | + t.Error("expected error for out-of-range index, got nil") |
| 134 | + } |
| 135 | + |
| 136 | + // Index exactly equal to merkleSize (one past last valid index). |
| 137 | + // Valid indices for merkleSize=2 are 0 and 1; index 2 should be rejected. |
| 138 | + _, err = retriever.GetMsg(big.NewInt(0), merkleSize) |
| 139 | + if err == nil { |
| 140 | + t.Errorf("expected error for index == merkleSize (%d), got nil", merkleSize) |
| 141 | + } |
| 142 | +} |
| 143 | + |
| 144 | +func TestClassicOutboxRetrieverBoundaryIndex(t *testing.T) { |
| 145 | + t.Parallel() |
| 146 | + // Test the boundary between valid and invalid indices across different tree sizes. |
| 147 | + // The last valid index is merkleSize-1; merkleSize itself must be rejected. |
| 148 | + treeSizes := []int{1, 2, 3, 4, 5, 7, 8} |
| 149 | + for _, size := range treeSizes { |
| 150 | + size := size |
| 151 | + t.Run(fmt.Sprintf("size-%d", size), func(t *testing.T) { |
| 152 | + t.Parallel() |
| 153 | + db := rawdb.NewMemoryDatabase() |
| 154 | + leaves := make([][]byte, size) |
| 155 | + for i := range leaves { |
| 156 | + leaves[i] = []byte(fmt.Sprintf("leaf-%d", i)) |
| 157 | + } |
| 158 | + root, merkleSize, err := BuildClassicMerkleTree(db, leaves) |
| 159 | + if err != nil { |
| 160 | + t.Fatal(err) |
| 161 | + } |
| 162 | + if err := WriteClassicBatchHeader(db, big.NewInt(0), root, merkleSize); err != nil { |
| 163 | + t.Fatal(err) |
| 164 | + } |
| 165 | + retriever := NewClassicOutboxRetriever(db) |
| 166 | + |
| 167 | + // Last valid index should succeed |
| 168 | + lastValid := merkleSize - 1 |
| 169 | + msg, err := retriever.GetMsg(big.NewInt(0), lastValid) |
| 170 | + if err != nil { |
| 171 | + t.Fatalf("GetMsg(index=%d) should succeed for merkleSize=%d, got: %v", lastValid, merkleSize, err) |
| 172 | + } |
| 173 | + expected := fmt.Sprintf("leaf-%d", lastValid) |
| 174 | + if string(msg.Data) != expected { |
| 175 | + t.Errorf("GetMsg(index=%d) data = %q, want %q", lastValid, msg.Data, expected) |
| 176 | + } |
| 177 | + |
| 178 | + // First invalid index (== merkleSize) should fail |
| 179 | + _, err = retriever.GetMsg(big.NewInt(0), merkleSize) |
| 180 | + if err == nil { |
| 181 | + t.Errorf("GetMsg(index=%d) should fail for merkleSize=%d", merkleSize, merkleSize) |
| 182 | + } |
| 183 | + |
| 184 | + // One beyond that should also fail |
| 185 | + _, err = retriever.GetMsg(big.NewInt(0), merkleSize+1) |
| 186 | + if err == nil { |
| 187 | + t.Errorf("GetMsg(index=%d) should fail for merkleSize=%d", merkleSize+1, merkleSize) |
| 188 | + } |
| 189 | + }) |
| 190 | + } |
| 191 | +} |
0 commit comments