Function algebraic_attack_on_bytes 

pub fn algebraic_attack_on_bytes(
    data: &[u8],
    max_degree: usize,
    max_order: usize,
) -> Option<AlgebraicAttack>

Run the algebraic attack on data (its LSB-first bit expansion) at maximal ANF degree max_degree, searching register orders 1..=max_order: return the shortest low-degree nonlinear feedback that regenerates the whole bit stream, with its sparse ANF. None when no degree-≤max_degree register up to max_order fits — the genuine high-degree / incompressible residue (a real cipher’s keystream, the Chaitin ceiling). max_order bounds the cost: the solve is O(rows · M²/64) with M = O(Lᵈ).