Malikie Innovations Ltd v. Antpool Tech Ltd

I. Executive Summary and Procedural Information

• Parties & Counsel:
  • Plaintiff: Malikie Innovations Ltd. and Key Patent Innovations Ltd. (Ireland)
  • Defendant: Antpool Technologies Limited (Hong Kong) and Antpool Technologies Pte. Ltd. (Singapore)
  • Plaintiff’s Counsel: Reichman Jorgensen Lehman & Feldberg LLP
• Case Identification: 7:26-cv-00371, W.D. Tex., 09/09/2026
• Venue Allegations: Venue is alleged to be proper under 28 U.S.C. § 1391(c)(3), which states that a defendant not resident in the United States may be sued in any judicial district. The complaint asserts that both defendants are foreign corporations.
• Core Dispute: Plaintiff alleges that Defendant’s cryptocurrency mining pool services, which support the Bitcoin network among others, infringe four patents related to elliptic curve cryptography (ECC), efficient modular arithmetic, optimized hash processing, and secure data communications.
• Technical Context: The technology at issue involves fundamental cryptographic methods that enable the security, efficiency, and operation of decentralized digital currencies like Bitcoin, particularly in the areas of transaction signing, verification, and the "mining" process.
• Key Procedural History: The patents-in-suit are part of a larger portfolio originally developed by Certicom Corp. and later acquired by BlackBerry Ltd., both pioneers in ECC technology. Plaintiff alleges it provided Defendant with notice of the asserted patents and their infringement on August 1, 2025, but received no response, which forms the basis for its willfulness allegations.

Case Timeline

Date	Event
2005-01-18	Priority Date for ’827 Patent
2006-02-03	Priority Date for ’769 Patent
2008-10-31	Bitcoin white paper reportedly sent to cryptography mailing list
2009-07-17	Priority Date for ’286 Patent
2009-10-12	First recorded exchange of Bitcoin for U.S. dollars
2011-04-06	Priority Date for ’039 Patent
2013-09-10	’286 Patent Issued
2014-04-08	’769 Patent Issued
2014-04-29	’039 Patent Issued
2014-01-01	Antpool mining pool launched in 2014
2014-07-22	’827 Patent Issued
2025-08-01	Plaintiff sends notice letter to Defendant
2026-01-18	’827 Patent expires
2026-02-03	’769 Patent expires
2026-09-09	Complaint Filing Date

II. Technology and Patent(s)-in-Suit Analysis

U.S. Patent No. 8,788,827 - "Accelerated Verification of Digital Signatures and Public Keys"

• Issued: July 22, 2014

The Invention Explained

• Problem Addressed: The patent's background describes that in Elliptic Curve Digital Signature Algorithm (ECDSA) systems, verifying a signature can take approximately twice as long as creating one Compl. ¶75 ’827 Patent, col. 3:5-17 This is because verification involves two computationally expensive scalar multiplication operations, whereas signing involves only one Compl. ¶75 While methods existed to speed this up, they often came at the cost of significant memory or pre-computation cycles that could offset the performance gains Compl. ¶76 ’827 Patent, col. 4:5-14
• The Patented Solution: The invention provides methods to accelerate signature verification. One key technique involves recovering or generating the signer's public key (Q) directly from the components of the digital signature itself (r, s) and the ephemeral public key (R) Compl. ¶78 This is achieved by computing Q = r⁻¹(sR-eG), which avoids the need to transmit the public key with the message, thereby reducing bandwidth and storage requirements while speeding up verification Compl. ¶78 ’827 Patent, col. 4:48-5:4 The patent also discloses providing an indicator bit ("i") with the signature to help a verifier unambiguously and quickly recover the ephemeral public key R from the signature component "r" Compl. ¶77 ’827 Patent, col. 5:23-31
• Technical Importance: By making digital signature verification significantly faster and more data-efficient, the invention addresses a critical performance bottleneck in cryptographic systems that rely heavily on transaction validation, such as the Bitcoin protocol Compl. ¶¶13-14

Key Claims at a Glance

• The complaint asserts at least independent method claim 1 Compl. ¶114
• The essential elements of claim 1 include:
  • A method for generating a public key of a signer on a cryptographic module.
  • Obtaining an elliptic curve point (R) associated with a first signature component (r).
  • Generating the public key (Q) based on the elliptic curve point (R) and a hash value (e).
  • Wherein the generation of the public key comprises computing Q=r⁻¹(sR-eG).
  • Wherein G is a generator of an elliptic curve group that includes points R and Q.
• The complaint reserves the right to assert other claims Compl. ¶114

U.S. Patent No. 8,532,286 - "System and Method for Reducing the Computation and Storage Requirements for a Montgomery-Style Reduction"

• Issued: September 10, 2013

The Invention Explained

• Problem Addressed: The patent addresses the slowness of modular reduction, the process of finding the remainder in modular arithmetic, which is a foundational operation in public key cryptography Compl. ¶83 ’286 Patent, col. 1:20-33 While Montgomery reduction is an improvement over classical division, it still requires storing multiple values (μ and the modulus n) in processor registers and performing multiple multiplications, which is inefficient on resource-constrained devices with a limited number of registers (Compl. ¶¶88-90; ’286 Patent, col. 2:59-61; ’286 Patent, col. 4:40-49).
• The Patented Solution: The patent proposes a more efficient Montgomery-style reduction method that uses a single pre-computed "modified reduction value" (derived from the modulus n) instead of requiring both the modulus n and another pre-computed value μ to be held in registers Compl. ¶90 ’286 Patent, col. 5:28-36 This method performs a "replacement" of the least significant word of the operand rather than a "cancellation," which avoids a multiplication step and reduces register storage requirements, making it particularly beneficial for architectures like ARM Compl. ¶90 ’286 Patent, col. 6:2-19 ’286 Patent, col. 6:51-65
• Technical Importance: This invention provides a more computationally and memory-efficient way to perform modular arithmetic, a core component of many cryptographic schemes, including ECC which underpins Bitcoin (Compl. ¶¶14, 83).

Key Claims at a Glance

• The complaint asserts at least independent method claim 1 Compl. ¶119
• The essential elements of claim 1 include:
  • A method for performing a Montgomery-style reduction on a cryptographic apparatus.
  • Obtaining an operand for the cryptographic operation.
  • Computing a modified operand using a "reduction value" instead of a "modulus" to perform a "replacement" of a least significant word of the operand, rather than a "cancellation" thereof.
  • Wherein the reduction value is a function of the modulus.
  • Outputting the modified operand.
• The complaint reserves the right to assert other claims Compl. ¶119

U.S. Patent No. 8,712,039 - "Efficient Implementation of Hash Algorithm on a Processor"

• Issued: April 29, 2014

Technology Synopsis

The patent addresses the inefficiency of implementing secure hash algorithms (like SHA-256) on processors with a limited number of registers, which requires frequent, slow loading of data from memory Compl. ¶95 ’039 Patent, col. 1:39-54 The invention improves performance by categorizing and unrolling algorithm iterations into "even" and "odd" loops and reversing the sequence of computations, a technique that reduces the average number of words that need to be loaded from memory by at least half Compl. ¶96 ’039 Patent, col. 2:8-20

Asserted Claims

• At least independent method claim 1 Compl. ¶124

Accused Features

• The methods are allegedly practiced by hardware and software used for mining Bitcoin and other cryptocurrencies, which use the SHA-256 hash algorithm as part of the "proof-of-work" process (Compl. ¶¶124-125).

U.S. Patent No. 8,694,769 - "System and Method for Controlling Data Communications Between a Server and a Client Device"

• Issued: April 8, 2014

Technology Synopsis

The patent addresses a problem in secure push-based communication systems where a server may continue sending encrypted data to a client that has lost its decryption key, resulting in data loss Compl. ¶102 ’769 Patent, col. 1:60-2:02 The invention provides a method for the client to transmit "stop data" to the server, which signals that it can no longer decrypt messages and instructs the server to cease transmission until the key is restored or re-established Compl. ¶103 ’769 Patent, col. 2:32-43

Asserted Claims

• At least independent method claim 13 Compl. ¶131

Accused Features

• The allegedly infringing functionality is the secure communication links established between Antpool's servers (including stratum, web, and API servers) and the miners and workers that connect to them Compl. ¶131

III. The Accused Instrumentality

Product Identification

The accused instrumentality is the "Antpool" cryptocurrency mining pool and its associated services and infrastructure Compl. ¶¶43-44 This includes Antpool's website (antpool.com), mobile applications, and the network of servers and nodes it operates, including regional stratum servers located in the United States Compl. ¶¶3-4 Compl. ¶46

Functionality and Market Context

Antpool operates as one of the world's largest Bitcoin mining pools, consolidating computational power ("hashrate") from a global network of individual miners to collectively mine for new blocks on the Bitcoin blockchain Compl. ¶¶42-43 The complaint alleges Antpool's operations involve generating and verifying digital signatures using ECDSA over the secp256k1 curve Compl. ¶¶49-50, performing computationally intensive hashing for proof-of-work Compl. ¶41, and establishing secure communication links with miners using protocols like TLS Compl. ¶53 The diagram from the Bitcoin Whitepaper illustrates the process of chaining blocks together using hashes, a core function of the accused mining operations Compl. p. 24 The complaint alleges Antpool accounts for approximately 18-21% of the global Bitcoin hashrate Compl. ¶45

IV. Analysis of Infringement Allegations

The complaint references claim-chart exhibits that are not provided. The narrative infringement theories are summarized below.

• ’827 Patent Infringement Allegations: The complaint alleges that Antpool's operations, by complying with the Bitcoin protocol, infringe the ’827 Patent Compl. ¶114 The theory is that Antpool operates full nodes that validate transactions on the Bitcoin network Compl. ¶50 This validation process allegedly requires verifying ECDSA signatures, which includes recovering the signer's public key from the signature's components (Compl. ¶50; Compl. ¶145). This "public key recovery" functionality, part of the "secp256k1" library used in Bitcoin, is alleged to practice the claimed method of generating a public key by computing Q=r⁻¹(sR-eG) Compl. ¶112 A diagram from the Bitcoin Whitepaper shows the chain of digital signatures where ownership is verified, a process central to this infringement allegation Compl. p. 7

• ’286 Patent Infringement Allegations: The complaint alleges that hardware and software that comply with the Bitcoin protocol, including mining equipment and wallets used by or in connection with Antpool, infringe the ’286 Patent Compl. ¶119 The patent claims a more efficient method of Montgomery-style reduction, a form of modular arithmetic. The infringement theory posits that because ECC (used in Bitcoin for digital signatures) relies on modular arithmetic, the patented efficiency improvements are used within the accused Bitcoin-compliant systems (Compl. ¶¶82-83; Compl. ¶117). The complaint does not, however, specify which components of the Antpool system perform this exact method of "replacement" rather than "cancellation" during modular reduction.

• Identified Points of Contention:

  • Scope Questions: A central question for the ’827 Patent will be whether the term "generating ... a public key," as claimed, can be construed to cover the "public key recovery" function performed during transaction verification within the Bitcoin protocol.
  • Technical Questions: For the ’286 and ’039 patents, a key point of contention will be an evidentiary one: what proof demonstrates that the specific low-level algorithms implemented in the accused mining hardware (e.g., ASICs) and software actually perform the patented "replacement" method for modular reduction ('286 Patent) or the "even/odd iteration" method for hash processing ('039 Patent)? The complaint's allegations are directed at the Bitcoin protocol generally, raising the question of how this maps to the specific accused instrumentalities.

V. Key Claim Terms for Construction

• Term (’827 Patent): "generating ... a public key of the signer"

• Context and Importance: This term is the active step of claim 1 of the ’827 Patent. The infringement dispute will likely center on whether the function of "recovering" a public key for the temporary purpose of verifying a transaction in the Bitcoin protocol constitutes "generating" a public key in the context of the patent.

• Intrinsic Evidence for Interpretation:

  • Evidence for a Broader Interpretation: The specification uses the terms "recovering (or generating)" together, suggesting they may be interchangeable in this context Compl. ¶78 ’827 Patent, col. 4:48-5:4 The claim itself uses "generating," and a plaintiff may argue this broadly covers any process that computationally produces the public key from the signature data.
  • Evidence for a Narrower Interpretation: The patent's title and background focus on "Accelerated Verification" and solving the problem of slow verification Compl. ¶64 Compl. ¶75 A defendant might argue that "generating" should be limited to creating a key for a persistent purpose, not the ephemeral act of recovery for a one-time check, and that the claim is directed at a specific method of acceleration, not all forms of public key recovery.

• Term (’286 Patent): "a replacement of a least significant word ... rather than perform a cancellation thereof"

• Context and Importance: This phrase in claim 1 of the ’286 Patent defines the novel step that distinguishes the invention from prior art Montgomery reduction. Proving infringement will require showing that the accused systems perform this specific "replacement" operation.

• Intrinsic Evidence for Interpretation:

  • Evidence for a Broader Interpretation: The patent describes the invention as a "new and inventive technique for efficient modular reduction machines" that "avoids both the multiplication necessary to compute m and the storage required for µ" Compl. ¶90 ’286 Patent, col. 6:2-19 A plaintiff could argue that any method achieving this result via the disclosed use of a modified reduction value constitutes a "replacement."
  • Evidence for a Narrower Interpretation: The specification explicitly contrasts the inventive "replacement" with the prior art "cancellation" achieved by computing "a+m×n" '286 Patent, col. 2:47-53 A defendant may argue that "replacement" is strictly defined by the specific algorithm taught in the patent (e.g., using "a_0 × n' × 2^w" as shown in Figure 7 of the '286 Patent) and that any deviation from this exact operation falls outside the claim's scope.

VI. Other Allegations

• Indirect Infringement: The complaint alleges that Defendants induce infringement of the ’039 Patent (related to efficient hash processing) Compl. ¶125 The theory is that Defendants encourage and enable members of the Antpool mining pool (including named entities like Core Scientific, Inc.) to directly infringe by operating mining computers in the U.S. This inducement is allegedly accomplished by providing the necessary server infrastructure, publishing configuration instructions, and paying members for their contributed hashrate Compl. ¶126
• Willful Infringement: The complaint alleges willful infringement for the ’827, ’286, and ’039 patents based on pre-suit knowledge from a notice letter sent on August 1, 2025, and subsequent unanswered emails Compl. ¶¶57-59 Compl. ¶115 Compl. ¶120 Compl. ¶127 For the ’769 patent, willfulness is alleged based on knowledge since at least the filing of the complaint Compl. ¶130

VII. Analyst’s Conclusion: Key Questions for the Case

• A core issue will be one of technical implementation: can the Plaintiff produce evidence showing that the low-level algorithms in the accused Antpool infrastructure and associated mining hardware actually perform the specific "replacement" operation for modular reduction claimed in the ’286 Patent and the "even/odd iteration" optimization for hashing claimed in the ’039 Patent, or will the allegations remain tied only to the general operation of the Bitcoin protocol?
• A second key question will be one of claim scope and function: does the act of "public key recovery" within the Bitcoin protocol, used for the ephemeral purpose of transaction verification, constitute "generating a public key" as that term is used in claim 1 of the ’827 Patent?
• A third dispositive question concerns attribution and control: for the ’769 secure communication patent, the case may turn on whether the Plaintiff can demonstrate that Antpool's servers not only establish secure links but also implement and use the specific claimed protocol of receiving "stop data" from clients and "ceasing transmission" in response to a lost decryption key.