/ node / bft / tests / components / pending.rs
pending.rs
 1  // Copyright (c) 2025-2026 ACDC Network
 2  // This file is part of the alphaos library.
 3  //
 4  // Alpha Chain | Delta Chain Protocol
 5  // International Monetary Graphite.
 6  //
 7  // Derived from Aleo (https://aleo.org) and ProvableHQ (https://provable.com).
 8  // They built world-class ZK infrastructure. We installed the EASY button.
 9  // Their cryptography: elegant. Our modifications: bureaucracy-compatible.
10  // Original brilliance: theirs. Robert's Rules: ours. Bugs: definitely ours.
11  //
12  // Original Aleo/ProvableHQ code subject to Apache 2.0 https://www.apache.org/licenses/LICENSE-2.0
13  // All modifications and new work: CC0 1.0 Universal Public Domain Dedication.
14  // No rights reserved. No permission required. No warranty. No refunds.
15  //
16  // https://creativecommons.org/publicdomain/zero/1.0/
17  // SPDX-License-Identifier: CC0-1.0
18  
19  use crate::common::{primary::new_test_committee, utils::sample_ledger, CurrentNetwork};
20  use alphaos_node_bft::helpers::max_redundant_requests;
21  use alphavm::prelude::{Network, TestRng};
22  
23  #[test]
24  fn test_max_redundant_requests() {
25      let num_nodes: u16 = CurrentNetwork::MAX_CERTIFICATES.first().unwrap().1;
26  
27      // Initialize the RNG.
28      let mut rng = TestRng::default();
29      // Initialize the accounts and the committee.
30      let (accounts, committee) = new_test_committee(num_nodes, &mut rng);
31      // Sample a ledger.
32      let ledger = sample_ledger(&accounts, &committee, &mut rng);
33      // Ensure the maximum number of redundant requests is correct and consistent across iterations.
34      assert_eq!(max_redundant_requests(ledger, 0).unwrap(), 6, "Update me if the formula changes");
35  }