System and method for hierarchical electronic resource management
The hierarchical electronic resource management system addresses the challenges of managing digital currency transactions by using a parent wallet with child wallets and a constraint engine for efficient transaction validation and reconciliation, enhancing digital asset management and reducing complexity.
Patent Information
- Application Number
- PCT/CA2024/050630
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2023-05-09
- Filing Date
- 2024-05-09
- Publication Date
- 2024-11-14
AI Technical Summary
Managing digital currency transactions across multiple electronic devices and users poses challenges due to complexities in replicating physical cash transactions, including segregation, reporting, and reconciliation, especially in digital environments where traditional cash management systems are laborious and logistically complex.
A hierarchical electronic resource management system that utilizes a parent wallet with associated child wallets, a constraint engine for validating transactions, and a network interface for external electronic resource transactions, enabling efficient management and reconciliation of digital assets across a single digital asset wallet.
This system allows for granular reporting, instantaneous receipts reconciliation, liquidity concentration, reduced risk with a single account, and automated signatory authorization, simplifying digital asset management and reducing the complexity of digital transactions compared to physical cash and other electronic payment systems.
Smart Images

Figure CA2024050630_14112024_PF_FP_ABST
Abstract
Description
SYSTEM AND METHOD FOR HIERARCHICAL ELECTRONIC RESOURCE MANAGEMENT Cross-Reference
[0001] This application is a non-provisional of, and claims all benefit, including priority to: United States Patent Application Number 63 / 465,149 filed May 9, 2023, and entitled, SYSTEM AND METHOD FOR HIERARCHICAL ELECTRONIC RESOURCE MANAGEMENT, which is hereby incorporated by reference. Field
[0002] Embodiments of the present disclosure relate generally to the field of electronic or digital asset platforms, and some embodiments particularly relate to systems, methods and devices for a hierarchical electronic resource transaction architecture. Introduction
[0003] As electronic resources replace their physical counterparts, replicating the use of these physical counterparts gives rise to technical challenges. For example, for digital currencies which can involve digital keys and permissions, managing cash transactions for a single entity with multiple electronic devices and / or users can be a challenge. Summary
[0004] In accordance with one aspect, there is provided a system for hierarchical electronic resourcemanagement. The system includes: at least one memory; at least one network interface forcommunicating with an external electronic resource transaction network; and at least one processorconfigured for: providing at least one parent node associated with a parent wallet identifier and atleast one key for authorizing transactions between a parent wallet with the external electronicresource transaction network; upon receiving a first request for executing a first transactiontransferring a first quantity of electronic assets from a first wallet in a hierarchy of wallets associatedwith the parent wallet, validating with a constraint engine whether one or more constraint sets basedon an aggregate quantity of electronic assets associated with the parent wallet, and an allocation ofavailable assets associated with the first wallet are satisfied; and when the one or more constraint setsare satisfied, initiating a data process for executing the first transaction via the external electronicresource transaction network and updating the aggregate quantity of electronic assets associated withthe parent wallet and the allocation of available assets associated with the first wallet.
[0005] In accordance with another aspect, there is provided a method for hierarchical electronic resource management. The method includes: providing, with at least one processor, at least one parent node associated with a parent wallet identifier and at least one key for authorizing transactions between a parent wallet with an external electronic resource transaction network; upon receiving a first request for executing a first transaction transferring a first quantity of electronic assets from a first wallet in a hierarchy of wallets associated with the parent wallet, validating with a constraint engine whether one or more constraint sets based on an aggregate quantity of electronic assets associated with the parent wallet, and an allocation of available assets associated with the first wallet are satisfied; and when the one or more constraint sets are satisfied, initiating a data process for executing the first transaction via the external electronic resource transaction network and updating the aggregate quantity of electronic assets associated with the parent wallet and the allocation of available assets associated with the first wallet.
[0006] In accordance with another aspect, there is provided a non-transitory, computer-readable medium having stored thereon computer-readable instructions which when executed by at least one processor, configure the at least one processor for: providing at least one parent node associated with a parent wallet identifier and at least one key for authorizing transactions between a parent wallet with an external electronic resource transaction network; upon receiving a first request for executing a first transaction transferring a first quantity of electronic assets from a first wallet in a hierarchy of wallets associated with the parent wallet, validating with a constraint engine whether one or more constraint sets based on an aggregate quantity of electronic assets associated with the parent wallet, and an allocation of available assets associated with the first wallet are satisfied; and when the one or more constraint sets are satisfied, initiating a data process for executing the first transaction via the external electronic resource transaction network and updating the aggregate quantity of electronic assets associated with the parent wallet and the allocation of available assets associated with the first wallet. Description of the Figures
[0007] Reference will now be made to the drawings, which show by way of example embodiments of the present disclosure.
[0008] FIG.1 is a schematic diagram showing aspects of an example electronic asset environment and an example system for hierarchical electronic resource management.
[0009] FIG. 2, and FIG.3 is a diagram showing example hierarchies of virtual wallets which may be used by different businesses.
[0010] FIG. 4 and FIG. 5 are diagrams showing example hierarchies for a portion of the nodes for the business represented in FIG.2.
[0011] FIG. 6 is a flowchart showing aspects of an example method for hierarchical electronic resource management.
[0012] FIG.7 is a diagram showing an example state for a hierarchy of digital wallets.
[0013] FIG.8 is a diagram showing an example signatory hierarchy.
[0014] FIG. 9 is a diagram showing an example environment with multiple wallet service providers and external payment networks.
[0015] FIG.10 shows two example flow diagrams.
[0016] FIGS.11 and 12 are diagrams showing example message flows.
[0017] FIG.13 is a diagram showing an example state of a hierarchy of wallets.
[0018] FIG.14 is a diagram showing an example hierarchy of wallets and funding sufficiencies.
[0019] FIG. 15 is a diagram showing an example hierarchy of wallets with an incoming payment transaction.
[0020] FIG.16 is a diagram showing an example hierarchy of wallets with an outgoing payment transaction.
[0021] FIGS.17 and 18 are diagrams showing example constraint definitions.
[0022] FIG.19 is a diagram showing example functions available in some example embodiments.
[0023] FIG.20 is a diagram showing example constraint definitions.
[0024] FIGS. 21, 22, 23, 24, 26, 27, 28, 29 and 30 are diagrams showing example states of hierarchies of wallets in accordance with various example scenarios.
[0025] Fig.31 shows two diagrams of example system states.
[0026] FIGS. 32, 33 and 34 are diagrams showing example states of hierarchies of wallets in accordance with various example scenarios.
[0027] FIG.35 is a schematic diagram showing aspects of an example electronic device. Description of Example Embodiments
[0028] This document describes aspects of computer devices / systems and methods for providing an electronic system for organizing multiple sub-balances and transactional information within a single digital or cryptographic asset wallet, for example, for an enrolled business user of cryptographic / digital currency or other electronic resources. In this documents, aspects of some such methods may be referenced as multi- tiered wallet architecture, “virtual account management” or “VAM”. Through these technical embodiments, in some situations, these aspects may provide for unique functions not available in traditional cash transactions and can address technical challenges which do not exist in physical cash-based systems.
[0029] Example aspects of functional specifications, implementations and the tests by system architects working on the VAM and its dependencies are outlined herein.
[0030] Although not synonymous, references to digital assets, digital assets, digital currencies, cryptographic / digital currencies, digital money and digital currency may be used interchangeably in this document and should be understood to encompass all aspects of each term in their appropriate contexts and application in the described scenarios and embodiments.
[0031] The cash in a business such as a retail merchant is diffused across multiple cashiering points, funneling into central lockboxes, and then transferred to bank branches by cash-in-transit services or dedicated cash operations personnel.
[0032] The cash is then deposited into bank accounts that are managed by discrete parts of the business.
[0033] While laborious and logistically complex to manage, the manual nature of cash operations is well suited to the segregation and reporting of cash for specific operating areas of the business. Especially when a business may have separate departments and lines of accountability, it is convenient that the cash sitting in tills and lockboxes are linked directly to the operations of that department. Receipts can be correlated with the cash in hand using simple daily reconciliation counts. Relative performance is easily tracked by looking at the difference between the cash in hand volumes across locations or departments.
[0034] In a digital environment and the single sovereign wallet per company registration model, a business can be configured to receive and spend its digital currency from a single wallet. This flattened view of the business’ overall cash position may be advantageous for the business owner or the finance department.
[0035] Additionally, in contrast with alternative modes of cards-based electronic payments, there is no requirement for a distinction between merchant and business accounts. Where there is no significant time lag between payment authorization and settlement, there is no need for merchant acquirers to advance payments to merchants ahead of settlement between the issuer and acquirer. More practically, for a business that already manages a merchant account for credit card receipts separately from at least one business bank account, the adoption of digital currency and the VAM system does not amplify the complexity of doing business.
[0036] Hence aspects of the described systems and methods can, in some situations, provide advantages compared to both physical cash settlement and other modes of electronic payments.
[0037] However, each business owner seeking to conduct simple processes like reconciliation and performance measurement (for forecasting and optimisation) has to invest in separate electronic systems that correlate digital asset transaction records to every payment received and payment made.
[0038] In some embodiments, business systems have to store a reference to the underlying economic transaction, the digital asset transaction reference identifier, and relevant meta-data allowing them to identify the point-of-sales location. In some situations, business intelligence tools can be utilized to slice and dice transaction records. The complexity and expense of re-engineering processes to work with digital transactions is can be a challenge (Meta-data are merchant defined data elements that are echoed in the payment responses. The meta-data elements enable merchants to carry out sophisticated use-cases such as split payments for restaurant meals, pre-authorisation for hospitality, installment payment tracking, shopper recognition and tokenization).
[0039] With reference to FIG. 1, an example electronic resource environment 10 in which a hierarchical electronic resource management system 100 can operate is illustrated. The system 100 can include one or more electronic devices 500.
[0040] In some embodiments, the system 100 includes one or more nodes 150, 150A which can be associated with one or more electronic asset wallets. In some embodiments, a node can be any combination of computer hardware or software which provides a physical or logical network location that can be associated with a user profile and / or electronic wallet. In some embodiments, a node can provide data regarding a user profile and / or electronic wallet. In some embodiments, a node can communicate with other nodes or other system components such as data record stores 102, constraint engines 104. In some embodiments, a node can communicate with nodes, devices, systems and / or networks external to the hierarchical electronic resource management system 100 such as an external transaction network 130 or user device 140. In some embodiments, a node can communicate over one or more networks 170 within the system 100 and / or external to the system.
[0041] For example, in some embodiments, a node can be provided by software executing on a computing device 500 to provide the functions described herein or otherwise. In some instances, a single node can be provided by a single computing device.
[0042] In some instances, multiple nodes can be provided / instantiated on a single computing device. For example, two nodes each associated with a different user profile or wallet can be provided by software on a single computing device.
[0043] In some instances, a node or aspects of a node can be provided by a special purpose device such as a smart card.
[0044] In some embodiments, a node can include computing, communication and / or storage functions as described herein or otherwise. In some embodiments, a node can be associated with one or more user profiles (e.g. cashier A), roles (e.g. cash register X), signatories (manager) and / or electronic asset wallets.
[0045] In some embodiments, the system 100 includes one or more constraint engines 104. In some embodiments, a constraint engine is code executing on one or more computing devices to monitor, process and otherwise manage constraints on electronic asset transactions for the system 100. In some embodiments, the constraint engine can be in communication with one or more nodes via networks 170, busses, software communication channels, sockets, and / or any other communication mechanism through which requests, transaction updates, constraint validation responses and / or any other messages between the constraint engine and the nodes 150. In some embodiments, the constraint engine(s) 104 can be operating on the same or different devices as one or more of the node(s).
[0046] In some embodiments, the system 100 includes one or more storage devices for storing data records 102. The data records can include wallet data, digital asset balances, tokens, cryptographic key, digital assets, allocation data, wallet / user identifiers, permissions lists, and / or any other data for operating the system as described herein or otherwise. In some embodiments, the data records can be stored centrally, in a cloud storage environment, at each node, or in any other suitable arrangement.
[0047] In some embodiments, a node such a node 150A associated with a cashier location or profile can be associated with a point of sale device 120. In some embodiments, a point of sale device can be a device at which a cashier or a customer can utilize to interact with the system. In some embodiments, a point of sale device can be associated and can provide a wallet identifier (such a QR code). In some embodiments, a point of sale device and / or cashier node can include a display or other output device for indicating a status of a transaction (e.g. completed, pending, validated, awaiting authorization, etc).
[0048] In some embodiments, a QR code or other mechanism for communication a wallet identifier can be provided to enable a user device 140 to initiate or otherwise facilitate a transaction.
[0049] In some embodiments, the system 100 which facilitates the hierarchical electronic resource architecture can transact or otherwise communication with one or more external transaction networks to execute electronic asset transactions. For example, in some embodiments, the external transaction network can be a centralized electronic transaction system such as one operated by a central bank, a financial institution, a credit / debit / charge card network, and the like. In some embodiments, the external transaction network can be a distributed / decentralized payment system (e.g. Bitcoin™).
[0050] The networks 170 can include any combination of private and or public communication systems and any suitable communication technology capable of carrying data signals including the Internet, Ethernet, plain old telephone service (POTS) line, public switch telephone network (PSTN), integrated services digital network (ISDN), digital subscriber line (DSL), coaxial cable, fiber optics, satellite, mobile, wireless (e.g. Wi- Fi, WiMAX), SS7 signaling network, fixed line, local area network, wide area network, short range communications, Bluetooth™ and others, including combinations.
[0051] FIG. 35 is a schematic diagram of an example electronic device 500 which, in some embodiments, can be used to provide the nodes 150, constraint engine 140, data storage devices / records, user devices and / or any other aspect of the system 100. As depicted, an example computing device 500 includes at least one processor 502, memory 504, at least one I / O interface 506, and at least one network interface 508.
[0052] Each processor 502 may be, for example, microprocessors or microcontrollers, a digital signal processing (DSP) processor, an integrated circuit, a field programmable gate array (FPGA), a reconfigurable processor, a programmable read-only memory (PROM).
[0053] Memory 504 may include a suitable combination of any type of computer memory and / or storage device that is located either internally or externally such as, for example, random-access memory (RAM), read-only memory (ROM), compact disc read-only memory (CDROM), electro-optical memory, magneto- optical memory, erasable programmable read-only memory (EPROM), and electrically-erasable programmable read-only memory (EEPROM), Ferroelectric RAM (FRAM). In some embodiments, memory can include long term storage device(s) such as hard disc drives, flash drives, solid-state drives, at the like.
[0054] In some embodiments, the electronic device(s) 500 can be structured as individual computing devices, servers and / or as part of a distributed or cloud computing / storage system.
[0055] Each I / O interface 506 enables computing device 500 to interconnect with one or more input devices, such as a keyboard, mouse, camera, touch screen and a microphone, or with one or more output devices such as a display screen and a speaker.
[0056] Each network interface 508 enables computing device 500 to communicate with other components, to exchange data with other components, to access and connect to network resources, to serve applications, and perform other computing applications.
[0057] In an example scenario for the systems and methods described herein, a VAM in the context of the digital asset system provides each business with multiple different unique identifiers that are recognized by the digital asset clearing system to make accounting postings to the business’ single digital asset wallet (or “header wallet”), as well as updating a “virtual wallet” that is assignable to an arbitrarily small part of the business such as a cashiering point. A current balance is maintained for each of these virtual wallets, which corresponds in a retail setting to the “float” in a till or a cash register.
[0058] In some embodiments, the different unique identifiers are associated with different wallets in the hierarchy of wallets corresponding to the parent wallet (may be referenced as a root / central / header wallet).
[0059] These virtual wallet identifiers (VWI) allow businesses to generate reports about the transactions at a granular level as often as they wish for reconciliation by assigning more VWIs as needed. Certain merchant focused wallet providers may offer value-add services that roll up digital asset transaction reports and aggregated data based on the internal hierarchy of the business.
[0060] Transaction visibility can also be managed using VWIs as the merchant focused web Apps and mobile Apps (running on point-of-sales terminals for example) may only access the part of the business’ overall transaction records belonging to the specific VWI.
[0061] In some situations, aspects of the VAM systems and methods can provide one or more technical solutions or benefits:
[0062] i. Reporting. In contrast to traditional digital wallets, in some embodiments, technical implementation of VWIs can provide flexibility to allow the system to configure VWIs to track and report assets at very granular levels at arbitrary levels of an organization or hierarchical structure via the associated concept of a virtual wallet (VW). Due to the relationship between the VWI and VW, these terms and acronyms may be used interchangeably herein.
[0063] For example, one merchant may have multiple regions across a jurisdiction, with stores in the same region rolling up into intermediate administrative units before rolling up into an overall financial statement at the HQ which can be queried via the header wallet. VWIs can be allocated to the individual regional stores, with another VWI for each region as shown in FIG 2.
[0064] A different business, perhaps a caterer as illustrated in FIG. 3 may choose to map the VWIs to specific customer segments such as cruise ships and hotels. This business’ chart of wallets may be organized as shown below. Note that in this case, the VWI #920 has more in its aggregated balance than the aggregated balances beneath it in the chart of wallets. The difference is the spec balance or “float” for VWI #920’s managers. Likewise, Catering HQ has an aggregated balance of $1m more than the sum of balances in its two customer segments. In this example, the system can be configured to enable a manager of the VWI for Freeport may spend up to $75,000 that is under its control only.
[0065] A third business may be less concerned with receipts or receivables and more with differentiation between expense types. In this case, instead of maintaining multiple digital asset wallets to pay out salaries, fees, and supplier payments, the system can be configured to keep a VW hierarchy that corresponds to these cost centers. The system can be configured to enable a treasurer of the business to determine the amount of funding each cost center would have based on cash flow projections. The benefit of using such a system is that unexpected payments and other variances are readily apparent.
[0066] ii. Receipts reconciliation is instantaneous. The cash position in the VW balance should always correspond to the net effect of the transactions posted to that VWI. In contrast to the slow and manual process of cash reconciliation, in some embodiments, the system can enable a business to have a live view at all times of the state of the individual VW balances as if they were separate digital asset wallets. The system can be configured to enable a business owner to search for transactions linked to a specific VWI. This convenience contrasts with the alternative where the business would calculate the financial status of their individual administrative units using a complex reconciliation process prone to failure because of mistakes in meta-data like reference codes.
[0067] iii. Liquidity concentration. As a major improvement on physical cash, the digital asset system and the VAM overlay allows the consolidation of cash into a single digital asset wallet without complex cash operations. Businesses no longer need to collect cash from cashiers and funnel that cash into a bank. In some embodiments, the system can be configured to enable a centralized treasury for the business to set a certain level of funds availability for each VWI. In some embodiments, this can be accomplished by receiving instructions to reset all VWI balances at the same time daily as long as the overall cash balance is adequate. No actual digital asset has to move through the clearing system which both can reduce cost and can simultaneously avoid loading the digital asset clearing system with liquidity transfer transactions such as sweeps.
[0068] iv. Single account poses less risk. The VAM model removes the need for a business to maintain multiple different digital asset wallets, which improves controls and risk management. Businesses may even move towards a centralized procurement process wherein the departments act as “makers” of payments to suppliers, and the HQ act as the “checkers” to authorize payments out of the business digital asset wallet.
[0069] Outgoing payments authorisation. In some embodiments, digital asset system’s transaction multi- signatory authorisation mechanisms are configured to enable hierarchical sets of signatories. For example, in one scenario, a particular wallet may require two signatures to authorize a transaction, but can, in some embodiments, also enable transactions by a header wallet.
[0070] With reference to the FIG.4, since VWI #19 is a virtual wallet, even if the correct endorsements are obtained from the department signatories on Great Abaco, funds will not move from the digital asset wallet #14 which is the header wallet as the HQ signatories are the only ones authorized to send funds from that wallet.
[0071] In some embodiments, an automated signatory is embedded into the signatories for the header wallet such that this automated signatory acts as a second signer only if VAM business rules are met as shown in FIG.5. Digital signatures of the actual VWI’s signatories are stored as part of the witness proof ensuring that the VAM has a non-repudiable record of the originating instruction from the merchant’s authorised controllers.
[0072] With reference to FIG. 6, aspects of an example method for hierarchical electronic resource management will be described.
[0073] At 610, if not already established, one or more processors in the system instantiate or otherwise execute code to provide at least one parent node. In some embodiments, the parent node is communicably connected to one or more external transaction networks through which electronic transactions are executed. In some embodiments, the parent node is associated with a parent wallet identifier. In some embodiments, parent wallet identifier can be a handle, unique address or other unique identifier used by the external transaction networks to route to or otherwise identify the wallet involved in a transaction.
[0074] In some embodiments, the parent node and / or wallet can include or have access to at least one key for authorizing transactions between the parent wallet and the external electronic resource transaction network. For example, in some embodiments, the key can be a cryptographic key (such as a private key) which can be used to confirm a transaction based on a corresponding public key. In some embodiments, a key can be a credential or other secret or specialized value for authenticating or establishing a secure communication channel with the external transaction network.
[0075] In some embodiments, a wallet can be associated with a node when the node is identified by the external transaction network as the destination associated with the parent wallet identifier. In some embodiments, the wallet can be associated when a user logins in or parent wallet credentials are otherwise provided at the node.
[0076] If not already established, one or more processors in the system instantiate or otherwise execute code to provide at least virtual or additional wallet associated with the parent wallet. These wallet(s) can be structured in a hierarchy as illustrated in the figures and examples herein.
[0077] In some embodiments, each wallet in the hierarchy of wallets is associated with a child or virtual wallet identifier. In some embodiments, the virtual wallet identifier is recognized by the external transaction network as being associated with the parent wallet and routes or otherwise communicates transactions addressed to the virtual wallet identifier to the parent wallet.
[0078] In some embodiments, establishing the child wallets can include creating or updating data records 102 which capture the hierarchy of the wallets. These data records can be stored in various formats such as tree data structures, linked lists, or any other data structure which can be traversed to establish hierarchies or relative positions / relationships between wallets.
[0079] In some embodiments, the processors store one or more of hierarchy data, wallet identifiers, permissions lists, signatory lists, and / or any other data for establishing the hierarchy of wallets. In some embodiments, the parent node, upon receipt of a transaction request, utilizes the hierarchy data to identify the child wallet involved in the transaction and the corresponding constraints.
[0080] As described herein, or otherwise, in some embodiments, adding a wallet to the hierarchy of wallets associated with the parent wallet includes creating or updating records which store balances, aggregate balances, asset spend allocations (allowances) for the wallet in the data records.
[0081] At 620, the system receives a request for executing a first transaction requesting to transfer a quantity of electronic assets from a wallet in the hierarchy of wallets associated with the parent wallet. Based on the data in the request such as the wallet identifier associated with the transaction request, the parent node or other recipient component in the system identifies the child wallet associated with the transaction.
[0082] In some embodiments, this may be triggered by a user device associated with an external wallet triggering or requesting a transaction to transfer electronic assets from an internal wallet in the hierarchy of wallets to the external wallet. In some embodiments, the user device may identify the internal wallet with the internal wallet’s unique identifier which may be a QR code displayed at a point of sale device, or otherwise communicated from a point-of-sale device to the user device. In another situation, a user of the user device may simply know or have access to the internal wallet unique identifier. In some environments, a transaction request can be sent from the user device to the external transaction network.
[0083] In other situations, a transaction request to transfer out assets can be initiated at the node associated with a child wallet.
[0084] At 630, the system validates with the constraint engine, whether sets of constraints applicable to the transaction are satisfied. In some embodiments, constraints on a transaction with a particular child wallet can include, for example, one or more of: {child wallet balance > spend transaction quantity} {child wallet allocation of available assets > spend transaction quantity} {child wallet permission threshold < spend transaction quantity -> trigger higher signatory approval process} {global spend limit – global spend > spend transaction quantity}
[0085] In some embodiments, constraints on a transaction may be dependent on the activity and values of other wallets in the hierarchy. Accordingly, in contrast to cash based systems, communication and management of the hierarchical values and activities are required.
[0086] In some embodiments, the constraint engine is configured to validation or otherwise confirm thatwhether one or more constraint sets based on an aggregate quantity of electronic assets associatedwith the parent wallet, and an allocation of available assets associated with the first wallet are satisfied.
[0087] At 640, upon confirming the constraints are satisfied, the system initiates one or more data processes to execute the transaction or conversely to reject the transaction if the constraints are not satisfied. In some embodiments, this includes sending one or more message to the external transaction network such as a message confirming a transaction (and may for example be signed by a private key).
[0088] At 650, the system updates the data records based on the executed transaction. This can include updating the virtual asset balances, spend allocations, aggregate assets, etc. associated with the child wallet, the parent wallet, and / or any other wallet in the hierarchy.
[0089] For example, in some embodiments, the system is configured to update the aggregate quantity ofelectronic assets associated with the parent wallet and the allocation of available assets associatedwith the child wallet.
[0090] In some embodiments, upon receiving, at the at least one parent node, a electronic transaction message indicating that electronic assets have been received via the external electronic resource transaction network and including a recipient identifier corresponding to the first wallet; the system is configured for updating and storing in the at least one memory, the aggregate quantity of electronic assets associated with: the parent wallet, the first wallet, and any wallet in the hierarchy of wallets between the first wallet and the parent wallet.
[0091] In some embodiments, the system is configured to reduce or eliminate unnecessary transactions when updating the wallet values. In some embodiments, the system is configured through recognition that separating out the liquidity allocations from usable balances at each VWI, can filter out some nonsensical transactions. So with respect to the diagram above, the child nodes VWI #21 and VWI #20 can send funds to their parent VWI #19. However, the aggregate balance at VWI #19 has no change. Only its dedicated balance is credited by the amount debited from one of its children’s dedicated balances. Likewise, the VWI #19 can send funds to its parent, the root digital asset wallet #14. However, again, only the dedicated balance of #14 is increased. Its aggregate balance remains the same (there were technically two updates to the Agg Balance that cancel each other out).
[0092] A payment from VWI #20 to the digital asset wallet #14 of $8000 would result in several changes: Agg Balance Balance VWI #20 -8000 -8000 digital asset wallet #14 No change +8000VWI #19 -8000 No change
[0093] The resulting state of the VAM hierarchy is illustrated in FIG.7.
[0094] In some embodiments, the main digital asset system would not record these transactions since no funds move between actual digital asset wallet identifiers. In some embodiments, the VAM system recognizes the necessary changes to the aggregate balances held at each level of the VAM hierarchy resulting from a payment.
[0095] An example algorithm for updating the VAM structure after each transaction is described below.
[0096] Funding and defunding transactions. Business owners often have non-sales related cash movements within their businesses. Even under conditions where the merchant’s projections of daily liquidity needs as expressed by the liquidity allocation maps are accurate, without perfect information about the timing of intraday cash inflows and outflows, a till may still run short of funds.
[0097] The need for these cash movements can arise from a mismatch between the denominations received versus the denominations paid out as change. As an example, the cashiers at retail outlets often run out of small coin and note denominations after making change, whilst accumulating notes of higher denomination. Cash operations managers walking the floor will therefore “pay-in” coins and notes for making change to the tills that run out of them. This operation is often known as a “cash transfer”.
[0098] Sometimes, the manager may also ask the cashier to “pay-out” the high denomination notes in the till so as to move these into the store’s safe deposit boxes. This operation is also known as the “cash pickup” if done regularly at a specific time or a “mid-day deposit” if done during the working day.
[0099] Whereas the scenarios for pay-ins and pay-outs may well be infinite, there are some common threads. First, the source of all pay-ins to a VW are other VWs in the same VAM hierarchy, most likely a parent VW. This corresponds to physical cash management within a store, where the source of funds is always a safe within the same store. The pattern is asymmetric when it comes to pay-outs where recipients of pay- outs can be external wallets as is the case when the payees are customers being refunded for overcharges, employees receiving tips, or a valet service.
[0100] In some embodiments, the system can be configured to provide a cash transaction type whose purpose is to move the float between VWs within the same VAM hierarchy. The net effect of the cash transfer on the Agg Balance of the root digital asset wallet will be zero. In some embodiments, the transaction can be associated with a reason codes field for the cash transfer such as a loan, a drop (an intraday removal of excess funds from the VW for safekeeping purposes ) or a change from an offline transaction. In some embodiments,the a drop transaction may exceed the permitted threshold of the traditional current signatories, so the system can be configured to manage this permission with the header wallet.
[0101] In some situations, the system can receive electronic assets from the external transaction network. In some embodiments, the system upon receiving, at the at least one parent node, a electronic transaction message indicating that electronic assets have been received via the external electronic resource transaction network and including a recipient identifier corresponding to the first wallet. Based on this identifier, the system is configured to update and store in the data records, the aggregate quantity of electronic assets associated with: the parent wallet, the first wallet, and any wallet in the hierarchy of wallets between the first wallet and the parent wallet. In some embodiments, this involves traversing the hierarchy data structure to identify the affected wallets and adjust their allocations accordingly.
[0102] In some embodiments, the constraint engine may include constraints which limit a child wallet from certain transactions unless proper authorizations are obtained.
[0103] FIG.8 shows an example authorization hierarchy 800.
[0104] While multi-signature schemes can be suitable for medium-level business transactions, they might not scale efficiently for larger organizations with complex structures and numerous sub-business models. As such, in some embodiments, a Hierarchical Threshold Signature Scheme (HTSS), is used.
[0105] In some situations, HTSS provides a hierarchical structure that allows for delegation of signing authority across different levels of the organization. This structure delineates authority and responsibility across different tiers. Typically starting with Owners, each level cascades down through management layers. At every tier, designated signers are authorized to approve transactions within specified limits
[0106] As an example, with reference to FIG.8: sig0: as owner who can access to root wallet will have higher level of authority to sign transactions to spend sig1, sig2: higher level managers have some level of authority to sign transactions sig3, sig4, sig5: Employees are able to sign and request for spending approvals from higher level managers.
[0107] In some embodiments, virtual wallets are created and assigned to signatories with role cashiers, managers, owners. Each virtual wallet with virtual allocation with reset configuration, and higher level virtual wallets have allocated balance and aggregated balance together with child virtual wallets. So that higher level virtual wallets are able to spend from aggregated balance that will allow businesses to control the spending with hierarchical approval workflow.
[0108] Incoming fund flow:
[0109] Cashier virtual wallets are receivable points of sales terminals able to generate QR codes that can be acceptable with payment ecosystems with metadata of virtual wallet identifiers that allows MSP service to credit the funds to the particular virtual wallet.
[0110] Example: UserA make payment of $10 to the business POS of vw3 Funds movement in payment ecosystem: Debit payer account (UserA) Credit business account
[0111] In the example, the system can updated values such that the balance of vw3 will be increased Aggregated balance of vw1, root wallet also increased
[0112] Outgoing fund flow:
[0113] Signatory5 with vw5 wants to pay for his / her supplier $500:
[0114] Sig5 initiate payout request with information about payment details
[0115] Request will send to his managers for approvals
[0116] Sig2 should be able to see the request and approve as the request is within Level1 approval limit
[0117] Constraint engine business use cases:
[0118] Organization users in hierarchical structure. Constraint engine is to validate hierarchical structure creations along with spending allocations. During this step the system will create virtual wallets for the users and manage their spending and collections.
[0119] Constraint optimization techniques have been applied to each business spend. This may allow organizations to make informed decisions to allocate resources effectively, optimize financial performance, and achieve strategic objectives while staying within budgetary constraints.
[0120] Set of example constraints:
[0121] Define:
[0122] a - user balance
[0123] B - Total Budget
[0124] S(a) - user spendable allocation
[0125] S(B) - total spendable allocation
[0126] ai > = 0 Minimize Spending ^^^^ S(ai) <= B
[0127] j ^^^^ { a1, a2, a3, … an }
[0128] PLIST(payee list) and SLIST(signatory list) validation
[0129] The system can receive input to configure PLIST as payee list for the organization and SLIST for signatories allowed to authorised the spendings. Constraint engine will validate each spending request with PLIST and SLIST constraints.
[0130] In some embodiments, validating at least one of the one or more constraint sets includes: determining that parameters of the first transaction and the first wallet require authorization, traversing a hierarchical signatory data structure to identify at least one signatory node and sending an authorization request message to the at least one signatory node.
[0131] Various functions for updating or otherwise managing the hierarchy of wallets are described.
[0132] Avoiding collisions
[0133] Within the platform, virtual wallets maintain ledger balances. When a user initiates a payout request, the system locks the ledger for modification and earmarks the requested amount from the ledger balance. This process prevents overspending and ensures that the earmarked amount remains reserved for the specific payout request.
[0134] Now, if multiple payout requests occur simultaneously, the system tries to acquire the lock of the virtual wallet’s ledger record. This means that only one payout request can successfully execute at a time. The system locks the resource to process the payout, while other requests must wait until the resources are released before they can proceed. This ensures overspending funds from the same wallet.
[0135] In some embodiments, upon receiving the first request for executing the first transaction transferring the first quantity of electronic assets from the first wallet, the system locks the parent wallet preventing it from processing additional transaction requests until the first request has been validated and allocations in the hierarchy of wallets have been updated.
[0136] In some embodiments, upon receiving the first request for executing the first transaction transferring the first quantity of electronic assets from the first wallet, the system locks each constraint set which includes wallet parameters which would be affected by the first request such that each locked constraint cannot be satisfied by a subsequent transaction request until unlocked.
[0137] In some embodiments, upon receiving the first request for executing the first transactiontransferring the first quantity of electronic assets from the first wallet, the system adds or modifies alock amount based on the first quantity of electronic assets as part of the one or more constraint sets.
[0138] Transaction reporting. In some embodiments, the digital asset system’s posting module is configured to recognize VWI based transactions. For example, if VWI #21 sends $1000 to an external supplier, a debit can, in some embodiments, be posted to the ledger for VWI #21, but also at VWI #19 and the digital asset wallet #14 to reflect the change. For external transactions, the system propagates the postings affecting a VWI upwards along the branch that the VWI sits on, until the root or header wallet is updated.
[0139] For internal transactions such as rebalance of funds between VWIs under the same header wallet, the system can be configured to reduce the impact of postings so that they ends below the lowest common ancestor VWI. For instance, VWI #21 moves $2000 to VWI #20. The postings are only created for VWI #21 and VWI #20 but VWI #19, their common ancestor in the tree, is unaffected.
[0140] Multiple Transaction Networks. In some embodiments, the system can enable the reduction of wallet transaction and / or reconciliation when multiple transaction networks are utilized by the system.
[0141] Unlike retail digital asset wallets which have only one wallet provider, businesses may wish to work with multiple WSPs (wallet service providers) at the same time (for example, if these WSPs offer competing and differentiated services under their acquiring contracts).
[0142] For instance, in FIG. 9, the merchant has signed up with two different WSPs offering access to distinct sets of payment rails. Both WSPs offer access to the digital asset system on their acceptance terminals (indicated by the dotted red lines).
[0143] For the merchant, the overlapping digital asset access reduces its risk from problems that can interrupt the services of either WSP. If the cashier finds one terminal to be unresponsive, they do not have to resort to taking in cash only. The cashiers now have the alternative WSP’s terminal that still accepts the digital asset.
[0144] In such cases, without a VAM system, the merchant may end up holding two separate digital asset wallets, each tied to the WSPs they are signed up with. In some embodiments, the system may allow these separate wallets to be readily reconciled.
[0145] The disadvantage of the two digital asset wallet model for the merchant is the fragmentation of liquidity with money now split across two pools. If funds from the two wallets are used for making payments and not just receipts, then the merchant has to implement processes to handle topping up of the wallets based on projected outflows and a thinner buffer of money in each wallet. In some embodiments, a hierarchical wallet model can reduce unnecessary computational transactions / steps and / or simplify the outflow / asset management processes.
[0146] A VAM system is configured to include a combination of services exposed by the WSPs to their customers. In some embodiments, the system can be configured to enable a subset of the services to a WSP or other user / entity.
[0147] Virtual structure maintenance services (VMS)
[0148] The digital asset system is configured to provide interfaces, which may be collectively referenced as the VMS, which can enable the creation of different configurations of hierarchical networks of virtual wallet identifiers (VWI). For example, these can include functions to register a new VWI under a merchant’s digital asset wallet identifier, and to define the associated VW’s parent account which can be another VW, or the digital asset wallet itself.
[0149] In some embodiments, the VMS is configured to enable updates to the description of a VWI. In some embodiments, VWs can be configured / defined to include one or more of the following attributes: ● Parent: the VWI of the parent of this VW. In some embodiments, the system can ensure / enforce that the parent has to have at least as much money allocated to it as the summation of all the funds held by its children. ● WSP: the WSP on record for all transactions that deposit funds into the VWI. This is also the WSP that can access the records of such covered transactions besides the customer and the WSP of the digital asset wallet. ● Point-of-sale tag: A binary value, true if the VW is tagged to a point-of-sale terminal specifically, false otherwise. ● Merchant category code: Such as those used by Payment brands to classify merchants and businesses by the type of goods or services provided. The MCCs can be used to categorize, track and restrict transactions. ● PLIST: An (optionally ordered) list of wallet identifiers (both virtual and “real”) that can be referenced by a constraint set.● SLIST: A list of signatory identifiers that can be referenced by a constraint set. ● Parent-signatories: this is a flag which specifies if the signatories of the parent VWI are authorised to issue transactions on this VWI. If the flag is true, a qualifying quorum of signers on the parents would be able to sign on valid transactions. This feature is useful for cases where the company may assign only a single signatory on a VWI who loses their access rights for any reason. The parent signatories can still transact on the VW. This is also useful for the constraint sets that can be defined over the parents of a VWI. ● Constraints: declarative constraints on the VWI. These are binary logical statements that can, in some embodiments, all resolve to be “true” when evaluated for a requested action to be executed on the VWI. ● Depth: An integer that reflects how far this VWI is from the root node. For example, a depth of 1 would be the direct children of the root digital asset wallet. A depth of 2 would be 2 steps from the root digital asset wallet. ● On-Shift flag: a binary value that is relevant only when the point-of-sale tag is set to “TRUE”. If the on-shift flag is “TRUE”, the VW is enabled for receiving and sending payment transactions as well as cash transfers. If the on-shift flag is “FALSE”, all transactions are blocked except for the liquidity allocation reset. In a retail context, every time the manager reassigns a VW to a new cashier, the “on-shift” flag can, in some embodiments, flip from “TRUE” to “FALSE” and then to “TRUE” again even if the time period between the shifts is effectively zero. ● On-shift flag change timestamps: a list of date and time stamps which is appended to each time the “on-shift” flag flips. The interpretation of the list items is given by the table below. List index last item on list (0) -1 -2 Interpretation Opening time of this Closing time of Opening time of (if “on-shift flag” is shift previous shift previous shift TRUE) Interpretation Closing time of Opening time of Closing time 2 shifts (if “on-shift flag” is previous shift previous shift ago FALSE) SLIST
[0150] The SLIST is consulted by the VAM in determining if the signers for a transaction are valid. The SLIST holds a key-value record where the keys are the VWI and the values are the valid signatories for that VW.
[0151] Additional structural constraints on the VW in terms of the number of signatories and the presence of some important signatory are expressed in the constraints for the VW. Shift assigned signatory model
[0152] The SLIST may be updated relatively frequently depending on the business owner’s focus. In a retail environment, cashiers may be assigned to a VW at the start of each shift, and removed at the end of each shift as depicted in the flow diagrams 1000, 1010 in FIG.10. In this case, the business owner has decided to create a set of VWs for a store that are constant, and to assign cashiers flexibly across the VWs on different shifts or days. The VAM App will change the “on-shift flag” to TRUE when the VW is assigned to a cashier in this model, and change it back to FALSE when the VW is “returned” to the control of the store manager. Persistent VW to single cashier model
[0153] Alternatively, the business owner may simply create a single VW per cashier. In this scenario, even if the liquidity allocation is reset to a $0 base at the end of each shift, the business owner can, in some embodiments, have additional measures in place to prevent the cashier from collecting payments off-shift and potentially spending the funds inappropriately. The safest means to do this would be to disable the VWs of all cashiers that are off-shift, and to enable them only when they are on-shift using the “on-shift flag”. The VAM App in this case can, in some embodiments, set the “on-shift flag” to FALSE even though the cashier is not removed from the signatories list.
[0154] The SLIST for the single cashier VW would have at least the signatory identification for the cashier, and potentially either one more signatory for the manager or no other signatory. When the cashier is off- boarded upon resignation or termination, the VW is likely to be removed, and the funds inside will automatically remap to the parent VWs. Liquidity definition maps (LQ-Map)
[0155] Liquidity allocations are a means for management of a business to define their desired level of liquidity and hence risk exposure at each level of their hierarchy of accounts. One can view the LQ-Map as a statement of a desired starting position for each VW’s current balance before the impact of incoming and outgoing payments. A business would “set” their liquidity allocations according to projections, and “maintain” the current balances to meet their target.
[0156] In some embodiments, the system is configured to manage / facilitate liquidity maps and / or allocations between VMs. In some embodiments, there is exactly one and only one LQ-Map per VAM structure, attached to the root digital asset wallet.
[0157] Conceptually, liquidity allocations have to be internally consistent and feasible. ● An internally consistent liquidity allocation enforces the parent-child structure of a VAM hierarchy. This means that the liquidity allocated to the parent can, in some embodiments, alwaysbe larger than or equal to the liquidity allocated to the sum across its children (and transitively all descendents). The design of the VAM system can, in some embodiments, seek to maintain internal consistency at all times by rejecting attempts to record an inconsistent plan. ● A feasible liquidity allocation is one where the actual balance of the root digital asset wallet for the VAM structure holds enough funds at each starting point to implement the plan. As an example, for a business that resets its balances at midnight daily, if the liquidity allocation requires $10,000 for the root digital asset wallet (which would be the summation of the minimum balance dedicated to the root digital asset wallet, and all balances for its descendents), the current balance just prior to the reset process can, in some embodiments, be equal to or exceed $10,000. It is possible for the current balances to fall below the feasible point if there are misprojections in net funding, or timing issues with some payments. It is therefore important for the managers of the accounts to monitor the deviations of cash flows from their projections and to maintain a sufficient balance for plans to remain feasible.
[0158] The LQ-Map is the means for allocating slivers of the overall liquidity in a VW to its children. The LQ-Map is a key-value record where the key is the VW, and the values are a list of pairs of the form <<child- VW, balance allocation>>. The LQ-Maps are modifiable to reflect the changing needs of a business or changes to cash flow projections. It may even be necessary to adjust an LQ-Map regularly due to seasonal changes.
[0159] Liquidity movements from a child VW to another child VW sharing the same parent is accomplished by editing the balance allocation in the LQ-Map for the parent VW. In FIG.11, we visualize this process as two discrete messages. First, child VW 1 is transferring its allocation to child VW 2. This would appear as a debit of VW 1’s allocation and a credit of VW 2’s allocation. However, there is simultaneously a request made to change the LQ-Map allocations for the parent VW which is what keeps the overall structure consistent. Note that no funds are being moved either in the VAM system nor on the digital asset system - only allocations have changed. See. FIG.12.
[0160] Liquidity movements between cousin VWIs which share a grandparent but not a parent is accomplished by an extra message to the grandparent. The implementation of this scenario does imply that the VAM searches for the lowest common ancestor in the hierarchy and implements the allocation changes.
[0161] As the allocation changes affect VWs above the technical authority of the managers of the child VWIs, the signatories of those senior VWs would have to authorize the changes. This acts as a control point for businesses. Therefore, in realistic deployments, allocation changes will be pushed down from above by senior managers in consultation with the lower-level VWs rather than pushed upwards. In some embodiments, the system is configured to enforce or restrict allocation rules / changes.
[0162] In some embodiments, the system is configured to perform the transactions atomically (e.g. Transfer request -> debit VWI1 -> debit VWI A -> Change allocation -> credit VWI B -> credit VWI 4). In some embodiments, since liquidity allocation is not strictly the same as a cash / asset transaction, the system may be configured to update values concurrently or in a non-atomic manner. In some instances, this may speed up or otherwise simplify the data processes.
[0163] One way to implement this is to allow the managers of a parent VW to change the allocation of the LQ-Map of all descendants in a single request fulfilling all requirements of the constraints for their VW.
[0164] For a digital asset merchant, a LQ-Map may consist of three levels in the hierarchy. The top level is the root digital asset wallet itself, whose children are store locations. The lowest level of the hierarchy would consist of VWs assigned to individual point-of-sales terminals that are attached to single cash-registers. In many cases, the store VWs would be the only ones given a dedicated balance as the store managers will make payments to suppliers, carry out refunds and returns, as well as make payroll or other miscellaneous payments. The individual point-of-sales VWs would have zero allocations since they act as recipients of money only. FIG.13 shows a hypothetical state based on such a model. End of period liquidity allocation resets & Scheduler
[0165] Liquidity allocations are useful for end-of-period rebalancing of accounts across the organization. Instead of having to implement a complicated sweep process that takes funds from the child nodes to and moves them upwards in the hierarchy until a root is found, the VAM system simply creates a snapshot of the balances at the end-of-period, and resets all VWs except for the root digital asset wallet to that expressed by the LQ-Map.
[0166] Excess liquidity across the structure is simply retained by the root digital asset wallet where the funds can be converted from Digital assets into interest bearing bank deposits. The daily transaction reports for the individual VWIs simply include a final transaction that is marked specifically as the end-of-day reset. In most merchant payment use-cases, the business should end up with excess funds in the root digital asset wallet as they receive payments from customers.
[0167] Another benefit of an end of day liquidity allocation reset is that it implements cash management best practices by starting each period post reset with the same amount of cash in each VW (perhaps corresponding to a till). When used in a retail setting, the reset period may be as short as a shift, whereas a business to business (B2B) company may set the resets to take place once a month, or even quarterly. Regardless of the merchant type, cash balance resets are means to achieve better accountability and improve error traceability.
[0168] If there are liquidity shortages across the whole structure, it implies that the root digital asset wallet has insufficient funds to implement the LQ-Map and it is infeasible. Such situations would occur largelyoutside the normal course of merchant business operations. The VAM can easily detect the liquidity shortage by comparing the aggregate balance in the root digital asset wallet with the LQ-Map’s allocation to that digital asset wallet. If there are insufficient funds, the algorithm should descend one level to the child VWIs of the root digital asset wallet and check for the funding sufficiency of those children. Fully funded children (shown with green checkmarks in FIG. 14) would have their balances reset to the LQ-Maps. Insufficiently funded children would be marked (shown as red crosses in the diagram), and each child’s own descendants are traversed to detect the insufficiencies in the overall liquidity structure.
[0169] Finally, a raw record is generated for the WSP to provide to the merchant user highlighting the VWIs that have insufficient funds, and whose balances are not reset to match their allocations. The information may be transmitted to the merchant for action to be taken in either reducing the allocations for those VWIs or to deposit more funds into their root digital asset wallet.
[0170] For instance, in this case, the report would point to VWI 3 as the lowest account with insufficient funds that has caused the insufficiency across their hierarchy. The merchant may decide to reduce the allocation to 300 for VWI 3, which would then percolate upwards as it would reduce the allocations for VWI B and the root digital asset wallet. Alternatively, the merchant may deposit an additional 700 to the root digital asset wallet and that would resolve the issue. The merchant may also choose to do both - reduce the allocation and deposit funds under 700.
[0171] Every end-of-period reset is triggered on a schedule that is determined by the manager of the root digital asset wallet. This schedule can be intra-day to coincide with the organic requirements of the business. For instance, the resets can happen once every 8 hourly to fit into a shift system at a hospital that operates without closing. Alternatively, the schedule may reset only once a month for a business where liquidity buffers are managed more autonomously at lower divisions of the business. End of period liquidity allocation reset simulation.
[0172] In practice, it is likely that the treasurer or financial manager of the business would want to simulate the effects of a liquidity allocation reset periodically to test the feasibility of a liquidity plan, and to plan ahead for injections of funds to make the plans feasible. The active role of a treasurer or manager is indispensable and the VAM system is merely a powerful tool to facilitate their operations. VW ledger
[0173] The VW ledger records the debits and credits made to a VW hierarchy resulting from incoming payments and outgoing funds. This requires specific handling outside the normal payment settlement logic of the digital asset system as transactions have non-local effects. As shown in the diagrams before, the VW ledger maintains two sets of balances; the dedicated balance for the VW and an aggregated balance (“Agg balance”) that represents the total funds held by the VW and its descendants.
[0174] FIG.15 shows what happens with incoming payment transactions. The aggregated balances of VWs in the chain from the receiving VW to the root “physical” digital asset wallet are credited for consistency. By default, the digital asset system should allow such incoming payment transactions to settle without requiring the permission of the senior VWs. To ensure that the child VWs do not end up out of sync with their ancestors, the system only allows the credit transactions to lower levels to complete upon receiving a confirmation that the ancestor has been updated. Ideally, the updates should all be atomic - if any credit fails, all prior credits can, in some embodiments, also be rolled back.
[0175] This logical flow is sound for incoming payments at any level in the VW hierarchy - the transaction has to be percolated upwards.
[0176] In the transaction listing that a customer would get, the manager of VW 1 would see only the listing of incoming transactions for the day and outgoing payments that touch on VW 1. VW A’s managers would see actual digital asset transactions that have touched on the account directly, but also the listing of transactions that have touched upon VW 1 and VW 2 as these have also affected VW A’s aggregated balance. The root digital asset wallet’s managers would be able to see all transactions that have touched every VW in the hierarchy besides its own transactions demarcated properly by the actual VW affected by the digital asset transaction.
[0177] Payments outside the VW hierarchy are processed in similar fashion. In the same example, we have 45 being paid from VW 1 to an external wallet (see FIG. 16). However, unlike the case with incoming payments, the outgoing payment reduces the aggregated balances for VW A’s manager and the root digital asset wallet.
[0178] In this other example, we are debiting funds from an interior VW. Unlike the previous examples, the lowest level of VWs are unaffected by the payment. (A) (B) (C) (D) (E) Result VW A VW A VW 1 VW 2 Payment balance Agg balance balance from VW A BalanceScenario 1100 700 500 100 100 A >= EAllowedScenario 20 600 500 100 100 A < EE < B AlertScenario 30 600 500 100 620 A < EE > B Reject
[0179] In Scenario 1, the dedicated balance at VW A is enough to meet the payment amount. The payment is allowed.
[0180] In Scenario 2, the dedicated funds at VW A are insufficient to cover the payment amount. An optional alert is triggered for the merchant to check if they can subtract the balance from a child VW. Hypothetically, the merchant choses VW 1 to be debited, which reduces the balance there to 400. This would allow the payment to settle. VW 1’s account statement would reflect the debit of 100 as a liquidity transaction and not a payment, allowing the merchant to distinguish between financial results that are due to the actions of the individual managers versus those forced upon them by higher management.
[0181] In scenario 3, the aggregated balance at VW A is insufficient for the payment even if all children VWs are emptied, and the payment is rejected immediately.
[0182] The accounting entries visible on the core digital asset system and the VW ledger are documented in the next table. digital asset System VW ledgerScenario 1digital asset wallet debit 100VW A balance debit 100 [code: Payment] Payee digital asset wallet credit 100 VW A Agg balance debit 100 [code: Payment] digital asset wallet Agg balance debit 100 [code: Payment] Scenario 2 digital asset wallet debit 100 VW 1 balance debit 100 [code: Liquidity transfer] (if VW 1 Payee digital asset wallet credit 100 VW 1 Agg balance debit 100 [code: Liquidity transfer] VW A balance credit 100 [code: Liquidity transfer] transfers VW A balance debit 100 [code: Payment] liquidity to VW A Agg balance debit 100 [code: Payment] its parent) digital asset wallet Agg balance debit 100 [code: Payment]Scenario 3Rejected RejectedTransaction logic ratifier (TLR)
[0183] The TLR parses the sets of constraints declared on the VW and evaluates them according to the type of action requested.
[0184] Constraint sets are a collection of individual logical statements evaluating to True or False values. The individual statements are then linked by either conjunction (“and”) or disjunction (“or”) operations. For example, a two-constraint rule would be:
[0185] ((bal #VWI_XXX > 2000) AND (signers > 3))
[0186] The TLR would check that the VWI_XXX has sufficient funds and that the transaction meets the signing threshold to pass. The VWIs and signer identifiers are specifically differentiated from other numbers or strings by the “#” prefix.
[0187] Alternatively, the rule could have been:
[0188] ((bal #9876543210123456 > 2000) AND ((signers > 3) OR (S #AAA in SLIST)))
[0189] This rule makes use of the second set of enclosing parentheses to compose the two constraints ((signers > 3) OR (s #AAA in SLIST)) as a block. Hence either three signers or the signer with identification AAA are sufficient along with other constraints to execute a transaction. See FIG.17
[0190] The simple constraint definition language implemented by an example TLR are summarized below.
[0191] Constraints on a VWI are constructed from a set of operators and labelled objects. The objects supported by the VMS are described below. Extended functionality may be provided by the WSPs themselves as part ofvalidation before sending them to the core system. ● Numerical: Decimal and integer values. ● Signers: a keyword that resolves to the current set of signers on the transaction. ○ All signers in the set are valid signers for the VWI. To express a constraint about the number of signers required, one would have the statement “(Signers > 3)”. The system will automatically understand that the operator is an inequality and replaces the “Signers” keyword with the number of valid signers. The valid inequality operators dealt with in the same way are “=”, “>”, and “<”. ○ When the operator is the “IN” keyword, the VAM system automatically interprets the whole statement as a search operation. For instance “(S #ID_XXXX IN SLIST)” would search the SLIST set for the signer with the identifier “ID_XXXX” and return TRUE if the signer was found. ● BAL: a keyword that resolves into the usable balance of the VWI being referenced. ○ The VAM will replace the combination of the keyword “BAL” followed by a valid VWI identifier with the current usable balance of the VWI. “(BAL #VWI_XXX > 10000)” or “(BAL #VWI_XXX > BAL #VWI_YYYY)”. The following statements are acceptable constraints. The second example would be useful in the case of checking that the balancein the child VWI_YYYY is less than the balance currently available in its parent, VWI_XXX. ● SLIST: a keyword that retrieves a list containing the identities of the signers for this VWI ● S: a keyword that,the ‘#’ indicates that the string thereafter is a signer. ● AMT: a keyword that resolves to the value of the current transaction. ● PAYEE: a keyword that resolves to the VWI or digital asset wallet ID of the payee of the current transaction. ● PLIST: a keyword that retrieves an ordered list containing the VWIs and digital asset wallet IDs that are stored as meta-data for this VWI.
[0192] Constraints on a VWI may be of the following types: ● Inequality: ○ Signing weight use case: the number of signers exceeds the required number, for example, (Signers < 2) would evaluate to true if there are at least 2 signers on the transaction ○ Balance adequacy use case: toa payment to go through only if the remaining balance is above some minimum. For example, (BAL #VWI_XXX > Amount - 200) would get the current balance of the VWI_XXX and check that it would have at least 200 left after the transaction settles. ● Availability (constraints using the “IN” keyword): ○ Specific signer use-case: A VWI may only allow for release of funds if a specific signer is present even if the minimum number of signers is met. This could be the case if a manager has to sign the transaction and any of several other parties can verify the transaction. For example, ‘(S #01422750 IN SLIST)’ would resolve into a “TRUE” if the hypothetical signer with identifier 01422750 were in the list of authorized signers for the VWI that is originating the transaction. (See. FIG.18) ○ Specific payee use-case: A VWI may be set to only ever send funds to a specific set of other accounts. This would be useful as a financial control where a VWI is used as a means to pay a specific vendor or a set of vendors. For example, ‘(PAYEE IN PLIST)’ would return TRUE if the payee for this transaction, whose digital asset wallet ID is 1234567890123456 is on the PLIST. Report generation service (RGS)
[0193] Account statements for a merchant can, in some embodiments, be generated based on information found in the core digital asset system as well as the VWI ledger. The core digital asset system is typicallyunaware of VAM concepts such as liquidity allocations and transfers, and hence the VAM can be configured to provide augmented reporting capabilities to the WSP (and its customers indirectly).
[0194] FIG. 19 illustrates example functions which can be provided by the system in some embodiments. Some of these example functions are illustrated below. Summary Use Case Name Main account signup and setup (new to digital asset) Porting main account to another WSP Create VWI - define parent, add to LQ-Map VWI - define WSP VWI - define constraints Parse constraints Check constraints Update VWI Remove VWI Add signatory Update signatory Create liquidity allocation Updating the liquidity allocation - Switching a LQ-Map from “pending” to “live” End-of-day balance reset to allocation target Transfer liquidity Make payment Reconciliation report Generate statement Use Case Name Create VWI - define parent, add to LQ-MapDescription In some embodiments, each new VWI has a parent which is either another VWI, or the actual digital asset wallet id. The signatories of a parent can be configured to have rights over child VWIs, including the ability to change balances using the liquidity allocation maps. In terms of data transparency, personnel with control over ancestor VWIs have rights to view the transactions of their descendent VWIs. The LQ-Maps of the overall VAM structure have to change to account for the new VW. By default, a new VW has no children at the point of being added, hence it is always a “leaf” node in the VAM structure. Moreover, the VW is assumed to start with a 0 spec alloc. This means that adding it to a VAM structure does not change the Agg Alloc of its parent. By these two properties, the resulting LQ-Map from simply adding the new VW as a leaf node is always internally consistent. If the VW will have a non-zero spec alloc, the method of updating the LQ-Maps to reflect this is described in the use-case VAM-010. Basic Flow The business’ representative makes use of either: a. A user interface, application or portal provided by the WSP that creates the call to the VAM interfaces (APIs). In this case, the WSP is responsible for ensuring that the business’ representatives are properly registered, authenticated and authorized; or b. Direct connectivity to the VAM interface (via an API gateway) using credentials that were provided by the WSP to gain access to the VAM. 2. If necessary, a query request is first made to the interface at the logical path [VAM→Read (structure)]. The query will include the business’ identifier. The interface will return the structure of the VAM attached to that business’ digital asset wallet as a JSON or similar structured file that supports the representation of rooted trees. 3. The requester can then obtain the identifier of the VWI that will be the parent of the new VWI. 4. A request is sent to the interface at the end of the logical path corresponding to [VAM→VWI→Create]. The request is either a JSON or similarly formatted object that includes the mandatory fields: a. Parent VWI b. Initial signatories list - a list of the signatory identifiers already registered within the VAM structure’s namespace or name subspace.c. Merchant category code (if this is a VW tagged as a POS) 5. The VAM system creates the new VW, links it to the parent VW and creates the new VW’s SLIST. a. Each signatory on the SLIST is deemed to be sufficient to create transactions on that VW unless overridden by constraints. b. The new VWI will inherit the WSP settings of its parent. 6. The VAM system updates the LQ-Maps for the VAM structure with zero spec alloc for the VW just added. Pre-Conditions In some embodiments, the system requires a root digital asset wallet to serve as the ultimate ancestor of a VW. Use Case Name Create VWI - define constraints Description Constraints and the syntax for declaring them are covered herein. They are a means to define multi-party signing rules and other types of rules on the VWIs. Constraints only activate when an action is taken on the VWI that they are defined for. One constraint set each can be defined over the five following actions on a VWI: 1. Incoming payment 2. Outgoing payment 3. Liquidity transfers 4. LQ-Map deployment or changes to the liquidity reset schedule 5. Changes to the SLIST signatories 6. Changes to the PLIST 7. Changes to constraints sets For example, a merchant may have a simple rule for 100% quorum to change signatories. This may be overly restrictive for a rule set over outgoing payments where the merchant defines a more complex rule. The merchant may want to have 2 out of5 signers at least for any payments above $1000, but is happy to have only 1 signer for payments under that. Next, the merchant may require that the signers belong to the parent of this VWI in order to do liquidity transfers. Finally, the merchant may wish to only allow signers from the root digital asset wallet to make changes to constraint sets. Basic Flow The merchant’s representatives are likely to complete the definition of constraints on a set of VWIs and to communicate these to their acquiring WSP. The WSP will convert the merchant’s constraints into the syntax defined in Section 2.1.6. The WSP will get one of the merchant’s root digital asset wallet signatories to sign the request. It will then send that constraint set with the VWI’s identifier to the VAM’s interface at the logical path [VAM→VWI→Constraint]. The VAM will parse the request for syntactical correctness. If the constraint is syntactically correct, the VAM will respond to the WSP with a success code, otherwise it responds with a code for incorrect syntax. The VAM will then check for signatory related clauses in the constraint set. It will then check the following: i. That every signatory ID defined in the clauses belong to the signatory set for the VWI (including checking parent signatories, and the root digital asset wallet signatories where applicable) ii. That the constraint on changing constraints for the VWI is satisfied. The VAM will store the constraint set for the VWI if the checks pass. An example: ( ( (AMT < BAL #1234567890123456 - 200) AND(PAYEE IN PLIST) ) OR ( (AMT < BAL #1234567890123456 - 100) AND (PAYEE IN #9876543210123456) ) ) The expression above would parse into the tree illustrated in FIG.20 Use Case Name Check constraints Description A syntactically correct set of constraints that passes the parser above may not guarantee correctness in the actual VAM setup. Signatory identifier strings and VW identifier strings have to match up with actual identifiers, and the balance values have to be retrieved from the recordws to be substituted into the expressions. Basic Flow For instance in the example we used above: (AMT < BAL #1234567890123456 - 200), the parser may have read “BAL #1234567890123456”, but it has to: 1. Look up the VWI 2. Read the balance of the VWI (and block movement on that VW). We will assume 700 is the value read. 3. Return the value to the expression evaluation engine The checker will also do this: 1. Look up the AMT of the current transaction from the environment data passed to it. We will assume that 300 is the amount read. The expression evaluation engine (EEE) will then complete the arithmetic computation in the expression: (300 < 700 - 200)and convert the whole expression into “TRUE” in this case as 300 (left hand side) is less than 500 (right hand side). At the same time, the checker would also try to evaluate: (PAYEE IN PLIST) The PLIST is retrieved from the environment and the system will try to find the PAYEE. Eventually, the whole constraint set will look like the following: (((TRUE) AND (TRUE)) OR ((TRUE) AND (FALSE))) The checker will then compose the values upwards, combining the inner clauses into this: (TRUE OR FALSE) which evaluates into: (TRUE) This will also give the checker the chance to unlock all records that have been accessed during the evaluation process. For the checker to work, we require these generic components: 1. A symbol table - the table would record the symbols seen by the parser. Each record will include the type of the symbol seen, and the scope of the symbol (which expression it belongs to as indicated by the parser). 2. An environment set. The environment set will include the data elements associated with the transaction such as the amount, and the accounts addressed. It will also include the PLIST and SLIST for the accounts, and have the VAM hierarchies of the accounts. 3. Checker - An interpreter whose internal representation is the parenthesis language with simple arithmetic expressions. It accepts numbers, decimals, inequalities and binary statements. Use Case Name Update VWIDescription A set of screens and interfaces can, in some embodiments, be provided to the users of the VAM system to maintain basic meta-data about a VW. The elements maintainable through this set of interfaces are: 1. Parent VW - this use case covers scenarios updating the parent VW to a valid VW, and excludes setting this variable to the “null” equivalent. The null setting is covered herein. 2. MCC 3. POS flag 4. PLIST elements 5. SLIST elements - the SLIST can, in some embodiments, not be the empty list unless the Parent signatory flag is set to “TRUE”. A VW can, in some embodiments, always have at least one signatory, whether these are specific to itself or inherited from its parents as indicated by the Parent signatory flag. 6. Parent signatory flag 7. On-shift flag 8. Additional meta-data The elements most often changed are likely to be the SLIST and the on-shift flag in a POS terminal linked to a VW. Every request to the interfaces to update metadata elements can, in some embodiments, be logged with a timestamp. The success, rejection or failure messages to the requesters can, in some embodiments, also be logged with timestamps. Other elements of the VW such as the timestamp of on-shift flag changes and depth are computed based on the history of the VW. An implementation may consider optimizing the logging of the on-shift flag changes for more frequent lookups as they may be used for routine report generation. The constraint sets are to be changed by a dedicated interface since it requires special validation through the parser and checker.LQ-Map adjustments If the VW’s parent is changed, moving it will simply move its entire subtree under the new parent, including all descendants. This will require an update of the Agg Alloc at the parents: ● The original parent’s Agg Alloc will decrease by the Agg Alloc of the VW; and ● The new parent’s Agg Alloc will increase by the Agg Alloc of the VW. These changes will have to be propagated up to the lowest common ancestor of the original parent and the new parent, where the credit and debits will cancel out. Basic Flow 1. The user logs into the system. 2. The user sends a request with the update element, and the new value. This would be a request created via a graphical user interface either through a browser or a dedicated application that runs on a mobile device or a computer. 3. The VAM system validates if the request is signed properly, that the user is qualified to modify the element of meta-data, and that the new value is admissible. 4. The VAM system then updates the meta-data elements if the system is not locked for a current constraint check. Otherwise, it will attempt to repeat this until it succeeds. 5. The VAM system will update the LQ-Maps as described in the description of this use-case. The user makes use of an API to send a request to the system to update the elements. Use Case Name Remove VWI Description A business may want to prune VWs in their VAM hierarchies from time to time as their needs change. For instance, a merchant may close store locations or reduce the number of registers in a store. It is natural for the merchant to wish to reduce their reporting burden by removing the associated VWs from their VAM structures. One option is to use Update VMI to set the Parent VW pointer to the equivalent of “null”. The descendent tree of the now detached VW will still be attached to it. The request can, in some embodiments, include these basic minimal elements (and any additional elements as needed for the implementation):● “VWI”: The identifier of the VW being removed ● “Sub”: A single VWI that will be set as the new parent for all children of the removed VW. Even if there is no substitute VWI, it can, in some embodiments, be indicated as a null value for this field. ● “Autoremap”: True or False binary value. If “False”, the system will not attempt to do automatic housekeeping of the LQ-Maps. If “True”, the system will conduct the automatic housekeeping on the LQ-Maps to make sure that the removal of the VW (and possibly its descendants) results in an internally consistent LQ-Map. Housekeeping Removal of a VW from its VAM structure will invalidate LQ-Maps with it. If so, then there are timing considerations about when the removal of a VW can be requested and executed. There will be a time lag between the request and the fulfilment of a VW’s metadata update. During this time, a liquidity reset cannot be completed safely since the end result may be unexpected. Hence the VAM system can, in some embodiments, mark the LQ-Map of the VAM structure as “invalid” when it receives a VW parent update whose value is the “null” equivalent. The LQ-Map will remain “invalid” until it is updated next (either automatically by the VAM system if the “Autoremap” flag is set as “True” in the request), or a new LQ-Map is posted for the VAM structure. It is therefore important for the business users of the VAM system to plan ahead when modifying their VAM structures, and to avoid the times around their shift changes or end of day to do so. If the business intends for the descendants to remain a part of the VAM structure, they should specify the “Sub”. The substitute can, in some embodiments, be specified as an optional parameter that is sent in the request. If the “Sub” is null, then the VW and all its descendants will be removed at once. Autoremap process If the autoremap flag is “True” in the request, the VAM system will attempt to repair the LQ-Map.1. If the “Sub” is set to null, then it is safe to remove the entire subtree under the VW. For example, we may begin with the state of the VAM structure in FIG.21. The request would remove VW E, and the “Sub” is set to null. This means that VWs G and H are also taken out of the VAM structure. If we simply removed the three VWs and gave their current balances to the remaining VW D, then the following is true (see FIG.22) The LQ-Map elements are not internally consistent as the Agg alloc of 50 at VW D is not the summation of the specific allocations across the subtree under D. The same inconsistency will be true of all ancestors of the VW D. The gap is 50 - Spec alloc D - Spec alloc F = 50 - 10 -10 = 30. This is exactly the Agg alloc of the entire subtree we’ve removed. The first option for repairing this inconsistency is to simply reduce the Agg Alloc for VW D. This would have to propagate upwards to D’s ancestors, which in this case includes VW A. See. FIG.23. Another option is to localize the number of changes to be made. Instead of reducing the Agg alloc, we move the gap to the Spec alloc instead. As there is no change to the Agg alloc, the change is localized entirely to VW D. See FIG.24 The two options present some trade-offs. The first, non-local repair would be more likely to conform to the expectations of the original liquidity planners. The removal of part of a business should result in a decline in the required cash buffers required to operate the business overall. The Agg alloc of all ancestors of the removed VW have to be changed to reflect the removal of that VW. The second, local repair model is easier to carry out, but results in a large Spec alloc for the immediate parent of the removed VW. It would retain the overall size of liquidity buffers even though the business has been downsized. The managers of thebusiness are very likely to issue a new LQ-Map or to change allocations with other operations. We recommend implementing the non-local repair option. 2. If the “Sub” given is a sibling or parent VW of the removed node. Continuing with the same example, VW E was removed, and the “Sub” given was E’s parent, D. The outcome looks like the following, with the balance of E moved to its parent. G and H are “promoted” to be siblings of F. We note that the LQ-Map is internally inconsistent as the Agg alloc exceeds the summation of Spec allocs in D’s subtree. (50 > 40). See FIG.25 In this case, we have the same two options as in case 1. The non-local repair approach would remove the Spec alloc of VW E from the overall liquidity plan. The internally consistent LQ-Map will require two VWs. See FIG.26 The localised repair option would return the following instead. See FIG.27 Again the recommendation is to implement the non-local version. 3. If the “Sub” given is not a parent or sibling of the removed VW. In the following example, E’s children have been passed on to “C” as their new parent. C does not share E’s parent (D). In this case, E’s balance is given to its parent, D. G and H’s balances are both part of their new parent, C’s Agg B. Note that unlike the previous two cases analyzed, we have had to adjust balances across two VWs even prior to repairs. See Fig.28 The LQ-Map is no longer internally consistent. Any repair in this case is non-local since two nodes are affected. There are nonetheless two possible approaches. The first would minimize the number of VWs touched. E’s Spec Alloc is absorbed by its former parent, D. See FIG.29Alternatively, we can implement a repair that propagates upwards. Spec allocs do not change, and we adjust the Agg allocs alone. The end of the repair process is shown in Fig.30. Basic Flow The request is constructed either externally and sent by an API or created as part of a graphical user interface. After the request is submitted, it is validated and the VAM system invalidates the LQ-Map for the VAM structure being modified. An acknowledgement is sent to the requester. After completing all housekeeping upon removal of the VW, the system can, in some embodiments, send a confirmation to the requester. Use Case Name Add signatory Description Signatories for a VW are stored in the SLIST associated with that VW. In some embodiments, a signatory identifier is a proxy to the unique combination of: <<VAM structure namespace / subspace, username, password hash, authenticator app id, key sequence number, public key from authenticator application>> In some embodiments, a signatory identifier can be a human-readable text string. In some embodiments, by separating the signatory identifier from a specific digital asset wallet ID itself, an older key may be invalidated and a new one created without the need for a user to completely change their username. Unlike some cryptocurrency user ids which are persistent and unique for each natural person, a single person can act as any number of signatories for VWs. Basic FlowA natural person downloads and installs the authenticator app from the app store for their mobile device. When the person launches the authenticator app for the first time, it generates a unique authenticator app id. Every authenticator app has a unique authenticator app id. The user is assumed to be present physically at the business’ controlled terminal that is signed into the signatory management interface by a business manager. This is either a web interface or a mobile app on the manager’s phone / tablet. The manager has a list signatories function that lists all signatories in the VAM namespace, including those assigned to VWs and those not yet assigned. The signatories are listed with their usernames and VWs. The manager launches the add signatory function within the same interface. The interface displays a QR code containing the VAM structure’s namespace for the new user to scan with their authenticator app. The new user scans the QR code with their authenticator app. Their authenticator app then prompts them to create a username and password for the namespace (or subspace within a namespace). The new signatory creates a username and password on their authenticator app and submits that. In a business it is likely that the manager will make use of a structured string username to identify workers. This could be the natural name of the user, combined with a store location or some other strings with a specific whitespace character for combining them. For instance “joan_lee_nassau” could be a username that allows the manager to identify the worker. Alternatively, the worker’s employee number may be used. The authenticator app creates a private and public key pair for the <<VAM structure namespace, username, password, authenticator app id, key sequence number>> combination. In other embodiments, the authenticator app could utilize a symmetric key. The authenticator app then displays a QR code that contains their public key for this signatory and the username, password hash and authenticator app ID. The manager scans the person’s authenticator app for the QR code. The VAM system registers the new public key and the other metadata. It then returns a proxy string that uniquely maps to the new signatory. In another embodiment, the public key, identifier and / or other metadata can be accessed by the manager account via the server. The manager is now able to assign the worker by selecting from a list of signatories recognized by the VAM structure namespace that they control. They will be able to request the linkage of the signatory to a specific VW and they will sign the request. Depending on the constraint set associated with modification of the target VW’s SLIST, other managers may have to sign the request using their apps to allow the assignment.13. The VAM system checks and passes the request if constraints are met, and updates the SLIST with the new signatory. Use Case Name Update signatory Description The manager of a subtree may wish to update a signatory in the SLIST for a particular VW. This function will let the manager remove signatories from a VW, or to link them to other VWs in the namespace. It is also the interface that allows the manager to delete a signatory entirely if the manager is authorised to do so. Basic Flow The signatories interface panel in the mobile app or web interface lists the signatories by username and the VWs that they are on the SLIST of. The signatories may be filtered by subspaces of an overall namespace. Hence instead of simply the namespace “BahamasMart”, the subspace could be “BahamasMart->Atlantis” that the manager is allowed to manage. This would then only show the signatories that are part of the subspace. The signatories interface panel allows the manager to select the signatory. The manager can then do certain actions: 1. Unlink from VW - removes the signatory from the SLIST of a VW 2. Link to VW (covered in Add Signatory) - adds the signatory to the SLIST of a VW 3. Delete from namespace / subspace - removes the signatory from all SLISTs within the namespace / subspace and removes the signatory from the search 4. Add new signatory (covered in Add Signatory) Since every VW can, in some embodiments, have at least one signatory to function or the equivalent (where the parent signatory flag is set to “TRUE”), the VAM system cannot unlink a signatory from a VW if these conditions are not met. The VAM system will also check that the manager is authorized to adjust the SLIST of the VW. By definition, and for simplicity, the VAM system will default to add a manager as a signatory to the VWs inthe subtree of a VAM that they manage. The constraint set for the manager changing of the SLIST will also automatically be set to include the manager as a single signatory. This can be overridden by specific constraint sets. Use Case Name Create liquidity allocation Description A business’ managers will want to create LQ-Maps that specify their desired starting positions for liquidity buffers at each VW within their VAM structure at the start of each period (shift, day or others). A VAM structure is naturally visualised as a nested tree structure. Where possible the implementation should provide a dashboard like environment where the liquidity planner can select VWs from a tree and key in values for the Spec allocs for each VW. The resulting Agg Balances for the subtrees would then be computed naturally by the system for them as they continue their edits. This would ensure that the results are always internally consistent. The Agg balances resulting from the subtrees would show the planners the size of liquidity buffers required for the plans to be feasible. In addition, the LQ-Map interface may include historical information such as the utilisation of buffers and the number of times the plans have proven infeasible in the past. It may also warn the planner if the new values for the Spec balance would likely be insufficient to meet some sort of sliding average of outgoing payments over the past period (month, quarter or annual averages) given historical incoming payments. Basic Flow 1) The users will log into the VAM interface. 2) The users will select the liquidity plan function. 3) The users will load the VAM structure which will be displayed as an interactive tree. 4) The user interface has five mandatory buttons. The “new map”, “save”, “save and deploy”, “cancel”, and “resume edit” buttons. These are covered in the following bullet points.5) If the user clicks on “new map”, the system presents a VAM structure with defaults for the current balances. These balances are the spec balance in the VAM structure displayed if there is no current LQ-Map. Otherwise, the default is the currently deployed LQ-Map. 6) The user will be able to edit the structure’s spec alloc, which will update the Agg balances so that the entire tree remains consistent. 7) The user can then select the period of liquidity resets on a dedicated time and date controller. This can vary the liquidity resets based on a pre-set calendar, or based on a fixed set of options such as “daily, weekly, monthly, quarterly”. 8) The user can then set the “effective date” for the LQ-Map to be used. 9) If the user clicks on the “save” only button, the changes are saved as a non-operating record that the user may choose to load the next time they log into the interface. For simplicity, the user can only have three LQ-Maps at once: “live”, “pending” (deployed awaiting effective date), and a “draft” (saved, no effective date version). 10) When the user clicks on the “save and deploy” button, their changes are saved but not put into effect. The user’s LQ-Map will only come into effect after the effective date. In the meantime, the original LQ-Map currently in effect will continue to be used for resets. 11) If the user clicks on the “cancel” button all changes made to the LQ-Map are lost. 12) If the user clicks on the “resume edit” button, the latest edited version saved in a prior session is loaded and editing can continue. 13) When the new LQ-Map becomes effective, the prior LQ-Map is archived with the key to the LQ- Map being its inactivation date. 14) The user can set the notifications to be received, and provide email addresses for alerts if their LQ-Maps are infeasible at the point of reset, or at some pre-set time prior to reset. Use Case Name Updating the liquidity allocation - Switching a LQ-Map from “pending” to “live” Description The use case above covers the interface and general workflow for liquidity allocation creation, edits and saving. This use case covers the requirements for the actual switching over between LQ-Maps. Before the effective time of a a pending LQ-Map, the Liquidity Allocation engine will test both the feasibility of the “live” and “pending” LQ-Maps. Alerts will be generated if either “pending” or “live” LQ-Maps are projected to be infeasible.● For a business whose LQ-Maps are used once daily for liquidity resets, only the alerts for the “pending” LQ-Map are relevant as that is the one which will be used for the upcoming reset. ● For a business whose LQ-Maps are used intraday for shift changes or other reasons, the alerts for the “live” LQ-Map are relevant for the intraday resets, whereas the alerts for the “pending” LQ-Map are relevant only for the resets taking place past 12am on the next day. An implementation that is most useful would automate the detection of which cases are relevant for the business using a VAM structure, and only send the useful alerts. One implication of the requirements stated above is that updates or new LQ-Maps cannot be placed into “pending” mode after a 30 minute alert window before a reset. These LQ-Maps can only be deployed and made “pending” after the reset is completed. For instance, 5 minutes is required for a reset to complete as part of a start-of-day job. The LQ-Map population will be locked from 11:30pm of the previous day until 12:05am of the new day, after which LQ-Maps can be deployed again. Reset LQ-Map updateable LQ-Maps locked (12-12:05am) (12:05am-11:29pm) 11:30-11:59pm Disallowed Deployment possible Disallowed Use Case Name End-of-period balance reset to allocation target Description The VAM system will reset VW balances to the LQ-Map plans periodically using the schedule defined by the managers of the root digital asset wallet. Whereas it may be desirable in future to support LQ-Maps that cover only subtrees within a VAM structure, the current set of requirements only specifies support for a single LQ-Map per VAM structure. The core information that the users will provide to the system can, in some embodiments, notionally conform to the following format (shown as a JSON without loss of generality). The schedule below would be for a business thatoperates most days from noon till evening, with the start of shifts at noon, and mid- afternoon. Tuesdays and Fridays are exceptions. On Tuesdays, the business starts earlier at 11am, and hence the shift switches an hour earlier as well. The business operates on extended hours on Fridays, with a total of four shifts. The business is closed on Sundays. "resets": { "mon_1": "12:00", "mon_2": "17:00", "tue_1": "11:00", "tue_2": "16:00", "wed_1": "12:00", "wed_2": "17:00", "thu_1": "12:00", "thu_2": "17:00", "fri_1": "12:00", "fri_2": "17:00", "fri_3": "21:00", "fri_4": "23:00", "sat_1": "09:00", "sat_2": "12:00", } A successful implementation of the requirements can, in some embodiments: 1. Have a recurring trigger that is schedulable at hourly intervals. 2. Support loading of reset schedules in the form shown above. The loader can, in some embodiments, parse the schedules properly. 3. The resets can, in some embodiments, occur properly and only when the LQ-Maps are feasible and internally consistent. 4. Any exceptions will be reported to the registered notifications recipients for the reset service. 5. A successful LQ-Map reset will be recorded properly on any account statements for the VWs in the VAM structure. Excess funds after execution of the LQ-Map reset are concentrated automatically in the root digital asset wallet as part of its balance regardless of the spec alloc given to it.Basic Flow Alternate Flows 1. The VAM structure’s managers deploy the LQ-Map as described herein. The schedule accompanying the LQ-Map is also created and sent to the engine as part of the deployment. 2. The reset processor creates triggers for each new LQ-Map deployed. The reset processor also creates triggers for the simulation of each LQ-Map. 3. At each half hour mark, the reset processor launches the simulator for the LQ-Maps that will be reset. It generates warnings for those maps that are infeasible under the simulation given the current state of the balances. The warnings are sent to the users if they have registered themselves to receive them. 4. At the start of each hour, the reset engine checks its trigger sets for LQ-Maps that have to be triggered. The VAM structures are reset according to the LQ-Maps if they are feasible. Use Case Name Transfer liquidity Description VWs may transfer funds to other VWs that are in the same VAM structure. These would change the individual balances for the VWs involved, and require updates to the aggregate balances of their ancestors to maintain consistency. These transfers are undertaken apart from actual sales of the business and hence do not correlate to invoices, bill of materials, or other instruments of commerce. The purpose of such transfers are typically related to ad hoc funding requirements or unpredictable build-ups of funds at some VWs. The liquidity transfer operations can therefore take the form of a different request format than that used for payments. This is similar to the approach taken in the ISO 20022 standard where payments are initiated by PAIN message types, settled using PACS messages, but liquidity management flows use the CAMT message types. Moreover, the liquidity management requests remain solely within the VAM system. There is no involvement of the main digital asset system. This architectural separation allows for a natural division of labor between the two processing systems and reduces the workload on the digital asset system. Basic Flow1. The requester creates a liquidity transfer request message specifying the: a. Reason code b. Target VW c. Source VW (automatically populated if the requester is using a mobile App or web browser interactively) d. Amount e. Additional metadata 2. The requester will sign the message explicitly or the application used to create the request will sign the message using the requester’s private signatory key. The message is submitted to the system. 3. If there are insufficient signatures on the message, the request will be queued. Other qualified signatories whose signer ids are in the SLIST for the VW may see the transaction in queue. They may sign the transaction. 4. Once the conditions are met based on the constraint set for liquidity transfers, the request is sent to the VAM system. 5. The VAM system will validate that sufficient funds are available on the source VW and that the VWs are in the same hierarchy. 6. The VAM system will update the balances as required and send a confirmation to the requester if they are calling via an API. Alternatively the success event is shown via the web interface or mobile app. Use Case Name Make payment Description Payments from VWs will be made using the same request API and interfaces as payments between digital asset wallets. The differences from normal wallet payments will arise from: 1. The application of constraints which do not apply to the simple case of a retail wallet. Businesses may require larger payments to be authorised by more than one signatory. Other businesses may only allow payments to be made to certain counterparties. 2. Payments between VWs in the same VAM structure will be processed solely by the VAM system instead of the digital asset system. 3. A VW’s outgoing payment to another digital asset wallet will be recorded on both the digital asset system and the VAM system, with thedigital asset system reflecting a payment between the root digital asset wallet and the recipient. These three distinguishing factors serve largely to influence the resulting speed of processing due to the additional complexity of dealing with constraints and more accounting postings. Basic Flow 1. The requester creates the payment using the digital asset App linked to the VW, or a dedicated mobile App meant for business users. The requester can, in some embodiments, be a signatory that is on the SLIST of the VW. 2. The requester’s App will post the request to the digital asset system which recognizes the transaction to involve a VW. 3. The digital asset system forwards the request to the VAM system. 4. The VAM system will also validate that the constraints for making a payment are met. a. If the constraint set for an outgoing payment requires more signatories, the VAM system will add the pending payment to the list of requests for the other qualified signatories based on the constraint set. b. The VAM system will validate that the source VW holds sufficient balances for the payment. If there is insufficient balance, the transaction is immediately rejected. c. If the constraint set specifies an exclusive subset of payees, the VAM system will check that the transaction’s payee is part of that set. If it is not, the transaction is immediately rejected. d. More complex constraints are checked. 5. If the transaction passes all constraints, the VAM system will carry out the necessary accounting entries for the transaction. Accounting entries for the digital asset wallet level are delegated to the digital asset system to be carried out. The VAM system will check that all entries are recorded successfully within the VAM ledger and the digital asset system before confirming the transaction is successful. Use Case Name Reconciliation report Description Unforeseen errors or bugs may create inconsistencies between the intended outcome from a set of transactions involving the VAM system and the actual set of accounting records committed.We can, in some embodiments, analyze the issue with the following diagram. There are two VAM structures under the root digital asset wallets, Root 4 and Root 3. The digital asset system’s view of the starting state 3100 in FIG.31. The VAM system’s more granular view 3110 is also illustrated in FIG.31. VW B sends a payment to VW G for $15. The two sets of paired ledger entries should be: On digital asset Debit wallet 4, value $15 sys Credit wallet 3, value $15 On VAM sys Debit wallet B, value $15 Credit wallet G, value $15 Update Agg Bs of their ancestors. As the VAM sys and digital asset sys are separate, it is possible that updates to either set complete without the accompanying ledger entries succeeding on the other system. This should technically be extremely unlikely, and the digital asset system ledger entries should always override those on the VAM sys since the digital asset ledger is the final settlement layer. Nonetheless, there remain possible scenarios where either system is offline or malfunctioning whilst the other continues to function, or where communications are interrupted. The reconciliation report makes use of two components to check for such errors and to highlight them to users and the operators of the digital asset / VAM system combination. First, an independent implementation of a payment processor with simplified logic can, in some embodiments, be created. This simulator can, in some embodiments, be capable of reading the transaction requests sent to the digital asset / VAM combination router. The simulator will also take the starting balances from a snapshot table. The simulator will then conduct the payments as if all VWs are actual digital asset wallets. The simulation can be done on a subset of the digital asset wallets instead of all digitalasset wallets as long as all transactions are between these wallets alone. The simulation will pause at the point of any liquidity reset. The reconciliation processor will take the simulator’s output and compare that to the actual digital asset / VAM system state snapshot taken at the point prior to the liquidity reset actions. Any discrepancy in the balances for the VWs versus the simulated stand-alone outcome will be noted for analysis. The reconciliation process will halt at this point since any further forward simulations will simply amplify the errors. If there were no discrepancies, the liquidity reset actions will then be conducted. These will always coincide with the start of each hour. The post-reset outcomes are compared with the expected outcomes from the LQ-Maps. Any discrepancies are noted and the reconciliation process will halt for the errors to be corrected. If there are no discrepancies, the simulation will continue, switching between the transaction processing phases and the liquidity reset actions. The reconciliation process will end when the unprocessed transaction set is null. Basic Flow 1. The digital asset / VAM combination system operators initiate the reconciliation process as part of routine maintenance or audits. The operators may choose to send a truncated transaction set and also select a subset of wallets for the sampling process. 2. The system conducts the reconciliation check using the transaction set and outputs the results for the operators or auditors. VWIs under the same hierarchy can have multiple WSPs for receiving funds The WSP for a merchant’s root digital asset wallet retains full oversight of all funds settling in the merchant’s digital asset wallet. However, as in the case of existing card networks where the merchant can receive funds to their bank accounts across more than one payment rail, merchants may work with more than one WSP as their acquirer.Appendix - Algorithm for updating VWIs after each payment transaction Start by listing all VWIs and digital asset wallets whose balances are either debited or credited by this transaction, insert into LIST. Retrieve the VAM hierarchies for the VWIs on the LIST. If all nodes in the LIST were depth 0, do debit and credits on both balance and agg balances (if the digital asset wallet has a VAM) of the nodes. Exit. Else Repeat Until LIST is empty: Dequeue LIST and get the item{ Get the attributes {depth, balance, Agg Balance, parent} for the item Do actions list for the item if (Agg Balance changed) and (Depth>0) { Add Agg Balance update to item’s Parent’s actions list Enqueue parent } if this item to be debited by transaction Debit balance Debit Agg Balance Add Agg Balance debit to item’s Parent’s actions list else if this node to be credited by transaction Credit balance Credit Agg Balance Add Agg Balance credit to item’s Parent’s actions list Enqueue parent node }Exit. Analysis We can, in some embodiments, use the diagram in FIG.32 to simulate the operation of the update algorithm for several cases. Scenario Algorithm sequence B pays A $5 LIST = {B, A}. Actions = Debit 5 from B. Credit 5 to A.Node B: Actions list = {Debit 5} Debit 5 from Balance, new Balance is 5 Debit 5 from Agg Balance, new Agg Balance is 5 Send request to debit parent A’s Agg Balance by 5 Enqueue A LIST = {A, A} Node A: Actions list = {Credit 5, debit aggregated balance by 5} Credit 5 to Balance, new Balance is 15 Credit 5 to Agg Balance, new Agg Balance is 75 Debit Agg Balance by 5, new Agg Balance is 70 LIST = {A} Node A: Actions list = {} Do nothing LIST = {}. Exit. We can see that the final outcome is correct. As node A is the digital asset wallet, and no funds moved outside the VAM hierarchy, the Agg Balance should not change, and indeed stayed as 70. The funds available to the VWI B were properly deducted, and the discretionary funds available to the managers of A were properly increased. LIST = {G, F}. Actions = Debit 7 from G. Credit 7 to F. Node G: Actions list = {Debit 7} Debit 7 from balance, new balance is 3 Debit 7 from aggregated balance, new Agg Balance is 3 Send request to debit parent E’s Agg Balance by 7 Enqueue ELIST = {F, E} Node F: Actions list = {Credit 7} Credit 7 to balance, new balance is 17 Credit 7 to aggregated balance, new Agg Balance is 17 Send request to credit parent D’s Agg Balance by 7 Enqueue D LIST = {E, D} Node E: Actions list = {debit Agg Balance by 7}, new Agg Balance is 13 Send request to debit parent D’s Agg Balance by 7 Enqueue D LIST = {D, D} Node D: Actions list = {debit Agg Balance by 7, credit Agg Balance by 7} Agg Balance is unchanged LIST = {D} Node D: Actions list = {} Agg Balance is unchanged LIST = {}. Exit. Again, the algorithm results in the correct updates. We have only touched 1 more than the minimal number of three nodes to be updated: E, F, G. The effects of the Agg Balance updates to node D cancelled out and we could have avoided processing them. See. FIG.33.digital asset LIST = {digital asset wallet #1, E}. Actions = Debit digital asset wallet #1 by $2. wallet #1 pays E Credit E by $2. $2 Node digital asset wallet #1: digital asset wallet #1 is standalone and has no VAM hierarchy, hence it has no Agg Balance. Its starting balance was $25 Actions list = {Debit 2} Debit 2 from balance, new balance is $23 LIST = {E} Node E: Actions list = {Credit 2} Credit 2 to balance, new balance is 12 Credit 2 to Agg Balance, new Agg Balance is 15 Send request to credit parent D’s Agg Balance by 2 Enqueue D LIST = {D} Node D: Actions list = {Credit 2 to Agg Balance} Credit 2 to Agg Balance, new Agg Balance is 42 Send request to credit parent A’s Agg Balance by 2 Enqueue A LIST = {A} Node A: Actions list = {Credit 2 to Agg Balance} Credit 2 to Agg Balance, new Agg Balance is 72 Depth = 0, so do not Enqueue anything. LIST = {}. Exit. The VAM hierarchy under A was updated correctly and only the nodes highlighted inyellow were touched by the algorithm (other than the payer, digital asset wallet #1, which is outside the VAM hierarchy). See. FIG.34Glossary Aggregated balance: when used in the context of a specific virtual wallet refers to the sum of Digital assets earmarked specifically for the virtual wallet and all its descendents. Authorize: a decision to grant access or acceptance of a request typically automated by evaluating the requester's attributes. Checkers: when used in the context of a "maker-checker" authorization process refers to the individual who confirms or authorizes the transaction created by someone else. Constraints: factors that restrict or limit the usage of a virtual wallet. These are expressed in the VAM system as binary logical statements that can, in some embodiments, all resolve to be “true” when evaluated for a requested action to be executed on the VWI Current balance: when used in the context of a virtual wallet refers to the portion of funds that are designated for use only by the virtual wallet's signatories. Depth: When used in the context of a virtual wallet, depth is an integer that reflects how far this VWI is from the root node. For example, a depth of 1 would be the direct children of the root digital asset wallet. A depth of 2 would be 2 steps from the root digital asset wallet. Digital signatures: the result of a digital transformation of some data that provides assurance that the data's originator is authentic, the data is complete and unmodified after leaving the originator, and serves as undeniable proof linking the signed data to its originator. Endorsements: the use of a digital signature algorithm to signify the acceptance of the data that is signed. Enrolled business user: A Sand Dollar user whose digital asset wallet is enabled and uses the Sand Dollar wallet for a primarily business purpose. Hierarchical sets of signatories: refers to a digital method using the Hierarchical Threshold Signature Scheme. The scheme allows for vertical access control so that one can require the signature of a manager to authorize an important transaction. Liquidity allocation maps: these refer to a chart of accounts that expresses the liquidity allocations given to each virtual wallet in a given virtual wallet hierarchy.Liquidity allocations: a number of Digital assets that are designated for use by a given virtual wallet, or the aggregated balance of its descendents. LQ-Map: see liquidity allocation maps Makers: when used in the context of a "maker-checker" authorization process refers to the creator of a transaction or request. Merchant category code: Payment brands use merchant category codes (MCCs) to classify merchants and businesses by the type of goods or services provided. The MCCs can be used to categorize, track and restrict transactions. MCCs can be used for tax reporting, merchant fee discounts and gathering information about payer purchasing behavior. Merchant services: enable businesses to accept Sand Dollar payments, manage Sand Dollar balances, and make business payments. The wallet provider does so by granting the business access to technology, security tools and cash management services. Multi-signatory authorisation: refers to a digital signature scheme where the process of signing information (e.g. a transaction or a request) is distributed among multiple private keys held by different individuals. Non-repudiable: protection against individuals falsely denying having performed particular actions. Used mostly in this document to refer to the act of creating some information, sending a message, approving some request or receiving a message. On-Shift flag: a binary value that is "TRUE" if the virtual wallet bearing the flag is in use during a working shift. Parent: when used in the context of a virtual wallet hierarchy refers to a virtual wallet with at least one child virtual wallet. The aggregate balance at the parent VW is always split between the parent and its children. Parent-signatories: this is a binary flag which specifies if the signatories of the parent VWI are authorised to issue transactions on this VWI PLIST: An ordered list of wallet identifiers (both virtual and “real”) that can be referenced by a constraint setPoint-of-sale tag: a binary value, true if the virtual wallet is tagged to a point-of-sale terminal. False otherwise. Root digital asset wallet: the actual digital asset wallet that the VAM hierarchy sits under. This is the "oldest" common ancestor of all virtual wallets in the hierarchy, and the only wallet that is directly debited or credited by the digital asset system during a funds movement. digital asset clearing system: that part of the Sand Dollar system responsible for processing transactions between Sand Dollar wallets. Single sovereign wallet: a wallet that is directly managed by the digital asset system, where the balance of funds are direct liabilities of the CBOB. SLIST: A list of signatory identifiers that can be referenced by a constraint set. VAM structure namespace: refers to any class of elements that have unique names within the VAM structure. For example, a username in the VAM structure namespace will be unique. However, outside the namespace, the username can be shared with other elements in other namespaces. VAM: virtual account management. Used in this document to refer to the system that manages virtual wallets and virtual wallet identifiers. Virtual wallet identifiers: identifiers that are accepted by the digital asset clearing system as valid wallet identifiers but refer not to actual Sand Dollar wallets. Funds sent to a VWI end up in the Sand Dollar wallet that is its ultimate ancestor within the VAM system. Payments from the VWI come from the same ultimate ancestor.WSP: when used in a Sand Dollar context refers to the wallet provider.
[0195] Although the embodiments have been described in detail, it should be understood that various changes, substitutions and alterations can be made herein.
[0196] Moreover, the scope of the present application is not intended to be limited to the particular embodiments of the process, machine, manufacture, composition of matter, means, methods and steps described in the specification. As one of ordinary skill in the art will readily appreciate from the disclosure of the present invention, processes, machines, manufacture, compositions of matter, means, methods, or steps, presently existing or later to be developed, that perform substantially the same function or achievesubstantially the same result as the corresponding embodiments described herein may be utilized. Accordingly, the appended claims are intended to include within their scope such processes, machines, manufacture, compositions of matter, means, methods, or steps.
[0197] As can be understood, the examples described above and illustrated are intended to be exemplary only.
Claims
CLAIMS:What is claimed is:
1. A system for hierarchical electronic resource management, the system comprising:at least one memory;at least one network interface for communicating with an external electronic resourcetransaction network; andat least one processor configured for:providing at least one parent node associated with a parent wallet identifier and atleast one key for authorizing transactions between a parent wallet with the externalelectronic resource transaction network;upon receiving a first request for executing a first transaction transferring a firstquantity of electronic assets from a first wallet in a hierarchy of wallets associated with theparent wallet, validating with a constraint engine whether one or more constraint sets basedon an aggregate quantity of electronic assets associated with the parent wallet, and anallocation of available assets associated with the first wallet are satisfied; andwhen the one or more constraint sets are satisfied, initiating a data process forexecuting the first transaction via the external electronic resource transaction network andupdating the aggregate quantity of electronic assets associated with the parent wallet andthe allocation of available assets associated with the first wallet.
2. The system of claim 1, wherein the at least one processor is configured for:upon receiving, at the at least one parent node, a electronic transaction message indicatingthat electronic assets have been received via the external electronic resource transaction networkand including a recipient identifier corresponding to the first wallet;updating and storing in the at least one memory, the aggregate quantity of electronic assetsassociated with: the parent wallet, the first wallet, and any wallet in the hierarchy of wallets betweenthe first wallet and the parent wallet.
3. The system of claim 1, wherein validating at least one of the one or more constraint setscomprises:determining that parameters of the first transaction and the first wallet requireauthorization, traversing a hierarchical signatory data structure to identify at least one signatorynode and sending an authorization request message to the at least one signatory node.
4. The system of claim 1, wherein the at least one processor is configured for:upon receipt of a request to add a second wallet to a requested position in the hierarchy ofwallets and having a proposed allocation of available assets for the second wallet, validating with theconstraint engine whether any of the one or more constraint sets would be violated by adding thesecond wallet at the requested position in the hierarchy of wallets base on the proposed allocation;andupon determining that at least one of the one or more constraint sets would be violated,generating signals for communicating the violation.
5. The system of claim 1, wherein the first request is received at the at least one parent node theexternal electronic resource transaction network based on a first wallet identifier which is associatedwith the parent wallet in the external electronic resource transaction network.
6. The system of claim 1, wherein the at least one processor is configured for: upon receiving the firstrequest for executing the first transaction transferring the first quantity of electronic assets from thefirst wallet, locking the parent wallet preventing it from processing additional transaction requestsuntil the first request has been validated and allocations in the hierarchy of wallets have beenupdated.
7. The system of claim 1, wherein the at least one processor is configured for: upon receiving the firstrequest for executing the first transaction transferring the first quantity of electronic assets from thefirst wallet, locking each constraint set which includes wallet parameters which would be affected bythe first request such that each locked constraint cannot be satisfied by a subsequent transactionrequest until unlocked.
8. The system of claim 1, wherein the at least one processor is configured for: upon receiving the firstrequest for executing the first transaction transferring the first quantity of electronic assets from thefirst wallet, adding a lock amount based on the first quantity of electronic assets as part of the one ormore constraint sets.
9. A method for hierarchical electronic resource management comprising:providing, with at least one processor, at least one parent node associated with aparent wallet identifier and at least one key for authorizing transactions between a parentwallet with an external electronic resource transaction network;upon receiving a first request for executing a first transaction transferring a firstquantity of electronic assets from a first wallet in a hierarchy of wallets associated with theparent wallet, validating with a constraint engine whether one or more constraint sets basedon an aggregate quantity of electronic assets associated with the parent wallet, and anallocation of available assets associated with the first wallet are satisfied; andwhen the one or more constraint sets are satisfied, initiating a data process forexecuting the first transaction via the external electronic resource transaction network andupdating the aggregate quantity of electronic assets associated with the parent wallet andthe allocation of available assets associated with the first wallet.
10. The method of claim 9, comprising:upon receiving, at the at least one parent node, a electronic transaction message indicatingthat electronic assets have been received via the external electronic resource transaction networkand including a recipient identifier corresponding to the first wallet;updating and storing in the at least one memory, the aggregate quantity of electronic assetsassociated with: the parent wallet, the first wallet, and any wallet in the hierarchy of wallets betweenthe first wallet and the parent wallet.
11. The method of claim 9, wherein validating at least one of the one or more constraint setscomprises:determining that parameters of the first transaction and the first wallet requireauthorization, traversing a hierarchical signatory data structure to identify at least one signatorynode and sending an authorization request message to the at least one signatory node.
12. The method of claim 9, comprising:upon receipt of a request to add a second wallet to a requested position in the hierarchy ofwallets and having a proposed allocation of available assets for the second wallet, validating with theconstraint engine whether any of the one or more constraint sets would be violated by adding thesecond wallet at the requested position in the hierarchy of wallets base on the proposed allocation;andupon determining that at least one of the one or more constraint sets would be violated,generating signals for communicating the violation.
13. The method of claim 9, wherein the first request is received at the at least one parent node theexternal electronic resource transaction network based on a first wallet identifier which is associatedwith the parent wallet in the external electronic resource transaction network.
14. The method of claim 9, comprising: upon receiving the first request for executing the firsttransaction transferring the first quantity of electronic assets from the first wallet, locking the parentwallet preventing it from processing additional transaction requests until the first request has beenvalidated and allocations in the hierarchy of wallets have been updated.
15. The method of claim 9, comprising: upon receiving the first request for executing the firsttransaction transferring the first quantity of electronic assets from the first wallet, locking eachconstraint set which includes wallet parameters which would be affected by the first request suchthat each locked constraint cannot be satisfied by a subsequent transaction request until unlocked.
16. The method of claim 9, comprising: upon receiving the first request for executing the firsttransaction transferring the first quantity of electronic assets from the first wallet, adding a lockamount based on the first quantity of electronic assets as part of the one or more constraint sets.
17. A non-transitory, computer-readable medium having stored thereon computer-readableinstructions which when executed by at least one processor, configure the at least one processor for:providing at least one parent node associated with a parent wallet identifier and atleast one key for authorizing transactions between a parent wallet with an externalelectronic resource transaction network;upon receiving a first request for executing a first transaction transferring a first quantity of electronic assets from a first wallet in a hierarchy of wallets associated with theparent wallet, validating with a constraint engine whether one or more constraint sets basedon an aggregate quantity of electronic assets associated with the parent wallet, and anallocation of available assets associated with the first wallet are satisfied; andwhen the one or more constraint sets are satisfied, initiating a data process forexecuting the first transaction via the external electronic resource transaction network andupdating the aggregate quantity of electronic assets associated with the parent wallet andthe allocation of available assets associated with the first wallet.
18. The non-transitory, computer-readable medium of claim 17, wherein the instruction configurethe at least one processor for:upon receiving, at the at least one parent node, a electronic transaction message indicatingthat electronic assets have been received via the external electronic resource transaction networkand including a recipient identifier corresponding to the first wallet;updating and storing in the at least one memory, the aggregate quantity of electronic assetsassociated with: the parent wallet, the first wallet, and any wallet in the hierarchy of wallets betweenthe first wallet and the parent wallet.
19. The non-transitory, computer-readable medium of claim 17, wherein the instruction configurethe at least one processor for:determining that parameters of the first transaction and the first wallet requireauthorization, traversing a hierarchical signatory data structure to identify at least one signatorynode and sending an authorization request message to the at least one signatory node.
20. The non-transitory, computer-readable medium of claim 17, wherein the instruction configurethe at least one processor for:upon receipt of a request to add a second wallet to a requested position in the hierarchy ofwallets and having a proposed allocation of available assets for the second wallet, validating with theconstraint engine whether any of the one or more constraint sets would be violated by adding thesecond wallet at the requested position in the hierarchy of wallets base on the proposed allocation;andupon determining that at least one of the one or more constraint sets would be violated,generating signals for communicating the violation.
21. The non-transitory, computer-readable medium of claim 17, wherein the first request is receivedat the at least one parent node the external electronic resource transaction network based on a firstwallet identifier which is associated with the parent wallet in the external electronic resourcetransaction network.
22. The non-transitory, computer-readable medium of claim 17, wherein the instruction configurethe at least one processor for: upon receiving the first request for executing the first transactiontransferring the first quantity of electronic assets from the first wallet, locking the parent walletpreventing it from processing additional transaction requests until the first request has beenvalidated and allocations in the hierarchy of wallets have been updated.
23. The non-transitory, computer-readable medium of claim 17, wherein the instruction configurethe at least one processor for: upon receiving the first request for executing the first transactiontransferring the first quantity of electronic assets from the first wallet, locking each constraint setwhich includes wallet parameters which would be affected by the first request such that each lockedconstraint cannot be satisfied by a subsequent transaction request until unlocked.
24. The non-transitory, computer-readable medium of claim 17, wherein the instruction configurethe at least one processor for: upon receiving the first request for executing the first transactiontransferring the first quantity of electronic assets from the first wallet, adding a lock amount basedon the first quantity of electronic assets as part of the one or more constraint sets.
Citation Information
Patent Citations
Systems, methods, and program products for verifying digital assets held in a custodial digital asset wallet
US11282139B1
Electronic transfer tracking using virtual wallets
US20190266580A1
