Bilateral assertion model and ledger implementation thereof

US2025165499A1 · US · A1

Patent metadata
FieldValue
Publication numberUS-2025165499-A1
Application numberUS-202519029002-A
CountryUS
Kind codeA1
Filing dateJan 17, 2025
Priority dateApr 8, 2016
Publication dateMay 22, 2025
Grant date

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A computer implemented method for implementing a real time reconciling shared data structure is disclosed. The shared data structure may be stored in a memory, and a portion of the shared data structure may be coupled with a processor. The computer implemented method may be used for interacting with the shared data structure. The method may comprise the exchange of messages, requesting to change data in the shared data structure, between selected participants, wherein some of the participants must validate requested changes to the shared data. If all participants validate the requests to change data the changes to the data are made, and if less than all participants validate the requests then the changes are not made.

First claim

Opening claim text (preview).

What is claimed is: 1 . A computer implemented method comprising: separately storing, by a processor, in a shared data structure stored in a memory, the shared data structure comprising a plurality of sub-data structures, data indicative of transactions between each combination of a proposal participant of a plurality of participants and each of others of the plurality of participants, each sub-data structure of the plurality of sub-data structures being separate from each other; receiving, by the processor, from the proposal participant, a request data transaction message including data indicative of an intent to change data stored in a first sub-data structure of the plurality of sub-data structures; identifying, by the processor, based on the received request data transaction message, at least one interested participant of the plurality of participants to validate the intent to change the data indicative of transactions stored in the first sub-data structure; transmitting, by the processor, data indicative of a validation request thereto only to each of the identified at least one interested participant requesting that a required subset of the identified at least one interested participant validates, using one or more rules stored in the memory and related to the shared data structure, the intent to change the data in the first sub-data structure of the shared data structure, wherein the processor does not permit any uninterested participant of the plurality of participants to receive and validate the validation request; and modifying, by the processor, the first sub-data structure of the shared data structure to indicate validation is pending. 2 . The computer implemented method of claim 1 , further comprising: receiving, by the processor, from one or more of the identified at least one interested participant, data indicative of a validation response to the validation request; determining, by the processor, based on the received validation response, whether at least a required subset of the identified at least one interested participant have validated the intent to change the data in the first sub-data structure of the shared data structure; and only when the at least required subset of the identified at least one interested participant have validated the intent to change the data in the first sub-data structure of the shared data structure, modifying, by the processor, the data in the first sub-data structure of the shared data structure. 3 . The computer implemented method of claim 1 , wherein the at least one identified interested participant includes a counter party participant, the method further comprising: evaluating, by the counter party participant, the intent to change the data in the first sub-data structure according to the one or more rules to determine whether the intent to change is valid. 4 . The computer implemented method of claim 3 , wherein the one or more rules include evaluation via an external review process to determine whether the intent to change is valid. 5 . The computer implemented method of claim 3 , wherein the one or more rules include automated or manually performed evaluation, calculation, verification rules or processes to determine whether the intent to change is valid. 6 . The computer implemented method of claim 3 , wherein the intent to change relates to a calculated value, and wherein the one or more rules include recalculating the calculated value by using the same or a different calculation methodology and by determining whether the proposed value and the recalculated value are equivalent or not to determine whether the intent to change is valid. 7 . The computer implemented method of claim 3 , wherein the one or more rules include approval of any intent to change without any analysis, and wherein the validation indicates only that the counter party participant has received and is aware of the modification. 8 . The computer implemented method of claim 1 , further comprising: transmitting, by the processor, to a watcher participant of the plurality of participants, a copy of the request data transaction message, wherein the processor does not transmit the data indicative of the validation request to the watcher participant. 9 . The method of claim 8 , further comprising: reconstructing, by the watcher participant, lost transactions based on the copy of the request data transaction message. 10 . The computer implemented method of claim 1 , wherein the request data transaction message further includes data which identifies the at least one interested participant to validate the request. 11 . The computer implemented method of claim 1 , wherein the request data transaction message comprises an intent to add new data to the first sub-data structure of the shared data structure or an intent to change data previously stored in the first sub-data structure of the shared data structure. 12 . The computer implemented method of claim 1 , further comprising: receiving, by the processor, data indicative of a validation response to the validation request from one or more of the identified at least one interested participant of the plurality of participants, the validation response comprising data indicative of a confirmation of receipt by the identified at least one interested participant of the plurality of participants of the validation request, and determining, by the processor, whether the received validation response comprises data indicative of a confirmation that the data in the respective plurality of sub-data structures of the shared data structure has been modified or not by another participant of the plurality of participants; and modifying, by the processor, based on the received validation response, the respective sub-data structure of the shared data structure. 13 . A system comprising: a processor; and a memory coupled with the processor and storing computer executable instructions that when executed by the processor, cause the processor to: separately store, in a shared data structure stored in a memory, the shared data structure comprising a plurality of sub-data structures, data indicative of transactions between each combination of a proposal participant of a plurality of participants and each of others of the plurality of participants, each sub-data structure of the plurality of sub-data structures being separate from each other; receive, from the proposal participant, a request data transaction message including data indicative of an intent to change data stored in a first sub-data structure of the shared data structure; identify, based on receipt of the request data transaction message, at least one interested participant of the plurality of participants to validate the intent to change the data indicative of transactions stored in the first sub-data structure; transmit data indicative of a validation request thereto only to each of the identified at least one interested participant requesting that a required subset of the identified at least one interested participant validates, using one or more rules stored in the memory and related to the shared data structure, the intent to change the data in the first sub-data structure of the shared data structure, wherein the processor does not permit any uninterested participant of the plurality of participants to receive and validate the validation request; and modify the first sub-data structure of the shared data structure to indicate validation is pending. 14 . The system of claim 13 , wherein the computer executable instructions further cause the processor to: receive, from one or m

Assignees

Inventors

Classifications

  • Ensuring data consistency and integrity · CPC title

  • Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange · CPC title

  • Qualifying participants for shopping transactions (payment transaction verification G06Q20/401) · CPC title

  • Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor · CPC title

  • G06F16/273Primary

    Asynchronous replication or reconciliation · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US2025165499A1 cover?
A computer implemented method for implementing a real time reconciling shared data structure is disclosed. The shared data structure may be stored in a memory, and a portion of the shared data structure may be coupled with a processor. The computer implemented method may be used for interacting with the shared data structure. The method may comprise the exchange of messages, requesting to chang…
Who is the assignee on this patent?
Chicago Mercantile Exchange Inc
What technology area does this patent fall under?
Primary CPC classification G06Q30/0609. Mapped technology areas include Physics.
When was this patent published?
Publication date Thu May 22 2025 00:00:00 GMT+0000 (Coordinated Universal Time) (A1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 1 related publication on this page (citations in our corpus or others sharing the same primary CPC).