Pratt certificates for primality

Target entity: Pratt certificates for primality
Context triple: [Vaughan Pratt, notableWork, Pratt certificates for primality]

• A. Selfridge–Conway primality test
  The Selfridge–Conway primality test is a probabilistic algorithm in number theory used to determine whether a given integer is prime.
• B. Adleman–Pomerance–Rumely primality test
  The Adleman–Pomerance–Rumely primality test is an early deterministic algorithm in computational number theory used to determine whether a given number is prime, notable for its theoretical importance in the development of modern primality testing methods.
• C. AKS primality test
  The AKS primality test is a landmark deterministic polynomial-time algorithm that can conclusively determine whether a number is prime without relying on unproven assumptions.
• D. Miller primality test
  The Miller primality test is a randomized algorithm used to determine whether a number is prime with high confidence, forming the basis of the widely used Miller–Rabin primality test in computational number theory and cryptography.
• E. Lenstra elliptic-curve factorization method
  The Lenstra elliptic-curve factorization method is an integer factorization algorithm that uses properties of elliptic curves over finite fields to efficiently find nontrivial factors of large numbers, especially those with relatively small prime divisors.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Pratt certificates for primality
Target entity description: Pratt certificates for primality are a method of providing short, efficiently verifiable proofs that a given number is prime, forming one of the earliest practical systems for primality certification.

• A. Selfridge–Conway primality test
  The Selfridge–Conway primality test is a probabilistic algorithm in number theory used to determine whether a given integer is prime.
• B. Adleman–Pomerance–Rumely primality test
  The Adleman–Pomerance–Rumely primality test is an early deterministic algorithm in computational number theory used to determine whether a given number is prime, notable for its theoretical importance in the development of modern primality testing methods.
• C. AKS primality test
  The AKS primality test is a landmark deterministic polynomial-time algorithm that can conclusively determine whether a number is prime without relying on unproven assumptions.
• D. Miller primality test
  The Miller primality test is a randomized algorithm used to determine whether a number is prime with high confidence, forming the basis of the widely used Miller–Rabin primality test in computational number theory and cryptography.
• E. Lenstra elliptic-curve factorization method
  The Lenstra elliptic-curve factorization method is an integer factorization algorithm that uses properties of elliptic curves over finite fields to efficiently find nontrivial factors of large numbers, especially those with relatively small prime divisors.
• F. None of above. chosen