test: e2e with queues with random capacities

test-utils/src/e2e_test_env.rs

@@ -69,6 +69,7 @@
 // refactor all tests to work with that so that we can run all tests with a test validator and concurrency
 
 use light_indexed_merkle_tree::HIGHEST_ADDRESS_PLUS_ONE;
+use light_utils::rand::gen_prime;
 use solana_sdk::signature::Signature;
 use spl_token::solana_program::native_token::LAMPORTS_PER_SOL;
 
@@ -101,6 +102,7 @@ use light_indexed_merkle_tree::{array::IndexedArray, reference::IndexedMerkleTre
 
 use account_compression::{
     AddressMerkleTreeConfig, AddressQueueConfig, NullifierQueueConfig, StateMerkleTreeConfig,
+    SAFETY_MARGIN,
 };
 use light_system_program::sdk::compressed_account::CompressedAccountWithMerkleContext;
 use light_utils::bigint::bigint_to_be_bytes_array;
@@ -348,7 +350,7 @@ where
         } else {
             None
         };
-        let config = if !self.keypair_action_config.fee_assert {
+        let merkle_tree_config = if !self.keypair_action_config.fee_assert {
             StateMerkleTreeConfig {
                 height: 26,
                 changelog_size: self.rng.gen_range(1..5000),
@@ -361,7 +363,18 @@ where
         } else {
             StateMerkleTreeConfig::default()
         };
-        println!("config: {:?}", config);
+        println!("merkle tree config: {:?}", merkle_tree_config);
+        let queue_config = if !self.keypair_action_config.fee_assert {
+            let capacity: f64 = gen_prime(&mut self.rng, 1.0..10000.0).unwrap();
+            NullifierQueueConfig {
+                capacity: capacity as u16,
+                sequence_threshold: merkle_tree_config.roots_size + SAFETY_MARGIN,
+                network_fee: None,
+            }
+        } else {
+            NullifierQueueConfig::default()
+        };
+        println!("queue config: {:?}", queue_config);
         create_state_merkle_tree_and_queue_account(
             &self.payer,
             &self.indexer.group_pda,
@@ -370,7 +383,8 @@ where
             &nullifier_queue_keypair,
             None,
             1,
-            config,
+            &merkle_tree_config,
+            &queue_config,
         )
         .await;
         let merkle_tree = Box::new(light_merkle_tree_reference::MerkleTree::<Poseidon>::new(

test-utils/src/indexer/test_indexer.rs

@@ -4,7 +4,9 @@ use solana_sdk::bs58;
 use std::marker::PhantomData;
 use std::sync::{Arc, Mutex};
 
-use account_compression::{AddressMerkleTreeConfig, AddressQueueConfig, StateMerkleTreeConfig};
+use account_compression::{
+    AddressMerkleTreeConfig, AddressQueueConfig, NullifierQueueConfig, StateMerkleTreeConfig,
+};
 use light_compressed_token::constants::TOKEN_COMPRESSED_ACCOUNT_DISCRIMINATOR;
 use light_compressed_token::mint_sdk::create_create_token_pool_instruction;
 use light_compressed_token::{get_token_pool_pda, TokenData};
@@ -519,7 +521,8 @@ impl<const INDEXED_ARRAY_SIZE: usize, R: RpcConnection> TestIndexer<INDEXED_ARRA
             nullifier_queue_keypair,
             owning_program_id,
             self.state_merkle_trees.len() as u64,
-            StateMerkleTreeConfig::default(),
+            &StateMerkleTreeConfig::default(),
+            &NullifierQueueConfig::default(),
         )
         .await;
         crate::test_env::init_cpi_context_account(

test-utils/src/test_env.rs

@@ -205,7 +205,8 @@ pub async fn setup_test_programs_with_accounts(
         &nullifier_queue_keypair,
         None,
         1,
-        StateMerkleTreeConfig::default(),
+        &StateMerkleTreeConfig::default(),
+        &NullifierQueueConfig::default(),
     )
     .await;
 
@@ -357,13 +358,14 @@ pub async fn create_state_merkle_tree_and_queue_account<R: RpcConnection>(
     nullifier_queue_keypair: &Keypair,
     program_owner: Option<Pubkey>,
     index: u64,
-    config: StateMerkleTreeConfig,
+    merkle_tree_config: &StateMerkleTreeConfig,
+    queue_config: &NullifierQueueConfig,
 ) {
     let size = account_compression::state::StateMerkleTreeAccount::size(
-        config.height as usize,
-        config.changelog_size as usize,
-        config.roots_size as usize,
-        config.canopy_depth as usize,
+        merkle_tree_config.height as usize,
+        merkle_tree_config.changelog_size as usize,
+        merkle_tree_config.roots_size as usize,
+        merkle_tree_config.canopy_depth as usize,
     );
 
     let merkle_tree_account_create_ix = create_account_instruction(
@@ -375,10 +377,9 @@ pub async fn create_state_merkle_tree_and_queue_account<R: RpcConnection>(
         &account_compression::ID,
         Some(merkle_tree_keypair),
     );
-    let size = account_compression::state::queue::QueueAccount::size(
-        account_compression::utils::constants::STATE_NULLIFIER_QUEUE_VALUES as usize,
-    )
-    .unwrap();
+    let size =
+        account_compression::state::queue::QueueAccount::size(queue_config.capacity as usize)
+            .unwrap();
     let nullifier_queue_account_create_ix = create_account_instruction(
         &payer.pubkey(),
         size,
@@ -394,8 +395,8 @@ pub async fn create_state_merkle_tree_and_queue_account<R: RpcConnection>(
         *owner,
         merkle_tree_keypair.pubkey(),
         nullifier_queue_keypair.pubkey(),
-        config,
-        NullifierQueueConfig::default(),
+        merkle_tree_config.clone(),
+        queue_config.clone(),
         program_owner,
         index,
         0, // TODO: replace with CPI_CONTEXT_ACCOUNT_RENT once enabled

utils/src/rand.rs

@@ -1,8 +1,46 @@
+use std::ops::{Bound, RangeBounds};
+
 use rand::{
     distributions::uniform::{SampleRange, SampleUniform},
     Rng,
 };
 
+use crate::prime::find_next_prime;
+
+const PRIME_RETRIES: usize = 10;
+
+/// Generates a random prime number in the given range. It returns `None` when
+/// generating such number was not possible.
+pub fn gen_prime<N, R, T>(rng: &mut N, range: R) -> Option<T>
+where
+    N: Rng,
+    R: Clone + RangeBounds<T> + SampleRange<T>,
+    T: Into<f64> + From<f64> + Copy + PartialOrd + SampleUniform,
+{
+    for _ in 0..PRIME_RETRIES {
+        let sample: T = rng.gen_range(range.clone());
+        let next_prime = find_next_prime(sample.into());
+
+        match range.end_bound() {
+            Bound::Included(end) => {
+                if next_prime > (*end).into() {
+                    continue;
+                }
+            }
+            Bound::Excluded(end) => {
+                if next_prime >= (*end).into() {
+                    continue;
+                }
+            }
+            _ => {}
+        };
+
+        return Some(T::from(next_prime));
+    }
+
+    None
+}
+
 /// Generates a random value in the given range, excluding the values provided
 /// in `exclude`.
 pub fn gen_range_exclude<N, R, T>(rng: &mut N, range: R, exclude: &[T]) -> T
@@ -26,8 +64,27 @@ where
 mod test {
     use rand::Rng;
 
+    use crate::prime::is_prime;
+
     use super::*;
 
+    #[test]
+    fn test_gen_prime() {
+        let mut rng = rand::thread_rng();
+
+        let mut successful_gens = 0;
+        for i in 0..10_000 {
+            let sample: Option<f64> = gen_prime(&mut rng, 1.0..10_000.0);
+            println!("sample {i}: {sample:?}");
+            if let Some(sample) = sample {
+                successful_gens += 1;
+                assert!(is_prime(sample));
+            }
+        }
+
+        println!("generated {successful_gens} prime numbers out of 10000 iterations");
+    }
+
     #[test]
     fn test_gen_range_exclude() {
         let mut rng = rand::thread_rng();