Miller–Rabin primality test¶

A randomized strong-probable-prime test that repeatedly checks modular-power witnesses and bounds the chance that a composite integer passes all selected bases.

Version: v1 · 2026-09-08 · History
Domain-specific #: 5582
Origin domain: computational number theory
Subdomain: computational number theory

Core Idea¶

For odd n, the test writes n−1=2ˢd with d odd and checks whether aᵈ or a successive square reaches the residues required of primes; a violating base proves compositeness. Modular exponentiation follows the squaring chain from aᵈ; prime moduli force the permitted pattern, while at least a fixed fraction of bases witness any odd composite under the standard theorem. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

Scope of Application¶

Miller–Rabin primality test belongs to computational number theory and is useful where the analyst can specify the typed computational number theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the input restrictions, n−1 decomposition, base distribution, modular squaring sequence, acceptance condition, repetition count, and probabilistic or deterministic witness guarantee are explicit. The scope is broad within that domain but bounded by the need for the input restrictions, n−1 decomposition, base distribution, modular squaring sequence, acceptance condition, repetition count, and probabilistic or deterministic witness guarantee are explicit. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the input restrictions, n−1 decomposition, base distribution, modular squaring sequence, acceptance condition, repetition count, and probabilistic or deterministic witness guarantee are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Miller–Rabin primality test can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Miller–Rabin primality test. Miller–Rabin primality test compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed computational number theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the input restrictions, n−1 decomposition, base distribution, modular squaring sequence, acceptance condition, repetition count, and probabilistic or deterministic witness guarantee are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of computational number theory because they reuse the typed computational number theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Modular exponentiation follows the squaring chain from aᵈ; prime moduli force the permitted pattern, while at least a fixed fraction of bases witness any odd composite under the standard theorem., and type the carrier, state every parameter and convention in the definition, test that the input restrictions, n−1 decomposition, base distribution, modular squaring sequence, acceptance condition, repetition count, and probabilistic or deterministic witness guarantee are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Miller–Rabin primality test Domain-specific

Parents (1) — more general patterns this builds on

Miller–Rabin primality test is a kind of Probability Prime

The proposed strict upward parent is prime:probability.

Hierarchy paths (2) — routes to 2 parentless roots

Miller–Rabin primality test → Probability → Measure → Aggregation → Micro Macro Linkage

Show alternative path (1)

Neighborhood in Abstraction Space¶

Miller–Rabin primality test sits in a crowded region of the domain-specific corpus (9^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Number-Theoretic Sequences & Classes (37 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08