-
Notifications
You must be signed in to change notification settings - Fork 4.4k
/
optimistic_confirmation_verifier.rs
337 lines (313 loc) · 13.6 KB
/
optimistic_confirmation_verifier.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
use {
crate::cluster_info_vote_listener::VoteTracker,
solana_ledger::blockstore::Blockstore,
solana_runtime::bank::Bank,
solana_sdk::{clock::Slot, hash::Hash, timing::timestamp},
std::{collections::BTreeSet, time::Instant},
};
pub struct OptimisticConfirmationVerifier {
snapshot_start_slot: Slot,
unchecked_slots: BTreeSet<(Slot, Hash)>,
last_optimistic_slot_ts: Instant,
}
impl OptimisticConfirmationVerifier {
pub fn new(snapshot_start_slot: Slot) -> Self {
Self {
snapshot_start_slot,
unchecked_slots: BTreeSet::default(),
last_optimistic_slot_ts: Instant::now(),
}
}
// Returns any optimistic slots that were not rooted
pub fn verify_for_unrooted_optimistic_slots(
&mut self,
root_bank: &Bank,
blockstore: &Blockstore,
) -> Vec<(Slot, Hash)> {
let root = root_bank.slot();
let root_ancestors = &root_bank.ancestors;
let slots_after_root = self
.unchecked_slots
.split_off(&((root + 1), Hash::default()));
// `slots_before_root` now contains all slots <= root
let slots_before_root = std::mem::replace(&mut self.unchecked_slots, slots_after_root);
slots_before_root
.into_iter()
.filter(|(optimistic_slot, optimistic_hash)| {
(*optimistic_slot == root && *optimistic_hash != root_bank.hash())
|| (!root_ancestors.contains_key(optimistic_slot) &&
// In this second part of the `and`, we account for the possibility that
// there was some other root `rootX` set in BankForks where:
//
// `root` > `rootX` > `optimistic_slot`
//
// in which case `root` may not contain the ancestor information for
// slots < `rootX`, so we also have to check if `optimistic_slot` was rooted
// through blockstore.
!blockstore.is_root(*optimistic_slot))
})
.collect()
}
pub fn add_new_optimistic_confirmed_slots(
&mut self,
new_optimistic_slots: Vec<(Slot, Hash)>,
blockstore: &Blockstore,
) {
if new_optimistic_slots.is_empty() {
return;
}
datapoint_info!(
"optimistic_slot_elapsed",
(
"average_elapsed_ms",
self.last_optimistic_slot_ts.elapsed().as_millis() as i64,
i64
),
);
// We don't have any information about ancestors before the snapshot root,
// so ignore those slots
for (new_optimistic_slot, hash) in new_optimistic_slots {
if new_optimistic_slot > self.snapshot_start_slot {
if let Err(e) = blockstore.insert_optimistic_slot(
new_optimistic_slot,
&hash,
timestamp().try_into().unwrap(),
) {
error!(
"failed to record optimistic slot in blockstore: slot={}: {:?}",
new_optimistic_slot, &e
);
}
datapoint_info!("optimistic_slot", ("slot", new_optimistic_slot, i64),);
self.unchecked_slots.insert((new_optimistic_slot, hash));
}
}
self.last_optimistic_slot_ts = Instant::now();
}
pub fn format_optimistic_confirmed_slot_violation_log(slot: Slot) -> String {
format!("Optimistically confirmed slot {slot} was not rooted")
}
pub fn log_unrooted_optimistic_slots(
root_bank: &Bank,
vote_tracker: &VoteTracker,
unrooted_optimistic_slots: &[(Slot, Hash)],
) {
let root = root_bank.slot();
for (optimistic_slot, hash) in unrooted_optimistic_slots.iter() {
let epoch = root_bank.epoch_schedule().get_epoch(*optimistic_slot);
let epoch_stakes = root_bank.epoch_stakes(epoch);
let total_epoch_stake = epoch_stakes.map(|e| e.total_stake()).unwrap_or(0);
let voted_stake = {
let slot_tracker = vote_tracker.get_slot_vote_tracker(*optimistic_slot);
let r_slot_tracker = slot_tracker.as_ref().map(|s| s.read().unwrap());
let voted_stake = r_slot_tracker
.as_ref()
.and_then(|s| s.optimistic_votes_tracker(hash))
.map(|s| s.stake())
.unwrap_or(0);
error!(
"{},
hash: {},
epoch: {},
voted keys: {:?},
root: {},
root bank hash: {},
voted stake: {},
total epoch stake: {},
pct: {}",
Self::format_optimistic_confirmed_slot_violation_log(*optimistic_slot),
hash,
epoch,
r_slot_tracker
.as_ref()
.and_then(|s| s.optimistic_votes_tracker(hash))
.map(|s| s.voted()),
root,
root_bank.hash(),
voted_stake,
total_epoch_stake,
voted_stake as f64 / total_epoch_stake as f64,
);
voted_stake
};
datapoint_warn!(
"optimistic_slot_not_rooted",
("slot", *optimistic_slot, i64),
("epoch", epoch, i64),
("root", root, i64),
("voted_stake", voted_stake, i64),
("total_epoch_stake", total_epoch_stake, i64),
);
}
}
}
#[cfg(test)]
mod test {
use {
super::*, crate::vote_simulator::VoteSimulator,
solana_ledger::get_tmp_ledger_path_auto_delete, solana_runtime::bank::Bank,
solana_sdk::pubkey::Pubkey, std::collections::HashMap, trees::tr,
};
#[test]
fn test_add_new_optimistic_confirmed_slots() {
let snapshot_start_slot = 10;
let bank_hash = Hash::default();
let mut optimistic_confirmation_verifier =
OptimisticConfirmationVerifier::new(snapshot_start_slot);
let blockstore_path = get_tmp_ledger_path_auto_delete!();
let blockstore = Blockstore::open(blockstore_path.path()).unwrap();
optimistic_confirmation_verifier.add_new_optimistic_confirmed_slots(
vec![(snapshot_start_slot - 1, bank_hash)],
&blockstore,
);
assert_eq!(blockstore.get_latest_optimistic_slots(10).unwrap().len(), 0);
optimistic_confirmation_verifier.add_new_optimistic_confirmed_slots(
vec![(snapshot_start_slot, bank_hash)],
&blockstore,
);
assert_eq!(blockstore.get_latest_optimistic_slots(10).unwrap().len(), 0);
optimistic_confirmation_verifier.add_new_optimistic_confirmed_slots(
vec![(snapshot_start_slot + 1, bank_hash)],
&blockstore,
);
assert_eq!(blockstore.get_latest_optimistic_slots(10).unwrap().len(), 1);
assert_eq!(optimistic_confirmation_verifier.unchecked_slots.len(), 1);
assert!(optimistic_confirmation_verifier
.unchecked_slots
.contains(&(snapshot_start_slot + 1, bank_hash)));
}
#[test]
fn test_get_unrooted_optimistic_slots_same_slot_different_hash() {
let snapshot_start_slot = 0;
let mut optimistic_confirmation_verifier =
OptimisticConfirmationVerifier::new(snapshot_start_slot);
let bad_bank_hash = Hash::new(&[42u8; 32]);
let blockstore_path = get_tmp_ledger_path_auto_delete!();
let blockstore = Blockstore::open(blockstore_path.path()).unwrap();
let optimistic_slots = vec![(1, bad_bank_hash), (3, Hash::default())];
optimistic_confirmation_verifier
.add_new_optimistic_confirmed_slots(optimistic_slots, &blockstore);
assert_eq!(blockstore.get_latest_optimistic_slots(10).unwrap().len(), 2);
let vote_simulator = setup_forks();
let bank1 = vote_simulator.bank_forks.read().unwrap().get(1).unwrap();
assert_eq!(
optimistic_confirmation_verifier
.verify_for_unrooted_optimistic_slots(&bank1, &blockstore),
vec![(1, bad_bank_hash)]
);
assert_eq!(optimistic_confirmation_verifier.unchecked_slots.len(), 1);
assert!(optimistic_confirmation_verifier
.unchecked_slots
.contains(&(3, Hash::default())));
}
#[test]
fn test_get_unrooted_optimistic_slots() {
let snapshot_start_slot = 0;
let mut optimistic_confirmation_verifier =
OptimisticConfirmationVerifier::new(snapshot_start_slot);
let blockstore_path = get_tmp_ledger_path_auto_delete!();
let blockstore = Blockstore::open(blockstore_path.path()).unwrap();
let mut vote_simulator = setup_forks();
let optimistic_slots: Vec<_> = vec![1, 3, 5]
.into_iter()
.map(|s| {
(
s,
vote_simulator
.bank_forks
.read()
.unwrap()
.get(s)
.unwrap()
.hash(),
)
})
.collect();
// If root is on same fork, nothing should be returned
optimistic_confirmation_verifier
.add_new_optimistic_confirmed_slots(optimistic_slots.clone(), &blockstore);
assert_eq!(blockstore.get_latest_optimistic_slots(10).unwrap().len(), 3);
let bank5 = vote_simulator.bank_forks.read().unwrap().get(5).unwrap();
assert!(optimistic_confirmation_verifier
.verify_for_unrooted_optimistic_slots(&bank5, &blockstore)
.is_empty());
// 5 is >= than all the unchecked slots, so should clear everything
assert!(optimistic_confirmation_verifier.unchecked_slots.is_empty());
// If root is on same fork, nothing should be returned
optimistic_confirmation_verifier
.add_new_optimistic_confirmed_slots(optimistic_slots.clone(), &blockstore);
let bank3 = vote_simulator.bank_forks.read().unwrap().get(3).unwrap();
assert!(optimistic_confirmation_verifier
.verify_for_unrooted_optimistic_slots(&bank3, &blockstore)
.is_empty());
// 3 is bigger than only slot 1, so slot 5 should be left over
assert_eq!(optimistic_confirmation_verifier.unchecked_slots.len(), 1);
assert!(optimistic_confirmation_verifier
.unchecked_slots
.contains(&optimistic_slots[2]));
// If root is on different fork, the slots < root on different fork should
// be returned
optimistic_confirmation_verifier
.add_new_optimistic_confirmed_slots(optimistic_slots.clone(), &blockstore);
let bank4 = vote_simulator.bank_forks.read().unwrap().get(4).unwrap();
assert_eq!(
optimistic_confirmation_verifier
.verify_for_unrooted_optimistic_slots(&bank4, &blockstore),
vec![optimistic_slots[1]]
);
// 4 is bigger than only slots 1 and 3, so slot 5 should be left over
assert_eq!(optimistic_confirmation_verifier.unchecked_slots.len(), 1);
assert!(optimistic_confirmation_verifier
.unchecked_slots
.contains(&optimistic_slots[2]));
// Now set a root at slot 5, purging BankForks of slots < 5
vote_simulator.set_root(5);
// Add a new bank 7 that descends from 6
let bank6 = vote_simulator.bank_forks.read().unwrap().get(6).unwrap();
vote_simulator
.bank_forks
.write()
.unwrap()
.insert(Bank::new_from_parent(bank6, &Pubkey::default(), 7));
let bank7 = vote_simulator.bank_forks.read().unwrap().get(7).unwrap();
assert!(!bank7.ancestors.contains_key(&3));
// Should return slots 1, 3 as part of the rooted fork because there's no
// ancestry information
optimistic_confirmation_verifier
.add_new_optimistic_confirmed_slots(optimistic_slots.clone(), &blockstore);
assert_eq!(
optimistic_confirmation_verifier
.verify_for_unrooted_optimistic_slots(&bank7, &blockstore),
optimistic_slots[0..=1].to_vec()
);
assert!(optimistic_confirmation_verifier.unchecked_slots.is_empty());
// If we know set the root in blockstore, should return nothing
blockstore.set_roots([1, 3].iter()).unwrap();
optimistic_confirmation_verifier
.add_new_optimistic_confirmed_slots(optimistic_slots, &blockstore);
assert!(optimistic_confirmation_verifier
.verify_for_unrooted_optimistic_slots(&bank7, &blockstore)
.is_empty());
assert!(optimistic_confirmation_verifier.unchecked_slots.is_empty());
assert_eq!(blockstore.get_latest_optimistic_slots(10).unwrap().len(), 3);
}
fn setup_forks() -> VoteSimulator {
/*
Build fork structure:
slot 0
|
slot 1
/ \
slot 2 |
| slot 3
slot 4 |
slot 5
|
slot 6
*/
let forks = tr(0) / (tr(1) / (tr(2) / (tr(4))) / (tr(3) / (tr(5) / (tr(6)))));
let mut vote_simulator = VoteSimulator::new(1);
vote_simulator.fill_bank_forks(forks, &HashMap::new(), true);
vote_simulator
}
}