chore: update msrv to 1.91.1

Author: nsarlin-zama

Cargo.toml

@@ -24,7 +24,7 @@ exclude = [
 ]
 
 [workspace.package]
-rust-version = "1.85"
+rust-version = "1.91.1"
 
 [workspace.dependencies]
 aligned-vec = { version = "0.6", default-features = false }

Makefile

@@ -427,21 +427,21 @@ clippy_rustdoc: install_rs_check_toolchain
 		echo "WARNING: skipped clippy_rustdoc, unsupported OS $(OS)"; \
 		exit 0; \
 	fi && \
-	CARGO_TERM_QUIET=true CLIPPYFLAGS="-D warnings" RUSTDOCFLAGS="--no-run --nocapture --test-builder ./scripts/clippy_driver.sh -Z unstable-options" \
+	CARGO_TERM_QUIET=true CLIPPYFLAGS="-D warnings" RUSTDOCFLAGS="--no-run --test-builder ./scripts/clippy_driver.sh -Z unstable-options" \
 		cargo "$(CARGO_RS_CHECK_TOOLCHAIN)" test --doc \
 		--features=boolean,shortint,integer,zk-pok,pbs-stats,strings,experimental \
-		-p tfhe
+		-p tfhe -- --nocapture
 
 .PHONY: clippy_rustdoc_gpu # Run clippy lints on doctests enabling the boolean, shortint, integer and zk-pok
 clippy_rustdoc_gpu: install_rs_check_toolchain
 	if [[ "$(OS)" != "Linux" ]]; then \
 		echo "WARNING: skipped clippy_rustdoc_gpu, unsupported OS $(OS)"; \
 		exit 0; \
 	fi && \
-	CARGO_TERM_QUIET=true CLIPPYFLAGS="-D warnings" RUSTDOCFLAGS="--no-run --nocapture --test-builder ./scripts/clippy_driver.sh -Z unstable-options" \
+	CARGO_TERM_QUIET=true CLIPPYFLAGS="-D warnings" RUSTDOCFLAGS="--no-run --test-builder ./scripts/clippy_driver.sh -Z unstable-options" \
 		cargo "$(CARGO_RS_CHECK_TOOLCHAIN)" test --doc \
 		--features=boolean,shortint,integer,zk-pok,pbs-stats,strings,experimental,gpu \
-		-p tfhe
+		-p tfhe -- --nocapture
 
 .PHONY: clippy_c_api # Run clippy lints enabling the boolean, shortint and the C API
 clippy_c_api: install_rs_check_toolchain

backends/tfhe-hpu-backend/src/fw/fw_impl/ilp_div.rs

@@ -659,6 +659,7 @@ pub fn iop_div_corev(
             }
 
             remain_a = Vec::new();
+            #[allow(clippy::needless_range_loop)]
             for i in 0..block_nb {
                 remain_tmp_v[0][i] = &remain_tmp_v[0][i] + &remain_tmp_v[1][i];
                 remain_tmp_v[2][i] = &remain_tmp_v[2][i] + &remain_tmp_v[3][i];

tfhe-ntt/src/prime.rs

@@ -83,18 +83,18 @@ pub const fn is_prime64(n: u64) -> bool {
     // hand-unrolled for the compiler to optimize divisions
     #[rustfmt::skip]
     {
-        if n %  2 == 0 { return n ==  2; }
-        if n %  3 == 0 { return n ==  3; }
-        if n %  5 == 0 { return n ==  5; }
-        if n %  7 == 0 { return n ==  7; }
-        if n % 11 == 0 { return n == 11; }
-        if n % 13 == 0 { return n == 13; }
-        if n % 17 == 0 { return n == 17; }
-        if n % 19 == 0 { return n == 19; }
-        if n % 23 == 0 { return n == 23; }
-        if n % 29 == 0 { return n == 29; }
-        if n % 31 == 0 { return n == 31; }
-        if n % 37 == 0 { return n == 37; }
+        if n.is_multiple_of(2) { return n ==  2; }
+        if n.is_multiple_of(3) { return n ==  3; }
+        if n.is_multiple_of(5) { return n ==  5; }
+        if n.is_multiple_of(7) { return n ==  7; }
+        if n.is_multiple_of(11) { return n == 11; }
+        if n.is_multiple_of(13) { return n == 13; }
+        if n.is_multiple_of(17) { return n == 17; }
+        if n.is_multiple_of(19) { return n == 19; }
+        if n.is_multiple_of(23) { return n == 23; }
+        if n.is_multiple_of(29) { return n == 29; }
+        if n.is_multiple_of(31) { return n == 31; }
+        if n.is_multiple_of(37) { return n == 37; }
     };
 
     // deterministic miller rabin test, works for any n < 2^64
@@ -104,7 +104,7 @@ pub const fn is_prime64(n: u64) -> bool {
     let mut s = 0;
     let mut d = n - 1;
 
-    while d % 2 == 0 {
+    while d.is_multiple_of(2) {
         s += 1;
         d /= 2;
     }

tfhe-ntt/src/product.rs

@@ -156,7 +156,7 @@ impl Plan {
         factors: impl AsRef<[u64]>,
     ) -> Option<Self> {
         fn try_new_impl(polynomial_size: usize, modulus: u64, primes: &mut [u64]) -> Option<Plan> {
-            if polynomial_size % 2 != 0 {
+            if !polynomial_size.is_multiple_of(2) {
                 return None;
             }
 

tfhe-ntt/src/roots.rs

@@ -7,7 +7,7 @@ pub const fn get_q_s64(p: Div64) -> (u64, u64) {
     let p = p.divisor();
     let mut q = p - 1;
     let mut s = 0;
-    while q % 2 == 0 {
+    while q.is_multiple_of(2) {
         q /= 2;
         s += 1;
     }

tfhe-zk-pok/src/four_squares.rs

@@ -226,7 +226,7 @@ pub fn four_squares(v: u128, sanity_check_mode: ProofSanityCheckMode) -> [u64; 4
 
             let mut d = p - 1;
             let mut s = 0u32;
-            while d % 2 == 0 {
+            while d.is_multiple_of(2) {
                 d /= 2;
                 s += 1;
             }

tfhe/examples/sha256_bool/padding.rs

@@ -8,7 +8,7 @@
 pub fn pad_sha256_input(input: &str) -> Vec<bool> {
     let bytes = if input.starts_with("0x") && is_valid_hex(&input[2..]) {
         let no_prefix = &input[2..];
-        let hex_input = if no_prefix.len() % 2 == 0 {
+        let hex_input = if no_prefix.len().is_multiple_of(2) {
             // hex value can be converted to bytes
             no_prefix.to_string()
         } else {

tfhe/src/c_api/utils.rs

@@ -18,7 +18,7 @@ pub fn check_ptr_is_non_null_and_aligned<T>(ptr: *const T) -> Result<(), String>
         return Err(format!("pointer is null, got: {ptr:p}"));
     }
     let expected_alignment = std::mem::align_of::<T>();
-    if ptr as usize % expected_alignment != 0 {
+    if !(ptr as usize).is_multiple_of(expected_alignment) {
         return Err(format!(
             "pointer is misaligned, expected {expected_alignment} bytes alignment, got pointer: \
             {ptr:p}. You May have mixed some pointers in your function call. If that's not the \

tfhe/src/conformance.rs

@@ -67,7 +67,7 @@ impl ListSizeConstraint {
         if self.group_size == 0 {
             size == 0
         } else {
-            size % self.group_size == 0
+            size.is_multiple_of(self.group_size)
                 && size >= self.min_inclusive_group_count * self.group_size
                 && size <= self.max_inclusive_group_count * self.group_size
         }