@@ -63,58 +63,6 @@ declare module '@polkadot/api-base/types/consts' {
6363 **/
6464 [ key : string ] : Codec ;
6565 } ;
66- bagsList : {
67- /**
68- * The list of thresholds separating the various bags.
69- *
70- * Ids are separated into unsorted bags according to their score. This specifies the
71- * thresholds separating the bags. An id's bag is the largest bag for which the id's score
72- * is less than or equal to its upper threshold.
73- *
74- * When ids are iterated, higher bags are iterated completely before lower bags. This means
75- * that iteration is _semi-sorted_: ids of higher score tend to come before ids of lower
76- * score, but peer ids within a particular bag are sorted in insertion order.
77- *
78- * # Expressing the constant
79- *
80- * This constant must be sorted in strictly increasing order. Duplicate items are not
81- * permitted.
82- *
83- * There is an implied upper limit of `Score::MAX`; that value does not need to be
84- * specified within the bag. For any two threshold lists, if one ends with
85- * `Score::MAX`, the other one does not, and they are otherwise equal, the two
86- * lists will behave identically.
87- *
88- * # Calculation
89- *
90- * It is recommended to generate the set of thresholds in a geometric series, such that
91- * there exists some constant ratio such that `threshold[k + 1] == (threshold[k] *
92- * constant_ratio).max(threshold[k] + 1)` for all `k`.
93- *
94- * The helpers in the `/utils/frame/generate-bags` module can simplify this calculation.
95- *
96- * # Examples
97- *
98- * - If `BagThresholds::get().is_empty()`, then all ids are put into the same bag, and
99- * iteration is strictly in insertion order.
100- * - If `BagThresholds::get().len() == 64`, and the thresholds are determined according to
101- * the procedure given above, then the constant ratio is equal to 2.
102- * - If `BagThresholds::get().len() == 200`, and the thresholds are determined according to
103- * the procedure given above, then the constant ratio is approximately equal to 1.248.
104- * - If the threshold list begins `[1, 2, 3, ...]`, then an id with score 0 or 1 will fall
105- * into bag 0, an id with score 2 will fall into bag 1, etc.
106- *
107- * # Migration
108- *
109- * In the event that this list ever changes, a copy of the old bags list must be retained.
110- * With that `List::migrate` can be called, which will perform the appropriate migration.
111- **/
112- bagThresholds : Vec < u64 > & AugmentedConst < ApiType > ;
113- /**
114- * Generic const
115- **/
116- [ key : string ] : Codec ;
117- } ;
11866 balances : {
11967 /**
12068 * The minimum amount required to keep an account open.
@@ -304,20 +252,6 @@ declare module '@polkadot/api-base/types/consts' {
304252 * take place over multiple blocks.
305253 **/
306254 maxElectingVoters : u32 & AugmentedConst < ApiType > ;
307- /**
308- * Maximum length (bytes) that the mined solution should consume.
309- *
310- * The miner will ensure that the total length of the unsigned solution will not exceed
311- * this value.
312- **/
313- minerMaxLength : u32 & AugmentedConst < ApiType > ;
314- /**
315- * Maximum weight that the miner should consume.
316- *
317- * The miner will ensure that the total weight of the unsigned solution will not exceed
318- * this value, based on [`WeightInfo::submit_unsigned`].
319- **/
320- minerMaxWeight : u64 & AugmentedConst < ApiType > ;
321255 /**
322256 * The priority of the unsigned transaction submitted in the unsigned-phase
323257 **/
@@ -358,7 +292,9 @@ declare module '@polkadot/api-base/types/consts' {
358292 /**
359293 * Maximum weight of a signed solution.
360294 *
361- * This should probably be similar to [`Config::MinerMaxWeight`].
295+ * If [`Config::MinerConfig`] is being implemented to submit signed solutions (outside of
296+ * this pallet), then [`MinerConfig::solution_weight`] is used to compare against
297+ * this value.
362298 **/
363299 signedMaxWeight : u64 & AugmentedConst < ApiType > ;
364300 /**
@@ -519,6 +455,24 @@ declare module '@polkadot/api-base/types/consts' {
519455 **/
520456 [ key : string ] : Codec ;
521457 } ;
458+ nominationPools : {
459+ /**
460+ * The minimum pool points-to-balance ratio that must be maintained for it to be `open`.
461+ * This is important in the event slashing takes place and the pool's points-to-balance
462+ * ratio becomes disproportional.
463+ * For a value of 10, the threshold would be a pool points-to-balance ratio of 10:1.
464+ * Such a scenario would also be the equivalent of the pool being 90% slashed.
465+ **/
466+ minPointsToBalance : u32 & AugmentedConst < ApiType > ;
467+ /**
468+ * The nomination pool's pallet id.
469+ **/
470+ palletId : FrameSupportPalletId & AugmentedConst < ApiType > ;
471+ /**
472+ * Generic const
473+ **/
474+ [ key : string ] : Codec ;
475+ } ;
522476 paras : {
523477 unsignedPriority : u64 & AugmentedConst < ApiType > ;
524478 /**
@@ -945,5 +899,57 @@ declare module '@polkadot/api-base/types/consts' {
945899 **/
946900 [ key : string ] : Codec ;
947901 } ;
902+ voterList : {
903+ /**
904+ * The list of thresholds separating the various bags.
905+ *
906+ * Ids are separated into unsorted bags according to their score. This specifies the
907+ * thresholds separating the bags. An id's bag is the largest bag for which the id's score
908+ * is less than or equal to its upper threshold.
909+ *
910+ * When ids are iterated, higher bags are iterated completely before lower bags. This means
911+ * that iteration is _semi-sorted_: ids of higher score tend to come before ids of lower
912+ * score, but peer ids within a particular bag are sorted in insertion order.
913+ *
914+ * # Expressing the constant
915+ *
916+ * This constant must be sorted in strictly increasing order. Duplicate items are not
917+ * permitted.
918+ *
919+ * There is an implied upper limit of `Score::MAX`; that value does not need to be
920+ * specified within the bag. For any two threshold lists, if one ends with
921+ * `Score::MAX`, the other one does not, and they are otherwise equal, the two
922+ * lists will behave identically.
923+ *
924+ * # Calculation
925+ *
926+ * It is recommended to generate the set of thresholds in a geometric series, such that
927+ * there exists some constant ratio such that `threshold[k + 1] == (threshold[k] *
928+ * constant_ratio).max(threshold[k] + 1)` for all `k`.
929+ *
930+ * The helpers in the `/utils/frame/generate-bags` module can simplify this calculation.
931+ *
932+ * # Examples
933+ *
934+ * - If `BagThresholds::get().is_empty()`, then all ids are put into the same bag, and
935+ * iteration is strictly in insertion order.
936+ * - If `BagThresholds::get().len() == 64`, and the thresholds are determined according to
937+ * the procedure given above, then the constant ratio is equal to 2.
938+ * - If `BagThresholds::get().len() == 200`, and the thresholds are determined according to
939+ * the procedure given above, then the constant ratio is approximately equal to 1.248.
940+ * - If the threshold list begins `[1, 2, 3, ...]`, then an id with score 0 or 1 will fall
941+ * into bag 0, an id with score 2 will fall into bag 1, etc.
942+ *
943+ * # Migration
944+ *
945+ * In the event that this list ever changes, a copy of the old bags list must be retained.
946+ * With that `List::migrate` can be called, which will perform the appropriate migration.
947+ **/
948+ bagThresholds : Vec < u64 > & AugmentedConst < ApiType > ;
949+ /**
950+ * Generic const
951+ **/
952+ [ key : string ] : Codec ;
953+ } ;
948954 } // AugmentedConsts
949955} // declare module
0 commit comments