Prosecution Insights
Last updated: October 25, 2026
Application No. 19/235,831

COMPUTER-IMPLEMENTED SYSTEMS AND METHODS FOR COMBINING BLOCKCHAIN TECHNOLOGY WITH DIGITAL TWINS

Non-Final OA §101§112
Filed
Jun 12, 2025
Priority
Nov 02, 2017 — GB 1718182.7 +6 more
Examiner
STEINLE, ANDREW J
Art Unit
Tech Center
Assignee
Nchain Licensing AG
OA Round
1 (Non-Final)
88%
Grant Probability
Favorable
1-2
OA Rounds
9m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 88% — above average
88%
Career Allowance Rate
497 granted / 568 resolved
+27.5% vs TC avg
Strong +20% interview lift
Without
With
+19.7%
Interview Lift
resolved cases with interview
Fast prosecutor
2y 2m
Avg Prosecution
15 currently pending
Career history
584
Total Applications
across all art units

Statute-Specific Performance

§101
11.5%
-28.5% vs TC avg
§103
49.2%
+9.2% vs TC avg
§102
19.2%
-20.8% vs TC avg
§112
10.8%
-29.2% vs TC avg
Black line = Tech Center average estimate • Based on career data from 568 resolved cases

Office Action

§101 §112
DETAILED ACTION Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Claim Interpretation The following is a quotation of 35 U.S.C. 112(f): (f) Element in Claim for a Combination. – An element in a claim for a combination may be expressed as a means or step for performing a specified function without the recital of structure, material, or acts in support thereof, and such claim shall be construed to cover the corresponding structure, material, or acts described in the specification and equivalents thereof. The following is a quotation of pre-AIA 35 U.S.C. 112, sixth paragraph: An element in a claim for a combination may be expressed as a means or step for performing a specified function without the recital of structure, material, or acts in support thereof, and such claim shall be construed to cover the corresponding structure, material, or acts described in the specification and equivalents thereof. This application includes one or more claim limitations that do not use the word “means,” but are nonetheless being interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, because the claim limitation(s) uses a generic placeholder that is coupled with functional language without reciting sufficient structure to perform the recited function and the generic placeholder is not preceded by a structural modifier. Such claim limitation(s) is/are: "distributed memory pool, distributed hash table, plurality of nodes...maintaining" in Claim 8. Because this/these claim limitation(s) is/are being interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, it/they is/are being interpreted to cover the corresponding structure described in the specification as performing the claimed function, and equivalents thereof. If applicant does not intend to have this/these limitation(s) interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, applicant may: (1) amend the claim limitation(s) to avoid it/them being interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph (e.g., by reciting sufficient structure to perform the claimed function); or (2) present a sufficient showing that the claim limitation(s) recite(s) sufficient structure to perform the claimed function so as to avoid it/them being interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph. Claim Rejections - 35 USC § 112 The following is a quotation of 35 U.S.C. 112(b): (b) CONCLUSION.—The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the inventor or a joint inventor regards as the invention. The following is a quotation of 35 U.S.C. 112 (pre-AIA ), second paragraph: The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the applicant regards as his invention. Claims 8-11 are rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, as being indefinite for failing to particularly point out and distinctly claim the subject matter which the inventor or a joint inventor, or for pre-AIA the applicant regards as the invention. Claim 8 limitations "distributed memory pool, distributed hash table, plurality of nodes...maintaining" invokes 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph. However, the written description fails to disclose the corresponding structure, material, or acts for performing the entire claimed function and to clearly link the structure, material, or acts to the function. Therefore, the claim is indefinite and is rejected under 35 U.S.C. 112(b) or pre-AIA 35 U.S.C. 112, second paragraph. Applicant may: (a) Amend the claim so that the claim limitation will no longer be interpreted as a limitation under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph; (b) Amend the written description of the specification such that it expressly recites what structure, material, or acts perform the entire claimed function, without introducing any new matter (35 U.S.C. 132(a)); or (c) Amend the written description of the specification such that it clearly links the structure, material, or acts disclosed therein to the function recited in the claim, without introducing any new matter (35 U.S.C. 132(a)). If applicant is of the opinion that the written description of the specification already implicitly or inherently discloses the corresponding structure, material, or acts and clearly links them to the function so that one of ordinary skill in the art would recognize what structure, material, or acts perform the claimed function, applicant should clarify the record by either: (a) Amending the written description of the specification such that it expressly recites the corresponding structure, material, or acts for performing the claimed function and clearly links or associates the structure, material, or acts to the claimed function, without introducing any new matter (35 U.S.C. 132(a)); or (b) Stating on the record what the corresponding structure, material, or acts, which are implicitly or inherently set forth in the written description of the specification, perform the claimed function. For more information, see 37 CFR 1.75(d) and MPEP §§ 608.01(o) and 2181. 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. Claim 12 is rejected under 35 U.S.C. 101 because the claimed invention is directed to non-statutory subject matter because Claim 12 is drawn to a “computer-readable storage medium” which could include a digital signal. The specification fails to definitively describe what the computer readable medium includes or does not include. See paragraph 101. In general “computer-readable storage medium” covers both transitory and non-transitory medium. According to the broadest reasonable interpretation in light of the specification, the “computer-readable storage medium” can be transitory. Signals per se do not fit within recognized categories of statutory subject matter. Examiner suggests adding the limitation "non-transitory" before “computer-readable storage medium” in Claim 12 to overcome the rejection under 35 USC 101. Allowable Subject Matter Claims 1-7 and 13 are allowed. The following is an examiner’s statement of reasons for allowance: Regarding Claim 1, although the closest prior art of record (such as Falk (US 20210081938 A1), Liberman (US 11514448 B1), and Bathen et al., (US 20180139278 A1)) teaches A method for providing a bitcoin network architecture capable of storing data generated by a digital twin. However, none of the prior art, alone or in combination teaches the method comprising: deploying a Distributed Hash Table (DHT) structure in a data routing network comprising individual trust relations between a plurality of honest nodes; providing a distributed memory pool (DMP) by clustering individual nodes in the bitcoin network; building each node's set of connections based on routing and application- level information; storing, at each node, information about a partition of key space; using a DHT update operation to build at least one routing table and insert at least one key at each DHT node; using a DHT get operation to find at least one target key-value record represented by a key; and verifying a signature in the at least one target key-value record returned by the DHT get operation in view of other limitations of the independent claims. Any comments considered necessary by applicant must be submitted no later than the payment of the issue fee and, to avoid processing delays, should preferably accompany the issue fee. Such submissions should be clearly labeled “Comments on Statement of Reasons for Allowance.” Allowable Subject Matter Claims 8-12 would be in condition for allowance if the 112(b) and the 101 rejections were obviated. The following is an examiner’s statement of reasons for allowance: Regarding Claims 8, the closest prior art of record, Falk (US 20210081938 A1), Liberman (US 11514448 B1), and Bathen et al., (US 20180139278 A1) teaches A system for providing a bitcoin network architecture capable of storing data generated by a digital twin. However, the references do not explicitly teach nor suggest in detail, the system comprising: a distributed memory pool (DMP) provided in the bitcoin network by clustering individual nodes; a Distributed Hash Table (DHT) structure deployed in a data routing network comprising individual trust relations between a plurality of honest nodes; a plurality of nodes, each maintaining one or more records of trusted peers; each node configured to store information about a partition of key space; each node configured to use a DHT update operation to build at least one routing table and insert at least one key at each DHT node; each node configured to use a DHT get operation to find at least one target key-value record represented by a key; and each node configured to verify a signature in at least one target key-value record returned by the DHT get operation. in view of other limitations of the intervening claims. Thus the prior arts of record taking singly or in combination do not teach or suggest the above-stated limitations taking wholly in combination with all the elements of each independent claim. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to ANDREW J STEINLE whose telephone number is (571)272-9923. The examiner can normally be reached M-F 10am-6pm CT. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Eleni Shiferaw can be reached at (571) 272-3867. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /ANDREW J STEINLE/Primary Examiner, Art Unit 2497
Read full office action

Prosecution Timeline

Jun 12, 2025
Application Filed
Oct 06, 2026
Non-Final Rejection mailed — §101, §112 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12762267
PROVIDING SERVICE TIER INFORMATION WHEN VALIDATING API REQUESTS
1y 8m to grant Granted Oct 13, 2026
Patent 12750224
TOKEN-BASED REMOTE LOGIN USING ATTRIBUTE-BASED ENCRYPTION
3y 3m to grant Granted Sep 29, 2026
Patent 12732385
AUTHENTICATION SYSTEM, AUTHENTICATION MODULE, AND AUTHENTICATION PROGRAM
2y 1m to grant Granted Sep 08, 2026
Patent 12726335
TECHNIQUES FOR NON-VOLATILE DATA PROTECTION
2y 0m to grant Granted Sep 01, 2026
Patent 12719669
5G KEY GENERATION / ECC KEY GENERATION AND SUCI CALCULATION
2y 0m to grant Granted Aug 25, 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
88%
Grant Probability
99%
With Interview (+19.7%)
2y 2m (~9m remaining)
Median Time to Grant
Low
PTA Risk
Based on 568 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