Prosecution Insights
Last updated: April 19, 2026
Application No. 18/766,648

Using Artificial Intelligence to Identify Anomalous Behavior in a Distributed Ledger

Final Rejection §103
Filed
Jul 09, 2024
Examiner
GUNDRY, STEPHEN T
Art Unit
2435
Tech Center
2400 — Computer Networks
Assignee
Micro Focus LLC
OA Round
2 (Final)
92%
Grant Probability
Favorable
3-4
OA Rounds
2y 2m
To Grant
99%
With Interview

Examiner Intelligence

Grants 92% — above average
92%
Career Allow Rate
540 granted / 587 resolved
+34.0% vs TC avg
Moderate +8% lift
Without
With
+8.5%
Interview Lift
resolved cases with interview
Typical timeline
2y 2m
Avg Prosecution
23 currently pending
Career history
610
Total Applications
across all art units

Statute-Specific Performance

§101
14.1%
-25.9% vs TC avg
§103
41.7%
+1.7% vs TC avg
§102
7.3%
-32.7% vs TC avg
§112
16.0%
-24.0% vs TC avg
Black line = Tech Center average estimate • Based on career data from 587 resolved cases

Office Action

§103
DETAILED ACTION Notice of Pre-AIA or AIA Status The present application is being examined under the first inventor to file provisions of the AIA . Applicant(s) Response to Office Action The response filed on 12/31/2025 has been entered and made of record. Response to Amendment/Remarks Claims 1-3, 5-6, 10-11, 16-17, and 19-20 have been amended. Claims 1-20 remain pending in the application. Applicant's remarks and/or amendments to claims have overcome each and every claim objection and rejection under 35 USC 102 previously set forth. Examiner thanks applicant for their thoughtful remarks which have been fully considered. Applicant’s remarks are moot in light of new grounds of rejection necessitated by applicant’s amendments. Applicant makes no specific remarks regarding the previously recited teachings of the dependent claims. Examiner’s Note – Allowable Subject Matter Claim 8 overcomes the prior art and would otherwise be allowable if incorporated into the base claim along with any intervening claims. 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. Claim(s) 1-2, 5-7, 9-11, 14, 16-20 is/are rejected under 35 U.S.C. 103 as being unpatentable over Grover (US 2022/0366088 A1) in view of LeCalvez (US 2021/0342825 A1). Regarding claims 1, 16, and 20, Grover teaches: “A system comprising: a microprocessor (Grover, ¶ 11-12 and 04 teaches implementation with a processor, memory and medium); and a computer readable medium, coupled with the microprocessor and comprising microprocessor readable and executable instructions that, when executed by the microprocessor (Grover, ¶ 11-12 and 04 teaches implementation with a processor, memory and medium), cause the microprocessor to: monitor, using a monitoring artificial intelligence (AI) algorithm, activity of a blockchain in a distributed ledger to identify an anomalous behavior in the distributed ledger (Grover, Fig. 1, ¶ 75-77 and 97 teaches monitoring blockchains using a machine learning model to detect anomalous transactions. Grover, ¶ 56-58 teaches real-time detection. Grover, ¶ 70-74 and 80, teaches using the blockchain auditor to detect voting consensus attack. Grover, Fig. 1, ¶ 75-77 teaches monitoring blockchains using a machine learning model to detect an anomalous delete where previously it was read/write transactions. Grover, ¶ 83-84 teaches looking patterns in the timing of votes to determine anomalous nodes within the network); Grover does not, but in related art, LeCalvez teaches: “wherein the anomalous behavior of the distributed ledger comprises one or more of: a denial-of-service attack on the mempool of the distributed ledger (LeCalvez, Fig. 9, ¶ 107 teaches determining a network attack on the blockchain resulting a multi month wait for a transaction being added to a block, effectively a denial of service, by detecting a sudden increase in unconfirmed transactions in the mempool)”. Before applicant’s earliest effective filing it would have been obvious to one of ordinary skill in the art, having the teachings of Grover and LeCalvez, to modify the blockchain anomaly detection system of Grover to include the method to detect mempool DoS attacks as taught in LeCalvez. The motivation to do so constitutes applying a known technique to known devices and/or methods ready for improvement to yield predictable results. Regarding claims 2 and 17, Grover in view of LeCalvez teaches: “The system of claim 1 (Grover in view of LeCalvez teaches the limitations of the parent claims as discussed above), wherein the anomalous behavior of the distributed ledger comprises an anomalous consensus vote of the distributed ledger (Grover, ¶ 70-74 and 80, teaches using the blockchain auditor to detect voting consensus attack)”. Regarding claim 5, Grover in view of LeCalvez teaches: “The system of claim 1 (Grover in view of LeCalvez teaches the limitations of the parent claims as discussed above) wherein the anomalous behavior of the distributed ledger comprises the anomalous activity of the mempool of the distributed ledger (LeCalvez, Fig. 9, ¶ 107 teaches determining a network attack on the blockchain resulting a multi month wait for a transaction being added to a block, effectively a denial of service, by detecting a sudden increase in unconfirmed transactions in the mempool)”. Regarding claim 6, Grover in view of LeCalvez teaches: “The system of claim 5 (Grover in view of LeCalvez teaches the limitations of the parent claims as discussed above), wherein the anomalous activity of the mempool of the distributed ledger is an anomalous activity of at least one of: a type of transaction in the mempool (LeCalvez, Fig. 9, ¶ 107 teaches determining a network attack on the mempool by a sudden shift in demand for block space)”. Regarding claims 7 and 18, Grover in view of LeCalvez teaches: “The system of claim 1 (Grover in view of LeCalvez teaches the limitations of the parent claims as discussed above) wherein the anomalous behavior of the distributed ledger comprises the denial-of-service attack on the mempool of the distributed ledger (LeCalvez, Fig. 9, ¶ 107 teaches determining a network attack on the blockchain resulting a multi month wait for a transaction being added to a block, effectively a denial of service, by detecting a sudden increase in unconfirmed transactions in the mempool)”. Regarding claim 9, Grover in view of LeCalvez teaches teaches: “The system of claim 1 (Grover in view of LeCalvez teaches teaches the limitations of the parent claims as discussed above), wherein the anomalous behavior of the distributed ledger comprises the anomalous change of information stored in the blockchain of the distributed ledger (Grover, Fig. 1, ¶ 75-77 teaches monitoring blockchains using a machine learning model to detect an anomalous delete where previously it was read/write transactions)”. Regarding claim 10, Grover in view of LeCalvez teaches: “The system of claim 9 (Grover in view of LeCalvez teaches the limitations of the parent claims as discussed above) wherein the anomalous change of information stored in the blockchain of the distributed ledger is one of: change of a field in the blockchain of the distributed ledger (Gover, ¶ 67 teaches detecting that the field of the blockchain has been modified and is compromised)”. Regarding claims 11 and 19, Grover in view of LeCalvez teaches: “The system of claim 1 (Grover in view of LeCalvez teaches the limitations of the parent claims as discussed above), wherein the anomalous behavior of the distributed ledger comprises an anomalous voting time for a node in the distributed ledger (Grover, ¶ 83-84 teaches looking patterns in the timing of votes to determine anomalous nodes within the network)”. Regarding claim 14, Grover in view of LeCalvez teaches: “The system of claim 1 (Grover in view of LeCalvez teaches the limitations of the parent claims as discussed above), wherein the anomalous behavior in the distributed ledger is identified based on a pattern of the anomalous behavior of the distributed ledger that is stored in an anomalous blockchain pattern database (Grover, ¶ 46, and 76-77 teaches a pattern library within a pattern database for detecting anomalous behavior using the ML model)”. Claim(s) 3-4 is/are rejected under 35 U.S.C. 103 as being unpatentable over Grover in view of LeCalvez in view of Chao (US 2020/0076830 A1) in view of K (US 2025/0148435 A1). Regarding claim 3, Grover in view of LeCalvez teaches: “The system of claim 2 (Grover in view of LeCalvez teaches the limitations of the parent claims as discussed above)”. Grover in view of LeCalvez does not, but in related art, Chau teaches: “anomalous consensus vote of the distributed ledger (Chao, Figs. 4A, 4B, and ¶ 27 and 62-65 teach a mechanism to detect anomalous voting attacks against the majority of concensus algorithms)”. Before applicant’s earliest effective filing it would have been obvious to one of ordinary skill in the art, having the teachings of Grover, LeCalvez and Chao, to modify the blockchain anomaly detection system of Grover and LeCalvez to include the method to detect anomalous voting for a majority of attacks against concensus voting as taught in Chao. The motivation to do so constitutes applying a known technique to known devices and/or methods ready for improvement to yield predictable results. Grover, LeCalvez and Chao do not, but in related art, K teaches: is based on one of the following: a proof of stake consensus algorithm (K, ¶ 2 teaches proof of stake), a designated proof of stake consensus algorithm (K, ¶ 2 teaches designated proof of stake), a proof of elapsed time consensus algorithm ((K, ¶ 2 teaches proof of elapse time algorithm)”. Before applicant’s earliest effective filing it would have been obvious to one of ordinary skill in the art, having the teachings of Grover, LeCalvez, K, and Chao, to modify the blockchain anomaly detection system of Grover, Chao, and LeCalvez to include the recitation of common consensus algorithms as taught in K. The motivation to do so constitutes applying a known technique to known devices and/or methods ready for improvement to yield predictable results. Regarding claim 4, Grover, LeCalvez, K, and Chao teaches: “The system of claim 3 (Grover, LeCalvez, K, and Chao teaches the limitations of the parent claims as discussed above), wherein the anomalous behavior is different based on a particular consensus algorithm of the distributed ledger (Chao, Figs. 4A, 4B, and ¶ 27 and 62-65 teach a mechanism to detect anomalous voting attacks against the majority of consensus algorithms. One of ordinary skill would recognize that simply the difference between the consensus algorithms themselves would produce different anomalous outputs, i.e., different activities act different)”. Claim(s) 12-13 is/are rejected under 35 U.S.C. 103 as being unpatentable over Grover in view of LeCalvez in view of Cella (US 2022/0366494 A1). Regarding claim 12, Grover in view of LeCalvez teaches: “The system of clam 1 (Grover in view of LeCalvez teaches the limitations of the parent claims as discussed above), wherein the anomalous behavior of the distributed ledger is displayed in a user interface (Grover, ¶ 53 and 101 teaches displaying information about the anomalies within the blockchain), Grover in view of LeCalvez does not, but in related art, Cella teaches: “wherein a user can click on the anomalous behavior of the distributed ledger to view which nodes in the distributed ledger are part of the anomalous behavior of the distributed ledger (Cella, Fig. 33, ¶ 1491 teaches an administration framework to click on and control nodes in a blockchain)”. Before applicant’s earliest effective filing it would have been obvious to one of ordinary skill in the art, having the teachings of Grover in view of LeCalvez and Cella, to modify the blockchain anomaly detection system of Grover in view of LeCalvez to include the method to display and control anomaly information on the distributed ledger as taught in Cella. The motivation to do so constitutes applying a known technique to known devices and/or methods ready for improvement to yield predictable results. Regarding claim 13, Grover in view of LeCalvez in view of Cella teaches: “The system of claim 12 (Grover in view of LeCalvez and Cella teaches the limitations of the parent claims as discussed above), wherein the user can click on an individual node of the nodes in the distributed ledger that are part of the anomalous behavior of the distributed ledger to view a history of the individual node (Cella, Fig. 33, ¶ 1491 teaches an administration framework to click on and control nodes in a blockchain)”. Claim(s) 15 is/are rejected under 35 U.S.C. 103 as being unpatentable over Grover in view of LeCalvez in view of Palanki (US 2025/0217584 A1). Regarding claim 15, Grover in view of LeCalvez teaches: “The system of claim 1 (Grover in view of LeCalvez teaches the limitations of the parent claims as discussed above)”. Grover in view of LeCalvez does not, but in related art Palanki teaches: “wherein information about the anomalous behavior of the distributed ledger is stored in an anomaly block the blockchain (Palanki ¶ 35 teaches storing anomaly information on a distributed ledger)”. Before applicant’s earliest effective filing it would have been obvious to one of ordinary skill in the art, having the teachings of Grover in view of LeCalvez and Palanki, to modify the blockchain anomaly detection system of Grover in view of LeCalvez to include the method to store anomaly information on the distributed ledger as taught in Palanki. The motivation to do so constitutes applying a known technique to known devices and/or methods ready for improvement to yield predictable results. Conclusion Applicant's amendment necessitated the new ground(s) of rejection presented in this Office action. Accordingly, THIS ACTION IS MADE FINAL. See MPEP § 706.07(a). Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any extension fee pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to STEPHEN T GUNDRY whose telephone number is (571)270-0507. The examiner can normally be reached Monday-Friday 8:30AM-5PM (EST). 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, Amir Mehrmanesh can be reached at (571) 270-3351. 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. /STEPHEN T GUNDRY/ Primary Examiner, Art Unit 2435
Read full office action

Prosecution Timeline

Jul 09, 2024
Application Filed
Sep 27, 2025
Non-Final Rejection — §103
Dec 16, 2025
Examiner Interview Summary
Dec 31, 2025
Response Filed
Feb 23, 2026
Final Rejection — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12596841
ANONYMIZING PERSONAL INFORMATION FOR USE IN ASSESSING FRAUD RISK
2y 5m to grant Granted Apr 07, 2026
Patent 12591667
Detecting and mitigating application security threats based on threat change patterns
2y 5m to grant Granted Mar 31, 2026
Patent 12592825
METHODS AND SYSTEMS OF FACILITATING AUTHENTICATION FOR ACCESSING A SERVICE
2y 5m to grant Granted Mar 31, 2026
Patent 12580943
SYSTEMS AND METHODS FOR NETWORK RESILIENCY
2y 5m to grant Granted Mar 17, 2026
Patent 12579309
ANONYMIZATION APPARATUS
2y 5m to grant Granted Mar 17, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

3-4
Expected OA Rounds
92%
Grant Probability
99%
With Interview (+8.5%)
2y 2m
Median Time to Grant
Moderate
PTA Risk
Based on 587 resolved cases by this examiner. Grant probability derived from career allow 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