-
Notifications
You must be signed in to change notification settings - Fork 79
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
feat: fees transactions order in mempool #492
Merged
Merged
Changes from 8 commits
Commits
Show all changes
10 commits
Select commit
Hold shift + click to select a range
13dccdf
feat: fees transactions order in mempool
Romsters 4046274
fix: fix locking
Romsters 1ca46ed
Merge branch 'main' of https://github.com/matter-labs/anvil-zksync in…
Romsters 5fce012
fix: lint
Romsters 68f20ff
fix: fix tests and refactoring
Romsters c122304
fix: make FIFO default tx order
Romsters d2dbdc3
chore: add tests
Romsters b7439f8
chore: rename transactions_order
Romsters ecfd109
Merge branch 'main' into add-pool-tx-order
Romsters 285aa1b
Merge branch 'main' into add-pool-tx-order
Romsters File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,57 @@ | ||
use std::fmt; | ||
use std::str::FromStr; | ||
use zksync_types::{l2::L2Tx, U256}; | ||
|
||
/// Metric value for the priority of a transaction. | ||
/// | ||
/// The `TransactionPriority` determines the ordering of two transactions. | ||
#[derive(Clone, Copy, Debug, Default, PartialEq, Eq, PartialOrd, Ord)] | ||
pub struct TransactionPriority(pub U256); | ||
|
||
/// Modes that determine the transaction ordering of the mempool | ||
/// | ||
/// This type controls the transaction order via the priority metric of a transaction | ||
#[derive(Clone, Copy, Debug, Default, PartialEq, Eq, serde::Serialize, serde::Deserialize)] | ||
pub enum TransactionOrder { | ||
/// Keep the pool transactions sorted in the order they arrive. | ||
/// | ||
/// This will essentially assign every transaction the exact priority so the order is | ||
/// determined by their internal submission number | ||
Fifo, | ||
/// This means that it prioritizes transactions based on the fees paid to the miner. | ||
#[default] | ||
Fees, | ||
} | ||
|
||
impl TransactionOrder { | ||
/// Returns the priority of the transactions | ||
pub fn priority(&self, tx: &L2Tx) -> TransactionPriority { | ||
match self { | ||
Self::Fifo => TransactionPriority::default(), | ||
Self::Fees => TransactionPriority(tx.common_data.fee.max_fee_per_gas), | ||
} | ||
} | ||
} | ||
|
||
impl FromStr for TransactionOrder { | ||
type Err = String; | ||
|
||
fn from_str(s: &str) -> Result<Self, Self::Err> { | ||
let s = s.to_lowercase(); | ||
let order = match s.as_str() { | ||
"fees" => Self::Fees, | ||
"fifo" => Self::Fifo, | ||
_ => return Err(format!("Unknown TransactionOrder: `{s}`")), | ||
}; | ||
Ok(order) | ||
} | ||
} | ||
|
||
impl fmt::Display for TransactionOrder { | ||
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { | ||
match *self { | ||
TransactionOrder::Fifo => f.write_str("fifo"), | ||
TransactionOrder::Fees => f.write_str("fees"), | ||
} | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.