Abstract: An example operation may include one or more of receiving, via a first blockchain peer, a request to verify an identity of a user, performing, via the first blockchain peer, an identity validation of the user via a know your customer (KYC) service provider of a blockchain network, determining whether a digital identity of the user has been previously stored by another blockchain peer on a blockchain of the blockchain network, in response to a determination that the digital identity of the user has not been stored on the blockchain, creating a non-fungible token (NFT) that identifies the user, and appending information about the identity validation of the user to a structure of the NFT and storing the NFT in a block of the blockchain.

Abstract: An example operation may include one or more of receiving, via a payment network, a request to detokenize a payment token to process a payment transaction between a source and a target, detokenizing the payment token based on mapping data stored in a token vault, transmitting information about the detokenized payment token to a computing device associated with the request, generating a settlement token that comprises identifiers of the source and the target and an identifier of the payment token, and transmitting the settlement token to a blockchain on a blockchain settlement network which is parallel to the payment network.

Abstract: An example operation may include one or more of identifying one or more attributes of a blockchain, determining the blockchain should be closed based on the one or more attributes, closing the blockchain, creating a new blockchain, identifying one or more assets from the blockchain, and creating a carry-over transaction based on the one or more assets of the blockchain.

Abstract: Optimization of event aggregation in an event-driven system is provided. An event queue is queried for a current event. A workload affinity coefficient that describes the current event, at least in part, is read. A database is searched for one or more matching workload affinity coefficients. The current event and one or more events that are respectively associated with one or more matching workload affinity coefficients are aggregated, thereby generating an aggregated event.

Abstract: An electronic system, computer-implementable method, and non-transitory, computer-readable storage medium for providing overdraft protection during an electronic financial transaction. In various examples, the electronic system receives, from an account holder, a request for withdrawal of funds from a first account of the account holder held at a first financial institution. If the first account has an amount of funds sufficient to cover the request for withdrawal, the request for withdrawal is completed. If the first account does not have a sufficient amount of funds to cover the request for withdrawal, a real-time electronic payment system is used to transfer an amount of funds from a second account of the account holder held at a second financial institution to the first account to cover the request for withdrawal. The request for withdrawal of funds is completed using funds from the first account.

Abstract: An electronic system, computer-implementable method, and non-transitory, computer-readable storage medium for providing overdraft protection during an electronic financial transaction. In various examples, overdraft protection is provided by transferring funds from accounts held by an account holder at different financial institutions. In one example, transfers take place using a first real-time electronic payment system of a first financial institution and a second real-time electronic payment system of a second financial institution.

Abstract: An example operation may include one or more of identifying one or more attributes of a blockchain, determining the blockchain should be closed based on the one or more attributes, closing the blockchain, creating a new blockchain, identifying one or more assets from the blockchain, and creating a carry-over transaction based on the one or more assets of the blockchain.

Abstract: An approach is disclosed that has a merchant receive a purchase request that includes a purchase amount. The merchant creates a payment template that includes the purchase amount and the merchant's bank account information. The payment template is provided the customer, and then the merchant receives a completion notification of the purchase request from a trusted third party, such as the merchant's financial institution.

Abstract: Optimization of event aggregation in an event-driven system is provided. An event queue is queried for a current event. A workload affinity coefficient that describes the current event, at least in part, is read. A database is searched for one or more matching workload affinity coefficients. The current event and one or more events that are respectively associated with one or more matching workload affinity coefficients are aggregated, thereby generating an aggregated event.

Abstract: The present invention is a logical model for EDI messages using the open standards XML schema, which is both scalable and high performing which allows the processing of one message at a time. It builds a standard logical instance compliant to XML schema and facilitates standard set of mapping tools working off XML schema to alter or map the EDI messages from one form to another, one message at a time.

Abstract: Within the scope of existing XML Schema specifications, an approach is provided to embed simple types within a complex type so an XML stream can have instances of the embedded simple types, even without the presence of XML elements. Because the approach is within the scope of existing XML Schema specifications, the approach is transparent to known XML parsers. With the approach, an XML schema will have a complex type with a mixed flag set to true and an element set to be a dummy element. The dummy element has a simple type and one of (i) a name of the dummy element and (ii) a name of the simple type is one of a predetermined set of names. This XML schema is for use with a parser which, on parsing the schema, will interpret the dummy element as one of an embedded simple type and an inherited simple type.

Abstract: In a network comprising a first node where raw business data is collected, and a second node connected to the first node, a method for converting the raw business data to transformed data, comprises steps or acts of monitoring the availability of raw business data at the first node and based on either relevant first node or second node conditions the raw business data is transformed to transformed data at respectively the first or second nodes.

Abstract: Within the scope of existing XML Schema specifications, an approach is provided to embed simple types within a complex type so an XML stream can have instances of the embedded simple types, even without the presence of XML elements. Because the approach is within the scope of existing XML Schema specifications, the approach is transparent to known XML parsers. With the approach, an XML schema will have a complex type with a mixed flag set to true and an element set to be a dummy element. The dummy element has a simple type and one of (i) a name of the dummy element and (ii) a name of the simple type is one of a predetermined set of names. This XML schema is for use with a parser which, on parsing the schema, will interpret the dummy element as one of an embedded simple type and an inherited simple type.