Message Unique Identifier Systems for Payment Transaction Linking
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current payment processing networks lack the ability to establish relationships between distinct message types as they are processed and stored, making it difficult to automatically match subsequent messages back to the initial transaction, which requires manual searching and consumes substantial computational resources.
Innovation Solution
A computer system with an electronic message processing server that generates and assigns a message unique identifier (MUI) to each message, allowing related messages to be linked and stored in a database, enabling efficient retrieval and analysis of message families.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If manual searching and matching methods are used to link related messages, then message relationships can be established, but substantial computational resources are consumed and the process is difficult and time-consuming
Solution Approach 1:
The patent applies preliminary action by embedding a unique identifier (message relationship identifier) in the initial message before it is processed and stored. This identifier is then used in subsequent messages to automatically establish relationships without requiring manual searching or matching of message contents. The relationship is predetermined and encoded in advance, eliminating the need for computationally intensive post-hoc analysis.
Solution Approach 2:
The patent introduces an intermediary element (message relationship identifier) that acts as a mediator between related messages. This identifier serves as a key or link that connects the initial message with subsequent messages (such as refunds, chargebacks, or reversals) without requiring direct comparison of message contents. The intermediary enables efficient relationship establishment by providing a direct reference point.
2Loss of information
If manual searching of message lists is performed to match subsequent messages to initial transactions, then message relationships can be identified, but the process consumes substantial computational resources and time
Solution Approach 1:
The system performs preliminary action by encoding the message relationship identifier in the initial message before storage. This allows subsequent messages to be quickly matched to the initial transaction by simply checking for the presence of the identifier, rather than performing time-consuming manual searches through message lists or analyzing message contents.
Solution Approach 2:
The patent uses copying by replicating the message relationship identifier from the initial message to subsequent related messages. This copied identifier serves as a reference link that enables fast retrieval and matching without requiring re-analysis of the original message contents or manual searching through stored message lists.
3Extent of automation
If no message relationship identification system is implemented, then system complexity is reduced, but automated matching of related messages is not possible and manual processes are required
Solution Approach 1:
The patent applies segmentation by separating the message relationship identification function from the message processing function. The message relationship identifier is extracted and embedded as a distinct element in the initial message, independent of the message content. This segmentation allows the identifier to be independently processed and used for automated matching without complicating the overall message processing system.
Solution Approach 2:
The message relationship identifier serves multiple functions: it uniquely identifies the initial transaction, links subsequent related messages (refunds, chargebacks, reversals), and enables automated matching without requiring complex processing logic. This universal identifier simplifies the system by providing a single mechanism that handles multiple relationship-establishment needs.
Data Source
AI summary
A computer system that includes a database for storing a plurality of records, and an electronic message processing server. Each of the records corresponds to a respective message received by the server. The processor is programmed to store a first record of a first message in the database, the first record including a first message relationship unique identifier (MUI) as a tag. The first MUI corresponds to a first message family. The processor is also programmed to receive a second message, and execute a matching process. The processor is further programmed to store a second record of the second message, including, in response to a match of the second message to the first record, including the first MUI as a tag, and in response to the result indicating no match, generating a second MUI for the second message and including the second MUI as the tag on the second record.