Prosecution Insights
Last updated: October 02, 2026
Application No. 19/245,801

CONSTRAINING INJECTION OF UNLOCKING TRANSACTION BYTECODE

Non-Final OA §DP
Filed
Jun 23, 2025
Priority
May 22, 2017 — GB 1708190.2 +9 more
Examiner
PEARSON, DAVID J
Art Unit
2431
Tech Center
2400 — Computer Networks
Assignee
Nchain Licensing AG
OA Round
1 (Non-Final)
78%
Grant Probability
Favorable
1-2
OA Rounds
1y 7m
Est. Remaining
90%
With Interview

Examiner Intelligence

Grants 78% — above average
78%
Career Allowance Rate
601 granted / 770 resolved
+20.1% vs TC avg
Moderate +12% lift
Without
With
+11.8%
Interview Lift
resolved cases with interview
Typical timeline
2y 10m
Avg Prosecution
16 currently pending
Career history
779
Total Applications
across all art units

Statute-Specific Performance

§101
13.9%
-26.1% vs TC avg
§103
45.5%
+5.5% vs TC avg
§102
16.8%
-23.2% vs TC avg
§112
8.7%
-31.3% vs TC avg
Black line = Tech Center average estimate • Based on career data from 770 resolved cases

Office Action

§DP
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 . 1. Instant application is a continuation of Application No. 18/399582, now U.S. Patent 12,373,829; which is a continuation of Application No. 18/064814, now U.S. Patent 11,893,584; which is a continuation of Application No. 16/615802, now U.S. Patent 11,528,145. Claims 1-14 have been examined. Claim Objections 2. Claim 3 is objected to because of the following informalities: Claim 3 recites, “…validating that the signature is associated with a public cryptographic key of the asymmetric key pair.” However, claim 1 already introduced “a public cryptographic key of the asymmetric key pair”. The “validating” step of claim 3 appears to be redundant because of the “validating” step of claim 1. Appropriate correction is required. Double Patenting The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the conflicting claims are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969). A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP § 2146 et seq. for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b). The filing of a terminal disclaimer by itself is not a complete reply to a nonstatutory double patenting (NSDP) rejection. A complete reply requires that the terminal disclaimer be accompanied by a reply requesting reconsideration of the prior Office action. Even where the NSDP rejection is provisional the reply must be complete. See MPEP § 804, subsection I.B.1. For a reply to a non-final Office action, see 37 CFR 1.111(a). For a reply to final Office action, see 37 CFR 1.113(c). A request for reconsideration while not provided for in 37 CFR 1.113(c) may be filed after final for consideration. See MPEP §§ 706.07(e) and 714.13. The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The actual filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to www.uspto.gov/patents/apply/applying-online/eterminal-disclaimer. 3. Claims 1-14 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1-15 of U.S. Patent No. 11,528,145. Although the claims at issue are not identical, they are not patentably distinct from each other because: See Chart below. 4. Claims 1-14 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1-15 of U.S. Patent No. 12,373,829. Although the claims at issue are not identical, they are not patentably distinct from each other because: See Chart below. Instant Application 12,373,829 11,528,145 Claim 1 - A method comprising: receiving, at a node in a blockchain network, a first transaction to validate, the first transaction including a first script that at least: includes a set of field values of the first transaction; and as a result of being executed, causes the node to obtain the set of field values; and obtaining a second transaction, the second transaction having been validated and including a second script that, as a result of being executed, causes the node to at least generate a signature based at least in part on the set of field values supplied as a result of execution of the first script; and validating the first transaction by validating that the signature is associated with a public cryptographic key of the asymmetric key pair. Claim 1 - A method comprising: receiving, at a node in a blockchain network, a first transaction to validate, the first transaction including a first script that at least: includes a set of field values of the first transaction; and causes, as a result of being executed, causes the node to obtain the set of field values; obtaining a second transaction, the second transaction having been validated and including a second script that, as a result of being executed, causes the node to at least generate a signature based at least in part on a…(claim 4) the first script further specifies a signature hash type; and the set of field values is based at least in part on the signature hash type… (claim 5), wherein the signature hash type is a value that indicates which field values of the set of field values of the first transaction are to be included in the signature private cryptographic key and a mask number; and validating the first transaction…(claim 3) validating the first transaction further includes validating that the signature is associated with a public cryptographic key of the asymmetric key pair… by executing the first script and the second script. Claim 1 - A method comprising: receiving, at a node in a blockchain network, a first transaction to validate, the first transaction including a first script that at least: includes a set of field values of the first transaction; and as a result of being executed, causes the node to obtain the set of field values; obtaining a second transaction, the second transaction having been validated and including a second script that, as a result of being executed, causes the node to at least generate a signature based at least in part on the set of field values supplied as a result of execution of the first script; and validating the first transaction by… (claim 3) validating the first transaction further includes validating that the signature is associated with a public cryptographic key of the asymmetric key pair… executing the first script and the second script. Claim 2 Claim 1 + Claim 3 Claim 3 Claim 3 Claim 4 Claim 4 Claim 4 Claim 5 Claim 5 Claim 5 Claim 6 Claim 6 Claim 6 Claim 7 Claim 7 Claim 7 Claim 8 Claim 8 Claim 8 Claim 9 Claim 9 Claim 9 Claim 10 Claim 10 Claim 10 Claim 11 Claim 11 Claim 11 Claim 12 Claim 12 Claim 12 Claim 13 Claim 13 Claim 13 Claim 14 Claim 14 Claim 14 Claim 15 Claim 15 Claims 1 and 3 of U.S. Patent No. 11,528,145 contain every element of claims 1 and 3 of the instant application and as such anticipate claim of the instant application. “A later patent claim is not patentably distinct from an earlier patent claim if the later claim is obvious over, or anticipated by, the earlier claim. In re Longi, 759 F.2d at 896, 225 USPQ at 651 (affirming a holding of obviousness-type double patenting because the claims at issue were obvious over claims in four prior art patents); In re Berg, 140 F.3d at 1437, 46 USPQ2d at 1233 (Fed. Cir. 1998) (affirming a holding of obviousness-type double patenting where a patent application claim to a genus is anticipated by a patent claim to a species within that genus). “ ELI LILLY AND COMPANY v BARR LABORATORIES, INC., United States Court of Appeals for the Federal Circuit, ON PETITION FOR REHEARING EN BANC (DECIDED: May 30, 2001). For claims 2 and 4-14, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to combine the different embodiments of U.S. Patent No. 11,528,145 to include the elements of claim 3. It would have been obvious because combining prior art elements according to known methods would yield the predictable results of validating a transaction by executing a script that generates a signature based on a private key and a mask number. For claims 1-14, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to combine the different embodiments of U.S. Patent No. 12,373,829 to include the elements of claims 3-5. It would have been obvious because combining prior art elements according to known methods would yield the predictable results of validating a transaction by executing a script that generates a signature based on a private key and a mask number. Allowable Subject Matter 5. Claims 1-14 would be allowable with: 1) Appropriate correction of the objection to claim 3; 2) A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) to overcome the nonstatutory double patenting rejections set forth in this Office action. The following is a statement of reasons for the indication of allowable subject matter: For independent claim 1, the prior art of record, alone or in combination, fails to teach the following limitations in conjunction with the rest of the claimed limitations: obtaining a second transaction, the second transaction having been validated and including a second script that, as a result of being executed, causes the node to at least generate a signature based at least in part on the set of field values supplied as a result of execution of the first script Conclusion 6. The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. Brown (U.S. Patent Application Publication 2011/0213982) discloses generating a digital signature on a message using a private key that is masked with a value (note Abstract and paragraph [0035]). Maim (U.S. Patent Application Publication 2017/0091750) discloses transactions in a peer to peer distributed architecture which includes means for connecting an input of a downstream transaction to an output of an upstream transaction (note Abstract). Brown et al. (U.S. Patent Application Publication 2017/0301047) teaches a transaction validation (note paragraphs [0140]-[0141]) where validation downloads dependent transactions (note paragraph [0111]) including contract code (note paragraph [0099]). Yan et al. (U.S. Patent Application Publication 2021/0182433) teaches validating a transaction based on an executable code rule set (note paragraphs [0045]-[0044]). 7. Any inquiry concerning this communication or earlier communications from the examiner should be directed to DAVID J PEARSON whose telephone number is (571)272-0711. The examiner can normally be reached 8:30 - 6:00 pm; Monday through Friday. 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, Catherine Thiaw can be reached at (571)270-1138. 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. DAVID J. PEARSON Primary Examiner Art Unit 2407 /David J Pearson/Primary Examiner, Art Unit 2407
Read full office action

Prosecution Timeline

Jun 23, 2025
Application Filed
Aug 25, 2026
Non-Final Rejection mailed — §DP (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12750236
IMPLEMENTING CRYPTOGRAPHICALLY PROTECTED SESSIONS IN DISTRIBUTED COMPUTING SYSTEM
2y 5m to grant Granted Sep 29, 2026
Patent 12732809
COMMUNICATION APPARATUS, COMMUNICATION METHOD, AND STORAGE MEDIUM
2y 9m to grant Granted Sep 08, 2026
Patent 12726346
DETERMINISTIC ADDRESS ROTATION
3y 9m to grant Granted Sep 01, 2026
Patent 12726330
PRIVACY CALCULATION UNIT, ACCELERATION UNIT, SYSTEM ON CHIP, AND PRIVACY CALCULATION METHOD
2y 4m to grant Granted Sep 01, 2026
Patent 12724857
METHOD TO SECURE A JAVA SOFTWARE CODE
1y 2m to grant Granted Sep 01, 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
78%
Grant Probability
90%
With Interview (+11.8%)
2y 10m (~1y 7m remaining)
Median Time to Grant
Low
PTA Risk
Based on 770 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