Alice Corp. v CLS Bank International, U.S. Supreme Court 2014

This is the most recent Supreme Court decision on software patents. In this case, the U.S. Supreme Court has made it harder to obtain software patents by siding with CLS Bank.

The software patents concern “the management of risk relating to specified, yet unknown, future events.” In particular, the patents relate to a computerized trading platform used for conducting financial transactions in which a third party settles obligations between a first and a second party so as to eliminate “counter party” or “settlement” risk. Settlement risk refers to the risk to each party in an exchange that only one of the two parties will actually pay its obligation, leaving the paying party without its principal or the benefit of the counter-party’s performance. Alice’s patents address that risk by relying on a trusted third party to ensure the exchange of either both parties’ obligations or neither obligation. For example, when two parties agree to perform a trade, in certain contexts there may be a delay between the time that the parties enter a contractual agreement obligating themselves to the trade and the time of settlement when the agreed trade is actually executed. Ordinarily, the parties would consummate the trade by paying or exchanging their mutual obligations after the intervening period, but in some cases one party might become unable to pay during that time and fail to notify the other before settlement. As disclosed in Alice’s patents, a trusted third party can be used to verify each party’s ability to perform before actually exchanging either of the parties’ agreed-upon obligations.

The software patent claims recited methods of exchanging obligations between parties, data processing systems, and computer- readable media containing a program code for directing an exchange of obligations.

A representative method claim of this software patent is as follows:
33. A method of exchanging obligations as between parties, each party holding a credit record and a debit record with an exchange institution, the credit records and debit records for exchange of predetermined obligations, the method comprising the steps of:
(a) creating a shadow credit record and a shadow debit record for each stakeholder party to be held independently by a supervisory institution from the exchange institutions;
(b) obtaining from each exchange institution a start-of-day balance for each shadow credit record and shadow debit record;
(c) for every transaction resulting in an exchange obligation, the supervisory institution adjusting each respective party’s shadow credit record or shadow debit record, allowing only these transactions that do not result in the value of the shadow debit record being less than the value of the shadow credit record at any time, each said adjustment taking place in chronological order; and
(d) at the end-of-day, the supervisory institution instructing ones of the exchange institutions to exchange credits or debits to the credit record and debit record of the respective parties in accordance with the adjustments of the said permitted transactions, the credits and debits being irrevocable, time invariant obligations placed on the exchange institutions.

A representative apparatus claim of this software patent is as follows:
1. A data processing system to enable the exchange of an obligation between parties, the system comprising:
a data storage unit having stored therein information about a shadow credit record and shadow debit record for a party, independent from a credit record and debit record maintained by an exchange institution; and
a computer, coupled to said data storage unit, that is configured to (a) receive a transaction; (b) electronically adjust said shadow credit record and/or said shadow debit record in order to effect an exchange obligation arising from said trans action, allowing only those transactions that do not result in a value of said shadow debit record being less than a value of said shadow credit record; and (c) generate an instruction to said exchange institution at the end of a period of time to adjust said credit record and/or said debit record in accordance with the adjustment of said shadow credit record and/or said shadow debit record, wherein said instruction being an irrevocable, time invariant obligation placed on said exchange institution.

The district court granted summary judgment in favor of CLS, holding each of the asserted claims of Alice’s software patents invalid under §101.

In the Federal Circuit decision, a ten-member en banc panel released seven different decisions. None of the opinions garnered majority support. Seven of the ten judges agreed that the method and computer-readable medium claims lack subject matter eligibility. Eight of the ten concluded that the software patent claims should rise and fall together regardless of their claim type.

The Supreme Court used its earlier decision in Mayo Collaborative Services v. Prometheus Laboratories, Inc. as a framework. Using this framework, the Court must first determine whether the claims at issue are directed to a patent-ineligible concept. If so, the Court then asks whether the claim’s elements, considered both individually and “as an ordered combination,” “transform the nature of the claim” into a patent-eligible application.

The court stated that the software patent claims at issue are directed to a patent-ineligible concept: the abstract idea of intermediated settlement. Turning to the second step of Mayo’s framework, the court stated that the method claims, which merely require generic computer implementation, fail to transform that abstract idea into a patent-eligible invention. The court stated that simply appending conventional steps, specified at a high level of generality,” to a method already “well known in the art” is not enough to supply the “inventive concept” needed to make this transformation.

Referring to Mayo, the Court than stated that wholly generic computer implementation is not generally the sort of additional feature that provides any practical assurance that the process is more than a drafting effort designed to monopolize the abstract idea itself.

Still applying a Mayo analysis to this software patent, the court noted that, taking the claim elements separately, the function performed by the computer at each step—creating and maintaining “shadow” accounts, obtaining data,adjusting account balances, and issuing automated instructions—is purely conventional. Considered “as an ordered combination,” these computer components add nothing that is not already present when the steps are considered separately.

In summary, a software patent in which conventional steps are computerized is not statutory. Unfortunately, the Supreme Court conflated 35 U.S.C 101 and 35 U.S.C. 103 analyses. They should have addressed these two issues separately.

The court also mentioned its previous software patent decision, Bilski v. Kappos, 561 U. S. 593 (2010). The claims at issue in Bilski described a method for hedging against the financial risk of price fluctuations.
All members of the Court agreed that the patent in Bilski claimed an “abstract idea.” Specifically, the claims described “the basic concept of hedging, or protecting against risk.” The Court explained that “‘hedging is a fundamental economic practice long prevalent in our system of commerce and taught in any introductory finance class.’” “The concept of hedging” as recited by the claims in suit was in therefore a patent-ineligible “abstract idea, just like the algorithms at issue in Benson and Flook.” The court stated that it follows from prior cases, and Bilski in particular, that the claims at issue here are directed to an abstract idea.

The court has walked away from sensible software patent precedent in Diamond v. Diehr. In that case, the court said that the novelty of any element or steps is not relevant to a 101 analysis. If you have a computer in the claim, that removes it from the possibility of reading on mental steps, so the claim should be statutory. This court is quite unclear about what makes a claim too abstract.

My belief is that we are moving to a European style patentability analysis for software inventions. This is unfortunate because software per se (without a hardware invention) is valuable and one of the primary fields in which the U.S. dominates and excels. Expect to see more 101 rejections from the U.S. Patent and Trademark Office. It will be easier for an examiner to automatically issue a form rejection under 35 USC 101 whenever a patent application mentions the word “software” than to search for relevant prior art.

The decision can be found here:
http://www.supremecourt.gov/opinions/13pdf/13-298_7lh8.pdf

Microsoft Corp. v. i4i Limited Partnership et al., U.S. Supreme Court 2011 (Software Patents)

i4i sued Microsoft Corp. for willful infringement of a software patent. The Patent Act provides patentees with a presumption of validity under 35 U.S.C. 282. Since 1984, the Federal Circuit has read §282 to require a defendant seeking to overcome the presumption to persuade the fact finder of its invalidity defense by clear and convincing evidence.

Microsoft sought to change the presumption of validity. Instead of a “clear and convincing” standard, Microsoft proposed instead using a “preponderance of the evidence” standard. This would have, in effect, weakened or reduced the value of all issued U.S. patents.

More particularly, more than a year before filing its patent application, i4i had sold a software program known as S4 in the United States, but they disagreed over whether that software embodied the invention claimed in i4i’s software patent and therefore invalidated the patent. Relying on the undisputed fact that the S4 software was never presented to the Patent and Trademark Office (PTO) during its examination of the software patent application, Microsoft objected to i4i’s proposed jury instruction that the invalidity defense must be proved by clear and convincing evidence. The District Court nevertheless gave that instruction and rejected Microsoft’s alternative instruction proposing a preponderance of the evidence standard. The jury found that Microsoft willfully infringed the i4i software patent and had failed to prove the patent’s invalidity. The Federal Circuit affirmed, relying on its settled interpretation of §282.

The Supreme Court rejected Microsoft’s contention that a defendant need only persuade the jury of a patent invalidity defense by a preponderance of the evidence. The Supreme Court stated that where Congress has prescribed the governing standard of proof, its choice generally controls. They went on to reason that while §282 includes no express articulation of the standard of proof, where Congress uses a common-law term in a statute, the Court assumes the “term . . . comes with a common law meaning.” Safeco Ins. Co. of America v. Burr, 551 U. S. 47, 58. Here, by stating that a patent is “presumed valid,” §282, Congress used a term with a settled common-law meaning.

The Supreme Court also rejected Microsoft’s argument that a preponderance standard must at least apply where the evidence before the factfinder was not before the PTO during the examination process. The Court stated that it is true enough that, in these circumstances, “the rationale underlying the presumption—that the PTO, in its expertise, has approved the claim—seems much diminished,” KSR Int’l Co. v. Teleflex Inc., 550 U. S. 398, 426, though other rationales may still animate the presumption. But the question remains whether Congress has specified the applicable standard of proof. As established, Congress did just that by codifying the common-law presumption of patent validity and, implicitly, the heightened standard of proof attached to it.

There is a good reason for the strong presumption of validity that the “clear and convincing” standard provides. When an inventor files a software patent application, they give up trade secret rights before ever knowing if they will obtain patent rights. This is a good result for patent holders and a bad result for infringers and alleged infringers.

June 1, 2009, Supreme Court grants cert. for Bilski

The Supreme Court of the U.S. has agreed to review the Bilski case discussed below. The Bilski case disavowed the controversial State Street Bank decision and severely limited the possibility of obtaining business method patents and put the validity of many into question. It also affects software patents that do not describe a lot of hardware, and, in fact, is relevant to all method patents.

The Bilski decision set forth a requirement that any process claim in a software patent must be tied to a particular machine or apparatus, or transform a particular article into a different
state or thing (“machine-or-transformation” test), to be eligible for patenting under 35 U.S.C.
§ 101.

The requirements for patentability of software has been in flux for 20 years. This History of Software Patents shows how attitudes towards software patents shift like a pendulum.

Diamond v. Chakrabarty, 1980

In the History of Software Patents, this was one of the more sensible cases.  Diamond v. Chakrabarty is another Supreme Court case. A genetic engineer named Chakrabarty had developed a bacterium capable of breaking down crude oil, which he proposed to use in treating oil spills. He requested a patent for the bacterium in the United States but was turned down by a patent examiner, because the law dictated that living things were not patentable.

The court held that a live, human-made micro-organism is patentable subject matter under 35 U.S.C. 101. Chakrabarty’s micro-organism constitutes a “manufacture” or “composition of matter” within that statute.

The court stated that in choosing such expansive terms as “manufacture” and “composition of matter,” modified by the comprehensive “any,” Congress contemplated that the patent laws should be given wide scope, and the relevant legislative history also supports a broad construction. While laws of nature, physical phenomena, and abstract ideas are not patentable, respondent’s claim is not to a hitherto unknown natural phenomenon, but to a nonnaturally occurring manufacture or composition of matter, a product of human ingenuity “having a distinctive name, character and use.”

The court took the position that passage of the 1930 Plant Patent Act, which afforded patent protection to certain asexually reproduced plants, and the 1970 Plant Variety Protection Act, which authorized protection for certain sexually reproduced plants but excluded bacteria from its protection, does not evidence congressional understanding that the terms “manufacture” or “composition of matter” in Section 101 do not include living things.

Nor does the fact that genetic technology was unforeseen when Congress enacted Section 101 require the conclusion that micro-organisms cannot qualify as patentable subject matter until Congress expressly authorizes such protection. The unambiguous language of Section 101 fairly embraces respondent’s invention. Arguments against patentability under Section 101, based on potential hazards that may be generated by genetic research, should be addressed to the Congress and the Executive, not to the Judiciary.

This case is famous for taking the position that Congress had intended patentable subject matter to “include anything under the sun that is made by man”

Gottschalk v. Benson, 1972

In the History of Software Patents, this is an important early Supreme Court case.  In 1972, the U.S. Supreme Court reviewed a case involving patent application describing an invention as a method for converting binary-coded decimal numerals into pure binary numerals in a general purpose digital computer. The Court found that the invention was not patentable. The Supreme Court stated that this decision did not preclude ever finding a computer program patentable.
However, for years after this case came out, patent office examiners felt that no software was patentable, and they would routinely issue 101 rejections against patent applications that contained the word “algorithm.” A direct quote from the Gottschalk v. Benson case follows:

It is argued that a process patent must either be tied to a particular machine or apparatus or must operate to change articles or materials to a “different state or thing.” We do not hold that no process patent could ever qualify if it did not meet the requirements of our prior precedents. It is said that the decision precludes a patent for any program servicing a computer. We do not so hold. It is said that we have before us a program for a digital computer but extend our holding to programs for analog computers. We have, however, made clear from the start that we deal with a program only for digital computers. It is said we freeze process patents to old technologies, leaving no room for the revelations of the new, onrushing technology. Such is not our purpose. What we come down to in a nutshell is the following.
It is conceded that one may not patent an idea. But in practical effect that would be the result if the formula for converting BCD numerals to pure binary numerals were patented in this case. The mathematical formula involved here has no substantial practical application except in connection with a digital computer, which means that if the judgment below is affirmed, the patent would wholly pre-empt the mathematical formula and in practical effect would be a patent on the algorithm itself.
It may be that the patent laws should be extended to cover these programs, a policy matter to which we are not competent to speak. The President’s Commission on the Patent System rejected the proposal that these programs be patentable:

    “Uncertainty now exists as to whether the statute permits a valid patent to be granted on programs. Direct attempts to patent programs have been rejected on the ground of nonstatutory subject matter. Indirect attempts to obtain patents and avoid the rejection, by drafting claims as a process, or a machine or components thereof programmed in a given manner, rather than as a program itself, have confused the issue further and should not be permitted.
    “The Patent Office now cannot examine applications for programs because of a lack of a classification technique and the requisite search files. Even if these were available, reliable searches would not be feasible or economic because of the tremendous volume of prior art being generated. Without this search, the patenting of programs would be tantamount to mere registration and the presumption of validity would be all but nonexistent.
    “It is noted that the creation of programs has undergone substantial and satisfactory growth in the absence of patent protection and that copyright protection for programs is presently available.”

If these programs are to be patentable, considerable problems are raised which only committees of Congress can manage, for broad powers of investigation are needed, including hearings which canvass the wide variety of views which those operating in this field entertain. The technological problems tendered in the many briefs before us indicate to us that considered action by the Congress is needed.