Coupa Software Inc. and Llamasoft LLC v. Optilogic, Inc., Donald Hicks, and Does 1-10

CourtDistrict Court, D. Delaware
DecidedDecember 11, 2025
Docket1:24-cv-01275
StatusUnknown

This text of Coupa Software Inc. and Llamasoft LLC v. Optilogic, Inc., Donald Hicks, and Does 1-10 (Coupa Software Inc. and Llamasoft LLC v. Optilogic, Inc., Donald Hicks, and Does 1-10) is published on Counsel Stack Legal Research, covering District Court, D. Delaware primary law. Counsel Stack provides free access to over 12 million legal documents including statutes, case law, regulations, and constitutions.

Bluebook
Coupa Software Inc. and Llamasoft LLC v. Optilogic, Inc., Donald Hicks, and Does 1-10, (D. Del. 2025).

Opinion

IN THE UNITED STATES DISTRICT COURT FOR THE DISTRICT OF DELAWARE

COUPA SOFTWARE INC, and LLAMASOFT LLC, Plaintiffs and Counter- defendants, Civil Action No. 24-1275-RGA v. OPTILOGIC, INC., DONALD HICKS, and DOES 1-10, Defendants and Counterclaimants.

MEMORANDUM ORDER Before me is Plaintiffs Coupa Software and Llamasoft’s Motion for a Preliminary Injunction. (D.I. 22). I have considered the parties’ briefing. (D.I. 57, 116, 136, and 144). I heard oral argument on August 29, 2025. For the reasons set forth below, this motion is DENIED. Coupa produces “Supply Chain Design and Planning” (“SCDP”) software. (D.I. 57 at 2). Plaintiffs argue that “several versions of Coupa’s supply chain software are copyrighted.” (id). Plaintiffs also assert that Coupa “maintains the secrecy of two customizations to the algorithms that underlie SCDP: (1) the dynamic calculation of a value known as ‘Big M,’ and (2) the ability of customers to apply percentage-based ‘last mile constraints’ to their supply chain models using the underlying methodology.” (/d.). Plaintiffs argue, “Coupa’s particular implementation of these concepts” qualify as trade secrets. (/d.). Defendant Donald Hicks founded Llamasoft, a company focused on developing supply chain software. (/d. at 3). Coupa purchased Llamasoft in 2018. (Ud). In 2018, Donald Hicks began another company, Defendant Optilogic, which developed “Atlas,” a supply chain model

which Plaintiffs argue served as the foundation of “the Cosmic Frog supply chain design solution.” Plaintiffs argue that Cosmic Frog violates its trade secrets and improperly uses its copyrighted software. (/d. at 3-7). Plaintiffs seek a preliminary injunction “to enjoin Defendants Optilogic, Inc. and Donald Hicks from using Coupa’s copyrighted software and trade secrets.” (D.I. 22 at 1). A “preliminary injunction is an extraordinary and drastic remedy, one that should not be granted unless the movant, by a clear showing, carries the burden of persuasion.” Mazurek v. Armstrong, 520 U.S. 968, 972 (1997) (internal quotation omitted) (italics in original). A movant seeking a preliminary injunction must establish “that he is likely to succeed on the merits, that he is likely to suffer irreparable harm in the absence of preliminary relief, that the balance of equities tips in his favor, and that an injunction is in the public interest.” Winter v. Nat. Res. Def’ Council, Inc., 555 US. 7, 20 (2008). The Third Circuit has held, “The first two factors are the ‘most critical.’” Del. State Sportsmen’s Ass’n v. Del. Dep’t of Safety & Homeland Sec., 108 F.4th 194, 202 (3d Cir. 2024) (citation omitted), cert. denied sub nom. Gray v. Jennings, 145 §. Ct. 1049 (2025). “If both are present, a court then balances all four factors.” Jd. The Third Circuit has explained that the first factor, likelihood of success on the merits, “requires a showing significantly better than negligible, but not necessarily more likely than not.” Reilly v. City of Harrisburg, 858 F.3d 173, 179 (3d Cir. 2017). The second factor, irreparable harm in the absence of preliminary relief, requires a showing that irreparable harm is “more likely than not.” Jd. If both the first and second factors are met, “a court then considers the remaining two factors and determines in its sound discretion if all four factors, taken together, balance in favor of granting the requested preliminary relief.” Id.

At the conclusion of the preliminary injunction hearing, I denied most of the motion except to the extent it was based on the “last mile constraint” technology. (D.I. 164 at 81:13-86:7). I now summarize my previous rulings and provide a ruling on the “last mile constraint” aspect. The first factor is the likelihood of success on the merits at trial. Winter, 555 U.S. at 20. There are two legal issues in this case, copyright and trade secrets. To succeed on a claim of copyright infringement, Plaintiffs must prove “(1) ownership of a valid copyright, and (2) copying of constituent elements of the work that are original.” Feist Publ’ns, Inc. v. Rural Tel. Serv. Co., 499 U.S. 340, 361 (1991). Plaintiffs argue that the data schema and user interface (“UI”) of Defendant’s software infringes three of Plaintiffs’ copyrights for SCDP software. (D.I. 57 at 12). As I ruled at the conclusion of the hearing, I do not think that Plaintiffs’ data schema argument has much likelihood of success because Plaintiffs only identify 590 rows of similar schema out of more than 7,200 rows of Plaintiffs’ schema and more than 5,450 rows of Defendants’ schema.! (D.I. 164 at 82:8-25). Similarly, I found that Plaintiffs do not have much likelihood of success on their UI copyright claim because Optilogic’s UI was created by an individual who never worked for Plaintiffs and was unfamiliar with Plaintiffs’ UJ. Wd. at 83:1—9). To succeed on a misappropriation of trade secrets claim, Plaintiffs must (1) identify the material protected as a trade secret under 18 U.S.C. § 1836 and § 1839, and (2) demonstrate Defendants misappropriated the trade secrets. Oakwood Lab’ys LLC v. Thanoo, 999 F.3d 892, 905 (3d Cir. 2021). Plaintiffs argue that two algorithmic customizations, the Big M method and the last-mile constraints, qualify as trade secrets and have been misappropriated by Defendants.

understand Defendants’ argument to be that there is only a small percentage of overlap between the parties’ schema, and within that overlap, there are a limited number of ways to structure the schema for use in supply chain modeling. Thus, as I understand the argument, the similarity of the sort that Plaintiffs point out is not really indicative of anything.

(D.I. 57 at 9). As explained at the conclusion of the hearing, I do not think Plaintiffs have much likelihood of success proving that Big M qualifies as a trade secret because Big M is based on well-known supply optimization concepts, most of the factors used to create the equations in the Big M method appear in a general sense on Plaintiffs’ website, and there is a relatively small universe of whole numbers that can be used to complete the non-public aspect of the Big M equations. (D.I. 164 at 81:17-82:3). The “last mile constraint” is an algorithm in the source code that “allows customers to create a constraint [requiring] a percentage of demand [generated by the SCDP model to] be satisfied within either a specific distance or time.” (D.I. 57 at 7). Plaintiffs admit that the last mile constraint is a publicly-known feature that is discussed on their website. (D.I. 164 at □□□□□ 8). However, Plaintiffs argue that the implementation of the feature is a secret. (/d. at 12:8—-10). Both parties agree that the last mile constraint is a mathematical formula, eventually represented by the source code as an inequality, which allows a user to add a requirement that a percentage of the demand, measured in weight or “cubic,” to be satisfied within a set distance or time. (See □□□□ 57 at 7; D.I. 116 at 11.). The factors that go into this equation—percentage, the time or distance, the measurement in weight or cubic, and the overall flow—are all factors publicly available on Plaintiffs’ website. (D.I. 116 at 11 (not contested by Plaintiffs)). It is simple algebra to construct an equation using these publicly-known factors. I think it is possible that Defendants utilized the □

Free access — add to your briefcase to read the full text and ask questions with AI

Related

Amoco Production Co. v. Village of Gambell
480 U.S. 531 (Supreme Court, 1987)
Mazurek v. Armstrong
520 U.S. 968 (Supreme Court, 1997)
Colleen Reilly v. City of Harrisburg
858 F.3d 173 (Third Circuit, 2017)
Oakwood Laboratories LLC v. Bagavathikanun Thanoo
999 F.3d 892 (Third Circuit, 2021)

Cite This Page — Counsel Stack

Bluebook (online)
Coupa Software Inc. and Llamasoft LLC v. Optilogic, Inc., Donald Hicks, and Does 1-10, Counsel Stack Legal Research, https://law.counselstack.com/opinion/coupa-software-inc-and-llamasoft-llc-v-optilogic-inc-donald-hicks-and-ded-2025.