US 12,437,276 B2
Systems and methods for distributed electronic payment processing using hierarchical payment graph
Raymond Ng, Palo Alto, CA (US)
Assigned to WePay, Inc., Redwood City, CA (US)
Filed by WePay, Inc., Redwood City, CA (US)
Filed on Apr. 25, 2023, as Appl. No. 18/306,362.
Application 18/306,362 is a continuation of application No. 15/745,680, granted, now 11,720,865, previously published as PCT/US2018/013649, filed on Jan. 12, 2018.
Claims priority of provisional application 62/510,212, filed on May 23, 2017.
Prior Publication US 2023/0259903 A1, Aug. 17, 2023
This patent is subject to a terminal disclaimer.
Int. Cl. G06Q 20/08 (2012.01); G06F 16/901 (2019.01)
CPC G06Q 20/085 (2013.01) [G06F 16/9024 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A system to support distributed electronic payment processing, comprising:
a first memory storing instructions and a first processor configured to read the instructions to:
receive a request to process an electronic payment;
traverse a main payment graph of hierarchical payment graph, wherein the hierarchical payment graph is selected based on the electronic payment and comprises one or more payment sub-graphs, and wherein traversal of the main payment graph processes the electronic payment through a plurality of stages in a payment processing lifecycle;
provide one of the one or more payment sub-graphs associated with one of the plurality of stages in the payment processing lifecycle to a corresponding one of a plurality of electronic payment processing engines, wherein each of the plurality of electronic payment processing engines is configured to process the electronic payment at a stage of the payment processing lifecycle based on types of states, edges, and attributes of the edges in the one of the one or more payment sub-graphs of the hierarchical payment graph, wherein the first processor and the plurality of electronic payment processing engines are communicatively coupled via communication points,
wherein the main payment graph and the one or more payment sub-graphs define inter-graph communication and handoff rules modeled using an extended graph definition language to coordinate processing between the first processor and the plurality of electronic payment processing engines, including notification from a sub-graph engine to the main graph engine of a payment processing result or failure condition; and
store, in a payment graph datastore, updated states and state transitions of at least one of the main payment graph or the one or more payment sub-graphs, wherein the updated states and state transitions allow processing of the electronic payment to restart at any node in the hierarchical payment graph,
wherein the payment graph datastore is continuously updated in real time, thereby enabling recovery and audit trail generation, and
wherein the main payment graph and the one or more payment sub-graphs define error handling and recovery strategies for managing failures encountered during traversal of the hierarchical payment graph.