-
Notifications
You must be signed in to change notification settings - Fork 622
/
doomslug.rs
1235 lines (1087 loc) · 46.1 KB
/
doomslug.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
use std::collections::{HashMap, VecDeque};
use std::sync::Arc;
use std::time::{Duration, Instant};
use crate::doomslug::trackable::TrackableBlockHeightValue;
use crate::metrics;
use near_client_primitives::debug::{ApprovalAtHeightStatus, ApprovalHistoryEntry};
use near_crypto::Signature;
use near_primitives::block::{Approval, ApprovalInner};
use near_primitives::hash::CryptoHash;
use near_primitives::static_clock::StaticClock;
use near_primitives::types::{AccountId, ApprovalStake, Balance, BlockHeight, BlockHeightDelta};
use near_primitives::validator_signer::ValidatorSigner;
use tracing::info;
/// Have that many iterations in the timer instead of `loop` to prevent potential bugs from blocking
/// the node
const MAX_TIMER_ITERS: usize = 20;
/// How many heights ahead to track approvals. This needs to be sufficiently large so that we can
/// recover after rather long network interruption, but not too large to consume too much memory if
/// someone in the network spams with invalid approvals. Note that we will only store approvals for
/// heights that are targeting us, which is once per as many heights as there are block producers,
/// thus 10_000 heights in practice will mean on the order of one hundred entries.
const MAX_HEIGHTS_AHEAD_TO_STORE_APPROVALS: BlockHeight = 10_000;
// Number of blocks (before head) for which to keep the history of approvals (for debugging).
const MAX_HEIGHTS_BEFORE_TO_STORE_APPROVALS: u64 = 20;
// Maximum amount of historical approvals that we'd keep for debugging purposes.
const MAX_HISTORY_SIZE: usize = 1000;
/// The threshold for doomslug to create a block.
/// `TwoThirds` means the block can only be produced if at least 2/3 of the stake is approving it,
/// and is what should be used in production (and what guarantees finality)
/// `NoApprovals` means the block production is not blocked on approvals. This is used
/// in many tests (e.g. `cross_shard_tx`) to create lots of forkfulness.
#[derive(PartialEq, Eq, Debug, Clone, Copy)]
pub enum DoomslugThresholdMode {
NoApprovals,
TwoThirds,
}
/// The result of processing an approval.
#[derive(PartialEq, Eq, Debug)]
pub enum DoomslugBlockProductionReadiness {
NotReady,
ReadySince(Instant),
}
struct DoomslugTimer {
started: Instant,
last_endorsement_sent: Instant,
height: BlockHeight,
endorsement_delay: Duration,
min_delay: Duration,
delay_step: Duration,
max_delay: Duration,
}
struct DoomslugTip {
block_hash: CryptoHash,
height: BlockHeight,
}
struct DoomslugApprovalsTracker {
witness: HashMap<AccountId, (Approval, chrono::DateTime<chrono::Utc>)>,
account_id_to_stakes: HashMap<AccountId, (Balance, Balance)>,
total_stake_this_epoch: Balance,
approved_stake_this_epoch: Balance,
total_stake_next_epoch: Balance,
approved_stake_next_epoch: Balance,
time_passed_threshold: Option<Instant>,
threshold_mode: DoomslugThresholdMode,
}
mod trackable {
use near_o11y::metrics::IntGauge;
use near_primitives::types::BlockHeight;
use once_cell::sync::Lazy;
pub struct TrackableBlockHeightValue(BlockHeight, &'static Lazy<IntGauge>);
impl TrackableBlockHeightValue {
pub fn new(value: BlockHeight, gauge: &'static Lazy<IntGauge>) -> Self {
gauge.set(value as i64);
Self(value, gauge)
}
pub fn get(&self) -> BlockHeight {
self.0
}
pub fn set(&mut self, new: BlockHeight) {
self.0 = new;
self.1.set(self.0 as i64);
}
}
}
/// Approvals can arrive before the corresponding blocks, and we need a meaningful way to keep as
/// many approvals as possible that can be useful in the future, while not allowing an adversary
/// to spam us with invalid approvals.
/// To that extent, for each `account_id` and each `target_height` we keep exactly one approval,
/// whichever came last. We only maintain those for
/// a) `account_id`s that match the corresponding epoch (and for which we can validate a signature)
/// b) `target_height`s for which we produce blocks
/// c) `target_height`s within a meaningful horizon from the current tip.
/// This class is responsible for maintaining witnesses for the blocks, while also ensuring that
/// only one approval per (`account_id`) is kept. We instantiate one such class per height, thus
/// ensuring that only one approval is kept per (`target_height`, `account_id`). `Doomslug` below
/// ensures that only instances within the horizon are kept, and the user of the `Doomslug` is
/// responsible for ensuring that only approvals for proper account_ids with valid signatures are
/// provided.
struct DoomslugApprovalsTrackersAtHeight {
approval_trackers: HashMap<ApprovalInner, DoomslugApprovalsTracker>,
last_approval_per_account: HashMap<AccountId, ApprovalInner>,
}
/// Contains all the logic for Doomslug, but no integration with chain or storage. The integration
/// happens via `PersistentDoomslug` struct. The split is to simplify testing of the logic separate
/// from the chain.
pub struct Doomslug {
approval_tracking: HashMap<BlockHeight, DoomslugApprovalsTrackersAtHeight>,
/// Largest target height for which we issued an approval
largest_target_height: TrackableBlockHeightValue,
/// Largest height for which we saw a block containing 1/2 endorsements in it
largest_final_height: TrackableBlockHeightValue,
/// Largest height for which we saw threshold approvals (and thus can potentially create a block)
largest_threshold_height: TrackableBlockHeightValue,
/// Largest target height of approvals that we've received
largest_approval_height: TrackableBlockHeightValue,
/// Information Doomslug tracks about the chain tip
tip: DoomslugTip,
/// Whether an endorsement (or in general an approval) was sent since updating the tip
endorsement_pending: bool,
/// Information to track the timer (see `start_timer` routine in the paper)
timer: DoomslugTimer,
signer: Option<Arc<dyn ValidatorSigner>>,
/// How many approvals to have before producing a block. In production should be always `HalfStake`,
/// but for many tests we use `NoApprovals` to invoke more forkfulness
threshold_mode: DoomslugThresholdMode,
/// Approvals that were created by this doomslug instance (for debugging only).
/// Keeps up to MAX_HISTORY_SIZE entries.
history: VecDeque<ApprovalHistoryEntry>,
}
impl DoomslugTimer {
/// Computes the delay to sleep given the number of heights from the last final block
/// This is what `T` represents in the paper.
///
/// # Arguments
/// * `n` - number of heights since the last block with doomslug finality
///
/// # Returns
/// Duration to sleep
pub fn get_delay(&self, n: BlockHeightDelta) -> Duration {
let n32 = u32::try_from(n).unwrap_or(u32::MAX);
std::cmp::min(self.max_delay, self.min_delay + self.delay_step * n32.saturating_sub(2))
}
}
impl DoomslugApprovalsTracker {
fn new(
account_id_to_stakes: HashMap<AccountId, (Balance, Balance)>,
threshold_mode: DoomslugThresholdMode,
) -> Self {
let total_stake_this_epoch = account_id_to_stakes.values().map(|(x, _)| x).sum::<Balance>();
let total_stake_next_epoch = account_id_to_stakes.values().map(|(_, x)| x).sum::<Balance>();
DoomslugApprovalsTracker {
witness: Default::default(),
account_id_to_stakes,
total_stake_this_epoch,
total_stake_next_epoch,
approved_stake_this_epoch: 0,
approved_stake_next_epoch: 0,
time_passed_threshold: None,
threshold_mode,
}
}
/// Given a single approval (either an endorsement or a skip-message) updates the approved
/// stake on the block that is being approved, and returns whether the block is now ready to be
/// produced.
///
/// # Arguments
/// * now - the current timestamp
/// * approval - the approval to process
///
/// # Returns
/// Whether the block is ready to be produced
fn process_approval(
&mut self,
now: Instant,
approval: &Approval,
) -> DoomslugBlockProductionReadiness {
let mut increment_approved_stake = false;
self.witness.entry(approval.account_id.clone()).or_insert_with(|| {
increment_approved_stake = true;
(approval.clone(), chrono::Utc::now())
});
if increment_approved_stake {
let stakes = self.account_id_to_stakes.get(&approval.account_id).map_or((0, 0), |x| *x);
self.approved_stake_this_epoch += stakes.0;
self.approved_stake_next_epoch += stakes.1;
}
// We call to `get_block_production_readiness` here so that if the number of approvals crossed
// the threshold, the timer for block production starts.
self.get_block_production_readiness(now)
}
/// Withdraws an approval. This happens if a newer approval for the same `target_height` comes
/// from the same account. Removes the approval from the `witness` and updates approved and
/// endorsed stakes.
fn withdraw_approval(&mut self, account_id: &AccountId) {
let approval = match self.witness.remove(account_id) {
None => return,
Some(approval) => approval.0,
};
let stakes = self.account_id_to_stakes.get(&approval.account_id).map_or((0, 0), |x| *x);
self.approved_stake_this_epoch -= stakes.0;
self.approved_stake_next_epoch -= stakes.1;
}
/// Returns whether the block has enough approvals, and if yes, since what moment it does.
///
/// # Arguments
/// * now - the current timestamp
///
/// # Returns
/// `NotReady` if the block doesn't have enough approvals yet to cross the threshold
/// `ReadySince` if the block has enough approvals to pass the threshold, and since when it
/// does
fn get_block_production_readiness(&mut self, now: Instant) -> DoomslugBlockProductionReadiness {
if (self.approved_stake_this_epoch > self.total_stake_this_epoch * 2 / 3
&& (self.approved_stake_next_epoch > self.total_stake_next_epoch * 2 / 3
|| self.total_stake_next_epoch == 0))
|| self.threshold_mode == DoomslugThresholdMode::NoApprovals
{
if self.time_passed_threshold == None {
self.time_passed_threshold = Some(now);
}
DoomslugBlockProductionReadiness::ReadySince(self.time_passed_threshold.unwrap())
} else {
DoomslugBlockProductionReadiness::NotReady
}
}
// Get witnesses together with their arrival time.
fn get_witnesses(&self) -> Vec<(AccountId, chrono::DateTime<chrono::Utc>)> {
self.witness
.iter()
.map(|(key, (_, arrival_time))| (key.clone(), *arrival_time))
.collect::<Vec<_>>()
}
}
impl DoomslugApprovalsTrackersAtHeight {
fn new() -> Self {
Self { approval_trackers: HashMap::new(), last_approval_per_account: HashMap::new() }
}
/// This method is a wrapper around `DoomslugApprovalsTracker::process_approval`, see comment
/// above it for more details.
/// This method has an extra logic that ensures that we only track one approval per `account_id`,
/// if we already know some other approval for this account, we first withdraw it from the
/// corresponding tracker, and associate the new approval with the account.
///
/// # Arguments
/// * `now` - the current timestamp
/// * `approval` - the approval to be processed
/// * `stakes` - all the stakes of all the block producers in the current epoch
/// * `threshold_mode` - how many approvals are needed to produce a block. Is used to compute
/// the return value
///
/// # Returns
/// Same as `DoomslugApprovalsTracker::process_approval`
fn process_approval(
&mut self,
now: Instant,
approval: &Approval,
stakes: &[(ApprovalStake, bool)],
threshold_mode: DoomslugThresholdMode,
) -> DoomslugBlockProductionReadiness {
if let Some(last_parent) = self.last_approval_per_account.get(&approval.account_id) {
let should_remove = self
.approval_trackers
.get_mut(last_parent)
.map(|x| {
x.withdraw_approval(&approval.account_id);
x.witness.is_empty()
})
.unwrap_or(false);
if should_remove {
self.approval_trackers.remove(last_parent);
}
}
let account_id_to_stakes = stakes
.iter()
.filter_map(|(x, is_slashed)| {
if *is_slashed {
None
} else {
Some((x.account_id.clone(), (x.stake_this_epoch, x.stake_next_epoch)))
}
})
.collect::<HashMap<_, _>>();
assert_eq!(account_id_to_stakes.len(), stakes.len());
if !account_id_to_stakes.contains_key(&approval.account_id) {
return DoomslugBlockProductionReadiness::NotReady;
}
self.last_approval_per_account.insert(approval.account_id.clone(), approval.inner.clone());
self.approval_trackers
.entry(approval.inner.clone())
.or_insert_with(|| DoomslugApprovalsTracker::new(account_id_to_stakes, threshold_mode))
.process_approval(now, approval)
}
/// Returns the current approvals status for the trackers at this height.
/// Status contains information about which account voted (and for what) and whether the doomslug voting threshold was reached.
pub fn status(&self) -> ApprovalAtHeightStatus {
let approvals = self
.approval_trackers
.iter()
.flat_map(|(approval, tracker)| {
let witnesses = tracker.get_witnesses();
witnesses.into_iter().map(|(account_name, approval_time)| {
(account_name, (approval.clone(), approval_time))
})
})
.collect::<HashMap<_, _>>();
let threshold_approval = self
.approval_trackers
.iter()
.filter_map(|(_, tracker)| tracker.time_passed_threshold)
.min()
.map(|ts| {
chrono::Utc::now()
- chrono::Duration::from_std(ts.elapsed()).unwrap_or(chrono::Duration::days(1))
});
ApprovalAtHeightStatus { approvals, ready_at: threshold_approval }
}
}
impl Doomslug {
pub fn new(
largest_target_height: BlockHeight,
endorsement_delay: Duration,
min_delay: Duration,
delay_step: Duration,
max_delay: Duration,
signer: Option<Arc<dyn ValidatorSigner>>,
threshold_mode: DoomslugThresholdMode,
) -> Self {
Doomslug {
approval_tracking: HashMap::new(),
largest_target_height: TrackableBlockHeightValue::new(
largest_target_height,
&metrics::LARGEST_TARGET_HEIGHT,
),
largest_approval_height: TrackableBlockHeightValue::new(
0,
&metrics::LARGEST_APPROVAL_HEIGHT,
),
largest_final_height: TrackableBlockHeightValue::new(0, &metrics::LARGEST_FINAL_HEIGHT),
largest_threshold_height: TrackableBlockHeightValue::new(
0,
&metrics::LARGEST_THRESHOLD_HEIGHT,
),
tip: DoomslugTip { block_hash: CryptoHash::default(), height: 0 },
endorsement_pending: false,
timer: DoomslugTimer {
started: StaticClock::instant(),
last_endorsement_sent: StaticClock::instant(),
height: 0,
endorsement_delay,
min_delay,
delay_step,
max_delay,
},
signer,
threshold_mode,
history: VecDeque::new(),
}
}
#[cfg(feature = "test_features")]
pub fn adv_disable(&mut self) {
self.threshold_mode = DoomslugThresholdMode::NoApprovals
}
/// Returns the `(hash, height)` of the current tip. Currently is only used by tests.
pub fn get_tip(&self) -> (CryptoHash, BlockHeight) {
(self.tip.block_hash, self.tip.height)
}
/// Returns the largest height for which we have enough approvals to be theoretically able to
/// produce a block (in practice a blocks might not be produceable yet if not enough time
/// passed since it accumulated enough approvals)
pub fn get_largest_height_crossing_threshold(&self) -> BlockHeight {
self.largest_threshold_height.get()
}
/// Returns the largest height for which we've received an approval
pub fn get_largest_approval_height(&self) -> BlockHeight {
self.largest_approval_height.get()
}
pub fn get_largest_final_height(&self) -> BlockHeight {
self.largest_final_height.get()
}
pub fn get_largest_target_height(&self) -> BlockHeight {
self.largest_target_height.get()
}
pub fn get_timer_height(&self) -> BlockHeight {
self.timer.height
}
pub fn get_timer_start(&self) -> Instant {
self.timer.started
}
/// Returns currently available approval history.
pub fn get_approval_history(&self) -> Vec<ApprovalHistoryEntry> {
self.history.iter().cloned().collect::<Vec<_>>()
}
/// Adds new approval to the history.
fn update_history(&mut self, entry: ApprovalHistoryEntry) {
while self.history.len() >= MAX_HISTORY_SIZE {
self.history.pop_front();
}
self.history.push_back(entry);
}
/// Is expected to be called periodically and processed the timer (`start_timer` in the paper)
/// If the `cur_time` way ahead of last time the `process_timer` was called, will only process
/// a bounded number of steps, to avoid an infinite loop in case of some bugs.
/// Processes sending delayed approvals or skip messages
/// A major difference with the paper is that we process endorsement from the `process_timer`,
/// not at the time of receiving a block. It is done to stagger blocks if the network is way
/// too fast (e.g. during tests, or if a large set of validators have connection significantly
/// better between themselves than with the rest of the validators)
///
/// # Arguments
/// * `cur_time` - is expected to receive `now`. Doesn't directly use `now` to simplify testing
///
/// # Returns
/// A vector of approvals that need to be sent to other block producers as a result of processing
/// the timers
#[must_use]
pub fn process_timer(&mut self, cur_time: Instant) -> Vec<Approval> {
let mut ret = vec![];
for _ in 0..MAX_TIMER_ITERS {
let skip_delay = self
.timer
.get_delay(self.timer.height.saturating_sub(self.largest_final_height.get()));
// The `endorsement_delay` is time to send approval to the block producer at `timer.height`,
// while the `skip_delay` is the time before sending the approval to BP of `timer_height + 1`,
// so it makes sense for them to be at least 2x apart
debug_assert!(skip_delay >= 2 * self.timer.endorsement_delay);
let tip_height = self.tip.height;
if self.endorsement_pending
&& cur_time >= self.timer.last_endorsement_sent + self.timer.endorsement_delay
{
if tip_height >= self.largest_target_height.get() {
self.largest_target_height.set(tip_height + 1);
if let Some(approval) = self.create_approval(tip_height + 1) {
ret.push(approval);
}
self.update_history(ApprovalHistoryEntry {
parent_height: tip_height,
target_height: tip_height + 1,
timer_started_ago_millis: self
.timer
.last_endorsement_sent
.elapsed()
.as_millis() as u64,
expected_delay_millis: self.timer.endorsement_delay.as_millis() as u64,
approval_creation_time: chrono::Utc::now(),
});
}
self.timer.last_endorsement_sent = cur_time;
self.endorsement_pending = false;
}
if cur_time >= self.timer.started + skip_delay {
debug_assert!(!self.endorsement_pending);
self.largest_target_height
.set(std::cmp::max(self.timer.height + 1, self.largest_target_height.get()));
if let Some(approval) = self.create_approval(self.timer.height + 1) {
ret.push(approval);
}
self.update_history(ApprovalHistoryEntry {
parent_height: tip_height,
target_height: self.timer.height + 1,
timer_started_ago_millis: self.timer.started.elapsed().as_millis() as u64,
expected_delay_millis: skip_delay.as_millis() as u64,
approval_creation_time: chrono::Utc::now(),
});
// Restart the timer
self.timer.started += skip_delay;
self.timer.height += 1;
} else {
break;
}
}
ret
}
fn create_approval(&self, target_height: BlockHeight) -> Option<Approval> {
self.signer.as_ref().map(|signer| {
Approval::new(self.tip.block_hash, self.tip.height, target_height, &**signer)
})
}
/// Determines whether a block has enough approvals to be produced.
/// In production (with `mode == HalfStake`) we require the total stake of all the approvals to
/// be strictly more than half of the total stake. For many non-doomslug specific tests
/// (with `mode == NoApprovals`) no approvals are needed.
///
/// # Arguments
/// * `mode` - whether we want half of the total stake or just a single approval
/// * `approvals` - the set of approvals in the current block
/// * `stakes` - the vector of validator stakes in the current epoch
pub fn can_approved_block_be_produced(
mode: DoomslugThresholdMode,
approvals: &[Option<Box<Signature>>],
stakes: &[(Balance, Balance, bool)],
) -> bool {
if mode == DoomslugThresholdMode::NoApprovals {
return true;
}
let threshold1 = stakes.iter().map(|(x, _, _)| x).sum::<Balance>() * 2 / 3;
let threshold2 = stakes.iter().map(|(_, x, _)| x).sum::<Balance>() * 2 / 3;
let approved_stake1 = approvals
.iter()
.zip(stakes.iter())
.filter(|(_, (_, _, is_slashed))| !*is_slashed)
.map(|(approval, (stake, _, _))| if approval.is_some() { *stake } else { 0 })
.sum::<Balance>();
let approved_stake2 = approvals
.iter()
.zip(stakes.iter())
.filter(|(_, (_, _, is_slashed))| !*is_slashed)
.map(|(approval, (_, stake, _))| if approval.is_some() { *stake } else { 0 })
.sum::<Balance>();
(approved_stake1 > threshold1 || threshold1 == 0)
&& (approved_stake2 > threshold2 || threshold2 == 0)
}
pub fn get_witness(
&self,
prev_hash: &CryptoHash,
parent_height: BlockHeight,
target_height: BlockHeight,
) -> HashMap<AccountId, (Approval, chrono::DateTime<chrono::Utc>)> {
let hash_or_height = ApprovalInner::new(prev_hash, parent_height, target_height);
if let Some(approval_trackers_at_height) = self.approval_tracking.get(&target_height) {
let approvals_tracker =
approval_trackers_at_height.approval_trackers.get(&hash_or_height);
match approvals_tracker {
None => HashMap::new(),
Some(approvals_tracker) => approvals_tracker.witness.clone(),
}
} else {
HashMap::new()
}
}
/// Updates the current tip of the chain. Restarts the timer accordingly.
///
/// # Arguments
/// * `now` - current time. Doesn't call to `Utc::now()` directly to simplify testing
/// * `block_hash` - the hash of the new tip
/// * `height` - the height of the tip
/// * `last_ds_final_height` - last height at which a block in this chain has doomslug finality
pub fn set_tip(
&mut self,
now: Instant,
block_hash: CryptoHash,
height: BlockHeight,
last_final_height: BlockHeight,
) {
debug_assert!(height > self.tip.height || self.tip.height == 0);
self.tip = DoomslugTip { block_hash, height };
self.largest_final_height.set(last_final_height);
self.timer.height = height + 1;
self.timer.started = now;
self.approval_tracking.retain(|h, _| {
*h > height.saturating_sub(MAX_HEIGHTS_BEFORE_TO_STORE_APPROVALS)
&& *h <= height + MAX_HEIGHTS_AHEAD_TO_STORE_APPROVALS
});
self.endorsement_pending = true;
}
/// Records an approval message, and return whether the block has passed the threshold / ready
/// to be produced without waiting any further. See the comment for `DoomslugApprovalTracker::process_approval`
/// for details
#[must_use]
fn on_approval_message_internal(
&mut self,
now: Instant,
approval: &Approval,
stakes: &[(ApprovalStake, bool)],
) -> DoomslugBlockProductionReadiness {
let threshold_mode = self.threshold_mode;
let ret = self
.approval_tracking
.entry(approval.target_height)
.or_insert_with(|| DoomslugApprovalsTrackersAtHeight::new())
.process_approval(now, approval, stakes, threshold_mode);
if approval.target_height > self.largest_approval_height.get() {
self.largest_approval_height.set(approval.target_height);
}
if ret != DoomslugBlockProductionReadiness::NotReady {
if approval.target_height > self.largest_threshold_height.get() {
self.largest_threshold_height.set(approval.target_height);
}
}
ret
}
/// Processes single approval
pub fn on_approval_message(
&mut self,
now: Instant,
approval: &Approval,
stakes: &[(ApprovalStake, bool)],
) {
if approval.target_height < self.tip.height
|| approval.target_height > self.tip.height + MAX_HEIGHTS_AHEAD_TO_STORE_APPROVALS
{
return;
}
let _ = self.on_approval_message_internal(now, approval, stakes);
}
/// Gets the current status of approvals for a given height.
/// It will only work for heights that we have in memory, that is that are not older than MAX_HEIGHTS_BEFORE_TO_STORE_APPROVALS
/// blocks from the head.
pub fn approval_status_at_height(&self, height: &BlockHeight) -> ApprovalAtHeightStatus {
self.approval_tracking.get(height).map(|it| it.status()).unwrap_or_default()
}
/// Returns whether we can produce a block for this height. The check for whether `me` is the
/// block producer for the height needs to be done by the caller.
/// We can produce a block if:
/// - The block has 2/3 of approvals, doomslug-finalizing the previous block, and we have
/// enough chunks, or
/// - The block has 1/2 of approvals, and T(h' / 6) has passed since the block has had 1/2 of
/// approvals for the first time, where h' is time since the last ds-final block.
/// Only the height is passed into the function, we use the tip known to `Doomslug` as the
/// parent hash.
///
/// # Arguments:
/// * `now` - current timestamp
/// * `target_height` - the height for which the readiness is checked
/// * `has_enough_chunks` - if not, we will wait for T(h' / 6) even if we have 2/3 approvals &
/// have the previous block ds-final.
#[must_use]
pub fn ready_to_produce_block(
&mut self,
now: Instant,
target_height: BlockHeight,
has_enough_chunks: bool,
log_block_production_info: bool,
) -> bool {
let hash_or_height =
ApprovalInner::new(&self.tip.block_hash, self.tip.height, target_height);
if let Some(approval_trackers_at_height) = self.approval_tracking.get_mut(&target_height) {
if let Some(approval_tracker) =
approval_trackers_at_height.approval_trackers.get_mut(&hash_or_height)
{
let block_production_readiness =
approval_tracker.get_block_production_readiness(now);
match block_production_readiness {
DoomslugBlockProductionReadiness::NotReady => false,
DoomslugBlockProductionReadiness::ReadySince(when) => {
if has_enough_chunks {
if log_block_production_info {
info!("ready to produce block @ {}, has enough approvals for {:?}, has enough chunks", target_height, now.saturating_duration_since(when));
}
true
} else {
let delay = self.timer.get_delay(
self.timer.height.saturating_sub(self.largest_final_height.get()),
) / 6;
let ready = now > when + delay;
if log_block_production_info {
if ready {
info!("ready to produce block @ {}, has enough approvals for {:?}, does not have enough chunks", target_height, now.saturating_duration_since(when));
} else {
info!("not ready to produce block @ {}, need to wait {:?}, has enough approvals for {:?}", target_height, (when + delay).saturating_duration_since(now), now.saturating_duration_since(when));
}
}
ready
}
}
}
} else {
false
}
} else {
false
}
}
}
#[cfg(test)]
mod tests {
use std::sync::Arc;
use std::time::Duration;
use near_crypto::{KeyType, SecretKey};
use near_primitives::block::{Approval, ApprovalInner};
use near_primitives::hash::hash;
use near_primitives::static_clock::StaticClock;
use near_primitives::test_utils::create_test_signer;
use near_primitives::types::ApprovalStake;
use crate::doomslug::{
DoomslugApprovalsTrackersAtHeight, DoomslugBlockProductionReadiness, DoomslugThresholdMode,
};
use crate::Doomslug;
#[test]
fn test_endorsements_and_skips_basic() {
let mut ds = Doomslug::new(
0,
Duration::from_millis(400),
Duration::from_millis(1000),
Duration::from_millis(100),
Duration::from_millis(3000),
Some(Arc::new(create_test_signer("test"))),
DoomslugThresholdMode::TwoThirds,
);
let mut now = StaticClock::instant(); // For the test purposes the absolute value of the initial instant doesn't matter
// Set a new tip, must produce an endorsement
ds.set_tip(now, hash(&[1]), 1, 1);
assert_eq!(ds.process_timer(now + Duration::from_millis(399)).len(), 0);
let approval =
ds.process_timer(now + Duration::from_millis(400)).into_iter().nth(0).unwrap();
assert_eq!(approval.inner, ApprovalInner::Endorsement(hash(&[1])));
assert_eq!(approval.target_height, 2);
// Same tip => no approval
assert_eq!(ds.process_timer(now + Duration::from_millis(400)), vec![]);
// The block was `ds_final` and therefore started the timer. Try checking before one second expires
assert_eq!(ds.process_timer(now + Duration::from_millis(999)), vec![]);
// But one second should trigger the skip
match ds.process_timer(now + Duration::from_millis(1000)) {
approvals if approvals.is_empty() => assert!(false),
approvals => {
assert_eq!(approvals[0].inner, ApprovalInner::Skip(1));
assert_eq!(approvals[0].target_height, 3);
}
}
// Shift now 1 second forward
now += Duration::from_millis(1000);
// Not processing a block at height 2 should not produce an appoval
ds.set_tip(now, hash(&[2]), 2, 0);
assert_eq!(ds.process_timer(now + Duration::from_millis(400)), vec![]);
// Shift now 1 second forward
now += Duration::from_millis(1000);
// But at height 3 should (also neither block has finality set, keep last final at 0 for now)
ds.set_tip(now, hash(&[3]), 3, 0);
let approval =
ds.process_timer(now + Duration::from_millis(400)).into_iter().nth(0).unwrap();
assert_eq!(approval.inner, ApprovalInner::Endorsement(hash(&[3])));
assert_eq!(approval.target_height, 4);
// Move 1 second further
now += Duration::from_millis(1000);
assert_eq!(ds.process_timer(now + Duration::from_millis(199)), vec![]);
match ds.process_timer(now + Duration::from_millis(200)) {
approvals if approvals.is_empty() => assert!(false),
approvals if approvals.len() == 1 => {
assert_eq!(approvals[0].inner, ApprovalInner::Skip(3));
assert_eq!(approvals[0].target_height, 5);
}
_ => assert!(false),
}
// Move 1 second further
now += Duration::from_millis(1000);
// Now skip 5 (the extra delay is 200+300 = 500)
assert_eq!(ds.process_timer(now + Duration::from_millis(499)), vec![]);
match ds.process_timer(now + Duration::from_millis(500)) {
approvals if approvals.is_empty() => assert!(false),
approvals => {
assert_eq!(approvals[0].inner, ApprovalInner::Skip(3));
assert_eq!(approvals[0].target_height, 6);
}
}
// Move 1 second further
now += Duration::from_millis(1000);
// Skip 6 (the extra delay is 0+200+300+400 = 900)
assert_eq!(ds.process_timer(now + Duration::from_millis(899)), vec![]);
match ds.process_timer(now + Duration::from_millis(900)) {
approvals if approvals.is_empty() => assert!(false),
approvals => {
assert_eq!(approvals[0].inner, ApprovalInner::Skip(3));
assert_eq!(approvals[0].target_height, 7);
}
}
// Move 1 second further
now += Duration::from_millis(1000);
// Accept block at 5 with finality on the prev block, expect it to not produce an approval
ds.set_tip(now, hash(&[5]), 5, 4);
assert_eq!(ds.process_timer(now + Duration::from_millis(400)), vec![]);
// Skip a whole bunch of heights by moving 100 seconds ahead
now += Duration::from_millis(100_000);
assert!(ds.process_timer(now).len() > 10);
// Add some random small number of milliseconds to test that when the next block is added, the
// timer is reset
now += Duration::from_millis(17);
// No approval, since we skipped 6
ds.set_tip(now, hash(&[6]), 6, 4);
assert_eq!(ds.process_timer(now + Duration::from_millis(400)), vec![]);
// The block height was less than the timer height, and thus the timer was reset.
// The wait time for height 7 with last ds final block at 5 is 1100
assert_eq!(ds.process_timer(now + Duration::from_millis(1099)), vec![]);
match ds.process_timer(now + Duration::from_millis(1100)) {
approvals if approvals.is_empty() => assert!(false),
approvals => {
assert_eq!(approvals[0].inner, ApprovalInner::Skip(6));
assert_eq!(approvals[0].target_height, 8);
}
}
}
#[test]
fn test_doomslug_approvals() {
let accounts: Vec<(&str, u128, u128)> =
vec![("test1", 2, 0), ("test2", 1, 0), ("test3", 3, 0), ("test4", 1, 0)];
let stakes = accounts
.iter()
.map(|(account_id, stake_this_epoch, stake_next_epoch)| ApprovalStake {
account_id: account_id.parse().unwrap(),
stake_this_epoch: *stake_this_epoch,
stake_next_epoch: *stake_next_epoch,
public_key: SecretKey::from_seed(KeyType::ED25519, account_id).public_key(),
})
.map(|stake| (stake, false))
.collect::<Vec<_>>();
let signers = accounts
.iter()
.map(|(account_id, _, _)| create_test_signer(account_id))
.collect::<Vec<_>>();
let signer = Arc::new(create_test_signer("test"));
let mut ds = Doomslug::new(
0,
Duration::from_millis(400),
Duration::from_millis(1000),
Duration::from_millis(100),
Duration::from_millis(3000),
Some(signer),
DoomslugThresholdMode::TwoThirds,
);
let mut now = StaticClock::instant();
// In the comments below the format is
// account, height -> approved stake
// The total stake is 7, so the threshold is 5
// "test1", 2 -> 2
assert_eq!(
ds.on_approval_message_internal(
now,
&Approval::new(hash(&[1]), 1, 2, &signers[0]),
&stakes,
),
DoomslugBlockProductionReadiness::NotReady,
);
// "test3", 4 -> 3
assert_eq!(
ds.on_approval_message_internal(
now,
&Approval::new(hash(&[1]), 1, 4, &signers[2]),
&stakes,
),
DoomslugBlockProductionReadiness::NotReady,
);
// "test4", 4 -> 4
assert_eq!(
ds.on_approval_message_internal(
now,
&Approval::new(hash(&[1]), 1, 4, &signers[3]),
&stakes,
),
DoomslugBlockProductionReadiness::NotReady,
);
// "test1", 4 -> same account, still 5
assert_eq!(
ds.on_approval_message_internal(
now + Duration::from_millis(100),
&Approval::new(hash(&[1]), 1, 4, &signers[3]),
&stakes,
),
DoomslugBlockProductionReadiness::NotReady,
);
// "test2", 4 -> 5
assert_eq!(
ds.on_approval_message_internal(
now,
&Approval::new(hash(&[1]), 1, 4, &signers[1]),
&stakes,
),
DoomslugBlockProductionReadiness::ReadySince(now),
);
// "test1", 4 -> 7
assert_eq!(
ds.on_approval_message_internal(
now,
&Approval::new(hash(&[1]), 1, 4, &signers[0]),
&stakes,
),
DoomslugBlockProductionReadiness::ReadySince(now),
);
// "test4", 2 -> 3
assert_eq!(
ds.on_approval_message_internal(
now,
&Approval::new(hash(&[1]), 1, 2, &signers[3]),
&stakes,
),
DoomslugBlockProductionReadiness::NotReady,
);
now += Duration::from_millis(200);
// "test3", 2 -> 6
assert_eq!(
ds.on_approval_message_internal(
now,