mirror of
https://github.com/serai-dex/serai.git
synced 2025-12-09 12:49:23 +00:00
ff95c58341
Ensures the block's size limit is respected. Defines a policy for weights. While I'm unsure I want to commit to this forever, I do want to acknowledge it's valid and well-defined. Cleans up the `serai-runtime` crate a bit with further modules in the `wasm` folder.
35 lines
1.6 KiB
Rust
35 lines
1.6 KiB
Rust
use sp_core::Get;
|
|
use frame_support::weights::Weight;
|
|
use frame_system::limits::{BlockLength, BlockWeights};
|
|
|
|
/// The limits for the Serai protocol.
|
|
pub struct Limits;
|
|
impl Get<BlockLength> for Limits {
|
|
fn get() -> BlockLength {
|
|
/*
|
|
We do not reserve an allocation for mandatory/operational transactions, assuming they'll be
|
|
prioritized in the mempool. This does technically give block producers an inventive to
|
|
misbehave by on-purposely favoring paying non-operational transactions over operational
|
|
transactions, but ensures the entire block is available to the transactions actually present
|
|
in the mempool.
|
|
*/
|
|
BlockLength::max(u32::try_from(serai_abi::Block::SIZE_LIMIT).unwrap())
|
|
}
|
|
}
|
|
impl Get<BlockWeights> for Limits {
|
|
fn get() -> BlockWeights {
|
|
/*
|
|
While Serai does limit the size of a block, every transaction is expected to operate in
|
|
complexity constant to the current state size, regardless of what the state is. Accordingly,
|
|
the most efficient set of transactions (basic transfers?) is expected to be within an order
|
|
of magnitude of the most expensive transactions (multi-pool swaps?).
|
|
|
|
Instead of engaging with the complexity within the consensus protocol of metering both
|
|
bandwidth and computation, we do not define limits for weights. We do, however, still use the
|
|
weight system in order to determine fee rates and ensure prioritization to
|
|
computationally-cheaper transactions. That solely serves as mempool policy however.
|
|
*/
|
|
BlockWeights::simple_max(Weight::MAX)
|
|
}
|
|
}
|