Business Method Patents Under Bilski V Kappos.
1. Background: Business Method Patents in the U.S.
Business Method Patents are patents that claim a method of doing business, often implemented through software, processes, or financial systems.
Key Challenges:
Are business methods patentable subject matter under 35 U.S.C. § 101?
How to distinguish abstract ideas from patent-eligible inventions?
Historical Context
Historically, U.S. courts allowed some business method patents after State Street Bank v. Signature Financial Group (1998), where the “useful, concrete, and tangible result” test was applied.
After criticism for overbroad grants, the Supreme Court tightened the standard in Bilski v. Kappos (2010).
2. Bilski v. Kappos (2010) – The Landmark Case
Citation: 561 U.S. 593 (2010)
Facts:
Bernard Bilski filed a patent for a method of hedging risks in commodities trading.
Patent was rejected by the USPTO for being an abstract idea.
Legal Issues:
Are business methods patentable under §101?
Does the machine-or-transformation test apply as the sole test for patent eligibility?
Supreme Court Reasoning:
Business methods are not categorically unpatentable, but abstract ideas are excluded.
The machine-or-transformation test is a useful clue, but not exclusive.
Bilski’s method was too abstract; it did not require a particular machine nor transform an article.
Decision:
Patent application denied.
Affirmed that abstract ideas cannot be patented, including most business methods.
Significance:
Restricted patentability of purely financial and business process patents.
Introduced post-Bilski test: determine if claims are directed to abstract ideas and if the implementation is significantly more than the idea itself.
3. Related Key Cases on Business Method Patents
Case 1: State Street Bank & Trust Co. v. Signature Financial Group (1998)
Facts:
Signature Financial claimed a patent for a data processing system to manage mutual funds.
Court Reasoning:
Established the “useful, concrete, and tangible result” test for patent eligibility.
Decision:
Patent upheld.
Significance:
Opened floodgates for business method patents.
Later overruled in principle by Bilski, which restricted abstract ideas.
Case 2: Alice Corp. v. CLS Bank International (2014)
Citation: 573 U.S. 208 (2014)
Facts:
Alice Corp. owned patents for a method of mitigating settlement risk in financial transactions.
Legal Issue:
Are computer-implemented business methods patentable?
Court Reasoning:
Two-step framework:
Determine if claim is directed to an abstract idea.
Examine whether it contains something “significantly more” than the abstract idea (e.g., novel machine or inventive concept).
Decision:
Patents invalid. The method was abstract and implemented on a generic computer.
Significance:
Clarified and reinforced Bilski precedent.
Modern standard for business method patent eligibility.
Case 3: Ultramercial, Inc. v. Hulu, LLC (2014)
Facts:
Patent claimed a method for distributing copyrighted content online in exchange for viewing ads.
Legal Issue:
Does an online advertising business model qualify as patentable?
Court Reasoning:
Initially upheld, stating it was technologically specific, but Supreme Court (via Alice) invalidated for abstract idea.
Decision:
Patent invalidated.
Significance:
Post-Bilski, business methods involving generic computer implementation are highly likely to fail.
Case 4: Becton, Dickinson & Co. v. BD Medical Systems (2015)
Facts:
Patent for a method of inventory management in hospitals.
Legal Issue:
Is this patent eligible if it is a process to manage business operations?
Court Reasoning:
Claimed method is purely administrative and abstract.
Implementation on generic systems does not save it.
Decision:
Patent invalid.
Significance:
Reaffirms post-Bilski approach: abstract business processes cannot rely on generic machines.
Case 5: Dealertrack, Inc. v. Huber (2016)
Facts:
Patent claimed method for processing credit applications electronically.
Legal Issue:
Is automating a manual business process patentable?
Court Reasoning:
Merely implementing an abstract process on a computer is insufficient.
Decision:
Patent invalid under §101.
Significance:
Business method patents must add inventive concept beyond automation.
Case 6: CyberSource Corp. v. Retail Decisions, Inc. (2007)
Facts:
Patent for fraud detection using computer algorithms.
Court Reasoning:
Pre-Bilski, algorithm used in business context may be patentable if it produces a useful, concrete, and tangible result.
Decision:
Patent initially upheld; later scrutiny post-Bilski would likely invalidate similar patents.
Significance:
Shows shift in jurisprudence from permissive (State Street) to restrictive (Bilski, Alice).
4. Post-Bilski Observations on Business Method Patents
Purely abstract ideas are unpatentable.
Implementation must involve specific technology or transformative process.
Financial and administrative processes rarely survive §101 scrutiny.
USPTO now applies Alice/Mayo test for all business method patents.
Court decisions consistently limit broad patents and curb patent trolling.
5. Summary Table: Business Method Patent Cases
| Case | Year | Patent Type | Outcome | Significance |
|---|---|---|---|---|
| State Street Bank v. Signature | 1998 | Mutual fund management | Upheld | Established “useful, concrete, tangible” test |
| Bilski v. Kappos | 2010 | Hedging commodities | Denied | Restricted abstract business methods; machine-or-transformation as clue |
| Alice Corp v. CLS Bank | 2014 | Financial transaction | Invalid | Two-step abstract idea test |
| Ultramercial v. Hulu | 2014 | Online ad model | Invalid | Generic computer + abstract idea fails |
| Becton Dickinson v. BD Medical | 2015 | Hospital inventory | Invalid | Administrative business methods excluded |
| Dealertrack v. Huber | 2016 | Credit application process | Invalid | Automation of abstract idea not enough |
| CyberSource v. Retail Decisions | 2007 | Fraud detection | Upheld (pre-Bilski) | Pre-Bilski leniency in algorithmic business methods |
✅ Conclusion:
Bilski v. Kappos marks the turning point: business method patents are not automatically patentable.
Post-Bilski jurisprudence, including Alice, defines strict limits: abstract ideas, financial processes, or generic computer implementations are ineligible.
Courts emphasize inventive concept beyond the idea itself.

comments