gf2 2.1.0

Working in bit-space a.k.a. GF(2)
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45

/// Characteristic polynomial test for profiling & benchmarking.
/// Run in release mode for realistic timings.
///
/// SPDX-FileCopyrightText:  2025 Nessan Fitzmaurice <nzznfitz+gh@icloud.com>
/// SPDX-License-Identifier: MIT
use gf2::*;
use std::io::{
    self,
    Write,
};
use utilities_rs::{
    Pretty,
    Stopwatch,
};

fn main() {
    type Word = usize;
    type Mat = BitMatrix<Word>;

    // Number of trials & ticks.
    let n_trials: usize = 1_000;
    let n_tick = (n_trials / 20).max(1);

    // Matrix size.
    let n: usize = 100;

    print!("Running {} trials for random {} x {} bit-matrices ", n_trials.pretty(), n.pretty(), n.pretty());
    io::stdout().flush().ok();

    // Start a stop-watch
    let sw = Stopwatch::new();
    for trial in 0..n_trials {
        if trial % n_tick == 0 {
            print!(".");
            io::stdout().flush().ok();
        }

        let m: Mat = Mat::random(n, n);
        let p = m.characteristic_polynomial();
        //let pm = p.eval_matrix(&m);
        assert!(p.eval_matrix(&m).is_zero(), "Oops! p(M) != 0 for trial {}", trial.pretty());
    }
    println!(" done.");
    println!("Characteristic polynomial loop time: {}.", sw);
}