Prosecution Insights
Last updated: November 15, 2026
Application No. 19/664,333

SYSTEMS, APPARATUS AND METHODS FOR IDENTIFYING AND SECURELY STORING DISTINGUISHING CHARACTERISTICS IN A DISTRIBUTED LEDGER WITHIN A DISTRIBUTED LEDGER-BASED NETWORK BASED ON FUNGIBLE AND NON-FUNGIBLE TOKENS

Non-Final OA §DP
Filed
Apr 30, 2026
Priority
Nov 20, 2019 — provisional 62/938,210 +3 more
Examiner
GETACHEW, WODAJO
Art Unit
3697
Tech Center
3600 — Transportation & Electronic Commerce
Assignee
Eygs LLP
OA Round
1 (Non-Final)
41%
Grant Probability
Moderate
1-2
OA Rounds
80%
With Interview

Examiner Intelligence

Grants 41% of resolved cases
41%
Career Allowance Rate
97 granted / 235 resolved
-10.7% vs TC avg
Strong +39% interview lift
Without
With
+39.1%
Interview Lift
resolved cases with interview
Typical timeline
Avg Prosecution
17 currently pending
Career history
259
Total Applications
across all art units

Office Action

§DP
DETAILED ACTION Status of Claims This Office Action is in response to claims filed on 04/30/2026. Claims 1-20 are pending and are examined hereon. 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 . Allowable Subject Matter The present invention is directed to tokenization of assets. That is, the invention utilizes a distributed network of devices to distribute Non-Fungible Tokens (NFTs) that are associated with a group of Fungible Tokens (FTs) based on assets in which the NFTs are distributed to designated device that is at a different hierarchical level in an order of data transmission than a plurality of communication devices based on a designated device’s asymmetric cryptography key pair. If the rejection rendered hereon are properly overcome, the claims may become patentable as the prior art made of record alone or in combination do not disclose each proportion of assets from the plurality of proportions of assets associated with a communication device from a first plurality of communication devices; and sending, via a distributed ledger-based network and based at least in part on an asymmetric cryptography key pair, each group of fungible tokens from the first plurality of groups of fungible tokens to a communication device associated with that group of fungible tokens, the communication device being included in the first plurality of communication devices, the first plurality of groups of fungible tokens being divided into a second plurality of groups of fungible tokens and a hierarchical level in an order of data transmission and not hierarchical in network topology. Yet even if the missing claimed elements were found in a reasonable number of references, a person of ordinary skill in the art at the time the invention was made would not have been motivated to combine the above missing elements. 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 USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The 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/process/file/efs/guidance/eTD-info-I.jsp. Claims 1-3, 5, 8-10, 12, 15-17 and 19 are rejected on the ground of nonstatutory obviousness-type double patenting as being unpatentable over claims 1, 7-9 and 17 of U.S. Patent Nos. 11,481,841 issued to inventors: John Stoddard Robotham, Belmont, MA (US) and Assignee/Applicant: EYGS LLP, London (GB) in view of Jette et al. (US 11,288,736 B1). U.S. Patent No. 11,481,841 B2 has an effective filing date of Nov. 20 , 2019, and issued on Oct. 25, 2022, which is before the effective filing date of April 20, 2026, of the instant application. Although the claims are not identical, they are not patentably distinct from each other because claims 1-3, 5, 8-10, 12, 15-17 and 19 are generic to all that are recited in claims 1, 7-9 and 17 of U.S. Patent Nos. 11,481,841 B2. That is, claims 1, 7-9 and 17 of U.S. Patent Nos. 11,481,841 B2 falls entirely within the scope of claims 1-3, 5, 8-10, 12, 15-17 and 19 of the instant application. Further, claims 1, 7-9 and 17 of U.S. Patent Nos. 11,481,841 B2 falls entirely within the scope of claims 1-3, 5, 8-10, 12, 15-17 and 19 of the instant application hence those claims, respectively are anticipated by U.S. Patent No. 11,481,841 B2. With respect to independent claims 1, 8 and 15 of the instant application, the element “storing data associated with a plurality of proportions of assets from a plurality of fungible assets in a first instance of a distributed ledger database at a transaction originating communication device,” is not explicitly disclosed by claims of U.S. Patent No. 11,481,841 B2. However, Jette discloses storing data associated with a plurality of proportions of assets from a plurality of fungible assets in a first instance of a distributed ledger database at a transaction originating communication device. (Figs. 1-3, 8; Col. 6, Lines 42-59 “the price of a token may be directly proportional to the value of qualified assets and inversely proportional to the number outstanding tokens.” Col. 21, Lines 28-34 “token minting component 410 mints a number of tokens that is proportional to the value of qualified assets corresponding to a deal, agreement, loan, or SAN.” Col. 27, Lines 28-33 “Storage contract 722 may serve as a static registry of identifications of deals corresponding to one or more loan applications, identifications of parties participating in system 800, and price at which tokens are minted at for each time tokens are minted by system 800.”) Therefore, 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 to simply substitute one equivalent technique for another to accomplish the same by simply substituting storing data of assets in a distributed ledger database and generating of tokens for assets that are maintained on distributed ledger-based networks. That is, simply substituting storing data of assets in a distributed ledger database and generating of tokens for assets that are maintained on distributed ledger-based networks of Claims 1, 9 and 17 of U.S. Patent No. 11,481,841 B2 in to the instant independent claims element of storing data associated with a plurality of proportions of assets from a plurality of fungible assets in a first instance of a distributed ledger database at a transaction originating communication device. This is in order to maintain asset data in association with tokenized data on distributed ledger using. ("Express suggestion to substitute one equivalent technique for another need not be present to render such substitution obvious"; In re Fout, 213 USPQ 532 (CCPA 1982), In re Siebentritt, 152 USPQ 618 (CCPA 1967); Ex Parte Smith, 83 USPQ2d 1509 (Bd. Pat. App. & Int. 2007); KSR International Co. v. Teleflex Inc., 82 USPQ2d 1385 (U.S. 2007)). Claims 1-2, 5-6, 8-9, 12-13, 15-16 and 19-20 are rejected on the ground of non-statutory double patenting as being unpatentable over claims 1 and 11 of U.S. Patent No. 12,169,869. Although the claims at issue are not identical, they are not patentably distinct from each other because claims 1-2, 5-6, 8-9, 12-13, 15-16 and 19-20 of the present application are generic to the corresponding independent claims 1 and 11 of Patent No. 12,169,869. Independent claims 1 and 11 of Patent No. 12,169,869 include all the limitations of claims 1, 8 and 15 of the present application. Independent claims 1 and 11 of Patent No. 12,169,869 include all the limitations of claims 1-2, 5-6, 8-9, 12-13, 15-16 and 19-20 of the present application. Independent claims 1 and 11 of Patent No. 12,651,296 include all the limitations of claims 1-2, 5-6, 8-9, 12-13, 15-16 and 19-20 of the present application. With respect to claim 8, 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 to include a processor-readable non-transitory medium storing code representing instructions to be executed by a processor to carry out the steps of claims 1 and 11 of U.S. Patent No. US 12,169,869 B2 in to the instant claims. One having ordinary skill in the art would have been motivated to make such a modification to accomplish the same results of perfuming the recited steps of claims 1 and 11 by providing a processor-readable non-transitory medium storing code representing instructions to be executed by a processor specifically programed to perform the steps of claims 1 and 11 of U.S. Patent No. US 12,169,869 B2 to provide a plurality of non-fungible tokens for each group of fungible tokens from the second plurality of groups of fungible tokens to designated recipients communication devices based on first plurality of groups of fungible tokens that are associated with assets. With respect to Claims “1. A method” “8. A processor-readable non-transitory medium storing code representing instructions to be executed by a processor,” “15. An apparatus,” (US11481841B2; “claim 1… An apparatus, comprising: a memory; and a processor operatively coupled to the memory, the processor configured to:…” “claim 9… A method, comprising:…” “claim 17… A processor-readable non-transitory medium storing code representing instructions to be executed by a processor, the code comprising code to cause the processor to:” ) (US12169869B2; “1. A method,” and “11. A distributed ledger-based networks (DLN) system,”) (US12651296; “1. A method,” and “11. A system,”) storing data associated with a plurality of proportions of assets from a plurality of fungible assets in a first instance of a distributed ledger database at a transaction originating communication device; (US 11,481,841 B2) (US 12,169,869 B2; “claims 1 A method, and 11… storing, at a processor of a transaction originating communication machine, data associated with a plurality of proportions of assets from a plurality of fungible assets in a first instance of distributed ledger database at the transaction originating communication machine;… ”) (US 12,651,296 B2) dividing, at a processor of the transaction originating communication device, a plurality of fungible tokens into a first plurality of groups of fungible tokens based on the data, each proportion of assets from the plurality of proportions of assets associated with a communication device from a first plurality of communication devices; and (US 11,481,841 B2; “claims 1, 9 and 17… divide the plurality of fungible tokens into a first plurality of groups of fungible tokens;”) (US 12,169,869 B2; “claims 1 and 11… dividing, at the processor of the transaction originating communication machine, a plurality of fungible tokens into a first plurality of groups of fungible tokens based on the data, each proportion of assets from the plurality of proportions of assets associated with a communication machine that is from a first plurality of communication machines that is at a different hierarchical level in an order of data transmission than the transaction originating communication machine, the plurality of fungible tokens collectively representing on a distributed ledger-based network the plurality of fungible assets;”) (US 12,651,296 B2; “claims 1 and 11… dividing, at a processor of a transaction originating communication machine, a plurality of fungible tokens into a first plurality of groups of fungible tokens;”) sending, via a distributed ledger-based network and based at least in part on an asymmetric cryptography key pair, each group of fungible tokens from the first plurality of groups of fungible tokens to a communication device associated with that group of fungible tokens, the communication device being included in the first plurality of communication devices, (US 11,481,841 B2; “claims 1, 9 and 17… send, via a distributed ledger-based network and using a zero-knowledge proof protocol, each group of fungible tokens from the first plurality of groups of fungible tokens to a communication device associated with that group of fungible tokens,”) (US 12,169,869 B2; “claims 1 and 11… sending, via the processor and the distributed ledger-based network and based at least in part on the asymmetric cryptography key pair, the first plurality of groups of fungible tokens to the communication machine from the first plurality of communication machine that is associated with a group of fungible tokens from the first plurality of groups of fungible tokens;”) (US 12,651,296 B2; “claims 1 and 11… sending, to a communication machine from a first plurality of communication machines that is at a different hierarchical level in an order of data transmission than the transaction originating communication machine and based at least in part on a first asymmetric cryptography key pair, the first plurality of groups of fungible tokens, the communication machine from the first plurality of communication machines storing an account identifier associated with a transaction destination from a plurality of transaction destinations, the first plurality of groups of fungible tokens from the plurality of fungible tokens being a same type as a second fungible token from the plurality of fungible tokens;”) the first plurality of groups of fungible tokens being divided into a second plurality of groups of fungible tokens and (US 11,481,841 B2; “claims 1, 9 and 17… dividing, by the communication machine from the first plurality of communication machines, the first plurality of groups of fungible tokens into a second plurality of groups of fungible tokens;”) (US 12,169,869 B2; “claims 1 and 11… dividing, by the communication machine from the first plurality of communication machines, the first plurality of groups of fungible tokens into a second plurality of groups of fungible tokens;”) (US 12,651,296 B2) received at a second plurality of communication devices that is at a different hierarchical level in an order of data transmission than the first plurality of communication devices to cause (US 11,481,841 B2; “claims 1, 9 and 17… the second plurality of groups of fungible tokens being received at a second plurality of communication devices that is at a different hierarchical level in an order of data transmission than the first plurality of communication devices,”) (US 12,169,869 B2; “claims 1 and 11… receiving, by at least one communication machine from a second plurality of communication machines that is at a different hierarchical level in an order of data transmission than the first plurality of communication machines, the second plurality of groups of fungible tokens;”) (US 12,651,296 B2; “claims 1 and 11… receiving, by a processor of a communication machine from a second plurality of communication machines that is at a different hierarchical level in the order of data transmission than the first plurality of communication machines and based at least in part on a second asymmetric cryptography key pair, a second plurality of groups of fungible tokens;”) the second plurality of communication devices to send, to a designated recipient communication device, a plurality of non-fungible tokens for each group of fungible tokens from a second plurality of groups of fungible tokens, each communication device from the first plurality of communication devices and from the second plurality of communication devices having a hierarchical level in an order of data transmission and not hierarchical in network topology. (US 11,481,841 B2; “claims 1, 9 and 17… receive, from the second plurality of communication devices, a plurality of non-fungible tokens, each non-fungible token including an identifier (1) uniquely identifying a transaction destination from a plurality of transaction destinations and (2) from a plurality of identifiers, each non-fungible token associated with a group of fungible tokens from the second plurality of groups of fungible tokens.”) (US 12,169,869 B2; “claims 1 and 11… sending, by the at least one communication machine from the second plurality of communication machines, to a designated recipient communication machine having a direct account relationship with at least one communication machine from the second plurality of communication machines and for each group of fungible tokens from the second plurality of groups of fungible tokens, a plurality of non-fungible tokens generated via a second smart contract at the distributed ledger-based network.”) (US 12,651,296 B2; “claims 1 and 11… sending, by the processor of the communication machine from the second plurality of communication machines to a processor of a designated recipient communication device via a distributed ledger-based network that is at a different hierarchical level in the order of data transmission than the second plurality of communication machines, and based at least in part on a third asymmetric cryptography key pair, the non-fungible token to establish a chain of custody of the plurality of fungible tokens from the transaction originating communication machine to the second plurality of communication machines, the second plurality of communication machines not including the transaction originating communication machine or the transaction destination.”) Claims 2, “The method, and claim 9. The processor-readable non-transitory medium, 16. The apparatus, wherein: a communication device from the first plurality of communication devices is at a first hierarchical level at a first time and at a second hierarchical level at a second time.” (US 11,481,841 B2; “claim 7. The apparatus of… wherein: a communication device from the first plurality of communication devices is at a first hierarchical level at a first time and at a second hierarchical level at the second time.”) (US 12,169,869 B2; “claims 1 and 11… “one communication machine from a second plurality of communication machines that is at a different hierarchical level in an order of data transmission than the first plurality of communication machines”) (US 12,651,296 B2; “claims 8 The method of claim 1, wherein: the communication machine from the plurality of communication machines is at a first hierarchical level at a first time and at a second hierarchical level at a second time.” and “claim 18 (Currently Amended) The system of claim 11, wherein: the communication machine from the plurality of communication machines is at a first hierarchical level at a first time and at a second hierarchical level at the second time.”) Claims “3. The method,” claim “10. The processor-readable non-transitory medium,” and claim “17. The apparatus of, wherein:” a hierarchical level of a communication device from the first plurality of communication devices is not associated with a physical connection or a geographical region of the communication device.” (US 11,481,841 B2; “claim 8. The apparatus… wherein: a hierarchical level of a communication device from the first plurality of communication devices is not associated with a hierarchy of a wired connection or a hierarchy of a geographical region of the communication device.”) (US 12,169,869 B2) (US 12,651,296 B2; “claims 9 The method of claim 1, wherein: a hierarchical level of the communication machine from the first plurality of communication machines is not associated with a physical connection or a geographical region of the communication machine.” “claim 19 The system of claim 11, wherein: a hierarchical level of the communication machine from the first plurality of commw1ication machines is not associated with a physical connection or a geographical region of the communication machines.”) Claims “5. The method,” claim “12. The processor-readable non-transitory medium,” and “19. The apparatus,” wherein the plurality of fungible tokens collectively represents on the distributed ledger-based network the plurality of fungible assets.” (US 11,481,841 B2; “claim 1 An apparatus… plurality of fungible tokens collectively representing a plurality of fungible assets…via a distributed ledger-based network…” “claim 9 A method… a plurality of fungible tokens collectively representing a plurality of fungible assets… via a distributed ledger-based network…” and “claim 17. A processor-readable non-transitory medium… via a distributed ledger-based network”) (US 12,169,869 B2; “claim 1… A method… the plurality of fungible tokens collectively representing on a distributed ledger-based network the plurality of fungible assets;” claim 11. A distributed ledger-based networks (DLN) system… the plurality of fungible tokens collectively representing on a distributed ledger-based network the plurality of fungible assets;”) (US 12,651,296 B2) Claims “6. The method,” claim “13. The processor-readable non-transitory medium,” and claim “20. The apparatus,” wherein each non-fungible token from the plurality of nonfungible tokens being non-divisible and associated with an identifier (1) uniquely identifying a transaction destination from a plurality of transaction destinations and (2) from a plurality of identifiers.” (US 11,481,841 B2) (US 12,169,869 B2; “claim 1… A method… each non-fungible token from the plurality of non-fungible tokens being non-divisible and associated with an identifier (1) uniquely identifying, without revealing, a transaction destination from a plurality of transaction destinations based on a ZKP protocol and (2) from a plurality of identifiers,” and “claim 11. A distributed ledger-based networks (DLN) system… each non-fungible token from the plurality of non-fungible tokens being non-divisible and associated with an identifier (1) uniquely identifying, without revealing, a transaction destination from a plurality of transaction destinations based on a ZKP protocol and (2) from a plurality of identifiers,”) (US 12,651,296 B2; “claim 1 A method… each non-fungible token from the plurality of non-fungible tokens being non-divisible and associated with the account identifier: (1) uniquely identifying, without revealing, the transaction destination from the plurality of transaction destinations using a zero knowledge proof (ZKP) protocol and (2) from a plurality of account identifiers,” and “claim 11 A system… each non-fungible token from the plurality of non-fungible tokens being non-divisible and associated with the account identifier: (1) uniquely identifying, without revealing, the transaction destination from the plurality of transaction destinations using a zero knowledge proof (ZKP) protocol and (2) from a plurality of account identifiers,”) Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure: PGPub Wilson et al. (US 2020/0051043 A1) discloses: dividing, at a processor of the transaction originating communication device, a plurality of fungible tokens into a first plurality of groups of fungible tokens; (Figs. 3, 5; Pars. [0084] “The method 300 may begin at step 302 where the at least one processor determines a split ratio for a new split of security tokens 102 held in at least one address of a distributed ledger 122, e.g., an Ethereum blockchain.” [0088], [0120]) sending, via a distributed ledger-based network, each group of fungible tokens from the first plurality of groups of fungible tokens to a communication device associated with that group of fungible tokens, the communication device being included in the first plurality of communication devices, (Figs. 2B, 5A; Pars. [0035]-[0036], [0082], [0098] “In examples, step 402 may include a transfer() method 109 being called. The transfer() method 109 may be implemented in the security token 102 and may be called by a wallet (e.g., implemented on an investor 120 smartphone or in a browser using Metamask) or any other computing device (e.g., a hosted Ethereum provider, such as Infura) or via direct private network node 140 access.”) received at a second plurality of communication devices that is at a different hierarchical level in an order of data transmission than the first plurality of communication devices; (Par. [0031] “A security token 102 transaction may transfer a quantity of security tokens 102 from one or more input addresses (belonging to one or more investors 120, broker dealers 118, and/or custodians 116) to at least one output address (belonging to one or more investors 120, broker dealers 118, and/or custodians 116).” [0072], [0082]) each communication device from the first plurality of communication devices and from the second plurality of communication devices having a hierarchical level in an order of data transmission. (Fig. 2B, 8: Pars. [0079]-[0080] “FIG. 2B is a block diagram illustrating a hierarchy of entities in the system 100 illustrated in FIG. 1. Specifically, FIG. 2B shows relationships between one or more investors 120, optional one or more broker dealers 118, optional one or more custodians 116, and/or one or more owners 112 of the system 100. the hierarchy in FIG. 2B may define data permissions in the system 100. The hierarchy may be stored in any suitable form and/or may be implicit in the data stored in various elements 223.” [0137]) PGPub Yantis et al. (US 2021/0248594 A1) disclose: second plurality of communication devices to send, to a designated recipient communication device, a plurality of non-fungible tokens. (Fig. 7; Pars. [0848] “A token may be transmitted amongst users in any suitable manner. For example, a token may be transmitted via email, instant message, text message, digital transfer, social media platforms, and the like. In some of these embodiments, the token may be transmitted directly from the sender's user device 190 (e.g., from the user's digital wallet) to a user device 190 (e.g., smartphone) or account (e.g., email account or messaging application) associated with the intended recipient. Upon initiating the transmission, the digital wallet may transmit a transfer request to the platform 100 and may transmit a copy of the token to the recipient's user device 190 or specified account.” [0887], [0898]) PGPub Vijayan (US 2020/0005284 A1) discloses: generating, at the processor of the communication machine using a smart contract at a distributed ledger-based network and based on the plurality of fungible tokens, a non-fungible token. (Pars. [0067], [0109]) exchanging, by the processor of the communication device, the groups of fungible tokens for the plurality of non-fungible tokens. (Pars. [0012], [0086]) Any inquiry concerning this communication or earlier communications from the examiner should be directed to WODAJO GETACHEW whose telephone number is (469)295-9069. The examiner can normally be reached M-F 8:00-6:00 CST. 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, John W Hayes can be reached at (571) 272-6708. 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. /WODAJO GETACHEW/Examiner, Art Unit 3697
Read full office action

Prosecution Timeline

Apr 30, 2026
Application Filed
Sep 29, 2026
Examiner Interview (Telephonic)
Oct 01, 2026
Non-Final Rejection mailed — §DP (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12755286
METHODS AND SYSTEMS FOR GENERATING RULES FOR UNSEEN FRAUD AND CREDIT RISKS USING ARTIFICIAL INTELLIGENCE
5y 4m to grant Granted Oct 06, 2026
Patent 12755260
DECENTRALIZED NETWORK WITH NEAR INSTANTANEOUS TERMINAL TRANSFERS
1y 3m to grant Granted Oct 06, 2026
Patent 12726410
PREDICTIVE NORMALIZATION FOR BLOCKCHAIN RESOURCE MANAGEMENT
2y 1m to grant Granted Sep 01, 2026
Patent 12718293
BLOCKCHAIN-BASED SHARED APPRECIATION NOTE
3y 1m to grant Granted Aug 25, 2026
Patent 12719675
End-to-End Encryption and Hot Wallet Key Recovery Apparatuses, Processes and Systems
1y 9m 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
41%
Grant Probability
80%
With Interview (+39.1%)
Low
PTA Risk
Based on 235 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