IP Library › Granted Patent US 12,731,149
Granted Patent B2
US 12,731,149 · App. 18/441,723 · Granted Sep 8, 2026

Systems and methods for state machine driven programmable payments

Inventors: Shekhar Gahlot (Singapore, SG); Naveen Mallela (Singapore, SG); Umar Farooq (New York, NY); Sai Murali Krishna Valiveti (Singapore, SG); Muh Hwa Lee (Singapore, SG); Wee Kee Toh (Long Island City, NY); Daniel Chew (Singapore, SG); Slim Yee Ng (Singapore, SG); Raunak Rajpuria (Singapore, SG)
Assignee: JPMORGAN CHASE BANK, N.A.
G06Q20/405
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,731,149
App. No.
18/441,723
Granted
Sep 8, 2026
Kind
B2
Abstract

Systems and methods for state machine driven programmable payments are disclosed. A method may include: defining a plurality of base state machines; storing definitions for the plurality of base state machines; receiving, via a user interface, a programmable payment instruction (“PPI”) from a user comprising a PPI definition of a PPI trigger, a PPI condition, and a PPI action; dynamically linking a state in one of the plurality of base state machines to the PPI definition; storing the PPI definitions; receiving a payment instruction; identifying, from the payment instruction, a base state machine and the PPI instruction linked to the payment instruction; creating a PPI-specific state machine definition for the PPI instruction linked to the payment instruction; and instantiating a PPI-specific state machine for the PPI-specific state machine definitions. The PPI-specific state machine calls one of the plurality of base state machines to execute portions of the payment instruction.

Claims (32)

1 . A method, comprising:

defining, by a computer program executed by an electronic device, a plurality of base state machines;

storing, by the computer program, definitions for the plurality of base state machines wherein the definitions for the plurality of base state machines comprise a deposit state machine, a withdraw state machine, and a transfer state machine;

receiving, by the computer program and via a user interface, a programmable payment instruction (“PPI”) from a user comprising a PPI definition for each of a PPI trigger, a PPI condition, and a PPI action;

dynamically linking, by the computer program, a state in one of the plurality of base state machines to one or more of the PPI definitions;

storing, by the computer program, the PPI definitions;

receiving, by a payment processor computer program, a payment instruction;

identifying, by the payment processor computer program and from the payment instruction, a plurality of base state machines and the PPI linked to the payment instruction, wherein the plurality of base state machines comprise at least one off-chain state machine for an off-chain interaction associated with the PPI and at least one on-chain state machine based for an on-chain interaction associated with the PPI and wherein identifying the plurality of base state machines is performed based on an amount of off-chain interaction and an amount of on-chain interaction associated with the PPI;

detecting, by the payment processor computer program, an event associated with the payment instruction before instantiating the PPI-specific state machine through the event being consumed by an on-chain application or an off-chain application;

creating, by the payment processor computer program, a PPI-specific state machine definition for the PPI linked to the payment instruction; and

instantiating, by the payment processor computer program, a PPI-specific state machine for the PPI-specific state machine definitions, wherein the PPI-specific state machine is configured to call the plurality of base state machines to execute portions of the payment instruction and wherein state transitions of the PPI-specific state machine emit events that are consumed by an on-chain application or an off-chain application to validate programmability conditions and execute actions.

2 . The method of claim 1 , wherein the plurality of state machines are stored in an on-chain environment.

3 . The method of claim 1 , wherein the plurality of state machines are stored in an off-chain environment.

4 . The method of claim 1 , wherein the definitions for the plurality of base state machines comprise base state machine triggers, base state machine conditions, and base state machine actions.

5 . The method of claim 4 , wherein the state machine triggers are event-based or time-based.

6 . The method of claim 1 , wherein the user interface comprises an ‘if this then that” interface.

7 . A non-transitory computer readable storage medium, including instructions stored thereon, which when read and executed by one or more computer processors, cause the one or more computer processors to perform steps comprising:

defining a plurality of base state machines;

storing definitions for the plurality of base state machines wherein the definitions for the plurality of base state machines comprise a deposit state machine, a withdraw state machine, and a transfer state machine;

receiving, via a user interface, a programmable payment instruction (“PPI”) from a user comprising a PPI definition for each of a PPI trigger, a PPI condition, and a PPI action;

dynamically linking a state in one of the plurality of base state machines to one or more of the PPI definitions;

storing the PPI definitions;

receiving a payment instruction;

identifying, from the payment instruction, a plurality of base state machines and the PPI linked to the payment instruction, wherein the plurality of base state machines comprise at least one off-chain state machine based on an amount of off-chain interaction associated with the PPI and at least one on-chain state machine based on an amount of on-chain interaction associated with the PPI and wherein identifying the plurality of base state machines is performed based on an amount of off-chain interaction and an amount of on-chain interaction associated with the PPI;

detecting, by the payment processor computer program, an event associated with the payment instruction before instantiating the PPI-specific state machine through the event being consumed by an on-chain application or an off-chain application;

creating a PPI-specific state machine definition for the PPI linked to the payment instruction;

instantiating a PPI-specific state machine for the PPI-specific state machine definitions; and

calling the plurality of base state machines to execute portions of the payment instruction and wherein state transitions of the PPI-specific state machine emit events that are consumed by an on-chain application or an off-chain application to validate programmability conditions and execute actions.

8 . The non-transitory computer readable storage medium of claim 7 , wherein the plurality of state machines are stored on-chain.

9 . The non-transitory computer readable storage medium of claim 7 , wherein the plurality of state machines are stored off-chain.

10 . The non-transitory computer readable storage medium of claim 7 , wherein the definitions for the plurality of base state machines comprise base state machine triggers, base state machine conditions, and base state machine actions.

11 . The non-transitory computer readable storage medium of claim 7 , wherein the user interface comprises an ‘if this then that” interface.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 11, 2026
From: GAHLOT, SHEKHAR; MALLELA, NAVEEN; FAROOQ, UMAR; VALIVETI, SAI MURALI MURALI KRISHNA; LEE, MUH HWA; TOH, WEE KEE; CHEW, DANIEL; NG, SIM YEE; RAJPURIA, RAUNAK
To: JPMORGAN CHASE BANK, N.A.
Reel/Frame 074619/0876 →
Continuity (1)
Related Publication 20250259181A1 · Aug 14, 2025
References Cited (18)
US 12062037B1 · Coventry · 2024 [cited by examiner]
US 20180032980A1 · Rodriguez · 2018 [cited by examiner]
US 20180089758A1 · Stradling et al. · 2018 [cited by applicant]
US 20180365201A1 · Hunn et al. · 2018 [cited by applicant]
US 20190370799A1 · Vivas et al. · 2019 [cited by applicant]
US 20220067831A1 · Shu et al. · 2022 [cited by applicant]
US 20220188781A1 · El-Bizri · 2022 [cited by applicant]
US 20230061813A1 · Dapeng et al. · 2023 [cited by applicant]
US 20230136805A1 · Morais · 2023 [cited by applicant]
US 20230214832A1 · Hu et al. · 2023 [cited by applicant]
US 20250156784A1 · Thiemann · 2025 [cited by examiner]
CN 117455474A · 2024 [cited by examiner]
WO WO2019246565A1 · 2019 [cited by examiner]
WO WO2024052053A1 · 2024 [cited by examiner]
Author unknown, What is a State Machine, retrieved from https://web.archive.org/web/20230602152242/https://statecharts.dev/what-is-a-state-machine.html (Year: 2023). [cited by examiner]
International Search Report and Written Opinion of the International Searching Authority, dated May 13, 2025, from corresponding International Application No. PCT/US2025/015596. [cited by applicant]
He, Yongchang; “Blockchain-based access and usage control of cloud-based digital twins”, Nov. 1, 2023 (Nov. 1, 2023). [cited by applicant]
Casas, Ana Margarita Serrano, et al.; “Smart contract generation tool”, Jul. 1, 2023 (Jul. 1, 2023). [cited by applicant]