-
Notifications
You must be signed in to change notification settings - Fork 0
/
generate.go
2218 lines (1993 loc) · 77.3 KB
/
generate.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
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// Copyright (c) 2016 The btcsuite developers
// Copyright (c) 2016-2017 The Decred developers
// Copyright (c) 2018-2020 The Hcd developers
// Use of this source code is governed by an ISC
// license that can be found in the LICENSE file.
package fullblocktests
import (
"bytes"
"encoding/binary"
"errors"
"fmt"
"math"
"time"
"github.com/coolsnady/hcd/blockchain"
"github.com/coolsnady/hcd/blockchain/chaingen"
"github.com/coolsnady/hcd/chaincfg/chainec"
"github.com/coolsnady/hcd/chaincfg/chainhash"
"github.com/coolsnady/hcd/dcrec/secp256k1"
"github.com/coolsnady/hcd/txscript"
"github.com/coolsnady/hcd/wire"
"github.com/coolsnady/hcutil"
)
const (
// Intentionally defined here rather than using constants from codebase
// to ensure consensus changes are detected.
maxBlockSigOps = 5000
minCoinbaseScriptLen = 2
maxCoinbaseScriptLen = 100
medianTimeBlocks = 11
maxScriptElementSize = 4096
// numLargeReorgBlocks is the number of blocks to use in the large block
// reorg test (when enabled). This is the equivalent of 2 day's worth
// of blocks.
numLargeReorgBlocks = 576
)
var (
// opTrueScript is a simple public key script that contains the OP_TRUE
// opcode. It is defined here to reduce garbage creation.
opTrueScript = []byte{txscript.OP_TRUE}
// lowFee is a single atom and exists to make the test code more
// readable.
lowFee = hcutil.Amount(1)
)
// TestInstance is an interface that describes a specific test instance returned
// by the tests generated in this package. It should be type asserted to one
// of the concrete test instance types in order to test accordingly.
type TestInstance interface {
FullBlockTestInstance()
}
// AcceptedBlock defines a test instance that expects a block to be accepted to
// the blockchain either by extending the main chain, on a side chain, or as an
// orphan.
type AcceptedBlock struct {
Name string
Block *wire.MsgBlock
IsMainChain bool
IsOrphan bool
}
// Ensure AcceptedBlock implements the TestInstance interface.
var _ TestInstance = AcceptedBlock{}
// FullBlockTestInstance only exists to allow AcceptedBlock to be treated as a
// TestInstance.
//
// This implements the TestInstance interface.
func (b AcceptedBlock) FullBlockTestInstance() {}
// RejectedBlock defines a test instance that expects a block to be rejected by
// the blockchain consensus rules.
type RejectedBlock struct {
Name string
Block *wire.MsgBlock
RejectCode blockchain.ErrorCode
}
// Ensure RejectedBlock implements the TestInstance interface.
var _ TestInstance = RejectedBlock{}
// FullBlockTestInstance only exists to allow RejectedBlock to be treated as a
// TestInstance.
//
// This implements the TestInstance interface.
func (b RejectedBlock) FullBlockTestInstance() {}
// OrphanOrRejectedBlock defines a test instance that expects a block to either
// be accepted as an orphan or rejected. This is useful since some
// implementations might optimize the immediate rejection of orphan blocks when
// their parent was previously rejected, while others might accept it as an
// orphan that eventually gets flushed (since the parent can never be accepted
// to ultimately link it).
type OrphanOrRejectedBlock struct {
Name string
Block *wire.MsgBlock
}
// Ensure ExpectedTip implements the TestInstance interface.
var _ TestInstance = OrphanOrRejectedBlock{}
// FullBlockTestInstance only exists to allow OrphanOrRejectedBlock to be
// treated as a TestInstance.
//
// This implements the TestInstance interface.
func (b OrphanOrRejectedBlock) FullBlockTestInstance() {}
// ExpectedTip defines a test instance that expects a block to be the current
// tip of the main chain.
type ExpectedTip struct {
Name string
Block *wire.MsgBlock
}
// Ensure ExpectedTip implements the TestInstance interface.
var _ TestInstance = ExpectedTip{}
// FullBlockTestInstance only exists to allow ExpectedTip to be treated as a
// TestInstance.
//
// This implements the TestInstance interface.
func (b ExpectedTip) FullBlockTestInstance() {}
// RejectedNonCanonicalBlock defines a test instance that expects a serialized
// block that is not canonical and therefore should be rejected.
type RejectedNonCanonicalBlock struct {
Name string
RawBlock []byte
Height int32
}
// FullBlockTestInstance only exists to allow RejectedNonCanonicalBlock to be
// treated as a TestInstance.
//
// This implements the TestInstance interface.
func (b RejectedNonCanonicalBlock) FullBlockTestInstance() {}
// payToScriptHashScript returns a standard pay-to-script-hash for the provided
// redeem script.
func payToScriptHashScript(redeemScript []byte) []byte {
redeemScriptHash := hcutil.Hash160(redeemScript)
script, err := txscript.NewScriptBuilder().
AddOp(txscript.OP_HASH160).AddData(redeemScriptHash).
AddOp(txscript.OP_EQUAL).Script()
if err != nil {
panic(err)
}
return script
}
// pushDataScript returns a script with the provided items individually pushed
// to the stack.
func pushDataScript(items ...[]byte) []byte {
builder := txscript.NewScriptBuilder()
for _, item := range items {
builder.AddData(item)
}
script, err := builder.Script()
if err != nil {
panic(err)
}
return script
}
// opReturnScript returns a provably-pruneable OP_RETURN script with the
// provided data.
func opReturnScript(data []byte) []byte {
builder := txscript.NewScriptBuilder()
script, err := builder.AddOp(txscript.OP_RETURN).AddData(data).Script()
if err != nil {
panic(err)
}
return script
}
// standardCoinbaseOpReturnScript returns a standard script suitable for use as
// the second output of a standard coinbase transaction of a new block. In
// particular, the serialized data used with the OP_RETURN starts with the block
// height and is followed by 32 bytes which are treated as 4 uint64 extra
// nonces. This implementation puts a cryptographically random value into the
// final extra nonce position. The actual format of the data after the block
// height is not defined however this effectivley mirrors the actual mining code
// at the time it was written.
func standardCoinbaseOpReturnScript(blockHeight uint32) []byte {
rand, err := wire.RandomUint64()
if err != nil {
panic(err)
}
data := make([]byte, 36, 36)
binary.LittleEndian.PutUint32(data[0:4], blockHeight)
binary.LittleEndian.PutUint64(data[28:36], rand)
return opReturnScript(data)
}
// additionalCoinbasePoW returns a function that itself takes a block and
// modifies it by adding the provided amount to the first proof-of-work coinbase
// subsidy.
func additionalCoinbasePoW(amount hcutil.Amount) func(*wire.MsgBlock) {
return func(b *wire.MsgBlock) {
// Increase the first proof-of-work coinbase subsidy by the
// provided amount.
b.Transactions[0].TxOut[2].Value += int64(amount)
}
}
// additionalCoinbaseDev returns a function that itself takes a block and
// modifies it by adding the provided amount to the coinbase developer subsidy.
func additionalCoinbaseDev(amount hcutil.Amount) func(*wire.MsgBlock) {
return func(b *wire.MsgBlock) {
// Increase the first proof-of-work coinbase subsidy by the
// provided amount.
b.Transactions[0].TxOut[0].Value += int64(amount)
}
}
// additionalSpendFee returns a function that itself takes a block and modifies
// it by adding the provided fee to the spending transaction.
//
// NOTE: The coinbase value is NOT updated to reflect the additional fee. Use
// 'additionalCoinbasePoW' for that purpose.
func additionalSpendFee(fee hcutil.Amount) func(*wire.MsgBlock) {
return func(b *wire.MsgBlock) {
// Increase the fee of the spending transaction by reducing the
// amount paid,
if int64(fee) > b.Transactions[1].TxOut[0].Value {
panic(fmt.Sprintf("additionalSpendFee: fee of %d "+
"exceeds available spend transaction value",
fee))
}
b.Transactions[1].TxOut[0].Value -= int64(fee)
}
}
// replaceSpendScript returns a function that itself takes a block and modifies
// it by replacing the public key script of the spending transaction.
func replaceSpendScript(pkScript []byte) func(*wire.MsgBlock) {
return func(b *wire.MsgBlock) {
b.Transactions[1].TxOut[0].PkScript = pkScript
}
}
// replaceCoinbaseSigScript returns a function that itself takes a block and
// modifies it by replacing the signature key script of the coinbase.
func replaceCoinbaseSigScript(script []byte) func(*wire.MsgBlock) {
return func(b *wire.MsgBlock) {
b.Transactions[0].TxIn[0].SignatureScript = script
}
}
// replaceStakeSigScript returns a function that itself takes a block and
// modifies it by replacing the signature script of the first stake transaction.
func replaceStakeSigScript(sigScript []byte) func(*wire.MsgBlock) {
return func(b *wire.MsgBlock) {
b.STransactions[0].TxIn[0].SignatureScript = sigScript
}
}
// additionalPoWTx returns a function that itself takes a block and modifies it
// by adding the the provided transaction to the regular transaction tree.
func additionalPoWTx(tx *wire.MsgTx) func(*wire.MsgBlock) {
return func(b *wire.MsgBlock) {
b.AddTransaction(tx)
}
}
// nonCanonicalVarInt return a variable-length encoded integer that is encoded
// with 9 bytes even though it could be encoded with a minimal canonical
// encoding.
func nonCanonicalVarInt(val uint32) []byte {
var rv [9]byte
rv[0] = 0xff
binary.LittleEndian.PutUint64(rv[1:], uint64(val))
return rv[:]
}
// encodeNonCanonicalBlock serializes the block in a non-canonical way by
// encoding the number of transactions using a variable-length encoded integer
// with 9 bytes even though it should be encoded with a minimal canonical
// encoding.
func encodeNonCanonicalBlock(b *wire.MsgBlock) []byte {
var buf bytes.Buffer
b.Header.BtcEncode(&buf, 0)
buf.Write(nonCanonicalVarInt(uint32(len(b.Transactions))))
for _, tx := range b.Transactions {
tx.BtcEncode(&buf, 0)
}
wire.WriteVarInt(&buf, 0, uint64(len(b.STransactions)))
for _, stx := range b.STransactions {
stx.BtcEncode(&buf, 0)
}
return buf.Bytes()
}
// assertTipsNonCanonicalBlockSize panics if the if the current tip block
// associated with the generator does not have the specified non-canonical size
// when serialized.
func assertTipNonCanonicalBlockSize(g *chaingen.Generator, expected int) {
tip := g.Tip()
serializeSize := len(encodeNonCanonicalBlock(tip))
if serializeSize != expected {
panic(fmt.Sprintf("block size of block %q (height %d) is %d "+
"instead of expected %d", g.TipName(), tip.Header.Height,
serializeSize, expected))
}
}
// cloneBlock returns a deep copy of the provided block.
func cloneBlock(b *wire.MsgBlock) wire.MsgBlock {
var blockCopy wire.MsgBlock
blockCopy.Header = b.Header
for _, tx := range b.Transactions {
blockCopy.AddTransaction(tx.Copy())
}
for _, stx := range b.STransactions {
blockCopy.AddSTransaction(stx)
}
return blockCopy
}
// repeatOpcode returns a byte slice with the provided opcode repeated the
// specified number of times.
func repeatOpcode(opcode uint8, numRepeats int) []byte {
return bytes.Repeat([]byte{opcode}, numRepeats)
}
// Generate returns a slice of tests that can be used to exercise the consensus
// validation rules. The tests are intended to be flexible enough to allow both
// unit-style tests directly against the blockchain code as well as
// integration-style tests over the peer-to-peer network. To achieve that goal,
// each test contains additional information about the expected result, however
// that information can be ignored when doing comparison tests between to
// independent versions over the peer-to-peer network.
func Generate(includeLargeReorg bool) (tests [][]TestInstance, err error) {
// In order to simplify the generation code which really should never
// fail unless the test code itself is broken, panics are used
// internally. This deferred func ensures any panics don't escape the
// generator by replacing the named error return with the underlying
// panic error.
defer func() {
if r := recover(); r != nil {
tests = nil
switch rt := r.(type) {
case string:
err = errors.New(rt)
case error:
err = rt
default:
err = errors.New("unknown panic")
}
}
}()
// Create a generator instance initialized with the genesis block as the
// tip as well as some cached payment scripts to be used throughout the
// tests.
g, err := chaingen.MakeGenerator(simNetParams)
if err != nil {
return nil, err
}
// Define some convenience helper functions to return an individual test
// instance that has the described characteristics.
//
// acceptBlock creates a test instance that expects the provided block
// to be accepted by the consensus rules.
//
// rejectBlock creates a test instance that expects the provided block
// to be rejected by the consensus rules.
//
// rejectNonCanonicalBlock creates a test instance that encodes the
// provided block using a non-canonical encoded as described by the
// encodeNonCanonicalBlock function and expected it to be rejected.
//
// orphanOrRejectBlock creates a test instance that expected the
// provided block to either by accepted as an orphan or rejected by the
// consensus rules.
//
// expectTipBlock creates a test instance that expects the provided
// block to be the current tip of the block chain.
acceptBlock := func(blockName string, block *wire.MsgBlock, isMainChain, isOrphan bool) TestInstance {
return AcceptedBlock{blockName, block, isMainChain, isOrphan}
}
rejectBlock := func(blockName string, block *wire.MsgBlock, code blockchain.ErrorCode) TestInstance {
return RejectedBlock{blockName, block, code}
}
rejectNonCanonicalBlock := func(blockName string, block *wire.MsgBlock) TestInstance {
blockHeight := int32(block.Header.Height)
encoded := encodeNonCanonicalBlock(block)
return RejectedNonCanonicalBlock{blockName, encoded, blockHeight}
}
orphanOrRejectBlock := func(blockName string, block *wire.MsgBlock) TestInstance {
return OrphanOrRejectedBlock{blockName, block}
}
expectTipBlock := func(blockName string, block *wire.MsgBlock) TestInstance {
return ExpectedTip{blockName, block}
}
// Define some convenience helper functions to populate the tests slice
// with test instances that have the described characteristics.
//
// accepted creates and appends a single acceptBlock test instance for
// the current tip which expects the block to be accepted to the main
// chain.
//
// acceptedToSideChainWithExpectedTip creates an appends a two-instance
// test. The first instance is an acceptBlock test instance for the
// current tip which expects the block to be accepted to a side chain.
// The second instance is an expectBlockTip test instance for provided
// values.
//
// rejected creates and appends a single rejectBlock test instance for
// the current tip.
//
// rejectedNonCanonical creates and appends a single
// rejectNonCanonicalBlock test instance for the current tip.
//
// orphaned creates and appends a single acceptBlock test instance for
// the current tip which expects the block to be accepted as an orphan.
//
// orphanedOrRejected creates and appends a single orphanOrRejectBlock
// test instance for the current tip.
accepted := func() {
tests = append(tests, []TestInstance{
acceptBlock(g.TipName(), g.Tip(), true, false),
})
}
acceptedToSideChainWithExpectedTip := func(tipName string) {
tests = append(tests, []TestInstance{
acceptBlock(g.TipName(), g.Tip(), false, false),
expectTipBlock(tipName, g.BlockByName(tipName)),
})
}
rejected := func(code blockchain.ErrorCode) {
tests = append(tests, []TestInstance{
rejectBlock(g.TipName(), g.Tip(), code),
})
}
rejectedNonCanonical := func() {
tests = append(tests, []TestInstance{
rejectNonCanonicalBlock(g.TipName(), g.Tip()),
})
}
orphaned := func() {
tests = append(tests, []TestInstance{
acceptBlock(g.TipName(), g.Tip(), false, true),
})
}
orphanedOrRejected := func() {
tests = append(tests, []TestInstance{
orphanOrRejectBlock(g.TipName(), g.Tip()),
})
}
// Shorter versions of useful params for convenience.
coinbaseMaturity := g.Params().CoinbaseMaturity
stakeEnabledHeight := g.Params().StakeEnabledHeight
stakeValidationHeight := g.Params().StakeValidationHeight
maxBlockSize := g.Params().MaximumBlockSizes[0]
ticketsPerBlock := g.Params().TicketsPerBlock
// ---------------------------------------------------------------------
// Premine tests.
// ---------------------------------------------------------------------
// Attempt to insert an initial premine block that does not conform to
// the required premine payouts by adding one atom too many to each
// payout.
//
// genesis
// \-> bpbad0
g.CreatePremineBlock("bpbad0", 1)
rejected(blockchain.ErrBadCoinbaseValue)
// Add the required premine block.
//
// genesis -> bp
g.SetTip("genesis")
g.CreatePremineBlock("bp", 0)
g.AssertTipHeight(1)
accepted()
// TODO:
// - Try to spend premine output before maturity in the regular tree
// - Try to spend premine output before maturity in the stake tree by
// creating a ticket purchase
// ---------------------------------------------------------------------
// Generate enough blocks to have mature coinbase outputs to work with.
//
// genesis -> bp -> bm0 -> bm1 -> ... -> bm#
// ---------------------------------------------------------------------
var testInstances []TestInstance
for i := uint16(0); i < coinbaseMaturity; i++ {
blockName := fmt.Sprintf("bm%d", i)
g.NextBlock(blockName, nil, nil)
g.SaveTipCoinbaseOuts()
testInstances = append(testInstances, acceptBlock(g.TipName(),
g.Tip(), true, false))
}
tests = append(tests, testInstances)
g.AssertTipHeight(uint32(coinbaseMaturity) + 1)
// ---------------------------------------------------------------------
// Generate enough blocks to reach the stake enabled height while
// creating ticket purchases that spend from the coinbases matured
// above. This will also populate the pool of immature tickets.
//
// ... -> bm# ... -> bse0 -> bse1 -> ... -> bse#
// ---------------------------------------------------------------------
testInstances = nil
var ticketsPurchased int
for i := int64(0); int64(g.Tip().Header.Height) < stakeEnabledHeight; i++ {
outs := g.OldestCoinbaseOuts()
ticketOuts := outs[1:]
ticketsPurchased += len(ticketOuts)
blockName := fmt.Sprintf("bse%d", i)
g.NextBlock(blockName, nil, ticketOuts)
g.SaveTipCoinbaseOuts()
testInstances = append(testInstances, acceptBlock(g.TipName(),
g.Tip(), true, false))
}
tests = append(tests, testInstances)
g.AssertTipHeight(uint32(stakeEnabledHeight))
// TODO: Modify the above to generate a few less so this section can
// test negative validation failures such as the following items and
// then finish generating the rest after to reach the stake enabled
// height.
//
// - Ticket purchase with various malformed transactions such as
// incorrectly ordered txouts, scripts that do not involve p2pkh or
// p2sh addresses, etc
// - Try to vote with an immature ticket
// - Try to vote before stake validation height
// ---------------------------------------------------------------------
// Generate enough blocks to reach the stake validation height while
// continuing to purchase tickets using the coinbases matured above and
// allowing the immature tickets to mature and thus become live.
//
// While doing so, also generate blocks that have the required early
// vote unset to ensure they are properly rejected.
//
// ... -> bse# -> bsv0 -> bsv1 -> ... -> bsv#
// \ \ \ \-> bevbad#
// | | \-> bevbad2
// | \-> bevbad1
// \-> bevbad0
// ---------------------------------------------------------------------
testInstances = nil
targetPoolSize := g.Params().TicketPoolSize * g.Params().TicketsPerBlock
for i := int64(0); int64(g.Tip().Header.Height) < stakeValidationHeight; i++ {
// Until stake validation height is reached, test that any
// blocks without the early vote bits set are rejected.
if int64(g.Tip().Header.Height) < stakeValidationHeight-1 {
prevTip := g.TipName()
blockName := fmt.Sprintf("bevbad%d", i)
g.NextBlock(blockName, nil, nil, func(b *wire.MsgBlock) {
b.Header.VoteBits = 0
})
testInstances = append(testInstances, rejectBlock(
g.TipName(), g.Tip(),
blockchain.ErrInvalidEarlyVoteBits))
g.SetTip(prevTip)
}
// Only purchase tickets until the target ticket pool size is
// reached.
outs := g.OldestCoinbaseOuts()
ticketOuts := outs[1:]
if ticketsPurchased+len(ticketOuts) > int(targetPoolSize) {
ticketsNeeded := int(targetPoolSize) - ticketsPurchased
if ticketsNeeded > 0 {
ticketOuts = ticketOuts[1 : ticketsNeeded+1]
} else {
ticketOuts = nil
}
}
ticketsPurchased += len(ticketOuts)
blockName := fmt.Sprintf("bsv%d", i)
g.NextBlock(blockName, nil, ticketOuts)
g.SaveTipCoinbaseOuts()
testInstances = append(testInstances, acceptBlock(g.TipName(),
g.Tip(), true, false))
}
tests = append(tests, testInstances)
g.AssertTipHeight(uint32(stakeValidationHeight))
// ---------------------------------------------------------------------
// Generate enough blocks to have a known distance to the first mature
// coinbase outputs for all tests that follow. These blocks continue
// to purchase tickets to avoid running out of votes.
//
// ... -> bsv# -> bbm0 -> bbm1 -> ... -> bbm#
// ---------------------------------------------------------------------
testInstances = nil
for i := uint16(0); i < coinbaseMaturity; i++ {
outs := g.OldestCoinbaseOuts()
blockName := fmt.Sprintf("bbm%d", i)
g.NextBlock(blockName, nil, outs[1:])
g.SaveTipCoinbaseOuts()
testInstances = append(testInstances, acceptBlock(g.TipName(),
g.Tip(), true, false))
}
tests = append(tests, testInstances)
// Collect spendable outputs into two different slices. The outs slice
// is intended to be used for regular transactions that spend from the
// output, while the ticketOuts slice is intended to be used for stake
// ticket purchases.
var outs []*chaingen.SpendableOut
var ticketOuts [][]chaingen.SpendableOut
for i := uint16(0); i < coinbaseMaturity; i++ {
coinbaseOuts := g.OldestCoinbaseOuts()
outs = append(outs, &coinbaseOuts[0])
ticketOuts = append(ticketOuts, coinbaseOuts[1:])
}
// ---------------------------------------------------------------------
// Basic forking and reorg tests.
// ---------------------------------------------------------------------
// ---------------------------------------------------------------------
// The comments below identify the structure of the chain being built.
//
// The values in parenthesis repesent which outputs are being spent.
//
// For example, b1(0) indicates the first collected spendable output
// which, due to the code above to create the correct number of blocks,
// is the first output that can be spent at the current block height due
// to the coinbase maturity requirement.
// ---------------------------------------------------------------------
// Start by building a couple of blocks at current tip (value in parens
// is which output is spent):
//
// ... -> b1(0) -> b2(1)
g.NextBlock("b1", outs[0], ticketOuts[0])
accepted()
g.NextBlock("b2", outs[1], ticketOuts[1])
accepted()
// Ensure duplicate blocks are rejected.
//
// ... -> b1(0) -> b2(1)
// \-> b2(1)
rejected(blockchain.ErrDuplicateBlock)
// Create a fork from b1. There should not be a reorg since b2 was seen
// first.
//
// ... -> b1(0) -> b2(1)
// \-> b3(1)
g.SetTip("b1")
g.NextBlock("b3", outs[1], ticketOuts[1])
b3Tx1Out := chaingen.MakeSpendableOut(g.Tip(), 1, 0)
acceptedToSideChainWithExpectedTip("b2")
// Extend b3 fork to make the alternative chain longer and force reorg.
//
// ... -> b1(0) -> b2(1)
// \-> b3(1) -> b4(2)
g.NextBlock("b4", outs[2], ticketOuts[2])
accepted()
// Extend b2 fork twice to make first chain longer and force reorg.
//
// ... -> b1(0) -> b2(1) -> b5(2) -> b6(3)
// \-> b3(1) -> b4(2)
g.SetTip("b2")
g.NextBlock("b5", outs[2], ticketOuts[2])
acceptedToSideChainWithExpectedTip("b4")
g.NextBlock("b6", outs[3], ticketOuts[3])
accepted()
// ---------------------------------------------------------------------
// Double spend tests.
// ---------------------------------------------------------------------
// Create a fork that double spends.
//
// ... -> b1(0) -> b2(1) -> b5(2) -> b6(3)
// \-> b7(2) -> b8(4)
// \-> b3(1) -> b4(2)
g.SetTip("b5")
g.NextBlock("b7", outs[2], ticketOuts[3])
acceptedToSideChainWithExpectedTip("b6")
g.NextBlock("b8", outs[4], ticketOuts[4])
rejected(blockchain.ErrMissingTx)
// ---------------------------------------------------------------------
// Too much proof-of-work coinbase tests.
// ---------------------------------------------------------------------
// Create a block that generates too much proof-of-work coinbase.
//
// ... -> b1(0) -> b2(1) -> b5(2) -> b6(3)
// \-> b9(4)
// \-> b3(1) -> b4(2)
g.SetTip("b6")
g.NextBlock("b9", outs[4], ticketOuts[4], additionalCoinbasePoW(1))
rejected(blockchain.ErrBadCoinbaseValue)
// Create a fork that ends with block that generates too much
// proof-of-work coinbase.
//
// ... -> b1(0) -> b2(1) -> b5(2) -> b6(3)
// \-> b10(3) -> b11(4)
// \-> b3(1) -> b4(2)
g.SetTip("b5")
g.NextBlock("b10", outs[3], ticketOuts[3])
acceptedToSideChainWithExpectedTip("b6")
g.NextBlock("b11", outs[4], ticketOuts[4], additionalCoinbasePoW(1))
rejected(blockchain.ErrBadCoinbaseValue)
// Create a fork that ends with block that generates too much
// proof-of-work coinbase as before, but with a valid fork first.
//
// ... -> b1(0) -> b2(1) -> b5(2) -> b6(3)
// | \-> b12(3) -> b13(4) -> b14(5)
// | (b12 added last)
// \-> b3(1) -> b4(2)
g.SetTip("b5")
b12 := g.NextBlock("b12", outs[3], ticketOuts[3])
b13 := g.NextBlock("b13", outs[4], ticketOuts[4])
b14 := g.NextBlock("b14", outs[5], ticketOuts[5], additionalCoinbasePoW(1))
tests = append(tests, []TestInstance{
acceptBlock("b13", b13, false, true),
acceptBlock("b14", b14, false, true),
rejectBlock("b12", b12, blockchain.ErrBadCoinbaseValue),
expectTipBlock("b13", b13),
})
// ---------------------------------------------------------------------
// Bad dev org output tests.
// ---------------------------------------------------------------------
// Create a block that does not generate a payment to the dev-org P2SH
// address. Test this by trying to pay to a secp256k1 P2PKH address
// using the same HASH160.
//
// ... -> b5(2) -> b12(3) -> b13(4)
// \ \-> bbadtaxscript(5)
// \-> b3(1) -> b4(2)
g.SetTip("b13")
g.NextBlock("bbadtaxscript", outs[5], ticketOuts[5], func(b *wire.MsgBlock) {
taxOutput := b.Transactions[0].TxOut[0]
_, addrs, _, _ := txscript.ExtractPkScriptAddrs(
g.Params().OrganizationPkScriptVersion,
taxOutput.PkScript, g.Params())
p2shTaxAddr := addrs[0].(*hcutil.AddressScriptHash)
p2pkhTaxAddr, err := hcutil.NewAddressPubKeyHash(
p2shTaxAddr.Hash160()[:], g.Params(),
chainec.ECTypeSecp256k1)
if err != nil {
panic(err)
}
p2pkhScript, err := txscript.PayToAddrScript(p2pkhTaxAddr)
if err != nil {
panic(err)
}
taxOutput.PkScript = p2pkhScript
})
rejected(blockchain.ErrNoTax)
// Create a block that uses a newer output script version than is
// supported for the dev-org tax output.
//
// ... -> b5(2) -> b12(3) -> b13(4)
// \ \-> bbadtaxscriptversion(5)
// \-> b3(1) -> b4(2)
g.SetTip("b13")
g.NextBlock("bbadtaxscriptversion", outs[5], ticketOuts[5], func(b *wire.MsgBlock) {
b.Transactions[0].TxOut[0].Version = 1
})
rejected(blockchain.ErrNoTax)
// ---------------------------------------------------------------------
// Too much dev-org coinbase tests.
// ---------------------------------------------------------------------
// Create a block that generates too much dev-org coinbase.
//
// ... -> b5(2) -> b12(3) -> b13(4)
// \ \-> b15(5)
// \-> b3(1) -> b4(2)
g.SetTip("b13")
g.NextBlock("b15", outs[5], ticketOuts[5], additionalCoinbaseDev(1))
rejected(blockchain.ErrNoTax)
// Create a fork that ends with block that generates too much dev-org
// coinbase.
//
// ... -> b5(2) -> b12(3) -> b13(4)
// \ \-> b16(4) -> b17(5)
// \-> b3(1) -> b4(2)
g.SetTip("b12")
g.NextBlock("b16", outs[4], ticketOuts[4], additionalCoinbaseDev(1))
acceptedToSideChainWithExpectedTip("b13")
g.NextBlock("b17", outs[5], ticketOuts[5], additionalCoinbaseDev(1))
rejected(blockchain.ErrNoTax)
// Create a fork that ends with block that generates too much dev-org
// coinbase as before, but with a valid fork first.
//
// ... -> b5(2) -> b12(3) -> b13(4)
// \ \-> b18(4) -> b19(5) -> b20(6)
// | (b18 added last)
// \-> b3(1) -> b4(2)
//
g.SetTip("b12")
b18 := g.NextBlock("b18", outs[4], ticketOuts[4])
b19 := g.NextBlock("b19", outs[5], ticketOuts[5])
b20 := g.NextBlock("b20", outs[6], ticketOuts[6], additionalCoinbaseDev(1))
tests = append(tests, []TestInstance{
acceptBlock("b19", b19, false, true),
acceptBlock("b20", b20, false, true),
rejectBlock("b18", b18, blockchain.ErrNoTax),
expectTipBlock("b19", b19),
})
// ---------------------------------------------------------------------
// Checksig signature operation count tests.
// ---------------------------------------------------------------------
// Add a block with max allowed signature operations.
//
// ... -> b5(2) -> b12(3) -> b18(4) -> b19(5) -> b21(6)
// \-> b3(1) -> b4(2)
g.SetTip("b19")
manySigOps := repeatOpcode(txscript.OP_CHECKSIG, maxBlockSigOps)
g.NextBlock("b21", outs[6], ticketOuts[6], replaceSpendScript(manySigOps))
g.AssertTipBlockSigOpsCount(maxBlockSigOps)
accepted()
// Attempt to add block with more than max allowed signature operations.
//
// ... -> b5(2) -> b12(3) -> b18(4) -> b19(5) -> b21(6)
// \ \-> b22(7)
// \-> b3(1) -> b4(2)
tooManySigOps := repeatOpcode(txscript.OP_CHECKSIG, maxBlockSigOps+1)
g.NextBlock("b22", outs[7], ticketOuts[7], replaceSpendScript(tooManySigOps))
g.AssertTipBlockSigOpsCount(maxBlockSigOps + 1)
rejected(blockchain.ErrTooManySigOps)
// ---------------------------------------------------------------------
// Cross-fork spend tests.
// ---------------------------------------------------------------------
// Create block that spends a tx created on a different fork.
//
// ... -> b5(2) -> b12(3) -> b18(4) -> b19(5) -> b21(6)
// \ \-> b23(b3.tx[1])
// \-> b3(1) -> b4(2)
g.SetTip("b21")
g.NextBlock("b23", &b3Tx1Out, nil)
rejected(blockchain.ErrMissingTx)
// Create block that forks and spends a tx created on a third fork.
//
// ... -> b5(2) -> b12(3) -> b18(4) -> b19(5) -> b21(6)
// | \-> b24(b3.tx[1]) -> b25(6)
// \-> b3(1) -> b4(2)
g.SetTip("b19")
g.NextBlock("b24", &b3Tx1Out, nil)
acceptedToSideChainWithExpectedTip("b21")
g.NextBlock("b25", outs[6], ticketOuts[6])
rejected(blockchain.ErrMissingTx)
// ---------------------------------------------------------------------
// Immature coinbase tests.
// ---------------------------------------------------------------------
// Create block that spends immature coinbase.
//
// ... -> b19(5) -> b21(6)
// \-> b26(8)
g.SetTip("b21")
g.NextBlock("b26", outs[8], ticketOuts[7])
rejected(blockchain.ErrImmatureSpend)
// Create block that spends immature coinbase on a fork.
//
// ... -> b19(5) -> b21(6)
// \-> b27(6) -> b28(8)
g.SetTip("b19")
g.NextBlock("b27", outs[6], ticketOuts[6])
acceptedToSideChainWithExpectedTip("b21")
g.NextBlock("b28", outs[8], ticketOuts[7])
rejected(blockchain.ErrImmatureSpend)
// ---------------------------------------------------------------------
// Max block size tests.
// ---------------------------------------------------------------------
// Create block that is the max allowed size.
//
// ... -> b21(6) -> b29(7)
g.SetTip("b21")
g.NextBlock("b29", outs[7], ticketOuts[7], func(b *wire.MsgBlock) {
curScriptLen := len(b.Transactions[1].TxOut[0].PkScript)
bytesToMaxSize := maxBlockSize - b.SerializeSize() +
(curScriptLen - 4)
sizePadScript := repeatOpcode(0x00, bytesToMaxSize)
replaceSpendScript(sizePadScript)(b)
})
g.AssertTipBlockSize(maxBlockSize)
accepted()
// Create block that is the one byte larger than max allowed size. This
// is done on a fork and should be rejected regardless.
//
// ... -> b21(6) -> b29(7)
// \-> b30(7) -> b31(8)
g.SetTip("b21")
g.NextBlock("b30", outs[7], ticketOuts[7], func(b *wire.MsgBlock) {
curScriptLen := len(b.Transactions[1].TxOut[0].PkScript)
bytesToMaxSize := maxBlockSize - b.SerializeSize() +
(curScriptLen - 4)
sizePadScript := repeatOpcode(0x00, bytesToMaxSize+1)
replaceSpendScript(sizePadScript)(b)
})
g.AssertTipBlockSize(maxBlockSize + 1)
rejected(blockchain.ErrBlockTooBig)
// Parent was rejected, so this block must either be an orphan or
// outright rejected due to an invalid parent.
g.NextBlock("b31", outs[8], ticketOuts[8])
orphanedOrRejected()
// ---------------------------------------------------------------------
// Orphan tests.
// ---------------------------------------------------------------------
// Create valid orphan block with zero prev hash.
//
// No previous block
// \-> borphan0(7)
g.SetTip("b21")
g.NextBlock("borphan0", outs[7], ticketOuts[7], func(b *wire.MsgBlock) {
b.Header.PrevBlock = chainhash.Hash{}
})
orphaned()
// Create valid orphan block.
//
// ... -> b21(6) -> b29(7)
// \-> borphanbase(7) -> borphan1(8)
g.SetTip("b21")
g.NextBlock("borphanbase", outs[7], ticketOuts[7])
g.NextBlock("borphan1", outs[8], ticketOuts[8])
orphaned()
// Ensure duplicate orphan blocks are rejected.
rejected(blockchain.ErrDuplicateBlock)
// ---------------------------------------------------------------------
// Coinbase script length limits tests.
// ---------------------------------------------------------------------
// Create block that has a coinbase script that is smaller than the
// required length. This is done on a fork and should be rejected
// regardless. Also, create a block that builds on the rejected block.
//
// ... -> b21(6) -> b29(7)
// \-> b32(7) -> b33(8)
g.SetTip("b21")
tooSmallCbScript := repeatOpcode(0x00, minCoinbaseScriptLen-1)
g.NextBlock("b32", outs[7], ticketOuts[7], replaceCoinbaseSigScript(tooSmallCbScript))
rejected(blockchain.ErrBadCoinbaseScriptLen)
// Parent was rejected, so this block must either be an orphan or
// outright rejected due to an invalid parent.
g.NextBlock("b33", outs[8], ticketOuts[8])
orphanedOrRejected()
// Create block that has a coinbase script that is larger than the
// allowed length. This is done on a fork and should be rejected
// regardless. Also, create a block that builds on the rejected block.
//