Struct PrimalityCertificate 

pub struct PrimalityCertificate { /* private fields */ }

A checkable proof that a specific number is prime.

Produced by prove_prime and re-checked, independently of how it was built, by PrimalityCertificate::verify. The certificate is recursive: verifying it re-derives every step, including the primality of each prime factor of F, so a passing verify is a self-contained proof.

Implementations

impl PrimalityCertificate

pub fn n(&self) -> &Int

The number this certificate proves prime.

pub fn bound(&self) -> Option<Bound>

The size bound on the factored part F this proof relied on, or None for a small (< 2^64, Baillie–PSW) certificate.

pub fn verify(&self, n: &Int) -> bool

Re-checks the certificate from scratch, returning true only if it is a valid proof that n (which must equal the number the certificate was built for) is prime.

This shares no state with prove_prime: it recomputes F, re-verifies every witness congruence, recursively re-checks each prime factor of F, and (for a BLS proof) re-runs the discriminant test. Tampering with any field makes it return false.

Trait Implementations

impl Clone for PrimalityCertificate

fn clone(&self) -> PrimalityCertificate

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for PrimalityCertificate

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.