@@ -21,16 +21,11 @@ use {
21
21
// publisher slots on Pythnet are working. Here's how this works:
22
22
//
23
23
// * Fill all publisher slots on a price
24
- // * Divide the price component array into three parts roughly the
25
- // same size: first_third, middle_third and last_third
26
- // * Publish two distinct price values to first/mid third
24
+ // * Divide the price component array into two even halves: first_half, second_half
25
+ // * Publish two distinct price values to either half
27
26
// * Verify that the aggregate averages out to an expected value in the middle
28
- // * Publish PC_STATUS_UNKNOWN prices to first_third to make sure it does not affect later aggregates
29
- // * Repeat the two-price-value publishing step, using completely
30
- // different values, this time using mid_third and last_third without first_third
31
- // * Verify again for the new values meeting in the middle as aggregate.
32
27
#[ tokio:: test]
33
- async fn test_full_publisher_set_two_thirds ( ) -> Result < ( ) , Box < dyn std:: error:: Error > > {
28
+ async fn test_full_publisher_set ( ) -> Result < ( ) , Box < dyn std:: error:: Error > > {
34
29
let mut sim = PythSimulator :: new ( ) . await ;
35
30
let pub_keypairs: Vec < _ > = ( 0 ..PC_NUM_COMP ) . map ( |_idx| Keypair :: new ( ) ) . collect ( ) ;
36
31
let pub_pubkeys: Vec < _ > = pub_keypairs. iter ( ) . map ( |kp| kp. pubkey ( ) ) . collect ( ) ;
@@ -44,7 +39,7 @@ async fn test_full_publisher_set_two_thirds() -> Result<(), Box<dyn std::error::
44
39
45
40
let n_pubs = pub_keypairs. len ( ) ;
46
41
47
- // Divide publishers into two even parts
42
+ // Divide publishers into two even parts (assuming the max PC_NUM_COMP size is even)
48
43
let ( first_half, second_half) = pub_keypairs. split_at ( n_pubs / 2 ) ;
49
44
50
45
// Starting with the first publisher in each half, publish an update
0 commit comments