In re Wenkman — Generic Computers Cannot Patent a Barter System

Background

Gregory John Wenkman sought a patent on a computer-assisted system for bartering groceries and other goods for silver or gold. Under the proposed method, a retailer or wholesaler would inspect a customer’s precious metal, calculate a barter value, and electronically assign that value to a card, token, smartphone, tablet, or smartwatch. The customer could then redeem the stored value for goods through the business’s closed-loop network.

The patent application emphasized that the claimed advance was not the familiar hardware itself. Instead, Wenkman pointed to a “special computer program” that would carry out the barter process. The specification, however, did not explain how that program operated beyond the ordinary functions needed to receive, process, transmit, and display transaction data.

A patent examiner rejected all twenty pending claims under 35 U.S.C. § 101, which limits patents to eligible subject matter. The Patent Trial and Appeal Board affirmed that rejection and added a separate rejection for inadequate written description under § 112(a). Wenkman, representing himself, appealed to the Federal Circuit.

The Court’s Holding

The Federal Circuit affirmed the § 101 rejection. Applying the Supreme Court’s two-step Alice framework, the court first asked whether the claims were directed to a patent-ineligible concept. It held that they were: the claims organized human activity around bartering, a longstanding and fundamental economic practice. Limiting barter to a particular commercial setting or describing the transaction in detailed steps did not turn the underlying economic idea into patentable technology.

At the second step, the court found no inventive concept that transformed the abstract idea into an eligible application. The claims called for generic computers and familiar electronic devices to perform ordinary data functions. Merely instructing a practitioner to implement an economic practice on conventional hardware is not enough. The application referred to a special program, but it did not describe a technological improvement in how the computer or network worked.

Because the § 101 ruling independently disposed of every pending claim, the panel did not address Wenkman’s challenge to the Board’s additional written-description rejection. The nonprecedential opinion therefore left the Board’s result intact without deciding whether the application also failed § 112(a).

Key Takeaways

• A detailed commercial workflow remains an abstract idea when its central purpose is a traditional economic practice such as bartering.
• Generic computers, cards, tokens, and mobile devices do not supply an inventive concept when they perform only routine data-processing functions.
• Calling software “special” is not a substitute for explaining a concrete technological improvement or an unconventional implementation.
• An appellate court may affirm on patent eligibility alone and decline to reach a separate written-description ground.

Why It Matters

The decision is a practical reminder for applicants working on fintech, loyalty, payment, and alternative-currency systems. A claim may contain extensive operational detail and still fail § 101 if the detail primarily describes who exchanges what, how value is recorded, and when a transaction occurs. Patent eligibility generally requires more than moving a familiar business practice onto standard electronic infrastructure.

Applicants should connect computer-implemented claims to a specific technical problem and disclose how the claimed architecture or software solves it. Functional labels and lists of conventional devices can make a claim longer without making it more technological. Although this opinion is nonprecedential, it applies familiar Federal Circuit doctrine to a recognizable pattern and shows why specifications need technical substance from the outset.