Word bounds for the example characteristic.
A monic degree-four modulus x⁴ + 2 over 𝔽₅, committed with its
irreducibility certificate so that a small GF(5⁴) is available without
hand-writing one. Used by the manual's worked examples and by conformance.
Equations
Instances For
The example modulus is nonconstant, which is what the field wrapper needs beside irreducibility.
The example modulus is monic.
Rabin irreducibility certificate for the example modulus: the Frobenius pow chain and the Bézout witness the kernel replays.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The committed certificate passes the kernel-reducible checker. The heartbeat
and recursion bumps live here rather than at every call site: replaying a
certificate is the expensive step, and doing it once means downstream users of
modulus_irreducible pay nothing.
The example modulus is irreducible, by routing the checked certificate through Rabin soundness.
The example field GF(5⁴).
Equations
Instances For
Inject a polynomial into the example field by reducing it.
Equations
- One or more equations did not get rendered due to their size.