Function exactly_one_linear_generators_gfp 

pub fn exactly_one_linear_generators_gfp(
    f: NsField,
    groups: &[Vec<u32>],
) -> Vec<GfpPoly> 

The linear encoding of exactly-one constraints over f: for each group G the degree-1 generator (Σ_{v∈G} x_v) − 1 plus the pairwise products x_u·x_v, deduplicated — the signed generalization of crate::polycalc::exactly_one_linear_generators (over GF(2) the two coincide, since −1 = 1). This is the encoding the modular-counting degree bounds are stated against; over GF(p) the point generators telescope — Σ_i P_i = −n when every edge meets exactly p points — so a counting family with p ∤ n collapses at degree 1 over its own characteristic.