solana_runtime/prioritization_fee.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
use {
solana_measure::measure,
solana_sdk::{clock::Slot, pubkey::Pubkey, saturating_add_assign},
std::collections::HashMap,
};
#[derive(Debug, Default)]
struct PrioritizationFeeMetrics {
// Count of writable accounts in slot
total_writable_accounts_count: u64,
// Count of writeable accounts with a minimum prioritization fee higher than the minimum transaction
// fee for this slot.
relevant_writable_accounts_count: u64,
// Count of transactions that have non-zero prioritization fee.
prioritized_transactions_count: u64,
// Count of transactions that have zero prioritization fee.
non_prioritized_transactions_count: u64,
// Count of attempted update on finalized PrioritizationFee
attempted_update_on_finalized_fee_count: u64,
// Total prioritization fees included in this slot.
total_prioritization_fee: u64,
// The minimum prioritization fee of prioritized transactions in this slot.
min_prioritization_fee: Option<u64>,
// The maximum prioritization fee of prioritized transactions in this slot.
max_prioritization_fee: u64,
// Accumulated time spent on tracking prioritization fee for each slot.
total_update_elapsed_us: u64,
}
impl PrioritizationFeeMetrics {
fn accumulate_total_prioritization_fee(&mut self, val: u64) {
saturating_add_assign!(self.total_prioritization_fee, val);
}
fn accumulate_total_update_elapsed_us(&mut self, val: u64) {
saturating_add_assign!(self.total_update_elapsed_us, val);
}
fn increment_attempted_update_on_finalized_fee_count(&mut self, val: u64) {
saturating_add_assign!(self.attempted_update_on_finalized_fee_count, val);
}
fn update_prioritization_fee(&mut self, fee: u64) {
if fee == 0 {
saturating_add_assign!(self.non_prioritized_transactions_count, 1);
return;
}
// update prioritized transaction fee metrics.
saturating_add_assign!(self.prioritized_transactions_count, 1);
self.max_prioritization_fee = self.max_prioritization_fee.max(fee);
self.min_prioritization_fee = Some(
self.min_prioritization_fee
.map_or(fee, |min_fee| min_fee.min(fee)),
);
}
fn report(&self, slot: Slot) {
datapoint_info!(
"block_prioritization_fee",
("slot", slot as i64, i64),
(
"total_writable_accounts_count",
self.total_writable_accounts_count as i64,
i64
),
(
"relevant_writable_accounts_count",
self.relevant_writable_accounts_count as i64,
i64
),
(
"prioritized_transactions_count",
self.prioritized_transactions_count as i64,
i64
),
(
"non_prioritized_transactions_count",
self.non_prioritized_transactions_count as i64,
i64
),
(
"attempted_update_on_finalized_fee_count",
self.attempted_update_on_finalized_fee_count as i64,
i64
),
(
"total_prioritization_fee",
self.total_prioritization_fee as i64,
i64
),
(
"min_prioritization_fee",
self.min_prioritization_fee.unwrap_or(0) as i64,
i64
),
(
"max_prioritization_fee",
self.max_prioritization_fee as i64,
i64
),
(
"total_update_elapsed_us",
self.total_update_elapsed_us as i64,
i64
),
);
}
}
#[derive(Debug)]
pub enum PrioritizationFeeError {
// Not able to get account locks from sanitized transaction, which is required to update block
// minimum fees.
FailGetTransactionAccountLocks,
// Not able to read priority details, including compute-unit price, from transaction.
// Compute-unit price is required to update block minimum fees.
FailGetTransactionPriorityDetails,
// Block is already finalized, trying to finalize it again is usually unexpected
BlockIsAlreadyFinalized,
}
/// Block minimum prioritization fee stats, includes the minimum prioritization fee for a transaction in this
/// block; and the minimum fee for each writable account in all transactions in this block. The only relevant
/// write account minimum fees are those greater than the block minimum transaction fee, because the minimum fee needed to land
/// a transaction is determined by Max( min_transaction_fee, min_writable_account_fees(key), ...)
#[derive(Debug)]
pub struct PrioritizationFee {
// The minimum prioritization fee of transactions that landed in this block.
min_transaction_fee: u64,
// The minimum prioritization fee of each writable account in transactions in this block.
min_writable_account_fees: HashMap<Pubkey, u64>,
// Default to `false`, set to `true` when a block is completed, therefore the minimum fees recorded
// are finalized, and can be made available for use (e.g., RPC query)
is_finalized: bool,
// slot prioritization fee metrics
metrics: PrioritizationFeeMetrics,
}
impl Default for PrioritizationFee {
fn default() -> Self {
PrioritizationFee {
min_transaction_fee: u64::MAX,
min_writable_account_fees: HashMap::new(),
is_finalized: false,
metrics: PrioritizationFeeMetrics::default(),
}
}
}
impl PrioritizationFee {
/// Update self for minimum transaction fee in the block and minimum fee for each writable account.
pub fn update(
&mut self,
transaction_fee: u64,
writable_accounts: &[Pubkey],
) -> Result<(), PrioritizationFeeError> {
let (_, update_time) = measure!(
{
if !self.is_finalized {
if transaction_fee < self.min_transaction_fee {
self.min_transaction_fee = transaction_fee;
}
for write_account in writable_accounts.iter() {
self.min_writable_account_fees
.entry(*write_account)
.and_modify(|write_lock_fee| {
*write_lock_fee = std::cmp::min(*write_lock_fee, transaction_fee)
})
.or_insert(transaction_fee);
}
self.metrics
.accumulate_total_prioritization_fee(transaction_fee);
self.metrics.update_prioritization_fee(transaction_fee);
} else {
self.metrics
.increment_attempted_update_on_finalized_fee_count(1);
}
},
"update_time",
);
self.metrics
.accumulate_total_update_elapsed_us(update_time.as_us());
Ok(())
}
/// Accounts that have minimum fees lesser or equal to the minimum fee in the block are redundant, they are
/// removed to reduce memory footprint when mark_block_completed() is called.
fn prune_irrelevant_writable_accounts(&mut self) {
self.metrics.total_writable_accounts_count = self.get_writable_accounts_count() as u64;
self.min_writable_account_fees
.retain(|_, account_fee| account_fee > &mut self.min_transaction_fee);
self.metrics.relevant_writable_accounts_count = self.get_writable_accounts_count() as u64;
}
pub fn mark_block_completed(&mut self) -> Result<(), PrioritizationFeeError> {
if self.is_finalized {
return Err(PrioritizationFeeError::BlockIsAlreadyFinalized);
}
self.prune_irrelevant_writable_accounts();
self.is_finalized = true;
Ok(())
}
pub fn get_min_transaction_fee(&self) -> Option<u64> {
(self.min_transaction_fee != u64::MAX).then_some(self.min_transaction_fee)
}
pub fn get_writable_account_fee(&self, key: &Pubkey) -> Option<u64> {
self.min_writable_account_fees.get(key).copied()
}
pub fn get_writable_account_fees(&self) -> impl Iterator<Item = (&Pubkey, &u64)> {
self.min_writable_account_fees.iter()
}
pub fn get_writable_accounts_count(&self) -> usize {
self.min_writable_account_fees.len()
}
pub fn is_finalized(&self) -> bool {
self.is_finalized
}
pub fn report_metrics(&self, slot: Slot) {
self.metrics.report(slot);
// report this slot's min_transaction_fee and top 10 min_writable_account_fees
let min_transaction_fee = self.get_min_transaction_fee().unwrap_or(0);
let mut accounts_fees: Vec<_> = self.get_writable_account_fees().collect();
accounts_fees.sort_by(|lh, rh| rh.1.cmp(lh.1));
datapoint_info!(
"block_min_prioritization_fee",
("slot", slot as i64, i64),
("entity", "block", String),
("min_prioritization_fee", min_transaction_fee as i64, i64),
);
for (account_key, fee) in accounts_fees.iter().take(10) {
datapoint_trace!(
"block_min_prioritization_fee",
("slot", slot as i64, i64),
("entity", account_key.to_string(), String),
("min_prioritization_fee", **fee as i64, i64),
);
}
}
}
#[cfg(test)]
mod tests {
use {super::*, solana_sdk::pubkey::Pubkey};
#[test]
fn test_update_prioritization_fee() {
solana_logger::setup();
let write_account_a = Pubkey::new_unique();
let write_account_b = Pubkey::new_unique();
let write_account_c = Pubkey::new_unique();
let mut prioritization_fee = PrioritizationFee::default();
assert!(prioritization_fee.get_min_transaction_fee().is_none());
// Assert for 1st transaction
// [fee, write_accounts...] --> [block, account_a, account_b, account_c]
// -----------------------------------------------------------------------
// [5, a, b ] --> [5, 5, 5, nil ]
{
assert!(prioritization_fee
.update(5, &[write_account_a, write_account_b])
.is_ok());
assert_eq!(5, prioritization_fee.get_min_transaction_fee().unwrap());
assert_eq!(
5,
prioritization_fee
.get_writable_account_fee(&write_account_a)
.unwrap()
);
assert_eq!(
5,
prioritization_fee
.get_writable_account_fee(&write_account_b)
.unwrap()
);
assert!(prioritization_fee
.get_writable_account_fee(&write_account_c)
.is_none());
}
// Assert for second transaction:
// [fee, write_accounts...] --> [block, account_a, account_b, account_c]
// -----------------------------------------------------------------------
// [9, b, c ] --> [5, 5, 5, 9 ]
{
assert!(prioritization_fee
.update(9, &[write_account_b, write_account_c])
.is_ok());
assert_eq!(5, prioritization_fee.get_min_transaction_fee().unwrap());
assert_eq!(
5,
prioritization_fee
.get_writable_account_fee(&write_account_a)
.unwrap()
);
assert_eq!(
5,
prioritization_fee
.get_writable_account_fee(&write_account_b)
.unwrap()
);
assert_eq!(
9,
prioritization_fee
.get_writable_account_fee(&write_account_c)
.unwrap()
);
}
// Assert for third transaction:
// [fee, write_accounts...] --> [block, account_a, account_b, account_c]
// -----------------------------------------------------------------------
// [2, a, c ] --> [2, 2, 5, 2 ]
{
assert!(prioritization_fee
.update(2, &[write_account_a, write_account_c])
.is_ok());
assert_eq!(2, prioritization_fee.get_min_transaction_fee().unwrap());
assert_eq!(
2,
prioritization_fee
.get_writable_account_fee(&write_account_a)
.unwrap()
);
assert_eq!(
5,
prioritization_fee
.get_writable_account_fee(&write_account_b)
.unwrap()
);
assert_eq!(
2,
prioritization_fee
.get_writable_account_fee(&write_account_c)
.unwrap()
);
}
// assert after prune, account a and c should be removed from cache to save space
{
prioritization_fee.prune_irrelevant_writable_accounts();
assert_eq!(1, prioritization_fee.min_writable_account_fees.len());
assert_eq!(2, prioritization_fee.get_min_transaction_fee().unwrap());
assert!(prioritization_fee
.get_writable_account_fee(&write_account_a)
.is_none());
assert_eq!(
5,
prioritization_fee
.get_writable_account_fee(&write_account_b)
.unwrap()
);
assert!(prioritization_fee
.get_writable_account_fee(&write_account_c)
.is_none());
}
}
#[test]
fn test_mark_block_completed() {
let mut prioritization_fee = PrioritizationFee::default();
assert!(prioritization_fee.mark_block_completed().is_ok());
assert!(prioritization_fee.mark_block_completed().is_err());
}
}