This is the cap of the size of the anticone barrier. If we have more
than this number we will use the brute_force O(n) algorithm instead.
This is the cap of the size of blockset_in_own_view_of_epoch. If we
have more than this number, we will not store it in memory
The initial storage point proportion after CIP107 is enabled.
The initial base price share proportion after CIP137 is enabled.
The minimum timer diff value for the adaptive test in confirmation meter
to consider
The maximum value of adaptive block generation risk that a confirmation
meter is going to consider safe to assume no adaptive blocks in the
near future.
The maximum number of epochs that the confirmation meter tries to
maintain internally.
This is the minimum risk that the confirmation meter tries to maintain.
The batch step in the confirmation meter to do the adaptive test
This controls how often the confirmation meter updates. The default is
to update the meter every 20 blocks. Note that confirmation meter
update is CPU intensive if the tree graph is in a unstable state.
The maximum number of blocks to be executed in each epoch
The initial and minimum base price
Here is the delay for us to recycle those orphaned blocks in the
boundary of eras and large epochs.
REWARD_EPOCH_COUNT needs to be larger than
ANTICONE_PENALTY_UPPER_EPOCH_COUNT. If we cannot cache receipts of
recent REWARD_EPOCH_COUNT epochs, the receipts will be loaded from
db, which may lead to performance downgrade