What is the machine-or-transformation test?
The machine-or-transformation test is a two-pronged framework for evaluating whether a claimed process qualifies as patent-eligible subject matter under 35 U.S.C. § 101. It was once the Federal Circuit's exclusive rule for process eligibility and shaped the law around software and business method patents for years. Its two prongs (tied to a particular machine, or transforming a particular article) still inform how examiners and courts evaluate process claims within the Alice/Mayo framework that now governs § 101 analysis.
What the test asks
A claimed process satisfies the machine-or-transformation test if it either (1) is tied to a particular machine or apparatus, or (2) transforms a particular article into a different state or thing. Satisfying either prong is sufficient; a process does not need to satisfy both. But satisfying the test is no longer sufficient by itself for patent eligibility, as the test has been integrated into the broader Alice/Mayo framework.
Origins and early case law
The test traces to Gottschalk v. Benson (1972), where the Supreme Court stated that "transformation and reduction of an article to a different state or thing is the clue to the patentability of a process claim that does not include particular machines." The Benson case involved a claimed algorithm for converting binary-coded decimal numerals into pure binary form. The Court rejected the claim because it effectively preempted the mathematical algorithm across all practical uses, but it declined to establish transformation as an exclusive prerequisite, expressly stating it would not hold that no process patent could ever qualify without satisfying machine-or-transformation requirements.
Diamond v. Diehr (1981) supplied the clearest affirmative example. The Supreme Court held a rubber-molding process patent-eligible because it physically transformed raw, uncured synthetic rubber into cured precision products through computer-controlled temperature monitoring and repeated calculation of cure time using the Arrhenius equation. Critically, the Court held that applicants were not seeking a patent on the Arrhenius formula itself, only on its application within a specific physical manufacturing process, and therefore the claim was not directed to an unpatentable abstract principle.
The State Street era and the Federal Circuit's elevation of the test
For much of the 1990s, process claims involving software or business methods were evaluated under a more permissive standard drawn from State Street Bank & Trust Co. v. Signature Financial Group (1998), under which a process was patent-eligible if it produced a "useful, concrete and tangible result." That standard permitted financial and algorithmic patents without requiring any physical machine or physical transformation.
In In re Bilski (Fed. Cir. 2008), the Federal Circuit sitting en banc displaced the State Street standard, adopting the machine-or-transformation test as the sole criterion for determining whether a claimed process is patent-eligible under § 101. Applied to Bernard Bilski's claimed method of hedging risk in commodities markets, both prongs failed: the process was not tied to any particular machine, and it transformed only abstract legal obligations and financial risks rather than physical objects or substances.
The Supreme Court's correction in Bilski v. Kappos (2010)
The Supreme Court reversed the Federal Circuit's position, holding in Bilski v. Kappos (2010) that the machine-or-transformation test is not the sole test for patent eligibility under § 101 and characterizing it instead as "a useful and important clue, an investigative tool" for determining whether some claimed inventions are patent-eligible processes. The Court affirmed the rejection of Bilski's claims on the ground that they were directed to an unpatentable abstract idea, rather than solely because the claims failed the machine-or-transformation test.
The Court identified uncertainty about software methods, diagnostic medicine processes, and data compression techniques as among the reasons against adopting the test as the exclusive eligibility criterion for processes. A rigid machine-or-transformation gate would risk excluding classes of genuine inventions that cannot easily be characterized as tied to a specific machine or as physically transforming an article.
What "particular machine" means
The machine prong imposes a specificity requirement. Under MPEP 2106.05(b), a "particular machine" must be specifically identified rather than generic. A general-purpose computer that applies a judicial exception using only conventional computer functions does not qualify as a particular machine. Beyond specificity, the machine must play a meaningful role: it must be significant in permitting the method to be performed, not merely function as an obvious speed-up mechanism for a result achievable by other means.
In practice, a method claim that recites "using a computer" without specifying the computer's architecture, configuration, or distinctive hardware is unlikely to satisfy the machine prong. A claim that describes a specific sensor configuration, a specialized hardware architecture, or a defined computational structure and explains how those elements are integral to executing the method is in a better position.
What "particular article" and "transformation" mean
The transformation prong requires both physicality and specificity. Under MPEP 2106.05(c), a "particular article" must be a physical object or substance that is specifically identified. Transforming intangible concepts such as contractual obligations, financial risks, or mental judgments does not constitute a qualifying transformation.
| Type of change | Satisfies transformation prong? |
|---|---|
| Converting fat and water into fatty acids and glycerine through high heat | Yes |
| Curing uncured rubber into a shaped product via computer-controlled temperature | Yes |
| Tanning, dyeing, vulcanizing, or smelting physical materials | Yes |
| Converting one financial obligation or risk position into another | No |
| Manipulating data values in a general-purpose computer's memory | Generally no |
| Changing a person's mental state or judgment | No |
Digital-age process claims can satisfy the transformation prong by tying steps to physical signals, measurable physical parameters, or concrete material outputs. Claims that describe only the reorganization of abstract data values, the conversion of one legal relationship into another, or a sequence of steps that could be performed entirely in a person's mind typically cannot.
Current role within the Alice/Mayo framework
Under current USPTO guidance, the machine-or-transformation test is not applied as a standalone eligibility determination. Instead, it serves as a consideration within the "integration into a practical application" analysis of Step 2A Prong Two, or the "significantly more" analysis of Step 2B, of the two-step framework courts and examiners use to evaluate § 101 eligibility.
Satisfying the machine-or-transformation criteria is evidence that a claim integrates a judicial exception into a practical application, which strengthens a response to a § 101 rejection. But it is not conclusive: the framework still asks whether the claim does something more than append a judicial exception to conventional implementation steps. A process tied to a generic machine, or one whose "transformation" is itself abstract, may still fail even though it technically clears both prongs of the test.
Practical notes for practitioners
- Recite the machine with structural specificity. If the process genuinely requires particular hardware, describe that hardware in the specification and claim it specifically: the architecture, configuration, or design features that distinguish the machine from a standard computer. Generic computer language weakens the machine prong and tends to weaken the Alice/Mayo practical-application argument at the same time.
- Describe the physical transformation in claims and specification. When the process transforms a physical article, identify the article by its pre-transformation state, describe what the process does to it, and describe the post-transformation state. A clear record of what changes physically is the strongest foundation for the transformation prong and for the "practical application" argument.
- Do not treat machine-or-transformation compliance as a § 101 safe harbor. A process that satisfies both prongs can still receive a § 101 rejection if the machine or the transformation adds only conventional or routine activity. Run the full Alice/Mayo analysis and address each step explicitly rather than resting on the two prongs alone.
- Use machine-or-transformation analysis affirmatively in prosecution. Demonstrating that a claimed process is tied to a particular machine or produces a specific physical transformation is a recognized and effective component of the "integration into a practical application" argument at Alice/Mayo Step 2A Prong Two. Frame it explicitly as supporting evidence for integration into a practical application, not as a separate test you are asking the examiner to apply.