Prosecution Insights
Last updated: November 21, 2026
Application No. 18/753,784

BACKUP AND RECOVERY SYSTEM AND METHODS FOR CRYPTOCURRENCY HARDWARE WALLET

Non-Final OA §101§103
Filed
Jun 25, 2024
Examiner
REAGAN, JAMES A
Art Unit
3697
Tech Center
3600 — Transportation & Electronic Commerce
Assignee
Crossbar Inc.
OA Round
1 (Non-Final)
72%
Grant Probability
Favorable
1-2
OA Rounds
1y 3m
Est. Remaining
91%
With Interview

Examiner Intelligence

Grants 72% — above average
72%
Career Allowance Rate
642 granted / 897 resolved
+19.6% vs TC avg
Strong +20% interview lift
Without
With
+19.8%
Interview Lift
resolved cases with interview
Typical timeline
3y 8m
Avg Prosecution
40 currently pending
Career history
937
Total Applications
across all art units

Statute-Specific Performance

§101
24.6%
-15.4% vs TC avg
§103
51.1%
+11.1% vs TC avg
§102
5.9%
-34.1% vs TC avg
§112
11.4%
-28.6% vs TC avg
Black line = Tech Center average estimate • Based on career data from 897 resolved cases

Office Action

§101 §103
DETAILED ACTION Status of Claims The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . The Notice of Allowance processed on 06/26/2026 is hereby WITHDRAWN. Prosecution is REOPENED. Claims 1-20 filed on 06/25/20245 are now pending and have been examined. No other agreements, restrictions, or amendments have been considered in this Office action. Information Disclosure Statement The Information Disclosure Statement filed on 01/20/2026 has been considered. An initialed copy of the Form 1449 is enclosed herewith. Allowable Subject Matter Claim 5 is objected to as being dependent upon a rejected base claim, but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims. Claim Rejections - 35 USC § 101 35 U.S.C. 101 reads as follows: Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title. Claims 1-20 are rejected under 35 U.S.C. 101 because the claimed invention is directed to non-patent eligible subject matter because the claim(s) as a whole, considering all claim elements both individually and in combination, do not amount to significantly more than an abstract idea. Step 1: The claims recite a process, system, apparatus, article of manufacture, and/or a nontransitory storage medium with instructions, each of which are proper statutory categories. Step 2A (prong 1): Claim 1 (representative of claims 9 and 15): The claim limitations are grouped as shown immediately following: A method for securing multi-party computation (MPC) security data, comprising: (Certain Methods Of Organizing Human Activity - business relations or managing personal behavior or relationships or interactions between people following rules or instructions) generate security data for an encryption application for a cryptocurrency transaction; (Certain Methods Of Organizing Human Activity - business relations or managing personal behavior or relationships or interactions between people following rules or instructions) store an integer, M of security data segments of the security data at M devices, where M is greater than one; (Certain Methods Of Organizing Human Activity - business relations or managing personal behavior or relationships or interactions between people following rules or instructions) encrypt an Mth data segment at an Mth device producing an encrypted data segment and generate decryption data for decrypting the encrypted data segment; (Certain Methods Of Organizing Human Activity - business relations or managing personal behavior or relationships or interactions between people following rules or instructions) distribute the encrypted data segment and the decryption data to a first of the M devices; (Certain Methods Of Organizing Human Activity - business relations or managing personal behavior or relationships or interactions between people following rules or instructions) initiate a recovery application for the encrypted data segment and for the decryption data at least at the first of the M devices facilitating access to the encrypted data segment and the decryption data at an M+1th device. (Certain Methods Of Organizing Human Activity - business relations or managing personal behavior or relationships or interactions between people following rules or instructions) Dependent claim 5 appears to remedy the deficiency. Step 2A (prong 2): Claim 1 (representative of claims 9 and 15): These remaining claim limitations are delineated as shown immediately preceding. The abstract idea is not integrated into a practical application. There are no improvements to the functioning of a computer, other technology or technical field, a particular machine is not cited, nothing is transformed to a different state or thing, the abstract idea is not more than a drafting effort designed to monopolize the abstract idea. The claim merely uses a computer as a tool to perform the abstract idea, which is generally linked to a particular field of use, in this case, marketing and advertising. Thus, these limitations are recited at a high-level of generality (i.e., as a generic processor and memory performing a generic computer function of processing and storing data) such that it amounts no more than mere instructions to apply the exception using a generic computer component – MPEP 2106.05(f). Further, receiving data, evaluating data and distributing data are data gathering and data outputting, which has no effect on technology and does no more than generally link the use of the judicial exception to a particular technological environment or field of use – see MPEP 2106.05(h). Step 2B: The claim limitations do not provide an Inventive Concept. The claim limitations do not recite additional elements that amount to significantly more that the abstract idea because the additional elements of the system comprising a computer processor, computer readable storage medium with instructions, and a memory configured to store information, each recited at a high level of generality in a computer network which only perform the universal computer functions of accessing, receiving, storing, and processing data, transmitting and presenting information. Taking the elements both individually and as an ordered combination, the function performed by the computer at each step of the process is purely orthodox. Using a computer to obtain and display data are some of the most basic functions of a computer. As shown, the individual limitations claimed are some of the most rudimentary functions of a computer. The technical solution described in this invention does not alter hardware structure or its routine, does not transform the character of the information being processed, does not identify a novel source or type of data, does not advance the functionality of a computer as a tool, and does not incorporate specific rules enabling the computer to accomplish innovative utilities. In summary, the individual step and/or component does no more than require a general computer to perform standard computer functions. As discussed above with respect to integration of the abstract idea into a practical application, the additional element of a computer devices amounts to no more than mere instructions to apply the exception using a generic computer component - requiring the use of software to tailor information and provide it to the user on a generic computer, Intellectual Ventures I LLC v. Capital One Bank (USA), 792 F.3d 1363, 1370-71, 115 USPQ2d 1636, 1642 (Fed. Cir. 2015); Claim Rejections - 35 USC § 103 The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102 of this title, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. Claims 1-4 and 6-20 are rejected under U.S.C. 103 as being unpatentable over Hill et al. (USPGP 2025/0148456 A1) hereinafter HILL, in view of Ness et al. (USPGP 2024/0354753 A1), hereinafter NESS. Claim 1: HILL as shown below discloses the following limitations: A method for securing multi-party computation (MPC) security data, comprising: generate security data for an encryption application for a cryptocurrency transaction; (see at least paragraph 0077) store an integer, M of security data segments of the security data at M devices, where M is greater than one; (see at least paragraphs 0096, 0098, 0095, 0132) encrypt an Mth data segment…(see at least paragraph 0095, 0061; Figures 5, 6 as well as associated and related text) distribute the encrypted data segment and the decryption data to a first of the M devices; (see at least paragraph 0095, 0061; Figures 5, 6 as well as associated and related text) initiate a recovery application for the encrypted data segment and for the decryption data at least at the first of the M devices facilitating access to the encrypted data segment and the decryption data at an M+1th device. (see at least paragraphs 0132, 0133) HILL does not specifically disclose: … at an Mth device producing an encrypted data segment and generate decryption data for decrypting the encrypted data segment; However, NESS, in at least paragraph 0075; Figure 1 as well as associated and related text does. In this case, each of the elements claimed are all shown by the prior art of record but not combined as claimed. However, the technical ability exists to combine the elements as claimed and the results of the combination are predictable. Therefore, when combined, the elements perform the same function as they did separately. (KSR v. Teleflex, 127 S. Ct. 1727 (2007)). Consequently, it would have been obvious to one of ordinary skill in the art at the effective filing date to combine/modify the method of HILL with the technique of NESS because, “Known digital asset custodians maintain control of digital assets on behalf of customers. To prevent loss or unauthorized transfer of digital assets, the wallet keys associated with the digital assets are protected, available and secure. Many custodians are required by regulators, external auditors, insurance companies, clients and/or others to demonstrate their contingency planning for critical events. Digital asset custodians can also receive requests to demonstrate that they have possession of wallet keys sufficient to, for example, transfer digital assets to a contingency wallet(s) should a critical disaster recovery event occur. Some digital asset custodians adopt threshold cryptography or multi-signature cryptography to distribute trust and/or use various hardware (e.g., hardware security modules, trusted execution environments (TEE), etc.) and logical controls for security.” (NESS: paragraph 0002). Additionally, there is a recognized problem or need in the art including market pressure, design need, etc., and there are a finite number of identified predictable solutions. Accordingly, those in the art could have pursued known solutions with reasonable expectation of success. (KSR v. Teleflex, 127 S. Ct. 1727 (2007)). Fundamentally, in the competitive business climate, there is a profit-driven motive to maximize the profitability of goods and services that are provided or marketed to customers. Enterprises typically use business planning to make decisions in order to maximize profits. Claim 2: The combination of HILL/NESS discloses the limitations as shown in the rejections above. NESS further discloses the following limitations: wherein the security data is a MPC encryption key and the security data segments are M key shares of the MPC encryption key de-centrally generated at the respective M devices. See at least paragraph 0044. In this case, each of the elements claimed are all shown by the prior art of record but not combined as claimed. However, the technical ability exists to combine the elements as claimed and the results of the combination are predictable. Therefore, when combined, the elements perform the same function as they did separately. (KSR v. Teleflex, 127 S. Ct. 1727 (2007)). Consequently, it would have been obvious to one of ordinary skill in the art at the effective filing date to combine/modify the method of HILL with the technique of NESS because, “Known digital asset custodians maintain control of digital assets on behalf of customers. To prevent loss or unauthorized transfer of digital assets, the wallet keys associated with the digital assets are protected, available and secure. Many custodians are required by regulators, external auditors, insurance companies, clients and/or others to demonstrate their contingency planning for critical events. Digital asset custodians can also receive requests to demonstrate that they have possession of wallet keys sufficient to, for example, transfer digital assets to a contingency wallet(s) should a critical disaster recovery event occur. Some digital asset custodians adopt threshold cryptography or multi-signature cryptography to distribute trust and/or use various hardware (e.g., hardware security modules, trusted execution environments (TEE), etc.) and logical controls for security.” (NESS: paragraph 0002). Additionally, there is a recognized problem or need in the art including market pressure, design need, etc., and there are a finite number of identified predictable solutions. Accordingly, those in the art could have pursued known solutions with reasonable expectation of success. (KSR v. Teleflex, 127 S. Ct. 1727 (2007)). Fundamentally, in the competitive business climate, there is a profit-driven motive to maximize the profitability of goods and services that are provided or marketed to customers. Enterprises typically use business planning to make decisions in order to maximize profits. Claim 3: The combination of HILL/NESS discloses the limitations as shown in the rejections above. HILL further discloses the following limitations: wherein the MPC encryption key is generated by a N x M threshold algorithm wherein M defines a total number of the M key shares and N defines a second number of the M key shares required to generate a digital signature with the MPC encryption key or to validate the digital signature generated by the MPC encryption key, wherein N is an integer smaller than M. See at least paragraphs 0095, 0132. Claim 4: The combination of HILL/NESS discloses the limitations as shown in the rejections above. HILL further discloses the following limitations: wherein the M devices include a cloud server device, and include a limited hardware wallet device. See at least paragraph 0376. Claim 6: The combination of HILL/NESS discloses the limitations as shown in the rejections above. HILL further discloses the following limitations: wherein initiating the recovery application further comprises generating a password for login to the recovery application and for validating access to the encrypted data segment and the decryption data at the M+1th device. See at least paragraph 0078. Claim 7: The combination of HILL/NESS discloses the limitations as shown in the rejections above. HILL further discloses the following limitations: wherein initiating the recovery application further comprises capturing and transmitting biometric data for login to the recovery application and for validating access to the encrypted data segment and the decryption data at the M+1th device. See at least paragraph 0137. Claim 8: The combination of HILL/NESS discloses the limitations as shown in the rejections above. HILL further discloses the following limitations: wherein initiating the recovery application further comprises: generating the decryption data at the Mth device; splitting the decryption data into a plurality of decryption data segments; distributing respective decryption data segments to respective devices of the M devices other than the Mth device. See at least paragraph 0021. Claims 9-20: The combination of HILL/NESS discloses the limitations as shown in the rejections of the claims above. The Examiner finds that remaining claims 9-20 are not patentably distinct from claims 1-4 and 6-9, because the inventions in the claims are directed to related, indistinct products. The related inventions would be distinct if: (1) the inventions as claimed were either not capable of use together or could have a materially different design, mode of operation, function, or effect; (2) the inventions did not overlap in scope, i.e., are mutually exclusive; and (3) the inventions as claimed were not obvious variants. See MPEP § 806.05(j). Furthermore, the inventions as claimed encompass overlapping subject matter and are obvious variants that do not produce any new, meaningful, synergetic result that would render the claims novel. Therefore, for the sake of clarity, the Examiner has grouped the rejections of claims 1-4 and 6-20 accordingly using the same references and citations as above. CONCLUSION The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. Non-Patent Literature: Fireblocks. “What is MPC (Multi-Party Computation)?” (Dec 26, 2020). Retrieved online 01/10/2026. https://www.fireblocks.com/what-is-mpc Relevancy: “Multi-party computation (MPC) is a cryptographic method that splits a private key into separate shares distributed across multiple independent parties. The complete key is never assembled in one place, at any point in time. The result: no single compromised device, insider, or attacker can access your funds.” (Abstract/Introduction) Coinbase. “What is a Multi-Party Computation (MPC) wallet?”. (Feb 24, 2024). Retrieved online 01/10/2026. https://www.coinbase.com/learn/wallet/what-is-a-multi-party-computation-mpc-wallet Relevancy: “Multi-party computation (MPC) is a set of cryptographic protocols that aim to enable multiple parties to compute a function together without revealing their inputs to each other. In the context of cryptocurrency, MPC is used in conjunction with public-key cryptography to collaboratively sign transactions. Multiple shares (or parts) of one private key are distributed to different parties without ever revealing the complete private key. This approach aims to enhance security as no single party has access to the complete private key, eliminating single points of failure.” (Abstract/Introduction)) Nikolaj Volgushev et al. “Conclave: secure multi-party computation on big data* Extended Technical Report.” (17 February 2019). Retrieved online 01/10/2026. https://www.cs.bu.edu/fac/best/res/papers/tpmpc18.pdf Relevancy: “Secure Multi-Party Computation (MPC) allows mutually distrusting parties to run joint computations without revealing private data. Current MPC algorithms scale poorly with data size, which makes MPC on “big data” prohibitively slow and inhibits its practical use.” (Abstract/Introduction)) Foreign Art: ALHADDAD N et al. “Method For Adjusting Quantity Of Users In Signing Group For Authorizing Transactions Utilizing Multi-party-computing (MPC) Across Network, Involves Authenticating New Shares Using Second Threshold And Returning Authentication Of New Shares.” (WO 2024/263540 A1) Relevancy: “The method (140) involves receiving (142) a request to add or remove at least one signing client device from the signing group. The signing group includes a polynomial designating a first threshold of signing client devices in the signing group that is required to authorize a transaction using respective shares of a cryptographic key. A request for authorizing the request is transmitted (144) to add or remove the at least one signing client device from the signing group by the server to each remaining signing client device in the signing group. The communication amongst the modified group of signing client devices to generate new shares of the cryptographic key is initiated. The new shares using the second threshold is authenticated by the server. The authentication of the new shares of the cryptographic key is returned.” (Abstract/Introduction)) LI S et al. “Method For Implementing A Block-chain-based Decentralized Application, Involves Generating A Request To An External Service On The Basis Of A Software Development Kit (SDK), Sending Request To A Server And Generating Block-chain Transaction.” (WO 2020/098844 A2) Relevancy: “The method (600) involves generating a request to an external service on the basis of a software development kit by a client device. The SDK is associated with the external service. The request is sent to a server that associates with the external service by the client device. A result responsive to the request is obtained. A block-chain transaction is generated (610) on the basis of the result from the external service. The block-chain transaction is sent to multiple block-chain nodes that adds to the block-chain. Multiple return values that associates with adding the block-chain transaction to the block-chain is obtained.” (Abstract/Introduction)) DE HOOGH S J et al. “Coordinator Node For Coordinating Multiparty Computation On Datasets In Hospital System, Determines Computation Schedule And Sends Determined Computation Schedule To One Of Client Nodes Indicated In Determined Computation Schedule.” (WO 2019/110609 A1) Relevancy: “The node (4) receives a request for multiparty computation on datasets from a requesting node, where the multiparty computation requires evaluation of a function by computation nodes from a set of client nodes (6). The node determines a computation schedule for the multiparty computation, where the computation schedule indicates that client nodes of the set of client nodes are participated in the multiparty computation. The node sends the determined computation schedule to one of the client nodes indicated in the determined computation schedule. The node checks that the requested multiparty computation on datasets is permitted before determining the computation schedule.” (Abstract/Introduction)) Any inquiry of a general nature or relating to the status of this application or concerning this communication or earlier communications from the Examiner should be directed to James A. Reagan (james.reagan@uspto.gov) whose telephone number is 571.272.6710. The Examiner can normally be reached Monday through Friday from 9 AM to 5 PM. If attempts to reach the examiner by telephone are unsuccessful, the Examiner’s supervisor, John Hayes, can be reached at 571.272.6708. Information regarding the status of an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only. For more information about the PAIR system, see http://portal.uspto.gov/external/portal/pair . Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866.217.9197 (toll-free). Any response to this action should be mailed to: Commissioner for Patents PO Box 1450 Alexandria, Virginia 22313-1450 or faxed to 571-273-8300. Hand delivered responses should be brought to the United States Patent and Trademark Office Customer Service Window: Randolph Building 401 Dulany Street Alexandria, VA 22314. /JAMES A REAGAN/Primary Examiner, Art Unit 3697 james.reagan@uspto.gov 571.272.6710 (Office) 571.273.6710 (Desktop Fax)
Read full office action

Prosecution Timeline

Jun 25, 2024
Application Filed
Jan 08, 2026
Examiner Interview (Telephonic)
Aug 05, 2026
Non-Final Rejection mailed — §101, §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12792400
METHODS AND APPARATUS TO GENERATE AND MANAGE LOGICAL WORKLOAD DOMAIN CLUSTERS IN A COMPUTING ENVIRONMENT
3y 1m to grant Granted Nov 10, 2026
Patent 12792402
CONVERSATION RESOURCE DEALLOCATION SYSTEM
2y 12m to grant Granted Nov 10, 2026
Patent 12775936
ELECTRONIC PAYMENT PROCESSING USING ADJUSTED INTERCHANGE RATE
1y 5m to grant Granted Oct 27, 2026
Patent 12762536
SYSTEMS AND METHODS FOR PROVISIONING TRANSACTION CARDS TO MULTIPLE MERCHANTS
3y 5m to grant Granted Oct 13, 2026
Patent 12762585
SYSTEM OF DEMAND MODELING AND PRICE CALCULATION BASED ON INTERPOLATED MARKET PRICE ELASTICITY FUNCTIONS
2y 9m to grant Granted Oct 13, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

1-2
Expected OA Rounds
72%
Grant Probability
91%
With Interview (+19.8%)
3y 8m (~1y 3m remaining)
Median Time to Grant
Low
PTA Risk
Based on 897 resolved cases by this examiner. Grant probability derived from career allowance rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month