-
Notifications
You must be signed in to change notification settings - Fork 670
/
block.go
332 lines (288 loc) · 9 KB
/
block.go
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
// Copyright (C) 2019-2023, Ava Labs, Inc. All rights reserved.
// See the file LICENSE for licensing terms.
package executor
import (
"context"
"errors"
"fmt"
"time"
"go.uber.org/zap"
"github.com/ava-labs/avalanchego/chains/atomic"
"github.com/ava-labs/avalanchego/database"
"github.com/ava-labs/avalanchego/ids"
"github.com/ava-labs/avalanchego/snow/choices"
"github.com/ava-labs/avalanchego/snow/consensus/snowman"
"github.com/ava-labs/avalanchego/vms/avm/blocks"
"github.com/ava-labs/avalanchego/vms/avm/states"
"github.com/ava-labs/avalanchego/vms/avm/txs/executor"
)
const SyncBound = 10 * time.Second
var (
_ snowman.Block = (*Block)(nil)
ErrUnexpectedMerkleRoot = errors.New("unexpected merkle root")
ErrTimestampBeyondSyncBound = errors.New("proposed timestamp is too far in the future relative to local time")
ErrEmptyBlock = errors.New("block contains no transactions")
ErrChildBlockEarlierThanParent = errors.New("proposed timestamp before current chain time")
ErrConflictingBlockTxs = errors.New("block contains conflicting transactions")
ErrIncorrectHeight = errors.New("block has incorrect height")
ErrBlockNotFound = errors.New("block not found")
)
// Exported for testing in avm package.
type Block struct {
blocks.Block
manager *manager
rejected bool
}
func (b *Block) Verify(context.Context) error {
blkID := b.ID()
if _, ok := b.manager.blkIDToState[blkID]; ok {
// This block has already been verified.
return nil
}
// Currently we don't populate the blocks merkle root.
merkleRoot := b.Block.MerkleRoot()
if merkleRoot != ids.Empty {
return fmt.Errorf("%w: %s", ErrUnexpectedMerkleRoot, merkleRoot)
}
// Only allow timestamp to reasonably far forward
newChainTime := b.Timestamp()
now := b.manager.clk.Time()
maxNewChainTime := now.Add(SyncBound)
if newChainTime.After(maxNewChainTime) {
return fmt.Errorf(
"%w, proposed time (%s), local time (%s)",
ErrTimestampBeyondSyncBound,
newChainTime,
now,
)
}
txs := b.Txs()
if len(txs) == 0 {
return ErrEmptyBlock
}
// Syntactic verification is generally pretty fast, so we verify this first
// before performing any possible DB reads.
for _, tx := range txs {
err := tx.Unsigned.Visit(&executor.SyntacticVerifier{
Backend: b.manager.backend,
Tx: tx,
})
if err != nil {
txID := tx.ID()
b.manager.mempool.MarkDropped(txID, err)
return err
}
}
// Verify that the parent exists.
parentID := b.Parent()
parent, err := b.manager.GetStatelessBlock(parentID)
if err != nil {
return err
}
// Verify that currentBlkHeight = parentBlkHeight + 1.
expectedHeight := parent.Height() + 1
height := b.Height()
if expectedHeight != height {
return fmt.Errorf(
"%w: expected height %d, got %d",
ErrIncorrectHeight,
expectedHeight,
height,
)
}
stateDiff, err := states.NewDiff(parentID, b.manager)
if err != nil {
return err
}
parentChainTime := stateDiff.GetTimestamp()
// The proposed timestamp must not be before the parent's timestamp.
if newChainTime.Before(parentChainTime) {
return fmt.Errorf(
"%w: proposed timestamp (%s), chain time (%s)",
ErrChildBlockEarlierThanParent,
newChainTime,
parentChainTime,
)
}
stateDiff.SetTimestamp(newChainTime)
blockState := &blockState{
statelessBlock: b.Block,
onAcceptState: stateDiff,
atomicRequests: make(map[ids.ID]*atomic.Requests),
}
for _, tx := range txs {
// Verify that the tx is valid according to the current state of the
// chain.
err := tx.Unsigned.Visit(&executor.SemanticVerifier{
Backend: b.manager.backend,
State: stateDiff,
Tx: tx,
})
if err != nil {
txID := tx.ID()
b.manager.mempool.MarkDropped(txID, err)
return err
}
// Apply the txs state changes to the state.
//
// Note: This must be done inside the same loop as semantic verification
// to ensure that semantic verification correctly accounts for
// transactions that occurred earlier in the block.
executor := &executor.Executor{
Codec: b.manager.backend.Codec,
State: stateDiff,
Tx: tx,
}
err = tx.Unsigned.Visit(executor)
if err != nil {
txID := tx.ID()
b.manager.mempool.MarkDropped(txID, err)
return err
}
// Verify that the transaction we just executed didn't consume inputs
// that were already imported in a previous transaction.
if blockState.importedInputs.Overlaps(executor.Inputs) {
txID := tx.ID()
b.manager.mempool.MarkDropped(txID, ErrConflictingBlockTxs)
return ErrConflictingBlockTxs
}
blockState.importedInputs.Union(executor.Inputs)
// Now that the tx would be marked as accepted, we should add it to the
// state for the next transaction in the block.
stateDiff.AddTx(tx)
for chainID, txRequests := range executor.AtomicRequests {
// Add/merge in the atomic requests represented by [tx]
chainRequests, exists := blockState.atomicRequests[chainID]
if !exists {
blockState.atomicRequests[chainID] = txRequests
continue
}
chainRequests.PutRequests = append(chainRequests.PutRequests, txRequests.PutRequests...)
chainRequests.RemoveRequests = append(chainRequests.RemoveRequests, txRequests.RemoveRequests...)
}
}
// Verify that none of the transactions consumed any inputs that were
// already imported in a currently processing block.
err = b.manager.VerifyUniqueInputs(parentID, blockState.importedInputs)
if err != nil {
return err
}
// Now that the block has been executed, we can add the block data to the
// state diff.
stateDiff.SetLastAccepted(blkID)
stateDiff.AddBlock(b.Block)
b.manager.blkIDToState[blkID] = blockState
b.manager.mempool.Remove(txs)
return nil
}
func (b *Block) Accept(context.Context) error {
blkID := b.ID()
defer b.manager.free(blkID)
b.manager.backend.Ctx.Log.Debug(
"accepting block",
zap.Stringer("blkID", blkID),
zap.Uint64("height", b.Height()),
zap.Stringer("parentID", b.Parent()),
)
txs := b.Txs()
for _, tx := range txs {
if err := b.manager.onAccept(tx); err != nil {
return fmt.Errorf(
"failed to mark tx %q as accepted: %w",
blkID,
err,
)
}
}
b.manager.lastAccepted = blkID
b.manager.mempool.Remove(txs)
blkState, ok := b.manager.blkIDToState[blkID]
if !ok {
return fmt.Errorf("%w: %s", ErrBlockNotFound, blkID)
}
// Update the state to reflect the changes made in [onAcceptState].
blkState.onAcceptState.Apply(b.manager.state)
defer b.manager.state.Abort()
batch, err := b.manager.state.CommitBatch()
if err != nil {
return fmt.Errorf(
"failed to stage state diff for block %s: %w",
blkID,
err,
)
}
// Note that this method writes [batch] to the database.
if err := b.manager.backend.Ctx.SharedMemory.Apply(blkState.atomicRequests, batch); err != nil {
return fmt.Errorf("failed to apply state diff to shared memory: %w", err)
}
return b.manager.metrics.MarkBlockAccepted(b)
}
func (b *Block) Reject(context.Context) error {
blkID := b.ID()
defer b.manager.free(blkID)
b.manager.backend.Ctx.Log.Verbo(
"rejecting block",
zap.Stringer("blkID", blkID),
zap.Uint64("height", b.Height()),
zap.Stringer("parentID", b.Parent()),
)
for _, tx := range b.Txs() {
if err := b.manager.VerifyTx(tx); err != nil {
b.manager.backend.Ctx.Log.Debug("dropping invalidated tx",
zap.Stringer("txID", tx.ID()),
zap.Stringer("blkID", blkID),
zap.Error(err),
)
continue
}
if err := b.manager.mempool.Add(tx); err != nil {
b.manager.backend.Ctx.Log.Debug("dropping valid tx",
zap.Stringer("txID", tx.ID()),
zap.Stringer("blkID", blkID),
zap.Error(err),
)
}
}
b.rejected = true
return nil
}
func (b *Block) Status() choices.Status {
// If this block's reference was rejected, we should report it as rejected.
//
// We don't persist the rejection, but that's fine. The consensus engine
// will hold the same reference to the block until it no longer needs it.
// After the consensus engine has released the reference to the block that
// was verified, it may get a new reference that isn't marked as rejected.
// The consensus engine may then try to issue the block, but will discover
// that it was rejected due to a conflicting block having been accepted.
if b.rejected {
return choices.Rejected
}
blkID := b.ID()
// If this block is the last accepted block, we don't need to go to disk to
// check the status.
if b.manager.lastAccepted == blkID {
return choices.Accepted
}
// Check if the block is in memory. If so, it's processing.
if _, ok := b.manager.blkIDToState[blkID]; ok {
return choices.Processing
}
// Block isn't in memory. Check in the database.
_, err := b.manager.state.GetBlock(blkID)
switch err {
case nil:
return choices.Accepted
case database.ErrNotFound:
// choices.Unknown means we don't have the bytes of the block.
// In this case, we do, so we return choices.Processing.
return choices.Processing
default:
// TODO: correctly report this error to the consensus engine.
b.manager.backend.Ctx.Log.Error(
"dropping unhandled database error",
zap.Error(err),
)
return choices.Processing
}
}