-
Notifications
You must be signed in to change notification settings - Fork 659
/
signers_voting_tests.rs
2218 lines (2013 loc) · 80.6 KB
/
signers_voting_tests.rs
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) 2013-2020 Blockstack PBC, a public benefit corporation
// Copyright (C) 2020-2024 Stacks Open Internet Foundation
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
use std::collections::{HashMap, HashSet, VecDeque};
use clarity::boot_util::boot_code_addr;
use clarity::vm::clarity::ClarityConnection;
use clarity::vm::contexts::OwnedEnvironment;
use clarity::vm::contracts::Contract;
use clarity::vm::costs::{CostOverflowingMath, LimitedCostTracker};
use clarity::vm::database::*;
use clarity::vm::errors::{
CheckErrors, Error, IncomparableError, InterpreterError, InterpreterResult, RuntimeErrorType,
};
use clarity::vm::eval;
use clarity::vm::events::StacksTransactionEvent;
use clarity::vm::representations::SymbolicExpression;
use clarity::vm::tests::{execute, is_committed, is_err_code, symbols_from_values};
use clarity::vm::types::{
BuffData, OptionalData, PrincipalData, QualifiedContractIdentifier, ResponseData, SequenceData,
StacksAddressExtensions, StandardPrincipalData, TupleData, TupleTypeSignature, TypeSignature,
Value, NONE,
};
use stacks_common::address::AddressHashMode;
use stacks_common::types::chainstate::{
BlockHeaderHash, BurnchainHeaderHash, StacksAddress, StacksBlockId, VRFSeed,
};
use stacks_common::types::{Address, PrivateKey};
use stacks_common::util::hash::{hex_bytes, to_hex, Sha256Sum, Sha512Trunc256Sum};
use stacks_common::util::secp256k1::Secp256k1PrivateKey;
use wsts::curve::point::Point;
use wsts::curve::scalar::Scalar;
use super::test::*;
use super::RawRewardSetEntry;
use crate::burnchains::{Burnchain, PoxConstants};
use crate::chainstate::burn::db::sortdb::{self, SortitionDB};
use crate::chainstate::burn::operations::*;
use crate::chainstate::burn::{BlockSnapshot, ConsensusHash};
use crate::chainstate::nakamoto::coordinator::tests::make_token_transfer;
use crate::chainstate::nakamoto::test_signers::TestSigners;
use crate::chainstate::nakamoto::tests::get_account;
use crate::chainstate::nakamoto::tests::node::TestStacker;
use crate::chainstate::nakamoto::NakamotoBlock;
use crate::chainstate::stacks::address::{PoxAddress, PoxAddressType20, PoxAddressType32};
use crate::chainstate::stacks::boot::pox_2_tests::{
check_pox_print_event, generate_pox_clarity_value, get_reward_set_entries_at,
get_stacking_state_pox, get_stx_account_at, with_clarity_db_ro, PoxPrintFields,
StackingStateCheckData,
};
use crate::chainstate::stacks::boot::pox_4_tests::{
assert_latest_was_burn, get_last_block_sender_transactions, get_tip, make_test_epochs_pox,
};
use crate::chainstate::stacks::boot::signers_tests::{
get_signer_index, prepare_signers_test, readonly_call,
};
use crate::chainstate::stacks::boot::{
BOOT_CODE_COST_VOTING_TESTNET as BOOT_CODE_COST_VOTING, BOOT_CODE_POX_TESTNET, SIGNERS_NAME,
SIGNERS_VOTING_NAME,
};
use crate::chainstate::stacks::db::{
MinerPaymentSchedule, StacksChainState, StacksHeaderInfo, MINER_REWARD_MATURITY,
};
use crate::chainstate::stacks::events::{StacksTransactionReceipt, TransactionOrigin};
use crate::chainstate::stacks::index::marf::MarfConnection;
use crate::chainstate::stacks::index::MarfTrieId;
use crate::chainstate::stacks::tests::make_coinbase;
use crate::chainstate::stacks::*;
use crate::chainstate::{self};
use crate::clarity_vm::clarity::{ClarityBlockConnection, Error as ClarityError};
use crate::clarity_vm::database::marf::{MarfedKV, WritableMarfStore};
use crate::clarity_vm::database::HeadersDBConn;
use crate::core::*;
use crate::net::test::{TestEventObserver, TestPeer};
use crate::util_lib::boot::boot_code_id;
use crate::util_lib::db::{DBConn, FromRow};
pub fn prepare_pox4_test<'a>(
test_name: &str,
observer: Option<&'a TestEventObserver>,
) -> (
Burnchain,
TestPeer<'a>,
Vec<StacksPrivateKey>,
StacksBlockId,
u64,
usize,
) {
let (epochs, pox_constants) = make_test_epochs_pox();
let mut burnchain = Burnchain::default_unittest(
0,
&BurnchainHeaderHash::from_hex(BITCOIN_REGTEST_FIRST_BLOCK_HASH).unwrap(),
);
burnchain.pox_constants = pox_constants.clone();
let (mut peer, keys) =
instantiate_pox_peer_with_epoch(&burnchain, test_name, Some(epochs.clone()), observer);
assert_eq!(burnchain.pox_constants.reward_slots(), 6);
let mut coinbase_nonce = 0;
// Advance into pox4
let target_height = burnchain.pox_constants.pox_4_activation_height;
let mut latest_block = peer.tenure_with_txs(&[], &mut coinbase_nonce);
while get_tip(peer.sortdb.as_ref()).block_height < u64::from(target_height) {
latest_block = peer.tenure_with_txs(&[], &mut coinbase_nonce);
// if we reach epoch 2.1, perform the check
if get_tip(peer.sortdb.as_ref()).block_height > epochs[3].start_height {
assert_latest_was_burn(&mut peer);
}
}
let block_height = get_tip(peer.sortdb.as_ref()).block_height;
info!("Block height: {}", block_height);
(
burnchain,
peer,
keys,
latest_block,
block_height,
coinbase_nonce,
)
}
/// In this test case, Alice & Bob both successfully vote for the same key.
/// Alice votes successfully, then Bob votes successfully, reaching the
/// threshold and setting the aggregate public key.
#[test]
fn vote_for_aggregate_public_key_success() {
// Test setup
let alice = TestStacker::from_seed(&[3, 4]);
let bob = TestStacker::from_seed(&[5, 6]);
let observer = TestEventObserver::new();
// Alice - Signer 1
let alice_key = &alice.signer_private_key;
let alice_address = key_to_stacks_addr(alice_key);
let alice_principal = PrincipalData::from(alice_address);
// Bob - Signer 2
let bob_key = &bob.signer_private_key;
let bob_address = key_to_stacks_addr(bob_key);
let bob_principal = PrincipalData::from(bob_address);
let (mut peer, mut test_signers, latest_block_id, current_reward_cycle) = prepare_signers_test(
function_name!(),
vec![
(alice_principal.clone(), 1000),
(bob_principal.clone(), 1000),
],
&[alice.clone(), bob.clone()],
Some(&observer),
);
// Alice and Bob will each have voted once while booting to Nakamoto
let alice_nonce = 1;
let bob_nonce = 1;
let cycle_id = current_reward_cycle;
// create vote txs
let alice_index = get_signer_index(&mut peer, latest_block_id, alice_address, cycle_id);
let bob_index = get_signer_index(&mut peer, latest_block_id, bob_address, cycle_id);
let aggregate_key = test_signers.generate_aggregate_key(cycle_id as u64 + 1);
let aggregate_public_key = Value::buff_from(aggregate_key.compress().data.to_vec())
.expect("Failed to serialize aggregate public key");
let aggregate_public_key_ill_formed = Value::buff_from_byte(0x00);
let txs = vec![
// Alice casts vote correctly
make_signers_vote_for_aggregate_public_key_value(
alice_key,
alice_nonce,
alice_index,
aggregate_public_key.clone(),
0,
cycle_id + 1,
),
// Bob casts a vote correctly
make_signers_vote_for_aggregate_public_key_value(
bob_key,
bob_nonce,
bob_index,
aggregate_public_key.clone(),
0,
cycle_id + 1,
),
];
//
// vote in the first burn block of prepare phase
//
let blocks_and_sizes = nakamoto_tenure(&mut peer, &mut test_signers, vec![txs]);
// check the last two txs in the last block
let block = observer.get_blocks().last().unwrap().clone();
let receipts = block.receipts.as_slice();
assert_eq!(receipts.len(), 4);
// ignore tenure change tx
// ignore tenure coinbase tx
// Alice's vote should succeed
let alice_vote_tx = &receipts[2];
assert_eq!(alice_vote_tx.result, Value::okay_true());
assert_eq!(alice_vote_tx.events.len(), 1);
let alice_vote_event = &alice_vote_tx.events[0];
if let StacksTransactionEvent::SmartContractEvent(contract_event) = alice_vote_event {
assert_eq!(
contract_event.value,
TupleData::from_data(vec![
(
"event".into(),
Value::string_ascii_from_bytes("voted".as_bytes().to_vec())
.expect("Failed to create string")
),
("key".into(), aggregate_public_key.clone()),
("new-total".into(), Value::UInt(2)),
("reward-cycle".into(), Value::UInt(cycle_id + 1)),
("round".into(), Value::UInt(0)),
("signer".into(), Value::Principal(alice_principal.clone())),
])
.expect("Failed to create tuple")
.into()
);
} else {
panic!("Expected SmartContractEvent, got {:?}", alice_vote_event);
}
// Bob's vote should succeed and reach the threshold, setting the aggregate public key
let bob_vote_tx = &receipts[3];
assert_eq!(bob_vote_tx.result, Value::okay_true());
assert_eq!(bob_vote_tx.events.len(), 2);
let bob_vote_event = &bob_vote_tx.events[0];
if let StacksTransactionEvent::SmartContractEvent(contract_event) = bob_vote_event {
assert_eq!(
contract_event.value,
TupleData::from_data(vec![
(
"event".into(),
Value::string_ascii_from_bytes("voted".as_bytes().to_vec())
.expect("Failed to create string")
),
("key".into(), aggregate_public_key.clone()),
("new-total".into(), Value::UInt(4)),
("reward-cycle".into(), Value::UInt(cycle_id + 1)),
("round".into(), Value::UInt(0)),
("signer".into(), Value::Principal(bob_principal.clone())),
])
.expect("Failed to create tuple")
.into()
);
} else {
panic!("Expected SmartContractEvent, got {:?}", alice_vote_event);
}
let approve_event = &bob_vote_tx.events[1];
if let StacksTransactionEvent::SmartContractEvent(contract_event) = approve_event {
assert_eq!(
contract_event.value,
TupleData::from_data(vec![
(
"event".into(),
Value::string_ascii_from_bytes(
"approved-aggregate-public-key".as_bytes().to_vec()
)
.expect("Failed to create string")
),
("key".into(), aggregate_public_key.clone()),
("reward-cycle".into(), Value::UInt(cycle_id + 1)),
("round".into(), Value::UInt(0)),
])
.expect("Failed to create tuple")
.into()
);
} else {
panic!("Expected SmartContractEvent, got {:?}", approve_event);
}
}
/// In this test case, Alice & Bob both successfully vote for the same key,
/// but also trigger all tenure-agnostic errors.
#[test]
fn vote_for_aggregate_public_key_with_errors() {
// Test setup
let alice = TestStacker::from_seed(&[3, 4]);
let bob = TestStacker::from_seed(&[5, 6]);
let observer = TestEventObserver::new();
// Alice - Signer 1
let alice_key = &alice.signer_private_key;
let alice_address = key_to_stacks_addr(alice_key);
let alice_principal = PrincipalData::from(alice_address);
// Bob - Signer 2
let bob_key = &bob.signer_private_key;
let bob_address = key_to_stacks_addr(bob_key);
let bob_principal = PrincipalData::from(bob_address);
let (mut peer, mut test_signers, latest_block_id, current_reward_cycle) = prepare_signers_test(
function_name!(),
vec![
(alice_principal.clone(), 1000),
(bob_principal.clone(), 1000),
],
&[alice.clone(), bob.clone()],
Some(&observer),
);
// Alice and Bob will each have voted once while booting to Nakamoto
let alice_nonce = 1;
let bob_nonce = 1;
let cycle_id = current_reward_cycle;
// create vote txs
let alice_index = get_signer_index(&mut peer, latest_block_id, alice_address, cycle_id);
let bob_index = get_signer_index(&mut peer, latest_block_id, bob_address, cycle_id);
let aggregate_key = test_signers.generate_aggregate_key(cycle_id as u64 + 1);
let aggregate_public_key = Value::buff_from(aggregate_key.compress().data.to_vec())
.expect("Failed to serialize aggregate public key");
let aggregate_public_key_ill_formed = Value::buff_from_byte(0x00);
let txs = vec![
// Alice casts a vote with a non-existant index - should return signer index mismatch error
make_signers_vote_for_aggregate_public_key_value(
alice_key,
alice_nonce,
bob_index,
aggregate_public_key.clone(),
0,
cycle_id + 1,
),
// Alice casts a vote with Bobs index - should return invalid signer index error
make_signers_vote_for_aggregate_public_key_value(
alice_key,
alice_nonce + 1,
2,
aggregate_public_key.clone(),
0,
cycle_id + 1,
),
// Alice casts a vote with an invalid public key - should return ill-formed public key error
make_signers_vote_for_aggregate_public_key_value(
alice_key,
alice_nonce + 2,
alice_index,
aggregate_public_key_ill_formed,
0,
cycle_id + 1,
),
// Alice casts a vote with an incorrect reward cycle - should return cycle not set error
make_signers_vote_for_aggregate_public_key_value(
alice_key,
alice_nonce + 3,
alice_index,
aggregate_public_key.clone(),
0,
cycle_id + 2,
),
// Alice casts vote correctly
make_signers_vote_for_aggregate_public_key_value(
alice_key,
alice_nonce + 4,
alice_index,
aggregate_public_key.clone(),
0,
cycle_id + 1,
),
// Alice casts vote twice - should return duplicate vote error
make_signers_vote_for_aggregate_public_key_value(
alice_key,
alice_nonce + 5,
alice_index,
aggregate_public_key.clone(),
0,
cycle_id + 1,
),
// Bob casts a vote with the wrong round - should return an invalid round error
make_signers_vote_for_aggregate_public_key_value(
bob_key,
bob_nonce,
bob_index,
aggregate_public_key.clone(),
2,
cycle_id + 1,
),
// Bob casts a vote correctly
make_signers_vote_for_aggregate_public_key_value(
bob_key,
bob_nonce + 1,
bob_index,
aggregate_public_key.clone(),
0,
cycle_id + 1,
),
];
//
// vote in the first burn block of prepare phase
//
let blocks_and_sizes = nakamoto_tenure(&mut peer, &mut test_signers, vec![txs]);
// check the last eight txs in the last block
let block = observer.get_blocks().last().unwrap().clone();
let receipts = block.receipts.as_slice();
assert_eq!(receipts.len(), 10);
// ignore tenure change tx
// ignore tenure coinbase tx
// Alice's first vote should fail (signer mismatch)
let alice_first_vote_tx = &receipts[2];
let alice_first_vote_tx_result = alice_first_vote_tx.result.clone();
assert_eq!(
alice_first_vote_tx_result,
Value::err_uint(10) // ERR_SIGNER_INDEX_MISMATCH
);
assert_eq!(alice_first_vote_tx.events.len(), 0);
// Alice's second vote should fail (invalid signer)
let alice_second_vote_tx = &receipts[3];
let alice_second_vote_tx_result = alice_second_vote_tx.result.clone();
assert_eq!(
alice_second_vote_tx_result,
Value::err_uint(11) // ERR_INVALID_SIGNER_INDEX
);
assert_eq!(alice_second_vote_tx.events.len(), 0);
// Alice's third vote should fail (ill formed aggregate public key)
let alice_third_vote_tx = &receipts[4];
let alice_third_vote_tx_result = alice_third_vote_tx.result.clone();
assert_eq!(
alice_third_vote_tx_result,
Value::err_uint(13) // ERR_ILL_FORMED_AGGREGATE_PUBLIC_KEY
);
assert_eq!(alice_third_vote_tx.events.len(), 0);
// Alice's fourth vote should fail (cycle not set)
let alice_fourth_vote_tx = &receipts[5];
let alice_fourth_vote_tx_result = alice_fourth_vote_tx.result.clone();
assert_eq!(
alice_fourth_vote_tx_result,
Value::err_uint(2) // ERR_CYCLE_NOT_SET
);
assert_eq!(alice_fourth_vote_tx.events.len(), 0);
// Alice's fifth vote, correct vote should succeed
let alice_fifth_vote_tx = &receipts[6];
assert_eq!(alice_fifth_vote_tx.result, Value::okay_true());
assert_eq!(alice_fifth_vote_tx.events.len(), 1);
let alice_vote_event = &alice_fifth_vote_tx.events[0];
if let StacksTransactionEvent::SmartContractEvent(contract_event) = alice_vote_event {
assert_eq!(
contract_event.value,
TupleData::from_data(vec![
(
"event".into(),
Value::string_ascii_from_bytes("voted".as_bytes().to_vec())
.expect("Failed to create string")
),
("key".into(), aggregate_public_key.clone()),
("new-total".into(), Value::UInt(2)),
("reward-cycle".into(), Value::UInt(cycle_id + 1)),
("round".into(), Value::UInt(0)),
("signer".into(), Value::Principal(alice_principal.clone())),
])
.expect("Failed to create tuple")
.into()
);
} else {
panic!("Expected SmartContractEvent, got {:?}", alice_vote_event);
}
// Alice's sixth vote should fail (duplicate vote)
let alice_sixth_vote_tx = &receipts[7];
let alice_sixth_vote_tx_result = alice_sixth_vote_tx.result.clone();
assert_eq!(
alice_sixth_vote_tx_result,
Value::err_uint(15) // ERR_DUPLICATE_VOTE
);
assert_eq!(alice_sixth_vote_tx.events.len(), 0);
// Bob's first vote should fail (invalid round)
let bob_first_vote_tx = &receipts[8];
let bob_first_vote_tx_result = bob_first_vote_tx.result.clone();
assert_eq!(
bob_first_vote_tx_result,
Value::err_uint(17) // ERR_INVALID_ROUND
);
assert_eq!(bob_first_vote_tx.events.len(), 0);
// Bob's second vote should succeed and reach the threshold, setting the aggregate public key
let bob_second_vote_tx = &receipts[9];
assert_eq!(bob_second_vote_tx.result, Value::okay_true());
assert_eq!(bob_second_vote_tx.events.len(), 2);
let bob_vote_event = &bob_second_vote_tx.events[0];
if let StacksTransactionEvent::SmartContractEvent(contract_event) = bob_vote_event {
assert_eq!(
contract_event.value,
TupleData::from_data(vec![
(
"event".into(),
Value::string_ascii_from_bytes("voted".as_bytes().to_vec())
.expect("Failed to create string")
),
("key".into(), aggregate_public_key.clone()),
("new-total".into(), Value::UInt(4)),
("reward-cycle".into(), Value::UInt(cycle_id + 1)),
("round".into(), Value::UInt(0)),
("signer".into(), Value::Principal(bob_principal.clone())),
])
.expect("Failed to create tuple")
.into()
);
} else {
panic!("Expected SmartContractEvent, got {:?}", alice_vote_event);
}
let approve_event = &bob_second_vote_tx.events[1];
if let StacksTransactionEvent::SmartContractEvent(contract_event) = approve_event {
assert_eq!(
contract_event.value,
TupleData::from_data(vec![
(
"event".into(),
Value::string_ascii_from_bytes(
"approved-aggregate-public-key".as_bytes().to_vec()
)
.expect("Failed to create string")
),
("key".into(), aggregate_public_key.clone()),
("reward-cycle".into(), Value::UInt(cycle_id + 1)),
("round".into(), Value::UInt(0)),
])
.expect("Failed to create tuple")
.into()
);
} else {
panic!("Expected SmartContractEvent, got {:?}", approve_event);
}
}
/// 4 stackers vote for the same aggregate public key. The threshold is reached
/// after the 3rd vote, so the 4th gets an "out of voting window" error.
#[test]
fn vote_for_aggregate_public_key_out_of_window() {
// Test setup
let stacker1 = TestStacker::from_seed(&[3, 4]);
let stacker2 = TestStacker::from_seed(&[5, 6]);
let stacker3 = TestStacker::from_seed(&[7, 8]);
let stacker4 = TestStacker::from_seed(&[9, 10]);
let observer = TestEventObserver::new();
// Signer 1
let stacker1_key = &stacker1.signer_private_key;
let stacker1_address = key_to_stacks_addr(stacker1_key);
let stacker1_principal = PrincipalData::from(stacker1_address);
// Signer 2
let stacker2_key = &stacker2.signer_private_key;
let stacker2_address = key_to_stacks_addr(stacker2_key);
let stacker2_principal = PrincipalData::from(stacker2_address);
// Signer 3
let stacker3_key = &stacker3.signer_private_key;
let stacker3_address = key_to_stacks_addr(stacker3_key);
let stacker3_principal = PrincipalData::from(stacker3_address);
// Signer 4
let stacker4_key = &stacker4.signer_private_key;
let stacker4_address = key_to_stacks_addr(stacker4_key);
let stacker4_principal = PrincipalData::from(stacker4_address);
let (mut peer, mut test_signers, latest_block_id, current_reward_cycle) = prepare_signers_test(
function_name!(),
vec![
(stacker1_principal.clone(), 1000),
(stacker2_principal.clone(), 1000),
(stacker3_principal.clone(), 1000),
(stacker4_principal.clone(), 1000),
],
&[
stacker1.clone(),
stacker2.clone(),
stacker3.clone(),
stacker4.clone(),
],
Some(&observer),
);
// Stackers will each have voted once while booting to Nakamoto
let stacker1_nonce = 1;
let stacker2_nonce = 1;
let stacker3_nonce = 1;
let stacker4_nonce = 1;
let cycle_id = current_reward_cycle;
// create vote txs
let stacker1_index = get_signer_index(&mut peer, latest_block_id, stacker1_address, cycle_id);
let stacker2_index = get_signer_index(&mut peer, latest_block_id, stacker2_address, cycle_id);
let stacker3_index = get_signer_index(&mut peer, latest_block_id, stacker3_address, cycle_id);
let stacker4_index = get_signer_index(&mut peer, latest_block_id, stacker4_address, cycle_id);
let aggregate_key = test_signers.generate_aggregate_key(cycle_id as u64 + 1);
let aggregate_public_key = Value::buff_from(aggregate_key.compress().data.to_vec())
.expect("Failed to serialize aggregate public key");
let txs = vec![
// stacker1 casts vote correctly
make_signers_vote_for_aggregate_public_key_value(
stacker1_key,
stacker1_nonce,
stacker1_index,
aggregate_public_key.clone(),
0,
cycle_id + 1,
),
// stacker2 casts vote correctly
make_signers_vote_for_aggregate_public_key_value(
stacker2_key,
stacker2_nonce,
stacker2_index,
aggregate_public_key.clone(),
0,
cycle_id + 1,
),
// stacker3 casts vote correctly
make_signers_vote_for_aggregate_public_key_value(
stacker3_key,
stacker3_nonce,
stacker3_index,
aggregate_public_key.clone(),
0,
cycle_id + 1,
),
// stacker4 casts vote correctly, but it will return an out of voting window error
make_signers_vote_for_aggregate_public_key_value(
stacker4_key,
stacker4_nonce,
stacker4_index,
aggregate_public_key.clone(),
0,
cycle_id + 1,
),
];
//
// vote in the first burn block of prepare phase
//
let blocks_and_sizes = nakamoto_tenure(&mut peer, &mut test_signers, vec![txs]);
// check the last two txs in the last block
let block = observer.get_blocks().last().unwrap().clone();
let receipts = block.receipts.as_slice();
assert_eq!(receipts.len(), 6);
// ignore tenure change tx
// ignore tenure coinbase tx
// stacker1's vote should succeed
let stacker1_vote_tx = &receipts[2];
assert_eq!(stacker1_vote_tx.result, Value::okay_true());
assert_eq!(stacker1_vote_tx.events.len(), 1);
let stacker1_vote_event = &stacker1_vote_tx.events[0];
if let StacksTransactionEvent::SmartContractEvent(contract_event) = stacker1_vote_event {
assert_eq!(
contract_event.value,
TupleData::from_data(vec![
(
"event".into(),
Value::string_ascii_from_bytes("voted".as_bytes().to_vec())
.expect("Failed to create string")
),
("key".into(), aggregate_public_key.clone()),
("new-total".into(), Value::UInt(1)),
("reward-cycle".into(), Value::UInt(cycle_id + 1)),
("round".into(), Value::UInt(0)),
(
"signer".into(),
Value::Principal(stacker1_principal.clone())
),
])
.expect("Failed to create tuple")
.into()
);
} else {
panic!("Expected SmartContractEvent, got {:?}", stacker1_vote_event);
}
// stacker2's vote should succeed
let stacker2_vote_tx = &receipts[3];
assert_eq!(stacker2_vote_tx.result, Value::okay_true());
assert_eq!(stacker2_vote_tx.events.len(), 1);
let stacker2_vote_event = &stacker2_vote_tx.events[0];
if let StacksTransactionEvent::SmartContractEvent(contract_event) = stacker2_vote_event {
assert_eq!(
contract_event.value,
TupleData::from_data(vec![
(
"event".into(),
Value::string_ascii_from_bytes("voted".as_bytes().to_vec())
.expect("Failed to create string")
),
("key".into(), aggregate_public_key.clone()),
("new-total".into(), Value::UInt(2)),
("reward-cycle".into(), Value::UInt(cycle_id + 1)),
("round".into(), Value::UInt(0)),
(
"signer".into(),
Value::Principal(stacker2_principal.clone())
),
])
.expect("Failed to create tuple")
.into()
);
} else {
panic!("Expected SmartContractEvent, got {:?}", stacker2_vote_event);
}
// stacker3's vote should succeed
let stacker3_vote_tx = &receipts[4];
assert_eq!(stacker3_vote_tx.result, Value::okay_true());
assert_eq!(stacker3_vote_tx.events.len(), 2);
let stacker3_vote_event = &stacker3_vote_tx.events[0];
if let StacksTransactionEvent::SmartContractEvent(contract_event) = stacker3_vote_event {
assert_eq!(
contract_event.value,
TupleData::from_data(vec![
(
"event".into(),
Value::string_ascii_from_bytes("voted".as_bytes().to_vec())
.expect("Failed to create string")
),
("key".into(), aggregate_public_key.clone()),
("new-total".into(), Value::UInt(3)),
("reward-cycle".into(), Value::UInt(cycle_id + 1)),
("round".into(), Value::UInt(0)),
(
"signer".into(),
Value::Principal(stacker3_principal.clone())
),
])
.expect("Failed to create tuple")
.into()
);
} else {
panic!("Expected SmartContractEvent, got {:?}", stacker3_vote_event);
}
let approve_event = &stacker3_vote_tx.events[1];
if let StacksTransactionEvent::SmartContractEvent(contract_event) = approve_event {
assert_eq!(
contract_event.value,
TupleData::from_data(vec![
(
"event".into(),
Value::string_ascii_from_bytes(
"approved-aggregate-public-key".as_bytes().to_vec()
)
.expect("Failed to create string")
),
("key".into(), aggregate_public_key.clone()),
("reward-cycle".into(), Value::UInt(cycle_id + 1)),
("round".into(), Value::UInt(0)),
])
.expect("Failed to create tuple")
.into()
);
} else {
panic!("Expected SmartContractEvent, got {:?}", approve_event);
}
// stacker4's vote should get an out of voting window error
let stacker4_vote_tx = &receipts[5];
assert_eq!(
stacker4_vote_tx.result,
Value::err_uint(12) // ERR_OUT_OF_VOTING_WINDOW
);
assert_eq!(stacker4_vote_tx.events.len(), 0);
}
/// In this test case, Alice votes in the first block of the first tenure of the prepare phase.
/// Alice can vote successfully.
/// A second vote on the same key and round fails with "duplicate vote" error
#[test]
fn vote_for_aggregate_public_key_in_first_block() {
let stacker_1 = TestStacker::from_seed(&[3, 4]);
let stacker_2 = TestStacker::from_seed(&[5, 6]);
let observer = TestEventObserver::new();
let signer = key_to_stacks_addr(&stacker_1.signer_private_key).to_account_principal();
let (mut peer, mut test_signers, latest_block_id, current_reward_cycle) = prepare_signers_test(
function_name!(),
vec![(signer, 1000)],
&[stacker_1.clone(), stacker_2.clone()],
Some(&observer),
);
// create vote txs
let signer_nonce = 1; // Start at 1 because the signer has already voted once
let signer_key = &stacker_1.signer_private_key;
let signer_address = key_to_stacks_addr(signer_key);
let signer_principal = PrincipalData::from(signer_address);
let cycle_id = current_reward_cycle;
let signer_index = get_signer_index(&mut peer, latest_block_id, signer_address, cycle_id);
let aggregate_public_key = test_signers.generate_aggregate_key(cycle_id as u64 + 1);
let txs = vec![
// cast a vote for the aggregate public key
make_signers_vote_for_aggregate_public_key(
signer_key,
signer_nonce,
signer_index,
&aggregate_public_key,
0,
cycle_id + 1,
),
// cast the vote twice
make_signers_vote_for_aggregate_public_key(
signer_key,
signer_nonce + 1,
signer_index,
&aggregate_public_key,
0,
cycle_id + 1,
),
];
//
// vote in the first burn block of prepare phase
//
let blocks_and_sizes = nakamoto_tenure(&mut peer, &mut test_signers, vec![txs]);
// check the last two txs in the last block
let block = observer.get_blocks().last().unwrap().clone();
let receipts = block.receipts.as_slice();
assert_eq!(receipts.len(), 4);
// ignore tenure change tx
// ignore tenure coinbase tx
// first vote should succeed
let alice_first_vote_tx = &receipts[2];
assert_eq!(alice_first_vote_tx.result, Value::okay_true());
// second vote should fail with duplicate vote error
let alice_second_vote_tx = &receipts[3];
assert_eq!(
alice_second_vote_tx.result,
Value::err_uint(15) // ERR_DUPLICATE_VOTE
);
assert_eq!(alice_second_vote_tx.events.len(), 0);
}
/// In this test case, Alice votes in the first block of the last tenure of the prepare phase.
/// Bob votes in the second block of that tenure.
/// Both can vote successfully.
#[test]
fn vote_for_aggregate_public_key_in_last_block() {
let stacker_1 = TestStacker::from_seed(&[3, 4]);
let stacker_2 = TestStacker::from_seed(&[5, 6]);
let observer = TestEventObserver::new();
let signer_1 = key_to_stacks_addr(&stacker_1.signer_private_key).to_account_principal();
let signer_2 = key_to_stacks_addr(&stacker_2.signer_private_key).to_account_principal();
let (mut peer, mut test_signers, latest_block_id, current_reward_cycle) = prepare_signers_test(
function_name!(),
vec![(signer_1, 1000), (signer_2, 1000)],
&[stacker_1.clone(), stacker_2.clone()],
Some(&observer),
);
let mut stacker_1_nonce: u64 = 1;
let dummy_tx_1 = make_dummy_tx(
&mut peer,
&stacker_1.stacker_private_key,
&mut stacker_1_nonce,
);
let dummy_tx_2 = make_dummy_tx(
&mut peer,
&stacker_1.stacker_private_key,
&mut stacker_1_nonce,
);
let dummy_tx_3 = make_dummy_tx(
&mut peer,
&stacker_1.stacker_private_key,
&mut stacker_1_nonce,
);
let cycle_id: u128 = current_reward_cycle;
let aggregate_public_key_1 = test_signers.generate_aggregate_key(cycle_id as u64 + 1);
let aggregate_public_key_2 = test_signers.generate_aggregate_key(cycle_id as u64 + 2);
// create vote txs for alice
let signer_1_nonce = 1; // Start at 1 because the signer has already voted once
let signer_1_key = &stacker_1.signer_private_key;
let signer_1_address = key_to_stacks_addr(signer_1_key);
let signer_1_principal = PrincipalData::from(signer_1_address);
let signer_1_index = get_signer_index(&mut peer, latest_block_id, signer_1_address, cycle_id);
let txs_block_1 = vec![
// cast a vote for the aggregate public key
make_signers_vote_for_aggregate_public_key(
signer_1_key,
signer_1_nonce,
signer_1_index,
&aggregate_public_key_1,
1,
cycle_id + 1,
),
// cast the vote twice
make_signers_vote_for_aggregate_public_key(
signer_1_key,
signer_1_nonce + 1,
signer_1_index,
&aggregate_public_key_1,
1,
cycle_id + 1,
),
// cast a vote for old round
make_signers_vote_for_aggregate_public_key(
signer_1_key,
signer_1_nonce + 2,
signer_1_index,
&aggregate_public_key_2,
0,
cycle_id + 1,
),
];
// create vote txs for bob
let signer_2_nonce = 1; // Start at 1 because the signer has already voted once
let signer_2_key = &stacker_2.signer_private_key;
let signer_2_address = key_to_stacks_addr(signer_2_key);
let signer_2_principal = PrincipalData::from(signer_2_address);
let signer_2_index = get_signer_index(&mut peer, latest_block_id, signer_2_address, cycle_id);
let txs_block_2 = vec![
// cast a vote for the aggregate public key
make_signers_vote_for_aggregate_public_key(
signer_2_key,
signer_2_nonce,
signer_2_index,
&aggregate_public_key_1,
0,
cycle_id + 1,
),
];
//
// vote in the last burn block of prepare phase
//
nakamoto_tenure(&mut peer, &mut test_signers, vec![vec![dummy_tx_1]]);
// alice votes in first block of tenure
// bob votes in second block of tenure
let blocks_and_sizes =
nakamoto_tenure(&mut peer, &mut test_signers, vec![txs_block_1, txs_block_2]);
// check alice's and bob's txs
let blocks = observer.get_blocks();
// alice's block
let block = &blocks[blocks.len() - 2].clone();
let receipts = &block.receipts;
assert_eq!(receipts.len(), 5);
// first vote should succeed
let alice_first_vote_tx = &receipts[2];
assert_eq!(alice_first_vote_tx.result, Value::okay_true());
// second vote should fail with duplicate vote error
let alice_second_vote_tx = &receipts[3];
assert_eq!(
alice_second_vote_tx.result,
Value::err_uint(15) // ERR_DUPLICATE_VOTE
);
assert_eq!(alice_second_vote_tx.events.len(), 0);
// third vote should succeed even though it is on an old round