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 .
Detailed Action
This communication is in response to the application filed on 11/05/2024 in which Claims 1-20 are presented for examination.
Drawings
The applicant’s drawings submitted on 11/05/2024 are acceptable for examination purposes.
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 obviousness-type 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); and 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 a nonstatutory double patenting ground provided the conflicting application or patent either is shown to be commonly owned with this application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement.
Effective January 1, 1994, a registered attorney or agent of record may sign a terminal disclaimer. A terminal disclaimer signed by the assignee must fully comply with 37 CFR 3.73(b).
Claims 1-20 are rejected on the ground of nonstatutory obviousness-type double patenting as being unpatentable over claims 1-20 of US patent No. 11870654
Claims 1-20 recite similar limitations as claims 1-20 of US No. 11870654 as follows:
Instant application
US patent No. 11870654
Claim 1. A system for introducing self-contained intent functionality into decentralized computer networks, comprising: memory storing computer program instructions; and one or more processors that, when executing the computer program instructions, effectuate operations comprising: with respect to each executable of first and second executables respectively on first and second decentralized networks: obtaining an executable address associated with the executable on the respective decentralized network; determining, based on the executable address, a first data structure of cryptographically-linked data structures associated with the respective decentralized network, wherein the first data structure corresponds to a creation time associated with the executable on the respective decentralized network, the creation time corresponding to a time that the executable is created on the respective decentralized network; iterating, based on the executable address, over token allowance events associated with the executable from the first data structure until a latest data structure of the cryptographically-linked data structures; and extracting, from the token allowance events, source addresses associated with network tokens of the respective decentralized network and allowance amounts associated with the network tokens, wherein each of the network tokens corresponds to a resource related to the respective decentralized network; generating a routing data structure indicating exchange eligibility of resource sources based on the source addresses associated with the network tokens of the respective decentralized network and the allowance amounts associated with the network tokens; obtaining a resource exchange request for exchanging a first resource of the first decentralized network for a second resource of the second decentralized network; in response to obtaining the resource exchange request, verifying acceptance of the resource exchange request based on the routing data structure; and in response to verifying the acceptance of the resource exchange request based on the routing data structure, initiating a first update to the first decentralized network and a second update to the second decentralized network.
Claim 2 and 13.
Claims 3-12.
Claims 14-20.
Claim 1. A system for introducing self-contained intent functionality into decentralized computer networks, comprising: memory storing computer program instructions; and one or more processors that, when executing the computer program instructions, effectuate operations comprising: with respect to each executable of first and second executables respectively on first and second decentralized networks: obtaining an executable address associated with the executable on the respective decentralized network; determining, based on the executable address, a first data structure of cryptographically-linked data structures associated with the respective decentralized network, wherein the first data structure corresponds to a creation time associated with the executable on the respective decentralized network, the creation time corresponding to a time that the executable is created on the respective decentralized network; iterating, based on the executable address, over token allowance events associated with the executable from the first data structure until a latest data structure of the cryptographically-linked data structures; and extracting, from the token allowance events, source addresses associated with network tokens of the respective decentralized network and allowance amounts associated with the network tokens, wherein each of the network tokens corresponds to a resource related to the respective decentralized network; generating a routing data structure indicating exchange eligibility of resource sources based on the source addresses associated with the network tokens of the respective decentralized network and the allowance amounts associated with the network tokens; obtaining a resource exchange request for exchanging a first resource of the first decentralized network for a second resource of the second decentralized network; in response to obtaining the resource exchange request, verifying acceptance of the resource exchange request based on the routing data structure; and in response to verifying the acceptance of the resource exchange request based on the routing data structure, initiating a first update to the first decentralized network and a second update to the second decentralized network.
Claims 2 and 13.
Claims 3-12.
Claims 14-20.
The table above shows that, although the corresponding claims are directed to different statutory categories, the US patent No. 11870654 implemented on a computer would render the claims in the instant application obvious. It is clearly obvious that the (US patent No. 11870654 substantially discloses the subject matter of claim 1 of the instant Application.
The Applicant merely broadens the scope of the instant application by deleting a few elements from the (US patent No. 11870654).
This is an obviousness-type double patenting rejection.
Claims 1-20 are rejected on the ground of nonstatutory obviousness-type double patenting as being unpatentable over claims 1-16 of US patent No. 11133936 B1.
The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. These include.
US 20220086201 A1– Davis – describes project management platform system that uses blockchain for managing creation of entertainment projects from a plurality of devices and users.
US 11269859 B1– Luedtke - correlate different types of data obtained from a distributed ledger system. The distributed ledger system can generate transaction notifications, log data, and/or metrics data. At least some of the data generated by the distributed ledger system can be obtained by a data intake and query system via a distributed ledger system monitor.
US 20210256587 A1- de VOS et al. an information exchange platform that preserves anonymity while preserving accountability for the information providers.
US 20200026785 A1 – Patangia provides decentralized peer-to-peer (e.g., P2P) computer systems specialized for managing data communications between the P2P computer systems. In particular, one or more aspects of the disclosure relate to managing data manifests based on or using a blockchain..
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to EVANS DESROSIERS whose telephone number is (571)270-5438. The examiner can normally be reached Monday -Friday 8:00 am - 5:30 pm.
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 on (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.
/EVANS DESROSIERS/ Primary Examiner, Art Unit 2491