US 12,293,419 B2
Connected accounting system and user interfaces
Benson Wen, San Francisco, CA (US); and Peter Wen, San Francisco, CA (US)
Assigned to Tallyfor, Inc., San Francisco, CA (US)
Filed by Tallyfor, Inc., San Francisco, CA (US)
Filed on Jul. 22, 2022, as Appl. No. 17/871,466.
Claims priority of provisional application 63/225,113, filed on Jul. 23, 2021.
Prior Publication US 2023/0022438 A1, Jan. 26, 2023
Int. Cl. G06Q 40/12 (2023.01); G06F 16/22 (2019.01); G06F 16/28 (2019.01)
CPC G06Q 40/12 (2013.12) [G06F 16/2246 (2019.01); G06F 16/282 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A computer-implemented method comprising:
determining, using one or more processors, a set of accounting data structure (ADS) chains including a first ADS chain, a second ADS chain, a third ADS chain, and a fourth ADS chain,
wherein each ADS chain is associated with an entity;
wherein an operational data structure (ODS) instance represents an operation that alters an existing ADS, thereby generating an updated ADS representing an updated account structure;
wherein each ADS chain includes an initial ADS representing a tree-based account structure customized to the entity and associated data at a first time and a repeating pattern of:
ODS that modifies that existing ADS into a resulting, modified ADS and
resulting, modified ADS, where the pattern is repeated one or more times; and
wherein each ADS chain represents a traversable, evolutionary chain of modifications and resulting ADSes associated with the entity across time;
determining, using the one or more processors, a first connection data structure (CDS), the first CDS comprising a first set of ODS instances shared across a first plurality of ADS chains, the first set of ODS instances including:
a first operation data structure (ODS) associated with a first ADS chain and
a second ODS associated with the second ADS chain, wherein the first ODS and second ODS are two ODS instances describing one or more related operations that involve the first ADS chain and the second ADS chain;
determining, using the one or more processors, a second CDS, the second CDS comprising a second set of ODS instances shared across a second plurality of ADS chains, the second set of ODS instances including:
a third ODS associated with a third ADS chain and
a fourth ODS associated with a fourth ADS chain, wherein the third ODS and the fourth ODS are two ODS instances describing one or more related operations that involve the third ADS chain and the fourth ADS chain;
determining, using the one or more processors, a set of mutually exclusive partitions including a first partition and a second partition, wherein the first ADS chain, the second ADS chain, and the first CDS are associated with the first partition, wherein the third ADS chain, the fourth ADS chain, and the second CDS are associated with the second partition, wherein the first partition and second partition are mutually exclusive in that no CDS links an ODS in an ADS chain associated with the first partition to an ODS in an ADS chain associated with the second partition;
assigning, using the one or more processors, the first partition to a first set of computational resources; and
assigning, using the one or more processors, the second partition to a second set of computational resources.