Skip to main content

is_invertible_modp

logicaffeine_proof::modp

Function is_invertible_modp 

Source 
pub fn is_invertible_modp(n: usize, p: u64, matrix: &[Vec<u64>]) -> bool
Expand description

Is an n×n matrix over GF(p) invertible? Gaussian elimination with modular pivots: full rank n. p must be prime.