A vector of normal priority feerate values. The first value of this vector is guaranteed to exist and
provide an estimation for sub-minute DAG inclusion. All other values will have shorter estimation
times than all low_bucket
values. Therefor by chaining [priority] | normal | low
and interpolating
between them, one can compose a complete feerate function on the client side. The API makes an effort
to sample enough "interesting" points on the feerate-to-time curve, so that the interpolation is meaningful.
Top-priority feerate bucket. Provides an estimation of the feerate required for sub-second DAG inclusion.
Note: for all buckets, feerate values represent fee/mass of a transaction in sompi/gram
units.
Given a feerate value recommendation, calculate the required fee by
taking the transaction mass and multiplying it by feerate: fee = feerate * mass(tx)
Generated using TypeDoc
An array of low priority feerate values. The first value of this vector is guaranteed to exist and provide an estimation for sub-hour DAG inclusion.