Abstract: Networks, systems and methods for event triggered trading of investment vehicles are disclosed. Orders that are conditioned upon events occurring outside a market may be submitted to an exchange. The conditional orders may be held or stored until the occurrence or non-occurrence of the event. An event data feed is provided to provide information identifying the occurrence or non-occurrence of the event. In response to receiving information via the data feed identifying the event, the orders conditioned upon the event will be triggered, matched, and executed.

Abstract: Networks, systems, and methods for event triggered trading of investment vehicles are disclosed. Orders that are conditioned upon events occurring outside a market may be submitted to an exchange. The conditional orders may be held or stored until the occurrence or non-occurrence of the event. An event data feed is provided to provide information identifying the occurrence or non-occurrence of the event. In response to receiving information via the data feed identifying the event, the orders conditioned upon the event will be triggered, matched, and executed.

Abstract: 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.

Abstract: The disclosed embodiments relate to systems/methods for low latency regulation of distributed, e.g., geographically and/or logically, transaction processing, such as trading of financial instruments, in accordance with centralized demand-based dynamically reallocated post-trade-based limits, e.g., credit/risk limits. In particular, the disclosed embodiments relate to monitoring credit demand across execution venues, as opposed to actual utilization, and, based thereon, modifying execution specific limits to reallocate of portions of a credit/risk allotment, such as a credit/risk limit, to multiple execution venues for use in approving transactions, which may implement order driven and/or quote driven markets, so as to dynamically rebalance the allocations to the execution venues based on demand/need, rather than utilization, thereby avoiding having to mitigate latencies in determining and responding to utilization.

Abstract: 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.

Abstract: A computer implemented method includes generating, by a processor associated with a first client computer, a request message; generating, by the processor, a first public token based on a first private token; augmenting, by the processor, the electronic data transaction request message with the first public token; transmitting, by the processor, the augmented electronic data transaction request message to a second client computer; generating, by the processor, a second public token based on the first public token; identifying, by the processor, from a database of result messages, a result message labeled with the second public token, the identified result message including encrypted confidential information; generating, by the processor, a second private token corresponding to the second public token used to identify the result message; and decrypting, by the processor, the encrypted confidential information with the second private token.

Abstract: A computer implemented method includes generating, by a processor associated with a first client computer, a request message; generating, by the processor, a first public token based on a first private token; augmenting, by the processor, the electronic data transaction request message with the first public token; transmitting, by the processor, the augmented electronic data transaction request message to a second client computer; generating, by the processor, a second public token based on the first public token; identifying, by the processor, from a database of result messages, a result message labeled with the second public token, the identified result message including encrypted confidential information; generating, by the processor, a second private token corresponding to the second public token used to identify the result message; and decrypting, by the processor, the encrypted confidential information with the second private token.

Abstract: A computer implemented method for operating a token management system includes: generating the first plurality of request messages; generating a first plurality of public tokens; augmenting each of the first plurality of request messages with one of the first plurality of public tokens, the augmenting resulting in a first plurality of augmented request messages; transmitting the first plurality of augmented request messages to the first plurality of market participants; generating a second plurality of public tokens based on the first plurality of public tokens; querying a database of financial messages for any financial messages including any of the second plurality of public tokens; and associating a plurality of financial messages including any of the second plurality of public tokens with each other.

Abstract: The disclosed embodiments relate to implementation of an electronic framework, also referred to as a protocol or architecture, for electronically achieving, recording and implementing, via an electronic communications network, consensus among participants for the definition, implementation and operation of an electronic transaction processing system as a precursor to the operation of that transaction processing system in processing transactions according to the consensus among the participants. The disclosed consensus framework provides a system and protocol by which new electronic transaction processing systems may be developed and implemented among participants via an electronic negotiation and implementation of the operational rules therefore. The disclosed embodiments eliminate the need for out of band consensus negotiations and provide flexibility for participants to negotiate acceptable operational rules which can support complex transactional processes in an electronic environment.

Abstract: A computer implemented method for operating a token management system includes: generating the first plurality of request messages; generating a first plurality of public tokens; augmenting each of the first plurality of request messages with one of the first plurality of public tokens, the augmenting resulting in a first plurality of augmented request messages; transmitting the first plurality of augmented request messages to the first plurality of market participants; generating a second plurality of public tokens based on the first plurality of public tokens; querying a database of financial messages for any financial messages including any of the second plurality of public tokens; and associating a plurality of financial messages including any of the second plurality of public tokens with each other.

Abstract: The disclosed embodiments relate to implementation of an electronic framework, also referred to as a protocol or architecture, for electronically achieving, recording and implementing, via an electronic communications network, consensus among participants for the definition, implementation and operation of an electronic transaction processing system as a precursor to the operation of that transaction processing system in processing transactions according to the consensus among the participants. The disclosed consensus framework provides a system and protocol by which new electronic transaction processing systems may be developed and implemented among participants via an electronic negotiation and implementation of the operational rules therefore. The disclosed embodiments eliminate the need for out of band consensus negotiations and provide flexibility for participants to negotiate acceptable operational rules which can support complex transactional processes in an electronic environment.

Abstract: An electronic trading system is configured to create speculative orders based on real orders. The speculative order differs from the real order by the price, quantity, or the type of financial instrument. The match engine chooses one or more speculative orders in an attempt to predict the next real order. Even though processing multiple trades at the same time is impossible, the use of speculative orders can permit the match engine to perform the calculations involved with the trade and generate the messages associated with the trade ahead of time. If the prediction was correct and the next order received by the match engine corresponds to one of the speculative orders, some of the matching activity has already been performed. This in effect, allows the match engine to process trades more efficiently and increases the total trading volume that can be handled by the electronic trading system.

Abstract: An electronic trading system is configured to create speculative orders based on real orders. The speculative order differs from the real order by the price, quantity, or the type of financial instrument. The match engine chooses one or more speculative orders in an attempt to predict the next real order. Even though processing multiple trades at the same time is impossible, the use of speculative orders can permit the match engine to perform the calculations involved with the trade and generate the messages associated with the trade ahead of time. If the prediction was correct and the next order received by the match engine corresponds to one of the speculative orders, some of the matching activity has already been performed. This in effect, allows the match engine to process trades more efficiently and increases the total trading volume that can be handled by the electronic trading system.

Abstract: The disclosed embodiments relate to implementation of a syntax for altering one or more rules by which a blockchain may be modified wherein the software implementing each client of a blockchain network are programmed to be responsive to requests or directives to alter one or more rules by which blocks may be added to a blockchain responsive to transactions received for storage therein, the requests/directives being processed by the client as a transaction and added to the block in accordance with the current state of the operating rules, thereby adding a new rule or modifying an existing rule for subsequent operation of the client.

Abstract: The disclosed embodiments relate to implementation of a syntax for altering one or more rules by which a blockchain may be modified wherein the software implementing each client of a blockchain network are programmed to be responsive to requests or directives to alter one or more rules by which blocks may be added to a blockchain responsive to transactions received for storage therein, the requests/directives being processed by the client as a transaction and added to the block in accordance with the current state of the operating rules, thereby adding a new rule or modifying an existing rule for subsequent operation of the client.

Abstract: A computer implemented method includes generating, by a processor associated with a first client computer, a request message; generating, by the processor, a first public token based on a first private token; augmenting, by the processor, the electronic data transaction request message with the first public token; transmitting, by the processor, the augmented electronic data transaction request message to a second client computer; generating, by the processor, a second public token based on the first public token; identifying, by the processor, from a database of result messages, a result message labeled with the second public token, the identified result message including encrypted confidential information; generating, by the processor, a second private token corresponding to the second public token used to identify the result message; and decrypting, by the processor, the encrypted confidential information with the second private token.

Abstract: 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.

Abstract: A computer implemented method for operating a token management system includes: generating the first plurality of request messages; generating a first plurality of public tokens; augmenting each of the first plurality of request messages with one of the first plurality of public tokens, the augmenting resulting in a first plurality of augmented request messages; transmitting the first plurality of augmented request messages to the first plurality of market participants; generating a second plurality of public tokens based on the first plurality of public tokens; querying a database of financial messages for any financial messages including any of the second plurality of public tokens; and associating a plurality of financial messages including any of the second plurality of public tokens with each other.

Abstract: A computer implemented method includes generating, by a processor associated with a first client computer, a request message; generating, by the processor, a first public token based on a first private token; augmenting, by the processor, the electronic data transaction request message with the first public token; transmitting, by the processor, the augmented electronic data transaction request message to a second client computer; generating, by the processor, a second public token based on the first public token; identifying, by the processor, from a database of result messages, a result message labeled with the second public token, the identified result message including encrypted confidential information; generating, by the processor, a second private token corresponding to the second public token used to identify the result message; and decrypting, by the processor, the encrypted confidential information with the second private token.

Abstract: 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.