Diamond v. Diehr (1981): Computer-implemented industrial processes

THE JUDGMENT IN ONE SENTENCE A process does not become unpatentable merely because it uses a mathematical formula or computer; the claims must be assessed as a whole, and the claimed rubber-curing process was patent-eligible because it integrated calculation into a practical industrial process.

1. Case at a glance

• Item: Case — Details: Diamond, Commissioner of Patents and Trademarks v. Diehr et al.
• Item: Citation — Details: 450 U.S. 175 (1981)
• Item: Docket — Details: No. 79-1112
• Item: Court / date — Details: Supreme Court of the United States; decided 3 March 1981.
• Item: Opinion — Details: Justice William H. Rehnquist delivered the opinion of the Court.
• Item: Statute — Details: 35 U.S.C. § 101 — patent-eligible subject matter.
• Item: Technology — Details: Computer-controlled process for curing synthetic rubber in a mould.
• Item: Key concept — Details: Evaluate the claimed invention as a whole, not by isolating the mathematical formula from the process.
• Item: Outcome — Details: The Court reversed the Court of Customs and Patent Appeals and held the claims patent-eligible under § 101.

2. Why the case matters

Diamond v. Diehr is a foundational U.S. patent-law decision on computer-implemented inventions. It addresses a recurring question: when a process uses a mathematical formula or computer, is it merely an abstract algorithm—or a patent-eligible practical application integrated into an industrial process?

CENTRAL PRINCIPLE The presence of a mathematical formula or computer does not automatically make a process unpatentable. The proper inquiry considers the claimed subject matter as a whole and asks whether it falls within a statutory category and avoids the judicial exceptions to § 101.

3. Technical background: rubber curing

The invention concerned curing uncured synthetic rubber in a mould. Curing requires controlling temperature and time so the rubber reaches the desired physical properties. If the mould is opened too early, the rubber may be under-cured; if the process is poorly controlled, product quality and manufacturing efficiency can suffer.

The applicants used a computer to repeatedly calculate the remaining cure time using the Arrhenius equation, a mathematical relationship associated with reaction rates and temperature. Temperature measurements from the mould were fed into the computer, and the system determined when the curing process had reached its endpoint.

THE ENGINEERING POINT The computer was not claimed merely as a device for performing an abstract calculation. It operated as part of a process that measured a physical condition, calculated cure progress, and controlled when the industrial moulding process should end.

4. The claimed process: how it worked

• Stage: 1. Prepare the mould — Operation: Place uncured synthetic rubber in a mould and close it for curing. — Purpose: Begin the physical manufacturing process.
• Stage: 2. Measure temperature — Operation: Monitor temperature inside the mould at regular intervals. — Purpose: Collect real-world process data.
• Stage: 3. Calculate cure progress — Operation: Use a computer to repeatedly calculate an updated cure-time value using the Arrhenius equation and measured temperature. — Purpose: Estimate the reaction’s progress under changing conditions.
• Stage: 4. Compare with the target — Operation: Compare the calculated value with a predetermined value associated with the desired cure. — Purpose: Determine whether the process has reached its endpoint.
• Stage: 5. Signal completion — Operation: Provide a signal when the calculated cure time reaches the target, allowing the moulding process to end. — Purpose: Control a physical manufacturing operation.

The Court’s analysis focused on the overall combination of steps. The formula mattered, but the claimed process also included moulding, temperature sensing, repeated calculations, and a physical endpoint for curing.

5. Procedural history

Patent application: the applicants sought claims directed to their computer-controlled rubber-curing process.

Patent Office: the claims were rejected, on the view that the method was essentially an unpatentable mathematical algorithm.

Court of Customs and Patent Appeals: reversed the rejection and concluded that the claims were patentable as a process.

Supreme Court: affirmed the lower appellate court’s result, holding that the claims were eligible under § 101 when considered as a whole.

6. Legal issue

QUESTION BEFORE THE COURT Can a computer-implemented industrial process be patent-eligible when it uses a mathematical formula, or must the claims be rejected as an attempt to patent the formula itself?

7. Holding and result

The Supreme Court held that the claims were patent-eligible subject matter under 35 U.S.C. § 101. The Court rejected an analysis that dissected the claims and treated the mathematical formula as though it were the entire invention.

Holding: A mathematical formula, considered by itself, is not patentable merely because it is new or useful. But a claim incorporating a formula into a practical process may be eligible when the claimed process, considered as a whole, performs a statutory function and does not seek to monopolize the formula itself.

8. The Court’s reasoning

A. Assess the claim as a whole

The Court emphasized that patent eligibility cannot be decided by stripping a claim into separate parts and treating one element—such as a mathematical formula—as the whole invention. The relevant question is what the complete claim covers.

B. Distinguish a formula from its practical application

The Arrhenius equation was not independently patentable. However, the claims used it within a process that included physical materials, moulding, temperature measurement, computer calculations, and a process-control endpoint. The formula was integrated into a practical industrial application.

C. A computer does not automatically make a claim eligible—or ineligible

The Court did not establish that adding a computer to any mathematical method makes it patentable. Nor did it treat computer use as an automatic disqualification. The substance of the claimed process and its practical operation were decisive.

D. Do not convert a § 101 analysis into a novelty inquiry

Whether the formula itself was known or whether individual steps were familiar did not alone resolve the statutory-category question. Eligibility under § 101 is distinct from the separate requirements of novelty (§ 102), non-obviousness (§ 103), and adequate disclosure (§ 112).

9. The legal framework: § 101 and mathematical algorithms

Section 101 generally allows patents for a new and useful process, machine, manufacture, or composition of matter, and improvements thereof. The Supreme Court has recognized judicial exceptions for laws of nature, natural phenomena, and abstract ideas. Mathematical formulas and abstract algorithms may fall within the abstract-idea exception when claimed in substance as such.

• Question: What is the claim really directed to? — How Diehr informs the analysis: Read the entire claim; do not isolate a formula or computer limitation from the surrounding process.
• Question: Is the formula claimed by itself? — How Diehr informs the analysis: A mathematical relationship is not made patentable simply by stating it or claiming its calculation.
• Question: Is it integrated into a practical process? — How Diehr informs the analysis: A formula used as part of a concrete industrial process may be eligible when the process as a whole is patent-eligible.
• Question: Are other patent requirements met? — How Diehr informs the analysis: Even an eligible claim must separately satisfy novelty, non-obviousness, written description, enablement, and other applicable requirements.

10. Worked comparison: abstract calculation vs industrial control

• Hypothetical claim: “Calculate a number using the Arrhenius equation.” — Why it may be problematic or stronger under Diehr: Appears directed to a mathematical calculation alone, without a practical process. — Important caveat: Eligibility depends on the actual claim language and applicable precedent.
• Hypothetical claim: “Use a generic computer to calculate cure time.” — Why it may be problematic or stronger under Diehr: Merely reciting a computer may not transform an abstract idea into a patent-eligible application. — Important caveat: Generic computer implementation is not automatically sufficient.
• Hypothetical claim: “Measure mould temperature, repeatedly calculate cure progress, and signal the end of a rubber-curing process.” — Why it may be problematic or stronger under Diehr: Resembles the integrated industrial process at issue in Diehr: physical inputs, calculations, and process control operate together. — Important caveat: The claim still must be evaluated as a whole and meet all other patentability requirements.

Important: LIMITATION Diehr is not a rule that every software or computer-implemented process is patentable. The case supports evaluating the complete claimed process and distinguishing practical applications from attempts to monopolize an abstract formula.

11. Relationship with earlier and later cases

• Case: Gottschalk v. Benson, 409 U.S. 63 (1972) — Key principle: Rejected claims that would effectively pre-empt a mathematical algorithm through a general-purpose computer process. — Relationship to Diehr: Diehr distinguished a claim to an algorithm itself from a claim to an integrated industrial process.
• Case: Parker v. Flook, 437 U.S. 584 (1978) — Key principle: A mathematical formula with conventional post-solution activity was not enough to make the claimed process eligible. — Relationship to Diehr: Diehr reiterated that the full claim matters, while distinguishing the practical process before it.
• Case: Mayo Collaborative Services v. Prometheus, 566 U.S. 66 (2012) — Key principle: Developed a structured approach to claims involving laws of nature and additional elements. — Relationship to Diehr: Part of the later jurisprudence on judicial exceptions; eligibility must still be assessed under current doctrine.
• Case: Alice Corp. v. CLS Bank International, 573 U.S. 208 (2014) — Key principle: Applied a two-step framework to abstract-idea claims: determine whether the claim is directed to an abstract idea, then assess additional elements for an inventive concept. — Relationship to Diehr: Diehr remains relevant, but modern computer-implemented claims are generally evaluated alongside Alice and subsequent guidance.

12. Practical implications for patent drafting and examination

For applicants

Describe the physical or technical process in which the computation is used, including the data inputs, operations, and resulting control action.

Explain the interaction between software, sensors, equipment, and the process rather than relying solely on a desired result.

Define the claim around the concrete sequence and relationships that make up the invention; avoid relying on a mathematical formula alone.

Keep eligibility distinct from novelty, non-obviousness, and enablement. Success under § 101 does not guarantee grant of a patent.

For examiners and litigants

Read claims as a whole and identify their substantive focus.

Avoid treating the presence of a formula or computer as automatically dispositive.

Assess whether the claim integrates the formula into a practical application or instead seeks to pre-empt the underlying abstract idea.

Apply current Supreme Court and USPTO guidance, including Alice, rather than relying on Diehr in isolation.

13. Ratio decidendi

RULE OF LAW A claim incorporating a mathematical formula is not necessarily unpatentable. The claims must be considered as a whole. In Diehr, the formula was used within a computer-controlled rubber-curing process involving physical measurements and control of an industrial operation; the claimed process was therefore patent-eligible under § 101.

14. What Diehr did not hold

It did not make mathematical formulas patentable in the abstract.

It did not establish that any use of a computer converts an abstract idea into patent-eligible subject matter.

It did not eliminate the judicial exceptions for abstract ideas, laws of nature, or natural phenomena.

It did not guarantee novelty, non-obviousness, or sufficient disclosure merely because a claim passes § 101.

It did not create the later Alice two-step test; that framework developed in subsequent cases.

15. Conclusion

Diamond v. Diehr remains a key decision for understanding computer-implemented industrial processes. It teaches that a claim should not be rejected simply because a mathematical formula or computer appears in it. Courts must examine the complete claimed process and determine whether the formula is integrated into a practical application or is effectively being claimed as an abstract idea.

The rubber-curing process combined temperature measurement, repeated computation, and a signal controlling a physical manufacturing operation. That integration was central to the Court’s conclusion. For modern software and industrial-process patents, Diehr is best read alongside later eligibility decisions, particularly Alice, and current USPTO guidance.

16. Primary sources and further reading

Supreme Court opinion — Justia, Diamond v. Diehr, 450 U.S. 175 (1981) https://supreme.justia.com/cases/federal/us/450/175/

Official U.S. Reports record — GovInfo https://www.govinfo.gov/app/details/USREPORTS-450/USREPORTS-450-175

U.S. Patent and Trademark Office, MPEP § 2106 — Patent Subject Matter Eligibility https://www.uspto.gov/web/offices/pac/mpep/s2106.html

35 U.S.C. § 101 — Patent eligibility https://www.law.cornell.edu/uscode/text/35/101

Alice Corp. v. CLS Bank International, 573 U.S. 208 (2014) https://supreme.justia.com/cases/federal/us/573/208/

Research note: This educational case study summarizes the Supreme Court’s decision and identifies later legal developments separately. It is not legal advice. The analysis concerns U.S. patent law, and patent eligibility must be assessed under current doctrine and the specific claim language.

Related patent research

Alice Corp. v. CLS Bank (2014): Patent eligibility and claim drafting

Bilski v. Kappos (2010): Business methods and abstract ideas

Explore Rightium's patent search and prior-art research services