From 887821e28d43cd5e6d910c2aa46fb24fed7d3fad Mon Sep 17 00:00:00 2001 From: 0o-de-lally <1364012+0o-de-lally@users.noreply.github.com> Date: Sun, 19 Jan 2025 14:32:40 -0500 Subject: [PATCH] include shuffle and sample step in end_epoch, tests failing --- .../sources/ol_sources/proof_of_fee.move | 70 ++++++++++++------- 1 file changed, 43 insertions(+), 27 deletions(-) diff --git a/framework/libra-framework/sources/ol_sources/proof_of_fee.move b/framework/libra-framework/sources/ol_sources/proof_of_fee.move index 8ab116f15..2129f0c94 100644 --- a/framework/libra-framework/sources/ol_sources/proof_of_fee.move +++ b/framework/libra-framework/sources/ol_sources/proof_of_fee.move @@ -40,10 +40,11 @@ // by account ancestry is used to prevent rapid accumulation of validator // roles See vouch.move for more detail. // # Algorithm -// 1. Receive bids throughout epoch. +// 1. Get prospective validators and their bids. // During the normal operation of the blockchain prospective validators can // bid their net reward. See set_bid(). The number of prospective validators // is referred to `m` below. + // 2. The size of the incoming validator set is determined. // Orthogonal to Proof of Fee the validator set size must be calculated first. // Libra uses "Musical Chairs" algorithm to do so: see musical_chairs.move @@ -51,9 +52,15 @@ // determined. The set size is always smaller than the number of bidders, and // in the event of many more prospective validators than seats the set can // increase if the previous validator set has performed perfectly. The -// output here is `n` seats +// output here is `n` seats. +// In order to make sure that the next epoch does not halt from unprepared +// validators which are off-line doing operational preparations to join +// Musical chairs has two steps in seating the `n` seats: +// a) allowing know performant validators to sit first (up to 2/3 * n) +// b) let unknown validators sit next. // See calculate_final_set_size() -// 2. Sortition the bids at epoch boundary + +// 3. Pick winners with random sample (sortition) // Next the transition of the epoch, the auction will conclude and // results computed. // This begins with the sortition of the prospective validator bids, for m bidders, there are n seats a. @@ -61,15 +68,19 @@ // requested rewards. Effectively the lowest cost providers have a higher // chance to enter the set. Including step will filter shill bids do distort // the auction reward (e.g. 100% net reward). +// In this step we additionally check the qualifications of the validator. -// 3. Next the auction finds the clearing price +// 4. Determine clearing price // The clearing price is set by the last bid (most expensive provider). // The clearing price sets the reward for all validators in the // incoming validator set. The weighted sample for the earlier set is sorted // to select clearing price. -// 4. Set constants and return +// 5. Set results in history state // Results of the auction are stored into the root state. See set_history() + +// 6. Charge validators and return +// Incoming validators are charged their entry fee (before they get paid) // This module returns the validator set, and the clearing price to calling module, reconfiguration.move. /////////////////////////////////////////////////////////////////////////// @@ -222,11 +233,11 @@ module ol_framework::proof_of_fee { } /// Consolidates all the logic for the epoch boundary, including: - /// 1. Getting the sorted bidders, - /// 2. Calculate final validators set size (number of seats to fill), - /// 3. Filling the seats, - /// 4. Getting a price, - /// 5. Finally charging the validators for their bid (everyone pays the lowest) + /// 1. Calculate final validators set size (number of seats to fill), + /// 2. Sortition: Filling the seats with randomness, + /// 3. Getting the clearing price, + /// 4. Save history + /// 5. Charging the validators for their bid (everyone pays the lowest) /// For audit instrumentation returns: final set size, auction winners, all the bidders, (including not-qualified), and all qualified bidders. /// We also return the auction entry price (clearing price) /// (final_set_size, auction_winners, all_bidders, only_qualified_bidders, actually_paid, entry_fee) @@ -237,9 +248,13 @@ module ol_framework::proof_of_fee { ): (vector
, vector
, vector
, u64) acquires ProofOfFeeAuction, ConsensusReward { system_addresses::assert_ol(vm); + // 1. Get prospective validators and their bids. + let all_bidders = get_bidders(false); let only_qualified_bidders = get_bidders(true); + // 2. The size of the incoming validator set is determined. + // Calculate the final set size considering the number of compliant validators, // number of qualified bidders, and musical chairs set size suggestion let final_set_size = calculate_final_set_size( @@ -247,10 +262,16 @@ module ol_framework::proof_of_fee { vector::length(&only_qualified_bidders), mc_set_size); + // 3. Pick winners with random sample (sortition) + // TODO: sortition + let winning_validators = shuffle_and_sample(only_qualified_bidders, final_set_size); + // 4. Determine clearing price + // 5. Set results in history state + // 6. Charge validators and return // This is the core of the mechanism, the uniform price auction // the winners of the auction will be the validator set. // Other lists are created for audit purposes of the BoundaryStatus - let (auction_winners, entry_fee, _clearing_bid, _proven, _unproven) = fill_seats_and_get_price(vm, final_set_size, &only_qualified_bidders, outgoing_compliant_set); + let (auction_winners, entry_fee, _clearing_bid, _proven, _unproven) = fill_seats_and_get_price(vm, final_set_size, &winning_validators, outgoing_compliant_set); (auction_winners, all_bidders, only_qualified_bidders, entry_fee) } @@ -328,7 +349,7 @@ module ol_framework::proof_of_fee { #[view] public fun get_bidders(remove_unqualified: bool): vector
acquires ProofOfFeeAuction, ConsensusReward { let eligible_validators = validator_universe::get_eligible_validators(); - let (bidders, _) = sort_vals_impl(&eligible_validators, remove_unqualified); + let (bidders, _) = sort_auction_bids(&eligible_validators, remove_unqualified); bidders } @@ -336,7 +357,7 @@ module ol_framework::proof_of_fee { // same as get bidders, but returns the bid public fun get_bidders_and_bids(remove_unqualified: bool): (vector
, vector) acquires ProofOfFeeAuction, ConsensusReward { let eligible_validators = validator_universe::get_eligible_validators(); - sort_vals_impl(&eligible_validators, remove_unqualified) + sort_auction_bids(&eligible_validators, remove_unqualified) } fun shuffle_and_sample(eligible_validators: vector
, n: u64): vector
acquires ProofOfFeeAuction { @@ -367,8 +388,8 @@ module ol_framework::proof_of_fee { }; return selected } - // returns two lists: ordered bidder addresss and the list of bids bid - fun sort_vals_impl(eligible_validators: &vector
, remove_unqualified: bool): (vector
, vector) acquires ProofOfFeeAuction, ConsensusReward { + // returns two lists: ordered bidder address and the list of bids bid + fun sort_auction_bids(eligible_validators: &vector
, remove_unqualified: bool): (vector
, vector) acquires ProofOfFeeAuction, ConsensusReward { let length = vector::length
(eligible_validators); @@ -397,7 +418,7 @@ module ol_framework::proof_of_fee { vector::reverse(&mut filtered_vals); vector::reverse(&mut bids); - // Shuffle duplicates to garantee randomness/fairness + // Shuffle duplicates to guarantee randomness/fairness address_utils::shuffle_duplicates(&mut filtered_vals, &mut bids); return (filtered_vals, bids) @@ -423,8 +444,6 @@ module ol_framework::proof_of_fee { public fun calculate_min_vouches_required(set_size: u64): u64 { let required = globals::get_validator_vouch_threshold(); - // TODO: set a features switch here - //if (false) { if (set_size > VAL_BOOT_UP_THRESHOLD) { // dynamically increase the amount of social proofing as the // validator set increases @@ -433,7 +452,6 @@ module ol_framework::proof_of_fee { globals::get_max_vouches_per_validator() - VOUCH_MARGIN ); }; - //}; required } @@ -478,7 +496,7 @@ module ol_framework::proof_of_fee { // The Validator must qualify on a number of metrics: // 1. have funds in their Unlocked account to cover bid, - // 2. have miniumum viable vouches, + // 2. have minimum viable vouches, // 3. and not have been jailed in the previous round. /// Showtime. @@ -500,17 +518,16 @@ module ol_framework::proof_of_fee { ): (vector
, u64, u64, vector
, vector
) acquires ProofOfFeeAuction, ConsensusReward { system_addresses::assert_ol(vm); - // NOTE: this is duplicate work, but we are double checking we are getting a proper sort. - let (sorted_vals_by_bid, _) = sort_vals_impl(sorted_vals_by_bid, true); + // NOTE: this is call is repetitive, though we use it to remove unqualified + // bidders. + // TODO: separate qualification loop, from sorting. + let (sorted_vals_by_bid, _) = sort_auction_bids(sorted_vals_by_bid, true); - // Now we can seat the validators based on the algo: + // Now we can seat the validators based on the musical chairs algo: // A. seat the highest bidding 2/3 proven nodes of previous epoch // B. seat the remainder 1/3 of highest bidding validators which may or MA NOT have participated in the previous epoch. Note: We assume jailed validators are not in qualified bidder list anyways, but we should check again // The way to achieve this with minimal looping, is by going through the list and adding every bidder, but once the quota of unproven nodes is full, only proven nodes can be added. - // TODO: include jail reputation - // B1. first, seat any vals with jail reputation < 2. - // B2. then, if there are still seats, seat the remainder of the unproven vals with any jail reputation. let unproven_quota = final_set_size / 3; let proposed_validators = vector::empty
(); @@ -951,7 +968,6 @@ module ol_framework::proof_of_fee { /// retract bid public entry fun pof_retract_bid(sender: signer) acquires ProofOfFeeAuction { - // retract a bid retract_bid(&sender); }