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 .
Status of Claims
Claims 1-12 and 14 are elected, in response to restriction.
Claim 13 is non-elected.
Claims 1-12 and 14 are pending.
Information Disclosure Statement
The information disclosure statement(s) (IDS) submitted on 02/25/2026 is/are in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement(s) has/have been considered by the examiner.
Claim Objections
Claim 14 is objected to because of the following informalities. The claim contains a reference to a previous claim in the same application while failing to include all the limitations of the previous claim. Appropriate correction is required. Examiner suggests amending the claim to explicitly recite the method steps referred to. For purposes of compact prosecution, Examiner will interpret the claim as if amended to explicitly recite the method steps referred to.
Election/Restrictions
Applicant's election without traverse of claims 1-12 and 14 in the reply filed on 08/24/2026 is acknowledged. Claim 13 is withdrawn from further consideration pursuant to 37 CFR 1.142(b) as being drawn to a nonelected Invention.
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.
Claims 1-9, 11-12 and 14 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1-15 of U.S. Patent No. 12,530,205 B2. Although the claims at issue are not identical, they are not patentably distinct from each other because all the claims at issue are recited in claims 1-15 of U.S. Patent No. 12,530,205 B2.
The claims are mapped as follows:
Instant Application 19/422,003
US Patent 12,530,205 B2
1. A method of implementing a deterministic finite automata (DFA) via a blockchain, comprising the steps:
storing a state transition table for the DFA in a computer-based storage resource, wherein the state transition table provides the possible states, actions, conditions and trigger events for the DFA; and
using at least one computing agent arranged to generate and/or execute at least one program that is arranged to:
associate a portion of data in an unspent transaction output of a blockchain transaction (Tx1) with a first state of the state transition table of the DFA; and
use a portion of code to implement or represent at least one state transition trigger event which, when executed by the at least one computing agent, causes a further blockchain transaction (Tx2) to be sent to the blockchain to spend the unspent transaction output of the blockchain transaction (Tx1) and move the DFA to a further state.
1. A method of implementing a deterministic finite automata (DFA) on a blockchain, comprising steps of:
storing a state transition table for the DFA in a storage resource external to the blockchain;
associating a portion of data in a locking script of an unspent output (UTXO1) of a blockchain transaction (Tx1) with a state of the DFA in the state transition table;
monitoring, by a program executing on a hardware processing element of the blockchain, based on the association of the unspent output (UTXO1) with the state of the DFA, for a trigger for a transition from the state of the DFA to a further state in the state transition table;
detecting, by the program, the trigger; and
automatically spending, by the program, the unspent output (UTXO1) of the blockchain transaction (TX1) in response to the trigger, wherein the automatic spending comprises:
transmitting the blockchain transaction (TX1) over a network connection to a blockchain node of the blockchain; and
recording in the blockchain, by the blockchain node in response to the automatic spending, the transition of the DFA to the further state.
2. A method according to claim 1 and further comprising the step of: using a further transaction (TX2) to make another transition from the state of the DFA to a second further state, wherein the second further state is associated with a portion of data provided within a locking script of another unspent output (UTXO2) of the further transaction.
3. A method according to claim 1 and further comprising the step of:
using a portion of code to implement or represent at least one state transition trigger.
12. A method according to claim 1 and further comprising the step of: using one or more computing agents to perform the step of associating the portion of the data in the locking script.
14. A system for implementing a deterministic finite automata (DFA) on a blockchain, the system comprising:
at least one blockchain node of the blockchain;
a non-transitory memory for storing machine executable instructions; and
a processor for accessing the memory and executing the machine executable instructions, wherein the machine executable instructions, when executed cause the processor to execute first operations for implementing a deterministic finite automata (DFA) on a blockchain, the first operations comprising:
storing a state transition table for the DFA in a storage resource external to the blockchain; and
associating a portion of data in a locking script of an unspent output (UTXO1) of a blockchain transaction (Tx1) with a state of the DFA in the state transition table;
wherein the machine executable instructions further comprise a program of the blockchain, that when executed by the processor cause the processor to execute second operations, the second operations for the program comprising:
monitoring based on the association of the unspent output (UTXO1) with the state of the DFA, for a trigger for a transition from the state of the DFA to a further state in the state transition table;
detecting the trigger;
automatically spend the unspent output (UTXO1) of the blockchain transaction (Tx1) in response to the trigger, wherein the automatic spending comprises:
transmitting the blockchain transaction (Tx1) over a network connection to the at least one blockchain node of the blockchain; and
automatically cause the transition of the DFA to the further state to be recorded in the blockchain by the at least one blockchain node in response to the automatic spending.
15. A system according to claim 14 wherein the system comprises: a blockchain platform; and at least one computing agent arranged to implement the DFA via the blockchain.
2. The method of claim 1, wherein:
i) the given state of the state transition table is the current state of the DFA; and/or
ii) the further state is associated with a further portion of data provided within an unspent transaction output of the further transaction.
1. A method of implementing a deterministic finite automata (DFA) on a blockchain, comprising steps of:
storing a state transition table for the DFA in a storage resource external to the blockchain;
associating a portion of data in a locking script of an unspent output (UTXO1) of a blockchain transaction (Tx1) with a state of the DFA in the state transition table;
monitoring, by a program executing on a hardware processing element of the blockchain, based on the association of the unspent output (UTXO1) with the state of the DFA, for a trigger for a transition from the state of the DFA to a further state in the state transition table;
detecting, by the program, the trigger; and
automatically spending, by the program, the unspent output (UTXO1) of the blockchain transaction (TX1) in response to the trigger, wherein the automatic spending comprises:
transmitting the blockchain transaction (TX1) over a network connection to a blockchain node of the blockchain; and
recording in the blockchain, by the blockchain node in response to the automatic spending, the transition of the DFA to the further state.
2. A method according to claim 1 and further comprising the step of: using a further transaction (TX2) to make another transition from the state of the DFA to a second further state, wherein the second further state is associated with a portion of data provided within a locking script of another unspent output (UTXO2) of the further transaction.
3. The method of claim 1, wherein:
the portion of code comprises a machine-testable condition which provides a Boolean result based upon an input.
4. A method according to claim 3 wherein: the portion of code comprises a machine-testable condition which provides a Boolean result based upon an input.
4. The method of claim 3, wherein:
i) the input is determined at run time and is used by the portion of code to determine whether or not the unspent transaction output should be spent so as to move the DFA to the further state; and/or
ii) the input is a signal or value generated or provided by a human or non-human source.
5. A method according to claim 4 wherein the input is determined at run time and is used by the portion of code to determine whether or not the unspent output (UTXO1) should be spent so as to move the DFA to the other state.
13. The method according to claim 1 wherein: the program, as a result of being executed, further monitors for an input signal; and the trigger is activated by the input signal.
5. The method according to claim 1,
wherein the portion of data in the unspent transaction output is provided in a locking script.
6. A method according to claim 1 wherein the portion of data in the unspent output (UTXO1) is provided in a locking script.
6. The method of claim 1,
wherein the portion of data is a tag, label or a portion of metadata or a cryptographic key.
7. A method according to claim 6 wherein the portion of data is a tag, label or a portion of metadata.
11. A method according to claim 10 wherein the redeem script comprises a cryptographic key.
7. The method of claim 1, wherein:
i) the DFA is a model of a machine-executable smart contract; or
ii) the DFA facilitates the automated performance of a process.
8. A method according to claim 1 wherein: the DFA is a model of a machine-executable smart contract.
1. A method of implementing a deterministic finite automata (DFA) on a blockchain, comprising steps of:
storing a state transition table for the DFA in a storage resource external to the blockchain;
associating a portion of data in a locking script of an unspent output (UTXO1) of a blockchain transaction (Tx1) with a state of the DFA in the state transition table;
monitoring, by a program executing on a hardware processing element of the blockchain, based on the association of the unspent output (UTXO1) with the state of the DFA, for a trigger for a transition from the state of the DFA to a further state in the state transition table;
detecting, by the program, the trigger; and
automatically spending, by the program, the unspent output (UTXO1) of the blockchain transaction (TX1) in response to the trigger, wherein the automatic spending comprises:
transmitting the blockchain transaction (TX1) over a network connection to a blockchain node of the blockchain; and
recording in the blockchain, by the blockchain node in response to the automatic spending, the transition of the DFA to the further state.
8. The method of claim 1, wherein:
the unspent transaction output comprises a locking script which includes a hash of a puzzle, the solution of which must be provided by an input of a further blockchain transaction in order to spend the unspent transaction output and transition the DFA to another state.
9. A method according to claim 1 wherein: the unspent output (UTXO1) comprises a locking script which includes a hash of a puzzle, a solution of which must be provided by an input of a further transaction in order to spend the output (UTXO1) and transition the DFA to another state.
9. The method of claim 1, wherein:
the unspent transaction output comprises a locking script which includes a hash of a redeem script which must be provided by an input of a further transaction in order to spend the unspent transaction output and transition the DFA to another state.
10. A method according to claim 1 wherein: the unspent output (UTXO1) comprises a locking script which includes a hash of a redeem script which must be provided by an input of a further transaction in order to spend the output (UTXO1) and transition the DFA to another state.
10. The method of claim 1,
wherein the at least one program is further arranged to maintain a record of the number of times a particular state of the state transition table has been occupied by the DFA, wherein the record is maintained using an index which is incremented within a loop or iterating construct that terminates when a pre-defined condition is met.
No mapped claims
11. The method of claim 1,
wherein the at least one program is further arranged to monitor for and/or receive an input signal and, responsive to the input signal, generate the further blockchain transaction which comprises the further unspent transaction output and spends the unspent transaction output of the blockchain transaction (TX1); and
wherein:
the unspent transaction output of the blockchain transaction (Tx1) comprises a locking script which includes an identifier associated with the first state of the DFA, and
the unspent transaction output of the further blockchain transaction Tx2 comprises a locking script which includes a further identifier associated with a further state of the DFA.
1. A method of implementing a deterministic finite automata (DFA) on a blockchain, comprising steps of:
storing a state transition table for the DFA in a storage resource external to the blockchain;
associating a portion of data in a locking script of an unspent output (UTXO1) of a blockchain transaction (Tx1) with a state of the DFA in the state transition table;
monitoring, by a program executing on a hardware processing element of the blockchain, based on the association of the unspent output (UTXO1) with the state of the DFA, for a trigger for a transition from the state of the DFA to a further state in the state transition table;
detecting, by the program, the trigger; and
automatically spending, by the program, the unspent output (UTXO1) of the blockchain transaction (TX1) in response to the trigger, wherein the automatic spending comprises:
transmitting the blockchain transaction (TX1) over a network connection to a blockchain node of the blockchain; and
recording in the blockchain, by the blockchain node in response to the automatic spending, the transition of the DFA to the further state.
12. The method of claim 1,
wherein the state transition table is codified in software and the software comprises instructions relating to given inputs and the state transition or machine-executable actions that they trigger.
14. A system for implementing a deterministic finite automata (DFA) on a blockchain, the system comprising:
at least one blockchain node of the blockchain;
a non-transitory memory for storing machine executable instructions; and
a processor for accessing the memory and executing the machine executable instructions, wherein the machine executable instructions, when executed cause the processor to execute first operations for implementing a deterministic finite automata (DFA) on a blockchain, the first operations comprising:
storing a state transition table for the DFA in a storage resource external to the blockchain; and
associating a portion of data in a locking script of an unspent output (UTXO1) of a blockchain transaction (Tx1) with a state of the DFA in the state transition table;
wherein the machine executable instructions further comprise a program of the blockchain, that when executed by the processor cause the processor to execute second operations, the second operations for the program comprising:
monitoring based on the association of the unspent output (UTXO1) with the state of the DFA, for a trigger for a transition from the state of the DFA to a further state in the state transition table;
detecting the trigger;
automatically spend the unspent output (UTXO1) of the blockchain transaction (Tx1) in response to the trigger, wherein the automatic spending comprises:
transmitting the blockchain transaction (Tx1) over a network connection to the at least one blockchain node of the blockchain; and
automatically cause the transition of the DFA to the further state to be recorded in the blockchain by the at least one blockchain node in response to the automatic spending.
14. A system arranged to implement the method of claim 1.
14. A system for implementing a deterministic finite automata (DFA) on a blockchain, the system comprising:
at least one blockchain node of the blockchain;
a non-transitory memory for storing machine executable instructions; and
a processor for accessing the memory and executing the machine executable instructions, wherein the machine executable instructions, when executed cause the processor to execute first operations for implementing a deterministic finite automata (DFA) on a blockchain, the first operations comprising:
storing a state transition table for the DFA in a storage resource external to the blockchain; and
associating a portion of data in a locking script of an unspent output (UTXO1) of a blockchain transaction (Tx1) with a state of the DFA in the state transition table;
wherein the machine executable instructions further comprise a program of the blockchain, that when executed by the processor cause the processor to execute second operations, the second operations for the program comprising:
monitoring based on the association of the unspent output (UTXO1) with the state of the DFA, for a trigger for a transition from the state of the DFA to a further state in the state transition table;
detecting the trigger;
automatically spend the unspent output (UTXO1) of the blockchain transaction (Tx1) in response to the trigger, wherein the automatic spending comprises:
transmitting the blockchain transaction (Tx1) over a network connection to the at least one blockchain node of the blockchain; and
automatically cause the transition of the DFA to the further state to be recorded in the blockchain by the at least one blockchain node in response to the automatic spending.
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.
Claims 1-12 and 14 are rejected under 35 U.S.C. 101 because the claimed invention is directed to an abstract idea without significantly more.
Step 1
Step 1 of the eligibility analysis asks is the claim to a process, machine, manufacture or composition of matter (See MPEP § 2106.03, subsections I and II). Claims 1-12 are directed to a computer-implemented method (i.e., process). Claim 14 is directed to a system (i.e., machine, and manufacture). Therefore, these claims fall within the four statutory categories of invention.
Step 2A, Prong One
Prong One asks does the claim recite an abstract idea, law of nature, or natural phenomenon (MPEP § 2106.04(II)(A)(1)). The independent claims under a broadest reasonable interpretation recite an abstract idea because the claims describe associating transaction data with states of a state transition table of a deterministic finite automata, grouped within the “certain methods of organizing human activity” grouping of abstract ideas (MPEP § 2106.04(a)(2), subsection II). The claim limitations reciting the abstract idea are grouped within the “certain methods of organizing human activity” grouping of abstract ideas because the limitations describe fundamental economic principles or practices, including mitigating risk, and describe commercial or legal interactions, including advertising, marketing or sales activities or behaviors. The following underlined claim limitations recite the abstract idea.
Claim 1:
A method of implementing a deterministic finite automata (DFA) via a blockchain, comprising the steps:
storing a state transition table for the DFA in a computer-based storage resource, wherein the state transition table provides the possible states, actions, conditions and trigger events for the DFA; and
using at least one computing agent arranged to generate and/or execute at least one program that is arranged to:
associate a portion of data in an unspent transaction output of a blockchain transaction (Tx1) with a first state of the state transition table of the DFA; and
use a portion of code to implement or represent at least one state transition trigger event which, when executed by the at least one computing agent, causes a further blockchain transaction (Tx2) to be sent to the blockchain to spend the unspent transaction output of the blockchain transaction (Tx1) and move the DFA to a further state.
Claim 14:
A system arranged to implement the method of claim 1.
Step 2A, Prong Two
Prong Two asks does the claim recite additional elements that integrate the judicial exception into a practical application (MPEP § 2106.04(II)(A)(2)). Examiners evaluate integration into a practical application by: (1) identifying whether there are any additional elements recited in the claim beyond the judicial exception(s); and (2) evaluating those additional elements individually and in combination to determine whether they integrate the exception into a practical application, using one or more of the considerations discussed in more detail in MPEP §§ 2106.04(d)(1), 2106.04(d)(2), 2106.05(a) through (c) and 2106.05(e) through (h). Here, the non-underlined claim limitations above recite additional elements. The additional elements do not improve the functioning of computers, another technology, or a technical field (MPEP §§ 2106.04(d)(1) and 2106.05(a)). The Specification does not assert that the invention improves upon conventional functioning of a computer, or upon conventional technology or technological processes. The claim does not purport to improve computer capabilities, but rather invokes computers merely as a tool by adding general purpose computers post-hoc to an abstract idea. A commonplace business method being applied on a general-purpose computer is not sufficient to show an improvement to technology. The claim must include more than mere instructions to perform the method on a generic component or machinery to qualify as an improvement to an existing technology. The Specification and the claim language provide evidence that the focus of the claim is on a scheme. An improvement in the abstract idea itself is not an improvement in technology. Even if the Specification describes technical improvements, they are not claimed. The additional elements do not apply the abstract idea to effect a particular treatment or prophylaxis for a disease or medical condition (MPEP § 2106.04(d)(2)). The additional elements do not implement the abstract idea with a particular machine or manufacture that is integral to the claim (MPEP § 2106.05(b)). A general-purpose computer that applies a judicial exception, such as an abstract idea, by use of conventional computer functions does not qualify as a particular machine. The additional elements do not transform or reduce a particular article to a different state or thing (MPEP § 2106.05(c)). The claim does not recite any transformation of an article where the article changes to a different state or thing. Nor do the additional elements apply the abstract idea in a meaningful way or impose a meaningful limit on it beyond linking its use to a particular technological environment, such that the claim as a whole is more than a drafting effort designed to monopolize the exception (MPEP § 2106.05(e)). The additional elements generally link the use of the judicial exception to a particular technological environment. A wholly generic computer implementation is not generally the sort of additional feature that provides any practical assurance that the process is more than a drafting effort designed to monopolize the abstract idea itself. The additional elements individually and in combination, merely serve as a tool to perform the abstract idea (MPEP § 2106.05(f)). Implementing an abstract idea on a generic computer, does not integrate the abstract idea into a practical application, similar to how the recitation of the computer in the claim in Alice amounted to mere instructions to apply the abstract idea of intermediated settlement on a generic computer. Use of a computer or other machinery in its ordinary capacity for economic or other tasks or simply adding a general-purpose computer or computer components after the fact to an abstract idea does not integrate a judicial exception into a practical application. The additional elements are being used in their ordinary capacity. The additional elements do no more than merely invoke computers or machinery as a tool to perform an existing process. The additional elements generally link the use of the abstract idea to a particular technological environment or field of use (MPEP § 2106.05(h)). Limitations that amount to merely indicating a field of use or technological environment in which to apply a judicial exception cannot integrate a judicial exception into a practical application. Thus, the additional elements do not integrate the abstract idea into a practical application. Accordingly, the claims are directed to the abstract idea identified above.
Step 2B
Step 2B determines whether the claim as a whole amount to significantly more than the abstract idea itself (MPEP § 2106.05). In Step 2B examiners carry over their identification of the additional element(s) in the claim from Step 2A Prong Two; carry over their conclusions from Step 2A Prong Two on the considerations discussed in MPEP §§ 2106.05(a)-(c), (e), (f) and (h); re-evaluate any additional element or combination of elements that was considered to be insignificant extra-solution activity per MPEP § 2106.05(g), because if such re-evaluation finds that the element is unconventional or otherwise more than what is well-understood, routine, conventional activity in the field, this finding may indicate that the additional element is no longer considered to be insignificant; and evaluate whether any additional element or combination of elements are other than what is well-understood, routine, conventional activity in the field, or simply append well-understood, routine, conventional activities previously known to the industry, specified at a high level of generality, to the judicial exception, per MPEP § 2106.05(d). The additional elements individually and in combination, merely serve as a tool to perform the abstract idea (MPEP § 2106.05(f)). The additional elements generally link the use of the abstract idea to a particular technological environment or field of use (MPEP § 2106.05(h)). Individually, the additional elements do not amount to significantly more than the abstract idea. Here, the additional elements simply append well-understood, routine, conventional activities previously known to the industry, specified at a high level of generality, to the judicial exception, e.g., a claim to an abstract idea requiring no more than a generic computer to perform generic computer functions that are well-understood, routine and conventional activities previously known to the industry. A factual determination is required to support a conclusion that an additional element (or combination of additional elements) is well-understood, routine, conventional activity. Here, the specification of the application indicates that additional elements are well-known or conventional (See Spec. 0014, 0097, 0100). There is nothing in the specification to indicate that the operations recited in the claims require any specialized hardware or inventive computer components or that the claimed invention is implemented using other than generic computer components to perform generic computer functions. The ordered combination recites no more than the individual elements do. Thus, the additional elements are not significantly more than the abstract idea. Accordingly, the claims are directed to the abstract idea identified above without significantly more. The claims are not eligible, warranting a rejection for lack of subject matter eligibility and concluding the eligibility analysis.
Dependent Claims
Claim 2 recites an abstract idea because the claim describes associating transaction data with states of a state transition table of a deterministic finite automata, grouped within the “certain methods of organizing human activity” grouping of abstract ideas. The following underlined claim limitations recite the abstract idea. The non-underlined claim limitations recite additional elements. The additional elements do not integrate the abstract idea into a practical application and are not significantly more than the abstract idea because the additional elements individually and in combination, merely serve as a tool to perform the abstract idea and generally link the use of the abstract idea to a particular technological environment or field of use. The additional elements, individually and in combination, are well-understood, routine, conventional activity (See Spec. 0014, 0097, 0100). Therefore, the claim is not eligible.
i) the given state of the state transition table is the current state of the DFA; and/or
ii) the further state is associated with a further portion of data provided within an unspent transaction output of the further transaction.
Claim 3 recites an abstract idea because the claim describes associating transaction data with states of a state transition table of a deterministic finite automata, grouped within the “certain methods of organizing human activity” grouping of abstract ideas. The following underlined claim limitations recite the abstract idea. The non-underlined claim limitations recite additional elements. The additional elements do not integrate the abstract idea into a practical application and are not significantly more than the abstract idea because the additional elements individually and in combination, merely serve as a tool to perform the abstract idea and generally link the use of the abstract idea to a particular technological environment or field of use. The additional elements, individually and in combination, are well-understood, routine, conventional activity (See Spec. 0014, 0097, 0100). Therefore, the claim is not eligible.
the portion of code comprises a machine-testable condition which provides a Boolean result based upon an input.
Claim 4 recites an abstract idea because the claim describes associating transaction data with states of a state transition table of a deterministic finite automata, grouped within the “certain methods of organizing human activity” grouping of abstract ideas. The following underlined claim limitations recite the abstract idea. The non-underlined claim limitations recite additional elements. The additional elements do not integrate the abstract idea into a practical application and are not significantly more than the abstract idea because the additional elements individually and in combination, merely serve as a tool to perform the abstract idea and generally link the use of the abstract idea to a particular technological environment or field of use. The additional elements, individually and in combination, are well-understood, routine, conventional activity (See Spec. 0014, 0097, 0100). Therefore, the claim is not eligible.
i) the input is determined at run time and is used by the portion of code to determine whether or not the unspent transaction output should be spent so as to move the DFA to the further state; and/or
ii) the input is a signal or value generated or provided by a human or non-human source.
Claim 5 recites an abstract idea because the claim describes associating transaction data with states of a state transition table of a deterministic finite automata, grouped within the “certain methods of organizing human activity” grouping of abstract ideas. The following underlined claim limitations recite the abstract idea. The non-underlined claim limitations recite additional elements. The additional elements do not integrate the abstract idea into a practical application and are not significantly more than the abstract idea because the additional elements individually and in combination, merely serve as a tool to perform the abstract idea and generally link the use of the abstract idea to a particular technological environment or field of use. The additional elements, individually and in combination, are well-understood, routine, conventional activity (See Spec. 0014, 0097, 0100). Therefore, the claim is not eligible.
wherein the portion of data in the unspent transaction output is provided in a locking script.
Claim 6 recites an abstract idea because the claim describes associating transaction data with states of a state transition table of a deterministic finite automata, grouped within the “certain methods of organizing human activity” grouping of abstract ideas. The following underlined claim limitations recite the abstract idea. The non-underlined claim limitations recite additional elements. The additional elements do not integrate the abstract idea into a practical application and are not significantly more than the abstract idea because the additional elements individually and in combination, merely serve as a tool to perform the abstract idea and generally link the use of the abstract idea to a particular technological environment or field of use. The additional elements, individually and in combination, are well-understood, routine, conventional activity (See Spec. 0014, 0097, 0100). Therefore, the claim is not eligible.
wherein the portion of data is a tag, label or a portion of metadata or a cryptographic key.
Claim 7 recites an abstract idea because the claim describes associating transaction data with states of a state transition table of a deterministic finite automata, grouped within the “certain methods of organizing human activity” grouping of abstract ideas. The following underlined claim limitations recite the abstract idea. The non-underlined claim limitations recite additional elements. The additional elements do not integrate the abstract idea into a practical application and are not significantly more than the abstract idea because the additional elements individually and in combination, merely serve as a tool to perform the abstract idea and generally link the use of the abstract idea to a particular technological environment or field of use. The additional elements, individually and in combination, are well-understood, routine, conventional activity (See Spec. 0014, 0097, 0100). Therefore, the claim is not eligible.
i) the DFA is a model of a machine-executable smart contract; or
ii) the DFA facilitates the automated performance of a process.
Claim 8 recites an abstract idea because the claim describes associating transaction data with states of a state transition table of a deterministic finite automata, grouped within the “certain methods of organizing human activity” grouping of abstract ideas. The following underlined claim limitations recite the abstract idea. The non-underlined claim limitations recite additional elements. The additional elements do not integrate the abstract idea into a practical application and are not significantly more than the abstract idea because the additional elements individually and in combination, merely serve as a tool to perform the abstract idea and generally link the use of the abstract idea to a particular technological environment or field of use. The additional elements, individually and in combination, are well-understood, routine, conventional activity (See Spec. 0014, 0097, 0100). Therefore, the claim is not eligible.
the unspent transaction output comprises a locking script which includes a hash of a puzzle, the solution of which must be provided by an input of a further blockchain transaction in order to spend the unspent transaction output and transition the DFA to another state.
Claim 9 recites an abstract idea because the claim describes associating transaction data with states of a state transition table of a deterministic finite automata, grouped within the “certain methods of organizing human activity” grouping of abstract ideas. The following underlined claim limitations recite the abstract idea. The non-underlined claim limitations recite additional elements. The additional elements do not integrate the abstract idea into a practical application and are not significantly more than the abstract idea because the additional elements individually and in combination, merely serve as a tool to perform the abstract idea and generally link the use of the abstract idea to a particular technological environment or field of use. The additional elements, individually and in combination, are well-understood, routine, conventional activity (See Spec. 0014, 0097, 0100). Therefore, the claim is not eligible.
the unspent transaction output comprises a locking script which includes a hash of a redeem script which must be provided by an input of a further transaction in order to spend the unspent transaction output and transition the DFA to another state.
Claim 10 recites an abstract idea because the claim describes associating transaction data with states of a state transition table of a deterministic finite automata, grouped within the “certain methods of organizing human activity” grouping of abstract ideas. The following underlined claim limitations recite the abstract idea. The non-underlined claim limitations recite additional elements. The additional elements do not integrate the abstract idea into a practical application and are not significantly more than the abstract idea because the additional elements individually and in combination, merely serve as a tool to perform the abstract idea and generally link the use of the abstract idea to a particular technological environment or field of use. The additional elements, individually and in combination, are well-understood, routine, conventional activity (See Spec. 0014, 0097, 0100). Therefore, the claim is not eligible.
wherein the at least one program is further arranged to maintain a record of the number of times a particular state of the state transition table has been occupied by the DFA, wherein the record is maintained using an index which is incremented within a loop or iterating construct that terminates when a pre-defined condition is met.
Claim 11 recites an abstract idea because the claim describes associating transaction data with states of a state transition table of a deterministic finite automata, grouped within the “certain methods of organizing human activity” grouping of abstract ideas. The following underlined claim limitations recite the abstract idea. The non-underlined claim limitations recite additional elements. The additional elements do not integrate the abstract idea into a practical application and are not significantly more than the abstract idea because the additional elements individually and in combination, merely serve as a tool to perform the abstract idea and generally link the use of the abstract idea to a particular technological environment or field of use. The additional elements, individually and in combination, are well-understood, routine, conventional activity (See Spec. 0014, 0097, 0100). Therefore, the claim is not eligible.
wherein the at least one program is further arranged to monitor for and/or receive an input signal and, responsive to the input signal, generate the further blockchain transaction which comprises the further unspent transaction output and spends the unspent transaction output of the blockchain transaction (TX1); and
wherein:
the unspent transaction output of the blockchain transaction (Tx1) comprises a locking script which includes an identifier associated with the first state of the DFA, and
the unspent transaction output of the further blockchain transaction Tx2 comprises a locking script which includes a further identifier associated with a further state of the DFA.
Claim 12 recites an abstract idea because the claim describes associating transaction data with states of a state transition table of a deterministic finite automata, grouped within the “certain methods of organizing human activity” grouping of abstract ideas. The following underlined claim limitations recite the abstract idea. The non-underlined claim limitations recite additional elements. The additional elements do not integrate the abstract idea into a practical application and are not significantly more than the abstract idea because the additional elements individually and in combination, merely serve as a tool to perform the abstract idea and generally link the use of the abstract idea to a particular technological environment or field of use. The additional elements, individually and in combination, are well-understood, routine, conventional activity (See Spec. 0014, 0097, 0100). Therefore, the claim is not eligible.
wherein the state transition table is codified in software and the software comprises instructions relating to given inputs and the state transition or machine-executable actions that they trigger.
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 2, 7, and 14 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.
Lack of Antecedent Basis
Claim 2 recites "the further transaction" without proper antecedent basis. Appropriate correction is needed.
Claim 7 recites "the automated performance of a process" without proper antecedent basis. Appropriate correction is needed.
Therefore, these claims are indefinite and are rejected under 35 U.S.C. 112(b) or pre-AIA 35 U.S.C. 112, second paragraph.
Unclear Scope
Claim 14 is directed to a product (e.g., "A system ...”). For products, the claim limitations will define discrete physical structures or materials (See MPEP 2103(I)(C)). However, it is unclear what the structural recitations of claim 14 are because no structural recitations are recited. Therefore, the claim is indefinite and rejected under 35 U.S.C. 112(b) or pre-AIA 35 U.S.C. 112, second paragraph. See In re Zletz, 893 F.2d 319, 13USPQ2d 1320 (Fed. Cir. 1989) and MPEP 2173.02 (III)(B) which states “Examiners should bear in mind that "[a]n essential purpose of patent examination is to fashion claims that are precise, clear, correct, and unambiguous. Only in this way can uncertainties of claim scope be removed, as much as possible, during the administrative process.”
Claims Free of Art
Claims 1-12 and 14 are free of art. The closest prior art of record is US 2008/0101371 A1 to Law et al. (hereinafter “Law”). Law teaches:
storing a state transition table for the DFA in a computer-based storage resource, wherein the state transition table provides the possible states, actions, conditions and trigger events for the DFA; and (paras 4-5, 37-38)
of the DFA (paras 4-5, 37-38)
"Blockchain and Bitcoin" to Liu Qi's Blog (hereinafter “Qi”). Qi teaches:
using at least one computing agent arranged to generate and/or execute at least one program that is arranged to: associate a portion of data in an unspent transaction output of a blockchain transaction (Tx1) with a first state of the state transition table …; and (Section 2: Bitcoin As A State Transition System)
Therefore, the prior art does not teach, neither singly nor in combination the following:
use a portion of code to implement or represent at least one state transition trigger event which, when executed by the at least one computing agent, causes a further blockchain transaction (Tx2) to be sent to the blockchain to spend the unspent transaction output of the blockchain transaction (Tx1) and move the DFA to a further state.
Conclusion
The following prior art made of record and not relied upon is considered pertinent to applicant's disclosure.
US 11,170,371 B2 to Karame et al. discloses: The valid state transition rules are provided as a finite state machine of that defines a lifecycle of the new product, and wherein the finite state machine is embedded in the blockchain (Claim 5).
US 2016/0109870 A1 to Firu et al. discloses: The sequential logic circuitry may be formed on one or more of the processing cores and may be used for performing desired logical operations associated with solving the cryptographic puzzle (e.g., the two logical states of the finite state machine may be used in solving the cryptographic puzzle). The control circuitry may control the processing cores to generate a crypto-currency by solving the cryptographic puzzle by performing Simple Hash Algorithm 265 (SHA-256) hashing operations (e.g., to generate a Bitcoin crypto-currency) (para 14).
Any inquiry concerning this communication or earlier communications from the examiner should be directed to Ari Shahabi whose telephone number is (571)272-2565. The examiner can normally be reached M-F: 8:00-5:00.
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.
/ARI SHAHABI/Primary Examiner, Art Unit 3697