# US 10,373,253 B2 · Systems and methods of creating order lifecycles via daisy chain linkage > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 10,373,253 B2 - Document ID: US10373253B2 - Status: Granted - Kind: B2 - Application number: 16/146,643 - Filed: 2018-09-28 - Published: 2019-01-31 - Granted: 2019-08-06 - Earliest claimed: 2015-08-04 - Assignees: Fidelity National Information Services, Inc. - Applicants: Fidelity National Information Services, Inc. - Inventors: Neil Palmer; Michael Sherman - Web page: https://patentgrep.com/patent/US10373253B2 ## CPC - G06Q 40/04: Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange - G06F 16/2365: {Ensuring data consistency and integrity} - G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## Abstract Systems, devices, and methods for linking orders to develop a consolidated audit trail (CAT) are configured to receive event data for one or more orders based on one or more order characteristics; determine linkages between the one or more orders based on parent relationships of the one or more orders; verify the linkages between the one or more orders based on the event data; and determine order lifecycles based on the linkages between the one or more orders. ## Claims ### Claim 1 A computer system, comprising: a non-transitory memory; and one or more hardware processors coupled to the non-transitory memory that execute instructions to perform operations comprising: accessing event data for a plurality of orders; determining one or more groups of orders in the plurality of orders having a relationship; recording, for each order in each one of the groups of orders, a respective linkage between a first order and a second orders; verifying the respective linkages between the orders based on the event data; identifying, based on one or more of the respective linkages, at least one order lifecycle, wherein each order in the at least one order lifecycle is uniquely identified by a respective row key comprising a consolidated audit trail identifier; and outputting a reporting presentation comprising the at least one order lifecycle. ### Claim 2 (depends on 1) The computer system according to claim 1, wherein the one or more groups of orders comprise one or more pairs of related orders. ### Claim 3 (depends on 2) The computer system according to claim 2, wherein the verifying of the respective linkages comprises validating hierarchical logic between the one or more pairs of related orders. ### Claim 4 (depends on 3) The computer system according to claim 3, wherein a first order and a second order in one of the one or more pairs of related orders have a respective parent-child relationship. ### Claim 5 (depends on 4) The computer system according to claim 4, wherein the validating of the hierarchical logic comprises verifying correspondence between a parent property of the respective parent order and a child property of the respective child order. ### Claim 6 (depends on 5) The computer system according to claim 5, wherein the parent property comprises at least one of a new order or an existing order, and the child property comprises at least one of an existing order or a fill order. ### Claim 7 (depends on 2) The computer system according to claim 2, wherein the verifying of the respective linkages comprises validating completeness of information of each order in the one or more pairs of related orders. ### Claim 8 (depends on 2) The computer system according to claim 2, wherein the verifying of the linkages comprises validating hierarchical logic between the one or more pairs of related orders and completeness of information of each order in the one or more pairs of related orders. ### Claim 9 (depends on 2) The computer system according to claim 2, wherein the verifying of the respective linkages comprises detecting at least one linkage error associated with one or more of the respective orders. ### Claim 10 (depends on 9) The computer system according to claim 9, wherein the detecting of the at least one linkage error comprises detecting an order comprising a new order property that is a child of at least one parent order. ### Claim 11 (depends on 9) The computer system according to claim 9, wherein the detecting of the at least one linkage error comprises detecting an order comprising a fill order property that is a parent of at least one child order. ### Claim 12 (depends on 2) The computer system according to claim 2, wherein the identifying of the at least one order lifecycle comprises performing a graph walk starting from one of the orders having a new order property. ### Claim 13 (depends on 2) The computer system according to claim 2, wherein the identifying of the at least one order lifecycle comprises performing a graph walk starting from one of the orders having a filled order property. ### Claim 14 (depends on 2) The computer system according to claim 2, wherein the identifying comprises performing one or more recursive operations based on a plurality of the linkages. ### Claim 15 (depends on 1) The computer system according to claim 1, wherein the unique identifier further comprises an order identifier. ### Claim 16 (depends on 1) The computer system according to claim 1, wherein the event data comprises a plurality of elements comprising at least one of a symbol, a price, or a quantity of shares. ### Claim 17 A computer-implemented method, comprising: accessing, by one or more hardware processors, event data for a plurality of orders; determining, by one or more of the hardware processors, one or more groups of orders in the plurality of orders having a relationship; recording, by one or more of the hardware processors, for each order in each one of the groups of orders, a respective linkage between a first order and a second order; verifying, by one or more of the hardware processors, the respective linkages between the orders based on the event data; identifying, by one or more of the hardware processors, based on one or more of the respective linkages, at least one order lifecycle comprising a plurality of orders each being uniquely identified by a respective row key comprising a consolidated audit trail identifier; and providing, by one or more of the hardware processors, an alert comprising the at least one order lifecycle. ### Claim 18 (depends on 17) The computer-implemented method of claim 17, wherein the one or more groups of orders comprise one or more pairs of related orders. ### Claim 19 (depends on 18) The computer-implemented method of claim 18, wherein the verifying of the respective linkages comprises detecting at least one linkage error associated with one or more of the respective orders. ### Claim 20 A non-transitory computer-readable medium comprising computer-readable instructions, which when executed by one or more processing devices cause the one or more processing devices to perform operations, comprising: accessing event data for a plurality of orders; determining one or more orders in the plurality of orders having a relationship; verifying respective linkages between the orders based on the event data; identifying, based on one or more of the respective linkages, at least one order lifecycle, wherein each order in the at least one order lifecycle is uniquely identified by a respective row key comprising a consolidated audit trail identifier; and generating reporting data comprising the at least one order lifecycle.